Home
last modified time | relevance | path

Searched defs:leaf1 (Results 1 – 10 of 10) sorted by relevance

/external/libabigail/tests/data/test-diff-suppr/
Dtest36-leaf-v1.cc4 struct leaf1 struct
8 }; // end struct leaf1 argument
Dtest36-leaf-v0.cc4 struct leaf1 struct
7 }; // end struct leaf1 argument
/external/cpuinfo/src/x86/
Dinit.c29 const struct cpuid_regs leaf1 = cpuid(1); in cpuinfo_x86_init_processor() local
Dtopology.c20 struct cpuid_regs leaf1, in cpuinfo_x86_detect_topology()
/external/grpc-grpc-java/context/src/test/java/io/grpc/
DPersistentHashArrayMappedTrieTest.java175 Leaf<Key, Object> leaf1 = new Leaf<Key, Object>(key1, value1); in compressedIndex_combine_differentIndexBit() local
206 Leaf<Key, Object> leaf1 = new Leaf<Key, Object>(key1, value1); in compressedIndex_combine_sameIndexBit() local
/external/dagger2/javatests/dagger/functional/producers/cancellation/
DCancellationModule.java59 ListenableFuture<String> produceFoo(@Named("leaf1") String leaf1, @Named("leaf2") String leaf2) { in produceFoo()
/external/angle/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree_test.cc907 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
922 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
1482 CordRepBtree* leaf1 = CordRepBtree::Create(flats[0]); in TEST() local
1501 CordRepBtree* leaf1 = CordRepBtree::Create(flat); in TEST() local
1515 CordRepBtree* leaf1 = CreateTree(flats); in TEST() local
/external/abseil-cpp/absl/strings/internal/
Dcord_rep_btree_test.cc906 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
921 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
/external/webrtc/third_party/abseil-cpp/absl/strings/internal/
Dcord_rep_btree_test.cc906 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
921 CordRepBtree* leaf1 = tree->Edges()[1]->btree(); in TEST_P() local
/external/skia/tests/
DPictureTest.cpp946 sk_sp<SkPicture> leaf1 = make_pic(1, nullptr); in DEF_TEST() local