Searched refs:vals (Results 1 - 25 of 127) sorted by relevance

123456

/external/valgrind/main/memcheck/tests/linux/
H A Dbrk.c14 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 Darray-struct-region.c98 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/containers/sequences/dynarray/dynarray.overview/
H A Dindexing.pass.cpp29 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
31 auto it = vals.begin ();
39 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
41 auto it = vals.begin ();
50 void test ( std::initializer_list<T> vals ) {
53 dynA d1 ( vals );
54 dyn_test ( d1, vals );
55 dyn_test_const ( d1, vals );
H A Dcapacity.pass.cpp37 void test ( std::initializer_list<T> vals ) {
40 dynA d1 ( vals );
41 dyn_test ( d1, vals.size ());
H A Dat.pass.cpp44 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
46 auto it = vals.begin ();
58 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
60 auto it = vals.begin ();
73 void test ( std::initializer_list<T> vals ) {
76 dynA d1 ( vals );
77 dyn_test ( d1, vals );
78 dyn_test_const ( d1, vals );
/external/libunwind/tests/
H A 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) 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/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/
H A DX500NameBuilder.java47 ASN1Encodable[] vals = new ASN1Encodable[values.length];
49 for (int i = 0; i != vals.length; i++)
51 vals[i] = template.stringToValue(oids[i], values[i]);
54 return addMultiValuedRDN(oids, vals);
78 RDN[] vals = new RDN[rdns.size()];
80 for (int i = 0; i != vals.length; i++)
82 vals[i] = (RDN)rdns.elementAt(i);
85 return new X500Name(template, vals);
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
H A Dfloatnum_test.c162 new_setup(Init_Entry *vals, int i) argument
164 flt = yasm_floatnum_create(vals[i].ascii);
165 strcpy(result_msg, vals[i].ascii);
204 Init_Entry *vals = normalized_vals; local
208 new_setup(vals, i);
209 if (new_check_flt(&vals[i]) != 0)
219 Init_Entry *vals = normalized_edgecase_vals; local
223 new_setup(vals, i);
224 if (new_check_flt(&vals[i]) != 0)
246 get_common_setup(Init_Entry *vals, in argument
299 Init_Entry *vals = normalized_vals; local
317 Init_Entry *vals = normalized_edgecase_vals; local
339 Init_Entry *vals = normalized_vals; local
357 Init_Entry *vals = normalized_edgecase_vals; local
379 Init_Entry *vals = normalized_vals; local
397 Init_Entry *vals = normalized_edgecase_vals; local
[all...]
/external/valgrind/main/none/tests/amd64/
H A Dsse4-64.c2321 double vals[22]; local
2323 vals[i++] = 0.0;
2324 vals[i++] = -0.0;
2325 vals[i++] = mkPosInf();
2326 vals[i++] = mkNegInf();
2327 vals[i++] = mkPosNan();
2328 vals[i++] = mkNegNan();
2329 vals[i++] = -1.3;
2330 vals[i++] = -1.1;
2331 vals[
2446 double vals[22]; local
2637 float vals[22]; local
2762 float vals[22]; local
2952 double vals[22]; local
3093 double vals[22]; local
3287 float vals[22]; local
3460 float vals[22]; local
[all...]
/external/iproute2/misc/
H A Difstat.c220 unsigned long long *vals = n->val; local
228 vals = h1->val;
237 fprintf(fp, "%llu %u ", vals[i], (unsigned)rates[i]);
247 void format_rate(FILE *fp, unsigned long long *vals, double *rates, int i) argument
250 if (vals[i] > giga)
251 fprintf(fp, "%7lluM ", vals[i]/mega);
252 else if (vals[i] > mega)
253 fprintf(fp, "%7lluK ", vals[i]/kilo);
255 fprintf(fp, "%8llu ", vals[i]);
267 void format_pair(FILE *fp, unsigned long long *vals, in argument
330 print_one_if(FILE *fp, struct ifstat_ent *n, unsigned long long *vals) argument
400 unsigned long long vals[MAXS]; local
[all...]
/external/libvorbis/vq/
H A Dhuffbuild.c129 long vals=pow(maxval,subn); local
130 long *hist=_ogg_calloc(vals,sizeof(long));
131 long *lengths=_ogg_calloc(vals,sizeof(long));
133 for(j=loval;j<vals;j++)hist[j]=guard;
140 if(val==-1 || val>=vals)break;
148 fprintf(stderr,"Building tree for %ld entries\n",vals);
149 build_tree_from_lengths0(vals,hist,lengths);
166 for(j=0;j<vals;){
168 for(k=0;k<16 && j<vals;k++,j++)
176 fprintf(file,"\t%d, %ld,\n",subn,vals);
[all...]
H A Dbookutil.h39 extern void build_tree_from_lengths(int vals, long *hist, long *lengths);
40 extern void build_tree_from_lengths0(int vals, long *hist, long *lengths);
H A Dbookutil.c338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ argument
340 long *membership=_ogg_malloc(vals*sizeof(long));
341 long *histsave=alloca(vals*sizeof(long));
342 memcpy(histsave,hist,vals*sizeof(long));
344 for(i=0;i<vals;i++)membership[i]=i;
348 for(i=vals;i>1;i--){
355 for(j=0;j<vals;j++)
361 for(j=0;j<vals;j++)
373 for(j=0;j<vals;j++)
380 for(i=0;i<vals
407 build_tree_from_lengths0(int vals, long *hist, long *lengths) argument
445 long vals=(c->maptype==1?_book_maptype1_quantvals(c):c->entries*c->dim); local
[all...]
H A Dmake_residue_books.pl80 my($namedata,$dim,$seqp,$vals)=split(',',$1);
87 foreach my$val (split(' ',$vals)){
/external/libcxx/test/containers/sequences/dynarray/dynarray.cons/
H A Dalloc.pass.cpp45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) { argument
48 dynA d1 ( vals, alloc );
49 assert ( d1.size () == vals.size() );
50 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
H A Ddefault.pass.cpp34 void test ( const std::initializer_list<T> &vals ) {
37 dynA d1 ( vals );
38 assert ( d1.size () == vals.size() );
39 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteCholesky.h127 inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol);
148 Map<ScalarType> vals(m_L.valuePtr(), nnz); //values
151 IndexType firstElt(n-1); // for each j, points to the next entry in vals that will be used in the factorization
165 Scalar mindiag = vals[0];
168 vals[k] /= (m_scal(j) * m_scal(rowIdx[k]));
169 mindiag = (min)(vals[colPtr[j]], mindiag);
175 vals[colPtr[j]] += m_shift;
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored
186 curCol(rowIdx[i]) = vals[i];
197 curCol(rowIdx[i]) -= vals[
241 updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol) argument
[all...]
/external/eigen/bench/
H A 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);
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/smali/util/src/main/java/org/jf/util/
H A DConsoleUtil.java62 String[] vals = output.split(" ");
63 if (vals.length < 2) {
66 return Integer.parseInt(vals[1]);
/external/chromium_org/native_client_sdk/src/examples/tutorial/debugging/
H A 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/clang/lib/Analysis/
H A DUninitializedValues.cpp108 SmallVector<ValueVector, 8> vals; member in class:__anon17785::CFGBlockValues
118 return vals[block->getBlockID()];
142 CFGBlockValues::CFGBlockValues(const CFG &c) : cfg(c), vals(0) {}
151 vals.resize(n);
153 vals[i].resize(decls);
432 CFGBlockValues &vals; member in class:__anon17788::TransferFunctions
441 TransferFunctions(CFGBlockValues &vals, const CFG &cfg, argument
445 : vals(vals), cfg(cfg), block(block), ac(ac),
540 Value AtPredExit = vals
742 runOnBlock(const CFGBlock *block, const CFG &cfg, AnalysisDeclContext &ac, CFGBlockValues &vals, const ClassifyRefs &classification, llvm::BitVector &wasAnalyzed, UninitVariablesHandler &handler) argument
[all...]
/external/chromium_org/third_party/skia/src/animator/
H A DSkDrawMatrix.cpp186 SkScalar* vals = matrix.begin(); local
187 fMatrix.setScaleX(vals[0]);
188 fMatrix.setSkewX(vals[1]);
189 fMatrix.setTranslateX(vals[2]);
190 fMatrix.setSkewY(vals[3]);
191 fMatrix.setScaleY(vals[4]);
192 fMatrix.setTranslateY(vals[5]);
193 fMatrix.setPerspX(SkScalarToPersp(vals[6]));
194 fMatrix.setPerspY(SkScalarToPersp(vals[7]));
195 // fMatrix.setPerspW(SkScalarToPersp(vals[
[all...]
/external/skia/src/animator/
H A DSkDrawMatrix.cpp186 SkScalar* vals = matrix.begin(); local
187 fMatrix.setScaleX(vals[0]);
188 fMatrix.setSkewX(vals[1]);
189 fMatrix.setTranslateX(vals[2]);
190 fMatrix.setSkewY(vals[3]);
191 fMatrix.setScaleY(vals[4]);
192 fMatrix.setTranslateY(vals[5]);
193 fMatrix.setPerspX(SkScalarToPersp(vals[6]));
194 fMatrix.setPerspY(SkScalarToPersp(vals[7]));
195 // fMatrix.setPerspW(SkScalarToPersp(vals[
[all...]
/external/chromium_org/extensions/browser/api/system_cpu/
H A Dcpu_info_provider_linux.cc52 int vals = local
60 if (vals != 5 || pindex >= infos->size()) {
/external/chromium_org/tools/symsrc/
H A Dsource_index.py128 vals = dict((y.split(': ', 2) for y in info.split('\r\n') if y))
130 root = vals['Repository Root']
131 if not vals['URL'].startswith(root):
133 path = vals['URL'][len(root):]
134 rev = int(vals['Revision'])

Completed in 7403 milliseconds

123456