Home
last modified time | relevance | path

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

123456

/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/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
Dfloatnum_test.c162 new_setup(Init_Entry *vals, int i) in new_setup() argument
164 flt = yasm_floatnum_create(vals[i].ascii); in new_setup()
165 strcpy(result_msg, vals[i].ascii); in new_setup()
204 Init_Entry *vals = normalized_vals; in test_new_normalized() local
208 new_setup(vals, i); in test_new_normalized()
209 if (new_check_flt(&vals[i]) != 0) in test_new_normalized()
219 Init_Entry *vals = normalized_edgecase_vals; in test_new_normalized_edgecase() local
223 new_setup(vals, i); in test_new_normalized_edgecase()
224 if (new_check_flt(&vals[i]) != 0) in test_new_normalized_edgecase()
246 get_common_setup(Init_Entry *vals, int i) in get_common_setup() argument
[all …]
/external/valgrind/main/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/main/none/tests/amd64/
Dsse4-64.c2321 double vals[22]; in test_ROUNDSD_w_immediate_rounding() local
2323 vals[i++] = 0.0; in test_ROUNDSD_w_immediate_rounding()
2324 vals[i++] = -0.0; in test_ROUNDSD_w_immediate_rounding()
2325 vals[i++] = mkPosInf(); in test_ROUNDSD_w_immediate_rounding()
2326 vals[i++] = mkNegInf(); in test_ROUNDSD_w_immediate_rounding()
2327 vals[i++] = mkPosNan(); in test_ROUNDSD_w_immediate_rounding()
2328 vals[i++] = mkNegNan(); in test_ROUNDSD_w_immediate_rounding()
2329 vals[i++] = -1.3; in test_ROUNDSD_w_immediate_rounding()
2330 vals[i++] = -1.1; in test_ROUNDSD_w_immediate_rounding()
2331 vals[i++] = -0.9; in test_ROUNDSD_w_immediate_rounding()
[all …]
/external/iproute2/misc/
Difstat.c220 unsigned long long *vals = n->val; in dump_raw_db() local
228 vals = h1->val; in dump_raw_db()
237 fprintf(fp, "%llu %u ", vals[i], (unsigned)rates[i]); in dump_raw_db()
247 void format_rate(FILE *fp, unsigned long long *vals, double *rates, int i) in format_rate() argument
250 if (vals[i] > giga) in format_rate()
251 fprintf(fp, "%7lluM ", vals[i]/mega); in format_rate()
252 else if (vals[i] > mega) in format_rate()
253 fprintf(fp, "%7lluK ", vals[i]/kilo); in format_rate()
255 fprintf(fp, "%8llu ", vals[i]); in format_rate()
267 void format_pair(FILE *fp, unsigned long long *vals, int i, int k) in format_pair() argument
[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/libcxx/test/containers/sequences/dynarray/dynarray.overview/
Dindexing.pass.cpp29 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test_const() argument
31 auto it = vals.begin (); in dyn_test_const()
39 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) { in dyn_test() argument
41 auto it = vals.begin (); in dyn_test()
50 void test ( std::initializer_list<T> vals ) { in test() argument
53 dynA d1 ( vals ); in test()
54 dyn_test ( d1, vals ); in test()
55 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.cpp108 SmallVector<ValueVector, 8> vals; member in __anonfcb5b39c0211::CFGBlockValues
118 return vals[block->getBlockID()]; in getValueVector()
142 CFGBlockValues::CFGBlockValues(const CFG &c) : cfg(c), vals(0) {} in CFGBlockValues()
151 vals.resize(n); in computeSetOfDeclarations()
153 vals[i].resize(decls); in computeSetOfDeclarations()
432 CFGBlockValues &vals; member in __anonfcb5b39c0511::TransferFunctions
441 TransferFunctions(CFGBlockValues &vals, const CFG &cfg, in TransferFunctions() argument
445 : vals(vals), cfg(cfg), block(block), ac(ac), in TransferFunctions()
540 Value AtPredExit = vals.getValue(Pred, B, vd); in getUninitUse()
545 vals.getValue(B, nullptr, vd) == Uninitialized) { in getUninitUse()
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/
DX500NameBuilder.java47 ASN1Encodable[] vals = new ASN1Encodable[values.length]; in addMultiValuedRDN() local
49 for (int i = 0; i != vals.length; i++) in addMultiValuedRDN()
51 vals[i] = template.stringToValue(oids[i], values[i]); in addMultiValuedRDN()
54 return addMultiValuedRDN(oids, vals); in addMultiValuedRDN()
78 RDN[] vals = new RDN[rdns.size()]; in build() local
80 for (int i = 0; i != vals.length; i++) in build()
82 vals[i] = (RDN)rdns.elementAt(i); in build()
85 return new X500Name(template, vals); in build()
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteCholesky.h127 …inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, co…
148 Map<ScalarType> vals(m_L.valuePtr(), nnz); //values in factorize()
165 Scalar mindiag = vals[0]; in factorize()
168 vals[k] /= (m_scal(j) * m_scal(rowIdx[k])); in factorize()
169 mindiag = (min)(vals[colPtr[j]], mindiag); in factorize()
175 vals[colPtr[j]] += m_shift; in factorize()
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored in factorize()
186 curCol(rowIdx[i]) = vals[i]; in factorize()
197 curCol(rowIdx[i]) -= vals[i] * vals[jk] ; in factorize()
199 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol); in factorize()
[all …]
/external/libvorbis/vq/
Dhuffbuild.c129 long vals=pow(maxval,subn); in main() local
130 long *hist=_ogg_calloc(vals,sizeof(long)); in main()
131 long *lengths=_ogg_calloc(vals,sizeof(long)); in main()
133 for(j=loval;j<vals;j++)hist[j]=guard; in main()
140 if(val==-1 || val>=vals)break; in main()
148 fprintf(stderr,"Building tree for %ld entries\n",vals); in main()
149 build_tree_from_lengths0(vals,hist,lengths); in main()
166 for(j=0;j<vals;){ in main()
168 for(k=0;k<16 && j<vals;k++,j++) in main()
176 fprintf(file,"\t%d, %ld,\n",subn,vals); in main()
Dbookutil.c338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ in build_tree_from_lengths() argument
340 long *membership=_ogg_malloc(vals*sizeof(long)); in build_tree_from_lengths()
341 long *histsave=alloca(vals*sizeof(long)); in build_tree_from_lengths()
342 memcpy(histsave,hist,vals*sizeof(long)); in build_tree_from_lengths()
344 for(i=0;i<vals;i++)membership[i]=i; in build_tree_from_lengths()
348 for(i=vals;i>1;i--){ in build_tree_from_lengths()
355 for(j=0;j<vals;j++) in build_tree_from_lengths()
361 for(j=0;j<vals;j++) in build_tree_from_lengths()
373 for(j=0;j<vals;j++) in build_tree_from_lengths()
380 for(i=0;i<vals-1;i++) in build_tree_from_lengths()
[all …]
/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/freetype/src/cff/
Dcf2intrp.c336 CF2_Fixed vals[14]; in cf2_doFlex() local
342 vals[0] = *curX; in cf2_doFlex()
343 vals[1] = *curY; in cf2_doFlex()
350 vals[i + 2] = vals[i]; in cf2_doFlex()
352 vals[i + 2] += cf2_stack_getReal( opStack, index++ ); in cf2_doFlex()
356 vals[9 + 2] = *curY; in cf2_doFlex()
360 FT_Bool lastIsX = (FT_Bool)( cf2_fixedAbs( vals[10] - *curX ) > in cf2_doFlex()
361 cf2_fixedAbs( vals[11] - *curY ) ); in cf2_doFlex()
367 vals[12] = vals[10] + lastVal; in cf2_doFlex()
368 vals[13] = *curY; in cf2_doFlex()
[all …]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/
Dcf2intrp.c336 CF2_Fixed vals[14]; in cf2_doFlex() local
342 vals[0] = *curX; in cf2_doFlex()
343 vals[1] = *curY; in cf2_doFlex()
350 vals[i + 2] = vals[i]; in cf2_doFlex()
352 vals[i + 2] += cf2_stack_getReal( opStack, index++ ); in cf2_doFlex()
356 vals[9 + 2] = *curY; in cf2_doFlex()
360 FT_Bool lastIsX = (FT_Bool)( cf2_fixedAbs( vals[10] - *curX ) > in cf2_doFlex()
361 cf2_fixedAbs( vals[11] - *curY ) ); in cf2_doFlex()
367 vals[12] = vals[10] + lastVal; in cf2_doFlex()
368 vals[13] = *curY; in cf2_doFlex()
[all …]
/external/chromium_org/third_party/freetype/src/cff/
Dcf2intrp.c336 CF2_Fixed vals[14]; in cf2_doFlex() local
342 vals[0] = *curX; in cf2_doFlex()
343 vals[1] = *curY; in cf2_doFlex()
350 vals[i + 2] = vals[i]; in cf2_doFlex()
352 vals[i + 2] += cf2_stack_getReal( opStack, index++ ); in cf2_doFlex()
356 vals[9 + 2] = *curY; in cf2_doFlex()
360 FT_Bool lastIsX = cf2_fixedAbs( vals[10] - *curX ) > in cf2_doFlex()
361 cf2_fixedAbs( vals[11] - *curY ); in cf2_doFlex()
367 vals[12] = vals[10] + lastVal; in cf2_doFlex()
368 vals[13] = *curY; in cf2_doFlex()
[all …]
/external/libcxx/test/containers/sequences/dynarray/dynarray.cons/
Dalloc.pass.cpp45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { in test() argument
48 dynA d1 ( vals, alloc ); in test()
49 assert ( d1.size () == vals.size() ); in test()
50 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ())); in test()
Ddefault.pass.cpp34 void test ( const std::initializer_list<T> &vals ) { in test() argument
37 dynA d1 ( vals ); in test()
38 assert ( d1.size () == vals.size() ); in test()
39 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ())); in test()
/external/chromium_org/native_client_sdk/src/examples/tutorial/debugging/
Dexample.js74 var vals = line.trim().split(/\s+/);
75 if (vals.length != 2) {
81 offs: parseInt(vals[0], 16),
82 name: vals[1],
92 var vals = line.trim().split(/\s+/);
93 fileName = vals[3];
/external/skia/src/animator/
DSkDrawMatrix.cpp186 SkScalar* vals = matrix.begin(); in onEndElement() local
187 fMatrix.setScaleX(vals[0]); in onEndElement()
188 fMatrix.setSkewX(vals[1]); in onEndElement()
189 fMatrix.setTranslateX(vals[2]); in onEndElement()
190 fMatrix.setSkewY(vals[3]); in onEndElement()
191 fMatrix.setScaleY(vals[4]); in onEndElement()
192 fMatrix.setTranslateY(vals[5]); in onEndElement()
193 fMatrix.setPerspX(SkScalarToPersp(vals[6])); in onEndElement()
194 fMatrix.setPerspY(SkScalarToPersp(vals[7])); in onEndElement()
/external/chromium_org/third_party/skia/src/animator/
DSkDrawMatrix.cpp186 SkScalar* vals = matrix.begin(); in onEndElement() local
187 fMatrix.setScaleX(vals[0]); in onEndElement()
188 fMatrix.setSkewX(vals[1]); in onEndElement()
189 fMatrix.setTranslateX(vals[2]); in onEndElement()
190 fMatrix.setSkewY(vals[3]); in onEndElement()
191 fMatrix.setScaleY(vals[4]); in onEndElement()
192 fMatrix.setTranslateY(vals[5]); in onEndElement()
193 fMatrix.setPerspX(SkScalarToPersp(vals[6])); in onEndElement()
194 fMatrix.setPerspY(SkScalarToPersp(vals[7])); in onEndElement()

123456