Home
last modified time | relevance | path

Searched refs:next (Results 51 - 75 of 5887) sorted by relevance

12345678910>>...236

/base/security/huks/utils/list/
H A Dhks_double_list.c29 node->next = node; in InitializeDoubleList()
38 if (head->next == NULL) { in AddNodeAfterDoubleListHead()
39 head->next = head; in AddNodeAfterDoubleListHead()
42 head->next->prev = node; in AddNodeAfterDoubleListHead()
43 node->next = head->next; in AddNodeAfterDoubleListHead()
45 head->next = node; in AddNodeAfterDoubleListHead()
58 head->prev->next = node; in AddNodeAtDoubleListTail()
59 node->next = head; in AddNodeAtDoubleListTail()
70 if (node->next ! in RemoveDoubleListNode()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/
H A Dlist.h16 struct dl_list *next; member
24 list->next = list; in dl_list_init()
30 item->next = list->next; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
43 item->next->prev = item->prev; in dl_list_del()
44 item->prev->next = item->next; in dl_list_del()
45 item->next in dl_list_del()
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_build_ast.c76 for (curr = current; curr != NULL; curr = curr->next) { in cil_fill_list()
220 key = parse_current->next->data; in cil_gen_block()
293 inherit->block_str = parse_current->next->data; in cil_gen_blockinherit()
355 abstract->block_str = parse_current->next->data; in cil_gen_blockabstract()
406 if (parse_current->next->next->data) { in cil_gen_in()
407 char *is_after_str = parse_current->next->data; in cil_gen_in()
417 in->block_str = parse_current->next->next->data; in cil_gen_in()
420 in->block_str = parse_current->next in cil_gen_in()
1374 struct cil_list_item *next = NULL; cil_destroy_userattribute() local
2014 struct cil_list_item *next = expr->next; cil_destroy_roleattribute() local
2453 struct cil_list_item *next = expr->next; cil_destroy_typeattribute() local
2879 struct cil_tree_node *next = NULL; cil_gen_boolif() local
2947 struct cil_tree_node *next = NULL; cil_gen_tunif() local
[all...]
/third_party/elfutils/libdw/
H A Ddwarf_get_units.c87 Dwarf_CU *next = (*next_cu); in dwarf_get_units()
90 *version = next->version; in dwarf_get_units()
93 *unit_type = next->unit_type; in dwarf_get_units()
97 if (next->version >= 2 && next->version <= 5 in dwarf_get_units()
98 && next->unit_type >= DW_UT_compile in dwarf_get_units()
99 && next->unit_type <= DW_UT_split_type) in dwarf_get_units()
100 *cudie = CUDIE (next); in dwarf_get_units()
107 if (next->version >= 2 && next in dwarf_get_units()
[all...]
/base/startup/init/services/utils/
H A Dlist.c34 node->next = node; in OH_ListInit()
50 item->next = head; in OH_ListAddTail()
52 head->prev->next = item; in OH_ListAddTail()
68 item->next->prev = item->prev; in OH_ListRemove()
69 item->prev->next = item->next; in OH_ListRemove()
91 match = head->next; in OH_ListAddWithOrder()
96 match = match->next; in OH_ListAddWithOrder()
103 item->next = match; in OH_ListAddWithOrder()
105 match->prev->next in OH_ListAddWithOrder()
155 ListNode *next; OH_ListTraversal() local
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dllist.h34 t *next, *prev
47 _item->prev = _item->next = NULL; \
55 if ((_item->next = *_head)) \
56 _item->next->prev = _item; \
66 if (_item->next) \
67 _item->next->prev = _item->prev; \
69 _item->prev->next = _item->next; \
72 *_head = _item->next; \
74 _item->next
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/
H A Dlist.h16 struct dl_list *next; member
24 list->next = list; in dl_list_init()
30 item->next = list->next; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
43 item->next->prev = item->prev; in dl_list_del()
44 item->prev->next = item->next; in dl_list_del()
45 item->next in dl_list_del()
[all...]
/third_party/skia/src/pathops/
H A DSkOpSpan.cpp22 while ((ptT = ptT->next()) != stopPtT) { in active()
34 while ((ptT = ptT->next()) != stopPtT) { in contains()
46 while ((ptT = ptT->next()) != stopPtT) { in contains()
57 while ((ptT = ptT->next()) != stopPtT) { in contains()
69 while ((ptT = ptT->next()) != stopPtT) { in contains()
130 SkOpPtT* next = this; in prev() local
131 while ((next = next->fNext) != this) { in prev()
132 result = next; in prev()
171 while ((walk = walk->next()) ! in collapsed()
220 const SkOpSpanBase* next = this; containsCoinEnd() local
265 SkOpPtT* next = remainder->next(); merge() local
383 const SkOpSpan* next = fCoincident; containsCoincidence() local
411 SkOpPtT* next = &fPtT; insertCoincidence() local
446 SkOpSpanBase* next = this->next(); release() local
[all...]
/third_party/lwip/src/core/
H A Dmem.c350 /** index (-> ram[next]) of the next struct */
351 mem_size_t next; member
484 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); in plug_holes()
486 nmem = ptr_to_mem(mem->next); in plug_holes()
488 /* if mem->next is unused and not end of ram, combine mem and mem->next */ in plug_holes()
492 mem->next = nmem->next; in plug_holes()
756 mem_size_t next; mem_trim() local
[all...]
H A Dtcp_in.c195 /* TCP header fits into first pbuf, options don't - data is in the next pbuf */
196 /* there must be a next pbuf, due to hdrlen_bytes sanity check above */
197 LWIP_ASSERT("p->next != NULL", p->next != NULL);
206 /* options continue in the next pbuf: set p to zero length and hide the
207 options in the next pbuf (adjusting p->tot_len) */
211 if (opt2len > p->next->len) {
213 LWIP_DEBUGF(TCP_INPUT_DEBUG, ("tcp_input: options overflow second pbuf (%"U16_F" bytes)\n", p->next->len));
219 tcphdr_opt2 = (u8_t *)p->next->payload;
221 /* advance p->next t
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dexpression.c77 token = compound_statement(token->next, stmt); in parens_expression()
90 struct token *next = primary_expression(token, expr); in string_expression() local
96 return next; in string_expression()
167 token = token->next; in builtin_types_compatible_p_expr()
171 token = token->next; in builtin_types_compatible_p_expr()
176 token = token->next; in builtin_types_compatible_p_expr()
181 token = token->next; in builtin_types_compatible_p_expr()
195 token = token->next; in builtin_offsetof_expr()
199 token = token->next; in builtin_offsetof_expr()
224 token = token->next; in builtin_offsetof_expr()
453 struct token *next = token->next; primary_expression() local
696 struct token *next; unary_expression() local
714 struct token *next; unary_expression() local
760 struct token *next = token->next; cast_expression() local
943 struct token *next = token->next; assignment_expression() local
[all...]
/third_party/skia/src/utils/
H A DSkNWayCanvas.cpp43 bool next() { in next() function in SkNWayCanvas::Iter
61 while (iter.next()) { in willSave()
70 while (iter.next()) { in getSaveLayerStrategy()
81 while (iter.next()) { in onDoSaveBehind()
90 while (iter.next()) { in willRestore()
98 while (iter.next()) { in onMarkCTM()
106 while (iter.next()) { in didConcat44()
113 while (iter.next()) { in didSetM44()
120 while (iter.next()) { in didTranslate()
127 while (iter.next()) { in didScale()
[all...]
/third_party/musl/src/search/
H A Dinsque.c4 struct node *next; member
14 e->next = e->prev = 0; in insque()
17 e->next = p->next; in insque()
19 p->next = e; in insque()
20 if (e->next) in insque()
21 e->next->prev = e; in insque()
28 if (e->next) in remque()
29 e->next->prev = e->prev; in remque()
31 e->prev->next in remque()
[all...]
/third_party/backends/backend/
H A Dhp-hpmem.c59 Alloc * next; member
77 (new->next = head->next)->prev = new; in sanei_hp_alloc()
78 (new->prev = head)->next = new; in sanei_hp_alloc()
119 (new->prev = copy.prev)->next = (new->next = copy.next)->prev = new; in sanei_hp_realloc()
132 (old->next->prev = old->prev)->next = old->next; in sanei_hp_free()
141 Alloc * next; sanei_hp_free_all() local
[all...]
/third_party/jerryscript/tests/jerry/es2015/
H A Dgenerator-yield-iterator.js29 check_result(g.next(), 1, false)
30 check_result(g.next(), 2, false)
31 check_result(g.next(), 3, false)
32 check_result(g.next(), 4, false)
33 check_result(g.next(), 5, false)
34 check_result(g.next(), undefined, true)
42 g.next()
67 check_result(g.next(), 5, false)
76 function next(arg)
94 var o = { [Symbol.iterator]() { return { next } } }
[all...]
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c75 r->next = heap->next; in nouveau_heap_alloc()
76 if (heap->next) in nouveau_heap_alloc()
77 heap->next->prev = r; in nouveau_heap_alloc()
79 heap->next = r; in nouveau_heap_alloc()
85 heap = heap->next; in nouveau_heap_alloc()
103 if (r->next && !r->next->in_use) { in nouveau_heap_free()
104 struct nouveau_heap *new = r->next; in nouveau_heap_free()
108 r->prev->next in nouveau_heap_free()
[all...]
/third_party/mesa3d/src/util/
H A Du_mm.c44 for (p = heap->next; p != heap; p = p->next) { in u_mmDumpMemInfo()
87 heap->next = block; in u_mmInit()
93 block->next = heap; in u_mmInit()
113 /* break left [p, newblock, p->next], then p = newblock */ in SliceBlock()
123 newblock->next = p->next; in SliceBlock()
125 p->next->prev = newblock; in SliceBlock()
126 p->next = newblock; in SliceBlock()
137 /* break right, also [p, newblock, p->next] */ in SliceBlock()
293 struct mem_block *next = p->next; u_mmDestroy() local
[all...]
/third_party/mesa3d/src/gallium/drivers/i915/
H A Di915_fpc_optimize.c15 * next paragraph) shall be included in all copies or substantial portions
399 union i915_full_token *next = &tokens->Tokens[index]; in i915_fpc_optimize_mov_before_tex() local
402 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION && in i915_fpc_optimize_mov_before_tex()
404 op_is_texture(next->FullInstruction.Instruction.Opcode) && in i915_fpc_optimize_mov_before_tex()
405 target_is_texture2d(next->FullInstruction.Texture.Texture) && in i915_fpc_optimize_mov_before_tex()
406 same_src_dst_reg(&next->FullInstruction.Src[0], in i915_fpc_optimize_mov_before_tex()
408 is_unswizzled(&current->FullInstruction.Src[0], i915_tex_mask(next)) && in i915_fpc_optimize_mov_before_tex()
410 memcpy(&next->FullInstruction.Src[0], &current->FullInstruction.Src[0], in i915_fpc_optimize_mov_before_tex()
426 union i915_full_token *next) in i915_fpc_optimize_mov_after_mov()
433 next in i915_fpc_optimize_mov_after_mov()
425 i915_fpc_optimize_mov_after_mov(union i915_full_token *current, union i915_full_token *next) i915_fpc_optimize_mov_after_mov() argument
486 i915_fpc_optimize_mov_after_alu(union i915_full_token *current, union i915_full_token *next) i915_fpc_optimize_mov_after_alu() argument
593 union i915_full_token *next = &tokens->Tokens[index]; i915_fpc_optimize_useless_mov_after_inst() local
[all...]
/third_party/selinux/libsepol/src/
H A Debitmap.c37 n1 = n1->next; in ebitmap_or()
38 n2 = n2->next; in ebitmap_or()
42 n1 = n1->next; in ebitmap_or()
46 n2 = n2->next; in ebitmap_or()
49 new->next = 0; in ebitmap_or()
51 prev->next = new; in ebitmap_or()
93 new->next = NULL; in ebitmap_and()
96 prev->next = new; in ebitmap_and()
102 n1 = n1->next; in ebitmap_and()
103 n2 = n2->next; in ebitmap_and()
[all...]
/third_party/ntfs-3g/libntfs-3g/
H A Dcache.c76 cache->free_hash = link->next; in inserthashindex()
79 link->next = first; in inserthashindex()
81 link->next = NULL; in inserthashindex()
116 link = link->next; in drophashindex()
120 previous->next = link->next; in drophashindex()
122 cache->first_hash[hash] = link->next; in drophashindex()
123 link->next = cache->free_hash; in drophashindex()
165 link = link->next; in ntfs_fetch_cache()
177 current = current->next; in ntfs_fetch_cache()
379 struct CACHED_GENERIC *next; ntfs_invalidate_cache() local
[all...]
/third_party/ffmpeg/libavcodec/
H A Dsipr_parser.c32 int next; in sipr_split() local
38 case 37: next = avctx->block_align; break; in sipr_split()
40 if (avctx->bit_rate > 12200) next = 20; in sipr_split()
41 else if (avctx->bit_rate > 7500 ) next = 19; in sipr_split()
42 else if (avctx->bit_rate > 5750 ) next = 29; in sipr_split()
43 else next = 37; in sipr_split()
46 return FFMIN(next, buf_size); in sipr_split()
55 int next; in sipr_parse() local
57 next = sipr_split(avctx, buf, buf_size); in sipr_parse()
58 if (ff_combine_frame(pc, next, in sipr_parse()
[all...]
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcmru.c51 cnode = cnode->next; in FTC_MruNode_Prepend()
58 last->next = node; in FTC_MruNode_Prepend()
59 node->next = first; in FTC_MruNode_Prepend()
64 node->next = node; in FTC_MruNode_Prepend()
82 FTC_MruNode prev, next, last; in FTC_MruNode_Up() local
92 cnode = cnode->next; in FTC_MruNode_Up()
102 next = node->next; in FTC_MruNode_Up()
104 prev->next = next; in FTC_MruNode_Up()
125 FTC_MruNode prev, next; FTC_MruNode_Remove() local
330 FTC_MruNode first, node, next; FTC_MruList_RemoveSelection() local
[all...]
/third_party/skia/third_party/externals/oboe/tests/
H A DtestStreamWaitState.cpp59 StreamState next = StreamState::Unknown; in checkWaitZeroTimeout() local
61 Result result = mStream->waitForStateChange(mStream->getState(), &next, timeout); in checkWaitZeroTimeout()
66 StreamState next = StreamState::Unknown; in checkStopWhileWaiting() local
69 r = mStream->waitForStateChange(StreamState::Starting, &next, kTimeoutInNanos); in checkStopWhileWaiting()
71 EXPECT_EQ(next, StreamState::Started) << "next = " << convertToText(next); in checkStopWhileWaiting()
79 r = mStream->waitForStateChange(StreamState::Started, &next, 1000 * kNanosPerMillisecond); in checkStopWhileWaiting()
83 if (next == StreamState::Stopping) { in checkStopWhileWaiting()
84 r = mStream->waitForStateChange(StreamState::Stopping, &next, 100 in checkStopWhileWaiting()
91 StreamState next = StreamState::Unknown; checkCloseWhileWaiting() local
[all...]
/third_party/toybox/lib/
H A Dllist.c3 * Linked list structures have a next pointer as their first element.
48 void **next = (void **)*llist; in llist_pop() local
49 *llist = *next; in llist_pop()
51 return (void *)next; in llist_pop()
60 if (dlist->next == dlist) *pdlist = 0; in dlist_pop()
62 if (dlist->next) dlist->next->prev = dlist->prev; in dlist_pop()
63 if (dlist->prev) dlist->prev->next = dlist->next; in dlist_pop()
64 *pdlist = dlist->next; in dlist_pop()
[all...]
/third_party/skia/tests/
H A DPathOpsDebug.cpp363 } while ((contour = contour->next())); in dumpContours()
370 } while ((contour = contour->next())); in dumpContoursAll()
377 } while ((contour = contour->next())); in dumpContoursAngles()
384 } while ((contour = contour->next())); in dumpContoursPts()
391 } while ((contour = contour->next())); in dumpContoursPt()
398 } while ((contour = contour->next())); in dumpContoursSegment()
405 } while ((contour = contour->next())); in dumpContoursSpan()
412 } while ((contour = contour->next())); in dumpContoursSpans()
546 SkDebugf("] next="); in dumpOne()
578 const SkOpAngle* next in dumpTo() local
599 const SkOpAngle* next = this; dumpCurves() local
608 const SkOpAngle* next = this; dumpLoop() local
618 const SkOpAngle* next = this; dumpTest() local
674 const SkOpPtT* next = this; dumpAll() local
1308 const SkTSpanBounded* next = testBounded->fNext; dumpAll() local
1325 const SkTSpanBounded* next = testBounded->fNext; dump() local
[all...]

Completed in 21 milliseconds

12345678910>>...236