| /freebsd/sys/sys/ |
| H A D | qmath.h | 28 * Data types and APIs for fixed-point math based on the "Q" number format.
36 * This scheme can therefore represent Q numbers with [2,4,6,8,16,32,48,64] bits
61 #define Q_BT(q) __typeof(1 * q) argument
63 /* The underlying base type of 'q'. */
64 #define Q_BT(q) __typeof(q) argument
67 /* Type-cast variable 'v' to the same underlying type as 'q'. */
68 #define Q_TC(q, v) ((__typeof(q))(v)) argument
70 /* Number of total bits associated with the data type underlying 'q'. */
71 #define Q_NTBITS(q) ((uint32_t)(sizeof(q) << 3)) argument
77 #define Q_NFCBITS(q) \ argument
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/ |
| H A D | hash.cpp | 93 const std::size_t q = n / p;
94 if (q < p)
96 if (n == q * p)
103 std::size_t q = n / i;
104 if (q < i)
106 if (n == q * i)
110 q = n / i;
111 if (q < i)
113 if (n == q * i)
117 q
198 const std::size_t q = n / p; __next_prime() local
209 std::size_t q = n / i; __next_prime() local
[all...] |
| /freebsd/bin/sh/tests/expansion/ |
| H A D | trim9.0 | 24 testcase 'shift $#; set -- "${*#Q}"' '1|'
25 testcase 'shift $#; set -- "${*##Q}"' '1|'
26 testcase 'shift $#; set -- "${*%Q}"' '1|'
27 testcase 'shift $#; set -- "${*%%Q}"' '1|'
28 testcase 'set -- Q R; set -- "${*#Q}"' '1| R'
29 testcase 'set -- Q R; set -- "${*##Q}"' '1| R'
30 testcase 'set -- Q R; set -- "${*%R}"' '1|Q '
31 testcase 'set -- Q R; set -- "${*%%R}"' '1|Q '
32 testcase 'set -- Q R; set -- "${*#S}"' '1|Q R'
33 testcase 'set -- Q R; set -- "${*##S}"' '1|Q R'
[all …]
|
| /freebsd/sys/contrib/dev/mediatek/mt76/ |
| H A D | dma.c | 193 mt76_dma_sync_idx(struct mt76_dev *dev, struct mt76_queue *q) in mt76_dma_sync_idx() argument
195 Q_WRITE(q, desc_base, q->desc_dma); in mt76_dma_sync_idx()
196 if (q->flags & MT_QFLAG_WED_RRO_EN) in mt76_dma_sync_idx()
197 Q_WRITE(q, ring_size, MT_DMA_RRO_EN | q->ndesc); in mt76_dma_sync_idx()
199 Q_WRITE(q, ring_size, q->ndesc); in mt76_dma_sync_idx()
200 q->head = Q_READ(q, dma_idx); in mt76_dma_sync_idx()
201 q->tail = q->head; in mt76_dma_sync_idx()
204 void __mt76_dma_queue_reset(struct mt76_dev *dev, struct mt76_queue *q, in __mt76_dma_queue_reset() argument
207 if (!q || !q->ndesc) in __mt76_dma_queue_reset()
210 if (!mt76_queue_is_wed_rro_ind(q)) { in __mt76_dma_queue_reset()
[all …]
|
| H A D | wed.c | 36 struct mt76_queue *q = &dev->q_rx[MT_RXQ_MAIN]; in mt76_wed_init_rx_buf() local
37 int i, len = SKB_WITH_OVERHEAD(q->buf_size); in mt76_wed_init_rx_buf()
51 buf = mt76_get_page_pool_buf(q, &offset, q->buf_size); in mt76_wed_init_rx_buf()
56 dir = page_pool_get_dma_dir(q->page_pool); in mt76_wed_init_rx_buf()
97 int mt76_wed_dma_setup(struct mt76_dev *dev, struct mt76_queue *q, bool reset) in mt76_wed_dma_setup() argument
102 if (!q || !q->ndesc) in mt76_wed_dma_setup()
105 flags = q->flags; in mt76_wed_dma_setup()
106 if (!q->wed || !mtk_wed_device_active(q->wed)) in mt76_wed_dma_setup()
107 q->flags &= ~MT_QFLAG_WED; in mt76_wed_dma_setup()
109 if (!(q->flags & MT_QFLAG_WED)) in mt76_wed_dma_setup()
[all …]
|
| H A D | usb.c | 320 mt76u_fill_rx_sg(struct mt76_dev *dev, struct mt76_queue *q, struct urb *urb, in mt76u_fill_rx_sg() argument
329 data = mt76_get_page_pool_buf(q, &offset, q->buf_size); in mt76u_fill_rx_sg()
333 sg_set_page(&urb->sg[i], virt_to_head_page(data), q->buf_size, in mt76u_fill_rx_sg()
346 urb->transfer_buffer_length = urb->num_sgs * q->buf_size; in mt76u_fill_rx_sg()
353 mt76u_refill_rx(struct mt76_dev *dev, struct mt76_queue *q, in mt76u_refill_rx() argument
356 enum mt76_rxq_id qid = q - &dev->q_rx[MT_RXQ_MAIN]; in mt76u_refill_rx()
360 return mt76u_fill_rx_sg(dev, q, urb, nsgs); in mt76u_refill_rx()
362 urb->transfer_buffer_length = q->buf_size; in mt76u_refill_rx()
363 urb->transfer_buffer = mt76_get_page_pool_buf(q, &offset, q->buf_size); in mt76u_refill_rx()
390 mt76u_rx_urb_alloc(struct mt76_dev *dev, struct mt76_queue *q, in mt76u_rx_urb_alloc() argument
[all …]
|
| /freebsd/sys/contrib/openzfs/module/zfs/ |
| H A D | bqueue.c | 24 obj2node(bqueue_t *q, void *data) in obj2node() argument
26 return ((bqueue_node_t *)((char *)data + q->bq_node_offset)); in obj2node()
53 bqueue_init(bqueue_t *q, uint_t fill_fraction, size_t size, size_t node_offset) in bqueue_init() argument
58 list_create(&q->bq_list, node_offset + sizeof (bqueue_node_t), in bqueue_init()
60 list_create(&q->bq_dequeuing_list, node_offset + sizeof (bqueue_node_t), in bqueue_init()
62 list_create(&q->bq_enqueuing_list, node_offset + sizeof (bqueue_node_t), in bqueue_init()
64 cv_init(&q->bq_add_cv, NULL, CV_DEFAULT, NULL); in bqueue_init()
65 cv_init(&q->bq_pop_cv, NULL, CV_DEFAULT, NULL); in bqueue_init()
66 mutex_init(&q->bq_lock, NULL, MUTEX_DEFAULT, NULL); in bqueue_init()
67 q->bq_node_offset = node_offset; in bqueue_init()
[all …]
|
| /freebsd/sys/netgraph/bluetooth/include/ |
| H A D | ng_bluetooth.h | 76 #define NG_BT_MBUFQ_INIT(q, _maxlen) \ argument
78 (q)->head = NULL; \
79 (q)->tail = NULL; \
80 (q)->len = 0; \
81 (q)->maxlen = (_maxlen); \
82 (q)->drops = 0; \
85 #define NG_BT_MBUFQ_DESTROY(q) \ argument
87 NG_BT_MBUFQ_DRAIN((q)); \
90 #define NG_BT_MBUFQ_FIRST(q) (q)->head argument
92 #define NG_BT_MBUFQ_LEN(q) (q)->len argument
[all …]
|
| /freebsd/contrib/bearssl/src/symcipher/ |
| H A D | aes_ct64_dec.c | 29 br_aes_ct64_bitslice_invSbox(uint64_t *q) in br_aes_ct64_bitslice_invSbox() argument
37 q0 = ~q[0]; in br_aes_ct64_bitslice_invSbox()
38 q1 = ~q[1]; in br_aes_ct64_bitslice_invSbox()
39 q2 = q[2]; in br_aes_ct64_bitslice_invSbox()
40 q3 = q[3]; in br_aes_ct64_bitslice_invSbox()
41 q4 = q[4]; in br_aes_ct64_bitslice_invSbox()
42 q5 = ~q[5]; in br_aes_ct64_bitslice_invSbox()
43 q6 = ~q[6]; in br_aes_ct64_bitslice_invSbox()
44 q7 = q[7]; in br_aes_ct64_bitslice_invSbox()
45 q[7] = q1 ^ q4 ^ q6; in br_aes_ct64_bitslice_invSbox()
[all …]
|
| H A D | aes_ct_ctrcbc.c | 74 uint32_t q[8], carry; in br_aes_ct_ctrcbc_ctr() local
81 q[0] = br_swap32(iv0); in br_aes_ct_ctrcbc_ctr()
82 q[2] = br_swap32(iv1); in br_aes_ct_ctrcbc_ctr()
83 q[4] = br_swap32(iv2); in br_aes_ct_ctrcbc_ctr()
84 q[6] = br_swap32(iv3); in br_aes_ct_ctrcbc_ctr()
92 q[1] = br_swap32(iv0); in br_aes_ct_ctrcbc_ctr()
93 q[3] = br_swap32(iv1); in br_aes_ct_ctrcbc_ctr()
94 q[5] = br_swap32(iv2); in br_aes_ct_ctrcbc_ctr()
95 q[7] = br_swap32(iv3); in br_aes_ct_ctrcbc_ctr()
106 br_aes_ct_ortho(q); in br_aes_ct_ctrcbc_ctr()
[all …]
|
| H A D | aes_ct_dec.c | 29 br_aes_ct_bitslice_invSbox(uint32_t *q) in br_aes_ct_bitslice_invSbox() argument
51 q0 = ~q[0]; in br_aes_ct_bitslice_invSbox()
52 q1 = ~q[1]; in br_aes_ct_bitslice_invSbox()
53 q2 = q[2]; in br_aes_ct_bitslice_invSbox()
54 q3 = q[3]; in br_aes_ct_bitslice_invSbox()
55 q4 = q[4]; in br_aes_ct_bitslice_invSbox()
56 q5 = ~q[5]; in br_aes_ct_bitslice_invSbox()
57 q6 = ~q[6]; in br_aes_ct_bitslice_invSbox()
58 q7 = q[7]; in br_aes_ct_bitslice_invSbox()
59 q[7] = q1 ^ q4 ^ q6; in br_aes_ct_bitslice_invSbox()
[all …]
|
| H A D | aes_ct64.c | 29 br_aes_ct64_bitslice_Sbox(uint64_t *q) in br_aes_ct64_bitslice_Sbox() argument
56 x0 = q[7]; in br_aes_ct64_bitslice_Sbox()
57 x1 = q[6]; in br_aes_ct64_bitslice_Sbox()
58 x2 = q[5]; in br_aes_ct64_bitslice_Sbox()
59 x3 = q[4]; in br_aes_ct64_bitslice_Sbox()
60 x4 = q[3]; in br_aes_ct64_bitslice_Sbox()
61 x5 = q[2]; in br_aes_ct64_bitslice_Sbox()
62 x6 = q[1]; in br_aes_ct64_bitslice_Sbox()
63 x7 = q[0]; in br_aes_ct64_bitslice_Sbox()
194 q[7] = s0; in br_aes_ct64_bitslice_Sbox()
[all …]
|
| H A D | aes_ct_enc.c | 28 add_round_key(uint32_t *q, const uint32_t *sk) in add_round_key() argument
30 q[0] ^= sk[0]; in add_round_key()
31 q[1] ^= sk[1]; in add_round_key()
32 q[2] ^= sk[2]; in add_round_key()
33 q[3] ^= sk[3]; in add_round_key()
34 q[4] ^= sk[4]; in add_round_key()
35 q[5] ^= sk[5]; in add_round_key()
36 q[6] ^= sk[6]; in add_round_key()
37 q[7] ^= sk[7]; in add_round_key()
41 shift_rows(uint32_t *q) in shift_rows() argument
[all …]
|
| H A D | aes_ct64_enc.c | 28 add_round_key(uint64_t *q, const uint64_t *sk) in add_round_key() argument
30 q[0] ^= sk[0]; in add_round_key()
31 q[1] ^= sk[1]; in add_round_key()
32 q[2] ^= sk[2]; in add_round_key()
33 q[3] ^= sk[3]; in add_round_key()
34 q[4] ^= sk[4]; in add_round_key()
35 q[5] ^= sk[5]; in add_round_key()
36 q[6] ^= sk[6]; in add_round_key()
37 q[7] ^= sk[7]; in add_round_key()
41 shift_rows(uint64_t *q) in shift_rows() argument
[all …]
|
| /freebsd/sys/dev/netmap/ |
| H A D | netmap_mbq.c | 48 static inline void __mbq_init(struct mbq *q) in __mbq_init() argument
50 q->head = q->tail = NULL; in __mbq_init()
51 q->count = 0; in __mbq_init()
55 void mbq_safe_init(struct mbq *q) in mbq_safe_init() argument
57 mtx_init(&q->lock, "mbq", NULL, MTX_SPIN); in mbq_safe_init()
58 __mbq_init(q); in mbq_safe_init()
62 void mbq_init(struct mbq *q) in mbq_init() argument
64 __mbq_init(q); in mbq_init()
68 static inline void __mbq_enqueue(struct mbq *q, struct mbuf *m) in __mbq_enqueue() argument
71 if (q->tail) { in __mbq_enqueue()
[all …]
|
| /freebsd/sys/net/altq/ |
| H A D | altq_classq.h | 69 #define qtype(q) (q)->qtype_ /* Get queue type */ argument
70 #define qlimit(q) (q)->qlim_ /* Max packets to be queued */ argument
71 #define qlen(q) (q)->qlen_ /* Current queue length. */ argument
72 #define qsize(q) (q)->qsize_ /* Current queue size. */ argument
73 #define qtail(q) (q)->tail_ /* Tail of the queue */ argument
74 #define qhead(q) ((q)->tail_ ? (q)->tail_->m_nextpkt : NULL) argument
76 #define qempty(q) ((q)->qlen_ == 0) /* Is the queue empty?? */ argument
77 #define q_is_codel(q) ((q)->qtype_ == Q_CODEL) /* Is the queue a codel queue */ argument
78 #define q_is_red(q) ((q)->qtype_ == Q_RED) /* Is the queue a red queue */ argument
79 #define q_is_rio(q) ((q)->qtype_ == Q_RIO) /* Is the queue a rio queue */ argument
[all …]
|
| /freebsd/usr.sbin/ypserv/ |
| H A D | yp_dnslookup.c | 150 register struct circleq_dnsentry *q; in yp_malloc_dnsent() local
152 q = malloc(sizeof(struct circleq_dnsentry)); in yp_malloc_dnsent()
154 if (q == NULL) { in yp_malloc_dnsent()
159 return(q); in yp_malloc_dnsent()
203 register struct circleq_dnsentry *q; in yp_find_dnsqent() local
205 TAILQ_FOREACH(q, &qhead, links) { in yp_find_dnsqent()
208 if (id == q->xid) in yp_find_dnsqent()
209 return(q); in yp_find_dnsqent()
213 if (id == q->id) in yp_find_dnsqent()
214 return(q); in yp_find_dnsqent()
[all …]
|
| /freebsd/contrib/netbsd-tests/fs/ffs/ |
| H A D | t_quotalimit.sh | 30 for q in "user" "group"; do
31 test_case_root limit_${e}_${v}_${q} limit_quota \
32 "hit hard limit quota with ${q} enabled" -b ${e} ${v} ${q}
33 test_case_root limit_${e}_${v}_${q}_log limit_quota \
34 "hit hard limit quota with ${q} enabled, WAPBL" -bl ${e} ${v} ${q}
35 test_case_root slimit_${e}_${v}_${q} limit_softquota \
36 "hit soft limit quota with ${q} enabled after grace time" \
37 -b ${e} ${v} ${q}
38 test_case_root inolimit_${e}_${v}_${q} limit_iquota \
39 "hit hard limit ino quota with ${q} enabled" -b ${e} ${v} ${q}
[all …]
|
| /freebsd/contrib/unbound/libunbound/ |
| H A D | context.c | 131 context_query_delete(struct ctx_query* q) in context_query_delete() argument
133 if(!q) return; in context_query_delete()
134 ub_resolve_free(q->res); in context_query_delete()
135 free(q->msg); in context_query_delete()
136 free(q); in context_query_delete()
160 struct ctx_query* q = (struct ctx_query*)calloc(1, sizeof(*q)); in context_new() local
161 if(!q) return NULL; in context_new()
163 if(!find_id(ctx, &q->querynum)) { in context_new()
165 free(q); in context_new()
169 q->node.key = &q->querynum; in context_new()
[all …]
|
| /freebsd/contrib/libarchive/libarchive/test/ |
| H A D | test_write_format_zip_compression_zstd.c | 13 static const char file_data2[] = {'U', 'T', 'S', 'M', 'R', 'Q', 'P', 'O', 'K', 'L'};
72 * q walks over the local headers, the data and the data descriptors. */ in verify_zstd_contents()
73 const char *p, *q, *local_header, *extra_start; in verify_zstd_contents() local
150 local_header = q = buff; in verify_zstd_contents()
151 assertEqualMem(q, "PK\003\004", 4); /* Signature */ in verify_zstd_contents()
152 assertEqualInt(i2le(q + 4), 63); /* Version needed to extract */ in verify_zstd_contents()
153 …assertEqualInt(i2le(q + 6), 8); /* Flags: bit 3 = length-at-end (required because CRC32 is unknown… in verify_zstd_contents()
154 assertEqualInt(i2le(q + 8), 93); /* Compression method */ in verify_zstd_contents()
155 …assertEqualInt(i2le(q + 10), (tm->tm_hour * 2048) + (tm->tm_min * 32) + (tm->tm_sec / 2)); /* File… in verify_zstd_contents()
156 …assertEqualInt(i2le(q + 12), ((tm->tm_year - 80) * 512) + ((tm->tm_mon + 1) * 32) + tm->tm_mday); … in verify_zstd_contents()
[all …]
|
| H A D | test_write_format_zip_compression_store.c | 92 * q walks over the local headers, the data and the data descriptors. */ in verify_uncompressed_contents()
93 const char *p, *q, *local_header, *extra_start; in verify_uncompressed_contents() local
164 local_header = q = buff; in verify_uncompressed_contents()
165 assertEqualMem(q, "PK\003\004", 4); /* Signature */ in verify_uncompressed_contents()
166 assertEqualInt(i2le(q + 4), 10); /* Version needed to extract */ in verify_uncompressed_contents()
167 …assertEqualInt(i2le(q + 6), 8); /* Flags: bit 3 = length-at-end. Required because CRC32 is unknow… in verify_uncompressed_contents()
168 assertEqualInt(i2le(q + 8), 0); /* Compression method */ in verify_uncompressed_contents()
169 …assertEqualInt(i2le(q + 10), (tm->tm_hour * 2048) + (tm->tm_min * 32) + (tm->tm_sec / 2)); /* File… in verify_uncompressed_contents()
170 …assertEqualInt(i2le(q + 12), ((tm->tm_year - 80) * 512) + ((tm->tm_mon + 1) * 32) + tm->tm_mday); … in verify_uncompressed_contents()
171 assertEqualInt(i4le(q + 14), 0); /* CRC-32 */ in verify_uncompressed_contents()
[all …]
|
| H A D | test_write_format_zip_compression_bzip2.c | 72 * q walks over the local headers, the data and the data descriptors. */ in verify_bzip2_contents()
73 const char *p, *q, *local_header, *extra_start; in verify_bzip2_contents() local
150 local_header = q = buff; in verify_bzip2_contents()
151 assertEqualMem(q, "PK\003\004", 4); /* Signature */ in verify_bzip2_contents()
152 assertEqualInt(i2le(q + 4), 46); /* Version needed to extract */ in verify_bzip2_contents()
153 …assertEqualInt(i2le(q + 6), 8); /* Flags: bit 3 = length-at-end (required because CRC32 is unknown… in verify_bzip2_contents()
154 assertEqualInt(i2le(q + 8), 12); /* Compression method */ in verify_bzip2_contents()
155 …assertEqualInt(i2le(q + 10), (tm->tm_hour * 2048) + (tm->tm_min * 32) + (tm->tm_sec / 2)); /* File… in verify_bzip2_contents()
156 …assertEqualInt(i2le(q + 12), ((tm->tm_year - 80) * 512) + ((tm->tm_mon + 1) * 32) + tm->tm_mday); … in verify_bzip2_contents()
157 assertEqualInt(i4le(q + 14), 0); /* CRC-32 */ in verify_bzip2_contents()
[all …]
|
| /freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/ |
| H A D | cert-onecolumn.pem | 12 Q
15 Q
33 q
43 Q
180 Q
264 Q
301 Q
339 Q
340 Q
423 Q
[all …]
|
| /freebsd/sys/dev/ath/ath_hal/ar5211/ |
| H A D | ar5211_xmit.c | 80 ar5211SetTxQueueProps(struct ath_hal *ah, int q, const HAL_TXQ_INFO *qInfo) in ar5211SetTxQueueProps() argument
84 if (q >= HAL_NUM_TX_QUEUES) { in ar5211SetTxQueueProps()
86 __func__, q); in ar5211SetTxQueueProps()
89 return ath_hal_setTxQProps(ah, &ahp->ah_txq[q], qInfo); in ar5211SetTxQueueProps()
96 ar5211GetTxQueueProps(struct ath_hal *ah, int q, HAL_TXQ_INFO *qInfo) in ar5211GetTxQueueProps() argument
100 if (q >= HAL_NUM_TX_QUEUES) { in ar5211GetTxQueueProps()
102 __func__, q); in ar5211GetTxQueueProps()
105 return ath_hal_getTxQProps(ah, qInfo, &ahp->ah_txq[q]); in ar5211GetTxQueueProps()
117 int q; in ar5211SetupTxQueue() local
121 q = 9; in ar5211SetupTxQueue()
[all …]
|
| /freebsd/cddl/contrib/opensolaris/lib/libdtrace/common/ |
| H A D | dt_string.c | 41 char *p, *q, c; in stresc2chr() local
45 for (p = q = s; (c = *p) != '\0'; p++) { in stresc2chr()
69 *q++ = c; in stresc2chr()
73 *q++ = '\a'; in stresc2chr()
76 *q++ = '\b'; in stresc2chr()
79 *q++ = '\f'; in stresc2chr()
82 *q++ = '\n'; in stresc2chr()
85 *q++ = '\r'; in stresc2chr()
88 *q++ = '\t'; in stresc2chr()
91 *q++ = '\v'; in stresc2chr()
[all …]
|