/external/google-breakpad/src/processor/ |
D | contained_range_map_unittest.cc | 61 ASSERT_TRUE (crm.StoreRange(10, 10, 1)); in RunTests() 62 ASSERT_FALSE(crm.StoreRange(10, 10, 2)); // exactly equal to 1 in RunTests() 63 ASSERT_FALSE(crm.StoreRange(11, 10, 3)); // begins inside 1 and extends up in RunTests() 64 ASSERT_FALSE(crm.StoreRange( 9, 10, 4)); // begins below 1 and ends inside in RunTests() 65 ASSERT_TRUE (crm.StoreRange(11, 9, 5)); // contained by existing in RunTests() 66 ASSERT_TRUE (crm.StoreRange(12, 7, 6)); in RunTests() 67 ASSERT_TRUE (crm.StoreRange( 9, 12, 7)); // contains existing in RunTests() 68 ASSERT_TRUE (crm.StoreRange( 9, 13, 8)); in RunTests() 69 ASSERT_TRUE (crm.StoreRange( 8, 14, 9)); in RunTests() 70 ASSERT_TRUE (crm.StoreRange(30, 3, 10)); in RunTests() [all …]
|
D | static_contained_range_map_unittest.cc | 178 ASSERT_TRUE (crm_map_.StoreRange(10, 10, 1)); in SetUp() 179 ASSERT_FALSE(crm_map_.StoreRange(10, 10, 2)); // exactly equal to 1 in SetUp() 180 ASSERT_FALSE(crm_map_.StoreRange(11, 10, 3)); // begins inside 1 and extends up in SetUp() 181 ASSERT_FALSE(crm_map_.StoreRange( 9, 10, 4)); // begins below 1 and ends inside in SetUp() 182 ASSERT_TRUE (crm_map_.StoreRange(11, 9, 5)); // contained by existing in SetUp() 183 ASSERT_TRUE (crm_map_.StoreRange(12, 7, 6)); in SetUp() 184 ASSERT_TRUE (crm_map_.StoreRange( 9, 12, 7)); // contains existing in SetUp() 185 ASSERT_TRUE (crm_map_.StoreRange( 9, 13, 8)); in SetUp() 186 ASSERT_TRUE (crm_map_.StoreRange( 8, 14, 9)); in SetUp() 187 ASSERT_TRUE (crm_map_.StoreRange(30, 3, 10)); in SetUp() [all …]
|
D | range_map_truncate_upper_unittest.cc | 75 EXPECT_TRUE(range_map.StoreRange(0 /* base address */, 100 /* size */, in TEST() 80 EXPECT_FALSE(range_map.StoreRange(0 /* base address */, 100 /* size */, in TEST() 91 EXPECT_TRUE(range_map.StoreRange(0 /* base address */, 100 /* size */, in TEST() 95 EXPECT_TRUE(range_map.StoreRange(10 /* base address */, 80 /* size */, in TEST() 128 EXPECT_TRUE(range_map.StoreRange(10 /* base address */, 80 /* size */, in TEST() 132 EXPECT_TRUE(range_map.StoreRange(0 /* base address */, 100 /* size */, in TEST() 163 EXPECT_TRUE(range_map.StoreRange(0 /* base address */, 100 /* size */, in TEST() 168 EXPECT_TRUE(range_map.StoreRange(90 /* base address */, 110 /* size */, in TEST() 196 EXPECT_TRUE(range_map.StoreRange(50 /* base address */, 50 /* size */, in TEST() 201 EXPECT_TRUE(range_map.StoreRange(0 /* base address */, 70 /* size */, in TEST() [all …]
|
D | range_map_truncate_lower_unittest.cc | 71 range_map.StoreRange(0 /* base address */, 100 /* size */, object_1)); in TEST() 76 range_map.StoreRange(0 /* base address */, 100 /* size */, object_2)); in TEST() 87 range_map.StoreRange(0 /* base address */, 100 /* size */, object_1)); in TEST() 91 range_map.StoreRange(10 /* base address */, 80 /* size */, object_2)); in TEST() 124 range_map.StoreRange(10 /* base address */, 80 /* size */, object_1)); in TEST() 128 range_map.StoreRange(0 /* base address */, 100 /* size */, object_2)); in TEST() 159 range_map.StoreRange(0 /* base address */, 100 /* size */, object_1)); in TEST() 164 range_map.StoreRange(90 /* base address */, 110 /* size */, object_2)); in TEST() 191 range_map.StoreRange(50 /* base address */, 50 /* size */, object_1)); in TEST() 196 range_map.StoreRange(0 /* base address */, 70 /* size */, object_2)); in TEST() [all …]
|
D | map_serializers_unittest.cc | 240 range_map_.StoreRange(1, 10, 6); in TEST_F() 261 ASSERT_TRUE(range_map_.StoreRange(2, 4, 1)); in TEST_F() 262 ASSERT_TRUE(range_map_.StoreRange(6, 4, 2)); in TEST_F() 263 ASSERT_TRUE(range_map_.StoreRange(10, 11, 3)); in TEST_F() 322 crm_map_.StoreRange(3, 7, -1); in TEST_F() 365 ASSERT_TRUE(crm_map_.StoreRange(2, 7, -1)); in TEST_F() 367 ASSERT_TRUE(crm_map_.StoreRange(10, 11, -1)); in TEST_F() 369 ASSERT_TRUE(crm_map_.StoreRange(3, 2, -1)); in TEST_F() 371 ASSERT_TRUE(crm_map_.StoreRange(6, 2, -1)); in TEST_F() 373 ASSERT_TRUE(crm_map_.StoreRange(16, 5, -1)); in TEST_F()
|
D | contained_range_map-inl.h | 57 bool ContainedRangeMap<AddressType, EntryType>::StoreRange( in StoreRange() function 95 return iterator_base->second->StoreRange(base, size, entry); in StoreRange()
|
D | basic_source_line_resolver.cc | 185 functions_.StoreRange(cur_func->address, cur_func->size, cur_func); in LoadMapFromMemory() 214 cur_func->lines.StoreRange(line->address, line->size, in LoadMapFromMemory() 459 windows_frame_info_[type].StoreRange(rva, code_size, stack_frame_info); in ParseStackInfo() 492 cfi_initial_rules_.StoreRange(address, size, initial_rules); in ParseCFIFrameInfo()
|
D | contained_range_map.h | 89 bool StoreRange(const AddressType &base,
|
D | range_map_unittest.cc | 107 bool stored = range_map->StoreRange(range_test->address, in StoreTest() 345 range_map->StoreRange(base_address, range_size, object); in RetriveAtIndexTest2()
|
D | range_map.h | 81 bool StoreRange(const AddressType &base, const AddressType &size,
|
D | basic_code_modules.cc | 72 if (!map_.StoreRange(module->base_address(), module->size(), module)) { in BasicCodeModules()
|
D | static_range_map_unittest.cc | 201 bool stored = range_map->StoreRange(range_test->address, in StoreTest()
|
D | range_map-inl.h | 50 bool RangeMap<AddressType, EntryType>::StoreRange(const AddressType &base, in StoreRange() function
|
D | microdump.cc | 109 if (!map_.StoreRange(module->base_address(), module->size(), module_ptr)) { in Add()
|
D | minidump.cc | 2791 if (!StoreRange(module, base_address, module_index, module_count, in Read() 2807 if (!range_map_->StoreRange(base_address, module_size, module_index)) { in Read() 2827 bool MinidumpModuleList::StoreRange(const MinidumpModule& module, in StoreRange() function in google_breakpad::MinidumpModuleList 2832 if (range_map_->StoreRange(base_address, module.size(), module_index)) in StoreRange() 3069 if (!range_map_->StoreRange(base_address, region_size, region_index)) { in Read() 3962 range_map_->StoreRange(base_address, module_size, module_index); in Read() 4618 if (!range_map_->StoreRange(base_address, region_size, index)) { in Read()
|
/external/brotli/c/enc/ |
D | hash_composite_inc.h | 85 static BROTLI_INLINE void FN(StoreRange)( in FN() argument 89 FN_A(StoreRange)(&self->ha, data, mask, ix_start, ix_end); in FN() 90 FN_B(StoreRange)(&self->hb, data, mask, ix_start, ix_end); in FN()
|
D | backward_references_inc.h | 118 FN(StoreRange)(privat, ringbuffer, ringbuffer_mask, range_start, in EXPORT_FN() local
|
D | hash_rolling_inc.h | 108 static BROTLI_INLINE void FN(StoreRange)(HashRolling* BROTLI_RESTRICT self, in FN() argument
|
D | hash_longest_match_quickly_inc.h | 108 static BROTLI_INLINE void FN(StoreRange)( in FN() argument
|
D | hash_longest_match64_inc.h | 122 static BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self, in FN() argument
|
D | hash_longest_match_inc.h | 118 static BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self, in FN() argument
|
D | hash_forgetful_chain_inc.h | 149 static BROTLI_INLINE void FN(StoreRange)( in FN() argument
|
D | hash_to_binary_tree_inc.h | 279 static BROTLI_INLINE void FN(StoreRange)(HashToBinaryTree* BROTLI_RESTRICT self, in FN() argument
|
/external/llvm-project/llvm/lib/Analysis/ |
D | Loads.cpp | 424 ConstantRange StoreRange(StoreOffset, in AreNonOverlapSameBaseLoadAndStore() local 426 return LoadRange.intersectWith(StoreRange).isEmptySet(); in AreNonOverlapSameBaseLoadAndStore()
|
/external/google-breakpad/src/google_breakpad/processor/ |
D | minidump.h | 541 bool StoreRange(const MinidumpModule& module,
|