| /src/games/quiz/ |
| quiz.c | 122 QE *qp; local
134 qp = &qlist;
139 if (qp->q_text && qp->q_text[strlen(qp->q_text) - 1] == '\\')
140 qp->q_text = appdstr(qp->q_text, lp, len);
142 if ((qp->q_next = malloc(sizeof(QE))) == NULL)
144 qp = qp->q_next
160 QE *qp; local
193 QE *qp; local
225 QE *qp; local
[all...] |
| /src/sys/dev/pci/ |
| xmm7360.c | 361 * The 16 TD rings form 8 queue pairs (QP). For example, QP
514 struct queue_pair qp[XMM_QP_COUNT]; member in struct:xmm_dev
567 struct queue_pair *qp; member in struct:xmm_net
821 struct queue_pair *qp = &xmm->qp[num]; local
823 qp->xmm = xmm;
824 qp->num = num;
825 qp->open = 0;
826 qp->depth = depth
1007 struct queue_pair *qp = container_of(inode->i_cdev, struct queue_pair, cdev); local
1014 struct queue_pair *qp = file->private_data; local
1020 struct queue_pair *qp = file->private_data; local
1033 struct queue_pair *qp = file->private_data; local
1046 struct queue_pair *qp = file->private_data; local
1065 struct queue_pair *qp = file->private_data; local
1312 struct queue_pair *qp; local
1555 struct queue_pair *qp; local
1641 struct queue_pair *qp = tty->driver_data; local
1647 struct queue_pair *qp = tty->driver_data; local
1655 struct queue_pair *qp = tty->driver_data; local
1665 struct queue_pair *qp = tty->driver_data; local
1674 struct queue_pair *qp; local
1690 struct queue_pair *qp = tty->driver_data; local
1696 struct queue_pair *qp = tport->tty->driver_data; local
1717 struct queue_pair *qp = xmm7360_init_qp(xmm, num, 8, 4096); local
1738 struct queue_pair *qp = xmm7360_init_qp(xmm, num, 16, TD_MAX_PAGE_SIZE); local
2086 struct queue_pair *qp; local
2295 struct queue_pair *qp; local
2315 struct queue_pair *qp; local
2506 struct queue_pair *qp = &sc->sc_xmm.qp[func]; local
2559 struct queue_pair *qp = &sc->sc_xmm.qp[func]; local
2675 struct queue_pair *qp = &sc->sc_xmm.qp[func]; local
2713 struct queue_pair *qp = &sc->sc_xmm.qp[func]; local
2754 struct queue_pair *qp = (struct queue_pair *)kn->kn_hook; local
2768 struct queue_pair *qp = (struct queue_pair *)kn->kn_hook; local
2785 struct queue_pair *qp = (struct queue_pair *)kn->kn_hook; local
2799 struct queue_pair *qp = (struct queue_pair *)kn->kn_hook; local
2830 struct queue_pair *qp = &sc->sc_xmm.qp[func]; local
[all...] |
| if_ixl.c | 1922 ixl_enable_queue_intr(struct ixl_softc *sc, struct ixl_queue_pair *qp)
1924 struct ixl_rx_ring *rxr = qp->qp_rxr;
1934 ixl_disable_queue_intr(struct ixl_softc *sc, struct ixl_queue_pair *qp)
1936 struct ixl_rx_ring *rxr = qp->qp_rxr;
2287 struct ixl_queue_pair *qp; local
2295 qp = &sc->sc_qps[i];
2297 qp->qp_si = softint_establish(SOFTINT_NET | SOFTINT_MPSAFE,
2298 ixl_handle_queue, qp);
2299 if (qp->qp_si == NULL)
2302 qp->qp_txr = ixl_txr_alloc(sc, i)
2340 struct ixl_queue_pair *qp; local
3456 struct ixl_queue_pair *qp = xqp; local
3487 struct ixl_queue_pair *qp; local
3496 struct ixl_queue_pair *qp = xqp; local
6042 struct ixl_queue_pair *qp; local
[all...] |
| if_iavf.c | 2433 struct iavf_queue_pair *qp; local
2447 qp = &sc->sc_qps[i];
2449 qp->qp_rxr = iavf_rxr_alloc(sc, i);
2450 qp->qp_txr = iavf_txr_alloc(sc, i);
2452 if (qp->qp_rxr == NULL || qp->qp_txr == NULL)
2455 qp->qp_si = softint_establish(SOFTINT_NET|SOFTINT_MPSAFE,
2456 iavf_handle_queue, qp);
2457 if (qp->qp_si == NULL)
2465 qp = &sc->sc_qps[i]
2484 struct iavf_queue_pair *qp; local
3283 struct iavf_queue_pair *qp = xqp; local
3320 struct iavf_queue_pair *qp; local
3329 struct iavf_queue_pair *qp = xqp; local
[all...] |
| /src/sbin/veriexecctl/ |
| veriexecctl.c | 124 print_query(prop_dictionary_t qp, char *file)
137 prop_dictionary_get_uint8(qp, "entry-type", &u8);
141 prop_dictionary_get_uint8(qp, "status", &u8);
143 printf("Fingerprint algorithm: %s\n", dict_gets(qp, "fp-type"));
145 v = dict_getd(qp, "fp");
146 for (i = 0; i < prop_data_size(prop_dictionary_get(qp, "fp")); i++)
280 prop_dictionary_t qp, rqp; local
283 qp = prop_dictionary_create();
285 dict_sets(qp, "file", argv[1]);
287 r = prop_dictionary_sendrecv_ioctl(qp, gfd, VERIEXEC_QUERY
[all...] |
| /src/sys/arch/alpha/stand/setnetbootinfo/ |
| setnetbootinfo.c | 73 u_int64_t *qp, csum; local
193 for (qp = (u_int64_t *)netbb; qp < (u_int64_t *)(netbb + sb.st_size);
194 qp++) {
195 if (((struct netbbinfo *)qp)->magic1 == 0xfeedbabedeadbeefLL &&
196 ((struct netbbinfo *)qp)->magic2 == 0xfeedbeefdeadbabeLL) {
197 netbbinfop = (struct netbbinfo *)qp;
225 for (i = 0, qp = (u_int64_t *)netbbinfop;
226 i < (sizeof *netbbinfop / sizeof (u_int64_t)); i++, qp++)
227 csum += *qp;
[all...] |
| /src/games/backgammon/backgammon/ |
| move.c | 276 struct BOARD *qp = checkq; /* queue pointer */ local
279 if (qp == 0) { /* check if queue empty */
280 checkq = qp = new;
281 qp->b_next = 0;
284 result = bcomp(new, qp); /* compare to first element */
286 new->b_next = qp;
291 mvcheck(mm, qp, new);
295 while (qp->b_next != 0) {/* traverse queue */
296 result = bcomp(new, qp->b_next);
298 new->b_next = qp->b_next
[all...] |
| /src/sys/dev/qbus/ |
| if_dmc.c | 196 #define QUEUE_AT_HEAD(qp, head, tail) \
197 (qp)->qp_next = (head); \
198 (head) = (qp); \
202 #define QUEUE_AT_TAIL(qp, head, tail) \
204 (tail)->qp_next = (qp); \
206 (head) = (qp); \
207 (qp)->qp_next = (struct dmc_command *) 0; \
208 (tail) = (qp)
306 struct dmc_command *qp; local
380 for (qp = &sc->sc_cmdbuf[0]; qp < &sc->sc_cmdbuf[NCMDS]; qp++)
466 struct dmc_command *qp; local
504 struct dmc_command *qp; local
[all...] |
| /src/sys/arch/alpha/stand/netboot/ |
| if_prom.c | 127 u_int64_t *qp, csum; local
132 for (i = 0, qp = (u_int64_t *)&netbbinfo;
133 i < (sizeof netbbinfo / sizeof (u_int64_t)); i++, qp++)
134 csum += *qp;
|
| /src/usr.sbin/altq/libaltq/ |
| parser.c | 207 struct qdisc_parser *qp; local
209 for (qp = qdisc_parser; qp->qname != NULL; qp++)
210 if (strncmp(qp->qname, qname, strlen(qp->qname)) == 0)
219 struct qdisc_parser *qp; local
221 for (qp = qdisc_parser; qp->qname != NULL; qp++
232 struct qdisc_parser *qp; local
[all...] |
| /src/sys/net/ |
| pktqueue.c | 131 struct pcq **qp = vqp; local
134 *qp = pcq_create(pq->pq_maxlen, KM_SLEEP);
140 struct pcq **qp = vqp, *q = *qp; local
144 *qp = NULL; /* paranoia */
150 struct pcq **qp, *q; local
158 qp = percpu_getptr_remote(pq->pq_pcq, ci);
159 q = *qp;
592 struct pcq **qp, *q, **qs = vqs; local
597 qp = percpu_getref(pq->pq_pcq)
[all...] |
| /src/sys/dev/iscsi/ |
| iscsi_main.c | 320 const quirktab_t *qp; local
326 for (qp = quirktab ; qp->iqn ; qp++) {
327 quirklen = strlen(qp->iqn);
330 if (memcmp(qp->iqn, iqn, quirklen) == 0)
333 return qp;
|
| /src/sys/arch/ia64/unwind/ |
| decode.h | 143 u_int qp; member in struct:unwind_desc_X3
152 u_int qp; member in struct:unwind_desc_X4
|
| decode.c | 311 uwd->X3.qp = (buf[1] & 0x3f);
329 uwd->X4.qp = (buf[1] & 0x3f);
|
| /src/lib/libc/net/ |
| gethnamaddr.c | 999 char qbuf[MAXDNAME + 1], *qp, *ep; local
1024 qp = qbuf;
1027 advance = snprintf(qp, (size_t)(ep - qp), "%x.%x.",
1030 if (advance > 0 && qp + advance < ep)
1031 qp += advance;
|
| /src/sys/kern/ |
| tty.c | 1963 struct clist *qp; local
2019 qp = &tp->t_rawq;
2029 if (qp->c_cc < m)
2041 if (qp->c_cc <= 0)
2043 if (qp->c_cc >= m)
2050 } else if (qp->c_cc > last_cc) {
2060 if (qp->c_cc > 0)
2071 last_cc = qp->c_cc;
2087 } else if ((qp = &tp->t_canq)->c_cc <= 0) {
2122 while ((c = getc(qp)) >= 0)
[all...] |
| /src/sbin/disklabel/ |
| main.c | 2032 struct partition *pp, *qp; local
2113 qp = &lp->d_partitions[j];
2114 if (qp->p_fstype == FS_UNUSED)
2116 if (pp->p_offset < qp->p_offset + qp->p_size &&
2117 qp->p_offset < pp->p_offset + pp->p_size)
|
| /src/usr.sbin/lpr/lpd/ |
| printjob.c | 148 struct queue *q, **qp; local
241 for (qp = queue; nitems--; free((char *) q)) {
242 q = *qp++;
266 q = *qp++;
|
