Home
last modified time | relevance | path

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

12345678910>>...100

/openbsd/src/gnu/llvm/libcxx/src/
Dhash.cpp198 const std::size_t q = n / p; in __next_prime() local
199 if (q < p) in __next_prime()
201 if (n == q * p) in __next_prime()
209 std::size_t q = n / i; in __next_prime() local
210 if (q < i) in __next_prime()
212 if (n == q * i) in __next_prime()
216 q = n / i; in __next_prime()
217 if (q < i) in __next_prime()
219 if (n == q * i) in __next_prime()
223 q = n / i; in __next_prime()
[all …]
/openbsd/src/gnu/gcc/libgomp/testsuite/libgomp.fortran/
Dvla4.f9024 integer :: p, q, r local
33 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + p - q + 2 * r
34 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - p + q - 2 * r
35 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = '_+|/Oo_'
36 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = '///|||!'
50 do 100, q = 3, 7
52 if (q .lt. 6) l = l .or. e(p, q, r) .ne. 5 + p + q + 2 * r
53 l = l .or. f(p, q, r) .ne. 25 + p + q + 2 * r
54 if (r .lt. 6 .and. q + r .le. 8) l = l .or. g(r, q) .ne. '0123456789AB'
55 if (r .lt. 6 .and. q + r .gt. 8) l = l .or. g(r, q) .ne. '9876543210ZY'
[all …]
Dvla1.f9024 integer :: p, q, r local
33 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + p - q + 2 * r
34 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - p + q - 2 * r
35 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = '_+|/Oo_'
36 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = '///|||!'
45 do 100, q = 3, 7
47 if (q .lt. 6) l = l .or. e(p, q, r) .ne. 5 + p + q + 2 * r
48 l = l .or. f(p, q, r) .ne. 25 + p + q + 2 * r
49 if (r .lt. 6 .and. q + r .le. 8) l = l .or. g(r, q) .ne. '0123456789AB'
50 if (r .lt. 6 .and. q + r .gt. 8) l = l .or. g(r, q) .ne. '9876543210ZY'
[all …]
Dvla3.f9024 integer :: p, q, r local
33 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + p - q + 2 * r
34 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - p + q - 2 * r
35 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = '_+|/Oo_'
36 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = '///|||!'
45 do 100, q = 3, 7
47 if (q .lt. 6) l = l .or. e(p, q, r) .ne. 5 + p + q + 2 * r
48 l = l .or. f(p, q, r) .ne. 25 + p + q + 2 * r
49 if (r .lt. 6 .and. q + r .le. 8) l = l .or. g(r, q) .ne. '0123456789AB'
50 if (r .lt. 6 .and. q + r .gt. 8) l = l .or. g(r, q) .ne. '9876543210ZY'
[all …]
Dvla5.f9024 integer :: p, q, r local
33 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + p - q + 2 * r
34 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - p + q - 2 * r
35 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = '_+|/Oo_'
36 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = '///|||!'
55 forall (p = 1:2, q = 3:5, r = 1:7) e(p, q, r) = 5 * x + p + q + 2 * r
56 forall (p = 1:2, q = 3:7, r = 1:7) f(p, q, r) = 25 * x + p + q + 2 * r
57 forall (p = 1:5, q = 3:7, p + q .le. 8) g(p, q) = w(8:19)
58 forall (p = 1:5, q = 3:7, p + q .gt. 8) g(p, q) = w(27:38)
59 forall (p = 1:5, q = 3:7, p + q .le. 8) h(p, q) = w(1:7)
[all …]
Dvla6.f9024 integer :: p, q, r local
46 forall (p = 1:2, q = 3:5, r = 1:7) e(p, q, r) = 5 * x + p + q + 2 * r
47 forall (p = 1:2, q = 3:7, r = 1:7) f(p, q, r) = 25 * x + p + q + 2 * r
48 forall (p = 1:5, q = 3:7, p + q .le. 8) g(p, q) = w(8:19)
49 forall (p = 1:5, q = 3:7, p + q .gt. 8) g(p, q) = w(27:38)
50 forall (p = 1:5, q = 3:7, p + q .le. 8) h(p, q) = w(1:7)
51 forall (p = 1:5, q = 3:7, p + q .gt. 8) h(p, q) = w(20:26)
52 forall (p = 3:5, q = 2:6, r = 1:7) i(p - 2, q - 1, r) = (7.5 + x) * p * q * r
53 forall (p = 3:5, q = 2:6, r = 1:7) j(p, q + 3, r + 6) = (9.5 + x) * p * q * r
54 forall (p = 1:5, q = 7:7, r = 4:6) k(p, q - 6, r - 3) = 19 + x + p + q + 3 * r
[all …]
Dvla2.f9024 integer :: p, q, r local
46 forall (p = 1:2, q = 3:5, r = 1:7) e(p, q, r) = 5 * x + p + q + 2 * r
47 forall (p = 1:2, q = 3:7, r = 1:7) f(p, q, r) = 25 * x + p + q + 2 * r
48 forall (p = 1:5, q = 3:7, p + q .le. 8) g(p, q) = w(8:19)
49 forall (p = 1:5, q = 3:7, p + q .gt. 8) g(p, q) = w(27:38)
50 forall (p = 1:5, q = 3:7, p + q .le. 8) h(p, q) = w(1:7)
51 forall (p = 1:5, q = 3:7, p + q .gt. 8) h(p, q) = w(20:26)
52 forall (p = 3:5, q = 2:6, r = 1:7) i(p - 2, q - 1, r) = (7.5 + x) * p * q * r
53 forall (p = 3:5, q = 2:6, r = 1:7) j(p, q + 3, r + 6) = (9.5 + x) * p * q * r
54 forall (p = 1:5, q = 7:7, r = 4:6) k(p, q - 6, r - 3) = 19 + x + p + q + 3 * r
[all …]
/openbsd/src/usr.sbin/nsd/
Dquery.c55 struct query *q,
63 static void answer_lookup_zone(struct nsd *nsd, struct query *q,
70 query_put_dname_offset(struct query *q, domain_type *domain, uint16_t offset) in query_put_dname_offset() argument
72 assert(q); in query_put_dname_offset()
78 if (q->compressed_dname_count >= MAX_COMPRESSED_DNAMES) in query_put_dname_offset()
81 q->compressed_dname_offsets[domain->number] = offset; in query_put_dname_offset()
82 q->compressed_dnames[q->compressed_dname_count] = domain; in query_put_dname_offset()
83 ++q->compressed_dname_count; in query_put_dname_offset()
87 query_clear_dname_offsets(struct query *q, size_t max_offset) in query_clear_dname_offsets() argument
89 while (q->compressed_dname_count > 0 in query_clear_dname_offsets()
[all …]
/openbsd/src/gnu/usr.bin/perl/dist/I18N-LangTags/t/
D10_http.t7 my @in = grep m/\S/, split /\n/, q{
16 …-gb en-us mt-mt mt ja ] EN-au, JA;q=0.14, i-klingon;q=0.83, en-gb;q=0.71, en-us;q=0.57, mt-mt;q=0…
17 …t-mt mt tli ja ] EN-au, tli;q=0.201, JA;q=0.14, i-klingon;q=0.83, en-gb;q=0.71, en-us;q=0.57, mt-…
18 [ en-au en en-gb en-us ja ] en-au, ja;q=0.20, en-gb;q=0.60, en-us;q=0.40, en;q=0.80
20 …-au en en-gb en-us mt-mt mt ja ] EN-au, JA;q=0.14, en-gb;q=0.71, en-us;q=0.57, mt-mt;q=0.43, mt;q…
21 [ en-au en en-gb en-us ja ] en-au, ja;q=0.20, en-gb;q=0.60, en-us;q=0.40, en;q=0.80
22 [ en fr ] en;q=1,fr;q=.5
23 [ en fr ] en;q=1,fr;q=.99
24 [ en ru ko ] en, ru;q=0.7, ko;q=0.3
25 [ en ru ko ] en, ru;q=0.7, KO;q=0.3
[all …]
/openbsd/src/sys/crypto/
Daes.c95 aes_ct_bitslice_Sbox(uint32_t *q) in aes_ct_bitslice_Sbox() argument
122 x0 = q[7]; in aes_ct_bitslice_Sbox()
123 x1 = q[6]; in aes_ct_bitslice_Sbox()
124 x2 = q[5]; in aes_ct_bitslice_Sbox()
125 x3 = q[4]; in aes_ct_bitslice_Sbox()
126 x4 = q[3]; in aes_ct_bitslice_Sbox()
127 x5 = q[2]; in aes_ct_bitslice_Sbox()
128 x6 = q[1]; in aes_ct_bitslice_Sbox()
129 x7 = q[0]; in aes_ct_bitslice_Sbox()
260 q[7] = s0; in aes_ct_bitslice_Sbox()
[all …]
/openbsd/src/gnu/usr.bin/perl/dist/threads/t/
Dfree2.t13 Test::skip_all(q/Perl not compiled with 'useithreads'/);
23 Test::skip_all(q/threads::shared not available/);
27 Test::skip_all(q/Needs threads::shared 0.92 or later/);
38 my $q = Thread::Queue->new();
43 $q->enqueue(@_) if @_;
45 while ($q->pending()) {
46 my $ok = $q->dequeue();
47 my $name = $q->dequeue();
75 my $q = shift;
77 $q->enqueue($tid, "Thread $tid started");
[all …]
/openbsd/src/gnu/usr.bin/perl/t/op/
D64bitint.t7 eval { my $q = pack "q", 0 };
34 my $q = 12345678901;
40 $x = unpack "q", pack "q", $q;
41 cmp_ok($x, '==', $q);
46 is($x, $q);
49 $x = sprintf("%lld", $q);
50 cmp_ok($x, '==', $q);
51 is($x, $q);
54 $x = sprintf("%Ld", $q);
55 cmp_ok($x, '==', $q);
[all …]
Drefstack.t38 q{my @a = 1..3; @a = map { splice( @a, 0 ); $_ } (@a); print "@a\n";},
65 q{@a = 1..2; for (@a, 3) { $t = 'x'; $t =~ s/x/@a = ()/e; }},
77 q{map { @a = ($_+=0) x $_ } @a=/\B./g for 100;},
87 q{$a=@F[4,7]-=@F=3},
97 q{sub f { my $x; *G = \1; sub { package DB; ()=caller 1; @a = @DB::args; $x; }->(); } f($G)},
123 q{sub foo { $x=0; \@_; } $x = { qw( a 1 b 2) }; foo(%$x);},
136 …q{sub TIEARRAY {bless []} sub FETCH {[1]} tie my @a, 'main'; my $p = \$a[0]; my @h = ($$p->[0], $$…
148 q{use Carp; @a=(1); f(@a); sub f { my $x = shift(@a); carp($x)}},
160 q{my @a = (1); sub f { @a = () } $a[1] ||= f();},
176 q{@a = (1); foo(@a); sub foo { my $x = shift(@a); my $y = shift; }},
[all …]
Dfor-many.t18 for my ($q, $r) ('A', 'B', 'C', 'D') {
19 push @have, "$q;$r";
25 for my ($q, $r) (reverse 'A', 'B', 'C', 'D') {
26 push @have, "$q;$r";
32 for my ($q, $r) ('A', 'B', 'C', 'D', 'E', 'F') {
33 push @have, "$q;$r";
39 for my ($q, $r, $s) ('A', 'B', 'C', 'D', 'E', 'F') {
40 push @have, "$q;$r;$s";
46 for my ($q, $r, $s,) ('A', 'B', 'C', 'D', 'E', 'F') {
47 push @have, "$q;$r;$s";
[all …]
/openbsd/src/sys/dev/fdt/
Dif_mvnetareg.h40 #define MVNETA_PRXC(q) (0x1400 + ((q) << 2)) /*Port RX queues Config*/ argument
41 #define MVNETA_PRXSNP(q) (0x1420 + ((q) << 2)) /* Port RX queues Snoop */ argument
42 #define MVNETA_PRXF01(q) (0x1440 + ((q) << 2)) /* Port RX Prefetch 0_1 */ argument
43 #define MVNETA_PRXF23(q) (0x1460 + ((q) << 2)) /* Port RX Prefetch 2_3 */ argument
44 #define MVNETA_PRXDQA(q) (0x1480 + ((q) << 2)) /*P RXqueues desc Q Addr*/ argument
45 #define MVNETA_PRXDQS(q) (0x14a0 + ((q) << 2)) /*P RXqueues desc Q Size*/ argument
46 #define MVNETA_PRXDQTH(q) (0x14c0 + ((q) << 2)) /*P RXqueues desc Q Thrs*/ argument
47 #define MVNETA_PRXS(q) (0x14e0 + ((q) << 2)) /*Port RX queues Status */ argument
48 #define MVNETA_PRXSU(q) (0x1500 + ((q) << 2)) /*P RXqueues Stat Update*/ argument
49 #define MVNETA_PPLBSZ(q) (0x1700 + ((q) << 2)) /* P Pool n Buffer Size */ argument
[all …]
/openbsd/src/usr.sbin/unbound/libunbound/
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 …]
/openbsd/src/sbin/unwind/libunbound/libunbound/
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 …]
/openbsd/src/regress/lib/libm/msun/
Drem_test.c111 int q; in test_invalid() local
113 q = 0xdeadbeef; in test_invalid()
116 ATF_CHECK(isnan(remquo(x, y, &q))); in test_invalid()
118 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
122 ATF_CHECK(isnan(remquof(x, y, &q))); in test_invalid()
124 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
128 ATF_CHECK(isnan(remquol(x, y, &q))); in test_invalid()
130 ATF_CHECK(q == 0xdeadbeef); in test_invalid()
144 int q; in testl() local
147 q = random(); in testl()
[all …]
/openbsd/src/gnu/usr.bin/perl/dist/Thread-Queue/t/
D06_insert.t25 my $q = Thread::Queue->new(1..10);
26 ok($q, 'New queue');
29 $q->insert(5);
30 $q->insert(-5);
31 $q->insert(100);
32 $q->insert(-100);
35 my @x = $q->dequeue_nb(100);
39 $q = Thread::Queue->new(1..10);
40 ok($q, 'New queue');
43 $q->insert(10, qw/tail/);
[all …]
/openbsd/src/sys/dev/pci/drm/amd/amdkfd/
Dkfd_process_queue_manager.c39 if ((pqn->q && pqn->q->properties.queue_id == qid) || in get_queue_by_qid()
116 if (pqn->q) in pqm_set_gws()
117 dev = pqn->q->device; in pqm_set_gws()
142 pqn->q->gws); in pqm_set_gws()
145 pqn->q->gws = mem; in pqm_set_gws()
153 pqn->q->gws = gws ? ERR_PTR(-ENOMEM) : NULL; in pqm_set_gws()
159 return pqn->q->device->dqm->ops.update_queue(pqn->q->device->dqm, in pqm_set_gws()
160 pqn->q, &minfo); in pqm_set_gws()
189 dev = pqn->q->device; in pqm_clean_queue_resource()
197 if (pqn->q->gws) { in pqm_clean_queue_resource()
[all …]
Dkfd_device_queue_manager.c62 struct queue *q);
65 struct queue *q);
66 static int allocate_hqd(struct device_queue_manager *dqm, struct queue *q);
68 struct queue *q, const uint32_t *restore_sdma_id);
158 struct queue *q; in kfd_hws_hang() local
163 list_for_each_entry(q, &qpd->queues_list, list) { in kfd_hws_hang()
196 static int add_queue_mes(struct device_queue_manager *dqm, struct queue *q, in add_queue_mes() argument
232 queue_input.gang_context_addr = q->gang_ctx_gpu_addr; in add_queue_mes()
233 queue_input.inprocess_gang_priority = q->properties.priority; in add_queue_mes()
236 queue_input.doorbell_offset = q->properties.doorbell_off; in add_queue_mes()
[all …]
/openbsd/src/usr.sbin/radiusd/
Dradiusd.c445 struct radius_query *q = NULL; in radiusd_listen_handle_packet() local
510 TAILQ_FOREACH(q, &listn->radiusd->query, next) { in radiusd_listen_handle_packet()
511 if (peer->sa_family == q->clientaddr.ss_family && in radiusd_listen_handle_packet()
512 ((peer->sa_family == AF_INET && in(&q->clientaddr).s_addr == in radiusd_listen_handle_packet()
514 IN6_ARE_ADDR_EQUAL(&in6(&q->clientaddr), &in6(peer)))) && in radiusd_listen_handle_packet()
515 ((struct sockaddr_in *)&q->clientaddr)->sin_port == in radiusd_listen_handle_packet()
517 req_id == q->req_id) in radiusd_listen_handle_packet()
520 if (q != NULL) { in radiusd_listen_handle_packet()
523 peerstr, req_id, q->id); in radiusd_listen_handle_packet()
524 q = NULL; in radiusd_listen_handle_packet()
[all …]
/openbsd/src/sys/dev/rasops/
Drasops32.c72 int64_t q[4]; in rasops32_putchar() member
118 rp[0] = u.q[fb >> 6]; in rasops32_putchar()
119 rp[1] = u.q[(fb >> 4) & 3]; in rasops32_putchar()
120 rp[2] = u.q[(fb >> 2) & 3]; in rasops32_putchar()
129 rp[0] = u.q[fb >> 6]; in rasops32_putchar()
130 rp[1] = u.q[(fb >> 4) & 3]; in rasops32_putchar()
131 rp[2] = u.q[(fb >> 2) & 3]; in rasops32_putchar()
132 rp[3] = u.q[fb & 3]; in rasops32_putchar()
141 rp[0] = u.q[fb >> 6]; in rasops32_putchar()
142 rp[1] = u.q[(fb >> 4) & 3]; in rasops32_putchar()
[all …]
/openbsd/src/regress/sys/arch/sparc64/emul-ldqstq/goodfreg/
Dgoodfreg.c160 c_stq(union fpregs *frp, int freg, struct fpquad *q) in c_stq() argument
162 q->x1 = frp->f_reg32[freg]; in c_stq()
163 q->x2 = frp->f_reg32[freg + 1]; in c_stq()
164 q->x3 = frp->f_reg32[freg + 2]; in c_stq()
165 q->x4 = frp->f_reg32[freg + 3]; in c_stq()
169 c_ldq(union fpregs *frp, int freg, struct fpquad *q) in c_ldq() argument
171 frp->f_reg32[freg] = q->x1; in c_ldq()
172 frp->f_reg32[freg + 1] = q->x2; in c_ldq()
173 frp->f_reg32[freg + 2] = q->x3; in c_ldq()
174 frp->f_reg32[freg + 3] = q->x4; in c_ldq()
[all …]
/openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/
D950922-1.c24 struct sq q; in f() local
50 …q.z += 16; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} n -= 16; }{ p->x = (zeroes)… in f()
53 { p->x = ("0"); p->r = 1; q.z += 1; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} in f()
54 { p->x = 0; p->r = 1; q.z += 1; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} in f()
55 …q.z += 16; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} n -= 16; }{ p->x = (zeroes)… in f()
56 … { p->x = cp; p->r = ndig; q.z += ndig; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} in f()
58 … { p->x = cp; p->r = expt; q.z += expt; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} in f()
60 { p->x = ("."); p->r = 1; q.z += 1; p++; if (++q.t >= 8) { if (g(fp, &q)) goto error; p = w; }} in f()
61 …{ p->x = cp; p->r = (ndig-expt); q.z += (ndig-expt); p++; if (++q.t >= 8) { if (g(fp, &q)) goto er… in f()

12345678910>>...100