Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 500) sorted by relevance

12345678910>>...20

/device/google/contexthub/firmware/os/inc/
Dlist.h24 struct link_t *prev, *next; member
28 for ((cur_link) = (list)->next, \
29 (tmp_link) = (cur_link) ? (cur_link)->next : NULL; \
31 (cur_link) = (tmp_link), (tmp_link) = (cur_link)->next)
34 link_t list = { .prev = &list, .next = &list }
38 list->prev = list->next = list; in list_init()
43 if (!list->next) in list_add_tail()
47 item->next = list; in list_add_tail()
48 list->prev->next = item; in list_add_tail()
54 item->prev->next = item->next; in list_delete()
[all …]
/device/google/marlin/camera/QCamera2/stack/common/
Dcam_list.h44 struct cam_list *next, *prev; member
49 ptr->next = ptr; in cam_list_init()
59 item->next = head; in cam_list_add_tail_node()
61 prev->next = item; in cam_list_add_tail_node()
67 item->next = node; in cam_list_insert_before_node()
69 item->prev->next = item; in cam_list_insert_before_node()
76 struct cam_list *next = ptr->next; in cam_list_del_node() local
78 next->prev = ptr->prev; in cam_list_del_node()
79 prev->next = ptr->next; in cam_list_del_node()
80 ptr->next = ptr; in cam_list_del_node()
/device/google/marlin/power/
Dlist.c61 new_node->next = head->next; in add_list_node()
64 head->next = new_node; in add_list_node()
71 return (head == NULL || head->next == NULL); in is_list_empty()
82 if (head == NULL || head->next == NULL) { in remove_list_node()
86 current_node = head->next; in remove_list_node()
91 current_node = current_node->next; in remove_list_node()
96 saved_node->next = current_node->next; in remove_list_node()
119 while ((current_node = current_node->next)) { in dump_list()
133 while ((current_node = current_node->next)) { in find_node()
/device/linaro/bootloader/edk2/StdLib/LibC/StdLib/
DRand.c36 static UINT32 next = 1; variable
53 if (next == 0) in rand()
54 next = 123459876; in rand()
55 hi = next / 127773; in rand()
56 lo = next % 127773; in rand()
60 return ((next = x) % ((UINT32)RAND_MAX + 1)); in rand()
66 next = (UINT32)seed; in srand()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
Drotatingtree.c66 rotating_node_t *next; in RotatingTree_Get() local
75 next = node->left; in RotatingTree_Get()
76 if (next == NULL) in RotatingTree_Get()
79 node->left = next->right; in RotatingTree_Get()
80 next->right = node; in RotatingTree_Get()
81 *pnode = next; in RotatingTree_Get()
87 next = node->right; in RotatingTree_Get()
88 if (next == NULL) in RotatingTree_Get()
91 node->right = next->left; in RotatingTree_Get()
92 next->left = node; in RotatingTree_Get()
[all …]
/device/google/contexthub/firmware/os/core/
DeventQ.c30 for (pos = (head)->next; tmp = (pos)->next, (pos) != (head); pos = (tmp))
34 struct EvtList *next; member
51 static inline void __evtListDel(struct EvtList *prev, struct EvtList *next) in __evtListDel() argument
53 next->prev = prev; in __evtListDel()
54 prev->next = next; in __evtListDel()
59 __evtListDel(entry->prev, entry->next); in evtListDel()
60 entry->next = entry->prev = NULL; in evtListDel()
72 q->head.next = &q->head; in evtQueueAlloc()
116 for (pos = q->head.next; pos != &q->head; pos = pos->next) { in evtQueueEnqueue()
132 item->prev = item->next = NULL; in evtQueueEnqueue()
[all …]
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
DATokenBuffer.cpp65 next = &buffer[0]; in ANTLRTokenBuffer()
117 if( next > threshold ) in getToken()
126 if ( next > end_of_buffer ) in getToken()
134 *next = getANTLRToken(); in getToken()
135 (*next)->ref(); // say we have a copy of this pointer in buffer in getToken()
136 last = next; in getToken()
137 next++; in getToken()
192 if ( next > end_of_buffer ) // buffer overflow? in bufferedToken()
196 *next = getANTLRToken(); in bufferedToken()
197 (*next)->ref(); // say we have a copy of this pointer in buffer in bufferedToken()
[all …]
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/
Dst.c23 st_table_entry *next; member
205 register st_table_entry *ptr, *next; local
211 next = ptr->next;
213 ptr = next;
234 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\
235 ptr = ptr->next;\
237 ptr = ptr->next;\
278 entry->next = table->bins[bin_pos];\
322 register st_table_entry *ptr, *next, **new_bins; local
335 next = ptr->next;
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/xml/etree/
DElementPath.py96 def prepare_child(next, token): argument
105 def prepare_star(next, token): argument
112 def prepare_self(next, token): argument
118 def prepare_descendant(next, token): argument
119 token = next()
133 def prepare_parent(next, token): argument
146 def prepare_predicate(next, token): argument
153 token = next()
258 next = iter(xpath_tokenizer(path, namespaces)).next
259 token = next()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/xml/etree/
DElementPath.py96 def prepare_child(next, token): argument
105 def prepare_star(next, token): argument
112 def prepare_self(next, token): argument
118 def prepare_descendant(next, token): argument
119 token = next()
133 def prepare_parent(next, token): argument
146 def prepare_predicate(next, token): argument
153 token = next()
258 next = iter(xpath_tokenizer(path, namespaces)).next
259 token = next()
[all …]
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
DATokenBuffer.cpp67 next = &buffer[0]; in ANTLRTokenBuffer()
118 if( next > threshold ) in getToken()
127 if ( next > end_of_buffer ) in getToken()
135 *next = getANTLRToken(); in getToken()
136 (*next)->ref(); // say we have a copy of this pointer in buffer in getToken()
137 last = next; in getToken()
138 next++; in getToken()
193 if ( next > end_of_buffer ) // buffer overflow? in bufferedToken()
197 *next = getANTLRToken(); in bufferedToken()
198 (*next)->ref(); // say we have a copy of this pointer in buffer in bufferedToken()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/pgen2/
Dconv.py121 lineno, line = lineno+1, f.next()
123 lineno, line = lineno+1, f.next()
127 lineno, line = lineno+1, f.next()
138 lineno, line = lineno+1, f.next()
143 lineno, line = lineno+1, f.next()
146 lineno, line = lineno+1, f.next()
153 lineno, line = lineno+1, f.next()
161 lineno, line = lineno+1, f.next()
163 lineno, line = lineno+1, f.next()
172 lineno, line = lineno+1, f.next()
[all …]
Dpgen.py42 for label, next in state.arcs.iteritems():
43 arcs.append((self.make_label(c, label), dfa.index(next)))
121 for label, next in state.arcs.iteritems():
185 for label, next in state.arcs:
187 addclosure(next, base)
192 for label, next in nfastate.arcs:
194 addclosure(next, arcs.setdefault(label, {}))
210 for label, next in state.arcs:
211 if next in todo:
212 j = todo.index(next)
[all …]
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Ddumpnode.c307 result=( (RuleRefNode *)p )->next;
309 result=( (ActionNode *)p )->next;
311 result=( (TokNode *)p )->next;
327 Node *next; local
332 for (next=p; next != NULL && !isEndRule(next) ; ) {
334 if (next->ntype == nJunction) {
335 next=dp1(next);
337 next=dn(next);
352 Node *next; local
357 for (next=p; next != NULL && !isEndRule(next) ; ) {
[all …]
Dfcache.c69 q = q->next;
111 CacheEntry *next; in DumpFcache() local
116 next=dumpFcache1(prev); in DumpFcache()
117 if (next == NULL) break; in DumpFcache()
118 reportFcache(next); in DumpFcache()
120 prev=next->str; in DumpFcache()
/device/google/cuttlefish_common/guest/hals/ril/libril/
Dril_event.cpp82 dlog(" next = %x", (unsigned int)ev->next); in dump_event()
107 list->next = list; in init_list()
114 ev->next = list; in addToList()
116 ev->prev->next = ev; in addToList()
126 ev->next->prev = ev->prev; in removeFromList()
127 ev->prev->next = ev->next; in removeFromList()
128 ev->next = NULL; in removeFromList()
163 struct ril_event * tev = timer_list.next; in processTimeouts()
164 struct ril_event * next; in processTimeouts() local
173 next = tev->next; in processTimeouts()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/
Dllex.c28 #define next(ls) (ls->current = zgetc(ls->z)) macro
46 #define save_and_next(ls) (save(ls, ls->current), next(ls))
151 next(ls); /* skip `\n' or `\r' */ in inclinenumber()
153 next(ls); /* skip `\n\r' or `\r\n' */ in inclinenumber()
295 else next(ls); in read_long_string()
320 c[i] = next(ls); in readhexaesc()
335 next(ls); in readdecesc()
356 next(ls); /* do not save the `\' */ in read_string()
372 next(ls); /* skip the 'z' */ in read_string()
375 else next(ls); in read_string()
[all …]
Dlfunc.c61 pp = &p->next; in luaF_findupval()
67 uv->u.l.next = g->uvhead.u.l.next; in luaF_findupval()
68 uv->u.l.next->u.l.prev = uv; in luaF_findupval()
69 g->uvhead.u.l.next = uv; in luaF_findupval()
70 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in luaF_findupval()
76 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in unlinkupval()
77 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ in unlinkupval()
78 uv->u.l.prev->u.l.next = uv->u.l.next; in unlinkupval()
95 L->openupval = uv->next; /* remove from `open' list */ in luaF_close()
102 gch(o)->next = g->allgc; /* link upvalue into 'allgc' list */ in luaF_close()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
Dtest_old_mailbox.py69 self.assertTrue(self.mbox.next() is None)
70 self.assertTrue(self.mbox.next() is None)
76 self.assertTrue(self.mbox.next() is not None)
77 self.assertTrue(self.mbox.next() is None)
78 self.assertTrue(self.mbox.next() is None)
84 self.assertTrue(self.mbox.next() is not None)
85 self.assertTrue(self.mbox.next() is None)
86 self.assertTrue(self.mbox.next() is None)
93 self.assertTrue(self.mbox.next() is not None)
94 self.assertTrue(self.mbox.next() is not None)
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/
Dthread.c225 struct key *next; member
270 for (p = keyhead; p != NULL; p = p->next) { in find_key()
280 if (p->next == keyhead) in find_key()
292 p->next = keyhead; in find_key()
325 *q = p->next; in PyThread_delete_key()
330 q = &p->next; in PyThread_delete_key()
379 *q = p->next; in PyThread_delete_key_value()
385 q = &p->next; in PyThread_delete_key_value()
412 *q = p->next; in PyThread_ReInitTLS()
417 q = &p->next; in PyThread_ReInitTLS()
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/
Dsorlist.c63 if ( list== *cursor ) { *cursor = (*cursor)->next; }
65 (*cursor) = (*cursor)->next;
96 sentinel->next = p;
102 tail->next = p;
118 for (p = list->next; p!=NULL; p=q)
120 q = p->next;
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/
Drexpr.c79 static void next( void );
96 static void next();
133 next();
160 for (p=automaton->arcs; p!=NULL; p=p->next) /* try all arcs */
197 next();
257 if ( token == '~' ) {complement = 1; next();}
259 next();
263 next();
269 next();
272 next();
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/
Dcache.c45 node->next = NULL; in pysqlite_new_node()
104 node = node->next; in pysqlite_cache_dealloc()
140 if (node->next) { in pysqlite_cache_get()
141 node->next->prev = node->prev; in pysqlite_cache_get()
146 node->prev->next = node->next; in pysqlite_cache_get()
149 ptr->prev->next = node; in pysqlite_cache_get()
154 node->next = ptr; in pysqlite_cache_get()
175 node->prev->next = NULL; in pysqlite_cache_get()
204 self->last->next = node; in pysqlite_cache_get()
234 if (ptr->next) { in pysqlite_cache_display()
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
Dinfback.c84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next = Z_NULL; \
[all …]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
Dinfback.c93 static code *next; local
101 next = fixed;
102 lenfix = next;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
109 distfix = next;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
132 next = strm->next_in; \
143 strm->next_in = next; \
161 have = in(in_desc, &next); \
163 next = Z_NULL; \
[all …]

12345678910>>...20