Home
last modified time | relevance | path

Searched +full:- +full:q (Results 1 – 25 of 1085) sorted by relevance

12345678910>>...44

/netbsd-src/external/gpl3/gcc.old/dist/libquadmath/math/
H A Dexpq_table.h2 Copyright (C) 1999-2018 Free Software Foundation, Inc.
25 These table have the property that, for all integers -B <= i <= B
30 where absl(s) <= 2^-54 and absl(r) <= 2^-212. */
33 -3.47656250000000000584188889839535373E-01Q, /* bffd640000000000002b1b04213cf000 */
34 6.90417668990715641167244540876988960E-32Q, /* 3f97667c3fdb588a6ae1af8748357a17 */
35 -3.43749999999999981853132895957607418E-01Q, /* bffd5ffffffffffffac4ff5f4050b000 */
36 -7.16021898043268093462818380603370350E-33Q, /* bf94296c8219427edc1431ac2498583e */
37 -3.39843750000000013418643523138766329E-01Q, /* bffd5c000000000003de1f027a30e000 */
38 8.16920774283317801641347327589583265E-32Q, /* 3f97a82b65774bdca1b4440d749ed8d3 */
39 -3.35937500000000014998092453039303051E-01Q, /* bffd5800000000000452a9f4d8857000 */
[all …]
H A Dlgammaq_neg.c2 Copyright (C) 2015-2018 Free Software Foundation, Inc.
19 #include "quadmath-imp.h"
23 { -0x2.74ff92c01f0d82abec9f315f1a08p+0Q, 0xe.d3ccb7fb2658634a2b9f6b2ba81p-116Q },
24 { -0x2.bf6821437b20197995a4b4641eaep+0Q, -0xb.f4b00b4829f961e428533e6ad048p-116Q },
25 { -0x3.24c1b793cb35efb8be699ad3d9bap+0Q, -0x6.5454cb7fac60e3f16d9d7840c2ep-116Q },
26 { -0x3.f48e2a8f85fca170d4561291236cp+0Q, -0xc.320a4887d1cb4c711828a75d5758p-116Q },
27 { -0x4.0a139e16656030c39f0b0de18114p+0Q, 0x1.53e84029416e1242006b2b3d1cfp-112Q },
28 { -0x4.fdd5de9bbabf3510d0aa40769884p+0Q, -0x1.01d7d78125286f78d1e501f14966p-112Q },
29 { -0x5.021a95fc2db6432a4c56e595394cp+0Q, -0x1.ecc6af0430d4fe5746fa7233356fp-112Q },
30 { -0x5.ffa4bd647d0357dd4ed62cbd31ecp+0Q, -0x1.f8e3f8e5deba2d67dbd70dd96ce1p-112Q },
[all …]
H A Dsincos_table.c1 /* Quad-precision floating point sine and cosine tables.
2 Copyright (C) 1999-2018 Free Software Foundation, Inc.
30 #include "quadmath-imp.h"
34 /* x = 1.48437500000000000000000000000000000e-01L 3ffc3000000000000000000000000000 */
36 9.89003367927322909016887196069562069e-01Q, /* 3ffefa5ea641c36f2041369bb45f31ef */
37 2.15663692029265697782289400027743703e-35Q, /* 3f8bcaaa7b873aff1014b0fbc5243767 */
39 1.47892995873409608580026675734609314e-01Q, /* 3ffc2ee285e4ab88e86cbc3e8847ea1c */
40 9.74950446464233268291647449768590886e-36Q, /* 3f8a9eb2b3dc17f6f43c6dd16342252d */
42 /* x = 1.56250000000000000000000000000000000e-01 3ffc4000000000000000000000000000 */
44 9.87817783816471944100503034363211317e-01Q, /* 3ffef9c340a7cc428716dac18edd188b */
[all …]
H A Dj0q.c21 * is J0(x) = 1 - x^2 / 4 + x^4 R(x^2)
25 * J0(x) = sqrt(2/(pi x)) (P0(x) cos(X) - Q0(x) sin(X)),
26 * X = x - pi/4,
33 * Y0(x)cos(X) - J0(x)sin(X) = sqrt( 2/(pi x)) Q0(x),
34 * Q0(x) = 1/x (-.125 + 1/x^2 R(1/x^2))
42 * IEEE 0, 30 100000 1.7e-34 2.4e-35
74 * IEEE 0, 30 100000 3.0e-34 2.7e-35
78 /* Copyright 2001 by Stephen L. Moshier (moshier@na-net.ornl.gov).
94 #include "quadmath-imp.h"
97 static const __float128 ONEOSQPI = 5.6418958354775628694807945156077258584405E-1Q;
[all …]
H A Dj1q.c25 * J1(x) = sqrt(2/(pi x)) (P1(x) cos(X) - Q1(x) sin(X)),
26 * X = x - 3 pi / 4,
33 * Y1(x)cos(X) - J1(x)sin(X) = sqrt( 2/(pi x)) Q1(x),
42 * IEEE 0, 30 100000 2.8e-34 2.7e-35
68 * Y1(x) = 2/pi * (log(x) * J1(x) - 1/x) + x R(x^2) .
71 * X = x - 3 pi / 4.
78 * IEEE 0, 30 100000 2.7e-34 2.9e-35
82 /* Copyright 2001 by Stephen L. Moshier (moshier@na-net.onrl.gov).
98 #include "quadmath-imp.h"
101 static const __float128 ONEOSQPI = 5.6418958354775628694807945156077258584405E-1Q;
[all …]
H A Dlogq.c3 * Natural logarithm for 128-bit long double precision.
24 * On the interval [-1/128, +1/128] the logarithm of 1+x is approximated by
25 * log(1+x) = x - 0.5 x^2 + x^3 P(x) .
33 * IEEE 0.875, 1.125 100000 1.2e-34 4.1e-35
34 * IEEE 0.125, 8 100000 1.2e-34 4.1e-35
39 * This program uses integer operations on bit fields of floating-point
45 /* Copyright 2001 by Stephen L. Moshier <moshier@na-net.ornl.gov>
61 #include "quadmath-imp.h"
63 /* log(1+x) = x - .5 x^2 + x^3 l(x)
64 -.0078125 <= x <= +.0078125
[all …]
/netbsd-src/external/gpl3/gcc/dist/libquadmath/math/
H A Dexpq_table.h2 Copyright (C) 1999-2018 Free Software Foundation, Inc.
25 These table have the property that, for all integers -B <= i <= B
30 where absl(s) <= 2^-54 and absl(r) <= 2^-212. */
33 -3.47656250000000000584188889839535373E-01Q, /* bffd640000000000002b1b04213cf000 */
34 6.90417668990715641167244540876988960E-32Q, /* 3f97667c3fdb588a6ae1af8748357a17 */
35 -3.43749999999999981853132895957607418E-01Q, /* bffd5ffffffffffffac4ff5f4050b000 */
36 -7.16021898043268093462818380603370350E-33Q, /* bf94296c8219427edc1431ac2498583e */
37 -3.39843750000000013418643523138766329E-01Q, /* bffd5c000000000003de1f027a30e000 */
38 8.16920774283317801641347327589583265E-32Q, /* 3f97a82b65774bdca1b4440d749ed8d3 */
39 -3.35937500000000014998092453039303051E-01Q, /* bffd5800000000000452a9f4d8857000 */
[all …]
H A Dlgammaq_neg.c2 Copyright (C) 2015-2018 Free Software Foundation, Inc.
19 #include "quadmath-imp.h"
23 { -0x2.74ff92c01f0d82abec9f315f1a08p+0Q, 0xe.d3ccb7fb2658634a2b9f6b2ba81p-116Q },
24 { -0x2.bf6821437b20197995a4b4641eaep+0Q, -0xb.f4b00b4829f961e428533e6ad048p-116Q },
25 { -0x3.24c1b793cb35efb8be699ad3d9bap+0Q, -0x6.5454cb7fac60e3f16d9d7840c2ep-116Q },
26 { -0x3.f48e2a8f85fca170d4561291236cp+0Q, -0xc.320a4887d1cb4c711828a75d5758p-116Q },
27 { -0x4.0a139e16656030c39f0b0de18114p+0Q, 0x1.53e84029416e1242006b2b3d1cfp-112Q },
28 { -0x4.fdd5de9bbabf3510d0aa40769884p+0Q, -0x1.01d7d78125286f78d1e501f14966p-112Q },
29 { -0x5.021a95fc2db6432a4c56e595394cp+0Q, -0x1.ecc6af0430d4fe5746fa7233356fp-112Q },
30 { -0x5.ffa4bd647d0357dd4ed62cbd31ecp+0Q, -0x1.f8e3f8e5deba2d67dbd70dd96ce1p-112Q },
[all …]
H A Dsincos_table.c1 /* Quad-precision floating point sine and cosine tables.
2 Copyright (C) 1999-2018 Free Software Foundation, Inc.
30 #include "quadmath-imp.h"
34 /* x = 1.48437500000000000000000000000000000e-01L 3ffc3000000000000000000000000000 */
36 9.89003367927322909016887196069562069e-01Q, /* 3ffefa5ea641c36f2041369bb45f31ef */
37 2.15663692029265697782289400027743703e-35Q, /* 3f8bcaaa7b873aff1014b0fbc5243767 */
39 1.47892995873409608580026675734609314e-01Q, /* 3ffc2ee285e4ab88e86cbc3e8847ea1c */
40 9.74950446464233268291647449768590886e-36Q, /* 3f8a9eb2b3dc17f6f43c6dd16342252d */
42 /* x = 1.56250000000000000000000000000000000e-01 3ffc4000000000000000000000000000 */
44 9.87817783816471944100503034363211317e-01Q, /* 3ffef9c340a7cc428716dac18edd188b */
[all …]
H A Dj0q.c21 * is J0(x) = 1 - x^2 / 4 + x^4 R(x^2)
25 * J0(x) = sqrt(2/(pi x)) (P0(x) cos(X) - Q0(x) sin(X)),
26 * X = x - pi/4,
33 * Y0(x)cos(X) - J0(x)sin(X) = sqrt( 2/(pi x)) Q0(x),
34 * Q0(x) = 1/x (-.125 + 1/x^2 R(1/x^2))
42 * IEEE 0, 30 100000 1.7e-34 2.4e-35
74 * IEEE 0, 30 100000 3.0e-34 2.7e-35
78 /* Copyright 2001 by Stephen L. Moshier (moshier@na-net.ornl.gov).
94 #include "quadmath-imp.h"
97 static const __float128 ONEOSQPI = 5.6418958354775628694807945156077258584405E-1Q;
[all …]
H A Dj1q.c25 * J1(x) = sqrt(2/(pi x)) (P1(x) cos(X) - Q1(x) sin(X)),
26 * X = x - 3 pi / 4,
33 * Y1(x)cos(X) - J1(x)sin(X) = sqrt( 2/(pi x)) Q1(x),
42 * IEEE 0, 30 100000 2.8e-34 2.7e-35
68 * Y1(x) = 2/pi * (log(x) * J1(x) - 1/x) + x R(x^2) .
71 * X = x - 3 pi / 4.
78 * IEEE 0, 30 100000 2.7e-34 2.9e-35
82 /* Copyright 2001 by Stephen L. Moshier (moshier@na-net.onrl.gov).
98 #include "quadmath-imp.h"
101 static const __float128 ONEOSQPI = 5.6418958354775628694807945156077258584405E-1Q;
[all …]
H A Dlogq.c3 * Natural logarithm for 128-bit long double precision.
24 * On the interval [-1/128, +1/128] the logarithm of 1+x is approximated by
25 * log(1+x) = x - 0.5 x^2 + x^3 P(x) .
33 * IEEE 0.875, 1.125 100000 1.2e-34 4.1e-35
34 * IEEE 0.125, 8 100000 1.2e-34 4.1e-35
39 * This program uses integer operations on bit fields of floating-point
45 /* Copyright 2001 by Stephen L. Moshier <moshier@na-net.ornl.gov>
61 #include "quadmath-imp.h"
63 /* log(1+x) = x - .5 x^2 + x^3 l(x)
64 -.0078125 <= x <= +.0078125
[all …]
/netbsd-src/external/apache2/llvm/dist/libcxx/src/
H A Dhash.cpp1 //===-------------------------- hash.cpp ----------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
15 #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
135 // The algorithm creates a list of small primes, plus an open-ended list of
175 if (n <= small_primes[N-1]) in __next_prime()
183 // Known a-priori n >= L in __next_prime()
185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
186 - indices); in __next_prime()
193 // It is known a-priori that n is not divisible by 2, 3, 5 or 7, in __next_prime()
[all …]
/netbsd-src/external/bsd/nsd/dist/
H A Dquery.c2 * query.c -- nsd(8) the resolver.
4 * Copyright (c) 2001-2006, NLnet Labs. All rights reserved.
55 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()
74 assert(domain->number > 0); 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()
[all …]
/netbsd-src/sys/dev/raidframe/
H A Drf_fifo.c3 * Copyright (c) 1995 Carnegie-Mellon University.
23 * Pittsburgh PA 15213-3890
31 * rf_fifo.c -- prioritized fifo queue code.
59 RF_FifoHeader_t *q; in rf_FifoCreate() local
61 q = RF_MallocAndAdd(sizeof(*q), clList); in rf_FifoCreate()
62 q->hq_count = q->lq_count = 0; in rf_FifoCreate()
63 return ((void *) q); in rf_FifoCreate()
69 RF_FifoHeader_t *q = (RF_FifoHeader_t *) q_in; in rf_FifoEnqueue() local
73 elem->next = NULL; in rf_FifoEnqueue()
75 if (!q->hq_tail) { in rf_FifoEnqueue()
[all …]
/netbsd-src/sys/crypto/aes/
H A Daes_bear.c3 /*-
75 aesbear_setkey(enc->aese_aes.aes_rk, key, nrounds); in aesbear_setenckey()
83 * BearSSL computes InvMixColumns on the fly -- no need for in aesbear_setdeckey()
86 aesbear_setkey(dec->aesd_aes.aes_rk, key, nrounds); in aesbear_setdeckey()
94 uint32_t q[8]; in aesbear_enc() local
97 br_aes_ct_skey_expand(sk_exp, nrounds, enc->aese_aes.aes_rk); in aesbear_enc()
100 q[2*0] = le32dec(in + 4*0); in aesbear_enc()
101 q[2*1] = le32dec(in + 4*1); in aesbear_enc()
102 q[2*2] = le32dec(in + 4*2); in aesbear_enc()
103 q[2*3] = le32dec(in + 4*3); in aesbear_enc()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libgcc/config/libbid/
H A Dbid64_to_int32.c1 /* Copyright (C) 2007-2020 Free Software Foundation, Inc.
50 int q, ind, shift; local
70 if (C1 > 9999999999999999ull) { // non-canonical
79 // check for zeros (possibly from non-canonical values)
87 // q = nr. of decimal digits in x (1 <= q <= 54)
90 // split the 64-bit value in two 32-bit halves to avoid rounding errors
94 33 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
98 1 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
103 1 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
105 q = nr_digits[x_nr_bits - 1].digits;
[all …]
/netbsd-src/external/gpl3/gcc/dist/libgcc/config/libbid/
H A Dbid64_to_int32.c1 /* Copyright (C) 2007-2022 Free Software Foundation, Inc.
50 int q, ind, shift; local
70 if (C1 > 9999999999999999ull) { // non-canonical
79 // check for zeros (possibly from non-canonical values)
87 // q = nr. of decimal digits in x (1 <= q <= 54)
90 // split the 64-bit value in two 32-bit halves to avoid rounding errors
94 33 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
98 1 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
103 1 + ((((unsigned int) (tmp1.ui64 >> 52)) & 0x7ff) - 0x3ff);
105 q = nr_digits[x_nr_bits - 1].digits;
[all …]
/netbsd-src/external/cddl/osnet/dist/uts/common/fs/zfs/
H A Dbqueue.c23 obj2node(bqueue_t *q, void *data) in obj2node() argument
25 return ((bqueue_node_t *)((char *)data + q->bq_node_offset)); in obj2node()
32 * success, or -1 on failure.
35 bqueue_init(bqueue_t *q, uint64_t size, size_t node_offset) in bqueue_init() argument
37 list_create(&q->bq_list, node_offset + sizeof (bqueue_node_t), in bqueue_init()
39 cv_init(&q->bq_add_cv, NULL, CV_DEFAULT, NULL); in bqueue_init()
40 cv_init(&q->bq_pop_cv, NULL, CV_DEFAULT, NULL); in bqueue_init()
41 mutex_init(&q->bq_lock, NULL, MUTEX_DEFAULT, NULL); in bqueue_init()
42 q->bq_node_offset = node_offset; in bqueue_init()
43 q->bq_size = 0; in bqueue_init()
[all …]
/netbsd-src/external/bsd/unbound/dist/libunbound/
H A Dcontext.c2 * libunbound/context.c - validating context for unbound internal use
61 struct config_file* cfg = ctx->env->cfg; in context_finalize()
62 verbosity = cfg->verbosity; in context_finalize()
63 if(ctx_logfile_overridden && !ctx->logfile_override) { in context_finalize()
67 if(ctx->logfile_override) { in context_finalize()
69 log_file(ctx->log_out); in context_finalize()
71 log_init(cfg->logfile, cfg->use_syslog, NULL); in context_finalize()
73 ctx->pipe_pid = getpid(); in context_finalize()
76 if(!modstack_setup(&ctx->mods, cfg->module_conf, ctx->env)) in context_finalize()
79 log_edns_known_options(VERB_ALGO, ctx->env); in context_finalize()
[all …]
/netbsd-src/external/bsd/ntp/dist/tests/ntpd/
H A Dntp_prio_q.c18 -fix the includes
19 -makefile: ntpdsim-ntp_prio_q.o - make sure it's okay
35 return ((const element*)e1)->number < ((const element*)e2)->number; in compare_elements()
51 queue* q = create_queue(); in test_EmptyQueue() local
53 TEST_ASSERT_NOT_NULL(q); in test_EmptyQueue()
54 TEST_ASSERT_TRUE(empty(q)); in test_EmptyQueue()
55 TEST_ASSERT_NULL(queue_head(q)); in test_EmptyQueue()
56 TEST_ASSERT_NULL(dequeue(q)); in test_EmptyQueue()
57 TEST_ASSERT_EQUAL(0, get_no_of_elements(q)); in test_EmptyQueue()
59 destroy_queue(q); in test_EmptyQueue()
[all …]
/netbsd-src/external/lgpl3/mpfr/dist/tests/
H A Dtremquo.c1 /* tremquo -- test file for mpfr_remquo, mpfr_remainder and mpfr_fmodquo.
3 Copyright 2007-2023 Free Software Foundation, Inc.
21 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
23 #include "mpfr-test.h"
34 mpfr_set_si (x, -1, MPFR_RNDN); in bug20090227()
37 /* since the quotient is -1, r1 is the rounding of x+y */ in bug20090227()
58 long q[1]; in main() local
70 mpfr_remquo (r, q, x, y, MPFR_RNDN); in main()
73 printf (" q=%ld\n", q[0]); in main()
89 mpfr_remquo (r, q, x, y, MPFR_RNDN); in main()
[all …]
/netbsd-src/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 …]
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/cloog/
H A Dswim.st1 …Q, R] -> { S40[i0, i1, i2] : M = 1 and i0 >= 2 and i0 <= P and i1 >= 1 and i1 <= Q and i2 >= 1 and…
3 context: "[M, N, O, P, Q, R] -> { [] }"
6 - filter: "[M, N, O, P, Q, R] -> { S1[] }"
7 - filter: "[M, N, O, P, Q, R] -> { S2[] }"
8 - filter: "[M, N, O, P, Q, R] -> { S3[] }"
9 - filter: "[M, N, O, P, Q, R] -> { S4[] }"
10 - filter: "[M, N, O, P, Q, R] -> { S5[] }"
11 - filter: "[M, N, O, P, Q, R] -> { S6[] }"
12 - filter: "[M, N, O, P, Q, R] -> { S7[] }"
13 - filter: "[M, N, O, P, Q, R] -> { S8[] }"
[all …]
/netbsd-src/external/mpl/dhcp/dist/common/
H A Ddispatch.c8 * Copyright (C) 2004-2022 Internet Systems Consortium, Inc. ("ISC")
9 * Copyright (c) 1995-2003 by Internet Software Consortium
61 if ((timeouts -> when . tv_sec < cur_tv . tv_sec) || in process_outstanding_timeouts()
62 ((timeouts -> when . tv_sec == cur_tv . tv_sec) && in process_outstanding_timeouts()
63 (timeouts -> when . tv_usec <= cur_tv . tv_usec))) { in process_outstanding_timeouts()
65 timeouts = timeouts -> next; in process_outstanding_timeouts()
66 (*(t -> func)) (t -> what); in process_outstanding_timeouts()
67 if (t -> unref) in process_outstanding_timeouts()
68 (*t -> unref) (&t -> what, MDL); in process_outstanding_timeouts()
69 t -> next = free_timeouts; in process_outstanding_timeouts()
[all …]

12345678910>>...44