/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | blacklist.c | 33 e = e->next; 77 e->next = wpa_s->blacklist; 103 wpa_s->blacklist = e->next; 105 prev->next = e->next; 113 e = e->next; 134 e = e->next;
|
/external/libdrm/intel/ |
H A D | mm.c | 44 for (p = heap->next; p != heap; p = p->next) { 79 heap->next = block; 85 block->next = heap; 103 /* break left [p, newblock, p->next], then p = newblock */ 114 newblock->next = p->next; 116 p->next->prev = newblock; 117 p->next = newblock; 128 /* break right, also [p, newblock, p->next] */ 258 struct mem_block *next = p->next; local [all...] |
/external/syslinux/core/lwip/src/core/ |
H A D | mem.c | 156 /** index (-> ram[next]) of the next struct */ 157 mem_size_t next; member in struct:mem 243 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); 245 nmem = (struct mem *)(void *)&ram[mem->next]; 247 /* if mem->next is unused and not end of ram, combine mem and mem->next */ 251 mem->next = nmem->next; 421 mem_size_t next; local [all...] |
H A D | tcp_in.c | 182 for(pcb = tcp_active_pcbs; pcb != NULL; pcb = pcb->next) { 194 LWIP_ASSERT("tcp_input: pcb->next != pcb (before cache)", pcb->next != pcb); 196 prev->next = pcb->next; 197 pcb->next = tcp_active_pcbs; 200 LWIP_ASSERT("tcp_input: pcb->next != pcb (after cache)", pcb->next != pcb); 209 for(pcb = tcp_tw_pcbs; pcb != NULL; pcb = pcb->next) { 228 for(lpcb = tcp_listen_pcbs.listen_pcbs; lpcb != NULL; lpcb = lpcb->next) { 797 tcp_oos_insert_segment(struct tcp_seg *cseg, struct tcp_seg *next) argument 846 struct tcp_seg *next; local [all...] |
/external/libdrm/amdgpu/ |
H A D | util_hash.c | 15 * next paragraph) shall be included in all copies or substantial portions 78 struct util_node *next; member in struct:util_node 123 node->next = (struct util_node*)(*anextNode); 162 while (lastNode->next != e && lastNode->next->key == h) 163 lastNode = lastNode->next; 165 afterLastNode = lastNode->next; 168 beforeFirstNode = &(*beforeFirstNode)->next; 169 lastNode->next = *beforeFirstNode; 212 assert(*node == hash->data.e || (*node)->next); 272 struct util_node *next = cur->next; local 307 struct util_node *next; member in union:__anon10325 337 struct util_hash_iter next = {iter.hash, util_hash_data_next(iter.node)}; local 353 struct util_node *next = (*node)->next; local [all...] |
H A D | amdgpu_vamgr.c | 172 hole = container_of(mgr->va_holes.next, hole, list); 180 struct amdgpu_bo_va_hole *next; local 183 LIST_FOR_EACH_ENTRY(next, &mgr->va_holes, list) { 184 if (next->offset < va) 186 hole = next; 195 if (next != hole 196 && &next->list != &mgr->va_holes 197 && (next->offset + next->size) == va) { 198 next [all...] |
/external/google-breakpad/src/third_party/libdisasm/ |
H A D | x86_insn.c | 25 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) { 46 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) { 63 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) { 77 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) { 103 } else if ( insn->operands->next ) { 104 if ( IS_PROPER_IMM( insn->operands->next ) ) { 105 op = &insn->operands->next->op; 106 } else if ( insn->operands->next->next && 107 IS_PROPER_IMM( insn->operands->next [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_unfilled.c | 15 * next paragraph) shall be included in all copies or substantial portions 65 stage->next->point( stage->next, &tmp ); 75 stage->next->line( stage->next, &tmp ); 100 stage->next->reset_stipple_counter( stage->next ); 145 stage->next->tri( stage->next, header ); 177 stage->next [all...] |
/external/mksh/src/ |
H A D | lalloc.c | 96 ap->next = NULL; 115 while (ap->next != lp) 116 if ((ap = ap->next) == NULL) { 150 pp->next = lp->next; 161 lp->next = ap->next; 162 ap->next = lp; 175 pp->next = lp->next; [all...] |
/external/selinux/checkpolicy/ |
H A D | queue.c | 38 newnode->next = NULL; 43 q->tail->next = newnode; 62 newnode->next = NULL; 67 newnode->next = q->head; 86 q->head = q->head->next; 118 p = p->next; 138 p = p->next; 159 last->next = p->next; 160 if (last->next [all...] |
/external/syslinux/core/fs/ |
H A D | cache.c | 42 head->prev->next = head; 53 prev->next = cur; 67 cs->prev->next = cs->next; 68 cs->next->prev = cs->prev; 70 cs->next = cs->prev = NULL; 93 cs = head->next; 97 if (cs->next) { 98 cs->prev->next = cs->next; [all...] |
/external/mesa3d/src/gallium/drivers/i915/ |
H A D | i915_fpc_optimize.c | 15 * next paragraph) shall be included in all copies or substantial portions 200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next) argument 203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION && 205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate && 206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV && 207 same_dst_reg(&next->FullInstruction.Dst[0], ¤t->FullInstruction.Dst[0]) && 208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) && 209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) && 212 is_unswizzled(&next->FullInstruction.Src[0], next 282 i915_fpc_optimize_useless_mov_after_inst(union i915_full_token* current, union i915_full_token* next) argument [all...] |
/external/curl/src/ |
H A D | tool_mfiles.c | 35 (*last)->next = new; 115 struct multi_files *next; local 119 next = item->next; 121 item = next;
|
/external/e2fsprogs/lib/ss/ |
H A D | get_readline.c | 48 char *tmp, *cp, *next; local 64 for (cp = tmp; cp; cp = next) { 65 next = strchr(cp, ':'); 66 if (next) 67 *next++ = 0;
|
/external/guava/guava/src/com/google/common/base/ |
H A D | AbstractIterator.java | 40 private T next; field in class:AbstractIterator 64 next = computeNext(); 73 public final T next() { method in class:AbstractIterator 78 T result = next; 79 next = null;
|
/external/junit/src/main/java/org/junit/experimental/theories/internal/ |
H A D | ParameterizedAssertionError.java | 34 Object next = iter.next(); 35 sb.append(stringValueOf(next)); 43 private static String stringValueOf(Object next) { argument 45 return String.valueOf(next);
|
/external/libchrome/base/trace_event/ |
H A D | malloc_dump_provider.cc | 35 const AllocatorDispatch* const next = self->next; local 36 void* ptr = next->alloc_function(next, size); 43 const AllocatorDispatch* const next = self->next; local 44 void* ptr = next->alloc_zero_initialized_function(next, n, size); 53 const AllocatorDispatch* const next = self->next; local 61 const AllocatorDispatch* const next = self->next; local 72 const AllocatorDispatch* const next = self->next; local [all...] |
/external/nist-sip/java/gov/nist/javax/sip/parser/ |
H A D | ContactParser.java | 61 final char next = lexer.lookAhead(1); 62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
/external/selinux/libsepol/cil/src/ |
H A D | cil_list.c | 63 struct cil_list_item *next = NULL; local 66 next = item->next; 73 item = next; 82 new_item->next = NULL; 116 list->tail->next = item; 138 item->next = list->head; 164 item->next = curr->next; 166 curr->next [all...] |
/external/syslinux/dos/ |
H A D | free.c | 15 nah = ah->a.next; 20 pah->a.next = nah; 48 ah->a.next = nah->a.next; 49 nah->a.next->a.prev = ah;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node 116 Node<K, V> nextSibling; // the next node with the same key 226 tail.next = node; 245 node.next = nextSibling; 255 nextSibling.previous.next = node; 271 node.previous.next = node.next; 273 head = node.next; 275 if (node.next ! 318 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator 351 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator 412 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator 427 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator 451 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator 497 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node 112 Node<K, V> nextSibling; // the next node with the same key 222 tail.next = node; 241 node.next = nextSibling; 251 nextSibling.previous.next = node; 267 node.previous.next = node.next; 269 head = node.next; 271 if (node.next ! 314 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator 347 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator 408 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator 423 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator 447 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator 493 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |
/external/ImageMagick/MagickCore/ |
H A D | layer.c | 220 % with the next image in the sequence. 241 *next; 255 next=GetFirstImageInList(image); 256 bounds=next->page; 259 bounds.width=next->columns; 265 bounds.height=next->rows; 271 coalesce_image=CloneImage(next,bounds.width,bounds.height,MagickTrue, 277 coalesce_image->alpha_trait=next->alpha_trait; 284 (void) CompositeImage(coalesce_image,next,CopyCompositeOp,MagickTrue, 285 next 237 *next; local 388 *next; local 759 *next; local 1471 *next; local 1597 *next; local 1916 *next; local [all...] |
H A D | constitute.c | 387 *next; 597 for (next=image; next != (Image *) NULL; next=GetNextImageInList(next)) 610 next->taint=MagickFalse; 612 if (*magick_path == '\0' && *next->magick == '\0') 613 (void) CopyMagickString(next->magick,magick,MagickPathExtent); 614 (void) CopyMagickString(next->magick_filename,magick_filename, 617 (void) CopyMagickString(next 382 *next; local 1288 *next; local [all...] |
/external/doclava/test/doclava/ |
H A D | ApiCheckTest.java | 52 assertEquals(Errors.CHANGED_TYPE, report.errors().iterator().next().error()); 62 ErrorMessage m1 = errors.next(); 63 ErrorMessage m2 = errors.next(); 75 ErrorMessage m1 = errors.next(); 76 ErrorMessage m2 = errors.next(); 87 assertEquals(Errors.ADDED_CLASS, report.errors().iterator().next().error()); 95 assertEquals(Errors.REMOVED_CLASS, report.errors().iterator().next().error()); 103 assertEquals(Errors.REMOVED_DEPRECATED_CLASS, report.errors().iterator().next().error()); 111 assertEquals(Errors.CHANGED_SUPERCLASS, report.errors().iterator().next().error()); 133 assertEquals(Errors.ADDED_INTERFACE, report.errors().iterator().next() [all...] |