/freebsd-11-stable/contrib/ipfilter/ |
H A D | ipf_rb.h | 38 rotate_left(struct _n##_rb_head *head, _t *node) \ 49 head->top._f.right = tmp1; \ 60 rotate_right(struct _n##_rb_head *head, _t *node) \ 71 head->top._f.right = tmp1; \ 82 _n##_rb_insert(struct _n##_rb_head *head, _t *node) \ 86 parent = &head->top; \ 89 p = &head->top._f.right; \ 113 rotate_left(head, node); \ 118 rotate_right(head, gparent); \ 130 rotate_right(head, nod [all...] |
/freebsd-11-stable/sys/contrib/ipfilter/netinet/ |
H A D | ipf_rb.h | 38 rotate_left(struct _n##_rb_head *head, _t *node) \ 49 head->top._f.right = tmp1; \ 60 rotate_right(struct _n##_rb_head *head, _t *node) \ 71 head->top._f.right = tmp1; \ 82 _n##_rb_insert(struct _n##_rb_head *head, _t *node) \ 86 parent = &head->top; \ 89 p = &head->top._f.right; \ 113 rotate_left(head, node); \ 118 rotate_right(head, gparent); \ 130 rotate_right(head, nod [all...] |
/freebsd-11-stable/sys/netgraph/bluetooth/include/ |
H A D | ng_bluetooth.h | 66 struct mbuf *head; /* first item in the queue */ member in struct:ng_bt_mbufq 77 (q)->head = NULL; \ 89 #define NG_BT_MBUFQ_FIRST(q) (q)->head 102 (q)->head = (i); \ 112 (i) = (q)->head; \ 114 (q)->head = (q)->head->m_nextpkt; \ 115 if ((q)->head == NULL) \ 125 (i)->m_nextpkt = (q)->head; \ 129 (q)->head [all...] |
/freebsd-11-stable/sys/dev/drm2/ttm/ |
H A D | ttm_execbuf_util.c | 40 list_for_each_entry(entry, list, head) { 60 list_for_each_entry(entry, list, head) { 76 list_for_each_entry(entry, list, head) { 94 entry = list_first_entry(list, struct ttm_validate_buffer, head); 123 list_for_each_entry(entry, list, head) { 129 entry = list_first_entry(list, struct ttm_validate_buffer, head); 136 list_for_each_entry(entry, list, head) { 216 bo = list_first_entry(list, struct ttm_validate_buffer, head)->bo; 224 list_for_each_entry(entry, list, head) { 234 list_for_each_entry(entry, list, head) { [all...] |
/freebsd-11-stable/contrib/netbsd-tests/include/sys/ |
H A D | t_tree.c | 40 RB_HEAD(head, mist) tt; 57 RB_PROTOTYPE(head, mist, rbentry, mistcmp) 58 RB_GENERATE(head, mist, rbentry, mistcmp) 67 RB_INSERT(head, &tt, m); 75 return (!!RB_FIND(head, &tt, m));
|
/freebsd-11-stable/contrib/libucl/src/ |
H A D | tree.h | 195 #define TREE_INSERT(head, node, field, elm) \ 196 ((head)->th_root= TREE_INSERT_##node##_##field((head)->th_root, (elm), (head)->th_cmp)) 198 #define TREE_FIND(head, node, field, elm) \ 199 (TREE_FIND_##node##_##field((head)->th_root, (elm), (head)->th_cmp)) 201 #define TREE_REMOVE(head, node, field, elm) \ 202 ((head)->th_root= TREE_REMOVE_##node##_##field((head) [all...] |
/freebsd-11-stable/contrib/binutils/binutils/ |
H A D | coffgrok.c | 129 do_sections_p1 (struct coff_ofile *head) argument 135 head->nsections = abfd->section_count + 1; 136 head->sections = all; 155 head->sections[i].name = (char *) (section->name); 156 head->sections[i].code = section->flags & SEC_CODE; 157 head->sections[i].data = section->flags & SEC_DATA; 159 head->sections[i].data = 1; 160 head->sections[i].address = section->lma; 161 head->sections[i].size = bfd_get_section_size (section); 162 head 178 do_sections_p2(struct coff_ofile *head) argument 600 struct coff_ofile *head = local [all...] |
/freebsd-11-stable/lib/libutil/ |
H A D | property.c | 73 properties head, ptr; local 82 head = ptr = NULL; 95 properties_free(head); 207 if (head == NULL) { 208 if ((head = ptr = property_alloc(hold_n, hold_v)) == NULL) 212 properties_free(head); 226 if (head == NULL && (head = property_alloc(NULL, NULL)) == NULL) 229 return (head);
|
/freebsd-11-stable/sys/net/ |
H A D | radix.h | 108 struct radix_head *head); 110 struct radix_head *head, struct radix_node nodes[]); 112 struct radix_head *head); 114 struct radix_head *head); 115 typedef int rn_walktree_t(struct radix_head *head, walktree_f_t *f, 117 typedef int rn_walktree_from_t(struct radix_head *head, 119 typedef void rn_close_t(struct radix_node *rn, struct radix_head *head); 144 struct radix_head head; member in struct:radix_mask_head 161 rw_init_flags(&(rnh)->rnh_lock, "radix node head", 0) 181 struct radix_head *head); [all...] |
/freebsd-11-stable/sys/dev/iscsi/ |
H A D | icl_soft_proxy.c | 211 struct socket *head, *so; local 216 head = ils->ils_socket; 222 while (TAILQ_EMPTY(&head->so_comp) && head->so_error == 0 && ils->ils_disconnecting == false) { 223 if (head->so_rcv.sb_state & SBS_CANTRCVMORE) { 224 head->so_error = ECONNABORTED; 227 error = msleep(&head->so_timeo, &accept_mtx, PSOCK | PCATCH, 242 if (head->so_error) { 243 error = head->so_error; 244 head [all...] |
/freebsd-11-stable/sys/dev/drm2/ |
H A D | drm_agpsupport.c | 227 list_add(&entry->head, &dev->agp->memory); 261 list_for_each_entry(entry, &dev->agp->memory, head) { 376 list_del(&entry->head); 405 struct drm_agp_head *head = NULL; local 407 if (!(head = malloc(sizeof(*head), DRM_MEM_AGPLISTS, M_NOWAIT))) 409 memset((void *)head, 0, sizeof(*head)); 410 head->bridge = agp_find_device(); 411 if (!head [all...] |
/freebsd-11-stable/lib/libc/iconv/ |
H A D | citrus_memstream.c | 91 /* skip white spaces at the head of the line */ 116 void *chr, *head; local 122 head = _region_offset(&ms->ms_region, ms->ms_pos); 123 chr = memchr(head, ch, _memstream_remainder(ms)); 125 _region_init(r, head, _memstream_remainder(ms)); 129 sz = (char *)chr - (char *)head; 131 _region_init(r, head, sz);
|
/freebsd-11-stable/usr.bin/ctags/ |
H A D | tree.c | 64 put_entries(head); 65 free_tree(head); 67 if (!(head = np = (NODE *)malloc(sizeof(NODE)))) 88 if (!head) 89 head = np; 91 add_node(np, head);
|
/freebsd-11-stable/sys/dev/netmap/ |
H A D | netmap_mbq.c | 49 q->head = q->tail = NULL; 74 q->head = q->tail = m; 98 if (q->head) { 99 ret = q->head; 100 q->head = ret->m_nextpkt; 101 if (q->head == NULL) {
|
H A D | netmap_mbq.h | 52 struct mbuf *head; member in struct:mbq 70 return q->head;
|
/freebsd-11-stable/sys/geom/journal/ |
H A D | g_journal.h | 173 #define GJQ_INSERT_HEAD(head, bp) do { \ 174 (bp)->bio_next = (head); \ 175 (head) = (bp); \ 177 #define GJQ_INSERT_AFTER(head, bp, pbp) do { \ 179 GJQ_INSERT_HEAD(head, bp); \ 185 #define GJQ_LAST(head, bp) do { \ 188 if ((head) == NULL) { \ 189 (bp) = (head); \ 192 for (_bp = (head); _bp->bio_next != NULL; _bp = _bp->bio_next) \ 196 #define GJQ_FIRST(head) (hea [all...] |
/freebsd-11-stable/sys/netinet/ |
H A D | in_rmx.c | 52 extern int in_inithead(void **head, int off); 54 extern int in_detachhead(void **head, int off); 61 in_addroute(void *v_arg, void *n_arg, struct radix_head *head, argument 106 return (rn_addroute(v_arg, n_arg, head, treenodes)); 114 in_inithead(void **head, int off) argument 123 *head = (void *)rh; 133 in_detachhead(void **head, int off) argument 136 rt_table_destroy((struct rib_head *)(*head));
|
/freebsd-11-stable/sys/net80211/ |
H A D | ieee80211_ageq.c | 156 * deltas (in seconds) relative to the head so we can check 157 * and/or adjust only the head of the list. If a frame's age 164 struct mbuf *head, **phead; local 167 phead = &head; 184 return head; 197 struct mbuf *head, **phead; local 202 phead = &head; 233 if (head == ohead && aq->aq_head != NULL) /* correct age */ 234 M_AGE_SET(aq->aq_head, M_AGE_GET(head)); 238 return head; [all...] |
/freebsd-11-stable/lib/libiconv_modules/UES/ |
H A D | citrus_ues.c | 192 int ch, head, num, tail; local 207 head = tail; 208 if (psenc->chlen == head) { 213 ch = (unsigned char)psenc->ch[head++]; 215 if (psenc->chlen == head) { 220 switch (psenc->ch[head]) { 233 ++head; 235 for (; head < tail; ++head) { 236 if (psenc->chlen == head) { [all...] |
/freebsd-11-stable/lib/libc/rpc/ |
H A D | pmap_getmaps.c | 75 struct pmaplist *head = NULL; local 90 (xdrproc_t)xdr_pmaplist, &head, minutetimeout) != 97 return (head);
|
/freebsd-11-stable/sys/netpfil/ipfw/test/ |
H A D | mylist.h | 9 /* not just a head, also the link field for a list entry */ 27 list_add_tail(struct list_head *o, struct list_head *head) argument 29 __list_add(o, head->prev, head);
|
/freebsd-11-stable/sys/contrib/ck/include/spinlock/ |
H A D | clh.h | 59 struct ck_spinlock_clh *head; local 62 head = ck_pr_load_ptr(queue); 63 r = ck_pr_load_uint(&head->wait);
|
/freebsd-11-stable/sbin/fsck_msdosfs/ |
H A D | dir.c | 258 rootDir->head = boot->bpbRootClust; 400 if (dir->head == CLUST_FREE) { 403 if (!fat_is_valid_cl(fat, dir->head)) 405 ret = checkchain(fat, dir->head, &chainsize); 443 for (cl = dir->head, len = sz = 0; 476 cl = dir->head; 555 cl = dir->head; 581 mod |= checkchain(fat, dir->head, &dirclusters); 784 dirent.head = p[26] | (p[27] << 8); 786 dirent.head | 1075 reconnect(struct fat_descriptor *fat, cl_t head, size_t length) argument [all...] |
/freebsd-11-stable/usr.bin/tail/ |
H A D | reverse.c | 197 TAILQ_HEAD(bfhead, bfelem) head; 199 TAILQ_INIT(&head); 210 first = TAILQ_FIRST(&head); 211 if (TAILQ_EMPTY(&head)) 214 TAILQ_REMOVE(&head, first, entries); 217 TAILQ_INSERT_TAIL(&head, tl, entries); 246 tl = TAILQ_LAST(&head, bfhead); 247 first = TAILQ_FIRST(&head); 268 TAILQ_FOREACH_FROM_SAFE(tr, &head, 272 TAILQ_REMOVE(&head, t [all...] |
/freebsd-11-stable/sys/dev/drm/ |
H A D | drm_hashtab.c | 68 LIST_FOREACH(entry, h_list, head) 81 LIST_FOREACH(entry, h_list, head) { 101 LIST_FOREACH(entry, h_list, head) { 109 LIST_INSERT_AFTER(parent, item, head); 111 LIST_INSERT_HEAD(h_list, item, head); 163 LIST_REMOVE(entry, head); 171 LIST_REMOVE(item, head);
|