Searched refs:head (Results 226 - 250 of 923) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/dev/netmap/
H A Dif_re_netmap.h77 u_int const head = kring->rhead; local
91 if (nm_i != head) { /* we have new packets to send */
95 for (n = 0; nm_i != head; n++) {
132 kring->nr_hwcur = head;
179 u_int const head = kring->rhead; local
186 if (head > lim)
235 if (nm_i != head) {
237 for (n = 0; nm_i != head; n++) {
266 kring->nr_hwcur = head;
H A Dnetmap.c1142 struct mbuf *head = NULL, *prev = NULL; local
1144 /* Send packets up, outside the lock; head/prev machinery
1150 if (head == NULL)
1151 head = prev;
1153 if (head)
1154 nm_os_send_up(dst, NULL, head);
1160 * Scan the buffers from hwcur to ring->head, and put a copy of those
1169 u_int const head = kring->rhead; local
1173 for (n = kring->nr_hwcur; n != head; n = nm_next(n, lim)) {
1223 * We can touch the TX netmap rings (slots, head an
1234 u_int const head = kring->rhead; local
1286 u_int const head = kring->rhead; local
1321 u_int const head = kring->rhead; local
1635 u_int head = ring->head; /* read only once */ local
1700 uint32_t head, cur; local
[all...]
/freebsd-11-stable/usr.sbin/cron/cron/
H A Dcron.c153 database.head = NULL;
209 for (u = db->head; u != NULL; u = u->next) {
257 for (u = db->head; u != NULL; u = u->next) {
272 for (u = db->head; u != NULL; u = u->next) {
287 for (u = db->head; u != NULL; u = u->next) {
314 for (u = db->head; u != NULL; u = u->next) {
473 for (u = db->head; u != NULL; u = u->next) {
570 for (u = db->head; u != NULL; u = u->next) {
585 for (u = database.head; u != NULL; u = u->next) {
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/profile/
H A DGCDAProfiling.c111 struct fn_node *head, *tail; member in struct:fn_list
135 if (!list->head) {
136 list->head = list->tail = new_node;
144 struct fn_node* curr = list->head;
152 if (curr == list->head) {
153 list->head = next;
609 struct fn_node *curr = writeout_fn_list.head;
630 struct fn_node* curr = flush_fn_list.head;
653 struct fn_node *curr = reset_fn_list.head;
/freebsd-11-stable/contrib/ntp/ntpd/
H A Dntp_monitor.c30 * relinked at the head of the MRU list. If not found, a new entry is
32 * head of the MRU list.
324 int head; /* headway increment */ local
360 /* Shuffle to the head of the MRU list. */
371 head = 1 << ntp_minpoll;
372 leak = mon->leak + head;
373 limit = NTP_SHIFT * head;
396 mon->leak = limit + head;
/freebsd-11-stable/sys/dev/ciss/
H A Dcissvar.h358 ciss_enqueue_complete(struct ciss_request *ac, cr_qhead_t *head) argument
361 STAILQ_INSERT_TAIL(head, ac, cr_link);
365 ciss_dequeue_complete(struct ciss_softc *sc, cr_qhead_t *head) argument
369 if ((ac = STAILQ_FIRST(head)) != NULL)
370 STAILQ_REMOVE_HEAD(head, cr_link);
/freebsd-11-stable/sys/dev/drm2/
H A Ddrm_context.c230 list_for_each_entry(r_list, &dev->maplist, head) {
375 INIT_LIST_HEAD(&ctx_entry->head);
380 list_add(&ctx_entry->head, &dev->ctxlist);
481 list_for_each_entry_safe(pos, n, &dev->ctxlist, head) {
483 list_del(&pos->head);
/freebsd-11-stable/lib/libc/gen/
H A Dfts.c628 FTSENT *p, *head; local
739 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
757 fts_lfree(head);
817 if (head == NULL)
818 head = tail = p;
833 fts_padjust(sp, head);
867 head = fts_sort(sp, head, nitems);
868 return (head);
974 fts_sort(FTS *sp, FTSENT *head, size_ argument
1050 fts_lfree(FTSENT *head) argument
1081 fts_padjust(FTS *sp, FTSENT *head) argument
[all...]
/freebsd-11-stable/usr.bin/paste/
H A Dpaste.c136 LIST *head, *tmp; local
139 for (cnt = 0, head = tmp = NULL; (p = *argv); ++argv, ++cnt) {
149 if (!head)
150 head = tmp = lp;
158 for (output = 0, lp = head; lp; lp = lp->next) {
/freebsd-11-stable/sys/dev/hatm/
H A Dif_hatm_intr.c160 while (q->head != (*tailp >> 2)) {
161 no = (q->tbrq[q->head].addr & HE_REGM_TBRQ_ADDR) >>
164 (q->tbrq[q->head].addr & HE_REGM_TBRQ_FLAGS));
166 if (++q->head == q->size)
167 q->head = 0;
169 WRITE4(sc, HE_REGO_TBRQ_H(group), q->head << 2);
322 rbp->head = (READ4(sc, HE_REGO_RBP_S(large, group)) >> HE_REGS_RBP_HEAD)
328 if (ntail == rbp->head)
509 if (rq->head == tail)
512 e = &rq->rbrq[rq->head];
[all...]
/freebsd-11-stable/contrib/ofed/libmlx5/
H A Dsrq.c106 if (srq->head == srq->tail) {
113 srq->wrid[srq->head] = wr->wr_id;
115 next = get_wqe(srq, srq->head);
116 srq->head = be16toh(next->next_wqe_index);
203 srq->head = 0;
/freebsd-11-stable/contrib/ofed/libibnetdisc/
H A Dquery_smp.c61 ibnd_smp_t *head = engine->smp_queue_head; local
63 ibnd_smp_t *rc = head;
64 if (head) {
65 if (tail == head)
67 engine->smp_queue_head = head->qnext;
/freebsd-11-stable/usr.bin/fstat/
H A Dfuser.c292 struct filestat_list *head; local
297 head = procstat_getfiles(procstat, kp, flags & MFLAG);
298 if (head == NULL)
300 STAILQ_FOREACH(fst, head, next) {
352 procstat_freefiles(procstat, head);
/freebsd-11-stable/contrib/gcc/
H A Dgenrecog.c1557 where we reach the head of the list or where we pass a
1612 factor_tests (struct decision_head *head)
1616 for (first = head->first; first && first->next; first = next)
1649 old_last = head->last;
1650 head->last = first;
1669 merge_trees (head, &h);
1677 next->prev = head->last;
1678 head->last->next = next;
1679 head->last = old_last;
1684 for (first = head
1607 factor_tests(struct decision_head *head) argument
1692 simplify_tests(struct decision_head *head) argument
1729 break_out_subroutines(struct decision_head *head, int initial) argument
1749 find_afterward(struct decision_head *head, struct decision *real_afterward) argument
2316 write_tree_1(struct decision_head *head, int depth, enum routine_type subroutine_type) argument
2350 write_tree(struct decision_head *head, const char *prevpos, enum routine_type type, int initial) argument
2407 write_subroutine(struct decision_head *head, enum routine_type type) argument
2462 write_subroutines(struct decision_head *head, enum routine_type type) argument
2547 struct decision_head head; local
2706 process_tree(struct decision_head *head, enum routine_type subroutine_type) argument
[all...]
/freebsd-11-stable/contrib/binutils/ld/
H A Dldlang.c823 lang_for_each_statement_worker (func, constructor_list.head);
827 (func, s->output_section_statement.children.head);
831 s->wild_statement.children.head);
835 s->group_statement.children.head);
859 lang_for_each_statement_worker (func, statement_list.head);
867 list->head = NULL;
868 list->tail = &list->head;
1046 if (lang_output_section_statement.head != NULL)
1303 first = &lang_output_section_statement.head->output_section_statement;
1551 && after != (&lang_output_section_statement.head
6555 lang_vers_match(struct bfd_elf_version_expr_head *head, struct bfd_elf_version_expr *prev, const char *sym) argument
6774 lang_finalize_version_expr_head(struct bfd_elf_version_expr_head *head) argument
[all...]
/freebsd-11-stable/sys/netgraph/netflow/
H A Dnetflow.c410 TAILQ_INSERT_TAIL(&hsh->head, fle, fle_hash);
498 TAILQ_INSERT_TAIL(&hsh6->head, (struct flow_entry *)fle6, fle_hash);
535 TAILQ_INIT(&hsh->head);
546 TAILQ_INIT(&hsh->head);
621 TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
622 TAILQ_REMOVE(&hsh->head, fle, fle_hash);
628 TAILQ_FOREACH_SAFE(fle, &hsh->head, fle_hash, fle1) {
629 TAILQ_REMOVE(&hsh->head, fle, fle_hash);
762 TAILQ_FOREACH_REVERSE_SAFE(fle, &hsh->head, fhead, fle_hash, fle1) {
766 TAILQ_REMOVE(&hsh->head, fl
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/
H A Dradix.c151 radix->head = NULL;
170 if (radix->head != NULL) {
174 isc_radix_node_t *Xrn = radix->head;
230 RADIX_WALK(radix->head, node) {
254 if (radix->head == NULL) {
258 node = radix->head;
324 if (radix->head == NULL) {
368 radix->head = node;
375 node = radix->head;
572 INSIST(radix->head
[all...]
/freebsd-11-stable/contrib/libreadline/
H A Dundo.c137 _rl_copy_undo_list (head)
138 UNDO_LIST *head;
142 list = head;
/freebsd-11-stable/sys/pc98/cbus/
H A Dsctermvar.h46 static __inline void sc_term_up(scr_stat *scp, int n, int head);
51 int attr, int head, int tail);
53 int attr, int head, int tail);
140 sc_term_up(scr_stat *scp, int n, int head) argument
144 n = imin(n, scp->ypos - head);
180 sc_term_up_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail) argument
186 if (n <= scp->ypos - head) {
189 sc_term_ins_line(scp, head, n - (scp->ypos - head),
191 sc_move_cursor(scp, scp->xpos, head);
196 sc_term_down_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail) argument
[all...]
/freebsd-11-stable/sys/netinet/
H A Dsctp_syscalls.c125 struct socket *head, *so; local
135 head = headfp->f_data;
136 if (head->so_proto->pr_protocol != IPPROTO_SCTP) {
140 error = sctp_can_peel_off(head, (sctp_assoc_t)uap->name);
154 CURVNET_SET(head->so_vnet);
155 so = sonewconn(head, SS_ISCONNECTED);
171 TAILQ_REMOVE(&head->so_comp, so, so_list);
172 head->so_qlen--;
173 so->so_state |= (head->so_state & SS_NBIO);
179 error = sctp_do_peeloff(head, s
[all...]
/freebsd-11-stable/contrib/gdb/gdb/
H A Dsolib-osf.c68 /* Per-module information structure referenced by ldr_context_t.head. */
107 CORE_ADDR head; member in struct:__anon1603
385 ctxt->next = ldr_context.head;
524 struct so_list *head = NULL, *tail, *newtail, so; local
547 if (!head)
548 head = newtail;
559 return head;
/freebsd-11-stable/crypto/heimdal/base/
H A Dheimbase.c386 struct heim_auto_release *head; member in struct:ar_tls
395 if (tls->head)
396 heim_release(tls->head);
455 if (tls->current != tls->head)
494 heim_abort("Failed to create/get autorelease head");
499 if (tls->head == NULL)
500 tls->head = ar;
/freebsd-11-stable/sys/dev/tws/
H A Dtws_services.c92 volatile u_int16_t head, tail; local
95 head = sc->trace_q.head;
109 if ( head == tail ) {
111 sc->trace_q.head = (head+1) % sc->trace_q.depth;
333 /* The given node is not at head or tail.
/freebsd-11-stable/usr.sbin/pmccontrol/
H A Dpmccontrol.c71 static STAILQ_HEAD(pmcc_op_list, pmcc_op) head = STAILQ_HEAD_INITIALIZER(head);
362 STAILQ_INIT(&head);
420 STAILQ_INSERT_TAIL(&head, p, op_next);
476 if (STAILQ_EMPTY(&head))
479 error = pmcc_do_enable_disable(&head);
/freebsd-11-stable/contrib/groff/src/preproc/html/
H A Dpre-html.cpp415 char_block *head; member in class:char_buffer
425 : head(0), tail(0)
435 while (head != NULL) {
436 char_block *temp = head;
437 head = head->next;
453 head = tail;
778 char_block *element = head;
850 imageItem *head; member in class:imageList
869 : head(
[all...]

Completed in 227 milliseconds

1234567891011>>