/external/valgrind/include/ |
H A D | pub_tool_rangemap.h | 43 typedef struct _RangeMap RangeMap; typedef in typeref:struct:_RangeMap 45 /* Create a new RangeMap, using given allocation and free functions. 50 RangeMap* VG_(newRangeMap) ( void*(*alloc_fn)(const HChar*,SizeT), 55 /* Free all memory associated with a RangeMap. */ 56 void VG_(deleteRangeMap) ( RangeMap* ); 63 void VG_(bindRangeMap) ( RangeMap* rm, 67 the key bounds. Can never fail since the RangeMap covers the 71 /*OUT*/UWord* val, const RangeMap* rm, UWord key ); 74 UInt VG_(sizeRangeMap) ( const RangeMap* rm ); 78 /*OUT*/UWord* val, const RangeMap* r [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | RangeMap.java | 36 public interface RangeMap<K extends Comparable, V> { interface 56 * in this {@code RangeMap}. 76 void putAll(RangeMap<K, V> rangeMap); 114 RangeMap<K, V> subRangeMap(Range<K> range); 117 * Returns {@code true} if {@code obj} is another {@code RangeMap} that has an equivalent
|
H A D | TreeRangeMap.java | 45 * An implementation of {@code RangeMap} based on a {@code TreeMap}, supporting 48 * <p>Like all {@code RangeMap} implementations, this supports neither null 56 public final class TreeRangeMap<K extends Comparable, V> implements RangeMap<K, V> { 134 public void putAll(RangeMap<K, V> rangeMap) { 249 public RangeMap<K, V> subRangeMap(Range<K> subRange) { 258 private RangeMap<K, V> emptySubRangeMap() { 262 private static final RangeMap EMPTY_SUB_RANGE_MAP = 263 new RangeMap() { 289 public void putAll(RangeMap rangeMap) { 310 public RangeMap subRangeMa [all...] |
H A D | ImmutableRangeMap.java | 33 * An immutable implementation of {@code RangeMap}, supporting all query operations efficiently. 35 * <p>Like all {@code RangeMap} implementations, this supports neither null keys nor null values. 42 public class ImmutableRangeMap<K extends Comparable<?>, V> implements RangeMap<K, V> { 66 RangeMap<K, ? extends V> rangeMap) { 92 private final RangeMap<K, V> rangeMap; 130 public Builder<K, V> putAll(RangeMap<K, ? extends V> rangeMap) { 204 public void putAll(RangeMap<K, V> rangeMap) { 288 if (o instanceof RangeMap) { 289 RangeMap<?, ?> rangeMap = (RangeMap< 65 copyOf( RangeMap<K, ? extends V> rangeMap) argument [all...] |
/external/valgrind/coregrind/ |
H A D | m_rangemap.c | 59 static void preen (/*MOD*/RangeMap* rm); 60 static Word find ( const RangeMap* rm, UWord key ); 61 static void split_at ( /*MOD*/RangeMap* rm, UWord key ); 62 static void show ( const RangeMap* rm ); 65 RangeMap* VG_(newRangeMap) ( void*(*alloc_fn)(const HChar*,SizeT), 73 RangeMap* rm = alloc_fn(cc, sizeof(RangeMap)); 90 void VG_(deleteRangeMap) ( RangeMap* rm ) 99 void VG_(bindRangeMap) ( RangeMap* rm, 117 /*OUT*/UWord* val, const RangeMap* r [all...] |
/external/google-breakpad/src/processor/ |
H A D | basic_code_modules.h | 49 template<typename AddressType, typename EntryType> class RangeMap; 78 RangeMap<uint64_t, linked_ptr<const CodeModule> > *map_;
|
H A D | map_serializers.h | 31 // wrappers: AddressMap, RangeMap, and ContainedRangeMap. 107 // RangeMapSerializer allocates memory and serializes a RangeMap instance into a 113 size_t SizeOf(const RangeMap<Address, Entry> &m) const; 118 char* Write(const RangeMap<Address, Entry> &m, char* dest) const; 120 // Serializes a RangeMap object into a chunk of memory data. 124 char* Serialize(const RangeMap<Address, Entry> &m, unsigned int *size) const; 128 typedef typename RangeMap<Address, Entry>::Range Range; 130 // Serializer for RangeMap's key and Range::base_. 132 // Serializer for RangeMap::Range::entry_.
|
H A D | range_map-inl.h | 50 bool RangeMap<AddressType, EntryType>::StoreRange(const AddressType &base, 118 bool RangeMap<AddressType, EntryType>::RetrieveRange( 121 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveRange requires |entry|"; 147 bool RangeMap<AddressType, EntryType>::RetrieveNearestRange( 150 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveNearestRange requires |entry|"; 178 bool RangeMap<AddressType, EntryType>::RetrieveRangeAtIndex( 181 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveRangeAtIndex requires |entry|"; 206 int RangeMap<AddressType, EntryType>::GetCount() const { 212 void RangeMap<AddressType, EntryType>::Clear() {
|
H A D | basic_source_line_resolver_types.h | 68 RangeMap< MemAddr, linked_ptr<Line> > lines; 145 RangeMap< MemAddr, linked_ptr<Function> > functions_; 163 // recovery rules. The RangeMap's itself gives the starting and ending 165 RangeMap<MemAddr, string> cfi_initial_rules_;
|
H A D | basic_code_modules.cc | 50 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { 78 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { 117 // This class stores everything in a RangeMap, without any more-efficient
|
H A D | range_map.h | 53 class RangeMap { class in namespace:google_breakpad 55 RangeMap() : map_() {} function in class:google_breakpad::RangeMap 90 // Returns the number of ranges stored in the RangeMap. 112 // be stored, because RangeMap uses it as the key to the map.
|
H A D | map_serializers-inl.h | 120 const RangeMap<Address, Entry> &m) const { 139 const RangeMap<Address, Entry> &m, char *dest) const { 170 const RangeMap<Address, Entry> &m, unsigned int *size) const { 119 SizeOf( const RangeMap<Address, Entry> &m) const argument 138 Write( const RangeMap<Address, Entry> &m, char *dest) const argument 169 Serialize( const RangeMap<Address, Entry> &m, unsigned int *size) const argument
|
H A D | range_map_unittest.cc | 30 // range_map_unittest.cc: Unit tests for RangeMap 49 using google_breakpad::RangeMap; 71 typedef RangeMap< AddressType, linked_ptr<CountedObject> > TestMap; 92 // sequence on the same RangeMap. 103 // test RangeMap. It returns true if the expected result occurred, and 125 // test RangeMap. If it retrieves the expected value (which can be no 412 // three stores because AddressType is signed for these tests, so RangeMap 471 // the RangeMap with data for the RetrieveRange test. 485 // stored in the RangeMap. 495 // The RangeMap' [all...] |
H A D | module_comparer.cc | 110 RangeMap<MemAddr, linked_ptr<BasicFunc> >::MapConstIterator iter1; 153 RangeMap<MemAddr, string>::MapConstIterator iter1; 200 RangeMap<MemAddr, linked_ptr<BasicLine> >::MapConstIterator iter1;
|
H A D | map_serializers_unittest.cc | 210 google_breakpad::RangeMap<AddrType, EntryType> range_map_;
|
H A D | static_range_map_unittest.cc | 48 typedef google_breakpad::RangeMap< AddressType, EntryType > RMap; 67 // sequence on the same RangeMap. 121 // three stores because AddressType is signed for these tests, so RangeMap 174 // test RangeMap. It returns true if the expected result occurred, and 179 // test RangeMap. If it retrieves the expected value (which can be no 361 // the RangeMap with data for the RetrieveRange test. 376 // The RangeMap's own count of objects should also match.
|
H A D | minidump.cc | 2432 range_map_(new RangeMap<uint64_t, unsigned int>()), 2688 range_map_(new RangeMap<uint64_t, unsigned int>()), 3797 range_map_(new RangeMap<uint64_t, unsigned int>()),
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | TreeRangeMapTest.java | 60 RangeMap<Integer, String> rangeMap = TreeRangeMap.create(); 115 RangeMap<Integer, String> rangeMap = TreeRangeMap.create(); 192 RangeMap<Integer, Integer> rangeMap = TreeRangeMap.create(); 207 RangeMap<Integer, Integer> rangeMap = TreeRangeMap.create(); 240 RangeMap<Integer, Integer> test = TreeRangeMap.create(); 252 RangeMap<Integer, Integer> test = TreeRangeMap.create(); 268 RangeMap<Integer, Integer> test = TreeRangeMap.create(); 286 RangeMap<Integer, Integer> test = TreeRangeMap.create(); 287 RangeMap<Integer, Integer> test2 = TreeRangeMap.create(); 305 RangeMap<Intege [all...] |
H A D | ImmutableRangeMapTest.java | 132 RangeMap<Integer, Integer> rangemap = 142 RangeMap<Integer, Integer> rangemap =
|
/external/v8/src/profiler/ |
H A D | allocation-tracker.cc | 124 ranges_.insert(RangeMap::value_type(end, new_range)); 129 RangeMap::const_iterator it = ranges_.upper_bound(addr); 153 for (RangeMap::iterator it = ranges_.begin(); it != ranges_.end(); ++it) { 162 RangeMap::iterator it = ranges_.upper_bound(start); 167 RangeMap::iterator to_remove_begin = it; 184 ranges_.insert(RangeMap::value_type(start, prev_range));
|
H A D | allocation-tracker.h | 89 typedef std::map<Address, RangeStack> RangeMap; typedef in class:v8::internal::AddressToTraceMap 93 RangeMap ranges_;
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/ |
H A D | Opcodes.java | 35 import com.google.common.collect.RangeMap; 110 RangeMap<Integer, Short> versionToValueMap;
|
H A D | Opcode.java | 37 import com.google.common.collect.RangeMap; 348 public final RangeMap<Integer, Short> apiToValueMap; 349 public final RangeMap<Integer, Short> artVersionToValueMap;
|
/external/google-breakpad/src/google_breakpad/processor/ |
H A D | minidump.h | 107 template<typename AddressType, typename EntryType> class RangeMap; 520 RangeMap<uint64_t, unsigned int> *range_map_; 575 RangeMap<uint64_t, unsigned int> *range_map_; 849 RangeMap<uint64_t, unsigned int> *range_map_;
|
/external/valgrind/memcheck/ |
H A D | mc_main.c | 1085 // RangeMap<IARKind> 1086 static RangeMap* gIgnoredAddressRanges = NULL;
|