| /art/runtime/ |
| D | utf_test.cc | 61 uint32_t pair = 0; in TEST_F() local
64 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
65 EXPECT_EQ(0x24, GetLeadingUtf16Char(pair)); in TEST_F()
66 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
70 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
71 EXPECT_EQ(0xa2, GetLeadingUtf16Char(pair)); in TEST_F()
72 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
76 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
77 EXPECT_EQ(0x20ac, GetLeadingUtf16Char(pair)); in TEST_F()
78 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
[all …]
|
| D | utf.cc | 135 const uint32_t pair = GetUtf16FromUtf8(&utf8); in CompareModifiedUtf8ToUtf16AsCodePointValues() local
138 const uint16_t lhs = GetLeadingUtf16Char(pair); in CompareModifiedUtf8ToUtf16AsCodePointValues()
147 const uint16_t lhs2 = GetTrailingUtf16Char(pair); in CompareModifiedUtf8ToUtf16AsCodePointValues()
|
| D | safe_map.h | 31 typename Allocator = TrackingAllocator<std::pair<const K, V>, kAllocatorTagSafeMap>>
91 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
108 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v)); in Overwrite()
137 Key, T, Compare, TrackingAllocator<std::pair<Key, T>, kTag>> {
|
| D | transaction.cc | 242 typedef std::pair<mirror::Object*, mirror::Object*> ObjectPair; in VisitObjectLogs()
257 for (const ObjectPair& pair : moving_roots) { in VisitObjectLogs() local
258 mirror::Object* old_root = pair.first; in VisitObjectLogs()
259 mirror::Object* new_root = pair.second; in VisitObjectLogs()
270 typedef std::pair<mirror::Array*, mirror::Array*> ArrayPair; in VisitArrayLogs()
284 for (const ArrayPair& pair : moving_roots) { in VisitArrayLogs() local
285 mirror::Array* old_root = pair.first; in VisitArrayLogs()
286 mirror::Array* new_root = pair.second; in VisitArrayLogs()
|
| D | class_reference.h | 28 typedef std::pair<const DexFile*, uint32_t> ClassReference;
|
| D | monitor_test.cc | 38 for (std::pair<std::string, const void*>& pair : *options) { in SetUpRuntimeOptions()
39 if (pair.first.find("-Xmx") == 0) { in SetUpRuntimeOptions()
40 pair.first = "-Xmx4M"; // Smallest we can go. in SetUpRuntimeOptions()
|
| D | parsed_options.h | 38 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
|
| /art/runtime/base/ |
| D | hash_map.h | 31 size_t operator()(const std::pair<Key, Value>& pair) const { in operator()
32 return fn_(pair.first); in operator()
39 bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const { in operator()
43 bool operator()(const std::pair<Key, Value>& a, const Element& element) const { in operator()
53 class Alloc = std::allocator<std::pair<Key, Value>>>
54 class HashMap : public HashSet<std::pair<Key, Value>, EmptyFn, HashMapWrapper<HashFn>,
|
| D | hash_set_test.cc | 203 void MakeEmpty(std::pair<std::string, int>& pair) const { in MakeEmpty()
204 pair.first.clear(); in MakeEmpty()
206 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty()
207 return pair.first.empty(); in IsEmpty()
|
| D | scoped_arena_containers.h | 57 SafeMap<K, V, Comparator, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>;
61 std::unordered_map<K, V, Hash, KeyEqual, ScopedArenaAllocatorAdapter<std::pair<const K, V>>>;
|
| D | mutex.cc | 287 for (const auto& pair : most_common_blocked) { in DumpContention() local
288 if (pair.second > max_tid_count) { in DumpContention()
289 max_tid = pair.first; in DumpContention()
290 max_tid_count = pair.second; in DumpContention()
298 for (const auto& pair : most_common_blocker) { in DumpContention() local
299 if (pair.second > max_tid_count) { in DumpContention()
300 max_tid = pair.first; in DumpContention()
301 max_tid_count = pair.second; in DumpContention()
|
| /art/runtime/gc/space/ |
| D | large_object_space_test.cc | 48 std::vector<std::pair<mirror::Object*, size_t>> requests; in LargeObjectTest()
76 for (const auto& pair : requests) { in LargeObjectTest() local
77 mirror::Object* obj = pair.first; in LargeObjectTest()
81 for (const auto& pair : requests) { in LargeObjectTest() local
82 mirror::Object* obj = pair.first; in LargeObjectTest()
|
| /art/runtime/gc/ |
| D | task_processor_test.cc | 126 std::vector<std::pair<uint64_t, size_t>> orderings; in TEST_F()
133 for (const auto& pair : orderings) { in TEST_F() local
134 auto* task = new TestOrderTask(pair.first, pair.second, &counter); in TEST_F()
|
| /art/test/528-long-hint/ |
| D | info.txt | 2 allocating a wrong register pair.
|
| /art/cmdline/detail/ |
| D | cmdline_parse_argument_detail.h | 63 virtual std::pair<size_t, size_t> GetNumTokens() const = 0;
121 std::pair<const TokenRange*, size_t> FindClosestMatch(TokenRange token_list) const { in FindClosestMatch()
255 std::pair<size_t, size_t> token_range_size_;
274 std::vector<std::pair<const char*, TArg>> value_map_;
477 virtual std::pair<size_t, size_t> GetNumTokens() const { in GetNumTokens()
|
| /art/compiler/optimizing/ |
| D | stack_map_stream.h | 33 void MakeEmpty(std::pair<DexRegisterLocation, size_t>& item) const { in MakeEmpty()
36 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const { in IsEmpty()
|
| /art/test/474-fp-sub-neg/ |
| D | info.txt | 3 A pair (sub, neg) should not be transforemd to (sub) for
|
| /art/test/503-dead-instructions/smali/ |
| D | DeadInstructions.smali | 41 # Give a non-sequential pair for the long argument.
51 # Give one half of a pair.
|
| /art/imgdiag/ |
| D | imgdiag.cc | 522 for (auto pair : art_method_field_dirty_count_sorted) { in DumpImageDiffMap() local
523 off_t offset = pair.second; in DumpImageDiffMap()
524 int count = pair.first; in DumpImageDiffMap()
576 for (auto pair : class_field_dirty_count_sorted) { in DumpImageDiffMap() local
577 off_t offset = pair.second; in DumpImageDiffMap()
578 int count = pair.first; in DumpImageDiffMap()
704 static std::vector<std::pair<V, K>> SortByValueDesc(const std::map<K, V> map) { in SortByValueDesc()
707 std::vector<std::pair<V, K>> value_key_vector; in SortByValueDesc()
|
| /art/compiler/dex/quick/x86/ |
| D | utility_x86.cc | 648 bool pair = r_dest.IsPair(); in LoadBaseIndexedDisp() local
656 } else if (!pair) { in LoadBaseIndexedDisp()
701 if (!pair) { in LoadBaseIndexedDisp()
717 AnnotateDalvikRegAccess(load, (displacement + (pair ? LOWORD_OFFSET : 0)) >> 2, in LoadBaseIndexedDisp()
719 if (pair) { in LoadBaseIndexedDisp()
725 if (!pair) { in LoadBaseIndexedDisp()
797 bool pair = r_src.IsPair(); in StoreBaseIndexedDisp() local
809 } else if (!pair) { in StoreBaseIndexedDisp()
873 if (!pair) { in StoreBaseIndexedDisp()
882 AnnotateDalvikRegAccess(store, (displacement + (pair ? LOWORD_OFFSET : 0)) >> 2, in StoreBaseIndexedDisp()
[all …]
|
| /art/compiler/linker/ |
| D | relative_patcher_test.h | 221 std::pair<bool, uint32_t> FindMethodOffset(MethodReference ref) OVERRIDE { in FindMethodOffset()
224 return std::pair<bool, uint32_t>(false, 0u); in FindMethodOffset()
226 return std::pair<bool, uint32_t>(true, it->second); in FindMethodOffset()
|
| /art/compiler/dex/ |
| D | dataflow_iterator.h | 353 ArenaVector<std::pair<uint16_t, bool>>* const loop_head_stack_;
400 ArenaVector<std::pair<uint16_t, bool>>* const loop_head_stack_;
|
| D | mir_field_info.cc | 85 std::pair<bool, bool> fast_path = compiler_driver->IsFastInstanceField( in Resolve()
134 std::pair<bool, bool> fast_path = compiler_driver->IsFastStaticField( in Resolve()
|
| /art/compiler/utils/arm/ |
| D | assembler_arm_test.h | 160 std::vector<std::pair<Imm, Imm>>& immediates, in RepeatRRiiC()
174 std::vector<std::pair<Imm, Imm>>& immediates, in RepeatTemplatedRRiiC()
191 for (std::pair<Imm, Imm>& pair : immediates) { in RepeatTemplatedRRiiC()
192 Imm i = pair.first; in RepeatTemplatedRRiiC()
193 Imm j = pair.second; in RepeatTemplatedRRiiC()
|
| /art/compiler/linker/arm/ |
| D | relative_patcher_arm_base.h | 57 typedef std::pair<MethodReference, uint32_t> UnprocessedPatch;
|