Home
last modified time | relevance | path

Searched +full:- +full:i0 (Results 1 – 25 of 172) sorted by relevance

1234567

/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bitvector.h1 //===-- sanitizer_bitvector.h -----------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
111 // This is essentially a 2-level bit vector.
128 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { in setAll() local
129 l1_[i0].setAll(); in setAll()
131 l2_[i0][i1].setAll(); in setAll()
145 uptr i0 = idx0(idx); in setBit() local
148 if (!l1_[i0].getBit(i1)) { in setBit()
[all …]
/freebsd/lib/msun/src/
H A Ds_floor.c14 * Return x rounded toward -inf to integral value
31 int32_t i0,i1,j0; in floor() local
33 EXTRACT_WORDS(i0,i1,x); in floor()
34 j0 = ((i0>>20)&0x7ff)-0x3ff; in floor()
38 if(i0>=0) {i0=i1=0;} in floor()
39 else if(((i0&0x7fffffff)|i1)!=0) in floor()
40 { i0=0xbff00000;i1=0;} in floor()
44 if(((i0&i)|i1)==0) return x; /* x is integral */ in floor()
46 if(i0<0) i0 += (0x00100000)>>j0; in floor()
47 i0 &= (~i); i1=0; in floor()
[all …]
H A Ds_ceil.c14 * Return x rounded toward -inf to integral value
31 int32_t i0,i1,j0; in ceil() local
33 EXTRACT_WORDS(i0,i1,x); in ceil()
34 j0 = ((i0>>20)&0x7ff)-0x3ff; in ceil()
38 if(i0<0) {i0=0x80000000;i1=0;} in ceil()
39 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;} in ceil()
43 if(((i0&i)|i1)==0) return x; /* x is integral */ in ceil()
45 if(i0>0) i0 += (0x00100000)>>j0; in ceil()
46 i0 &= (~i); i1=0; in ceil()
53 i = ((u_int32_t)(0xffffffff))>>(j0-20); in ceil()
[all …]
H A Ds_rint.c30 -4.50359962737049600000e+15, /* 0xC3300000, 0x00000000 */
36 int32_t i0,j0,sx; in rint() local
39 EXTRACT_WORDS(i0,i1,x); in rint()
40 sx = (i0>>31)&1; in rint()
41 j0 = ((i0>>20)&0x7ff)-0x3ff; in rint()
44 if(((i0&0x7fffffff)|i1)==0) return x; in rint()
45 i1 |= (i0&0x0fffff); in rint()
46 i0 &= 0xfffe0000; in rint()
47 i0 |= ((i1|-i1)>>12)&0x80000; in rint()
48 SET_HIGH_WORD(x,i0); in rint()
[all …]
H A Ds_ceilf.c1 /* s_ceilf.c -- float version of s_ceil.c.
24 int32_t i0,j0; in ceilf() local
27 GET_FLOAT_WORD(i0,x); in ceilf()
28 j0 = ((i0>>23)&0xff)-0x7f; in ceilf()
32 if(i0<0) {i0=0x80000000;} in ceilf()
33 else if(i0!=0) { i0=0x3f800000;} in ceilf()
37 if((i0&i)==0) return x; /* x is integral */ in ceilf()
39 if(i0>0) i0 += (0x00800000)>>j0; in ceilf()
40 i0 &= (~i); in ceilf()
47 SET_FLOAT_WORD(x,i0); in ceilf()
H A Ds_floorf.c1 /* s_floorf.c -- float version of s_floor.c.
18 * Return x rounded toward -inf to integral value
33 int32_t i0,j0; in floorf() local
35 GET_FLOAT_WORD(i0,x); in floorf()
36 j0 = ((i0>>23)&0xff)-0x7f; in floorf()
40 if(i0>=0) {i0=0;} in floorf()
41 else if((i0&0x7fffffff)!=0) in floorf()
42 { i0=0xbf800000;} in floorf()
46 if((i0&i)==0) return x; /* x is integral */ in floorf()
48 if(i0<0) i0 += (0x00800000)>>j0; in floorf()
[all …]
H A Ds_rintf.c1 /* s_rintf.c -- float version of s_rint.c.
25 -8.3886080000e+06, /* 0xcb000000 */
31 int32_t i0,j0,sx; in rintf() local
33 GET_FLOAT_WORD(i0,x); in rintf()
34 sx = (i0>>31)&1; in rintf()
35 j0 = ((i0>>23)&0xff)-0x7f; in rintf()
38 if((i0&0x7fffffff)==0) return x; in rintf()
40 t = w-TWO23[sx]; in rintf()
41 GET_FLOAT_WORD(i0,t); in rintf()
42 SET_FLOAT_WORD(t,(i0&0x7fffffff)|(sx<<31)); in rintf()
[all …]
H A Ds_truncf.c29 int32_t i0,j0; in truncf() local
31 GET_FLOAT_WORD(i0,x); in truncf()
32 j0 = ((i0>>23)&0xff)-0x7f; in truncf()
36 i0 &= 0x80000000; in truncf()
39 if((i0&i)==0) return x; /* x is integral */ in truncf()
41 i0 &= (~i); in truncf()
47 SET_FLOAT_WORD(x,i0); in truncf()
H A Ds_modf.c30 int32_t i0,i1,j0; in modf() local
32 EXTRACT_WORDS(i0,i1,x); in modf()
33 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */ in modf()
36 INSERT_WORDS(*iptr,i0&0x80000000,0); /* *iptr = +-0 */ in modf()
40 if(((i0&i)|i1)==0) { /* x is integral */ in modf()
44 INSERT_WORDS(x,high&0x80000000,0); /* return +-0 */ in modf()
47 INSERT_WORDS(*iptr,i0&(~i),0); in modf()
48 return x - *iptr; in modf()
59 INSERT_WORDS(x,high&0x80000000,0); /* return +-0 */ in modf()
62 i = ((u_int32_t)(0xffffffff))>>(j0-20); in modf()
[all …]
H A Ds_trunc.c31 int32_t i0,i1,j0; in trunc() local
33 EXTRACT_WORDS(i0,i1,x); in trunc()
34 j0 = ((i0>>20)&0x7ff)-0x3ff; in trunc()
38 i0 &= 0x80000000U; in trunc()
43 if(((i0&i)|i1)==0) return x; /* x is integral */ in trunc()
45 i0 &= (~i); i1=0; in trunc()
52 i = ((u_int32_t)(0xffffffff))>>(j0-20); in trunc()
57 INSERT_WORDS(x,i0,i1); in trunc()
H A Ds_modff.c1 /* s_modff.c -- float version of s_modf.c.
24 int32_t i0,j0; in modff() local
26 GET_FLOAT_WORD(i0,x); in modff()
27 j0 = ((i0>>23)&0xff)-0x7f; /* exponent of x */ in modff()
30 SET_FLOAT_WORD(*iptr,i0&0x80000000); /* *iptr = +-0 */ in modff()
34 if((i0&i)==0) { /* x is integral */ in modff()
38 SET_FLOAT_WORD(x,ix&0x80000000); /* return +-0 */ in modff()
41 SET_FLOAT_WORD(*iptr,i0&(~i)); in modff()
42 return x - *iptr; in modff()
51 SET_FLOAT_WORD(x,ix&0x80000000); /* return +-0 */ in modff()
H A Ds_exp2f.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
39 P1 = 0x1.62e430p-1f,
40 P2 = 0x1.ebfbe0p-3f,
41 P3 = 0x1.c6b348p-5f,
42 P4 = 0x1.3b2c9cp-7f;
46 twom100 = 0x1p-10
98 uint32_t hx, ix, i0; exp2f() local
[all...]
/freebsd/crypto/openssl/crypto/aes/asm/
H A Daes-mips.pl2 # Copyright 2010-2020 The OpenSSL Project Authors. All Rights Reserved.
21 # Code uses 1K[+256B] S-box and on single-issue core [such as R5000]
22 # spends ~68 cycles per byte processed with 128-bit key. This is ~16%
23 # faster than gcc-generated code, which is not very impressive. But
24 # recall that compressed S-box requires extra processing, namely
33 # ~25% less instructions) code. Note that there is no run-time switch,
34 # instead, code path is chosen upon pre-process time, pass -mips32r2
35 # or/and -msmartmips.
56 # - never ever touch $tp, "thread pointer", former $gp;
57 # - copy return value to $t0, former $v0 [or to $a0 if you're adapting
[all …]
H A Daes-sparcv9.pl2 # Copyright 2005-2021 The OpenSSL Project Authors. All Rights Reserved.
19 # cache-timing attack. This is [currently and initially!] addressed in
20 # two ways. 1. S-boxes are compressed from 5KB to 2KB+256B size each.
30 # extra shifts "induced" by compressed S-box and longer loop epilogue
32 # the code turned out to run in ~23 cycles per processed byte en-/
33 # decrypted with 128-bit key. This is pretty good result for code
36 # while decrypt one - whole 50% faster [yes, Sun C failed to generate
38 # procedures are more than 60% faster:-)
71 $s0="%i0";
77 $rounds="%i7"; # aliases with return address, which is off-loaded to stack
[all …]
/freebsd/crypto/openssh/
H A Dlibcrux_mlkem768_sha3.h37 /* from libcrux/libcrux-ml-kem/cg/eurydice_glue.h */
39 * SPDX-FileCopyrightText: 2024 Eurydice Contributors
40 * SPDX-FileCopyrightText: 2024 Cryspen Sarl <info@cryspen.com>
42 * SPDX-License-Identifier: MIT or Apache-2.0
67 // - if you need to use `ptr`, you MUST cast it to a proper type *before*
71 // - if you need to use `len` for a C style function (e.g. memcpy, memcmp), you
88 (CLITERAL(Eurydice_slice){.ptr = (void *)(x + start), .len = end - start})
136 Eurydice_array_eq(sz, a1, ((a2)->ptr), t, _)
146 .len = slice.len - mid}})
152 Eurydice_slice_to_array3(&(dst)->tag, (char *)&(dst)->val.case_Ok, src, \
[all …]
/freebsd/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-ia64.S2 // Written by Andy Polyakov, @dot-asm, initially for use in the OpenSSL
12 // floating-point instructions' latencies and deliver ~2.6 cpb.
13 // Comparison to compiler-generated code is not exactly fair, because
15 // >3x faster. Originally it was argued that floating-point base 2^32
18 // Itanium 2. But floating-point code would be larger, and have higher
19 // overhead, which would negatively affect small-block performance...
50 { .mmi; st8 [r32]=r0,24 // ctx->h0 = 0
51 st8 [r9]=r0 // ctx->h1 = 0
53 { .mib; st8 [r10]=r0 // ctx->h2 = 0
60 { .mmi; ld1 r16=[r8],4 // load key, little-endian
[all …]
H A Dpoly1305-s390x.pl21 # ~6.6/2.3 cpb on z10/z196+, >2x improvement over compiler-generated
40 # it's sub-cycle, i.e. less than 1 cycle per processed byte, and it's
82 lghi ("%r1",-1);
93 lrvg ("%r2","0($inp)"); # load little-endian key
121 SIZE ("poly1305_init",".-poly1305_init");
152 # non-64-bit ABI
156 &{$z? \&stg:\&st} ($ctx,"2*$SIZE_T($sp)"); # off-load $ctx
163 lrvg ($d0lo,"0($inp)"); # load little-endian input
172 mlgr ($d0hi,$r0); # h0*r0 -> $d0hi:$d0lo
174 mlgr ($d1hi,$s1); # h1*5*r1 -> $d1hi:$d1lo
[all …]
/freebsd/crypto/openssl/crypto/bn/asm/
H A Dx86_64-gf2m.pl2 # Copyright 2011-2020 The OpenSSL Project Authors. All Rights Reserved.
20 # in bn_gf2m.c. It's kind of low-hanging mechanical port from C for
23 # later. Improvement varies from one benchmark and µ-arch to another.
24 # Vanilla code path is at most 20% faster than compiler-generated code
25 # [not very impressive], while PCLMULQDQ - whole 85%-160% better on
26 # 163- and 571-bit ECDH benchmarks on Intel CPUs. Keep in mind that
38 ( $xlate="${dir}x86_64-xlate.pl" and -f $xlate ) or
39 ( $xlate="${dir}../../perlasm/x86_64-xlate.pl" and -f $xlate) or
40 die "can't locate x86_64-xlate.pl";
47 ($i0,$i1)=("%rsi","%rdi");
[all …]
H A Darmv4-gf2m.pl2 # Copyright 2011-2020 The OpenSSL Project Authors. All Rights Reserved.
20 # used in bn_gf2m.c. It's kind of low-hanging mechanical port from
24 # in ~45 cycles on dual-issue core such as Cortex A8, which is ~50%
25 # faster than compiler-generated code. For ECDH and ECDSA verify (but
26 # not for ECDSA sign) it means 25%-45% improvement depending on key
35 # by 18-40%.
49 ( $xlate="${dir}arm-xlate.pl" and -f $xlate ) or
50 ( $xlate="${dir}../../perlasm/arm-xlate.pl" and -f $xlate) or
51 die "can't locate arm-xlate.pl";
78 ($hi,$lo,$t0,$t1, $i0,$i1 )=map("r$_",(4..9),12);
[all …]
/freebsd/lib/libc/gen/
H A Dmodf.c90 int32_t i0,i1,j0; in modf() local
92 EXTRACT_WORDS(i0,i1,x); in modf()
93 j0 = ((i0>>20)&0x7ff)-0x3ff; /* exponent of x */ in modf()
96 INSERT_WORDS(*iptr,i0&0x80000000,0); /* *iptr = +-0 */ in modf()
100 if(((i0&i)|i1)==0) { /* x is integral */ in modf()
104 INSERT_WORDS(x,high&0x80000000,0); /* return +-0 */ in modf()
107 INSERT_WORDS(*iptr,i0&(~i),0); in modf()
108 return x - *iptr; in modf()
119 INSERT_WORDS(x,high&0x80000000,0); /* return +-0 */ in modf()
122 i = ((u_int32_t)(0xffffffff))>>(j0-20); in modf()
[all …]
/freebsd/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_stats_timing.h8 //===----------------------------------------------------------------------===//
12 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
14 //===----------------------------------------------------------------------===//
47 friend tsc_interval_t operator-(const tsc_tick_count &t1,
49 friend tsc_interval_t operator-(const tsc_tick_count::tsc_interval_t &i1,
50 const tsc_tick_count::tsc_interval_t &i0);
52 const tsc_tick_count::tsc_interval_t &i0);
77 friend tsc_tick_count::tsc_interval_t operator-(const tsc_tick_count &t1,
81 inline tsc_tick_count::tsc_interval_t operator-(const tsc_tick_count &t1,
83 return tsc_tick_count::tsc_interval_t(t1.my_count - t0.my_count);
[all …]
/freebsd/sys/powerpc/psim/
H A Dpsim-tree6 # target sim -e chirp -r 33554432 -f psim-tree
9 # (The -r option is the amount of physical RAM the simulator has)
12 /#address-cells 1
13 /openprom/options/use-stdio? false
14 #/openprom/options/strict-alignment? true
17 ./output-device "psim-stdout
37 ./#address-cells 3
38 ./#size-cells 2
44 ./assigned-addresses \
52 i0,0,10,0 8 \
[all …]
/freebsd/lib/msun/ld128/
H A Ds_exp2l.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2005-2008 David Schultz <das@FreeBSD.ORG>
38 #define BIAS (LDBL_MAX_EXP - 1)
43 twom10000 = 0x1p-10000L;
46 P1 = 0x1.62e42fefa39ef35793c7673007e6p-1L,
47 P2 = 0x1.ebfbdff82c58ea86f16b06ec9736p-3L,
48 P3 = 0x1.c6b08d704a0bf8b33a762bad3459p-5L,
49 P4 = 0x1.3b2ab6fba4e7729ccbbe0b4f3fc2p-7L,
50 P5 = 0x1.5d87fe78a67311071dee13fd11d9p-10L,
[all …]
/freebsd/contrib/tcpdump/
H A Dprint-udp.c26 #include "netdissect-stdinc.h"
59 ntp64 sr_ntp; /* 64-bit ntp timestamp */
67 * Time stamps are middle 32-bits of ntp timestamp.
99 ndo->ndo_protocol = "vat"; in vat_print()
112 uint32_t i0, i1; in vat_print() local
118 i0 = GET_BE_U_4(&((const u_int *)hdr)[0]); in vat_print()
121 length - 8, in vat_print()
122 i0 & 0xffff, in vat_print()
123 i1, i0 & 0x800000? "*" : ""); in vat_print()
125 if (i0 & 0x1f0000) in vat_print()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp1 //===- GVNSink.cpp - sink expressions into successors ---------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 /// instruction count and enabling if-conversion.
24 /// results - the VN of an instruction is a function of its opcode and the
34 //===----------------------------------------------------------------------===//
77 #define DEBUG_TYPE "gvn-sink"
96 (isa<InvokeInst>(I) && !cast<InvokeInst>(I)->doesNotAccessMemory()) || in isMemoryInst()
97 (isa<CallInst>(I) && !cast<CallInst>(I)->doesNotAccessMemory()); in isMemoryInst()
101 /// first non-terminator. For example (assume all blocks have size n):
[all …]

1234567