/external/valgrind/memcheck/tests/linux/ |
H A D | brk.c | 14 void* vals[10]; local 17 vals[0] = (void*)0; 18 vals[1] = (void*)1; 19 vals[2] = ds - 0x1; // small shrink 20 vals[3] = ds; 21 vals[4] = ds + 0x1000; // small growth 22 vals[5] = ds + 0x40000000; // too-big growth 23 vals[6] = ds + 0x500; // shrink a little, but still above start size 24 vals[7] = ds - 0x1; // shrink below start size 25 // vals[ [all...] |
/external/clang/test/Analysis/ |
H A D | array-struct-region.c | 98 int vals[10]; local 100 vals[0] = 42; 101 clang_analyzer_eval(vals[0] == 42); // expected-warning{{TRUE}} 103 vals[index] = randomInt(); 104 clang_analyzer_eval(vals[0] == 42); // expected-warning{{UNKNOWN}} 106 return vals[index]; // no-warning 110 int vals[10]; local 112 vals[index] = 42; 113 clang_analyzer_eval(vals[index] == 42); // expected-warning{{TRUE}} 114 vals[ 128 S vals[10]; local 140 S vals[10]; local 156 SS vals; local 171 SS vals; local 198 SS vals; local 214 SS vals[4]; local 239 SS vals[4]; local 326 SS vals; local 347 SS vals[4]; local [all...] |
/external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
H A D | indexing.pass.cpp | 36 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) { 38 auto it = vals.begin (); 46 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) { 48 auto it = vals.begin (); 57 void test ( std::initializer_list<T> vals ) { 60 dynA d1 ( vals ); 61 dyn_test ( d1, vals ); 62 dyn_test_const ( d1, vals );
|
H A D | at.pass.cpp | 46 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) { 48 auto it = vals.begin (); 60 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) { 62 auto it = vals.begin (); 75 void test ( std::initializer_list<T> vals ) { 78 dynA d1 ( vals ); 79 dyn_test ( d1, vals ); 80 dyn_test_const ( d1, vals );
|
H A D | capacity.pass.cpp | 38 void test ( std::initializer_list<T> vals ) { 41 dynA d1 ( vals ); 42 dyn_test ( d1, vals.size ());
|
/external/libunwind/tests/ |
H A D | Gia64-test-nat.c | 51 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) argument 216 vals -= 4; 233 (vals[i] & 1) ? '*' : ' ', vals[i]); 235 if (vals[i] & 1) 244 if (r[i] != vals[i]) 246 __FUNCTION__, 4 + i, r[i], vals[i]); 249 return vals; 253 check_static_to_fr(unw_cursor_t *c, unw_word_t *vals) argument 290 check_static_to_br(unw_cursor_t *c, unw_word_t *vals) argument 326 check_static_to_mem(unw_cursor_t *c, unw_word_t *vals) argument 362 check_static_to_memN(unw_cursor_t *c, unw_word_t *vals, const char *func) argument 398 check_static_to_mem2(unw_cursor_t *c, unw_word_t *vals) argument 404 check_static_to_mem3(unw_cursor_t *c, unw_word_t *vals) argument 410 check_static_to_mem4(unw_cursor_t *c, unw_word_t *vals) argument 416 check_static_to_mem5(unw_cursor_t *c, unw_word_t *vals) argument 422 check_static_to_scratch(unw_cursor_t *c, unw_word_t *vals) argument 501 check_pr(unw_cursor_t *c, unw_word_t *vals) argument 539 check_rotate_regs(unw_cursor_t *c, unw_word_t *vals) argument 547 start_checks(void *funcs, unsigned long *vals) argument [all...] |
/external/python/cpython2/Lib/test/ |
H A D | test_transformer.py | 29 vals = {} 30 exec c in vals 31 assert vals['a'] == 1 32 assert vals['b'] == 2
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/ |
H A D | X500NameBuilder.java | 85 ASN1Encodable[] vals = new ASN1Encodable[values.length]; 87 for (int i = 0; i != vals.length; i++) 89 vals[i] = template.stringToValue(oids[i], values[i]); 92 return addMultiValuedRDN(oids, vals); 134 RDN[] vals = new RDN[rdns.size()]; 136 for (int i = 0; i != vals.length; i++) 138 vals[i] = (RDN)rdns.elementAt(i); 141 return new X500Name(template, vals);
|
/external/lzma/CPP/7zip/UI/Common/ |
H A D | SortUtils.cpp | 21 unsigned *vals = &indices[0];
local 23 vals[i] = i;
|
/external/valgrind/none/tests/amd64/ |
H A D | sse4-64.c | 2296 double vals[22]; local 2298 vals[i++] = 0.0; 2299 vals[i++] = -0.0; 2300 vals[i++] = mkPosInf(); 2301 vals[i++] = mkNegInf(); 2302 vals[i++] = mkPosNan(); 2303 vals[i++] = mkNegNan(); 2304 vals[i++] = -1.3; 2305 vals[i++] = -1.1; 2306 vals[ 2421 double vals[22]; local 2612 float vals[22]; local 2737 float vals[22]; local 2927 double vals[22]; local 3068 double vals[22]; local 3262 float vals[22]; local 3435 float vals[22]; local [all...] |
/external/tensorflow/tensorflow/python/kernel_tests/ |
H A D | dense_update_ops_no_tsan_test.py | 57 vals = p.eval() 59 self.assertTrue((vals >= ones).all()) 60 self.assertTrue((vals <= ones * 20).all()) 84 vals = p.eval() 87 self.assertTrue((vals > 0).all()) 88 self.assertTrue((vals <= 20).all()) 117 vals = p.eval() 119 self.assertAllEqual(vals, ones * 20) 145 vals = p.eval() 148 self.assertTrue(vals[ [all...] |
/external/fio/tools/hist/ |
H A D | half-bins.py | 17 vals = line.split(', ') 18 sys.stdout.write("%s, %s, %s, " % tuple(vals[:3])) 20 hist = list(map(int, vals[3:]))
|
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
H A D | TensorInitializer.h | 33 const InitList& vals) { 35 for (auto v : vals) { 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); 31 run(TensorEvaluator<Derived, DefaultDevice>& tensor, Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices, const InitList& vals) argument 46 run(TensorEvaluator<Derived, DefaultDevice>& tensor, Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices, const InitList& vals) argument 71 initialize_tensor(TensorEvaluator<Derived, DefaultDevice>& tensor, const typename Initializer<Derived, traits<Derived>::NumDimensions>::InitList& vals) argument
|
/external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.cons/ |
H A D | alloc.pass.cpp | 44 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { argument 47 dynA d1 ( vals, alloc ); 48 assert ( d1.size () == vals.size() ); 49 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
|
H A D | default.pass.cpp | 43 void testInitList( const std::initializer_list<T> &vals ) { 46 dynA d1 ( vals ); 47 assert ( d1.size () == vals.size() ); 48 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
|
/external/tensorflow/tensorflow/core/util/sparse/ |
H A D | sparse_tensor_test.cc | 96 Tensor vals(DT_STRING, TensorShape({N})); 98 EXPECT_DEATH(SparseTensor(ix, vals, TensorShape({10, 10, 10}), {0, 1, 2}), 106 Tensor vals(DT_STRING, TensorShape({N})); 108 EXPECT_DEATH(SparseTensor(ix, vals, TensorShape({10, 10, 10}), {0, 1, 2}), 116 Tensor vals(DT_STRING, TensorShape({N, 1})); 118 EXPECT_DEATH(SparseTensor(ix, vals, TensorShape({10, 10, 10}), {0, 1, 2}), 119 "vals must be a vec"); 126 Tensor vals(DT_STRING, TensorShape({N - 1})); 128 EXPECT_DEATH(SparseTensor(ix, vals, TensorShape({10, 10, 10}), {0, 1, 2}), 136 Tensor vals(DT_STRIN [all...] |
/external/eigen/bench/ |
H A D | sparse_setter.cpp | 47 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); 194 setinnerrand_eigen(const Coordinates& coords, const Values& vals) argument 208 setrand_eigen_dynamic(const Coordinates& coords, const Values& vals) argument 222 setrand_eigen_sumeq(const Coordinates& coords, const Values& vals) argument 241 setrand_eigen_compact(const Coordinates& coords, const Values& vals) argument 255 setrand_eigen_gnu_hash(const Coordinates& coords, const Values& vals) argument 271 setrand_eigen_google_dense(const Coordinates& coords, const Values& vals) argument 284 setrand_eigen_google_sparse(const Coordinates& coords, const Values& vals) argument 405 setrand_scipy(const Coordinates& coords, const Values& vals) argument 425 setrand_ublas_mapped(const Coordinates& coords, const Values& vals) argument 464 setrand_ublas_genvec(const Coordinates& coords, const Values& vals) argument [all...] |
/external/iproute2/misc/ |
H A D | ifstat.c | 322 unsigned long long *vals = n->val; local 332 vals = h1->val; 345 jsonw_uint_field(jw, stats[i], vals[i]); 350 fprintf(fp, "%llu %u ", vals[i], 368 static void format_rate(FILE *fp, const unsigned long long *vals, argument 373 if (vals[i] > giga) 374 fprintf(fp, "%7lluM ", vals[i]/mega); 375 else if (vals[i] > mega) 376 fprintf(fp, "%7lluK ", vals[i]/kilo); 378 fprintf(fp, "%8llu ", vals[ 390 format_pair(FILE *fp, const unsigned long long *vals, int i, int k) argument 454 print_one_json(json_writer_t *jw, const struct ifstat_ent *n, const unsigned long long *vals) argument 468 print_one_if(FILE *fp, const struct ifstat_ent *n, const unsigned long long *vals) argument 562 unsigned long long vals[MAXS]; local [all...] |
/external/v8/tools/mb/ |
H A D | mb.py | 246 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/smali/util/src/main/java/org/jf/util/ |
H A D | ConsoleUtil.java | 62 String[] vals = output.split(" "); 63 if (vals.length < 2) { 66 return Integer.parseInt(vals[1]);
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | IncompleteCholesky.h | 187 inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol); 218 Map<VectorSx> vals(m_L.valuePtr(), nnz); //values 221 VectorIx firstElt(n-1); // for each j, points to the next entry in vals that will be used in the factorization 236 m_scale(j) += numext::abs2(vals(k)); 238 m_scale(rowIdx[k]) += numext::abs2(vals(k)); 256 vals[k] *= (m_scale(j)*m_scale(rowIdx[k])); 258 mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag); 275 vals[colPtr[j]] += shift; 283 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored 288 col_vals(col_nnz) = vals[ 379 updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol) argument [all...] |
/external/python/cpython2/Lib/bsddb/test/ |
H A D | test_associate.py | 232 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[ [all...] |
/external/pdfium/core/fpdfapi/parser/ |
H A D | cpdf_object_unittest.cpp | 434 const bool vals[] = {true, false, false, true, true}; local 436 for (size_t i = 0; i < FX_ArraySize(vals); ++i) 437 arr->InsertNewAt<CPDF_Boolean>(i, vals[i]); 438 for (size_t i = 0; i < FX_ArraySize(vals); ++i) { 440 vals[i] ? "true" : "false", // String value. 442 vals[i] ? 1 : 0, // Integer value. 451 const int vals[] = {10, 0, -345, 2089345456, -1000000000, 567, 93658767}; local 453 for (size_t i = 0; i < FX_ArraySize(vals); ++i) 454 arr->InsertNewAt<CPDF_Number>(i, vals[i]); 455 for (size_t i = 0; i < FX_ArraySize(vals); 469 const float vals[] = {0.0f, 0, 10, 10.0f, 0.0345f, local 489 const char* const vals[] = {"this", "adsde$%^", "\\r\\t", "\\"012", local 534 CPDF_Array* vals[3]; local 556 CPDF_Dictionary* vals[3]; local 581 CPDF_Dictionary* vals[3]; local 677 float vals[] = {1.0f, -1.0f, 0, 0.456734f, local 689 int vals[] = {0, 1, 934435456, 876, 10000, -1, -24354656, -100}; local 700 static constexpr const char* vals[] = { local [all...] |
/external/tensorflow/tensorflow/core/framework/ |
H A D | tensor_shape.cc | 37 gtl::InlinedVector<int64, 8>* vals) { 39 vals->push_back(dim.size); 267 gtl::InlinedVector<int64, 8> vals; 268 AppendTo(*this, &vals); 269 vals.push_back(size); 273 bool can_be_rep32 = (vals.size() <= 3); 275 for (size_t i = 0; i < vals.size(); i++) { 276 if (vals[i] >= kMaxRep32) { 284 for (size_t d = 0; d < vals.size(); d++) { 285 as32()->dims_[d] = kIsPartial && vals[ 36 AppendTo(const TensorShapeBase<Shape>& s, gtl::InlinedVector<int64, 8>* vals) argument [all...] |
/external/tensorflow/tensorflow/core/kernels/ |
H A D | sparse_concat_op.cc | 52 OpInputList vals; variable 53 OP_REQUIRES_OK(context, context->input_list("values", &vals)); 54 OP_REQUIRES(context, vals.size() == N, 56 vals.size())); 58 OP_REQUIRES(context, TensorShapeUtils::IsVector(vals[i].shape()), 61 vals[i].shape().DebugString(), " at position ", i)); 128 tensor::DeepCopy(vals[i]), current_shape,
|