/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/std/containers/sequences/dynarray/dynarray.overview/ |
H A D | indexing.pass.cpp | 29 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 D | capacity.pass.cpp | 37 void test ( std::initializer_list<T> vals ) { 40 dynA d1 ( vals ); 41 dyn_test ( d1, vals.size ());
|
H A D | at.pass.cpp | 44 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 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/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/ |
H A D | X500NameBuilder.java | 47 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/valgrind/none/tests/amd64/ |
H A D | sse4-64.c | 2321 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/skia/tests/ |
H A D | SkNxTest.cpp | 17 T vals[4]; 18 v.store(vals); 19 bool ok = close(vals[0], a) && close(vals[1], b) 23 ok = close(vals[2], c) && close(vals[3], d) 32 T vals[] = {3, 4, 5, 6}; local 33 SkNf<N,T> a = SkNf<N,T>::Load(vals), 87 T vals[8]; 88 v.store(vals); 103 T vals[] = { 1,2,3,4,5,6,7,8 }; local [all...] |
/external/iproute2/misc/ |
H A D | ifstat.c | 220 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 D | huffbuild.c | 129 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 D | bookutil.h | 39 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 D | bookutil.c | 338 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 D | make_residue_books.pl | 80 my($namedata,$dim,$seqp,$vals)=split(',',$1); 87 foreach my$val (split(' ',$vals)){
|
/external/libcxx/test/std/containers/sequences/dynarray/dynarray.cons/ |
H A D | alloc.pass.cpp | 45 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 D | default.pass.cpp | 34 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 D | IncompleteCholesky.h | 127 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 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/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/skia/src/opts/ |
H A D | SkNx_sse.h | 59 static SkNf Load(const float vals[2]) { argument 60 return _mm_castsi128_ps(_mm_loadl_epi64((const __m128i*)vals)); 64 void store(float vals[2]) const { _mm_storel_pi((__m64*)vals, fVec); } 106 static SkNf Load(const double vals[2]) { return _mm_loadu_pd(vals); } argument 109 void store(double vals[2]) const { _mm_storeu_pd(vals, fVec); } 150 static SkNi Load(const int vals[4]) { return _mm_loadu_si128((const __m128i*)vals); } argument 189 Load(const float vals[4]) argument 235 Load(const uint16_t vals[4]) argument 262 Load(const uint16_t vals[8]) argument 299 Load(const uint8_t vals[16]) argument [all...] |
H A D | SkNx_neon.h | 69 static SkNf Load(const float vals[2]) { return vld1_f32(vals); } argument 72 void store(float vals[2]) const { vst1_f32(vals, fVec); } 153 static SkNf Load(const double vals[2]) { return vld1q_f64(vals); } argument 156 void store(double vals[2]) const { vst1q_f64(vals, fVec); } 216 static SkNi Load(const int vals[4]) { return vld1q_s32(vals); } argument 244 Load(const float vals[4]) argument 316 Load(const uint16_t vals[8]) argument 349 Load(const uint8_t vals[16]) argument [all...] |
/external/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 109 SmallVector<ValueVector, 8> vals; member in class:__anon905::CFGBlockValues 119 return vals[block->getBlockID()]; 143 CFGBlockValues::CFGBlockValues(const CFG &c) : cfg(c), vals(0) {} 152 vals.resize(n); 154 vals[i].resize(decls); 491 CFGBlockValues &vals; member in class:__anon908::TransferFunctions 500 TransferFunctions(CFGBlockValues &vals, const CFG &cfg, argument 504 : vals(vals), cfg(cfg), block(block), ac(ac), 599 Value AtPredExit = vals 801 runOnBlock(const CFGBlock *block, const CFG &cfg, AnalysisDeclContext &ac, CFGBlockValues &vals, const ClassifyRefs &classification, llvm::BitVector &wasAnalyzed, UninitVariablesHandler &handler) argument [all...] |
/external/skia/src/animator/ |
H A D | SkDrawMatrix.cpp | 186 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(vals[6]); 194 fMatrix.setPerspY(vals[7]); 195 // fMatrix.setPerspW(vals[ [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/shader/ |
H A D | DefineList.java | 50 String[] vals = new String[defines.size()]; 55 vals[i] = define.getValue(); 60 oc.write(vals, "vals", null); 70 String[] vals = ic.readStringArray("vals", null); 72 defines.put(keys[i], vals[i]);
|
/external/skia/src/core/ |
H A D | SkNx.h | 44 static SkNi Load(const T vals[N]) { argument 45 return SkNi(SkNi<N/2,T>::Load(vals), SkNi<N/2,T>::Load(vals+N/2)); 55 void store(T vals[N]) const { 56 fLo.store(vals); 57 fHi.store(vals+N/2); 98 static SkNf Load(const T vals[N]) { argument 99 return SkNf(SkNf<N/2,T>::Load(vals), SkNf<N/2,T>::Load(vals+N/2)); 106 void store(T vals[ 173 Load(const T vals[1]) argument 211 Load(const T vals[1]) argument [all...] |