| /external/llvm/lib/Transforms/Utils/ |
| CloneFunction.cpp | 112 // Loop over all of the basic blocks in the function, cloning them as
249 // Note that we don't need to fix the mapping for unreachable blocks;
344 // Recursively clone any reachable successor blocks.
393 // Loop over all of the basic blocks in the old function. If the block was
409 // blocks.
430 // Map operands for blocks that are live and remove operands for blocks
452 // The loop above has removed PHI entries for those blocks that are dead
551 // removed, so we just need to splice the blocks.
566 // Make a final pass over the basic blocks from theh old function to gathe
[all...] |
| LoopUnrollRuntime.cpp | 128 /// Create a clone of the blocks in a loop and connect them together.
306 // Get an ordered list of blocks in the loop to help with the ordering of the
307 // cloned blocks in the prolog code
312 // For each extra loop iteration, create a copy of the loop's basic blocks
320 // Clone all the basic blocks in the loop, but we don't clone the loop
326 // Insert the cloned blocks into function just before the original loop
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 121 /// The current mapping from old blocks to new blocks.
122 DenseMap<BasicBlock*, BasicBlock*> Blocks;
129 if (!Blocks.count(*I)) Count++;
136 /// predecessor blocks it has remaining.
149 /// A queue of unified blocks to process.
152 /// Try to unify the given two blocks. Enqueues them for processing
157 BasicBlock *&Ref = Blocks[L];
392 return Blocks[cast<BlockAddress>(L)->getBasicBlock()]
448 return Blocks[cast<BasicBlock>(L)] != R
[all...] |
| /external/open-vcdiff/src/ |
| blockhash.h | 138 // to incrementally populate individual blocks of data.
157 // the data blocks are hashed incrementally as the encoding position
174 // This function will be called to add blocks incrementally to the target hash
178 // BlockHash will only store hash entries for the evenly-aligned blocks.
193 // this function computes the hash value for each of the blocks in question
275 // hashed dictionary blocks:
306 // possible if, for example, all the blocks in the dictionary have
311 // of the number of source blocks), containing two loops that extend
377 // Compares each machine word of the two (possibly unaligned) blocks, rather
379 // executed. Returns a boolean (do the blocks match?) rather tha
[all...] |
| blockhash.cc | 184 // Add this entry at the end of the chain of matching blocks
262 // by comparing the blocks as series of (possibly unaligned) word values.
269 // of 32.) For blocks with identical contents (a common case), this method
282 // when the hash values of the two blocks match, it is very likely that either
283 // the blocks are identical, or else the first byte does not match.
389 // which is to say that most candidate blocks find no matches in the dictionary.
|
| /external/openssl/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 111 void aesni_cbc_sha1_enc (const void *inp, void *out, size_t blocks,
189 blocks; local
207 if (plen>(sha_off+iv) && (blocks=(plen-(sha_off+iv))/SHA_CBLOCK)) {
210 aesni_cbc_sha1_enc(in,out,blocks,&key->ks,
212 blocks *= SHA_CBLOCK;
213 aes_off += blocks;
214 sha_off += blocks;
215 key->md.Nh += blocks>>29;
216 key->md.Nl += blocks<<=3;
217 if (key->md.Nl<(unsigned int)blocks) key->md.Nh++
[all...] |
| /external/jpeg/ |
| jdcoefct.c | 40 * We allocate a workspace of D_MAX_BLOCKS_IN_MCU coefficient blocks,
45 * In multi-pass modes, this array points to the current MCU's blocks
187 * We skip dummy blocks at the right and bottom edges (but blkn gets
189 * allocated the MCU_buffer[] blocks sequentially.
309 // zero all blocks
312 /* Construct list of pointers to DCT blocks belonging to this MCU */
495 * blocks in the virtual buffer.
501 /* Get the list of pointers to DCT blocks in
609 /* Loop over all DCT blocks to be processed. */
637 * the DC values of a DCT block and its 8 neighboring blocks
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jdcoefct.c | 40 * We allocate a workspace of D_MAX_BLOCKS_IN_MCU coefficient blocks,
45 * In multi-pass modes, this array points to the current MCU's blocks
187 * We skip dummy blocks at the right and bottom edges (but blkn gets
189 * allocated the MCU_buffer[] blocks sequentially.
309 // zero all blocks
312 /* Construct list of pointers to DCT blocks belonging to this MCU */
495 * blocks in the virtual buffer.
501 /* Get the list of pointers to DCT blocks in
609 /* Loop over all DCT blocks to be processed. */
637 * the DC values of a DCT block and its 8 neighboring blocks
[all...] |
| /external/e2fsprogs/po/ |
| id.po | 86 msgid "while sanity checking the bad blocks inode"
90 msgid "while reading the bad blocks inode"
108 msgid "while reading in list of bad blocks from file"
168 msgid "Illegal number of blocks!\n"
368 msgid "<The bad blocks inode>"
520 msgid "reading indirect blocks of inode %u"
649 msgid "Clone multiply-claimed blocks"
650 msgstr "Kopi multiply-claimed blocks"
729 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
798 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\
[all...] |
| it.po | 84 msgid "while sanity checking the bad blocks inode"
88 msgid "while reading the bad blocks inode"
106 msgid "while reading in list of bad blocks from file"
168 msgid "Illegal number of blocks!\n"
370 msgid "<The bad blocks inode>"
505 msgid "reading indirect blocks of inode %u"
639 msgid "Clone multiply-claimed blocks"
720 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
789 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
790 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| nl.po | 86 msgid "while sanity checking the bad blocks inode"
90 msgid "while reading the bad blocks inode"
108 msgid "while reading in list of bad blocks from file"
168 msgid "Illegal number of blocks!\n"
369 msgid "<The bad blocks inode>"
521 msgid "reading indirect blocks of inode %u"
650 msgid "Clone multiply-claimed blocks"
730 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
799 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
800 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| pl.po | 83 msgid "while sanity checking the bad blocks inode"
87 msgid "while reading the bad blocks inode"
105 msgid "while reading in list of bad blocks from file"
165 msgid "Illegal number of blocks!\n"
365 msgid "<The bad blocks inode>"
517 msgid "reading indirect blocks of inode %u"
646 msgid "Clone multiply-claimed blocks"
726 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
796 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
797 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| sv.po | 85 msgid "while sanity checking the bad blocks inode"
89 msgid "while reading the bad blocks inode"
107 msgid "while reading in list of bad blocks from file"
167 msgid "Illegal number of blocks!\n"
383 msgid "<The bad blocks inode>"
535 msgid "reading indirect blocks of inode %u"
664 msgid "Clone multiply-claimed blocks"
744 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
814 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
815 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| vi.po | 84 msgid "while sanity checking the bad blocks inode"
88 msgid "while reading the bad blocks inode"
106 msgid "while reading in list of bad blocks from file"
167 msgid "Illegal number of blocks!\n"
371 msgid "<The bad blocks inode>"
523 msgid "reading indirect blocks of inode %u"
652 msgid "Clone multiply-claimed blocks"
732 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
800 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
801 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| ca.po | 83 msgid "while sanity checking the bad blocks inode"
87 msgid "while reading the bad blocks inode"
105 msgid "while reading in list of bad blocks from file"
167 msgid "Illegal number of blocks!\n"
371 msgid "<The bad blocks inode>"
509 msgid "reading indirect blocks of inode %u"
639 msgid "Clone multiply-claimed blocks"
720 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
790 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
791 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| /external/stressapptest/src/ |
| worker.cc | 899 int blocks = sat_->page_length() / blocksize; local
900 for (int currentblock = 0; currentblock < blocks; currentblock++) {
933 uint64 *memslice = memblock + blocks * blockwords;
937 blocks * blocksize, 0);
1196 int blocks = sat_->page_length() \/ blocksize; local
1292 int blocks = sat_->page_length() \/ blocksize; local
1315 int blocks = sat_->page_length() \/ blocksize; local
1340 int blocks = sat_->page_length() \/ blocksize; local
3066 int64 blocks = block->GetSize() \/ read_block_size_; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| SuballocatedIntVector.java | 45 /** Size of blocks to allocate */
51 /** The default number of blocks to (over)allocate by */
54 /** The number of blocks to (over)allocate by */
86 * of blocks. For efficiency, we will round the requested size
90 * @param numblocks Number of blocks to allocate
109 * the default number of blocks (32).
|
| /external/ceres-solver/include/ceres/ |
| covariance.h | 57 // blocks
112 // blocks. The computation assumes that the CostFunctions compute
135 // parameter blocks that are constant. This class correctly handles
360 // Even though the residual blocks in the problem may contain loss
375 // block-wise using pairs of parameter blocks. This allows the
377 // blocks.
|
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.cc | 183 // Add this entry at the end of the chain of matching blocks
261 // by comparing the blocks as series of (possibly unaligned) word values.
268 // of 32.) For blocks with identical contents (a common case), this method
281 // when the hash values of the two blocks match, it is very likely that either
282 // the blocks are identical, or else the first byte does not match.
388 // which is to say that most candidate blocks find no matches in the dictionary.
|
| /external/chromium_org/sdch/open-vcdiff/src/ |
| blockhash.cc | 184 // Add this entry at the end of the chain of matching blocks
262 // by comparing the blocks as series of (possibly unaligned) word values.
269 // of 32.) For blocks with identical contents (a common case), this method
282 // when the hash values of the two blocks match, it is very likely that either
283 // the blocks are identical, or else the first byte does not match.
389 // which is to say that most candidate blocks find no matches in the dictionary.
|
| /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/xvmc/ |
| surface.c | 90 mb->blocks = xvmc_blocks->blocks + xvmc_mb->index * BLOCK_SIZE_SAMPLES;
214 XvMCMacroBlockArray *macroblocks, XvMCBlockArray *blocks
250 assert(blocks);
253 assert(blocks->context_id == context->context_id);
300 xvmc_mb, blocks, mb, num_macroblocks);
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 35 /// enqueue - Add a block to the worklist. Blocks already on the
151 /// runOnCFG - Computes dataflow values for all blocks in a CFG.
210 // Enqueue all blocks to ensure the dataflow values are computed
211 // for every block. Not all blocks are guaranteed to reach the exit block.
217 // Enqueue all blocks to ensure the dataflow values are computed
218 // for every block. Not all blocks are guaranteed to reach the exit block.
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 41 // confine a CFG traversal to blocks in a specific loop.
239 // This is used to visit basic blocks in a method in reverse post order. This
261 std::vector<NodeType*> Blocks; // Block list in normal PO order
263 std::copy(po_begin(BB), po_end(BB), std::back_inserter(Blocks));
273 inline rpo_iterator begin() { return Blocks.rbegin(); }
274 inline rpo_iterator end() { return Blocks.rend(); }
|
| /external/mesa3d/src/gallium/state_trackers/xvmc/ |
| surface.c | 90 mb->blocks = xvmc_blocks->blocks + xvmc_mb->index * BLOCK_SIZE_SAMPLES;
214 XvMCMacroBlockArray *macroblocks, XvMCBlockArray *blocks
250 assert(blocks);
253 assert(blocks->context_id == context->context_id);
300 xvmc_mb, blocks, mb, num_macroblocks);
|
| /external/opencv/cv/src/ |
| cvoptflowbm.cpp | 45 Finds L1 norm between two blocks.
90 // blockSize, // size of basic blocks which are compared
126 /* if image sizes can't be divided by block sizes then right blocks will */
128 /* and bottom blocks will */
310 /* Calculate number of full blocks */
314 /* add 1 if not full border blocks exist */
|
