head 1108 altq/altq_hfsc.c ellist_t *head;
head 1110 altq/altq_hfsc.c MALLOC(head, ellist_t *, sizeof(ellist_t), M_DEVBUF, M_WAITOK);
head 1111 altq/altq_hfsc.c TAILQ_INIT(head);
head 1112 altq/altq_hfsc.c return (head);
head 1116 altq/altq_hfsc.c ellist_destroy(ellist_t *head)
head 1118 altq/altq_hfsc.c FREE(head, M_DEVBUF);
head 1190 altq/altq_hfsc.c ellist_get_mindl(ellist_t *head, u_int64_t cur_time)
head 1194 altq/altq_hfsc.c TAILQ_FOREACH(p, head, cl_ellist) {
head 1211 altq/altq_hfsc.c actlist_t *head;
head 1213 altq/altq_hfsc.c MALLOC(head, actlist_t *, sizeof(actlist_t), M_DEVBUF, M_WAITOK);
head 1214 altq/altq_hfsc.c TAILQ_INIT(head);
head 1215 altq/altq_hfsc.c return (head);
head 1219 altq/altq_hfsc.c actlist_destroy(actlist_t *head)
head 1221 altq/altq_hfsc.c FREE(head, M_DEVBUF);
head 527 altq/altq_rmclass.c struct rm_class *p, *head, *previous;
head 548 altq/altq_rmclass.c head = cl->parent_->children_;
head 549 altq/altq_rmclass.c p = previous = head;
head 550 altq/altq_rmclass.c if (head->next_ == NULL) {
head 551 altq/altq_rmclass.c ASSERT(head == cl);
head 556 altq/altq_rmclass.c if (cl == head)
head 44 arch/i386/include/ioctl_fd.h int cyl, head;
head 183 arch/i386/stand/libsa/biosdev.c CHS_rw(int rw, int dev, int cyl, int head, int sect, int nsect, void *buf)
head 201 arch/i386/stand/libsa/biosdev.c "b" (buf), "m" (sect), "m" (head),
head 284 arch/i386/stand/libsa/biosdev.c int cyl, head, sect;
head 292 arch/i386/stand/libsa/biosdev.c btochs(off, cyl, head, sect, bd->bios_heads,
head 300 arch/i386/stand/libsa/biosdev.c error = CHS_rw(rw, dev, cyl, head, sect, n, p);
head 111 compat/linux/linux_fdio.c lflop.head = fparams.heads;
head 49 compat/linux/linux_fdio.h u_int head;
head 160 compat/linux/linux_fdio.h u_int head;
head 180 dev/ata/ata_wdc.c u_int8_t head, sect, cmd = 0;
head 243 dev/ata/ata_wdc.c head = (ata_bio->blkno >> 24) & 0x0f;
head 244 dev/ata/ata_wdc.c head |= WDSD_LBA;
head 250 dev/ata/ata_wdc.c head = blkno % ata_bio->lp->d_ntracks;
head 253 dev/ata/ata_wdc.c head |= WDSD_CHS;
head 283 dev/ata/ata_wdc.c head, sect, nblks, 0);
head 318 dev/ata/ata_wdc.c head, sect, nblks,
head 1098 dev/ata/wd.c unit, va, cylin, head, sector);
head 103 dev/cardbus/cardbus_exrom.c struct cardbus_rom_image_head *head)
head 112 dev/cardbus/cardbus_exrom.c SIMPLEQ_INIT(head);
head 148 dev/cardbus/cardbus_exrom.c SIMPLEQ_INSERT_TAIL(head, image, next);
head 1314 dev/ic/acx.c struct acx_rxbuf_hdr *head;
head 1340 dev/ic/acx.c head = mtod(m, struct acx_rxbuf_hdr *);
head 1342 dev/ic/acx.c len = letoh16(head->rbh_len) & ACX_RXBUF_LEN_MASK;
head 1377 dev/ic/acx.c tap->wr_rssi = head->rbh_level;
head 1392 dev/ic/acx.c ieee80211_input(ifp, m, ni, head->rbh_level,
head 1393 dev/ic/acx.c letoh32(head->rbh_time));
head 979 dev/ic/i82596.c i82596_get(struct ie_softc *sc, int head, int totlen)
head 989 dev/ic/i82596.c (sc->memcopyin)(sc, &eh, IE_RBUF_ADDR(sc, head),
head 1055 dev/ic/i82596.c off = IE_RBUF_ADDR(sc,head) + thisrboff;
head 1066 dev/ic/i82596.c if (++head == sc->nrxbuf)
head 1067 dev/ic/i82596.c head = 0;
head 1233 dev/ic/i82596.c int buffer, head, xbase;
head 1267 dev/ic/i82596.c head = sc->xchead;
head 1268 dev/ic/i82596.c sc->xchead = (head + 1) % NTXBUF;
head 1269 dev/ic/i82596.c buffer = IE_XBUF_ADDR(sc, head);
head 1274 dev/ic/i82596.c sc->sc_dev.dv_xname, head, buffer);
head 1316 dev/ic/i82596.c sc->ie_bus_write16(sc, IE_XBD_FLAGS(xbase, head),
head 1318 dev/ic/i82596.c sc->ie_bus_write16(sc, IE_XBD_NEXT(xbase, head), 0xffff);
head 1319 dev/ic/i82596.c sc->ie_bus_write24(sc, IE_XBD_BUF(xbase, head),
head 1320 dev/ic/i82596.c sc->sc_maddr + IE_XBUF_ADDR(sc, head));
head 162 dev/ic/wdc.c unsigned int head = wdc_head;
head 166 dev/ic/wdc.c if (head < 0 || head > wdc_log_cap ||
head 168 dev/ic/wdc.c printf ("wdc_log: head %x wdc_tail %x\n", head,
head 190 dev/ic/wdc.c log_size = head - tail;
head 208 dev/ic/wdc.c if (head + request_size >= wdc_log_cap) {
head 209 dev/ic/wdc.c memset(&wdc_log_buf[head], 0, wdc_log_cap - head);
head 210 dev/ic/wdc.c head = 0;
head 213 dev/ic/wdc.c ptr = &wdc_log_buf[head];
head 218 dev/ic/wdc.c wdc_head = (head + request_size) % wdc_log_cap;
head 231 dev/ic/wdc.c unsigned int head = wdc_head;
head 236 dev/ic/wdc.c log_size = (head - tail);
head 254 dev/ic/wdc.c if (head < 0 || head > wdc_log_cap ||
head 256 dev/ic/wdc.c printf ("wdc_log: head %x tail %x\n", head,
head 1896 dev/ic/wdc.c wdccommand(chp, drive, command, cylin, head, sector, count, precomp)
head 1901 dev/ic/wdc.c u_int8_t head, sector, count, precomp;
head 1905 dev/ic/wdc.c chp->channel, drive, command, cylin, head, sector, count, precomp),
head 1907 dev/ic/wdc.c WDC_LOG_ATA_CMDLONG(chp, head, precomp, cylin, cylin >> 8, sector,
head 1911 dev/ic/wdc.c CHP_WRITE_REG(chp, wdr_sdh, WDSD_IBM | (drive << 4) | head);
head 2236 dev/ic/wdc.c wdc_c.r_head = wi->wi_atareq.head & 0x0f;
head 2269 dev/ic/wdc.c wi->wi_atareq.head = wdc_c.r_head ;
head 86 dev/ic/wdcevent.h u_int8_t head, u_int8_t precomp, u_int8_t cylinhi, u_int8_t cylinlo,
head 88 dev/ic/wdcevent.h char record[8] = { head, precomp, cylinhi, cylinlo,
head 618 dev/isa/fd.c int read, head, sec, i, nblks;
head 707 dev/isa/fd.c head = sec / type->sectrac;
head 708 dev/isa/fd.c sec -= head * type->sectrac;
head 711 dev/isa/fd.c block = (fd->sc_cylin * type->heads + head) * type->sectrac + sec;
head 725 dev/isa/fd.c read ? "read" : "write", fd->sc_drive, fd->sc_cylin, head,
head 735 dev/isa/fd.c out_fdc(iot, ioh, (head << 2) | fd->sc_drive);
head 745 dev/isa/fd.c out_fdc(iot, ioh, (head << 2) | fd->sc_drive);
head 747 dev/isa/fd.c out_fdc(iot, ioh, head);
head 1075 dev/isa/fd.c + finfo->head * type->sectrac) * fd_bsize / DEV_BSIZE;
head 1144 dev/isa/if_ie.c ie_buflen(sc, head)
head 1146 dev/isa/if_ie.c int head;
head 1149 dev/isa/if_ie.c return (sc->rbuffs[head]->ie_rbd_actual
head 1158 dev/isa/if_ie.c int head = sc->rbhead;
head 1165 dev/isa/if_ie.c i = sc->rbuffs[head]->ie_rbd_actual & IE_RBD_LAST;
head 1167 dev/isa/if_ie.c acc += ie_buflen(sc, head);
head 1168 dev/isa/if_ie.c head = (head + 1) % NRXBUF;
head 1240 dev/isa/if_ie.c int head;
head 1246 dev/isa/if_ie.c head = sc->rbhead;
head 1251 dev/isa/if_ie.c bcopy((caddr_t)sc->cbuffs[head], (caddr_t)ehp, sizeof *ehp);
head 1308 dev/isa/if_ie.c int thisrblen = ie_buflen(sc, head) - thisrboff,
head 1312 dev/isa/if_ie.c bcopy((caddr_t)(sc->cbuffs[head] + thisrboff),
head 1323 dev/isa/if_ie.c head = (head + 1) % NRXBUF;
head 1202 dev/pci/if_wpi.c struct wpi_rx_head *head;
head 1218 dev/pci/if_wpi.c head = (struct wpi_rx_head *)((caddr_t)(stat + 1) + stat->len);
head 1219 dev/pci/if_wpi.c tail = (struct wpi_rx_tail *)((caddr_t)(head + 1) + letoh16(head->len));
head 1223 dev/pci/if_wpi.c letoh16(head->len), (int8_t)stat->rssi, head->rate, head->chan,
head 1258 dev/pci/if_wpi.c m->m_data = (caddr_t)(head + 1);
head 1259 dev/pci/if_wpi.c m->m_pkthdr.len = m->m_len = letoh16(head->len);
head 1268 dev/pci/if_wpi.c htole16(ic->ic_channels[head->chan].ic_freq);
head 1270 dev/pci/if_wpi.c htole16(ic->ic_channels[head->chan].ic_flags);
head 1274 dev/pci/if_wpi.c tap->wr_antenna = (letoh16(head->flags) >> 4) & 0xf;
head 1275 dev/pci/if_wpi.c switch (head->rate) {
head 1293 dev/pci/if_wpi.c if (letoh16(head->flags) & 0x4)
head 1853 dev/pci/maestro.c salloc_insert(pool, head, zone, merge)
head 1855 dev/pci/maestro.c struct salloc_head *head;
head 1866 dev/pci/maestro.c SLIST_FOREACH(next, head, link) {
head 1879 dev/pci/maestro.c SLIST_INSERT_HEAD(head, zone, link);
head 1882 dev/pci/maestro.c SLIST_REMOVE(head, next, salloc_zone, link);
head 2819 dev/pci/pccbb.c struct pccbb_win_chain_head *head;
head 2822 dev/pci/pccbb.c head = &sc->sc_iowindow;
head 2825 dev/pci/pccbb.c head = &sc->sc_memwindow;
head 2831 dev/pci/pccbb.c if (pccbb_winlist_insert(head, addr, size, bsh, flags)) {
head 2834 dev/pci/pccbb.c (head == &sc->sc_memwindow) ? "mem" : "io");
head 2848 dev/pci/pccbb.c struct pccbb_win_chain_head *head;
head 2851 dev/pci/pccbb.c head = &sc->sc_iowindow;
head 2854 dev/pci/pccbb.c head = &sc->sc_memwindow;
head 2858 dev/pci/pccbb.c if (pccbb_winlist_delete(head, bsh, size)) {
head 2861 dev/pci/pccbb.c (head == &sc->sc_memwindow) ? "mem" : "io");
head 2869 dev/pci/pccbb.c pccbb_winlist_insert(head, start, size, bsh, flags)
head 2870 dev/pci/pccbb.c struct pccbb_win_chain_head *head;
head 2887 dev/pci/pccbb.c for (chainp = TAILQ_FIRST(head); chainp != NULL;
head 2891 dev/pci/pccbb.c TAILQ_INSERT_AFTER(head, chainp, elem, wc_list);
head 2895 dev/pci/pccbb.c TAILQ_INSERT_TAIL(head, elem, wc_list);
head 2900 dev/pci/pccbb.c pccbb_winlist_delete(head, bsh, size)
head 2901 dev/pci/pccbb.c struct pccbb_win_chain_head *head;
head 2907 dev/pci/pccbb.c for (chainp = TAILQ_FIRST(head); chainp != NULL;
head 2920 dev/pci/pccbb.c TAILQ_REMOVE(head, chainp, wc_list);
head 137 dev/raidframe/rf_desc.h RF_RaidAccessDesc_t *head;
head 650 dev/raidframe/rf_driver.c desc->head = desc;
head 181 dev/raidframe/rf_paritylog.c rf_EnqueueParityLogData(RF_ParityLogData_t *data, RF_ParityLogData_t **head,
head 200 dev/raidframe/rf_paritylog.c if (*head) {
head 202 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 204 dev/raidframe/rf_paritylog.c data->next = *head;
head 205 dev/raidframe/rf_paritylog.c (*head)->prev = data;
head 206 dev/raidframe/rf_paritylog.c *head = data;
head 209 dev/raidframe/rf_paritylog.c RF_ASSERT(*head == NULL);
head 211 dev/raidframe/rf_paritylog.c *head = data;
head 214 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 220 dev/raidframe/rf_paritylog.c rf_DequeueParityLogData(RF_Raid_t *raidPtr, RF_ParityLogData_t **head,
head 235 dev/raidframe/rf_paritylog.c if (*head == *tail) {
head 237 dev/raidframe/rf_paritylog.c *head = NULL;
head 242 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 253 dev/raidframe/rf_paritylog.c if (*head) {
head 254 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 264 dev/raidframe/rf_paritylog.c rf_RequeueParityLogData(RF_ParityLogData_t *data, RF_ParityLogData_t **head,
head 290 dev/raidframe/rf_paritylog.c *head = data;
head 292 dev/raidframe/rf_paritylog.c (*head)->prev = NULL;
head 295 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 379 dev/raidframe/rf_paritylog.c RF_ParityLogData_t **head, RF_ParityLogData_t **tail, int ignoreLocks)
head 401 dev/raidframe/rf_paritylog.c if (*head == *tail) {
head 403 dev/raidframe/rf_paritylog.c *head = NULL;
head 409 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 413 dev/raidframe/rf_paritylog.c if (w == *head) {
head 415 dev/raidframe/rf_paritylog.c *head = (*head)->next;
head 416 dev/raidframe/rf_paritylog.c (*head)->prev = NULL;
head 417 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 426 dev/raidframe/rf_paritylog.c RF_ASSERT((*head)->prev == NULL);
head 448 dev/raidframe/rf_paritylog.c rf_DequeueMatchingLogData(RF_Raid_t *raidPtr, RF_ParityLogData_t **head,
head 462 dev/raidframe/rf_paritylog.c logDataList = rf_DequeueParityLogData(raidPtr, head, tail, RF_TRUE);
head 467 dev/raidframe/rf_paritylog.c regionID, head, tail, RF_TRUE);
head 472 dev/raidframe/rf_paritylog.c head, tail, RF_TRUE);
head 1444 dev/usb/ehci.c ehci_add_qh(ehci_soft_qh_t *sqh, ehci_soft_qh_t *head)
head 1448 dev/usb/ehci.c sqh->next = head->next;
head 1449 dev/usb/ehci.c sqh->prev = head;
head 1450 dev/usb/ehci.c sqh->qh.qh_link = head->qh.qh_link;
head 1451 dev/usb/ehci.c head->next = sqh;
head 1454 dev/usb/ehci.c head->qh.qh_link = htole32(sqh->physaddr | EHCI_LINK_QH);
head 1469 dev/usb/ehci.c ehci_rem_qh(ehci_softc_t *sc, ehci_soft_qh_t *sqh, ehci_soft_qh_t *head)
head 2390 dev/usb/ehci.c ehci_close_pipe(usbd_pipe_handle pipe, ehci_soft_qh_t *head)
head 2398 dev/usb/ehci.c ehci_rem_qh(sc, sqh, head);
head 1784 dev/usb/ohci.c ohci_add_ed(ohci_soft_ed_t *sed, ohci_soft_ed_t *head)
head 1786 dev/usb/ohci.c DPRINTFN(8,("ohci_add_ed: sed=%p head=%p\n", sed, head));
head 1789 dev/usb/ohci.c sed->next = head->next;
head 1790 dev/usb/ohci.c sed->ed.ed_nexted = head->ed.ed_nexted;
head 1791 dev/usb/ohci.c head->next = sed;
head 1792 dev/usb/ohci.c head->ed.ed_nexted = htole32(sed->physaddr);
head 1799 dev/usb/ohci.c ohci_rem_ed(ohci_soft_ed_t *sed, ohci_soft_ed_t *head)
head 1806 dev/usb/ohci.c for (p = head; p != NULL && p->next != sed; p = p->next)
head 2128 dev/usb/ohci.c ohci_close_pipe(usbd_pipe_handle pipe, ohci_soft_ed_t *head)
head 2161 dev/usb/ohci.c ohci_rem_ed(sed, head);
head 190 kern/kern_subr.c hook_establish(struct hook_desc_head *head, int tail, void (*fn)(void *),
head 202 kern/kern_subr.c TAILQ_INSERT_TAIL(head, hdp, hd_list);
head 204 kern/kern_subr.c TAILQ_INSERT_HEAD(head, hdp, hd_list);
head 210 kern/kern_subr.c hook_disestablish(struct hook_desc_head *head, void *vhook)
head 215 kern/kern_subr.c for (hdp = TAILQ_FIRST(head); hdp != NULL;
head 223 kern/kern_subr.c TAILQ_REMOVE(head, hdp, hd_list);
head 234 kern/kern_subr.c dohooks(struct hook_desc_head *head, int flags)
head 239 kern/kern_subr.c TAILQ_FOREACH(hdp, head, hd_list) {
head 243 kern/kern_subr.c while ((hdp = TAILQ_FIRST(head)) != NULL) {
head 244 kern/kern_subr.c TAILQ_REMOVE(head, hdp, hd_list);
head 937 kern/subr_disk.c struct buf *head;
head 940 kern/subr_disk.c head = &bufq->bufq_head[0];
head 942 kern/subr_disk.c head = &bufq->bufq_head[1];
head 944 kern/subr_disk.c head = &bufq->bufq_head[2];
head 946 kern/subr_disk.c disksort(head, bp);
head 953 kern/subr_disk.c struct buf *bp, *head;
head 957 kern/subr_disk.c head = &bufq->bufq_head[i];
head 958 kern/subr_disk.c if ((bp = head->b_actf))
head 963 kern/subr_disk.c head->b_actf = bp->b_actf;
head 101 kern/uipc_socket2.c struct socket *head = so->so_head;
head 105 kern/uipc_socket2.c if (head && soqremque(so, 0)) {
head 106 kern/uipc_socket2.c soqinsque(head, so, 1);
head 107 kern/uipc_socket2.c sorwakeup(head);
head 108 kern/uipc_socket2.c wakeup_one(&head->so_timeo);
head 149 kern/uipc_socket2.c sonewconn(struct socket *head, int connstatus)
head 160 kern/uipc_socket2.c if (head->so_qlen + head->so_q0len > head->so_qlimit * 3)
head 166 kern/uipc_socket2.c so->so_type = head->so_type;
head 167 kern/uipc_socket2.c so->so_options = head->so_options &~ SO_ACCEPTCONN;
head 168 kern/uipc_socket2.c so->so_linger = head->so_linger;
head 169 kern/uipc_socket2.c so->so_state = head->so_state | SS_NOFDREF;
head 170 kern/uipc_socket2.c so->so_proto = head->so_proto;
head 171 kern/uipc_socket2.c so->so_timeo = head->so_timeo;
head 172 kern/uipc_socket2.c so->so_pgid = head->so_pgid;
head 173 kern/uipc_socket2.c so->so_euid = head->so_euid;
head 174 kern/uipc_socket2.c so->so_ruid = head->so_ruid;
head 175 kern/uipc_socket2.c so->so_egid = head->so_egid;
head 176 kern/uipc_socket2.c so->so_rgid = head->so_rgid;
head 177 kern/uipc_socket2.c so->so_cpid = head->so_cpid;
head 178 kern/uipc_socket2.c so->so_siguid = head->so_siguid;
head 179 kern/uipc_socket2.c so->so_sigeuid = head->so_sigeuid;
head 185 kern/uipc_socket2.c snd_sb_hiwat = head->so_snd.sb_hiwat;
head 188 kern/uipc_socket2.c rcv_sb_hiwat = head->so_rcv.sb_hiwat;
head 193 kern/uipc_socket2.c soqinsque(head, so, soqueue);
head 201 kern/uipc_socket2.c sorwakeup(head);
head 202 kern/uipc_socket2.c wakeup(&head->so_timeo);
head 209 kern/uipc_socket2.c soqinsque(struct socket *head, struct socket *so, int q)
head 217 kern/uipc_socket2.c so->so_head = head;
head 219 kern/uipc_socket2.c head->so_q0len++;
head 220 kern/uipc_socket2.c so->so_onq = &head->so_q0;
head 222 kern/uipc_socket2.c head->so_qlen++;
head 223 kern/uipc_socket2.c so->so_onq = &head->so_q;
head 231 kern/uipc_socket2.c struct socket *head;
head 233 kern/uipc_socket2.c head = so->so_head;
head 235 kern/uipc_socket2.c if (so->so_onq != &head->so_q0)
head 237 kern/uipc_socket2.c head->so_q0len--;
head 239 kern/uipc_socket2.c if (so->so_onq != &head->so_q)
head 241 kern/uipc_socket2.c head->so_qlen--;
head 152 kern/uipc_syscalls.c struct socket *head, *so;
head 162 kern/uipc_syscalls.c head = fp->f_data;
head 163 kern/uipc_syscalls.c if ((head->so_options & SO_ACCEPTCONN) == 0) {
head 167 kern/uipc_syscalls.c if ((head->so_state & SS_NBIO) && head->so_qlen == 0) {
head 168 kern/uipc_syscalls.c if (head->so_state & SS_CANTRCVMORE)
head 174 kern/uipc_syscalls.c while (head->so_qlen == 0 && head->so_error == 0) {
head 175 kern/uipc_syscalls.c if (head->so_state & SS_CANTRCVMORE) {
head 176 kern/uipc_syscalls.c head->so_error = ECONNABORTED;
head 179 kern/uipc_syscalls.c error = tsleep(&head->so_timeo, PSOCK | PCATCH, netcon, 0);
head 184 kern/uipc_syscalls.c if (head->so_error) {
head 185 kern/uipc_syscalls.c error = head->so_error;
head 186 kern/uipc_syscalls.c head->so_error = 0;
head 197 kern/uipc_syscalls.c so = TAILQ_FIRST(&head->so_q);
head 212 kern/uipc_syscalls.c so->so_head = head;
head 213 kern/uipc_syscalls.c head->so_qlen++;
head 214 kern/uipc_syscalls.c so->so_onq = &head->so_q;
head 216 kern/uipc_syscalls.c wakeup_one(&head->so_timeo);
head 222 kern/uipc_syscalls.c KNOTE(&head->so_rcv.sb_sel.si_note, 0);
head 132 kern/vfs_lockf.c lf_advlock(struct lockf **head, off_t size, caddr_t id, int op,
head 174 kern/vfs_lockf.c if (*head == NULL) {
head 190 kern/vfs_lockf.c lock->lf_head = head;
head 227 kern/vfs_lockf.c struct lockf **head = lock->lf_head;
head 340 kern/vfs_lockf.c prev = head;
head 341 kern/vfs_lockf.c block = *head;
head 469 kern/vfs_lockf.c struct lockf **head = lock->lf_head;
head 470 kern/vfs_lockf.c struct lockf *lf = *head;
head 480 kern/vfs_lockf.c prev = head;
head 118 lib/libz/inflate.c state->head = Z_NULL;
head 608 lib/libz/inflate.c if (state->head != Z_NULL)
head 609 lib/libz/inflate.c state->head->done = -1;
head 671 lib/libz/inflate.c if (state->head != Z_NULL)
head 672 lib/libz/inflate.c state->head->text = (int)((hold >> 8) & 1);
head 678 lib/libz/inflate.c if (state->head != Z_NULL)
head 679 lib/libz/inflate.c state->head->time = hold;
head 685 lib/libz/inflate.c if (state->head != Z_NULL) {
head 686 lib/libz/inflate.c state->head->xflags = (int)(hold & 0xff);
head 687 lib/libz/inflate.c state->head->os = (int)(hold >> 8);
head 696 lib/libz/inflate.c if (state->head != Z_NULL)
head 697 lib/libz/inflate.c state->head->extra_len = (unsigned)hold;
head 701 lib/libz/inflate.c else if (state->head != Z_NULL)
head 702 lib/libz/inflate.c state->head->extra = Z_NULL;
head 709 lib/libz/inflate.c if (state->head != Z_NULL &&
head 710 lib/libz/inflate.c state->head->extra != Z_NULL) {
head 711 lib/libz/inflate.c len = state->head->extra_len - state->length;
head 712 lib/libz/inflate.c zmemcpy(state->head->extra + len, next,
head 713 lib/libz/inflate.c len + copy > state->head->extra_max ?
head 714 lib/libz/inflate.c state->head->extra_max - len : copy);
head 732 lib/libz/inflate.c if (state->head != Z_NULL &&
head 733 lib/libz/inflate.c state->head->name != Z_NULL &&
head 734 lib/libz/inflate.c state->length < state->head->name_max)
head 735 lib/libz/inflate.c state->head->name[state->length++] = len;
head 743 lib/libz/inflate.c else if (state->head != Z_NULL)
head 744 lib/libz/inflate.c state->head->name = Z_NULL;
head 753 lib/libz/inflate.c if (state->head != Z_NULL &&
head 754 lib/libz/inflate.c state->head->comment != Z_NULL &&
head 755 lib/libz/inflate.c state->length < state->head->comm_max)
head 756 lib/libz/inflate.c state->head->comment[state->length++] = len;
head 764 lib/libz/inflate.c else if (state->head != Z_NULL)
head 765 lib/libz/inflate.c state->head->comment = Z_NULL;
head 781 lib/libz/inflate.c if (state->head != Z_NULL) {
head 782 lib/libz/inflate.c state->head->hcrc = (int)((state->flags >> 9) & 1);
head 783 lib/libz/inflate.c state->head->done = 1;
head 1293 lib/libz/inflate.c int ZEXPORT inflateGetHeader(strm, head)
head 1295 lib/libz/inflate.c gz_headerp head;
head 1305 lib/libz/inflate.c state->head = head;
head 1306 lib/libz/inflate.c head->done = 0;
head 86 lib/libz/inflate.h gz_headerp head; /* where to save gzip header information */
head 671 lib/libz/zlib.h gz_headerp head));
head 817 lib/libz/zlib.h gz_headerp head));
head 1243 net/pf.c while (head[i] != cur) { \
head 1244 net/pf.c head[i]->skip[i].ptr = cur; \
head 1245 net/pf.c head[i] = TAILQ_NEXT(head[i], entries); \
head 1252 net/pf.c struct pf_rule *cur, *prev, *head[PF_SKIP_COUNT];
head 1258 net/pf.c head[i] = cur;
head 355 net/pf_ioctl.c tagname2tag(struct pf_tags *head, char *tagname)
head 360 net/pf_ioctl.c TAILQ_FOREACH(tag, head, entries)
head 373 net/pf_ioctl.c if (!TAILQ_EMPTY(head))
head 374 net/pf_ioctl.c for (p = TAILQ_FIRST(head); p != NULL &&
head 394 net/pf_ioctl.c TAILQ_INSERT_TAIL(head, tag, entries);
head 400 net/pf_ioctl.c tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p)
head 404 net/pf_ioctl.c TAILQ_FOREACH(tag, head, entries)
head 412 net/pf_ioctl.c tag_unref(struct pf_tags *head, u_int16_t tag)
head 419 net/pf_ioctl.c for (p = TAILQ_FIRST(head); p != NULL; p = next) {
head 423 net/pf_ioctl.c TAILQ_REMOVE(head, p, entries);
head 775 net/pf_table.c struct radix_node_head *head;
head 782 net/pf_table.c head = kt->pfrkt_ip4;
head 785 net/pf_table.c head = kt->pfrkt_ip6;
head 790 net/pf_table.c ke = (struct pfr_kentry *)rn_lookup(&sa, &mask, head);
head 795 net/pf_table.c ke = (struct pfr_kentry *)rn_match(&sa, head);
head 978 net/pf_table.c struct radix_node_head *head;
head 983 net/pf_table.c head = kt->pfrkt_ip4;
head 985 net/pf_table.c head = kt->pfrkt_ip6;
head 990 net/pf_table.c rn = rn_addroute(&ke->pfrke_sa, &mask, head, ke->pfrke_node);
head 992 net/pf_table.c rn = rn_addroute(&ke->pfrke_sa, NULL, head, ke->pfrke_node);
head 1003 net/pf_table.c struct radix_node_head *head;
head 1007 net/pf_table.c head = kt->pfrkt_ip4;
head 1009 net/pf_table.c head = kt->pfrkt_ip6;
head 1014 net/pf_table.c rn = rn_delete(&ke->pfrke_sa, &mask, head, NULL);
head 1016 net/pf_table.c rn = rn_delete(&ke->pfrke_sa, NULL, head, NULL);
head 108 net/radix.c rn_search(void *v_arg, struct radix_node *head)
head 113 net/radix.c for (x = head, v = v_arg; x->rn_b >= 0;) {
head 123 net/radix.c rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
head 128 net/radix.c for (x = head; x->rn_b >= 0;) {
head 165 net/radix.c rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
head 171 net/radix.c if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
head 175 net/radix.c x = rn_match(v_arg, head);
head 202 net/radix.c rn_match(void *v_arg, struct radix_node_head *head)
head 205 net/radix.c struct radix_node *t = head->rnh_treetop, *x;
head 331 net/radix.c rn_insert(void *v_arg, struct radix_node_head *head,
head 335 net/radix.c struct radix_node *top = head->rnh_treetop;
head 505 net/radix.c rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
head 510 net/radix.c struct radix_node *saved_tt, *top = head->rnh_treetop;
head 533 net/radix.c saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
head 538 net/radix.c if (rn_mpath_capable(head) && netmask == tt->rn_mask) {
head 685 net/radix.c rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head,
head 699 net/radix.c x = head->rnh_treetop;
head 932 net/radix.c rn_inithead(void **head, int off)
head 936 net/radix.c if (*head)
head 941 net/radix.c *head = rnh;
head 111 net/radix.h struct radix_node_head *head, struct radix_node nodes[]);
head 114 net/radix.h struct radix_node_head *head, struct radix_node *rn);
head 117 net/radix.h struct radix_node_head *head);
head 120 net/radix.h struct radix_node_head *head);
head 278 net/radix_mpath.c rn_mpath_inithead(void **head, int off)
head 284 net/radix_mpath.c if (rn_inithead(head, off) == 1) {
head 285 net/radix_mpath.c rnh = (struct radix_node_head *)*head;
head 267 net/zlib.c Posf *head; /* Heads of the hash chains or NIL. */
head 580 net/zlib.c s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
head 581 net/zlib.c s->head[s->ins_h] = (str))
head 588 net/zlib.c s->head[s->hash_size-1] = NIL; \
head 589 net/zlib.c zmemzero((charf *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
head 648 net/zlib.c s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));
head 654 net/zlib.c if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
head 876 net/zlib.c TRY_FREE(strm, state->head, state->hash_size * sizeof(Pos));
head 1161 net/zlib.c p = &s->head[n];
head 926 netinet/in_pcb.c struct inpcbhead *head;
head 930 netinet/in_pcb.c head = INPCBHASH(table, &faddr, fport, &laddr, lport);
head 931 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 945 netinet/in_pcb.c if (inp != LIST_FIRST(head)) {
head 947 netinet/in_pcb.c LIST_INSERT_HEAD(head, inp, inp_hash);
head 969 netinet/in_pcb.c struct inpcbhead *head;
head 973 netinet/in_pcb.c head = IN6PCBHASH(table, faddr, fport, laddr, lport);
head 974 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 985 netinet/in_pcb.c if (inp != LIST_FIRST(head)) {
head 987 netinet/in_pcb.c LIST_INSERT_HEAD(head, inp, inp_hash);
head 1017 netinet/in_pcb.c struct inpcbhead *head;
head 1030 netinet/in_pcb.c head = INPCBHASH(table, &zeroin_addr, 0, key1, lport);
head 1031 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 1042 netinet/in_pcb.c head = INPCBHASH(table, &zeroin_addr, 0, key2, lport);
head 1043 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 1065 netinet/in_pcb.c if (inp != NULL && inp != LIST_FIRST(head)) {
head 1067 netinet/in_pcb.c LIST_INSERT_HEAD(head, inp, inp_hash);
head 1080 netinet/in_pcb.c struct inpcbhead *head;
head 1093 netinet/in_pcb.c head = IN6PCBHASH(table, &zeroin6_addr, 0, key1, lport);
head 1094 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 1103 netinet/in_pcb.c head = IN6PCBHASH(table, &zeroin6_addr, 0, key2, lport);
head 1104 netinet/in_pcb.c LIST_FOREACH(inp, head, inp_hash) {
head 1124 netinet/in_pcb.c if (inp != NULL && inp != LIST_FIRST(head)) {
head 1126 netinet/in_pcb.c LIST_INSERT_HEAD(head, inp, inp_hash);
head 171 netinet6/in6_pcb.c struct inpcbtable *head = inp->inp_table;
head 278 netinet6/in6_pcb.c t = in_pcblookup(head,
head 495 netinet6/in6_pcb.c in6_pcbnotify(head, dst, fport_arg, src, lport_arg, cmd, cmdarg, notify)
head 496 netinet6/in6_pcb.c struct inpcbtable *head;
head 548 netinet6/in6_pcb.c for (inp = CIRCLEQ_FIRST(&head->inpt_queue);
head 549 netinet6/in6_pcb.c inp != CIRCLEQ_END(&head->inpt_queue); inp = ninp) {
head 129 scsi/scsi_disk.h u_int8_t head;
head 136 scsi/scsi_disk.h u_int8_t head;
head 16 sys/ataio.h u_char head; /* head number */
head 99 sys/queue.h #define SLIST_HEAD_INITIALIZER(head) \
head 110 sys/queue.h #define SLIST_FIRST(head) ((head)->slh_first)
head 111 sys/queue.h #define SLIST_END(head) NULL
head 112 sys/queue.h #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head))
head 115 sys/queue.h #define SLIST_FOREACH(var, head, field) \
head 116 sys/queue.h for((var) = SLIST_FIRST(head); \
head 117 sys/queue.h (var) != SLIST_END(head); \
head 120 sys/queue.h #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
head 121 sys/queue.h for ((varp) = &SLIST_FIRST((head)); \
head 122 sys/queue.h ((var) = *(varp)) != SLIST_END(head); \
head 128 sys/queue.h #define SLIST_INIT(head) { \
head 129 sys/queue.h SLIST_FIRST(head) = SLIST_END(head); \
head 137 sys/queue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \
head 138 sys/queue.h (elm)->field.sle_next = (head)->slh_first; \
head 139 sys/queue.h (head)->slh_first = (elm); \
head 142 sys/queue.h #define SLIST_REMOVE_NEXT(head, elm, field) do { \
head 146 sys/queue.h #define SLIST_REMOVE_HEAD(head, field) do { \
head 147 sys/queue.h (head)->slh_first = (head)->slh_first->field.sle_next; \
head 150 sys/queue.h #define SLIST_REMOVE(head, elm, type, field) do { \
head 151 sys/queue.h if ((head)->slh_first == (elm)) { \
head 152 sys/queue.h SLIST_REMOVE_HEAD((head), field); \
head 154 sys/queue.h struct type *curelm = (head)->slh_first; \
head 172 sys/queue.h #define LIST_HEAD_INITIALIZER(head) \
head 184 sys/queue.h #define LIST_FIRST(head) ((head)->lh_first)
head 185 sys/queue.h #define LIST_END(head) NULL
head 186 sys/queue.h #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head))
head 189 sys/queue.h #define LIST_FOREACH(var, head, field) \
head 190 sys/queue.h for((var) = LIST_FIRST(head); \
head 191 sys/queue.h (var)!= LIST_END(head); \
head 197 sys/queue.h #define LIST_INIT(head) do { \
head 198 sys/queue.h LIST_FIRST(head) = LIST_END(head); \
head 216 sys/queue.h #define LIST_INSERT_HEAD(head, elm, field) do { \
head 217 sys/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \
head 218 sys/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
head 219 sys/queue.h (head)->lh_first = (elm); \
head 220 sys/queue.h (elm)->field.le_prev = &(head)->lh_first; \
head 251 sys/queue.h #define SIMPLEQ_HEAD_INITIALIZER(head) \
head 252 sys/queue.h { NULL, &(head).sqh_first }
head 262 sys/queue.h #define SIMPLEQ_FIRST(head) ((head)->sqh_first)
head 263 sys/queue.h #define SIMPLEQ_END(head) NULL
head 264 sys/queue.h #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))
head 267 sys/queue.h #define SIMPLEQ_FOREACH(var, head, field) \
head 268 sys/queue.h for((var) = SIMPLEQ_FIRST(head); \
head 269 sys/queue.h (var) != SIMPLEQ_END(head); \
head 275 sys/queue.h #define SIMPLEQ_INIT(head) do { \
head 276 sys/queue.h (head)->sqh_first = NULL; \
head 277 sys/queue.h (head)->sqh_last = &(head)->sqh_first; \
head 280 sys/queue.h #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
head 281 sys/queue.h if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
head 282 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
head 283 sys/queue.h (head)->sqh_first = (elm); \
head 286 sys/queue.h #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
head 288 sys/queue.h *(head)->sqh_last = (elm); \
head 289 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
head 292 sys/queue.h #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
head 294 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
head 298 sys/queue.h #define SIMPLEQ_REMOVE_HEAD(head, field) do { \
head 299 sys/queue.h if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
head 300 sys/queue.h (head)->sqh_last = &(head)->sqh_first; \
head 312 sys/queue.h #define TAILQ_HEAD_INITIALIZER(head) \
head 313 sys/queue.h { NULL, &(head).tqh_first }
head 324 sys/queue.h #define TAILQ_FIRST(head) ((head)->tqh_first)
head 325 sys/queue.h #define TAILQ_END(head) NULL
head 327 sys/queue.h #define TAILQ_LAST(head, headname) \
head 328 sys/queue.h (*(((struct headname *)((head)->tqh_last))->tqh_last))
head 332 sys/queue.h #define TAILQ_EMPTY(head) \
head 333 sys/queue.h (TAILQ_FIRST(head) == TAILQ_END(head))
head 335 sys/queue.h #define TAILQ_FOREACH(var, head, field) \
head 336 sys/queue.h for((var) = TAILQ_FIRST(head); \
head 337 sys/queue.h (var) != TAILQ_END(head); \
head 340 sys/queue.h #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
head 341 sys/queue.h for((var) = TAILQ_LAST(head, headname); \
head 342 sys/queue.h (var) != TAILQ_END(head); \
head 348 sys/queue.h #define TAILQ_INIT(head) do { \
head 349 sys/queue.h (head)->tqh_first = NULL; \
head 350 sys/queue.h (head)->tqh_last = &(head)->tqh_first; \
head 353 sys/queue.h #define TAILQ_INSERT_HEAD(head, elm, field) do { \
head 354 sys/queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
head 355 sys/queue.h (head)->tqh_first->field.tqe_prev = \
head 358 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
head 359 sys/queue.h (head)->tqh_first = (elm); \
head 360 sys/queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \
head 363 sys/queue.h #define TAILQ_INSERT_TAIL(head, elm, field) do { \
head 365 sys/queue.h (elm)->field.tqe_prev = (head)->tqh_last; \
head 366 sys/queue.h *(head)->tqh_last = (elm); \
head 367 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
head 370 sys/queue.h #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
head 375 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
head 387 sys/queue.h #define TAILQ_REMOVE(head, elm, field) do { \
head 392 sys/queue.h (head)->tqh_last = (elm)->field.tqe_prev; \
head 398 sys/queue.h #define TAILQ_REPLACE(head, elm, elm2, field) do { \
head 403 sys/queue.h (head)->tqh_last = &(elm2)->field.tqe_next; \
head 419 sys/queue.h #define CIRCLEQ_HEAD_INITIALIZER(head) \
head 420 sys/queue.h { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
head 431 sys/queue.h #define CIRCLEQ_FIRST(head) ((head)->cqh_first)
head 432 sys/queue.h #define CIRCLEQ_LAST(head) ((head)->cqh_last)
head 433 sys/queue.h #define CIRCLEQ_END(head) ((void *)(head))
head 436 sys/queue.h #define CIRCLEQ_EMPTY(head) \
head 437 sys/queue.h (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))
head 439 sys/queue.h #define CIRCLEQ_FOREACH(var, head, field) \
head 440 sys/queue.h for((var) = CIRCLEQ_FIRST(head); \
head 441 sys/queue.h (var) != CIRCLEQ_END(head); \
head 444 sys/queue.h #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
head 445 sys/queue.h for((var) = CIRCLEQ_LAST(head); \
head 446 sys/queue.h (var) != CIRCLEQ_END(head); \
head 452 sys/queue.h #define CIRCLEQ_INIT(head) do { \
head 453 sys/queue.h (head)->cqh_first = CIRCLEQ_END(head); \
head 454 sys/queue.h (head)->cqh_last = CIRCLEQ_END(head); \
head 457 sys/queue.h #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
head 460 sys/queue.h if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \
head 461 sys/queue.h (head)->cqh_last = (elm); \
head 467 sys/queue.h #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
head 470 sys/queue.h if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \
head 471 sys/queue.h (head)->cqh_first = (elm); \
head 477 sys/queue.h #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
head 478 sys/queue.h (elm)->field.cqe_next = (head)->cqh_first; \
head 479 sys/queue.h (elm)->field.cqe_prev = CIRCLEQ_END(head); \
head 480 sys/queue.h if ((head)->cqh_last == CIRCLEQ_END(head)) \
head 481 sys/queue.h (head)->cqh_last = (elm); \
head 483 sys/queue.h (head)->cqh_first->field.cqe_prev = (elm); \
head 484 sys/queue.h (head)->cqh_first = (elm); \
head 487 sys/queue.h #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
head 488 sys/queue.h (elm)->field.cqe_next = CIRCLEQ_END(head); \
head 489 sys/queue.h (elm)->field.cqe_prev = (head)->cqh_last; \
head 490 sys/queue.h if ((head)->cqh_first == CIRCLEQ_END(head)) \
head 491 sys/queue.h (head)->cqh_first = (elm); \
head 493 sys/queue.h (head)->cqh_last->field.cqe_next = (elm); \
head 494 sys/queue.h (head)->cqh_last = (elm); \
head 497 sys/queue.h #define CIRCLEQ_REMOVE(head, elm, field) do { \
head 498 sys/queue.h if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \
head 499 sys/queue.h (head)->cqh_last = (elm)->field.cqe_prev; \
head 503 sys/queue.h if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \
head 504 sys/queue.h (head)->cqh_first = (elm)->field.cqe_next; \
head 512 sys/queue.h #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \
head 514 sys/queue.h CIRCLEQ_END(head)) \
head 515 sys/queue.h (head).cqh_last = (elm2); \
head 519 sys/queue.h CIRCLEQ_END(head)) \
head 520 sys/queue.h (head).cqh_first = (elm2); \
head 227 sys/socketvar.h struct socket *sonewconn(struct socket *head, int connstatus);
head 296 sys/socketvar.h struct socket *sonewconn(struct socket *head, int connstatus);
head 297 sys/socketvar.h void soqinsque(struct socket *head, struct socket *so, int q);
head 77 sys/tree.h #define SPLAY_ROOT(head) (head)->sph_root
head 78 sys/tree.h #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
head 81 sys/tree.h #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
head 82 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
head 83 sys/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
head 84 sys/tree.h (head)->sph_root = tmp; \
head 87 sys/tree.h #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
head 88 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
head 89 sys/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \
head 90 sys/tree.h (head)->sph_root = tmp; \
head 93 sys/tree.h #define SPLAY_LINKLEFT(head, tmp, field) do { \
head 94 sys/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \
head 95 sys/tree.h tmp = (head)->sph_root; \
head 96 sys/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
head 99 sys/tree.h #define SPLAY_LINKRIGHT(head, tmp, field) do { \
head 100 sys/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
head 101 sys/tree.h tmp = (head)->sph_root; \
head 102 sys/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
head 105 sys/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
head 106 sys/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
head 107 sys/tree.h SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
head 108 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
head 109 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
head 122 sys/tree.h name##_SPLAY_FIND(struct name *head, struct type *elm) \
head 124 sys/tree.h if (SPLAY_EMPTY(head)) \
head 126 sys/tree.h name##_SPLAY(head, elm); \
head 127 sys/tree.h if ((cmp)(elm, (head)->sph_root) == 0) \
head 128 sys/tree.h return (head->sph_root); \
head 133 sys/tree.h name##_SPLAY_NEXT(struct name *head, struct type *elm) \
head 135 sys/tree.h name##_SPLAY(head, elm); \
head 147 sys/tree.h name##_SPLAY_MIN_MAX(struct name *head, int val) \
head 149 sys/tree.h name##_SPLAY_MINMAX(head, val); \
head 150 sys/tree.h return (SPLAY_ROOT(head)); \
head 158 sys/tree.h name##_SPLAY_INSERT(struct name *head, struct type *elm) \
head 160 sys/tree.h if (SPLAY_EMPTY(head)) { \
head 164 sys/tree.h name##_SPLAY(head, elm); \
head 165 sys/tree.h __comp = (cmp)(elm, (head)->sph_root); \
head 167 sys/tree.h SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
head 168 sys/tree.h SPLAY_RIGHT(elm, field) = (head)->sph_root; \
head 169 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = NULL; \
head 171 sys/tree.h SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
head 172 sys/tree.h SPLAY_LEFT(elm, field) = (head)->sph_root; \
head 173 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = NULL; \
head 175 sys/tree.h return ((head)->sph_root); \
head 177 sys/tree.h (head)->sph_root = (elm); \
head 182 sys/tree.h name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
head 185 sys/tree.h if (SPLAY_EMPTY(head)) \
head 187 sys/tree.h name##_SPLAY(head, elm); \
head 188 sys/tree.h if ((cmp)(elm, (head)->sph_root) == 0) { \
head 189 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
head 190 sys/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
head 192 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
head 193 sys/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
head 194 sys/tree.h name##_SPLAY(head, elm); \
head 195 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
head 203 sys/tree.h name##_SPLAY(struct name *head, struct type *elm) \
head 211 sys/tree.h while ((__comp = (cmp)(elm, (head)->sph_root))) { \
head 213 sys/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \
head 217 sys/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \
head 218 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
head 221 sys/tree.h SPLAY_LINKLEFT(head, __right, field); \
head 223 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
head 227 sys/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \
head 228 sys/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
head 231 sys/tree.h SPLAY_LINKRIGHT(head, __left, field); \
head 234 sys/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
head 240 sys/tree.h void name##_SPLAY_MINMAX(struct name *head, int __comp) \
head 249 sys/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \
head 253 sys/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \
head 254 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
head 257 sys/tree.h SPLAY_LINKLEFT(head, __right, field); \
head 259 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
head 263 sys/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \
head 264 sys/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
head 267 sys/tree.h SPLAY_LINKRIGHT(head, __left, field); \
head 270 sys/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
head 285 sys/tree.h #define SPLAY_FOREACH(x, name, head) \
head 286 sys/tree.h for ((x) = SPLAY_MIN(name, head); \
head 288 sys/tree.h (x) = SPLAY_NEXT(name, head, x))
head 317 sys/tree.h #define RB_ROOT(head) (head)->rbh_root
head 318 sys/tree.h #define RB_EMPTY(head) (RB_ROOT(head) == NULL)
head 335 sys/tree.h #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
head 347 sys/tree.h (head)->rbh_root = (tmp); \
head 355 sys/tree.h #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
head 367 sys/tree.h (head)->rbh_root = (tmp); \
head 391 sys/tree.h name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
head 406 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
head 412 sys/tree.h RB_ROTATE_RIGHT(head, gparent, tmp, field); \
head 422 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
head 428 sys/tree.h RB_ROTATE_LEFT(head, gparent, tmp, field); \
head 431 sys/tree.h RB_COLOR(head->rbh_root, field) = RB_BLACK; \
head 435 sys/tree.h name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
head 439 sys/tree.h elm != RB_ROOT(head)) { \
head 444 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
head 461 sys/tree.h RB_ROTATE_RIGHT(head, tmp, oleft, field);\
head 468 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
head 469 sys/tree.h elm = RB_ROOT(head); \
head 476 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
head 493 sys/tree.h RB_ROTATE_LEFT(head, tmp, oright, field);\
head 500 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
head 501 sys/tree.h elm = RB_ROOT(head); \
head 511 sys/tree.h name##_RB_REMOVE(struct name *head, struct type *elm) \
head 536 sys/tree.h RB_ROOT(head) = child; \
head 547 sys/tree.h RB_ROOT(head) = elm; \
head 570 sys/tree.h RB_ROOT(head) = child; \
head 573 sys/tree.h name##_RB_REMOVE_COLOR(head, parent, child); \
head 579 sys/tree.h name##_RB_INSERT(struct name *head, struct type *elm) \
head 584 sys/tree.h tmp = RB_ROOT(head); \
head 603 sys/tree.h RB_ROOT(head) = elm; \
head 604 sys/tree.h name##_RB_INSERT_COLOR(head, elm); \
head 610 sys/tree.h name##_RB_FIND(struct name *head, struct type *elm) \
head 612 sys/tree.h struct type *tmp = RB_ROOT(head); \
head 648 sys/tree.h name##_RB_MINMAX(struct name *head, int val) \
head 650 sys/tree.h struct type *tmp = RB_ROOT(head); \
head 672 sys/tree.h #define RB_FOREACH(x, name, head) \
head 673 sys/tree.h for ((x) = RB_MIN(name, head); \
head 478 ufs/ffs/ffs_softdep.c #define WORKLIST_INSERT(head, item) do { \
head 480 ufs/ffs/ffs_softdep.c LIST_INSERT_HEAD(head, item, wk_list); \
head 493 ufs/ffs/ffs_softdep.c #define WORKLIST_INSERT(head, item) worklist_insert(head, item)
head 498 ufs/ffs/ffs_softdep.c worklist_insert(head, item)
head 499 ufs/ffs/ffs_softdep.c struct workhead *head;
head 510 ufs/ffs/ffs_softdep.c LIST_INSERT_HEAD(head, item, wk_list);
head 845 uvm/uvm_km.c struct km_page *head, *tail, *page;
head 854 uvm/uvm_km.c head = tail = page;
head 857 uvm/uvm_km.c page->next = head;
head 858 uvm/uvm_km.c head = page;
head 860 uvm/uvm_km.c if (head != NULL) {
head 863 uvm/uvm_km.c uvm_km_pages_head = head;
head 52 xfs/xfs_node.c nnfs_init_head(struct xfs_nodelist_head *head)
head 57 xfs/xfs_node.c NNPQUEUE_INIT(&head->nh_nodelist[i]);
head 67 xfs/xfs_node.c xfs_node_purge(struct xfs_nodelist_head *head,
head 78 xfs/xfs_node.c xfs_node_find(struct xfs_nodelist_head *head, xfs_handle *handlep)
head 83 xfs/xfs_node.c h = &head->nh_nodelist[xfs_hash(handlep)];
head 98 xfs/xfs_node.c xfs_remove_node(struct xfs_nodelist_head *head, struct xfs_node *node)
head 102 xfs/xfs_node.c h = &head->nh_nodelist[xfs_hash(&node->handle)];
head 111 xfs/xfs_node.c xfs_insert(struct xfs_nodelist_head *head, struct xfs_node *node)
head 115 xfs/xfs_node.c h = &head->nh_nodelist[xfs_hash(&node->handle)];
head 124 xfs/xfs_node.c xfs_update_handle(struct xfs_nodelist_head *head,
head 129 xfs/xfs_node.c node = xfs_node_find(head, new_handlep);
head 132 xfs/xfs_node.c node = xfs_node_find(head, old_handlep);
head 135 xfs/xfs_node.c xfs_remove_node(head, node);
head 137 xfs/xfs_node.c xfs_insert(head, node);
head 55 xfs/xfs_queue.h #define NNPQUEUE_EMPTY(head) \
head 56 xfs/xfs_queue.h ((head)->nnpq_first == NULL)
head 59 xfs/xfs_queue.h #define NNPQUEUE_INIT(head) do { \
head 60 xfs/xfs_queue.h (head)->nnpq_first = NULL; \
head 61 xfs/xfs_queue.h (head)->nnpq_last = &(head)->nnpq_first; \
head 65 xfs/xfs_queue.h #define NNPQUEUE_INSERT_HEAD(head, elm, field) do { \
head 66 xfs/xfs_queue.h if (((elm)->field.nnpq_next = (head)->nnpq_first) != NULL) \
head 67 xfs/xfs_queue.h (head)->nnpq_first->field.nnpq_prev = \
head 70 xfs/xfs_queue.h (head)->nnpq_last = &(elm)->field.nnpq_next; \
head 71 xfs/xfs_queue.h (head)->nnpq_first = (elm); \
head 72 xfs/xfs_queue.h (elm)->field.nnpq_prev = &(head)->nnpq_first; \
head 76 xfs/xfs_queue.h #define NNPQUEUE_REMOVE(elm,head,field) do { \
head 81 xfs/xfs_queue.h (head)->nnpq_last = (elm)->field.nnpq_prev; \
head 86 xfs/xfs_queue.h #define NNPQUEUE_FOREACH(var,head,field) \
head 87 xfs/xfs_queue.h for ((var) = ((head)->nnpq_first); \