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

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/shared/
H A Dutils.h103 #define split(word, wordlist, next, delim) \
104 for (next = wordlist, \
105 strncpy(word, next, sizeof(word)), \
106 word[(next=strstr(next, delim)) ? strstr(word, delim) - word : sizeof(word) - 1] = '\0', \
107 next = next ? next + sizeof(delim) - 1 : NULL ; \
109 next = next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/shared/
H A Dutils.h103 #define split(word, wordlist, next, delim) \
104 for (next = wordlist, \
105 strncpy(word, next, sizeof(word)), \
106 word[(next=strstr(next, delim)) ? strstr(word, delim) - word : sizeof(word) - 1] = '\0', \
107 next = next ? next + sizeof(delim) - 1 : NULL ; \
109 next = next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/shared/
H A Dutils.h103 #define split(word, wordlist, next, delim) \
104 for (next = wordlist, \
105 strncpy(word, next, sizeof(word)), \
106 word[(next=strstr(next, delim)) ? strstr(word, delim) - word : sizeof(word) - 1] = '\0', \
107 next = next ? next + sizeof(delim) - 1 : NULL ; \
109 next = next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/libusb/libusb/
H A Dusbi.h28 ent->next = begin; \
29 ent->next->prev = ent; \
31 ent->next = NULL; \
39 ent->prev->next = ent->next; \
41 begin = ent->next; \
42 if (ent->next) \
43 ent->next->prev = ent->prev; \
45 ent->next = NULL; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/libusb/libusb/
H A Dusbi.h28 ent->next = begin; \
29 ent->next->prev = ent; \
31 ent->next = NULL; \
39 ent->prev->next = ent->next; \
41 begin = ent->next; \
42 if (ent->next) \
43 ent->next->prev = ent->prev; \
45 ent->next = NULL; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/libusb/libusb/
H A Dusbi.h28 ent->next = begin; \
29 ent->next->prev = ent; \
31 ent->next = NULL; \
39 ent->prev->next = ent->next; \
41 begin = ent->next; \
42 if (ent->next) \
43 ent->next->prev = ent->prev; \
45 ent->next = NULL; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/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)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/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)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/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;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/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;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/busybox/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/busybox/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/busybox/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/iptables/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/iptables-1.4.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/iptables/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/iptables-1.4.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/iptables/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/iptables-1.4.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/lighttpd-1.4.39/src/
H A Ddlinklist.h20 /* To use these macros you must have a structure containing a next and
32 (p)->next = (p)->prev = NULL; \
35 (p)->next = (list); \
45 (list) = (p)->next; \
48 if ((p)->prev) (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
51 if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
66 (p)->next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/util/
H A Ddlinklist.h20 /* To use these macros you must have a structure containing a next and
32 (p)->next = (p)->prev = NULL; \
35 (p)->next = (list); \
45 (list) = (p)->next; \
48 if ((p)->prev) (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
51 if ((p) != (list)) (p)->next = (p)->prev = NULL; \
66 (p)->next
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/lighttpd-1.4.39/src/
H A Ddlinklist.h20 /* To use these macros you must have a structure containing a next and
32 (p)->next = (p)->prev = NULL; \
35 (p)->next = (list); \
45 (list) = (p)->next; \
48 if ((p)->prev) (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
51 if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
66 (p)->next
[all...]

Completed in 168 milliseconds

1234567891011>>