Searched refs:next (Results 26 - 50 of 12498) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/source3/lib/ldb/include/
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-rt/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-rt/router/samba-3.5.8/source4/lib/ldb/include/
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-rt/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/router/netatalk-3.0.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/source3/lib/ldb/include/
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.5.8/source4/lib/ldb/include/
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-rt/router/netatalk-3.0.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/source3/lib/ldb/include/
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-rt-6.x.4708/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-rt-6.x.4708/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-6.x.4708/router/netatalk-3.0.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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/source4/lib/ldb/include/
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-rt-6.x.4708/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-rt-6.x.4708/linux/linux-2.6.36/include/Common/
H A DQueue.h34 (_Tail)->next = _Packet; \
36 (_Packet)->next = NULL; \
43 if (!Head->next) { \
46 Head = Head->next; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/Common/
H A DQueue.h34 (_Tail)->next = _Packet; \
36 (_Packet)->next = NULL; \
43 if (!Head->next) { \
46 Head = Head->next; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba/source/include/
H A Ddlinklist.h22 /* To use these macros you must have a structure containing a next and
31 (p)->next = (p)->prev = NULL; \
34 (p)->next = (list); \
45 (list) = (p)->next; \
48 (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba/source/include/
H A Ddlinklist.h22 /* To use these macros you must have a structure containing a next and
31 (p)->next = (p)->prev = NULL; \
34 (p)->next = (list); \
45 (list) = (p)->next; \
48 (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba/source/include/
H A Ddlinklist.h22 /* To use these macros you must have a structure containing a next and
31 (p)->next = (p)->prev = NULL; \
34 (p)->next = (list); \
45 (list) = (p)->next; \
48 (p)->prev->next = (p)->next; \
49 if ((p)->next) (p)->next->prev = (p)->prev; \
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/share/libtool/libltdl/
H A Dslist.c60 SList *next = head->next; local
62 head = next;
93 *phead = stale->next;
99 for (head = *phead; head->next; head = head->next)
101 result = (*find) (head->next, matchdata);
104 stale = head->next;
105 head->next = stale->next;
226 SList *next; local
250 SList *next = slist->next; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/busybox/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/db-4.8.30/test/scr024/src/com/sleepycat/collections/test/
H A DTestKeyAssigner.java20 private byte next = 1; field in class:TestKeyAssigner
30 RecordNumberBinding.recordNumberToEntry(next, keyData);
32 keyData.setData(new byte[] { next }, 0, 1);
34 next += 1;
39 next = 1;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/busybox/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...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/db-4.8.30/test/scr024/src/com/sleepycat/collections/test/
H A DTestKeyAssigner.java20 private byte next = 1; field in class:TestKeyAssigner
30 RecordNumberBinding.recordNumberToEntry(next, keyData);
32 keyData.setData(new byte[] { next }, 0, 1);
34 next += 1;
39 next = 1;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/busybox/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...]

Completed in 125 milliseconds

1234567891011>>