HomeSort by: relevance | last modified time | path
    Searched refs:nchunks (Results 1 - 25 of 25) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/
bitarray.d 34 immutable nchunks = chunks(nlen);
35 if (ochunks != nchunks)
37 ptr = cast(size_t*)mem.xrealloc_noscan(ptr, nchunks * ChunkSize);
39 if (nchunks > ochunks)
40 ptr[ochunks .. nchunks] = 0;
42 ptr[nchunks - 1] &= (cast(Chunk_t)1 << (nlen & (BitsPerChunk - 1))) - 1;
89 const nchunks = chunks(len);
90 foreach (i; 0 .. nchunks)
101 const nchunks = chunks(len);
102 foreach (i; 0 .. nchunks)
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
CacheMap.h 75 int nchunks; member in class:CacheMap
89 nchunks = 0;
90 chunks[nchunks++] = new Entry[cursize];
97 for (int i = 0; i < nchunks; i++)
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
125 for (int i = 0; i < nchunks - 1; i++)
145 int i = nchunks - 1;
DefaultMap.h 55 int nchunks; member in class:DefaultMap
71 nchunks = 0;
82 for (int i = 0; i < nchunks; i++)
136 if (entries >= nchunks * CHUNK_SIZE)
138 nchunks++;
140 Entry **new_chunks = new Entry*[nchunks];
141 for (int i = 0; i < nchunks - 1; i++)
147 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
IntervalMap.h 58 int nchunks; member in class:IntervalMap
70 nchunks = 0;
78 for (int i = 0; i < nchunks; i++)
106 if (entries >= nchunks * CHUNK_SIZE)
108 nchunks++;
110 Entry **new_chunks = new Entry*[nchunks];
111 for (int i = 0; i < nchunks - 1; i++)
117 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
StringMap.h 64 int nchunks; member in class:StringMap
76 nchunks = 0;
92 for (int i = 0; i < nchunks; i++)
142 if (entries >= nchunks * CHUNK_SIZE)
144 nchunks++;
147 Entry **new_chunks = new Entry*[nchunks];
148 for (int i = 0; i < nchunks - 1; i++)
154 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
CallStack.cc 139 int nchunks; member in class:CallStackP
166 nchunks = 0;
188 for (int i = 0; i < nchunks; i++)
201 if (nodes >= nchunks * CHUNKSZ)
204 nchunks++;
207 chunks = (CallStackNode **) xmalloc (nchunks * sizeof (CallStackNode *));
208 for (int i = 0; i < nchunks - 1; i++)
212 chunks[nchunks - 1] = (CallStackNode *) xmalloc (CHUNKSZ * sizeof (CallStackNode));
PathTree.cc 68 nchunks = 0;
94 for (long i = 0; i < nchunks; i++)
164 for (long j = 0; j < nchunks; j++)
253 int **ip = new int*[nchunks];
254 for (i = 0; i < nchunks; i++)
270 for (long j = 0; j < nchunks; j++)
291 if (nchunks == 0)
295 int **ip = new int*[nchunks];
296 for (long j = 0; j < nchunks; j++)
318 if (nodes >= nchunks * CHUNKSZ
    [all...]
Experiment.h 533 long nchunks; member in class:Experiment
PathTree.h 183 long nchunks; member in class:PathTree
Experiment.cc 1400 nchunks = 0;
1474 for (long i = 0; i < nchunks; i++)
5051 if (nnodes >= nchunks * CHUNKSZ)
5055 chunks = new UIDnode*[nchunks + NCHUNKSTEP];
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5058 nchunks += NCHUNKSTEP;
5061 memset (&chunks[nchunks - NCHUNKSTEP], 0, NCHUNKSTEP * sizeof (UIDnode*));
  /src/external/gpl3/binutils.old/dist/gprofng/src/
CacheMap.h 75 int nchunks; member in class:CacheMap
89 nchunks = 0;
90 chunks[nchunks++] = new Entry[cursize];
97 for (int i = 0; i < nchunks; i++)
118 chunks[nchunks++] = new Entry[cursize];
122 Entry *newchunk = chunks[nchunks - 1];
125 for (int i = 0; i < nchunks - 1; i++)
145 int i = nchunks - 1;
DefaultMap.h 55 int nchunks; member in class:DefaultMap
71 nchunks = 0;
82 for (int i = 0; i < nchunks; i++)
136 if (entries >= nchunks * CHUNK_SIZE)
138 nchunks++;
140 Entry **new_chunks = new Entry*[nchunks];
141 for (int i = 0; i < nchunks - 1; i++)
147 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
IntervalMap.h 58 int nchunks; member in class:IntervalMap
70 nchunks = 0;
78 for (int i = 0; i < nchunks; i++)
106 if (entries >= nchunks * CHUNK_SIZE)
108 nchunks++;
110 Entry **new_chunks = new Entry*[nchunks];
111 for (int i = 0; i < nchunks - 1; i++)
117 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
StringMap.h 64 int nchunks; member in class:StringMap
76 nchunks = 0;
92 for (int i = 0; i < nchunks; i++)
142 if (entries >= nchunks * CHUNK_SIZE)
144 nchunks++;
147 Entry **new_chunks = new Entry*[nchunks];
148 for (int i = 0; i < nchunks - 1; i++)
154 chunks[nchunks - 1] = new Entry[CHUNK_SIZE];
CallStack.cc 139 int nchunks; member in class:CallStackP
166 nchunks = 0;
188 for (int i = 0; i < nchunks; i++)
201 if (nodes >= nchunks * CHUNKSZ)
204 nchunks++;
207 chunks = (CallStackNode **) xmalloc (nchunks * sizeof (CallStackNode *));
208 for (int i = 0; i < nchunks - 1; i++)
212 chunks[nchunks - 1] = (CallStackNode *) xmalloc (CHUNKSZ * sizeof (CallStackNode));
PathTree.cc 68 nchunks = 0;
94 for (long i = 0; i < nchunks; i++)
164 for (long j = 0; j < nchunks; j++)
253 int **ip = new int*[nchunks];
254 for (i = 0; i < nchunks; i++)
270 for (long j = 0; j < nchunks; j++)
291 if (nchunks == 0)
295 int **ip = new int*[nchunks];
296 for (long j = 0; j < nchunks; j++)
318 if (nodes >= nchunks * CHUNKSZ
    [all...]
Experiment.h 533 long nchunks; member in class:Experiment
PathTree.h 183 long nchunks; member in class:PathTree
Experiment.cc 1400 nchunks = 0;
1474 for (long i = 0; i < nchunks; i++)
5051 if (nnodes >= nchunks * CHUNKSZ)
5055 chunks = new UIDnode*[nchunks + NCHUNKSTEP];
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5058 nchunks += NCHUNKSTEP;
5061 memset (&chunks[nchunks - NCHUNKSTEP], 0, NCHUNKSTEP * sizeof (UIDnode*));
  /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/
amdgpu_cs.c 151 p->nchunks = cs->in.num_chunks;
152 p->chunks = kmalloc_array(p->nchunks, sizeof(struct amdgpu_cs_chunk),
159 for (i = 0; i < p->nchunks; i++) {
254 i = p->nchunks - 1;
260 p->nchunks = 0;
715 for (i = 0; i < parser->nchunks; i++)
742 for (i = 0, j = 0; i < p->nchunks && j < p->job->num_ibs; i++) {
885 for (i = 0, j = 0; i < parser->nchunks && j < parser->job->num_ibs; i++) {
1157 for (i = 0; i < p->nchunks; ++i) {
amdgpu.h 488 unsigned nchunks; member in struct:amdgpu_cs_parser
  /src/sys/external/bsd/drm2/dist/drm/radeon/
radeon_cs.c 317 p->nchunks = cs->num_chunks;
318 p->chunks = kcalloc(p->nchunks, sizeof(struct radeon_cs_chunk), GFP_KERNEL);
322 for (i = 0; i < p->nchunks; i++) {
467 for (i = 0; i < parser->nchunks; i++)
radeon.h 1109 unsigned nchunks; member in struct:radeon_cs_parser
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
zap_micro.c 598 int i, sz, nchunks; local
607 nchunks = zap->zap_m.zap_num_chunks;
619 zap->zap_object, nchunks);
625 for (i = 0; i < nchunks; i++) {
  /src/lib/libc/stdlib/
jemalloc.c 414 uint64_t nchunks; member in struct:chunk_stats_s
1387 stats_chunks.nchunks += (size / chunksize);
3210 malloc_printf("chunks: nchunks "
3213 chunks_stats.nchunks,

Completed in 78 milliseconds