Searched refs:LIST_NEXT (Results 1 – 5 of 5) sorted by relevance
/external/ipsec-tools/src/include-glibc/sys/ |
D | queue.h | 280 (var) = LIST_NEXT((var), field)) 287 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\ 288 LIST_NEXT((listelm), field)->field.le_prev = \ 289 &LIST_NEXT((elm), field); \ 290 LIST_NEXT((listelm), field) = (elm); \ 291 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \ 296 LIST_NEXT((elm), field) = (listelm); \ 298 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \ 302 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \ 303 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\ [all …]
|
/external/ipsec-tools/src/racoon/ |
D | rsalist.c | 60 #ifndef LIST_NEXT 61 #define LIST_NEXT(elm, field) ((elm)->field.le_next) macro
|
D | handler.c | 415 next = LIST_NEXT(p, chain); in flushph1() 715 next = LIST_NEXT(p, chain); in flushph2() 748 next = LIST_NEXT(iph2, chain); 1024 next = LIST_NEXT(r, chain); 1309 iph2_next = LIST_NEXT(iph2, chain); in remove_ph1() 1324 next = LIST_NEXT(p, chain); in revalidate_ph1tree_rmconf() 1491 next = LIST_NEXT(p, chain); in revalidate_ph1tree() 1507 next = LIST_NEXT(p, chain); in revalidate_ph2tree()
|
D | var.h | 100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
|
D | sainfo.c | 220 next = LIST_NEXT(s, chain); in flushsainfo()
|