HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 1451 - 1475 of 3921) sorted by null

<<51525354555657585960>>

  /external/kernel-headers/original/linux/
binfmts.h 56 struct linux_binfmt * next; member in struct:linux_binfmt
msg.h 72 struct msg_msgseg* next; member in struct:msg_msg
notifier.h 37 struct notifier_block *next; member in struct:notifier_block
personality.h 104 struct exec_domain *next; /* linked list (internal) */ member in struct:exec_domain
rcupdate.h 47 * @next: next update requests in a list
51 struct rcu_head *next; member in struct:rcu_head
55 #define RCU_HEAD_INIT { .next = NULL, .func = NULL }
58 (ptr)->next = NULL; (ptr)->func = NULL; \
67 int next_pending; /* Is the next batch already waiting? */
  /external/libmtp/src/
playlist-spl.c 60 struct text_struct *next; // Link to next line, NULL if end of list member in struct:text_struct
229 f->next = NULL;
402 tail->next = malloc(sizeof(text_t));
403 tail = tail->next;
434 // set the next pointer at the end
437 tail->next = NULL;
497 // advance to the next line
498 p = p->next;
515 p = p->next;
    [all...]
  /external/libppp/src/
cbcp.c 260 char list[sizeof cbcp->fsm.phone], *next; local
282 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) {
283 len = strlen(next);
287 strncpy(addr->addr, next, sizeof addr->addr - 1);
292 next);
427 char list[sizeof cbcp->fsm.phone], *next; local
431 for (next = strtok(list, ","); next; next = strtok(NULL, ",")
448 char list[sizeof cbcp->fsm.phone], *next, *end; local
554 char list[sizeof cbcp->fsm.phone], *next; local
    [all...]
ccp.c 187 o = &(*o)->next;
364 for (o = &ccp->out.opt; *o != NULL; o = &(*o)->next)
376 (*o)->next = NULL;
392 o = &(*o)->next;
447 struct ccp_opt *next; local
463 next = ccp->out.opt->next;
465 ccp->out.opt = next;
475 struct ccp_opt *next; local
484 next = ccp->out.opt->next
    [all...]
datalink.h 79 int next_timeout; /* Redial next timeout value */
94 char *next; /* Next phone from the list */ member in struct:datalink::__anon21040
122 struct datalink *next; /* Next in the list */ member in struct:datalink
lcp.c 604 char list[sizeof cb->msg], *next; local
612 for (next = strtok(list, ","); next; next = strtok(NULL, ",")) {
613 len = strlen(next);
694 /* Ignore his previous reject so that we REQ next time */
    [all...]
mbuf.c 54 struct mbucket *next; member in struct:mfree
128 *mb = (*mb)->u.f.next;
132 (*mb)->u.f.next = NULL;
148 (*mb)->u.f.next = NULL;
176 f->u.f.next = *mb;
  /external/libsepol/src/
mls.c 618 for (rtr = policydb->range_tr; rtr; rtr = rtr->next) {
727 mls_semantic_cat_t *cur, *next; local
732 next = l->cat;
733 while (next) {
734 cur = next;
735 next = cur->next;
757 lnewcat->next = newcat;
765 cat = cat->next;
  /external/libvorbis/include/vorbis/
codec.h 129 struct alloc_chain *next; member in struct:alloc_chain
  /external/libvorbis/lib/
block.c 120 link->next=vb->reap;
141 struct alloc_chain *next=reap->next; local
145 reap=next;
522 the next block on which to continue analysis */
539 the next boundary so we can determine nW (the next window size)
564 /* center of next block + next block maximum right side. */
954 *next* block *
    [all...]
  /external/libvorbis/vq/
bookutil.c 128 /* read the next numerical value from the given file */
132 char *next; local
136 *value=strtod(value_line_buff, &next);
137 if(next==value_line_buff){
141 value_line_buff=next;
  /external/libxml2/
list.c 33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)->prev = lkNew
430 xmlLinkPtr next = lk->next; local
    [all...]
threads.c 622 struct _xmlGlobalStateCleanupHelperParams *next; member in struct:_xmlGlobalStateCleanupHelperParams
721 p->next = cleanup_helpers_head;
927 p = p->next;
1019 cleanup_helpers_head = p->next;
1021 p->prev->next = p->next;
1022 if (p->next != NULL)
1023 p->next->prev = p->prev;
  /external/libxslt/libxslt/
attributes.c 88 struct _xsltAttrElem *next;/* chained list */ member in struct:_xsltAttrElem
142 xsltAttrElemPtr next; local
145 next = list->next;
147 list = next;
167 xsltAttrElemPtr next, cur; local
175 next = cur->next;
178 if (cur->next == NULL) {
179 cur->next = xsltNewAttrElem(attr)
    [all...]
preproc.c 367 cur->next = style->preComps;
1936 xsltElemPreCompPtr cur, next; local
    [all...]
  /external/linux-tools-perf/
builtin-test.c 139 * set that by using the next symbol start - 1,
158 struct symbol *next = rb_entry(nnd, struct symbol, rb_node); local
160 if (next->start == sym->start) {
161 pair = next;
  /external/linux-tools-perf/scripts/python/
sched-migration.py 102 def sched_switch(self, prev, prev_state, next):
105 if taskState(prev_state) == "R" and next in self.tasks \
119 if next not in next_tasks:
120 next_tasks.append(next)
177 def sched_switch(self, ts_list, prev, prev_state, next, cpu):
179 new_rq = old_rq.sched_switch(prev, prev_state, next)
222 def next(self, t): member in class:TimeSlice
234 slice = self.data[-1].next(ts)
339 print "Sched switch event rejected ts: %s cpu: %d prev: %s(%d) next: %s(%d)" % \
  /external/linux-tools-perf/util/
callchain.c 32 #define chain_for_each_child_safe(child, next, parent) \
33 list_for_each_entry_safe(child, next, &parent->children, siblings)
185 struct callchain_node *next; local
190 chain_for_each_child(next, new)
191 next->parent = new;
266 new->val.next = &to_split->list;
269 old_tail->next = &new->val;
458 cursor->last = &node->next;
callchain.h 69 struct callchain_cursor_node *next; member in struct:callchain_cursor_node
139 cursor->curr = cursor->curr->next;
event.c 64 struct dirent dirent, *next; local
126 while (!readdir_r(tasks, &dirent, &next) && next) {
330 struct dirent dirent, *next; local
346 while (!readdir_r(proc, &dirent, &next) && next) {
  /external/linux-tools-perf/util/ui/browsers/
annotate.c 75 struct objdump_line *next; local
77 next = objdump__get_next_ip_line(&notes->src->source, self);
79 (next == NULL || offset < next->offset)) {

Completed in 253 milliseconds

<<51525354555657585960>>