Searched refs:next (Results 1 - 25 of 4898) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/
H A Dlist_debug.c16 * the prev/next entries already!
21 struct list_head *next)
23 WARN(next->prev != prev,
24 "list_add corruption. next->prev should be "
25 "prev (%p), but was %p. (next=%p).\n",
26 prev, next->prev, next);
27 WARN(prev->next != next,
28 "list_add corruption. prev->next shoul
19 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/util/include/linux/
H A Dlist.h15 begin->prev->next = end->next;
16 end->next->prev = begin->prev;
25 for (; prefetch(pos->next), pos != (head); pos = pos->next)
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/acpi/acpica/
H A Dpswalk.c65 union acpi_parse_object *next = NULL; local
80 next = acpi_ps_get_arg(op, 0);
81 if (next) {
85 op = next;
92 next = op->common.next;
102 if (next) {
103 op = next;
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/e2fsprogs/old_e2fsprogs/blkid/
H A Dlist.c9 * the prev/next entries already!
13 struct list_head * next)
15 next->prev = add;
16 add->next = next;
18 prev->next = add;
31 __list_add(add, head, head->next);
48 * Delete a list entry by making the prev/next entries
52 * the prev/next entries already!
54 void __list_del(struct list_head * prev, struct list_head * next) argument
11 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iptables-1.4.12.1/libiptc/
H A Dlinux_list.h48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
174 __list_del(struct list_head * prev, struct list_head * next) argument
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/conntrack-tools/conntrack-tools-1.4.0/include/
H A Dlinux_list.h52 * sometimes we already know the next/prev entries and we can
58 struct list_head *next, *prev; member in struct:list_head
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 * the prev/next entries already!
78 struct list_head *next)
80 next->prev = new;
81 new->next = next;
83 prev->next = new;
96 __list_add(new, head, head->next);
76 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
118 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
178 __list_del(struct list_head * prev, struct list_head * next) argument
283 struct list_head *next = head->next; local
518 struct hlist_node *next, **pprev; member in struct:hlist_node
538 struct hlist_node *next = n->next; local
630 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
639 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/iptables-1.4.12/src/libiptc/
H A Dlinux_list.h48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
174 __list_del(struct list_head * prev, struct list_head * next) argument
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/iptables-1.x/libiptc/
H A Dlinux_list.h48 * sometimes we already know the next/prev entries and we can
54 struct list_head *next, *prev; member in struct:list_head
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
70 * the prev/next entries already!
74 struct list_head *next)
76 next->prev = new;
77 new->next = next;
79 prev->next = new;
92 __list_add(new, head, head->next);
72 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
114 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
174 __list_del(struct list_head * prev, struct list_head * next) argument
279 struct list_head *next = head->next; local
514 struct hlist_node *next, **pprev; member in struct:hlist_node
534 struct hlist_node *next = n->next; local
626 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
635 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/include/
H A Ddlinklist.h21 /* To use these macros you must have a structure containing a next and
33 (p)->next = (p)->prev = NULL; \
36 (p)->next = (list); \
46 (list) = (p)->next; \
49 if ((p)->prev) (p)->prev->next = (p)->next; \
50 if ((p)->next) (p)->next->prev = (p)->prev; \
52 if ((p) != (list)) (p)->next = (p)->prev = NULL; \
67 (p)->next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/netatalk-2.2.5/include/atalk/
H A Dlist.h12 * sometimes we already know the next/prev entries and we can
18 struct list_head *next, *prev; member in struct:list_head
27 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
39 struct list_head * next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
57 __list_add(new, head, head->next);
37 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
80 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/squashfs-4.2/
H A Dsort.h29 struct priority_entry *next; member in struct:priority_entry
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/e2fsprogs/old_e2fsprogs/ext2fs/
H A Dkernel-list.h10 * sometimes we already know the next/prev entries and we can
16 struct list_head *next, *prev; member in struct:list_head
25 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
36 * the prev/next entries already!
40 struct list_head * next)
42 next->prev = new;
43 new->next = next;
45 prev->next = new;
53 __list_add(new, head, head->next);
38 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
71 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/
H A Drculist.h16 * the prev/next entries already!
19 struct list_head *prev, struct list_head *next)
21 new->next = next;
23 rcu_assign_pointer(prev->next, new);
24 next->prev = new;
45 __list_add_rcu(new, head, head->next);
96 __list_del(entry->prev, entry->next);
139 new->next = old->next;
18 __list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) argument
313 struct hlist_node *next = old->next; local
372 hlist_add_before_rcu(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/x86/include/asm/
H A Dmmu_context.h13 struct mm_struct *next)
33 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, argument
38 if (likely(prev != next)) {
41 percpu_write(cpu_tlbstate.active_mm, next);
43 cpumask_set_cpu(cpu, mm_cpumask(next));
46 load_cr3(next->pgd);
54 if (unlikely(prev->context.ldt != next->context.ldt))
55 load_LDT_nolock(&next->context);
60 BUG_ON(percpu_read(cpu_tlbstate.active_mm) != next);
62 if (!cpumask_test_and_set_cpu(cpu, mm_cpumask(next))) {
12 paravirt_activate_mm(struct mm_struct *prev, struct mm_struct *next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/bftpd-1.6.6/
H A Dlist.c13 new->next = NULL;
15 while (tmp->next)
16 tmp = tmp->next;
17 tmp->next = new;
29 tmp = tmp->next;
34 if (!(tmp->next))
36 tmp = tmp->next;
38 tmp2 = tmp->next;
39 tmp->next = tmp->next
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/pqueue/
H A Dpqueue.c80 item->next = NULL;
115 pitem *curr, *next; local
123 for(curr = NULL, next = pq->items;
124 next != NULL;
125 curr = next, next = next->next)
127 if (pq_64bit_gt(&(next->priority), &(item->priority)))
129 item->next
169 pitem *next, *prev = NULL; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/alsa-lib-1.0.26/include/
H A Dlist.h13 * sometimes we already know the next/prev entries and we can
20 struct list_head *next, *prev; member in struct:list_head
30 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
37 * the prev/next entries already!
41 struct list_head * next)
43 next->prev = _new;
44 _new->next = next;
46 prev->next = _new;
59 __list_add(_new, head, head->next);
39 __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) argument
82 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/pqueue/
H A Dpqueue.c78 item->next = NULL;
111 pitem *curr, *next; local
118 for (curr = NULL, next = pq->items;
119 next != NULL; curr = next, next = next->next) {
123 int cmp = memcmp(next->priority, item->priority, 8);
124 if (cmp > 0) { /* next > ite
162 pitem *next; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/pqueue/
H A Dpqueue.c78 item->next = NULL;
111 pitem *curr, *next; local
118 for (curr = NULL, next = pq->items;
119 next != NULL; curr = next, next = next->next) {
123 int cmp = memcmp(next->priority, item->priority, 8);
124 if (cmp > 0) { /* next > ite
162 pitem *next; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/expat-2.0.1/xmlwf/
H A Dct.c86 const char *next, *p; local
89 next = buf;
90 p = getTok(&next);
91 if (matchkey(p, next, "text"))
93 else if (!matchkey(p, next, "application"))
95 p = getTok(&next);
98 p = getTok(&next);
99 if (matchkey(p, next, "xml"))
101 p = getTok(&next);
104 p = getTok(&next);
[all...]
H A Dxmlmime.c90 const char *next, *p; local
93 next = buf;
94 p = getTok(&next);
95 if (matchkey(p, next, "text"))
97 else if (!matchkey(p, next, "application"))
99 p = getTok(&next);
102 p = getTok(&next);
104 if (!matchkey(p, next, "xml") && charset[0] == '\0')
107 p = getTok(&next);
110 p = getTok(&next);
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/expat/xmlwf/
H A Dct.c86 const char *next, *p; local
89 next = buf;
90 p = getTok(&next);
91 if (matchkey(p, next, "text"))
93 else if (!matchkey(p, next, "application"))
95 p = getTok(&next);
98 p = getTok(&next);
99 if (matchkey(p, next, "xml"))
101 p = getTok(&next);
104 p = getTok(&next);
[all...]
H A Dxmlmime.c90 const char *next, *p; local
93 next = buf;
94 p = getTok(&next);
95 if (matchkey(p, next, "text"))
97 else if (!matchkey(p, next, "application"))
99 p = getTok(&next);
102 p = getTok(&next);
104 if (!matchkey(p, next, "xml") && charset[0] == '\0')
107 p = getTok(&next);
110 p = getTok(&next);
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/expat-2.0.1/xmlwf/
H A Dct.c86 const char *next, *p; local
89 next = buf;
90 p = getTok(&next);
91 if (matchkey(p, next, "text"))
93 else if (!matchkey(p, next, "application"))
95 p = getTok(&next);
98 p = getTok(&next);
99 if (matchkey(p, next, "xml"))
101 p = getTok(&next);
104 p = getTok(&next);
[all...]
H A Dxmlmime.c90 const char *next, *p; local
93 next = buf;
94 p = getTok(&next);
95 if (matchkey(p, next, "text"))
97 else if (!matchkey(p, next, "application"))
99 p = getTok(&next);
102 p = getTok(&next);
104 if (!matchkey(p, next, "xml") && charset[0] == '\0')
107 p = getTok(&next);
110 p = getTok(&next);
[all...]

Completed in 391 milliseconds

1234567891011>>