| /external/protobuf/gtest/samples/ |
| sample8_unittest.cc | 85 using ::testing::Values;
149 // or bind them to a list of values which will be used as test parameters.
155 // meaningful values for tests. We choose a small value (1), and a value that
161 Combine(Bool(), Values(1, 10)));
|
| /external/v8/testing/gtest/samples/ |
| sample8_unittest.cc | 85 using ::testing::Values;
149 // or bind them to a list of values which will be used as test parameters.
155 // meaningful values for tests. We choose a small value (1), and a value that
161 Combine(Bool(), Values(1, 10)));
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample8_unittest.cc | 85 using ::testing::Values;
149 // or bind them to a list of values which will be used as test parameters.
155 // meaningful values for tests. We choose a small value (1), and a value that
161 Combine(Bool(), Values(1, 10)));
|
| /packages/apps/Dialer/java/com/android/voicemail/impl/ |
| OmtpEvents.java | 118 public @interface Values {}
144 @Type.Values
|
| /prebuilts/ndk/r11/sources/third_party/googletest/googletest/samples/ |
| sample8_unittest.cc | 85 using ::testing::Values;
149 // or bind them to a list of values which will be used as test parameters.
155 // meaningful values for tests. We choose a small value (1), and a value that
161 Combine(Bool(), Values(1, 10)));
|
| /prebuilts/ndk/r13/sources/third_party/googletest/googletest/samples/ |
| sample8_unittest.cc | 85 using ::testing::Values;
149 // or bind them to a list of values which will be used as test parameters.
155 // meaningful values for tests. We choose a small value (1), and a value that
161 Combine(Bool(), Values(1, 10)));
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| multi-level-substitution.cpp | 3 template<typename T, T ...Values> struct value_tuple {};
21 template<T ...Values>
22 void f(value_tuple<T, Values...> * = 0);
53 template<unsigned ...Values> struct unsigned_tuple { };
219 template<Types ...Values> // expected-error{{a non-type template parameter cannot have type 'float'}} \
222 typedef tuple<value_c<Types, Values>...> type;
|
| /external/libvpx/libvpx/test/ |
| fdct4x4_test.cc | 390 ::testing::Values(
396 ::testing::Values(make_tuple(&vpx_fdct4x4_c,
404 ::testing::Values(
420 ::testing::Values(
430 ::testing::Values(
436 ::testing::Values(make_tuple(&vp9_fwht4x4_c,
443 ::testing::Values(make_tuple(&vpx_fdct4x4_neon,
449 ::testing::Values(
460 ::testing::Values(
467 ::testing::Values(make_tuple(&vpx_fdct4x4_sse2
[all...] |
| variance_test.cc | 394 EXPECT_EQ(0u, var) << "src values: " << i << " ref values: " << j;
679 // Src: Set the first half of values to 0, the second half to the maximum.
680 // Ref: Set the first half of values to the maximum, the second half to 0.
770 ::testing::Values(vpx_get_mb_ss_c));
774 ::testing::Values(SseParams(2, 2,
779 ::testing::Values(MseParams(4, 4, &vpx_mse16x16_c),
787 ::testing::Values(VarianceParams(6, 6, &vpx_variance64x64_c),
803 ::testing::Values(make_tuple(6, 6, &vpx_sub_pixel_variance64x64_c, 0),
819 ::testing::Values(make_tuple(6, 6, &vpx_sub_pixel_avg_variance64x64_c, 0)
[all...] |
| /external/clang/lib/CodeGen/ |
| CGObjCMac.cpp | 102 /// The messenger used when the return value is returned in two values on the
787 /// flavors of ownership semantics, values will be taken from
6800 llvm::Constant *values[] = { fn, GetMethodVarName(selector) }; local
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 41 DIEs.Values.push_back(new (Allocator) HashDataContents(die, Flags));
78 std::stable_sort(EI->second.Values.begin(), EI->second.Values.end(), compareDIEs);
79 EI->second.Values.erase(
80 std::unique(EI->second.Values.begin(), EI->second.Values.end()),
81 EI->second.Values.end());
221 Asm->EmitInt32((*HI)->Data.Values.size());
222 for (HashDataContents *HD : (*HI)->Data.Values) {
272 for (HashDataContents *HD : EI->second.Values)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| schedule.go | 60 // Schedule the Values in each Block. After this phase returns, the
61 // order of b.Values matters and is the order in which those values
67 // by values that have not been scheduled yet.
76 // scheduling order. We queue values in this list in reverse order.
79 // maps mem values to the next live memory value
86 for _, v := range b.Values {
139 for _, v := range b.Values {
154 for _, v := range b.Values {
183 // Schedule values dependent on the control value at the end
[all...] |
| flagalloc.go | 8 // instructions. Flag values are recomputed if they need to be
18 // Walk values backwards to figure out what flag
25 for j := len(b.Values) - 1; j >= 0; j-- {
26 v := b.Values[j]
66 oldSched = append(oldSched[:0], b.Values...)
67 b.Values = b.Values[:0]
101 b.Values = append(b.Values, v)
|
| deadcode.go | 7 // findlive returns the reachable blocks and live values in f.
39 // liveValues returns the live values in f.
44 // After regalloc, consider all values to be live.
53 // Find all live values
54 var q []*Value // stack-like worklist of unscanned values
56 // Starting set: all control values of reachable blocks are live.
66 for _, v := range b.Values {
79 // Compute transitive closure of live values.
142 // Find live values.
152 values := f.NamedValues[name
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| schedule.go | 60 // Schedule the Values in each Block. After this phase returns, the
61 // order of b.Values matters and is the order in which those values
67 // by values that have not been scheduled yet.
76 // scheduling order. We queue values in this list in reverse order.
79 // maps mem values to the next live memory value
86 for _, v := range b.Values {
139 for _, v := range b.Values {
154 for _, v := range b.Values {
183 // Schedule values dependent on the control value at the end
[all...] |
| flagalloc.go | 8 // instructions. Flag values are recomputed if they need to be
18 // Walk values backwards to figure out what flag
25 for j := len(b.Values) - 1; j >= 0; j-- {
26 v := b.Values[j]
66 oldSched = append(oldSched[:0], b.Values...)
67 b.Values = b.Values[:0]
101 b.Values = append(b.Values, v)
|
| deadcode.go | 7 // findlive returns the reachable blocks and live values in f.
39 // liveValues returns the live values in f.
44 // After regalloc, consider all values to be live.
53 // Find all live values
54 var q []*Value // stack-like worklist of unscanned values
56 // Starting set: all control values of reachable blocks are live.
66 for _, v := range b.Values {
79 // Compute transitive closure of live values.
142 // Find live values.
152 values := f.NamedValues[name
[all...] |
| /external/llvm/tools/verify-uselistorder/ |
| verify-uselistorder.cpp | 85 std::vector<const Value *> Values;
90 /// un-referencable values.
96 /// All constants that are referenced by other values are included in the
245 Values.push_back(V);
246 IDs[V] = Values.size();
251 dbgs() << "value-mapping (size = " << VM.Values.size() << "):\n";
252 for (unsigned I = 0, E = VM.Values.size(); I != E; ++I) {
254 VM.Values[I]->dump();
259 const Value *V = M.Values[I];
282 dbgs() << " - fail: map size: " << L.Values.size(
[all...] |
| /cts/tests/tests/nativemedia/aaudio/src/ |
| test_aaudio_stream_builder.cpp | 121 ::testing::Values(
122 // Commonly used values
125 // Odd values
149 ::testing::Values(
150 // Reasonable values
152 // Odd values
182 ::testing::Values(
183 // Reasonable values
185 // Odd values
209 ::testing::Values(
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/AsmPrinter/ |
| DIE.cpp | 119 Values.insert(Values.begin(), DI);
159 Values[i]->print(O);
327 for (unsigned i = 0, N = Values.size(); i < N; ++i)
328 Size += Values[i]->SizeOf(AP, AbbrevData[i].getForm());
346 for (unsigned i = 0, N = Values.size(); i < N; ++i)
347 Values[i]->EmitValue(Asm, AbbrevData[i].getForm());
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Sockets/SetSockOpt/ |
| SetSockOpt.c | 181 int Values;
199 Values = sscanf ( pValue, "%d", Value.i32 );
200 if ( 1 == Values ) {
207 Values = sscanf ( pValue, "%d.%d",
210 if (( 2 == Values )
|
| /external/llvm/lib/ExecutionEngine/Interpreter/ |
| Interpreter.h | 70 std::map<Value *, GenericValue> Values; // LLVM values used in this invocation
71 std::vector<GenericValue> VarArgs; // Values passed through an ellipsis
78 Caller(O.Caller), Values(std::move(O.Values)),
86 Values = std::move(O.Values);
|
| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 1 //===-- ValueEnumerator.cpp - Number values and types for bitcode writer --===//
165 // Global values are processed in reverse order.
237 // Aside from function order, the order of values doesn't matter much here.
315 unsigned FirstConstant = Values.size();
404 OptimizeConstants(FirstConstant, Values.size());
494 std::stable_sort(Values.begin() + CstStart, Values.begin() + CstEnd,
507 std::stable_partition(Values.begin() + CstStart, Values.begin() + CstEnd,
512 ValueMap[Values[CstStart].first] = CstStart+1
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| CodeExtractor.cpp | 48 typedef SetVector<Value*> Values;
74 /// These values must be passed in as live-ins to the function.
85 void findInputsOutputs(Values &inputs, Values &outputs);
87 Function *constructFunction(const Values &inputs,
88 const Values &outputs,
97 Values &inputs,
98 Values &outputs);
129 // containing PHI nodes merging values from outside of the region, and a
131 // incoming values from inside of the region
[all...] |
| /build/soong/bpfix/bpfix/ |
| bpfix.go | 110 for _, item := range items.Values {
112 for _, removal := range removals.Values {
123 items.Values[writeIndex] = item
127 items.Values = items.Values[:writeIndex]
170 if len(val.Values) == 0 {
|
