| /external/wpa_supplicant_8/src/crypto/ |
| D | milenage.c | 89 u8 *res, u8 *ck, u8 *ik, u8 *ak, u8 *akstar) in milenage_f2345() argument
133 if (ik) { in milenage_f2345()
138 if (aes_128_encrypt_block(k, tmp1, ik)) in milenage_f2345()
141 ik[i] ^= opc[i]; in milenage_f2345()
174 const u8 *sqn, const u8 *_rand, u8 *autn, u8 *ik, in milenage_generate() argument
185 milenage_f2345(opc, k, _rand, res, ck, ik, ak, NULL)) { in milenage_generate()
237 u8 res[8], ck[16], ik[16]; in gsm_milenage() local
240 if (milenage_f2345(opc, k, _rand, res, ck, ik, NULL, NULL)) in gsm_milenage()
244 kc[i] = ck[i] ^ ck[i + 8] ^ ik[i] ^ ik[i + 8]; in gsm_milenage()
271 const u8 *autn, u8 *ik, u8 *ck, u8 *res, size_t *res_len, in milenage_check() argument
[all …]
|
| D | milenage.h | 13 const u8 *sqn, const u8 *_rand, u8 *autn, u8 *ik,
20 const u8 *autn, u8 *ik, u8 *ck, u8 *res, size_t *res_len,
25 u8 *res, u8 *ck, u8 *ik, u8 *ak, u8 *akstar);
|
| /external/llvm-project/clang/test/CodeGen/ |
| D | unsigned-overflow.c | 6 unsigned int ii, ij, ik; variable
78 ii = ij + ik; in testintadd()
90 ii = ij - ik; in testintsub()
102 ii = ij * ik; in testintmul()
|
| /external/clang/test/CodeGen/ |
| D | unsigned-overflow.c | 6 unsigned int ii, ij, ik; variable
78 ii = ij + ik; in testintadd()
90 ii = ij - ik; in testintsub()
102 ii = ij * ik; in testintmul()
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
121 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
121 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | default.pass.cpp | 82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
83 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
121 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
122 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| D | default.pass.cpp | 82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
83 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
121 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
122 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
121 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | default.pass.cpp | 82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
83 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
121 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
122 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| D | default.pass.cpp | 82 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
83 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
121 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
122 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
120 char ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test2() local
121 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test2()
122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
| /external/pffft/ |
| D | fftpack.c | 89 integer i, j, k, l, jc, lc, ik, idj, idl, inc, idp; in passfb() local
155 for (ik = 1; ik <= idl1; ++ik) { in passfb()
156 c2_ref(ik, l) = ch2_ref(ik, 1) + wa[idl - 1] * ch2_ref(ik, 2); in passfb()
157 c2_ref(ik, lc) = fsign*wa[idl] * ch2_ref(ik, ip); in passfb()
169 for (ik = 1; ik <= idl1; ++ik) { in passfb()
170 c2_ref(ik, l) = c2_ref(ik, l) + war * ch2_ref(ik, j); in passfb()
171 c2_ref(ik, lc) = c2_ref(ik, lc) + fsign*wai * ch2_ref(ik, jc); in passfb()
176 for (ik = 1; ik <= idl1; ++ik) { in passfb()
177 ch2_ref(ik, 1) = ch2_ref(ik, 1) + ch2_ref(ik, j); in passfb()
182 for (ik = 2; ik <= idl1; ik += 2) { in passfb()
[all …]
|
| /external/speex/libspeexdsp/ |
| D | smallft.c | 277 int idij,ipph,i,j,k,l,ic,ik,is; in dradfg() local
295 for(ik=0;ik<idl1;ik++)ch2[ik]=c2[ik]; in dradfg()
393 for(ik=0;ik<idl1;ik++)c2[ik]=ch2[ik]; in dradfg()
426 for(ik=0;ik<idl1;ik++){ in dradfg()
427 ch2[t4++]=c2[ik]+ar1*c2[t7++]; in dradfg()
450 for(ik=0;ik<idl1;ik++){ in dradfg()
461 for(ik=0;ik<idl1;ik++)ch2[ik]+=c2[t2++]; in dradfg()
845 int idij,ipph,i,j,k,l,ik,is,t0,t1,t2,t3,t4,t5,t6,t7,t8,t9,t10, in dradbg() local
998 for(ik=0;ik<idl1;ik++){ in dradbg()
1019 for(ik=0;ik<idl1;ik++){ in dradbg()
[all …]
|
| /external/llvm-project/flang/lib/Frontend/ |
| D | CompilerInvocation.cpp | 140 InputKind ik = dashX; in ParseFrontendArgs() local
141 if (ik.IsUnknown()) { in ParseFrontendArgs()
142 ik = FrontendOptions::GetInputKindForExtension( in ParseFrontendArgs()
144 if (ik.IsUnknown()) in ParseFrontendArgs()
145 ik = Language::Unknown; in ParseFrontendArgs()
147 dashX = ik; in ParseFrontendArgs()
150 opts.inputs_.emplace_back(std::move(inputs[i]), ik); in ParseFrontendArgs()
|
| /external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| D | make_default_searcher.pass.cpp | 66 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
67 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| D | make_default_searcher.pass.cpp | 66 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
67 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| D | default.pass.cpp | 81 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
82 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
| /external/llvm-project/flang/test/Semantics/ |
| D | structconst02.f90 | 11 type :: scalar(ik,rk,zk,ck,lk,len)
12 integer, kind :: ik = 4, rk = 4, zk = 4, ck = 1, lk = 1 component
14 integer(kind=ik) :: ix = 0
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Diag.pbtxt | 17 `output[i1,..., ik, i1,..., ik] = diagonal[i1, ..., ik]` and 0 everywhere else.
|
| D | api_def_DiagPart.pbtxt | 23 `diagonal[i1,..., ik] = input[i1, ..., ik, i1,..., ik]`.
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search.pass.cpp | 94 int ik[] = {0, 0, 0, 0, 1, 1, 1, 1, 0, 0}; in test() local
95 const unsigned sk = sizeof(ik)/sizeof(ik[0]); in test()
96 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6)); in test()
|