Home
last modified time | relevance | path

Searched refs:q (Results 1 – 25 of 2032) sorted by relevance

12345678910>>...82

/freebsd/contrib/llvm-project/libcxx/src/
H A Dhash.cpp93 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/sys/sys/
H A Dqmath.h61 #define Q_BT(q) __typeof(1 * q) argument
64 #define Q_BT(q) __typeof(q) argument
68 #define Q_TC(q, v) ((__typeof(q))(v)) argument
71 #define Q_NTBITS(q) ((uint32_t)(sizeof(q) << 3)) argument
77 #define Q_NFCBITS(q) \ argument
78 ((uint32_t)(((Q_GCRAW(q) & 0x3) + 1) << ((Q_GCRAW(q) & 0x4) ? 4 : 1)))
81 #define Q_MINNFBITS(q) ((uint32_t)(2)) argument
82 #define Q_MAXNFBITS(q) ((uint32_t)(Q_NTBITS(q) - Q_SIGNED(q) - Q_NCBITS)) argument
90 #define Q_NFBITS(q) \ argument
91 (Q_NFCBITS(q) > Q_MAXNFBITS(q) ? Q_MAXNFBITS(q) : Q_NFCBITS(q))
[all …]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dbqueue.c24 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 Dng_bluetooth.h76 #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 Daes_ct_ctrcbc.c74 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 Daes_ct64_dec.c29 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 Daes_ct_dec.c29 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 Daes_ct64_enc.c28 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 …]
H A Daes_ct_enc.c28 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 …]
/freebsd/sys/dev/netmap/
H A Dnetmap_mbq.c48 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/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_string.c41 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 …]
/freebsd/sys/contrib/dev/mediatek/mt76/
H A Ddma.c162 mt76_dma_queue_magic_cnt_init(struct mt76_dev *dev, struct mt76_queue *q) in mt76_dma_queue_magic_cnt_init() argument
164 if (!mt76_queue_is_wed_rro(q)) in mt76_dma_queue_magic_cnt_init()
167 q->magic_cnt = 0; in mt76_dma_queue_magic_cnt_init()
168 if (mt76_queue_is_wed_rro_ind(q)) { in mt76_dma_queue_magic_cnt_init()
174 rro_desc = (struct mt76_wed_rro_desc *)q->desc; in mt76_dma_queue_magic_cnt_init()
175 for (i = 0; i < q->ndesc; i++) { in mt76_dma_queue_magic_cnt_init()
181 } else if (mt76_queue_is_wed_rro_rxdmad_c(q)) { in mt76_dma_queue_magic_cnt_init()
182 struct mt76_rro_rxdmad_c *dmad = (void *)q->desc; in mt76_dma_queue_magic_cnt_init()
187 for (i = 0; i < q->ndesc; i++) in mt76_dma_queue_magic_cnt_init()
193 mt76_dma_sync_idx(struct mt76_dev *dev, struct mt76_queue *q) in mt76_dma_sync_idx() argument
[all …]
H A Dwed.c36 struct mt76_queue *q = &dev->q_rx[MT_RXQ_MAIN]; in mt76_wed_init_rx_buf() local
50 buf = mt76_get_page_pool_buf(q, &offset, q->buf_size); in mt76_wed_init_rx_buf()
93 int mt76_wed_dma_setup(struct mt76_dev *dev, struct mt76_queue *q, bool reset) in mt76_wed_dma_setup() argument
98 if (!q || !q->ndesc) in mt76_wed_dma_setup()
101 flags = q->flags; in mt76_wed_dma_setup()
102 if (!q->wed || !mtk_wed_device_active(q->wed)) in mt76_wed_dma_setup()
103 q->flags &= ~MT_QFLAG_WED; in mt76_wed_dma_setup()
105 if (!(q->flags & MT_QFLAG_WED)) in mt76_wed_dma_setup()
108 type = FIELD_GET(MT_QFLAG_WED_TYPE, q->flags); in mt76_wed_dma_setup()
109 ring = FIELD_GET(MT_QFLAG_WED_RING, q->flags); in mt76_wed_dma_setup()
[all …]
/freebsd/sys/net/altq/
H A Daltq_classq.h69 #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 Dyp_dnslookup.c150 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/libarchive/libarchive/test/
H A Dtest_write_format_zip_compression_store.c93 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()
172 assertEqualInt(i4le(q + 18), 0); /* Compressed size, must be zero because of length-at-end */ in verify_uncompressed_contents()
[all …]
H A Dtest_write_format_zip_compression_zstd.c73 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()
157 assertEqualInt(i4le(q + 14), 0); /* CRC-32 */ in verify_zstd_contents()
158 assertEqualInt(i4le(q + 18), 0); /* Compressed size, must be zero because of length-at-end */ in verify_zstd_contents()
[all …]
H A Dtest_write_format_zip_compression_bzip2.c73 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()
158 assertEqualInt(i4le(q + 18), 0); /* Compressed size, must be zero because of length-at-end */ in verify_bzip2_contents()
[all …]
H A Dtest_write_format_zip_compression_lzmaxz.c74 const char *p, *q, *local_header, *extra_start; in verify_xz_lzma() local
151 local_header = q = buff; in verify_xz_lzma()
152 assertEqualMem(q, "PK\003\004", 4); /* Signature */ in verify_xz_lzma()
153 assertEqualInt(i2le(q + 4), 63); /* Version needed to extract */ in verify_xz_lzma()
154 …assertEqualInt(i2le(q + 6), flags); /* Flags: bit 3 = length-at-end (required because CRC32 is unk… in verify_xz_lzma()
155 assertEqualInt(i2le(q + 8), id); /* Compression method */ in verify_xz_lzma()
156 …assertEqualInt(i2le(q + 10), (tm->tm_hour * 2048) + (tm->tm_min * 32) + (tm->tm_sec / 2)); /* File… in verify_xz_lzma()
157 …assertEqualInt(i2le(q + 12), ((tm->tm_year - 80) * 512) + ((tm->tm_mon + 1) * 32) + tm->tm_mday); … in verify_xz_lzma()
158 assertEqualInt(i4le(q + 14), 0); /* CRC-32 */ in verify_xz_lzma()
159 assertEqualInt(i4le(q + 18), 0); /* Compressed size, must be zero because of length-at-end */ in verify_xz_lzma()
[all …]
/freebsd/contrib/sendmail/src/
H A Darpadate.c60 register char *q; variable
84 q = b;
87 *q++ = *p++;
88 *q++ = *p++;
89 *q++ = *p++;
90 *q++ = ',';
91 *q++ = ' ';
97 *q++ = *p++;
98 *q++ = *p++;
99 *q++ = ' ';
[all …]
/freebsd/contrib/unbound/libunbound/
H A Dcontext.c131 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/sys/dev/neta/
H A Dif_mvnetareg.h124 #define MVNETA_PRXC(q) (0x1400 + ((q) << 2)) /*Port RX queues Config*/ argument
125 #define MVNETA_PRXSNP(q) (0x1420 + ((q) << 2)) /* Port RX queues Snoop */ argument
126 #define MVNETA_PRXDQA(q) (0x1480 + ((q) << 2)) /*P RXqueues desc Q Addr*/ argument
127 #define MVNETA_PRXDQS(q) (0x14a0 + ((q) << 2)) /*P RXqueues desc Q Size*/ argument
128 #define MVNETA_PRXDQTH(q) (0x14c0 + ((q) << 2)) /*P RXqueues desc Q Thrs*/ argument
129 #define MVNETA_PRXS(q) (0x14e0 + ((q) << 2)) /*Port RX queues Status */ argument
130 #define MVNETA_PRXSU(q) (0x1500 + ((q) << 2)) /*P RXqueues Stat Update*/ argument
131 #define MVNETA_PRXDI(q) (0x1520 + ((q) << 2)) /*P RXqueues Stat Update*/ argument
144 #define MVNETA_PTXDQA(q) (0x3c00 + ((q) << 2)) /*P TXqueues desc Q Addr*/ argument
145 #define MVNETA_PTXDQS(q) (0x3c20 + ((q) << 2)) /*P TXqueues desc Q Size*/ argument
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dder_cmp.c37 der_heim_oid_cmp(const heim_oid *p, const heim_oid *q) in der_heim_oid_cmp() argument
39 if (p->length != q->length) in der_heim_oid_cmp()
40 return p->length - q->length; in der_heim_oid_cmp()
42 q->components, in der_heim_oid_cmp()
48 const heim_octet_string *q) in der_heim_octet_string_cmp() argument
50 if (p->length != q->length) in der_heim_octet_string_cmp()
51 return p->length - q->length; in der_heim_octet_string_cmp()
52 return memcmp(p->data, q->data, p->length); in der_heim_octet_string_cmp()
57 const heim_printable_string *q) in der_printable_string_cmp() argument
59 return der_heim_octet_string_cmp(p, q); in der_printable_string_cmp()
[all …]
/freebsd/contrib/netbsd-tests/fs/ffs/
H A Dt_quotalimit.sh30 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/lib/msun/tests/
H A Drem_test.c108 int q; in test_invalid() local
110 q = 0xdeadbeef; in test_invalid()
113 ATF_CHECK(isnan(remquo(x, y, &q))); in test_invalid()
115 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
119 ATF_CHECK(isnan(remquof(x, y, &q))); in test_invalid()
121 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
125 ATF_CHECK(isnan(remquol(x, y, &q))); in test_invalid()
127 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
141 int q; in testl() local
144 q = random(); in testl()
[all …]

12345678910>>...82