HomeSort by relevance Sort by last modified time
    Searched refs:vals (Results 1 - 25 of 182) sorted by null

1 2 3 4 5 6 7 8

  /external/valgrind/main/memcheck/tests/linux/
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[8] = ds - 0x1000; // shrink a lot below start size (into text
    [all...]
  /external/clang/test/Analysis/
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[0] = randomInt()
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/
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 );
capacity.pass.cpp 37 void test ( std::initializer_list<T> vals ) {
40 dynA d1 ( vals );
41 dyn_test ( d1, vals.size ());
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 );
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/
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 );
capacity.pass.cpp 37 void test ( std::initializer_list<T> vals ) {
40 dynA d1 ( vals );
41 dyn_test ( d1, vals.size ());
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/
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)
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;
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_transformer.py 29 vals = {}
30 exec c in vals
31 assert vals['a'] == 1
32 assert vals['b'] == 2
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
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/
X500NameBuilder.java 47 ASN1Encodable[] vals = new ASN1Encodable[values.length]; local
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()]; local
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/
floatnum_test.c 162 new_setup(Init_Entry *vals, int i)
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, int i
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/
sse4-64.c 2321 double vals[22]; local
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/
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)
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, int i, int k
400 unsigned long long vals[MAXS]; local
    [all...]
  /frameworks/av/media/libeffects/loudness/common/core/
byte_swapper.h 123 const T *SwapBytes(const T *vals, unsigned int num_items, bool force_swap) {
126 T *writeable_vals = const_cast<T *>(vals);
128 writeable_vals[i] = ByteSwapper<T, sizeof(T)>::Swap(vals[i]);
132 return vals;
136 return vals;
138 T *writeable_vals = const_cast<T *>(vals);
140 writeable_vals[i] = ByteSwapper<T, sizeof(T)>::Swap(vals[i]);
  /external/libvorbis/vq/
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...]
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);
  /external/libcxx/test/containers/sequences/dynarray/dynarray.cons/
alloc.pass.cpp 45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) {
48 dynA d1 ( vals, alloc );
49 assert ( d1.size () == vals.size() );
50 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
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 ()));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.cons/
alloc.pass.cpp 45 void test ( const std::initializer_list<T> &vals, const Allocator &alloc ) {
48 dynA d1 ( vals, alloc );
49 assert ( d1.size () == vals.size() );
50 assert ( std::equal ( vals.begin (), vals.end (), d1.begin (), d1.end ()));
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/
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[i] * vals[jk]
    [all...]
  /external/eigen/bench/
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);
    [all...]
  /external/smali/util/src/main/java/org/jf/util/
ConsoleUtil.java 62 String[] vals = output.split(" "); local
63 if (vals.length < 2) {
66 return Integer.parseInt(vals[1]);

Completed in 417 milliseconds

1 2 3 4 5 6 7 8