26     u2          count;  member
39     for (i = 0; i < pSet->count; i++) {  in verifySorted()
92     pSet->count = 0;  in dvmPointerSetClear()
100     return pSet->count;  in dvmPointerSetGetCount()
125     if (pSet->count == pSet->alloc) {  in dvmPointerSetAddEntry()
142     if (pSet->count == 0) {  in dvmPointerSetAddEntry()
166         if (nearby != pSet->count) {  in dvmPointerSetAddEntry()
169                 (pSet->count - nearby) * sizeof(pSet->list[0]));  in dvmPointerSetAddEntry()
174     pSet->count++;  in dvmPointerSetAddEntry()
190     if (where != pSet->count-1) {  in dvmPointerSetRemoveEntry()
193             (pSet->count-1 - where) * sizeof(pSet->list[0]));  in dvmPointerSetRemoveEntry()
196     pSet->count--;  in dvmPointerSetRemoveEntry()
197     pSet->list[pSet->count] = (const void*) 0xdecadead;     // debug  in dvmPointerSetRemoveEntry()
210     hi = pSet->count-1;  in dvmPointerSetHas()
238 void dvmPointerSetIntersect(PointerSet* pSet, const void** ptrArray, int count)  in dvmPointerSetIntersect()  argument
242     for (i = 0; i < pSet->count; i++) {  in dvmPointerSetIntersect()
243         for (j = 0; j < count; j++) {  in dvmPointerSetIntersect()
250         if (j == count) {  in dvmPointerSetIntersect()
252             if (i != pSet->count-1) {  in dvmPointerSetIntersect()
255                     (pSet->count-1 - i) * sizeof(pSet->list[0]));  in dvmPointerSetIntersect()
258             pSet->count--;  in dvmPointerSetIntersect()
259             pSet->list[pSet->count] = (const void*) 0xdecadead;     // debug  in dvmPointerSetIntersect()
271     for (i = 0; i < pSet->count; i++)  in dvmPointerSetDump()