Searched defs:pSet (Results 1 - 5 of 5) sorted by relevance
/dalvik/vm/ |
H A D | PointerSet.h | 35 void dvmPointerSetFree(PointerSet* pSet); 40 void dvmPointerSetClear(PointerSet* pSet); 45 int dvmPointerSetGetCount(const PointerSet* pSet); 50 const void* dvmPointerSetGetEntry(const PointerSet* pSet, int i); 58 bool dvmPointerSetAddEntry(PointerSet* pSet, const void* ptr); 63 bool dvmPointerSetRemoveEntry(PointerSet* pSet, const void* ptr); 70 bool dvmPointerSetHas(const PointerSet* pSet, const void* ptr, int* pIndex); 75 INLINE int dvmPointerSetFind(const PointerSet* pSet, const void* ptr) { argument 77 if (!dvmPointerSetHas(pSet, ptr, &idx)) 85 * Any pointer in "pSet" tha [all...] |
H A D | Debugger.h | 44 INLINE void dvmAddressSetSet(AddressSet *pSet, u4 toSet) argument 46 if (toSet < pSet->setSize) { 47 pSet->set[toSet/8] |= 1 << (toSet % 8); 51 INLINE bool dvmAddressSetGet(const AddressSet *pSet, u4 toGet) argument 53 if (toGet < pSet->setSize) { 54 return (pSet->set[toGet/8] & (1 << (toGet % 8))) != 0;
|
H A D | PointerSet.cpp | 34 static bool verifySorted(PointerSet* pSet) argument 39 for (i = 0; i < pSet->count; i++) { 40 const void* cur = pSet->list[i]; 57 PointerSet* pSet = (PointerSet*)calloc(1, sizeof(PointerSet)); local 58 if (pSet != NULL) { 60 pSet->list = (const void**)malloc(sizeof(void*) * initialSize); 61 if (pSet->list == NULL) { 62 free(pSet); 65 pSet->alloc = initialSize; 69 return pSet; 75 dvmPointerSetFree(PointerSet* pSet) argument 90 dvmPointerSetClear(PointerSet* pSet) argument 98 dvmPointerSetGetCount(const PointerSet* pSet) argument 106 dvmPointerSetGetEntry(const PointerSet* pSet, int i) argument 117 dvmPointerSetAddEntry(PointerSet* pSet, const void* ptr) argument 183 dvmPointerSetRemoveEntry(PointerSet* pSet, const void* ptr) argument 205 dvmPointerSetHas(const PointerSet* pSet, const void* ptr, int* pIndex) argument 238 dvmPointerSetIntersect(PointerSet* pSet, const void** ptrArray, int count) argument 268 dvmPointerSetDump(const PointerSet* pSet) argument [all...] |
H A D | Debugger.cpp | 2848 AddressSet *pSet; member in struct:AddressSetContext 2868 dvmAddressSetSet(pContext->pSet, i); 2891 context.pSet = result;
|
/dalvik/vm/interp/ |
H A D | Interp.cpp | 41 static void dvmBreakpointSetFree(BreakpointSet* pSet); 107 BreakpointSet* pSet = (BreakpointSet*) calloc(1, sizeof(*pSet)); local 109 dvmInitMutex(&pSet->lock); 112 return pSet; 118 static void dvmBreakpointSetFree(BreakpointSet* pSet) argument 120 if (pSet == NULL) 123 free(pSet->breakpoints); 124 free(pSet); 135 static void dvmBreakpointSetLock(BreakpointSet* pSet) argument 148 dvmBreakpointSetUnlock(BreakpointSet* pSet) argument 156 dvmBreakpointSetCount(const BreakpointSet* pSet) argument 168 dvmBreakpointSetFind(const BreakpointSet* pSet, const u2* addr) argument 188 dvmBreakpointSetOriginalOpcode(const BreakpointSet* pSet, const u2* addr, u1* pOrig) argument 233 dvmBreakpointSetAdd(BreakpointSet* pSet, Method* method, unsigned int instrOffset) argument 311 dvmBreakpointSetRemove(BreakpointSet* pSet, Method* method, unsigned int instrOffset) argument 364 dvmBreakpointSetFlush(BreakpointSet* pSet, ClassObject* clazz) argument 396 BreakpointSet* pSet = gDvm.breakpointSet; local 421 BreakpointSet* pSet = gDvm.breakpointSet; local 439 BreakpointSet* pSet = gDvm.breakpointSet; local 458 BreakpointSet* pSet = gDvm.breakpointSet; local 483 BreakpointSet* pSet = gDvm.breakpointSet; local [all...] |
Completed in 189 milliseconds