fragmentation     569 src/mark-compact.cc   int fragmentation = 0;
fragmentation     582 src/mark-compact.cc       if ((counter & 1) == (page_number & 1)) fragmentation = 1;
fragmentation     603 src/mark-compact.cc         fragmentation = free_pct;
fragmentation     605 src/mark-compact.cc         fragmentation = 0;
fragmentation     614 src/mark-compact.cc                (fragmentation > 0) ? "[fragmented]" : "");
fragmentation     617 src/mark-compact.cc       fragmentation = FreeListFragmentation(space, p);
fragmentation     620 src/mark-compact.cc     if (fragmentation != 0) {
fragmentation     622 src/mark-compact.cc         candidates[count++] = Candidate(fragmentation, p);
fragmentation     627 src/mark-compact.cc                 candidates[i].fragmentation() < least->fragmentation()) {
fragmentation     632 src/mark-compact.cc         if (least->fragmentation() < fragmentation) {
fragmentation     633 src/mark-compact.cc           *least = Candidate(fragmentation, p);