/freebsd-11-stable/contrib/libucl/uthash/ |
H A D | utlist.h | 40 * Either way, the pointer to the head of the list must be initialized to NULL. 81 * namely, we always reassign our tmp variable to the list head if we need 82 * to dereference its prev/next pointers, and save/restore the real head.*/ 309 #define LL_PREPEND(head,add) \ 310 LL_PREPEND2(head,add,next) 312 #define LL_PREPEND2(head,add,next) \ 314 (add)->next = head; \ 315 head = add; \ 333 #define LL_APPEND(head,add) \ 334 LL_APPEND2(head,ad [all...] |
H A D | uthash.h | 95 #define HASH_FIND(hh,head,keyptr,keylen,out) \ 99 if (head) { \ 100 HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ 101 if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \ 102 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ 142 #define HASH_MAKE_TABLE(hh,head) \ 144 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ 146 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ 147 memset((head) [all...] |
/freebsd-11-stable/contrib/elftoolchain/common/ |
H A D | _elftc.h | 80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ 81 for ((var) = LIST_FIRST((head)); \ 87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ 88 for ((var) = SLIST_FIRST((head)); \ 104 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) 115 #define STAILQ_FIRST(head) ((head)->stqh_first) 127 #define STAILQ_HEAD_INITIALIZER(head) \ 128 { NULL, &(head) [all...] |
H A D | uthash.h | 96 #define HASH_FIND(hh,head,keyptr,keylen,out) \ 100 if (head) { \ 101 HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ 102 if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \ 103 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ 142 #define HASH_MAKE_TABLE(hh,head) \ 144 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ 146 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ 147 memset((head) [all...] |
/freebsd-11-stable/lib/libc/iconv/ |
H A D | citrus_hash.h | 38 #define _CITRUS_HASH_INIT(head, hashsize) \ 43 LIST_INIT(&(head)->chh_table[_ch_loop]); \ 46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ 47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field) 48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ 50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
|
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_stack.h | 41 struct ck_stack_entry *head; member in struct:ck_stack 58 stack = ck_pr_load_ptr(&target->head); 62 while (ck_pr_cas_ptr_value(&target->head, stack, entry, &stack) == false) { 82 stack = ck_pr_load_ptr(&target->head); 86 return ck_pr_cas_ptr(&target->head, stack, entry); 100 entry = ck_pr_load_ptr(&target->head); 106 while (ck_pr_cas_ptr_value(&target->head, entry, next, &entry) == false) { 131 entry = ck_pr_load_ptr(&target->head); 136 if (ck_pr_cas_ptr(&target->head, entry, entry->next) == true) { 155 entry = ck_pr_fas_ptr(&target->head, NUL [all...] |
H A D | ck_hp_stack.h | 60 entry = ck_pr_load_ptr(&target->head); 65 } while (entry != ck_pr_load_ptr(&target->head)); 67 while (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false) { 73 update = ck_pr_load_ptr(&target->head); 77 update = ck_pr_load_ptr(&target->head); 91 entry = ck_pr_load_ptr(&target->head); 96 if (entry != ck_pr_load_ptr(&target->head)) 99 if (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false)
|
H A D | ck_fifo.h | 47 struct ck_fifo_spsc_entry *head; member in struct:ck_fifo_spsc 110 fifo->head = fifo->tail = fifo->head_snapshot = fifo->garbage = stub; 118 *garbage = fifo->head; 119 fifo->head = fifo->tail = NULL; 145 * The head pointer is guaranteed to always point to a stub entry. 149 entry = ck_pr_load_ptr(&fifo->head->next); 156 ck_pr_store_ptr(&fifo->head, entry); 170 fifo->head_snapshot = ck_pr_load_ptr(&fifo->head); 183 struct ck_fifo_spsc_entry *head = ck_pr_load_ptr(&fifo->head); local 218 struct ck_fifo_mpmc_pointer head; member in struct:ck_fifo_mpmc 359 struct ck_fifo_mpmc_pointer head, tail, next, update; local 414 struct ck_fifo_mpmc_pointer head, tail, next, update; local [all...] |
/freebsd-11-stable/usr.bin/head/ |
H A D | Makefile | 2 # $FreeBSD: stable/11/usr.bin/head/Makefile 326780 2017-12-11 20:33:11Z asomers $ 6 PROG= head
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-iterator.c | 70 struct tree_statement_list_node *head, *tail, *cur; local 77 head = STATEMENT_LIST_HEAD (t); 85 if (!head || !tail) 87 gcc_assert (head == tail); 93 head = ggc_alloc (sizeof (*head)); 94 head->prev = NULL; 95 head->next = NULL; 96 head->stmt = t; 97 tail = head; 146 struct tree_statement_list_node *head, *tail, *cur; local [all...] |
/freebsd-11-stable/tools/tools/drm/radeon/mkregtable/ |
H A D | mkregtable.c | 82 * @head: list head to add it after 84 * Insert a new entry after the specified head. 87 static inline void list_add(struct list_head *new, struct list_head *head) argument 89 __list_add(new, head, head->next); 95 * @head: list head to add it before 97 * Insert a new entry before the specified head. 100 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument 172 list_move(struct list_head *list, struct list_head *head) argument 183 list_move_tail(struct list_head *list, struct list_head *head) argument 195 list_is_last(const struct list_head *list, const struct list_head *head) argument 205 list_empty(const struct list_head *head) argument 223 list_empty_careful(const struct list_head *head) argument 233 list_is_singular(const struct list_head *head) argument 238 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument 265 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument 297 list_splice(const struct list_head *list, struct list_head *head) argument 309 list_splice_tail(struct list_head *list, struct list_head *head) argument 323 list_splice_init(struct list_head *list, struct list_head *head) argument 340 list_splice_tail_init(struct list_head *list, struct list_head *head) argument [all...] |
/freebsd-11-stable/crypto/openssh/openbsd-compat/ |
H A D | sys-tree.h | 84 #define SPLAY_ROOT(head) (head)->sph_root 85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 91 (head)->sph_root = tmp; \ 94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 95 SPLAY_RIGHT((head) [all...] |
/freebsd-11-stable/contrib/dtc/scripts/ |
H A D | setlocalversion | 12 if head=`git rev-parse --verify HEAD 2>/dev/null`; then 15 printf '%s%s' -g `echo "$head" | cut -c1-8`
|
/freebsd-11-stable/contrib/ipfilter/sys/ |
H A D | tree.h | 80 #define SPLAY_ROOT(head) (head)->sph_root 81 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 84 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 85 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 86 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 87 (head)->sph_root = tmp; \ 90 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 91 SPLAY_RIGHT((head) [all...] |
/freebsd-11-stable/sys/contrib/vchiq/interface/compat/ |
H A D | list.h | 67 INIT_LIST_HEAD(struct list_head *head) argument 69 head->prev = head; 70 head->next = head; 74 list_first(const struct list_head *head) argument 76 return head->next; 80 list_last(const struct list_head *head) argument 82 return head->prev; 98 list_empty(const struct list_head *head) argument 104 list_is_singular(const struct list_head *head) argument 125 list_add(struct list_head *node, struct list_head *head) argument 131 list_add_tail(struct list_head *node, struct list_head *head) argument 158 list_splice(const struct list_head *list, struct list_head *head) argument 165 list_splice_tail(const struct list_head *list, struct list_head *head) argument 172 list_move(struct list_head *node, struct list_head *head) argument 179 list_move_tail(struct list_head *node, struct list_head *head) argument [all...] |
/freebsd-11-stable/usr.bin/vgrind/ |
H A D | vgrind.sh | 39 head="" 73 head="$2" 103 if test "x$head" != x; then 104 $vf $options -h "$head" $files 109 if test "x$head" != x; then 110 $vf $options -h "$head" $files 119 if test "x$head" != x; then 120 $vf $options -h "$head" $files 125 if test "x$head" != x; then 126 $vf $options -h "$head" [all...] |
/freebsd-11-stable/contrib/ntp/sntp/libevent/WIN32-Code/ |
H A D | tree.h | 77 #define SPLAY_ROOT(head) (head)->sph_root 78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 84 (head)->sph_root = tmp; \ 87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 88 SPLAY_RIGHT((head) [all...] |
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/ |
H A D | list.h | 98 list_empty(const struct list_head *head) argument 101 return (head->next == head); 105 list_empty_careful(const struct list_head *head) argument 107 struct list_head *next = head->next; 109 return ((next == head) && (next == head->prev)); 188 #define list_for_each(p, head) \ 189 for (p = (head)->next; p != (head); 236 list_add(struct list_head *new, struct list_head *head) argument 243 list_add_tail(struct list_head *new, struct list_head *head) argument 250 list_move(struct list_head *list, struct list_head *head) argument 258 list_move_tail(struct list_head *entry, struct list_head *head) argument 266 list_bulk_move_tail(struct list_head *head, struct list_head *first, struct list_head *last) argument 295 list_splice(const struct list_head *list, struct list_head *head) argument 302 list_splice_tail(struct list_head *list, struct list_head *head) argument 309 list_splice_init(struct list_head *list, struct list_head *head) argument 317 list_splice_tail_init(struct list_head *list, struct list_head *head) argument 421 list_is_singular(const struct list_head *head) argument 426 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument 438 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument 452 list_is_last(const struct list_head *list, const struct list_head *head) argument [all...] |
H A D | rculist.h | 39 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next))) 40 #define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev))) 42 #define list_for_each_entry_rcu(pos, head, member) \ 43 for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \ 44 &(pos)->member != (head); \ 58 list_add_rcu(struct list_head *new, struct list_head *head) argument 60 linux_list_add_rcu(new, head, head 64 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument [all...] |
/freebsd-11-stable/lib/libc/tests/sys/ |
H A D | queue_test.c | 45 SLIST_HEAD(stailhead, entry) head = SLIST_HEAD_INITIALIZER(head); 52 SLIST_INIT(&head); 56 ATF_REQUIRE(SLIST_EMPTY(&head)); 60 SLIST_FOREACH(np, &head, entries) { 71 SLIST_INSERT_HEAD(&head, n1, entries); 74 ATF_REQUIRE_EQ(SLIST_FIRST(&head), n1); 77 SLIST_FOREACH(np, &head, entries) { 100 SLIST_FOREACH(np, &head, entries) { 111 ATF_REQUIRE_EQ(SLIST_FIRST(&head), n [all...] |
/freebsd-11-stable/sys/sys/ |
H A D | tree.h | 82 #define SPLAY_ROOT(head) (head)->sph_root 83 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 86 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 87 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 88 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 89 (head)->sph_root = tmp; \ 92 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 93 SPLAY_RIGHT((head) [all...] |
/freebsd-11-stable/contrib/ncurses/ncurses/base/ |
H A D | lib_ungetch.c | 54 T(("head = %d, tail = %d, peek = %d", head, tail, peek)); 68 if (head < 0) { 69 head = 0; 76 sp->_fifo[head] = ch;
|
/freebsd-11-stable/crypto/heimdal/admin/ |
H A D | purge.c | 50 get_entry (krb5_principal princ, struct e *head) argument 54 for (e = head; e != NULL; e = e->next) 61 add_entry (krb5_principal princ, int vno, time_t timestamp, struct e **head) argument 66 e = get_entry (princ, *head); 82 e->next = *head; 83 *head = e; 87 delete_list (struct e *head) argument 89 while (head != NULL) { 90 struct e *next = head->next; 91 krb5_free_principal (context, head 110 struct e *head = NULL; local [all...] |
/freebsd-11-stable/usr.sbin/pc-sysinstall/backend-query/ |
H A D | detect-nics.sh | 34 IDENT=$(dmesg | sed -n "s/^$i: <\(.*\)>.*$/\1/p" | head -1)
|
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | ntp_leapsec.c | 78 leap_head_t head; member in struct:leap_table 172 memset(&pt->head, 0, sizeof(pt->head)); 208 pt->head.expire = strtouv64(cp, &ep, 10); 211 pt->lsig.etime = pt->head.expire.D_s.lo; 214 pt->head.update = strtouv64(cp, &ep, 10); 232 pt->head.base_tai = (int16_t)taiof; 261 ntpcal_ntp64_to_date(&ttb, &pt->head.expire); 263 pt->head.size, 265 idx = pt->head [all...] |