| /src/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| DiagnosticIDs.cpp | 223 #define CATEGORY(NAME, PREV) \
225 Offset += NUM_BUILTIN_##PREV##_DIAGNOSTICS - DIAG_START_##PREV - 1; \
226 ID -= DIAG_START_##NAME - DIAG_START_##PREV; \
|
| /src/external/bsd/libbind/dist/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL)
[all...] |
| /src/external/bsd/am-utils/dist/amd/ |
| amq_subr.c | 480 for (mf = AM_LAST(mntfs, qhead); mf != HEAD(mntfs, qhead); mf = PREV(mntfs, mf)) {
490 for (mf = AM_LAST(mntfs, qhead); mf != HEAD(mntfs, qhead); mf = PREV(mntfs, mf)) {
|
| /src/external/bsd/ntp/dist/libntp/lib/isc/include/isc/ |
| util.h | 198 #define PREV(elt, link) ISC_LIST_PREV(elt, link)
|
| /src/external/mpl/bind/dist/lib/dns/ |
| dyndb.c | 239 dyndb_implementation_t *prev; local
246 prev = PREV(elem, link);
254 elem = prev;
|
| rbtdb.c | 1907 least_greater = PREV(version, link);
|
| qpzone.c | 1406 least_greater = PREV(version, link);
2778 dns_name_t *next = NULL, *prev = NULL; local
2791 prev = dns_fixedname_initname(&fprev);
2805 check_prev = step(search, &it, BACK, prev);
2828 if ((check_prev && dns_name_issubdomain(prev, &rname)) ||
4517 * Defer the release of the current node until we have the prev node
4548 * We have the prev node, we can release the previous current.
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/include/isc/ |
| util.h | 215 #define PREV(elt, link) ISC_LIST_PREV(elt, link)
|
| /src/external/mpl/bind/dist/lib/isc/include/isc/ |
| util.h | 252 #define PREV(elt, link) ISC_LIST_PREV(elt, link)
|
| /src/external/bsd/am-utils/dist/include/ |
| am_utils.h | 133 #define PREV(ty, q) ((ty *) (((qelem *) q)->q_back))
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| dyndb.c | 386 dyndb_implementation_t *prev; local
393 prev = PREV(elem, link);
401 elem = prev;
|
| rbtdb.c | 2694 least_greater = PREV(version, link);
3440 dns_name_t *prev; local
3460 prev = dns_fixedname_initname(&fprev);
3493 result = dns_name_concatenate(&name, origin, prev, NULL);
3539 if ((check_prev && dns_name_issubdomain(prev, &rname)) ||
|
| /src/external/bsd/ntp/dist/libntp/lib/isc/ |
| task.c | 416 isc_event_t *event, *prev; local
441 event = prev) {
442 prev = PREV(event, ev_link);
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| task.c | 297 isc_event_t *event, *prev; local
323 event = prev)
325 prev = PREV(event, ev_link);
|
