/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 29 private int[] values; field in class:IntList 34 /** whether the values are currently sorted */ 87 values = new int[initialCapacity]; 103 result = (result * 31) + values[i]; 131 if (values[i] != otherList.values[i]) { 150 sb.append(values[i]); 177 return values[n]; 198 values[n] = value; 219 values[siz [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkScalar.cpp | 14 const SkScalar values[], int length) { 17 SkASSERT(values != NULL); 25 // Could use sentinel values to eliminate conditionals, but since the 28 return values[length-1]; 30 return values[0]; 35 return SkScalarInterp(values[right-1], values[right], fract); 13 SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[], const SkScalar values[], int length) argument
|
/external/libffi/testsuite/libffi.call/ |
H A D | float.c | 24 void *values[MAX_ARGS]; local 33 values[0] = &si1; 35 values[1] = &f; 37 values[2] = &d; 39 values[3] = &ld; 52 ffi_call(&cif, FFI_FN(floating), &rint, values);
|
H A D | promotion.c | 21 void *values[MAX_ARGS]; local 33 values[0] = ≻ 34 values[1] = &ss; 35 values[2] = &uc; 36 values[3] = &us; 53 ffi_call(&cif, FFI_FN(promotion), &rint, values);
|
H A D | return_dbl1.c | 18 void *values[MAX_ARGS]; local 26 values[0] = &dbl1; 27 values[1] = &fl2; 28 values[2] = &in3; 29 values[3] = &dbl4; 39 ffi_call(&cif, FFI_FN(return_dbl), &rdbl, values);
|
H A D | return_dbl2.c | 18 void *values[MAX_ARGS]; local 25 values[0] = &dbl1; 26 values[1] = &dbl2; 27 values[2] = &in3; 28 values[3] = &dbl4; 38 ffi_call(&cif, FFI_FN(return_dbl), &rdbl, values);
|
H A D | return_fl2.c | 22 void *values[MAX_ARGS]; local 30 values[0] = &fl1; 31 values[1] = &fl2; 32 values[2] = &fl3; 33 values[3] = &fl4; 43 ffi_call(&cif, FFI_FN(return_fl), &rfl, values);
|
H A D | return_fl3.c | 18 void *values[MAX_ARGS]; local 25 values[0] = &fl1; 26 values[1] = &fl2; 27 values[2] = &in3; 28 values[3] = &fl4; 38 ffi_call(&cif, FFI_FN(return_fl), &rfl, values);
|
H A D | return_dbl.c | 18 void *values[MAX_ARGS]; local 22 values[0] = &dbl; 30 ffi_call(&cif, FFI_FN(return_dbl), &rdbl, values);
|
H A D | return_fl.c | 18 void *values[MAX_ARGS]; local 22 values[0] = &fl; 30 ffi_call(&cif, FFI_FN(return_fl), &rfl, values);
|
H A D | return_ldl.c | 18 void *values[MAX_ARGS]; local 22 values[0] = &ldl; 30 ffi_call(&cif, FFI_FN(return_ldl), &rldl, values);
|
H A D | return_sc.c | 18 void *values[MAX_ARGS]; local 23 values[0] = ≻ 32 ffi_call(&cif, FFI_FN(return_sc), &rint, values);
|
H A D | return_uc.c | 19 void *values[MAX_ARGS]; local 25 values[0] = &uc; 34 ffi_call(&cif, FFI_FN(return_uc), &rint, values);
|
H A D | float3.c | 26 void *values[MAX_ARGS]; local 34 values[0] = &f; 36 values[1] = &d; 38 values[2] = &ld; 50 ffi_call(&cif, FFI_FN(floating_1), &rd, values); 55 values[0] = &ld; 57 values[1] = &d; 59 values[2] = &f; 67 ffi_call(&cif, FFI_FN(floating_2), &rd, values);
|
H A D | return_fl1.c | 18 void *values[MAX_ARGS]; local 23 values[0] = &fl1; 24 values[1] = &fl2; 32 ffi_call(&cif, FFI_FN(return_fl), &rfl, values);
|
H A D | return_ll.c | 18 void *values[MAX_ARGS]; local 23 values[0] = ≪ 31 ffi_call(&cif, FFI_FN(return_ll), &rlonglong, values); 37 ffi_call(&cif, FFI_FN(return_ll), &rlonglong, values);
|
H A D | return_sl.c | 18 void *values[MAX_ARGS]; local 24 values[0] = &l1; 25 values[1] = &l2; 33 ffi_call(&cif, FFI_FN(return_sl), &res, values);
|
H A D | return_ul.c | 18 void *values[MAX_ARGS]; local 24 values[0] = &ul1; 25 values[1] = &ul2; 33 ffi_call(&cif, FFI_FN(return_ul), &res, values);
|
/external/skia/src/core/ |
H A D | SkScalar.cpp | 14 const SkScalar values[], int length) { 17 SkASSERT(values != NULL); 25 // Could use sentinel values to eliminate conditionals, but since the 28 return values[length-1]; 30 return values[0]; 35 return SkScalarInterp(values[right-1], values[right], fract); 13 SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[], const SkScalar values[], int length) argument
|
/external/ceres-solver/internal/ceres/ |
H A D | block_random_access_matrix.h | 79 // MatrixRef m(cell->values, row_stride, col_stride); 88 : values(NULL) { 92 : values(ptr) { 95 double* values; member in struct:ceres::internal::CellInfo 119 // Zero out the values of the array. The structure of the matrix
|
/external/chromium_org/chrome/browser/ui/tabs/ |
H A D | pinned_tab_test_utils.cc | 18 const std::vector<StartupTab>& values) { 20 for (size_t i = 0; i < values.size(); ++i) { 23 result += TabToString(values[i]); 17 TabsToString( const std::vector<StartupTab>& values) argument
|
/external/webrtc/src/system_wrappers/source/ |
H A D | data_log_c_helpers_unittest.c | 71 int values[kTestArrayLen] = {1, 2, 3, 4}; local 72 return WebRtcDataLog_InsertArray_int(kTableName, kColumnName2, values, 81 float values[kTestArrayLen] = {1.0f, 2.0f, 3.0f, 4.0f}; local 82 return WebRtcDataLog_InsertArray_float(kTableName, kColumnName2, values, 91 double values[kTestArrayLen] = {1.0, 2.0, 3.0, 4.0}; local 92 return WebRtcDataLog_InsertArray_double(kTableName, kColumnName2, values, 101 int32_t values[kTestArrayLen] = {1, 2, 3, 4}; local 102 return WebRtcDataLog_InsertArray_int32(kTableName, kColumnName2, values, 111 uint32_t values[kTestArrayLen] = {1, 2, 3, 4}; local 112 return WebRtcDataLog_InsertArray_uint32(kTableName, kColumnName2, values, 121 int64_t values[kTestArrayLen] = {1, 2, 3, 4}; local [all...] |
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkAnimateProperties.h | 18 SK_PROPERTY(values)
|
/external/chromium_org/tools/grit/grit/tool/ |
H A D | transl2tc_unittest.py | 105 values = translations.values() 108 self.failUnless('Ein' in values) 109 self.failUnless('NUMBIRDS Vogeln' in values) 110 self.failUnless('ITEM von COUNT' in values) 111 self.failUnless(values.count('Hallo') == 1) 112 self.failIf('Dass war die alte Version' in values) 113 self.failIf(':' in values) 114 self.failIf('Dokument FILENAME ist entfernt worden' in values) 115 self.failIf('Nicht verwendet' in values) [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | variadic-templates.cpp | 15 int values[sizeof...(T)+1] = { T::value... }; local
|