Lines Matching full:segments

11 // Defines the implementation of a segmented array, with fixed-size segments
12 // backing the segments.
56   //     kCacheLineSize-multiple segments, minus the size of two pointers.
167   // Here we keep track of segments in the freelist, to allow us to re-use
168   // segments when elements are trimmed off the end.
205     // allow us to re-use segments we've allocated before. For this we look into  in NewSegment()
462     // We compute the number of segments we're going to return from the tail by  in trim()
468     // To compute the number of segments to return, we need to perform the  in trim()
469     // following calculations for the number of segments required given 'x'  in trim()
490     // of segments we need to remove from the end of the data structure:  in trim()
510       // the doubly-linked list of segments:  in trim()
611     // Now in case we've spliced all the segments in the end, we ensure that the  in trim()