| /src/external/gpl3/gcc.old/dist/contrib/ |
| mark_spam.py | 103 chunks = args.range.split(',') variable
104 for c in chunks:
|
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| HeapMap.h | 53 HeapChunk *chunks; member in class:HeapMap
|
| CacheMap.h | 76 Entry **chunks; member in class:CacheMap
88 chunks = new Entry*[32];
90 chunks[nchunks++] = new Entry[cursize];
98 delete[] chunks[i];
99 delete[] chunks;
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
127 Entry *oldchunk = chunks[i];
152 return &chunks[i][idx & (j - 1)];
|
| IntervalMap.h | 59 Entry **chunks; member in class:IntervalMap
71 chunks = NULL;
79 delete[] chunks[i];
80 delete[] chunks;
112 new_chunks[i] = chunks[i];
113 delete chunks;
114 chunks = new_chunks;
117 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
119 Entry *entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| DefaultMap.h | 56 Entry **chunks; member in class:DefaultMap
72 chunks = NULL;
83 delete[] chunks[i];
84 delete[] chunks;
142 new_chunks[i] = chunks[i];
143 delete[] chunks;
144 chunks = new_chunks;
147 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
149 entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| StringMap.h | 65 Entry **chunks; member in class:StringMap
77 chunks = NULL;
93 delete[] chunks[i];
94 delete[] chunks;
149 new_chunks[i] = chunks[i];
150 delete[] chunks;
151 chunks = new_chunks;
154 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
156 entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| PathTree.h | 109 return idx ? &chunks[idx / CHUNKSZ][idx % CHUNKSZ] : NULL;
184 Node **chunks; member in class:PathTree
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| HeapMap.h | 53 HeapChunk *chunks; member in class:HeapMap
|
| CacheMap.h | 76 Entry **chunks; member in class:CacheMap
88 chunks = new Entry*[32];
90 chunks[nchunks++] = new Entry[cursize];
98 delete[] chunks[i];
99 delete[] chunks;
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
127 Entry *oldchunk = chunks[i];
152 return &chunks[i][idx & (j - 1)];
|
| IntervalMap.h | 59 Entry **chunks; member in class:IntervalMap
71 chunks = NULL;
79 delete[] chunks[i];
80 delete[] chunks;
112 new_chunks[i] = chunks[i];
113 delete chunks;
114 chunks = new_chunks;
117 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
119 Entry *entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| DefaultMap.h | 56 Entry **chunks; member in class:DefaultMap
72 chunks = NULL;
83 delete[] chunks[i];
84 delete[] chunks;
142 new_chunks[i] = chunks[i];
143 delete[] chunks;
144 chunks = new_chunks;
147 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
149 entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| StringMap.h | 65 Entry **chunks; member in class:StringMap
77 chunks = NULL;
93 delete[] chunks[i];
94 delete[] chunks;
149 new_chunks[i] = chunks[i];
150 delete[] chunks;
151 chunks = new_chunks;
154 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
156 entry = &chunks[entries / CHUNK_SIZE][entries % CHUNK_SIZE];
|
| PathTree.h | 109 return idx ? &chunks[idx / CHUNKSZ][idx % CHUNKSZ] : NULL;
184 Node **chunks; member in class:PathTree
|
| /src/external/gpl3/binutils/dist/include/ |
| objalloc.h | 48 void *chunks; member in struct:objalloc
|
| /src/external/gpl3/binutils.old/dist/include/ |
| objalloc.h | 48 void *chunks; member in struct:objalloc
|
| /src/external/gpl3/gcc.old/dist/include/ |
| objalloc.h | 48 void *chunks; member in struct:objalloc
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_allocator_local_cache.h | 50 CompactPtrT chunk = c->chunks[--c->count];
68 c->chunks[c->count++] = chunk;
89 CompactPtrT chunks[2 * SizeClassMap::kMaxNumCachedHint]; member in struct:SizeClassAllocator64LocalCache::PerClass
110 if (UNLIKELY(!allocator->GetFromAllocator(&stats_, class_id, c->chunks,
123 &c->chunks[first_idx_to_drain], count);
229 // of the chunks. If using a separate size class, it will always be
|
| sanitizer_allocator_secondary.h | 17 // Fixed array to store LargeMmapAllocator chunks list, limited to 32K total
18 // allocated chunks. To be used in memory constrained or not memory hungry cases
29 // Much less restricted LargeMmapAllocator chunks list (comparing to
30 // PtrArrayStatic). Backed by mmaped memory region and can hold up to 1M chunks.
67 // This class can (de)allocate only large chunks of memory using mmap/unmap.
207 Header **chunks = AddressSpaceView::LoadWritable(chunks_, n_chunks_);
208 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
210 AddressSpaceView::LoadWritable(chunks[i])->chunk_idx = i;
240 // There are 2 chunks left, choose one.
274 // Iterate over all existing chunks
278 const Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
[all...] |
| /src/usr.bin/split/ |
| split.c | 80 off_t chunks = 0; /* Number of chunks to split into. */ local
126 case 'n': /* Chunks. */
128 (chunks = (size_t)strtoul(optarg, &ep, 10)) == 0 ||
130 errx(EXIT_FAILURE, "%s: illegal number of chunks.", optarg);
156 else if (bytecnt || chunks)
159 if (bytecnt && chunks)
164 else if (chunks)
165 split3(chunks);
289 * Split the input into specified number of chunks
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/ |
| generate_feature_test_macro_components.py | 790 def chunks(l, n): function
791 """Yield successive n-sized chunks from l."""
813 for chunk in chunks(headers, 3):
|
| /src/external/bsd/nsd/dist/simdzone/src/haswell/ |
| simd.h | 27 typedef struct { __m256i chunks[1]; } simd_8x_t; member in struct:__anon5020
29 typedef struct { __m128i chunks[1]; } simd_8x16_t; member in struct:__anon5021
33 typedef struct { __m256i chunks[2]; } simd_8x64_t; member in struct:__anon5022
39 simd->chunks[0] = _mm256_loadu_si256((const __m256i *)(address));
45 _mm256_storeu_si256((__m256i *)address, simd->chunks[0]);
52 const __m256i r = _mm256_cmpeq_epi8(simd->chunks[0], k);
62 _mm256_shuffle_epi8(t, simd->chunks[0]), simd->chunks[0]);
69 simd->chunks[0] = _mm_loadu_si128((const __m128i *)address);
76 const __m128i r = _mm_cmpeq_epi8(simd->chunks[0], k)
[all...] |
| /src/external/bsd/nsd/dist/simdzone/src/westmere/ |
| simd.h | 26 typedef struct { __m128i chunks[1]; } simd_8x_t; member in struct:__anon5023
30 typedef struct { __m128i chunks[2]; } simd_8x32_t; member in struct:__anon5024
32 typedef struct { __m128i chunks[4]; } simd_8x64_t; member in struct:__anon5025
37 simd->chunks[0] = _mm_loadu_si128((const __m128i *)address);
43 _mm_storeu_si128((__m128i *)address, simd->chunks[0]);
50 const __m128i r = _mm_cmpeq_epi8(simd->chunks[0], k);
60 _mm_shuffle_epi8(t, simd->chunks[0]), simd->chunks[0]);
70 simd->chunks[0] = _mm_loadu_si128((const __m128i *)(address));
71 simd->chunks[1] = _mm_loadu_si128((const __m128i *)(address+16))
[all...] |
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_allocator_local_cache.h | 43 CompactPtrT chunk = c->chunks[--c->count];
61 c->chunks[c->count++] = chunk;
82 CompactPtrT chunks[2 * SizeClassMap::kMaxNumCachedHint]; member in struct:SizeClassAllocator64LocalCache::PerClass
103 if (UNLIKELY(!allocator->GetFromAllocator(&stats_, class_id, c->chunks,
122 &c->chunks[first_idx_to_drain], count);
228 // of the chunks. If using a separate size class, it will always be
|
| sanitizer_allocator_secondary.h | 16 // Fixed array to store LargeMmapAllocator chunks list, limited to 32K total
17 // allocated chunks. To be used in memory constrained or not memory hungry cases
28 // Much less restricted LargeMmapAllocator chunks list (comparing to
29 // PtrArrayStatic). Backed by mmaped memory region and can hold up to 1M chunks.
66 // This class can (de)allocate only large chunks of memory using mmap/unmap.
186 Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
189 uptr ch = reinterpret_cast<uptr>(chunks[i]);
209 Header **chunks = AddressSpaceView::LoadWritable(chunks_, n_chunks_);
210 Sort(reinterpret_cast<uptr *>(chunks), n_chunks_);
212 AddressSpaceView::LoadWritable(chunks[i])->chunk_idx = i
224 Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
278 const Header *const *chunks = AddressSpaceView::Load(chunks_, n_chunks_); local
[all...] |
| /src/sys/arch/arm/arm32/ |
| arm32_kvminit.c | 527 pv_addr_t chunks[__arraycount(bmi->bmi_l2pts) + 11]; local
549 for (size_t i = 0; i < __arraycount(chunks); i++) {
550 SLIST_INSERT_HEAD(&bmi->bmi_freechunks, &chunks[i], pv_list);
807 VPRINTF("Listing Chunks\n");
816 VPRINTF("\nMapping Chunks\n");
|
