HomeSort by relevance Sort by last modified time
    Searched defs:holes (Results 1 - 4 of 4) sorted by null

  /external/ltp/utils/ffsb-6.0-rc2/
filelist.h 61 struct cirlist *holes; member in struct:benchfiles
66 uint32_t listsize; /* Sum size of nodes in files and holes */
80 * It first checks the "holes" list for any available filenames.
95 * put into holes list.
  /external/v8/src/runtime/
runtime-array.cc 34 // Find the next free position. undefined and holes are both considered
80 // Holes and 'undefined' are considered free spots.
202 // Typed arrays cannot have holes or undefined elements.
210 // Collect holes at the end, undefined before that and the rest at the
226 unsigned int holes = limit; local
227 // Assume most arrays contain no holes and undefined values, so minimize the
229 for (unsigned int i = 0; i < holes; i++) {
231 holes--;
236 while (holes > i) {
237 if (elements->is_the_hole(holes)) {
258 unsigned int holes = limit; local
447 int holes = 0; local
    [all...]
  /external/apache-commons-compress/src/main/java/org/apache/commons/compress/archivers/dump/
DumpArchiveEntry.java 488 header.holes = 0;
492 header.holes++;
511 header.holes = 0;
515 header.holes++;
531 private int holes; field in class:DumpArchiveEntry.TapeSegmentHeader
532 private final byte[] cdata = new byte[512]; // map of any 'holes'
555 return holes;
  /external/v8/src/
objects-debug.cc 1955 int holes = 0; local
    [all...]

Completed in 377 milliseconds