Home
last modified time | relevance | path

Searched full:i (Results 1 – 25 of 7214) sorted by relevance

12345678910>>...289

/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/lua_core/
H A Dtst.nested_neg.zcp20 i = 0
274 i = i + 1
276 i = i + 1
278 i = i + 1
280 i = i + 1
282 i = i + 1
284 i = i + 1
286 i = i + 1
288 i = i + 1
290 i = i + 1
[all …]
/freebsd/sys/contrib/dev/acpica/compiler/
H A Dasltokens.y165 * Most tokens are defined to return <i>, which is a UINT64.
174 %token <i> PARSEOP_ACCESSAS
175 %token <i> PARSEOP_ACCESSATTRIB_BLOCK
176 %token <i> PARSEOP_ACCESSATTRIB_BLOCK_CALL
177 %token <i> PARSEOP_ACCESSATTRIB_BYTE
178 %token <i> PARSEOP_ACCESSATTRIB_BYTES
179 %token <i> PARSEOP_ACCESSATTRIB_QUICK
180 %token <i> PARSEOP_ACCESSATTRIB_RAW_BYTES
181 %token <i> PARSEOP_ACCESSATTRIB_RAW_PROCESS
182 %token <i> PARSEOP_ACCESSATTRIB_SND_RCV
[all …]
/freebsd/contrib/llvm-project/libcxx/src/
H A Dhash.cpp20 // handle all next_prime(i) for i in [1, 210), special case 0
26 // potential primes = 210*k + indices[i], k >= 1
84 // Divide n by all primes or potential primes (i) until:
86 // 2. The i > sqrt(n), in which case n is prime.
101 size_t i = 211;
103 std::size_t q = n / i;
104 if (q < i)
106 if (n == q * i)
109 i
206 size_t i = 211; __next_prime() local
[all...]
/freebsd/lib/libvgl/
H A Dmouse.c50 #define I INTERIOR macro
87 B,I,B,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
88 B,I,I,B,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
89 B,I,I,I,B,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
90 B,I,I,I,I,B,0,0,0,0,0,0,0,0,0,0,0,0,0,
91 B,I,I,I,I,I,B,0,0,0,0,0,0,0,0,0,0,0,0,
92 B,I,I,I,I,I,I,B,0,0,0,0,0,0,0,0,0,0,0,
93 B,I,I,I,I,I,I,I,B,0,0,0,0,0,0,0,0,0,0,
94 B,I,I,I,I,I,I,I,I,B,0,0,0,0,0,0,0,0,0,
95 B,I,I,I,I,I,I,I,I,I,B,0,0,0,0,0,0,0,0,
[all …]
/freebsd/contrib/bc/tests/bc/
H A Dassignments.txt2 return (i++ + x)
5 return (++i + x)
8 return (i *= 2) + x
11 i++
12 i--
13 ++i
14 --i
16 (i++)
17 (i--)
18 (++i)
[all …]
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/funcs/
H A Dtst.substr.d27 #pragma ident "%Z%%M% %I% %E% SMI"
39 int i; variable
45 altstr = "CRAIG: Positioned them, I don't ";
46 altstr2 = "know... I'm fairly wide guy.";
48 command[i].index = 3;
49 command[i].nolen = 1;
50 i++;
52 command[i].index = 300;
53 command[i].nolen = 1;
54 i++;
[all …]
H A Dtst.index.d27 #pragma ident "%Z%%M% %I% %E% SMI"
38 int i; variable
42 command[i].str = "foobarbaz";
43 command[i].substr = "barbaz";
44 i++;
46 command[i].str = "foofoofoo";
47 command[i].substr = "foo";
48 i++;
50 command[i].str = "boofoofoo";
51 command[i].substr = "foo";
[all …]
/freebsd/crypto/openssh/
H A Dsntrup761.c44 long long top,p,q,r,i,j; in crypto_sort_int32() local
52 i = 0; in crypto_sort_int32()
53 while (i + 2 * p <= n) { in crypto_sort_int32()
54 for (j = i;j < i + p;++j) in crypto_sort_int32()
56 i += 2 * p; in crypto_sort_int32()
58 for (j = i;j < n - p;++j) in crypto_sort_int32()
61 i = 0; in crypto_sort_int32()
64 if (j != i) for (;;) { in crypto_sort_int32()
71 if (j == i + p) { in crypto_sort_int32()
72 i += 2 * p; in crypto_sort_int32()
[all …]
/freebsd/contrib/bc/tests/bc/scripts/
H A Dafl1.bc6 auto i
8 for (i = 0; i < hen; ++i) {
9 a[i]
15 auto i
17 for (i = 0; i < len; ++i) {(x)#086$
27 a[i] = a[i] * a[i]
35 auto i
37 for (i = 0; i < len; ++i) {
38 a__[i] = a__[i] * a__[i]
46 auto i
[all …]
/freebsd/contrib/llvm-project/lldb/bindings/
H A Dinterfaces.swig3 %include "stdint.i"
14 %include "./interface/SBAddressDocstrings.i"
15 %include "./interface/SBAddressRangeDocstrings.i"
16 %include "./interface/SBAddressRangeListDocstrings.i"
17 %include "./interface/SBAttachInfoDocstrings.i"
18 %include "./interface/SBBlockDocstrings.i"
19 %include "./interface/SBBreakpointDocstrings.i"
20 %include "./interface/SBBreakpointLocationDocstrings.i"
21 %include "./interface/SBBreakpointNameDocstrings.i"
22 %include "./interface/SBBroadcasterDocstrings.i"
[all …]
/freebsd/share/doc/psd/02.implement/
H A Dfig2.pic44 A: box invis ht .4i wid 1i "Per-User Open" "File Table"
45 B: box ht .25i with .n at A.s
47 D: box ht .25i with .n at C.s
49 move down 1.0625i left 1.25i from PUOFT.D.s
51 A: box invis ht .4i wid 1i "Open File" "Table"
52 B: box ht .25i with .n at A.s
54 D: box ht .25i with .n at C.s
56 move down 1.0625i right 1.25i from PUOFT.D.s
58 A: box invis ht .4i wid 1i "Active I-node" "Table"
59 B: box ht .25i with .n at A.s
[all …]
/freebsd/contrib/wpa/src/crypto/
H A Daes_i.h33 #define RCON(i) rcon[(i)] argument
35 #define TE0(i) Te0[((i) >> 24) & 0xff] argument
36 #define TE1(i) Te1[((i) >> 16) & 0xff] argument
37 #define TE2(i) Te2[((i) >> 8) & 0xff] argument
38 #define TE3(i) Te3[(i) & 0xff] argument
39 #define TE41(i) (Te4[((i) >> 24) & 0xff] & 0xff000000) argument
40 #define TE42(i) (Te4[((i) >> 16) & 0xff] & 0x00ff0000) argument
41 #define TE43(i) (Te4[((i) >> 8) & 0xff] & 0x0000ff00) argument
42 #define TE44(i) (Te4[(i) & 0xff] & 0x000000ff) argument
43 #define TE421(i) (Te4[((i) >> 16) & 0xff] & 0xff000000) argument
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DMultiplexExternalSemaSource.cpp50 for(size_t i = 0; i < Sources.size(); ++i) in GetExternalDecl() local
51 if (Decl *Result = Sources[i]->GetExternalDecl(ID)) in GetExternalDecl()
57 for (size_t i = 0; i < Sources.size(); ++i) in CompleteRedeclChain() local
58 Sources[i]->CompleteRedeclChain(D); in CompleteRedeclChain()
63 for(size_t i = 0; i < Sources.size(); ++i) { in GetExternalSelector() local
64 Sel = Sources[i]->GetExternalSelector(ID); in GetExternalSelector()
73 for(size_t i = 0; i < Sources.size(); ++i) in GetNumExternalSelectors() local
74 total += Sources[i]->GetNumExternalSelectors(); in GetNumExternalSelectors()
79 for(size_t i = 0; i < Sources.size(); ++i) in GetExternalDeclStmt() local
80 if (Stmt *Result = Sources[i]->GetExternalDeclStmt(Offset)) in GetExternalDeclStmt()
[all …]
/freebsd/contrib/bc/manuals/
H A Dbcl.335 \f[I]#include <bcl.h>\f[R]
37 Link with \f[I]\-lbcl\f[R], and on POSIX systems, \f[I]\-lpthread\f[R]
42 \f[B]BclError bcl_start(\f[R]\f[I]void\f[R]\f[B]);\f[R]
44 \f[B]void bcl_end(\f[R]\f[I]void\f[R]\f[B]);\f[R]
46 \f[B]BclError bcl_init(\f[R]\f[I]void\f[R]\f[B]);\f[R]
48 \f[B]void bcl_free(\f[R]\f[I]void\f[R]\f[B]);\f[R]
50 \f[B]bool bcl_abortOnFatalError(\f[R]\f[I]void\f[R]\f[B]);\f[R]
52 \f[B]void bcl_setAbortOnFatalError(bool\f[R] \f[I]abrt\f[R]\f[B]);\f[R]
54 \f[B]bool bcl_leadingZeroes(\f[R]\f[I]voi
[all...]
/freebsd/contrib/nvi/common/
H A Dencoding.c17 #define I 2 /* character appears in ISO-8859 text */ macro
34 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xaX */
35 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xbX */
36 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xcX */
37 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xdX */
38 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xeX */
39 I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I /* 0xfX */
59 size_t i; in looks_utf8() local
63 for (i = 0; i < nbytes; i++) { in looks_utf8()
64 if ((buf[i] & 0x80) == 0) { /* 0xxxxxxx is plain ASCII */ in looks_utf8()
[all …]
/freebsd/tools/tools/ath/ath_ee_9300_print/
H A Dmain.c122 int i; in eeprom_9300_modal_print() local
128 for (i = 0; i < OSPREY_MAX_CHAINS; i++) { in eeprom_9300_modal_print()
130 i, in eeprom_9300_modal_print()
131 m->ant_ctrl_chain[i], in eeprom_9300_modal_print()
132 m->xatten1_db[i], in eeprom_9300_modal_print()
133 m->xatten1_margin[i], in eeprom_9300_modal_print()
134 m->noise_floor_thresh_ch[i]); in eeprom_9300_modal_print()
138 for (i = 0; i < OSPREY_EEPROM_MODAL_SPURS; i++) { in eeprom_9300_modal_print()
139 printf("(%d: %d) ", i, m->spur_chans[i]); in eeprom_9300_modal_print()
187 int i; in eeprom_9300_print_2g_target_cck() local
[all …]
/freebsd/lib/libc/tests/string/
H A Dmemcmp_test.c79 int i; in ATF_TC_BODY() local
81 for (i = 0; i < 256; i++) in ATF_TC_BODY()
82 data1[i] = data2[i] = i ^ 0x55; in ATF_TC_BODY()
83 for (i = 1; i < 256; i++) in ATF_TC_BODY()
84 check_memcmp(data1, data2, i, 0); in ATF_TC_BODY()
85 for (i = 1; i < 256; i++) in ATF_TC_BODY()
86 check_memcmp(data1 + i, data2 + i, 256 - i, 0); in ATF_TC_BODY()
93 int i; in ATF_TC_BODY() local
95 for (i = 0; i < 256; i++) { in ATF_TC_BODY()
96 data1[i] = i; in ATF_TC_BODY()
[all …]
/freebsd/contrib/bc/tests/bc/errors/
H A D34.txt6 auto i
8 for (i = 0; i < hen; ++i) {
9 a[i]
15 auto i
17 for (i = 0; i < len; ++i) {(x)#086$
27 a[i] = a[i] * a[i]
35 auto i
37 for (i = 0; i < len; ++i) {
38 a__[i] = a__[i] * a__[i]
46 auto i
[all …]
/freebsd/sys/powerpc/powerpc/
H A Dintr_machdep.c200 struct powerpc_intr *i; in smp_intr_init() local
204 i = powerpc_intrs[vector]; in smp_intr_init()
205 if (i != NULL && i->event != NULL && i->pic == root_pic) in smp_intr_init()
206 PIC_BIND(i->pic, i->intline, i->pi_cpuset, &i->priv); in smp_intr_init()
228 struct powerpc_intr *i, *iscan; in intr_lookup() local
233 i = powerpc_intrs[vector]; in intr_lookup()
234 if (i != NULL && i->irq == irq) { in intr_lookup()
236 return (i); in intr_lookup()
240 i = malloc(sizeof(*i), M_INTR, M_NOWAIT); in intr_lookup()
241 if (i == NULL) { in intr_lookup()
[all …]
/freebsd/sys/dev/qat/qat_common/
H A Dadf_cfg_instance.c9 int i = 0; in crypto_instance_init() local
12 for (i = 0; i < bundle->num_of_rings / 2; i++) { in crypto_instance_init()
13 if ((bundle->in_use >> bundle->rings[i]->number) & 0x1) in crypto_instance_init()
16 if (bundle->rings[i]->serv_type == ADF_ACCEL_SERV_ASYM && in crypto_instance_init()
17 bundle->rings[i]->mode == TX) { in crypto_instance_init()
18 instance->asym_tx = bundle->rings[i]->number; in crypto_instance_init()
19 bundle->in_use |= 1 << bundle->rings[i]->number; in crypto_instance_init()
24 for (i = 0; i < bundle->num_of_rings / 2; i++) { in crypto_instance_init()
25 if ((bundle->in_use >> bundle->rings[i]->number) & 0x1) in crypto_instance_init()
28 if (bundle->rings[i]->serv_type == ADF_ACCEL_SERV_SYM && in crypto_instance_init()
[all …]
/freebsd/lib/libnv/tests/
H A Dnv_array_tests.cc52 unsigned int i; in ATF_TEST_CASE_BODY() local
61 for (i = 0; i < 16; i++) in ATF_TEST_CASE_BODY()
62 testbool[i] = (i % 2 == 0); in ATF_TEST_CASE_BODY()
73 for (i = 0; i < num_items; i++) in ATF_TEST_CASE_BODY()
74 ATF_REQUIRE_EQ(const_result[i], testbool[i]); in ATF_TEST_CASE_BODY()
79 for (i = 0; i < num_items; i++) in ATF_TEST_CASE_BODY()
80 ATF_REQUIRE_EQ(result[i], testbool[i]); in ATF_TEST_CASE_BODY()
97 unsigned int i; in ATF_TEST_CASE_BODY() local
118 for (i = 0; i < num_items; i++) { in ATF_TEST_CASE_BODY()
119 if (string_arr[i] != NULL) { in ATF_TEST_CASE_BODY()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVInstructionSelector.cpp93 bool select(MachineInstr &I) override;
107 bool selectImpl(MachineInstr &I, CodeGenCoverage &CoverageInfo) const;
112 MachineInstr &I) const;
114 bool selectGlobalValue(Register ResVReg, MachineInstr &I,
118 MachineInstr &I, Register SrcReg,
120 bool selectUnOp(Register ResVReg, const SPIRVType *ResType, MachineInstr &I,
124 MachineInstr &I) const;
127 MachineInstr &I) const;
128 bool selectStore(MachineInstr &I) const;
131 MachineInstr &I) const;
[all …]
/freebsd/crypto/heimdal/lib/roken/
H A Dsnprintf-test.c64 int i; in cmp_with_sprintf_int() local
66 for (i = 0; i < sizeof(int_values) / sizeof(int_values[0]); ++i) { in cmp_with_sprintf_int()
67 tot += try ("%d", int_values[i]); in cmp_with_sprintf_int()
68 tot += try ("%x", int_values[i]); in cmp_with_sprintf_int()
69 tot += try ("%X", int_values[i]); in cmp_with_sprintf_int()
70 tot += try ("%o", int_values[i]); in cmp_with_sprintf_int()
71 tot += try ("%#x", int_values[i]); in cmp_with_sprintf_int()
72 tot += try ("%#X", int_values[i]); in cmp_with_sprintf_int()
73 tot += try ("%#o", int_values[i]); in cmp_with_sprintf_int()
74 tot += try ("%10d", int_values[i]); in cmp_with_sprintf_int()
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_stream/salsa2012/ref/
H A Dstream_salsa2012_ref.c20 unsigned int i; in crypto_stream_salsa2012() local
26 for (i = 0; i < 32; ++i) { in crypto_stream_salsa2012()
27 kcopy[i] = k[i]; in crypto_stream_salsa2012()
29 for (i = 0; i < 8; ++i) { in crypto_stream_salsa2012()
30 in[i] = n[i]; in crypto_stream_salsa2012()
32 for (i = 8; i < 16; ++i) { in crypto_stream_salsa2012()
33 in[i] = 0; in crypto_stream_salsa2012()
38 for (i = 8; i < 16; ++i) { in crypto_stream_salsa2012()
39 u += (unsigned int)in[i]; in crypto_stream_salsa2012()
40 in[i] = u; in crypto_stream_salsa2012()
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_stream/salsa208/ref/
H A Dstream_salsa208_ref.c20 unsigned int i; in crypto_stream_salsa208() local
26 for (i = 0; i < 32; ++i) { in crypto_stream_salsa208()
27 kcopy[i] = k[i]; in crypto_stream_salsa208()
29 for (i = 0; i < 8; ++i) { in crypto_stream_salsa208()
30 in[i] = n[i]; in crypto_stream_salsa208()
32 for (i = 8; i < 16; ++i) { in crypto_stream_salsa208()
33 in[i] = 0; in crypto_stream_salsa208()
38 for (i = 8; i < 16; ++i) { in crypto_stream_salsa208()
39 u += (unsigned int)in[i]; in crypto_stream_salsa208()
40 in[i] = u; in crypto_stream_salsa208()
[all …]

12345678910>>...289