61     Segment *mSegmentArray; // storage for the segments [max]  member
86         Segment *seg = &s->mSegmentArray[s->mSegmentCount++];  in split()
221     s.mSegmentArray = (Segment *) malloc(sizeof(Segment) * s.mSegmentMax);  in permute()
222     assert(s.mSegmentArray != NULL);  in permute()
234             Segment temp = s.mSegmentArray[i];  in permute()
235             s.mSegmentArray[i] = s.mSegmentArray[j];  in permute()
236             s.mSegmentArray[j] = temp;  in permute()
269         s.mSegmentArray[i].mPermutedStart = permutedStart;  in permute()
270         count = sf_writef_short(sf_out, &((short *) ptr)[sfinfo_in.channels * s.mSegmentArray[i]  in permute()
271             .mFrameStart], s.mSegmentArray[i].mFrameLength);  in permute()
272         if (count != s.mSegmentArray[i].mFrameLength) {  in permute()
274                 path_out, (int) s.mSegmentArray[i].mFrameLength, (int) count);  in permute()
277         permutedStart += s.mSegmentArray[i].mFrameLength;  in permute()
283     qsort((void *) s.mSegmentArray, used, sizeof(Segment), qsortCompare);  in permute()
293             fprintf(fp_map, "%u %u\n", (unsigned) ((s.mSegmentArray[i].mPermutedStart * 1000.0) /  in permute()
294                 sfinfo_in.samplerate), (unsigned) ((s.mSegmentArray[i].mFrameLength * 1000.0) /  in permute()