Home
last modified time | relevance | path

Searched refs:arr2 (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/lld/MachO/
H A DMapFile.cpp220 ArrayRef<ConcatInputSection *> arr2 = {}) { in writeMapFile() argument
222 while (!arr1.empty() || !arr2.empty()) { in writeMapFile()
223 if (!arr1.empty() && (arr2.empty() || arr1.front()->outSecOff <= in writeMapFile()
224 arr2.front()->outSecOff)) { in writeMapFile()
227 } else if (!arr2.empty()) { in writeMapFile()
228 printOne(arr2.front()); in writeMapFile()
229 arr2 = arr2.drop_front(); in writeMapFile()
/freebsd/contrib/bzip2/
H A Dbzlib.c176 s->arr2 = NULL; in BZ_API()
181 s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) ); in BZ_API()
184 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) { in BZ_API()
186 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
201 s->block = (UChar*)s->arr2; in BZ_API()
480 if (s->arr2 != NULL) BZFREE(s->arr2); in BZ_API()
H A Dbzlib_private.h211 UInt32* arr2; member
H A Dblocksort.c1045 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
1079 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb ); in BZ2_blockSort()
H A Dcompress.c619 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()