| /src/external/gpl3/binutils/dist/gprofng/src/ |
| CallStack.cc | 203 CallStackNode **old_chunks = chunks; local
209 chunks[i] = old_chunks[i];
210 free (old_chunks);
|
| CallStack.cc | 203 CallStackNode **old_chunks = chunks; local
209 chunks[i] = old_chunks[i];
210 free (old_chunks);
|
| PathTree.cc | 323 Node **old_chunks = chunks; local
326 chunks[k] = old_chunks[k];
327 delete[] old_chunks;
|
| PathTree.cc | 323 Node **old_chunks = chunks; local
326 chunks[k] = old_chunks[k];
327 delete[] old_chunks;
|
| Experiment.cc | 5054 UIDnode** old_chunks = chunks; local
5056 if (old_chunks)
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5059 delete[] old_chunks;
|
| Experiment.cc | 5054 UIDnode** old_chunks = chunks; local
5056 if (old_chunks)
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5059 delete[] old_chunks;
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| CallStack.cc | 203 CallStackNode **old_chunks = chunks; local
209 chunks[i] = old_chunks[i];
210 free (old_chunks);
|
| CallStack.cc | 203 CallStackNode **old_chunks = chunks; local
209 chunks[i] = old_chunks[i];
210 free (old_chunks);
|
| PathTree.cc | 323 Node **old_chunks = chunks; local
326 chunks[k] = old_chunks[k];
327 delete[] old_chunks;
|
| PathTree.cc | 323 Node **old_chunks = chunks; local
326 chunks[k] = old_chunks[k];
327 delete[] old_chunks;
|
| Experiment.cc | 5054 UIDnode** old_chunks = chunks; local
5056 if (old_chunks)
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5059 delete[] old_chunks;
|
| Experiment.cc | 5054 UIDnode** old_chunks = chunks; local
5056 if (old_chunks)
5057 memcpy (chunks, old_chunks, nchunks * sizeof (UIDnode*));
5059 delete[] old_chunks;
|
| /src/lib/libc/stdlib/ |
| jemalloc.c | 734 static rb_tree_t old_chunks; variable
1283 tchunk = RB_TREE_MIN(&old_chunks);
1289 tchunk = RB_TREE_NEXT(&old_chunks, delchunk);
1292 rb_tree_remove_node(&old_chunks, delchunk);
1370 * Clean out any entries in old_chunks that overlap with the
1374 tchunk = rb_tree_find_node_geq(&old_chunks, &key);
1379 tchunk = RB_TREE_NEXT(&old_chunks, delchunk);
1380 rb_tree_remove_node(&old_chunks, delchunk);
1457 rb_tree_insert_node(&old_chunks, node);
1476 rb_tree_insert_node(&old_chunks, node)
[all...] |
| jemalloc.c | 734 static rb_tree_t old_chunks; variable
1283 tchunk = RB_TREE_MIN(&old_chunks);
1289 tchunk = RB_TREE_NEXT(&old_chunks, delchunk);
1292 rb_tree_remove_node(&old_chunks, delchunk);
1370 * Clean out any entries in old_chunks that overlap with the
1374 tchunk = rb_tree_find_node_geq(&old_chunks, &key);
1379 tchunk = RB_TREE_NEXT(&old_chunks, delchunk);
1380 rb_tree_remove_node(&old_chunks, delchunk);
1457 rb_tree_insert_node(&old_chunks, node);
1476 rb_tree_insert_node(&old_chunks, node)
[all...] |
