Home
last modified time | relevance | path

Searched refs:pair (Results 1 – 25 of 79) sorted by relevance

1234

/art/runtime/
Dutf_test.cc62 uint32_t pair = 0; in TEST_F() local
65 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
66 EXPECT_EQ(0x24, GetLeadingUtf16Char(pair)); in TEST_F()
67 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
71 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
72 EXPECT_EQ(0xa2, GetLeadingUtf16Char(pair)); in TEST_F()
73 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
77 pair = GetUtf16FromUtf8(&ptr); in TEST_F()
78 EXPECT_EQ(0x20ac, GetLeadingUtf16Char(pair)); in TEST_F()
79 EXPECT_EQ(0, GetTrailingUtf16Char(pair)); in TEST_F()
[all …]
Djni_env_ext.cc184 std::vector<std::pair<uintptr_t, jobject>>* locked_objects) in RemoveMonitors()
189 [self, frame, monitors](const std::pair<uintptr_t, jobject>& pair) in RemoveMonitors()
191 if (frame == pair.first) { in RemoveMonitors()
192 mirror::Object* o = self->DecodeJObject(pair.second); in RemoveMonitors()
203 std::pair<uintptr_t, jobject> exact_pair = std::make_pair(current_frame, obj); in CheckMonitorRelease()
211 for (std::pair<uintptr_t, jobject>& pair : locked_objects_) { in CheckMonitorRelease()
212 if (self->DecodeJObject(pair.second) == mirror_obj) { in CheckMonitorRelease()
213 std::string monitor_descr = ComputeMonitorDescription(self, pair.second); in CheckMonitorRelease()
238 std::pair<uintptr_t, jobject>& pair = locked_objects_[locked_objects_.size() - 1]; in CheckNoHeldMonitors() local
239 if (pair.first == current_frame) { in CheckNoHeldMonitors()
[all …]
Dtype_lookup_table_test.cc30 using DescriptorClassDefIdxPair = std::pair<const char*, uint32_t>;
47 auto pair = GetParam(); in TEST_P() local
48 const char* descriptor = pair.first; in TEST_P()
51 ASSERT_EQ(pair.second, class_def_idx); in TEST_P()
Dutf.cc184 const uint32_t pair = GetUtf16FromUtf8(&utf8); in ComputeUtf16HashFromModifiedUtf8() local
185 const uint16_t first = GetLeadingUtf16Char(pair); in ComputeUtf16HashFromModifiedUtf8()
188 const uint16_t second = GetTrailingUtf16Char(pair); in ComputeUtf16HashFromModifiedUtf8()
215 const uint32_t pair = GetUtf16FromUtf8(&utf8); in CompareModifiedUtf8ToUtf16AsCodePointValues() local
218 const uint16_t lhs = GetLeadingUtf16Char(pair); in CompareModifiedUtf8ToUtf16AsCodePointValues()
227 const uint16_t lhs2 = GetTrailingUtf16Char(pair); in CompareModifiedUtf8ToUtf16AsCodePointValues()
Ddex_file_verifier.h185 void MakeEmpty(std::pair<uint32_t, uint16_t>& pair) const { in MakeEmpty()
186 pair.first = 0u; in MakeEmpty()
189 bool IsEmpty(const std::pair<uint32_t, uint16_t>& pair) const { in IsEmpty()
190 return pair.first == 0; in IsEmpty()
Dsafe_map.h32 typename Allocator = TrackingAllocator<std::pair<const K, V>, kAllocatorTagSafeMap>>
92 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
97 std::pair<iterator, bool> result = map_.emplace(k, std::move(v)); in Put()
120 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v)); in Overwrite()
162 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
Dclass_reference.h28 typedef std::pair<const DexFile*, uint32_t> ClassReference;
Dtransaction.cc242 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()
Dmonitor_test.cc38 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()
/art/runtime/base/
Dhash_map.h31 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>,
60 using Base = HashSet<std::pair<Key, Value>,
Dhash_set_test.cc261 void MakeEmpty(std::pair<std::string, int>& pair) const { in MakeEmpty()
262 pair.first.clear(); in MakeEmpty()
264 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty()
265 return pair.first.empty(); in IsEmpty()
Dallocator.h161 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>>;
172 Key, T, Hash, Pred, TrackingAllocator<std::pair<const Key, T>, kTag>>;
181 Key, T, EmptyFn, Hash, Pred, TrackingAllocator<std::pair<Key, T>, kTag>>;
Darena_containers.h61 SafeMap<K, V, Comparator, ArenaAllocatorAdapter<std::pair<const K, V>>>;
71 typename EmptyFn = DefaultEmptyFn<std::pair<Key, Value>>,
79 ArenaAllocatorAdapter<std::pair<Key, Value>>>;
/art/compiler/linker/
Dmulti_oat_relative_patcher.cc62 std::pair<bool, uint32_t> MultiOatRelativePatcher::MethodOffsetMap::FindMethodOffset( in FindMethodOffset()
66 return std::pair<bool, uint32_t>(false, 0u); in FindMethodOffset()
68 return std::pair<bool, uint32_t>(true, it->second); in FindMethodOffset()
/art/runtime/gc/space/
Dlarge_object_space_test.cc48 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/lambda/
Dbox_table.h105 void MakeEmpty(std::pair<UnorderedMapKeyType, ValueType>& item) const
108 bool IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const;
128 TrackingAllocator<std::pair<ClosureType, ValueType>,
Dbox_table.cc66 std::pair<UnorderedMapKeyType, ValueType>& key_value_pair = *map_iterator; in ~BoxTable()
199 const std::pair<UnorderedMapKeyType, ValueType>& key_value_pair = *map_iterator; in FindBoxedLambda()
229 std::pair<UnorderedMapKeyType, ValueType>& key_value_pair = *map_iterator; in SweepWeakBoxedLambdas()
285 void BoxTable::EmptyFn::MakeEmpty(std::pair<UnorderedMapKeyType, ValueType>& item) const { in MakeEmpty()
292 bool BoxTable::EmptyFn::IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const { in IsEmpty()
/art/runtime/gc/
Dtask_processor_test.cc125 std::vector<std::pair<uint64_t, size_t>> orderings; in TEST_F()
132 for (const auto& pair : orderings) { in TEST_F() local
133 auto* task = new TestOrderTask(pair.first, pair.second, &counter); in TEST_F()
/art/test/526-long-regalloc/
Dinfo.txt2 pair under certain circumstances.
/art/test/528-long-hint/
Dinfo.txt2 allocating a wrong register pair.
/art/test/550-checker-regression-wide-store/
Dinfo.txt1 Test an SsaBuilder regression where storing into the high vreg of a pair
/art/cmdline/detail/
Dcmdline_parse_argument_detail.h63 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/test/474-fp-sub-neg/
Dinfo.txt3 A pair (sub, neg) should not be transforemd to (sub) for
/art/runtime/verifier/
Dregister_line.h401 for (auto& pair : reg_to_lock_depths_) { in ClearRegToLockDepth()
402 if ((pair.second & mask) != 0) { in ClearRegToLockDepth()
403 VLOG(verifier) << "Also unlocking " << pair.first; in ClearRegToLockDepth()
404 pair.second ^= mask; in ClearRegToLockDepth()
/art/test/503-dead-instructions/smali/
DDeadInstructions.smali41 # Give a non-sequential pair for the long argument.
51 # Give one half of a pair.

1234