/freebsd-11-stable/sys/netinet6/ |
H A D | frag6.c | 213 struct ip6q *head, *q6; local 308 head = IP6Q_HEAD(hash); 321 for (q6 = head->ip6q_next; q6 != head; q6 = q6->ip6q_next) 331 if (q6 == head) { 362 frag6_insque_head(q6, head, hash); 583 if (q6 != head->ip6q_next) { 585 frag6_insque_head(q6, head, hash); 809 ("%s: attempt to insert at head of wrong bucket" 839 struct ip6q *head, *q local 914 struct ip6q *head; local [all...] |
/freebsd-11-stable/sys/net/ |
H A D | netmap.h | 68 / | head,cur,tail | 198 * Slot released to the kernel (i.e. before ring->head) with 246 * At the software level the important fields are: head, cur, tail. 250 * head first slot available for transmission. 255 * [head .. tail-1] can be used for new packets to send; 256 * 'head' and 'cur' must be incremented as slots are filled 263 * head first valid received packet 268 * [head .. tail-1] contain received packets; 269 * 'head' and 'cur' must be incremented as slots are consumed 276 * [head 294 uint32_t head; /* (u) first user slot */ member in struct:netmap_ring 759 uint32_t head; /* AW+ KR+ the head of the appl netmap_ring */ member in struct:nm_csb_atok 822 nm_sync_kloop_appl_write(struct nm_csb_atok *atok, uint32_t cur, uint32_t head) argument [all...] |
/freebsd-11-stable/lib/libthr/thread/ |
H A D | thr_list.c | 257 struct thread_hash_head *head; local 259 head = &thr_hashtable[THREAD_HASH(thread)]; 260 LIST_INSERT_HEAD(head, thread, hle); 273 struct thread_hash_head *head; local 275 head = &thr_hashtable[THREAD_HASH(thread)]; 276 LIST_FOREACH(td, head, hle) {
|
/freebsd-11-stable/usr.sbin/cron/cron/ |
H A D | database.c | 118 new_db.head = new_db.tail = NULL; 189 for (u = old_db->head; u != NULL; u = nu) { 208 if (db->head == NULL) 209 db->head = u; 224 db->head = u->next; 243 for (u = db->head; u != NULL; u = u->next)
|
/freebsd-11-stable/usr.sbin/makefs/cd9660/ |
H A D | cd9660_eltorito.c | 365 *valid_entry, *default_entry, *temp, *head, **headp, *next; local 444 head = NULL; 473 head = 475 if (head == NULL) { 480 LIST_INSERT_AFTER(default_entry, head, ll_struct); 481 *headp = head; 483 head = *headp; 485 head->entry_data.SH.num_section_entries[0]++; 494 while ((next = LIST_NEXT(head, ll_struct)) != NULL && 496 head [all...] |
H A D | iso9660_rrip.c | 69 TAILQ_INIT(&(node->head)); 71 TAILQ_INIT(&(node->dot_record->head)); 73 TAILQ_INIT(&(node->dot_dot_record->head)); 151 TAILQ_FOREACH(t, &node->head, rr_ll) { 177 TAILQ_FOREACH(t, &node->head, rr_ll) { 221 TAILQ_FOREACH(temp, &node->head, rr_ll) { 250 TAILQ_INSERT_AFTER(&node->head, pre_ce, CE, rr_ll); 252 TAILQ_INSERT_HEAD(&node->head, CE, rr_ll); 268 TAILQ_INSERT_AFTER(&node->head, last, ST, rr_ll); 270 TAILQ_INSERT_HEAD(&node->head, S [all...] |
/freebsd-11-stable/contrib/atf/atf-c/ |
H A D | macros_test.c | 79 init_and_run_h_tc(const char *name, void (*head)(atf_tc_t *), 85 RE(atf_tc_init(&tc, name, head, body, NULL, config)); 241 void (*head)(atf_tc_t *); 258 for (t = &tests[0]; t->head != NULL; t++) { 259 init_and_run_h_tc("h_check_errno", t->head, t->body); 285 void (*head)(atf_tc_t *); 302 for (t = &tests[0]; t->head != NULL; t++) { 303 init_and_run_h_tc("h_require_errno", t->head, t->body); 340 void (*head)(atf_tc_t *); 357 for (t = &tests[0]; t->head ! 383 void (*head)(atf_tc_t *); member in struct:check_eq_test 605 void (*head)(atf_tc_t *); member in struct:require_eq_test [all...] |
/freebsd-11-stable/contrib/byacc/test/ |
H A D | grammar.y | 173 struct _Declarator *head; /* head function declarator */ 489 func_params = &($2->head->params); 502 && $2->head->func_def == func_style) { 503 $2->head->func_def = FUNC_BOTH; 524 func_params = &($1->head->params); 815 $$->head = ($1->func_stack == NULL) ? $$ : $1->head; 823 $$->head = ($1->func_stack == NULL) ? $$ : $1->head; [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | haifa-sched.c | 1327 /* Return the head and tail pointers of ebb starting at BEG and ending 1369 no_real_insns_p (rtx head, rtx tail) 1371 while (head != NEXT_INSN (tail)) 1373 if (!NOTE_P (head) && !LABEL_P (head)) 1375 head = NEXT_INSN (head); 1385 rm_line_notes (rtx head, rtx tail) 1391 for (insn = head; insn != next_tail; insn = NEXT_INSN (insn)) 1403 gcc_assert (prev != tail && prev != head 1365 no_real_insns_p(rtx head, rtx tail) argument 1381 rm_line_notes(rtx head, rtx tail) argument 1408 save_line_notes(int b, rtx head, rtx tail) argument 1434 restore_line_notes(rtx head, rtx tail) argument 1556 rm_other_notes(rtx head, rtx tail) argument 1616 rtx insn, next_tail, head, tail; local 2272 rtx head = NEXT_INSN (prev_head); local 2711 set_priorities(rtx head, rtx tail) argument 2928 fix_inter_tick(rtx head, rtx tail) argument 4106 dump_new_block_header(int i, basic_block bb, rtx head, rtx tail) argument 4607 check_cfg(rtx head, rtx tail) argument [all...] |
/freebsd-11-stable/usr.sbin/nscd/ |
H A D | cacheplcs.c | 117 TAILQ_INSERT_TAIL(&queue_policy->head, queue_item, entries); 131 TAILQ_REMOVE(&queue_policy->head, queue_item, entries); 143 return ((struct cache_policy_item_ *)TAILQ_FIRST(&queue_policy->head)); 154 return ((struct cache_policy_item_ *)TAILQ_LAST(&queue_policy->head, 218 TAILQ_INIT(&retval->head); 229 while (!TAILQ_EMPTY(&queue_policy->head)) { 230 queue_item = TAILQ_FIRST(&queue_policy->head); 231 TAILQ_REMOVE(&queue_policy->head, queue_item, entries); 294 TAILQ_REMOVE(&queue_policy->head, queue_item, entries); 295 TAILQ_INSERT_TAIL(&queue_policy->head, queue_ite [all...] |
/freebsd-11-stable/sys/contrib/zlib/ |
H A D | inflate.c | 134 state->head = Z_NULL; 674 if (state->head != Z_NULL) 675 state->head->done = -1; 719 if (state->head != Z_NULL) 720 state->head->text = (int)((hold >> 8) & 1); 727 if (state->head != Z_NULL) 728 state->head->time = hold; 735 if (state->head != Z_NULL) { 736 state->head->xflags = (int)(hold & 0xff); 737 state->head [all...] |
/freebsd-11-stable/sys/dev/tws/ |
H A D | tws_user.c | 229 if ( sc->aen_q.head == sc->aen_q.tail ) { 249 index = sc->aen_q.head; 257 index = sc->aen_q.head; 271 index = sc->aen_q.head; 380 volatile u_int16_t head, tail; local 384 head = cq->head; 391 if ( head == tail ) { /* q is full */ 394 cq->head = (head [all...] |
/freebsd-11-stable/sys/dev/netmap/ |
H A D | if_vtnet_netmap.h | 156 u_int const head = kring->rhead; local 171 if (nm_i != head) { /* we have new packets to send */ 174 for (; nm_i != head; nm_i = nm_next(nm_i, lim)) { 236 vtnet_netmap_kring_refill(struct netmap_kring *kring, u_int nm_i, u_int head) argument 253 for (; nm_i != head; nm_i = nm_next(nm_i, lim)) { 324 u_int const head = kring->rhead; local 376 nm_prdis("[B] h %d c %d hwcur %d hwtail %d", ring->head, ring->cur, 383 if (nm_i != head) { 384 int nm_j = vtnet_netmap_kring_refill(kring, nm_i, head); 391 nm_prdis("[C] h %d c %d t %d hwcur %d hwtail %d", ring->head, rin [all...] |
H A D | ixgbe_netmap.h | 180 u_int const head = kring->rhead; local 231 if (nm_i != head) { /* we have new packets to send */ 237 for (n = 0; nm_i != head; n++) { 276 kring->nr_hwcur = head; 367 u_int const head = kring->rhead; local 374 if (head > lim) 436 if (nm_i != head) { 438 for (n = 0; nm_i != head; n++) { 461 kring->nr_hwcur = head;
|
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | ntp_scanner.c | 282 struct FILE_INFO * head 286 while (NULL != head) { 287 tail = head->st_next; 288 lex_close(head); 289 head = tail; 291 return head; 315 /* This removes *all* input sources from the stack, leaving the head 333 * Returns TRUE if there is a head element (top-of-stack) that was not 384 struct FILE_INFO * head = lex_stack; local 387 if (NULL != head) { [all...] |
/freebsd-11-stable/tools/KSE/rr/ |
H A D | rr.c | 66 struct kse_thr_mailbox *head; member in struct:uts_runq 275 q->head = NULL; 286 tm->tm_next = q->head; 287 q->head = tm; 310 if (q->head == NULL) 313 for (p = q->head; p->tm_next != NULL; p = p->tm_next) 316 q->head = NULL;
|
/freebsd-11-stable/sys/netpfil/ipfw/ |
H A D | dn_sched_wf2q.c | 142 if (m != q->mq.head) { 145 if (m != q->mq.head) /* queue was already busy */ 247 if (q->mq.head == 0) { /* not backlogged any more. */ 251 uint64_t len = q->mq.head->m_pkthdr.len; 310 if (_q->mq.head != NULL) { 311 wf2qp_enqueue(_q->_si, _q, _q->mq.head); 337 if (q->mq.head == NULL) {
|
/freebsd-11-stable/usr.bin/procstat/ |
H A D | procstat_files.c | 291 struct filestat_list *head; local 307 head = procstat_getfiles(procstat, kipp, 0); 308 if (head != NULL && Cflag) { 309 STAILQ_FOREACH(fst, head, next) { 330 if (head == NULL) 335 STAILQ_FOREACH(fst, head, next) { 586 procstat_freefiles(procstat, head);
|
/freebsd-11-stable/sbin/routed/ |
H A D | radix.c | 68 struct radix_node_head *head, struct radix_node treenodes[2]); 69 static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head); 107 struct radix_node *head) 112 for (x = head, v = v_arg; x->rn_b >= 0;) { 123 struct radix_node *head, 129 for (x = head; x->rn_b >= 0;) { 166 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) argument 173 head->rnh_treetop->rn_off)) == NULL) 177 x = rn_match(v_arg, head); 207 struct radix_node_head *head) 106 rn_search(void *v_arg, struct radix_node *head) argument 122 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg) argument 206 rn_match(void *v_arg, struct radix_node_head *head) argument 345 rn_insert(void* v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument 521 rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head, struct radix_node treenodes[2]) argument 664 rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head) argument 854 rn_inithead(struct radix_node_head **head, int off) argument [all...] |
/freebsd-11-stable/lib/libc/gen/ |
H A D | fts-compat.c | 630 FTSENT *p, *head; local 741 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) { 759 fts_lfree(head); 783 fts_lfree(head); 833 if (head == NULL) 834 head = tail = p; 849 fts_padjust(sp, head); 886 head = fts_sort(sp, head, nitems); 887 return (head); 986 fts_sort(FTS *sp, FTSENT *head, int nitems) argument 1062 fts_lfree(FTSENT *head) argument 1105 fts_padjust(FTS *sp, FTSENT *head) argument [all...] |
/freebsd-11-stable/sys/dev/sym/ |
H A D | sym_fw2.h | 317 offsetof (struct sym_ccb, phys.head.savep), 322 offsetof (struct sym_ccb, phys.head.status), 631 offsetof (struct sym_ccb, phys.head.lastp), 656 offsetof (struct sym_ccb, phys.head.status), 666 offsetof (struct sym_ccb, phys.head.status), 742 offsetof (struct sym_ccb, phys.head.savep), 751 offsetof (struct sym_ccb, phys.head.savep), 779 offsetof (struct sym_ccb, phys.head.status), 796 offsetof (struct sym_ccb, phys.head.savep), 881 offsetof(struct sym_tcb, head [all...] |
/freebsd-11-stable/sys/dev/evdev/ |
H A D | cdev.c | 182 struct input_event *head; local 227 head = client->ec_buffer + client->ec_buffer_head; 231 TV_CP(*head, event.t32, time); 232 CP(*head, event.t32, type); 233 CP(*head, event.t32, code); 234 CP(*head, event.t32, value); 237 bcopy(head, &event.t, evsize); 791 size_t count, head, tail, ready; local 794 head = client->ec_buffer_head; 800 if ((tail + 1) % count == head) { 840 size_t i, head, tail, ready, size; local 878 size_t head, tail, count, i; local [all...] |
/freebsd-11-stable/contrib/ipfilter/ |
H A D | radix_ipf.c | 172 /* Paramters: head(I) - pointer to tree head to search */ 181 ipf_rx_match(head, addr) 182 ipf_rdx_head_t *head; 198 node = ipf_rx_find_addr(head->root, (u_32_t *)addr); 244 /* Paramters: head(I) - pointer to tree head to search */ 252 ipf_rx_lookup(head, addr, mask) 253 ipf_rdx_head_t *head; 261 found = ipf_rx_find_addr(head 1038 ipf_rdx_head_t *head = arg; local 1435 checktree(ipf_rdx_head_t *head) argument [all...] |
/freebsd-11-stable/sys/contrib/ipfilter/netinet/ |
H A D | radix_ipf.c | 172 /* Paramters: head(I) - pointer to tree head to search */ 181 ipf_rx_match(head, addr) 182 ipf_rdx_head_t *head; 198 node = ipf_rx_find_addr(head->root, (u_32_t *)addr); 244 /* Paramters: head(I) - pointer to tree head to search */ 252 ipf_rx_lookup(head, addr, mask) 253 ipf_rdx_head_t *head; 261 found = ipf_rx_find_addr(head 1038 ipf_rdx_head_t *head = arg; local 1435 checktree(ipf_rdx_head_t *head) argument [all...] |
/freebsd-11-stable/lib/libc/rpc/ |
H A D | getnetconfig.c | 104 struct netconfig_list *head; /* head of the list */ member in struct:netconfig_info 217 nc_vars->nc_configs = ni.head; 274 ncp->nc_configs = ni.head; 351 * If this is the first entry that's been read, it is the head of 357 if (ni.head == NULL) { /* first entry */ 358 ni.head = ni.tail = list; 411 q = ni.head; 413 ni.head = NULL; 467 if (ni.head ! [all...] |