| /oneTBB/examples/graph/fgbzip2/ |
| H A D | blocksort.cpp | 430 c1 = block[i1]; in mainGtU()
431 c2 = block[i2]; in mainGtU()
437 c1 = block[i1]; in mainGtU()
438 c2 = block[i2]; in mainGtU()
444 c1 = block[i1]; in mainGtU()
445 c2 = block[i2]; in mainGtU()
451 c1 = block[i1]; in mainGtU()
452 c2 = block[i2]; in mainGtU()
816 med = (Int32)mmed3(block[ptr[lo] + d], block[ptr[hi] + d], block[ptr[(lo + hi) >> 1] + d]); in mainQSort3()
974 block[nblock + i] = block[i]; in mainSort()
[all …]
|
| H A D | README.md | 2 fgbzip2 is a parallel implementation of bzip2 block-sorting file compressor that uses `oneapi::tbb:…
24 * `-b` - block size in 100 KB chunks, [1 .. 9].
|
| H A D | bzlib.cpp | 232 s->block = (UChar*)s->arr2; in BZ_API()
257 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
261 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
263 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
267 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
269 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
271 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
276 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
278 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
280 s->block[s->nblock] = (UChar)ch; in add_pair_to_block()
[all …]
|
| H A D | compress.cpp | 175 UChar* block = s->block; in generateMTFValues() local
195 ll_i = s->unseqToSeq[block[j]]; in generateMTFValues()
|
| /oneTBB/src/tbbmalloc/ |
| H A D | frontend.cpp | 640 if (block && block->empty()) { in cleanupBlockBins()
955 return block; in pop()
966 return block; in grab()
1227 block->previous->next = block; in pushTLSBin()
1249 activeBlk = block->previous? block->previous : block->next; in outofTLSBin()
1254 block->previous->next = block->next; in outofTLSBin()
1258 block->next->previous = block->previous; in outofTLSBin()
1268 Block* block; in getPrivatizedFreeListBlock() local
1286 if( block ) { in getPrivatizedFreeListBlock()
1291 return block; in getPrivatizedFreeListBlock()
[all …]
|
| H A D | backend.cpp | 659 FreeBlock *block; in askMemFromOS() local
681 if (!block) in askMemFromOS()
708 if (block) in askMemFromOS()
718 if (!block || block == (FreeBlock*)VALID_BLOCK_IN_BIN) in askMemFromOS()
726 return block; in askMemFromOS()
767 return block; in findBlock()
830 if (block) in genericGetBlock()
840 if (!block) in genericGetBlock()
848 block = nullptr; in genericGetBlock()
854 block = splitBlock(block, num, size, block->slabAligned, needAlignedBlock); in genericGetBlock()
[all …]
|
| H A D | Synchronize.h | 56 scoped_lock(MallocMutex& m, bool block, bool *locked) : m_mutex(m), m_taken(false) { in scoped_lock() argument
57 if (block) { in scoped_lock()
|
| H A D | backend.h | 334 static bool toAlignedBin(FreeBlock *block, size_t size) { in toAlignedBin() argument
335 return isAligned((char*)block + size, slabSize) && size >= slabSize; in toAlignedBin()
349 void putSlabBlock(BlockI *block);
|
| H A D | tbbmalloc_internal.h | 262 inline void push(Block *block);
283 void put(intptr_t binTag, Block *block);
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Wavefront.rst | 131 process the contents of a block serially. The blocks have the same
136 The parallel code follows. Each block consists of ``N×N`` elements.
137 Each block has an associated atomic counter. Array ``Count``
140 starting with the block at the origin since it has no predecessors.
158 typedef pair<size_t,size_t> block;
159 block origin(0,0);
161 [=]( const block& b, oneapi::tbb::feeder<block>&feeder ) {
162 // Extract bounds on block
169 // Process the block
176 feeder.add( block(bi,bj+1) );
[all …]
|
| H A D | Agglomeration.rst | 53 block serially.
56 The block size should be chosen to be large enough to amortize
57 parallel overhead. Too large a block size may limit parallelism or
62 The choice of block topology is typically driven by two concerns:
78 optimal agglomeration might be a single block,
97 neighbors, then the computation per block grows quadratically (with
98 the block's area), but the cross-block communication grows with
99 linearly (with the block's perimeter). The following figure shows
103 when the block is square with respect to the underlying grid of cache
|
| H A D | Reduction.rst | 109 that the block size for agglomeration is not explicitly specified;
207 specified for ``oneapi::tbb::blocked_range``. It defines the desired block
208 size for agglomeration; automatic block size selection is not used
|
| /oneTBB/doc/GSG/ |
| H A D | integrate.rst | 29 .. code-block::
46 .. code-block::
54 .. code-block::
61 .. code-block::
|
| H A D | next_steps.rst | 67 .. code-block::
113 .. code-block::
120 .. code-block::
|
| H A D | samples.rst | 20 …* `A parallel implementation of bzip2 block-sorting file compressor <https://github.com/oneapi-src…
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | When_Task-Based_Programming_Is_Inappropriate.rst | 11 rarely block. However, if threads block frequently, there is a
|
| H A D | concurrent_hash_map.rst | 93 up that key in the table block until the ``accessor`` is done. A
105 to an element can block other threads, try to shorten the lifetime of
107 innermost block possible. To release access even sooner than the end of
108 the block, use method ``release``. The following example is a rework of
|
| H A D | appendix_B.rst | 40 and each thread executes the block statement associated with the pragma.
|
| H A D | destroy_graphs_outside_main_thread.rst | 8 You may not always want to block the main application thread by calling
|
| H A D | Concurrent_Queue_Classes.rst | 98 causes ``push`` to block until there is room in the queue. Bounded
|
| /oneTBB/doc/main/reference/ |
| H A D | follows_and_precedes_functions.rst | 69 .. code-block:: cpp
75 .. code-block:: cpp
|
| /oneTBB/examples/graph/ |
| H A D | README.md | 9 | fgbzip2 | A parallel implementation of bzip2 block-sorting file compressor.
|
| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_whitebox.cpp | 213 Block *block = (Block *)alignDown(blocks1[i].ptr, slabSize); in operator ()() local
214 ((StartupBlock *)block)->free(blocks1[i].ptr); in operator ()()
219 Block *block = (Block *)alignDown(blocks2[i].ptr, slabSize); in operator ()() local
220 ((StartupBlock *)block)->free(blocks2[i].ptr); in operator ()()
684 BlockI *block = backend->getSlabBlock(1); in TestBackend() local
685 REQUIRE_MESSAGE(block, "Memory was not allocated"); in TestBackend()
686 backend->putSlabBlock(block); in TestBackend()
1235 Block *block = (Block *)alignDown(pointers[i], slabSize); in TestSlabAlignment() local
1236 REQUIRE_MESSAGE(findCacheLine(&block->isFull) != findCacheLine(pointers[i]), in TestSlabAlignment()
1238 REQUIRE_MESSAGE(findCacheLine(&block->next) != findCacheLine(&block->nextPrivatizable), in TestSlabAlignment()
|
| /oneTBB/examples/ |
| H A D | README.md | 12 | graph/fgbzip2 | A parallel implementation of bzip2 block-sorting file compressor.
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | README.md | 31 * `blocksize` - the block size; size must be a multiple of the blocksize.
|