Searched refs:hs (Results 1 - 7 of 7) sorted by relevance
/dalvik/vm/alloc/ |
H A D | HeapSource.c | 57 #define HSTRACE(...) LOG(LOG_INFO, LOG_TAG "-hs", __VA_ARGS__) 179 softLimited(const HeapSource *hs) argument 187 return hs->softLimit <= hs->idealSize; 195 oldHeapOverhead(const HeapSource *hs, bool includeActive) argument 205 for (/* i = i */; i < hs->numHeaps; i++) { 207 footprint += mspace_footprint(hs->heaps[i].msp); 217 ptr2heap(const HeapSource *hs, const void *ptr) argument 219 const size_t numHeaps = hs->numHeaps; 225 const Heap *const heap = &hs 322 addNewHeap(HeapSource *hs, mspace *msp, size_t mspAbsoluteMaxSize) argument 396 HeapSource *hs; local 448 countAllocation(hs2heap(hs), hs, false); local 467 HeapSource *hs = gHs; // use a local to avoid the implicit "volatile" local 491 HeapSource *hs = gHs; // use a local to avoid the implicit "volatile" local 515 HeapSource *hs; local 549 HeapSource *hs = gHs; local 603 HeapSource *hs = gHs; local 629 HeapSource *hs = gHs; local 655 HeapSource *hs = gHs; local 685 heapAllocAndGrow(HeapSource *hs, Heap *heap, size_t n) argument 719 HeapSource *hs = gHs; local 819 HeapSource *hs = gHs; local 885 HeapSource *hs = gHs; local 905 HeapSource *hs = gHs; local 917 setSoftLimit(HeapSource *hs, size_t softLimit) argument 947 HeapSource *hs = gHs; local 996 HeapSource *hs = gHs; local 1009 HeapSource *hs = gHs; local 1022 HeapSource *hs = gHs; local 1050 HeapSource *hs = gHs; local 1097 getUtilizationTarget(const HeapSource *hs, size_t liveSize, size_t targetUtilization) argument 1125 HeapSource *hs = gHs; local 1227 HeapSource *hs = gHs; local 1271 HeapSource *hs = gHs; local 1293 HeapSource *hs = gHs; local 1312 externalAllocPossible(const HeapSource *hs, size_t n) argument 1351 externalAlloc(HeapSource *hs, size_t n, bool grow) argument 1419 HeapSource *hs = gHs; local 1502 HeapSource *hs = gHs; local 1567 const HeapSource *hs = gHs; local [all...] |
/dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
H A D | HashSetTest.java | 41 HashSet hs; field in class:HashSetTest 117 assertTrue("HashSet does not contain correct elements", hs 141 int size = hs.size(); 142 hs.add(new Integer(8)); 143 assertTrue("Added element already contained by set", hs.size() == size); 144 hs.add(new Integer(-9)); 146 hs.size() == size + 1); 147 assertTrue("Failed to add element to set", hs.contains(new Integer(-9))); 161 Set orgSet = (Set) hs.clone(); 162 hs [all...] |
H A D | LinkedHashSetTest.java | 38 LinkedHashSet hs; field in class:LinkedHashSetTest 127 assertTrue("LinkedHashSet does not contain correct elements", hs 151 int size = hs.size(); 152 hs.add(new Integer(8)); 153 assertTrue("Added element already contained by set", hs.size() == size); 154 hs.add(new Integer(-9)); 156 hs.size() == size + 1); 157 assertTrue("Failed to add element to set", hs.contains(new Integer(-9))); 171 Set orgSet = (Set) hs.clone(); 172 hs [all...] |
/dalvik/libcore/support/src/test/java/tests/support/ |
H A D | Support_UnmodifiableCollectionTest.java | 58 HashSet<Integer> hs = new HashSet<Integer>(); 59 hs.add(new Integer(0)); 60 hs.add(new Integer(25)); 61 hs.add(new Integer(99)); 64 col.containsAll(hs)); 65 hs.add(new Integer(100)); 68 !col.containsAll(hs));
|
H A D | Support_UnmodifiableMapTest.java | 116 HashSet<String> hs = new HashSet<String>(); 117 hs.add("0"); 118 hs.add("25"); 119 hs.add("99"); 122 keySet.containsAll(hs)); 123 hs.add("100"); 126 !keySet.containsAll(hs));
|
/dalvik/libcore/security/src/test/java/tests/security/cert/ |
H A D | PolicyNodeTest.java | 45 private HashSet hs = null; field in class:PolicyNodeTest 85 hs = new HashSet(); 86 hs.add(new String("StringParameter1")); 87 hs.add(new String("StringParameter2")); 88 hs.add(new String("StringParameter3")); 92 hs = new HashSet(); 94 hs.add(new PolicyQualifierInfo(getDerEncoding())); 235 MyPolicyNode pn = new MyPolicyNode(null, anyPolicy, null, criticalityIndicator, hs, true); 238 assertEquals(res.size(), hs.size()); 239 assertEquals(res, hs); [all...] |
/dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
H A D | CollectionsTest.java | 898 HashSet hs = new HashSet<Integer>(); 900 Set s = Collections.checkedSet(hs, Integer.class);
|
Completed in 181 milliseconds