Home
last modified time | relevance | path

Searched refs:vals (Results 1 – 25 of 162) sorted by relevance

1234567

/external/clang/test/Analysis/
Darray-struct-region.c98 int vals[10]; in testSymbolicInvalidation() local
100 vals[0] = 42; in testSymbolicInvalidation()
101 clang_analyzer_eval(vals[0] == 42); // expected-warning{{TRUE}} in testSymbolicInvalidation()
103 vals[index] = randomInt(); in testSymbolicInvalidation()
104 clang_analyzer_eval(vals[0] == 42); // expected-warning{{UNKNOWN}} in testSymbolicInvalidation()
106 return vals[index]; // no-warning in testSymbolicInvalidation()
110 int vals[10]; in testConcreteInvalidation() local
112 vals[index] = 42; in testConcreteInvalidation()
113 clang_analyzer_eval(vals[index] == 42); // expected-warning{{TRUE}} in testConcreteInvalidation()
114 vals[0] = randomInt(); in testConcreteInvalidation()
[all …]
/external/libunwind/tests/
DGia64-test-nat.c51 typedef void save_func_t (void *funcs, unsigned long *vals);
52 typedef unw_word_t *check_func_t (unw_cursor_t *c, unsigned long *vals);
207 check_static_to_stacked (unw_cursor_t *c, unw_word_t *vals) in check_static_to_stacked() argument
216 vals -= 4; in check_static_to_stacked()
233 (vals[i] & 1) ? '*' : ' ', vals[i]); in check_static_to_stacked()
235 if (vals[i] & 1) in check_static_to_stacked()
244 if (r[i] != vals[i]) in check_static_to_stacked()
246 __FUNCTION__, 4 + i, r[i], vals[i]); in check_static_to_stacked()
249 return vals; in check_static_to_stacked()
253 check_static_to_fr (unw_cursor_t *c, unw_word_t *vals) in check_static_to_fr() argument
[all …]
/external/valgrind/memcheck/tests/linux/
Dbrk.c14 void* vals[10]; in main() local
17 vals[0] = (void*)0; in main()
18 vals[1] = (void*)1; in main()
19 vals[2] = ds - 0x1; // small shrink in main()
20 vals[3] = ds; in main()
21 vals[4] = ds + 0x1000; // small growth in main()
22 vals[5] = ds + 0x40000000; // too-big growth in main()
23 vals[6] = ds + 0x500; // shrink a little, but still above start size in main()
24 vals[7] = ds - 0x1; // shrink below start size in main()
27 vals[8] = EOL; in main()
[all …]
/external/valgrind/none/tests/amd64/
Dsse4-64.c2296 double vals[22]; in test_ROUNDSD_w_immediate_rounding() local
2298 vals[i++] = 0.0; in test_ROUNDSD_w_immediate_rounding()
2299 vals[i++] = -0.0; in test_ROUNDSD_w_immediate_rounding()
2300 vals[i++] = mkPosInf(); in test_ROUNDSD_w_immediate_rounding()
2301 vals[i++] = mkNegInf(); in test_ROUNDSD_w_immediate_rounding()
2302 vals[i++] = mkPosNan(); in test_ROUNDSD_w_immediate_rounding()
2303 vals[i++] = mkNegNan(); in test_ROUNDSD_w_immediate_rounding()
2304 vals[i++] = -1.3; in test_ROUNDSD_w_immediate_rounding()
2305 vals[i++] = -1.1; in test_ROUNDSD_w_immediate_rounding()
2306 vals[i++] = -0.9; in test_ROUNDSD_w_immediate_rounding()
[all …]
/external/iproute2/misc/
Difstat.c256 unsigned long long *vals = n->val; in dump_raw_db() local
264 vals = h1->val; in dump_raw_db()
277 jsonw_uint_field(jw, stats[i], vals[i]); in dump_raw_db()
282 fprintf(fp, "%llu %u ", vals[i], in dump_raw_db()
298 static void format_rate(FILE *fp, const unsigned long long *vals, in format_rate() argument
303 if (vals[i] > giga) in format_rate()
304 fprintf(fp, "%7lluM ", vals[i]/mega); in format_rate()
305 else if (vals[i] > mega) in format_rate()
306 fprintf(fp, "%7lluK ", vals[i]/kilo); in format_rate()
308 fprintf(fp, "%8llu ", vals[i]); in format_rate()
[all …]
/external/swiftshader/third_party/LLVM/test/TableGen/
Dif.td20 // CHECK-NEXT: list<int> vals = [1, 2, 3];
27 // CHECK-NEXT: list<int> vals = [4, 5, 6];
29 class A<list<list<int>> vals> {
30 list<int> first = vals[0];
31 list<int> rest = !if(!empty(!tail(vals)), vals[0], vals[1]);
38 list<int> vals = v;
41 class BB<list<list<int>> vals> : B<!if(!empty(!tail(vals)), vals[0], vals[1])>;
42 class BBB<list<list<int>> vals> : BB<vals>;
DListArgs.td5 list<int> vals = v;
8 class BB<list<list<int>> vals> : B<vals[0]>;
9 class BBB<list<list<int>> vals> : BB<vals>;
DListArgsSimple.td8 class BB<list<int> vals> : B<vals[0]>;
9 class BBB<list<int> vals> : BB<vals>;
/external/v8/tools/mb/
Dmb.py246 vals = self.Lookup()
247 self.ClobberIfNeeded(vals)
248 if vals['type'] == 'gn':
249 return self.RunGNAnalyze(vals)
251 return self.RunGYPAnalyze(vals)
254 vals = self.Lookup()
255 self.ClobberIfNeeded(vals)
256 if vals['type'] == 'gn':
257 return self.RunGNGen(vals)
259 return self.RunGYPGen(vals)
[all …]
/external/eigen/bench/
Dsparse_setter.cpp47 EIGEN_DONT_INLINE Scalar* setinnerrand_eigen(const Coordinates& coords, const Values& vals);
48 EIGEN_DONT_INLINE Scalar* setrand_eigen_dynamic(const Coordinates& coords, const Values& vals);
49 EIGEN_DONT_INLINE Scalar* setrand_eigen_compact(const Coordinates& coords, const Values& vals);
50 EIGEN_DONT_INLINE Scalar* setrand_eigen_sumeq(const Coordinates& coords, const Values& vals);
51 EIGEN_DONT_INLINE Scalar* setrand_eigen_gnu_hash(const Coordinates& coords, const Values& vals);
52 EIGEN_DONT_INLINE Scalar* setrand_eigen_google_dense(const Coordinates& coords, const Values& vals);
53 EIGEN_DONT_INLINE Scalar* setrand_eigen_google_sparse(const Coordinates& coords, const Values& vals…
54 EIGEN_DONT_INLINE Scalar* setrand_scipy(const Coordinates& coords, const Values& vals);
55 EIGEN_DONT_INLINE Scalar* setrand_ublas_mapped(const Coordinates& coords, const Values& vals);
56 EIGEN_DONT_INLINE Scalar* setrand_ublas_coord(const Coordinates& coords, const Values& vals);
[all …]
/external/pdfium/core/fpdfapi/parser/
Dcpdf_object_unittest.cpp430 const bool vals[] = {true, false, false, true, true}; in TEST() local
432 for (size_t i = 0; i < FX_ArraySize(vals); ++i) in TEST()
433 arr->InsertNewAt<CPDF_Boolean>(i, vals[i]); in TEST()
434 for (size_t i = 0; i < FX_ArraySize(vals); ++i) { in TEST()
436 vals[i] ? "true" : "false", // String value. in TEST()
438 vals[i] ? 1 : 0, // Integer value. in TEST()
447 const int vals[] = {10, 0, -345, 2089345456, -1000000000, 567, 93658767}; in TEST() local
449 for (size_t i = 0; i < FX_ArraySize(vals); ++i) in TEST()
450 arr->InsertNewAt<CPDF_Number>(i, vals[i]); in TEST()
451 for (size_t i = 0; i < FX_ArraySize(vals); ++i) { in TEST()
[all …]
/external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/
Dindexing.pass.cpp28 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test_const() argument
30 auto it = vals.begin (); in dyn_test_const()
38 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test() argument
40 auto it = vals.begin (); in dyn_test()
49 void test ( std::initializer_list<T> vals ) { in test() argument
52 dynA d1 ( vals ); in test()
53 dyn_test ( d1, vals ); in test()
54 dyn_test_const ( d1, vals ); in test()
Dat.pass.cpp44 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test_const() argument
46 auto it = vals.begin (); in dyn_test_const()
58 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test() argument
60 auto it = vals.begin (); in dyn_test()
73 void test ( std::initializer_list<T> vals ) { in test() argument
76 dynA d1 ( vals ); in test()
77 dyn_test ( d1, vals ); in test()
78 dyn_test_const ( d1, vals ); in test()
/external/clang/lib/Analysis/
DUninitializedValues.cpp109 SmallVector<ValueVector, 8> vals; member in __anon9b1dcdf70211::CFGBlockValues
119 return vals[block->getBlockID()]; in getValueVector()
143 CFGBlockValues::CFGBlockValues(const CFG &c) : cfg(c), vals(0) {} in CFGBlockValues()
152 vals.resize(n); in computeSetOfDeclarations()
154 vals[i].resize(decls); in computeSetOfDeclarations()
491 CFGBlockValues &vals; member in __anon9b1dcdf70511::TransferFunctions
500 TransferFunctions(CFGBlockValues &vals, const CFG &cfg, in TransferFunctions() argument
504 : vals(vals), cfg(cfg), block(block), ac(ac), in TransferFunctions()
599 Value AtPredExit = vals.getValue(Pred, B, vd); in getUninitUse()
604 vals.getValue(B, nullptr, vd) == Uninitialized) { in getUninitUse()
[all …]
/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteCholesky.h187 …inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const…
218 Map<VectorSx> vals(m_L.valuePtr(), nnz); //values in factorize()
236 m_scale(j) += numext::abs2(vals(k)); in factorize()
238 m_scale(rowIdx[k]) += numext::abs2(vals(k)); in factorize()
256 vals[k] *= (m_scale(j)*m_scale(rowIdx[k])); in factorize()
258 mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag); in factorize()
275 vals[colPtr[j]] += shift; in factorize()
283 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored in factorize()
288 col_vals(col_nnz) = vals[i]; in factorize()
300 Scalar v_j_jk = numext::conj(vals[jk]); in factorize()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/
DX500NameBuilder.java85 ASN1Encodable[] vals = new ASN1Encodable[values.length]; in addMultiValuedRDN() local
87 for (int i = 0; i != vals.length; i++) in addMultiValuedRDN()
89 vals[i] = template.stringToValue(oids[i], values[i]); in addMultiValuedRDN()
92 return addMultiValuedRDN(oids, vals); in addMultiValuedRDN()
134 RDN[] vals = new RDN[rdns.size()]; in build() local
136 for (int i = 0; i != vals.length; i++) in build()
138 vals[i] = (RDN)rdns.elementAt(i); in build()
141 return new X500Name(template, vals); in build()
/external/llvm/test/TableGen/
Dif.td64 // CHECK-NEXT: list<int> vals = [1, 2, 3];
71 // CHECK-NEXT: list<int> vals = [4, 5, 6];
73 class A<list<list<int>> vals> {
74 list<int> first = vals[0];
75 list<int> rest = !if(!empty(!tail(vals)), vals[0], vals[1]);
82 list<int> vals = v;
85 class BB<list<list<int>> vals> : B<!if(!empty(!tail(vals)), vals[0], vals[1])>;
86 class BBB<list<list<int>> vals> : BB<vals>;
DListArgs.td5 list<int> vals = v;
8 class BB<list<list<int>> vals> : B<vals[0]>;
9 class BBB<list<list<int>> vals> : BB<vals>;
DListArgsSimple.td8 class BB<list<int> vals> : B<vals[0]>;
9 class BBB<list<int> vals> : BB<vals>;
/external/autotest/tko/
Dnightly.py96 vals = perf.get_metric_at_point(runs[platform], metric)
97 if vals:
98 platform_scores[platform] = vals
113 vals = perf.get_metric_at_point(test_runs[kernel][platform],
115 if vals:
118 baseline[platform], std = plotgraph.avg_dev(vals)
119 vals = [v/baseline[platform] for v in vals]
121 pdp.setdefault(kernel, []).extend(vals)
131 vals = perf.get_metric_at_point(runs, metric)
133 if vals:
[all …]
/external/python/cpython2/Lib/bsddb/test/
Dtest_associate.py232 vals = secDB.pget('Blues', txn=txn)
233 self.assertEqual(vals, None, vals)
235 vals = secDB.pget('Unknown', txn=txn)
236 self.assertTrue(vals[0] == 99 or vals[0] == '99', vals)
237 vals[1].index('Unknown')
238 vals[1].index('Unnamed')
239 vals[1].index('unknown')
264 vals = self.cur.pget('Unknown', flags=db.DB_LAST)
265 self.assertTrue(vals[1] == 99 or vals[1] == '99', vals)
266 self.assertEqual(vals[0], 'Unknown')
[all …]
/external/skia/tests/
DSkNxTest.cpp19 float vals[4]; in test_Nf() local
20 v.store(vals); in test_Nf()
21 bool ok = close(vals[0], a) && close(vals[1], b) in test_Nf()
25 ok = close(vals[2], c) && close(vals[3], d) in test_Nf()
34 float vals[] = {3, 4, 5, 6}; in test_Nf() local
35 SkNx<N,float> a = SkNx<N,float>::Load(vals), in test_Nf()
83 T vals[8]; in test_Ni() local
84 v.store(vals); in test_Ni()
87 case 8: REPORTER_ASSERT(r, vals[4] == e && vals[5] == f && vals[6] == g && vals[7] == h); in test_Ni()
88 case 4: REPORTER_ASSERT(r, vals[2] == c && vals[3] == d); in test_Ni()
[all …]
/external/pdfium/third_party/freetype/src/cff/
Dcf2intrp.c337 CF2_Fixed vals[14]; in cf2_doFlex() local
343 vals[0] = *curX; in cf2_doFlex()
344 vals[1] = *curY; in cf2_doFlex()
351 vals[i + 2] = vals[i]; in cf2_doFlex()
353 vals[i + 2] += cf2_stack_getReal( opStack, index++ ); in cf2_doFlex()
357 vals[9 + 2] = *curY; in cf2_doFlex()
361 FT_Bool lastIsX = (FT_Bool)( cf2_fixedAbs( vals[10] - *curX ) > in cf2_doFlex()
362 cf2_fixedAbs( vals[11] - *curY ) ); in cf2_doFlex()
368 vals[12] = vals[10] + lastVal; in cf2_doFlex()
369 vals[13] = *curY; in cf2_doFlex()
[all …]
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DTensorInitializer.h33 const InitList& vals) { in run()
35 for (auto v : vals) { in run()
48 const InitList& vals) {
51 for (auto v : vals) {
72 … const typename Initializer<Derived, traits<Derived>::NumDimensions>::InitList& vals) {
74 Initializer<Derived, traits<Derived>::NumDimensions>::run(tensor, &indices, vals);
/external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.cons/
Dalloc.pass.cpp44 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { in test() argument
47 dynA d1 ( vals, alloc ); in test()
48 assert ( d1.size () == vals.size() ); in test()
49 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ())); in test()

1234567