Home | History | Annotate | Download | only in vm

Lines Matching refs:parts

77     if (sst.parts.topIndex > pRef->segmentState.parts.topIndex) {
79             pRef->segmentState.parts.topIndex, sst.parts.topIndex);
82     if (sst.parts.numHoles >= sst.parts.topIndex) {
84             sst.parts.numHoles, sst.parts.topIndex);
89         pRef, pRef->kind, sst.parts.topIndex, sst.parts.numHoles);
146     int topIndex = pRef->segmentState.parts.topIndex;
152     assert(pRef->segmentState.parts.numHoles >= prevState.parts.numHoles);
190     int numHoles = pRef->segmentState.parts.numHoles - prevState.parts.numHoles;
197             assert(pScan >= pRef->table + prevState.parts.topIndex);
203         pRef->segmentState.parts.numHoles--;
209         pRef->segmentState.parts.topIndex = topIndex;
228     int topIndex = pRef->segmentState.parts.topIndex;
271     int topIndex = pRef->segmentState.parts.topIndex;
272     int bottomIndex = prevState.parts.topIndex;
276     assert(pRef->segmentState.parts.numHoles >= prevState.parts.numHoles);
306             pRef->segmentState.parts.numHoles - prevState.parts.numHoles;
316             pRef->segmentState.parts.numHoles =
317                 numHoles + prevState.parts.numHoles;
318             pRef->segmentState.parts.topIndex = topIndex;
320             pRef->segmentState.parts.topIndex = topIndex-1;
338         pRef->segmentState.parts.numHoles++;
340             idx, pRef->segmentState.parts.numHoles);