Searched defs:vals (Results 1 - 25 of 66) sorted by relevance

123

/external/valgrind/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/libcxx/test/std/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 ()));
/external/skia/tests/
H A DSkNxTest.cpp17 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...]
H A DDrawPathTest.cpp193 const SkScalar vals[] = { 27734, 35660, 2157846850.0f, 247 }; local
194 SkAutoTUnref<SkDashPathEffect> dontAssert(SkDashPathEffect::Create(vals, 4, -248.135982067f));
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/
H A DConfigurator.java228 private static Object[] inflateParams(Context ctx, Class[] params, String[] vals) throws NoSuchMethodException, argument
234 out[i] = param.getMethod("valueOf", String.class).invoke(null, vals[i].toUpperCase());
236 out[i] = parseFloatAttr(ctx, vals[i]);
238 out[i] = parseIntAttr(ctx, vals[i]);
240 out[i] = Boolean.valueOf(vals[i]);
242 out[i] = parseStringAttr(ctx, vals[i]);
/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.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...]
/external/llvm/include/llvm/Support/
H A DFormat.h93 format_object(const char *fmt, const Ts &... vals) argument
94 : format_object_base(fmt), Vals(vals...) {}
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dapi_params.c1169 VGint vals[4]; local
1170 vals[0] = FLT_TO_INT(values[0]);
1171 vals[1] = FLT_TO_INT(values[1]);
1172 vals[2] = FLT_TO_INT(values[2]);
1173 vals[3] = FLT_TO_INT(values[3]);
1174 paint_set_linear_gradienti(paint, vals);
1186 VGint vals[5]; local
1187 vals[0] = FLT_TO_INT(values[0]);
1188 vals[1] = FLT_TO_INT(values[1]);
1189 vals[
1264 VGfloat *vals = 0; local
1283 VGfloat vals[4]; local
1298 VGfloat vals[5]; local
[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(vals[6]);
194 fMatrix.setPerspY(vals[7]);
195 // fMatrix.setPerspW(vals[
[all...]
/external/boringssl/src/crypto/bn/
H A Dctx.c71 BIGNUM vals[BN_CTX_POOL_SIZE]; member in struct:bignum_pool_item
244 BIGNUM *bn = p->head->vals;
268 bn = item->vals;
287 return item->vals;
296 return p->current->vals + ((p->used++) % BN_CTX_POOL_SIZE);
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSValBuilder.h212 NonLoc makeCompoundVal(QualType type, llvm::ImmutableList<SVal> vals) { argument
213 return nonloc::CompoundVal(BasicVals.getCompoundValData(type, vals));
/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/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/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/libvorbis/lib/
H A Dblock.c388 float **vorbis_analysis_buffer(vorbis_dsp_state *v, int vals){ argument
401 if(v->pcm_current+vals>=v->pcm_storage){
402 v->pcm_storage=v->pcm_current+vals*2;
459 int vorbis_analysis_wrote(vorbis_dsp_state *v, int vals){ argument
463 if(vals<=0){
506 if(v->pcm_current+vals>v->pcm_storage)
509 v->pcm_current+=vals;
H A Dsharedbook.c164 long vals=floor(pow((float)b->entries,1.f/b->dim)); local
168 means that vals really is the greatest value of dim for which
169 vals^b->bim <= b->entries */
176 acc*=vals;
177 acc1*=vals+1;
180 return(vals);
183 vals--;
185 vals++;
/external/skia/gm/
H A Ddashing.cpp167 SkScalar vals[SK_ARRAY_COUNT(gIntervals)]; // more than enough local
170 vals[i] = SkIntToScalar(*intervals++);
172 SkScalar phase = vals[0] / 2;
173 paint.setPathEffect(SkDashPathEffect::Create(vals, count, phase))->unref();
/external/skia/src/opts/
H A DSkNx_neon.h69 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...]
H A DSkNx_sse.h59 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...]
/external/clang/test/SemaTemplate/
H A Dinstantiate-member-template.cpp125 template<typename T> void f(X0<T>& vals) { g(vals); } argument
126 template<typename T> void g(X0<T>& vals) { } argument
/external/eigen/Eigen/src/PaStiXSupport/
H A DPaStiXSupport.h59 void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, float *vals, int *perm, int * invp, float *x, int nbrhs, int *iparm, double *dparm) argument
61 if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; }
63 s_pastix(pastix_data, pastix_comm, n, ptr, idx, vals, perm, invp, x, nbrhs, iparm, dparm);
66 void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, double *vals, int *perm, int * invp, double *x, int nbrhs, int *iparm, double *dparm) argument
68 if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; }
70 d_pastix(pastix_data, pastix_comm, n, ptr, idx, vals, perm, invp, x, nbrhs, iparm, dparm);
73 void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, std::complex<float> *vals, int *perm, int * invp, std::complex<float> *x, int nbrhs, int *iparm, double *dparm) argument
75 if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; }
77 c_pastix(pastix_data, pastix_comm, n, ptr, idx, reinterpret_cast<COMPLEX*>(vals), perm, invp, reinterpret_cast<COMPLEX*>(x), nbrhs, iparm, dparm);
80 void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, std::complex<double> *vals, in argument
[all...]
/external/flac/libFLAC/
H A Dbitreader.c711 FLAC__bool FLAC__bitreader_read_rice_signed_block(FLAC__BitReader *br, int vals[], unsigned nvals, unsigned parameter) argument
728 val = vals;
729 end = vals + nvals;
H A Dbitwriter.c381 inline FLAC__bool FLAC__bitwriter_write_byte_block(FLAC__BitWriter *bw, const FLAC__byte vals[], unsigned nvals) argument
387 if(!FLAC__bitwriter_write_raw_uint32(bw, (FLAC__uint32)(vals[i]), 8))
506 FLAC__bool FLAC__bitwriter_write_rice_signed_block(FLAC__BitWriter *bw, const FLAC__int32 *vals, unsigned nvals, unsigned parameter) argument
523 uval = (*vals<<1) ^ (*vals>>31);
591 vals++;
843 extern FLAC__bool FLAC__bitwriter_write_byte_block(FLAC__BitWriter *bw, const FLAC__byte vals[], unsigned nvals);
/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...]

Completed in 1135 milliseconds

123