| /external/chromium_org/third_party/icu/source/common/ |
| utrie.c | 90 /* set indexes to point to consecutive data blocks */
99 /* reset the initially allocated blocks to the initial value */
285 * mark index values for repeat-data blocks by setting bit 31 of the index values
329 /* iterate over all-value blocks */
449 * Later all folded index blocks are moved up one to insert the copied
538 * utrie_compact() will remove data blocks that are not used at all.
579 * - removes blocks that are identical with earlier ones
580 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
581 * - moves blocks in steps of the data granularity
582 * - moves and overlaps blocks that overlap with multiple values in the overlap regio
[all...] |
| /external/icu4c/common/ |
| utrie.cpp | 90 /* set indexes to point to consecutive data blocks */
99 /* reset the initially allocated blocks to the initial value */
285 * mark index values for repeat-data blocks by setting bit 31 of the index values
329 /* iterate over all-value blocks */
449 * Later all folded index blocks are moved up one to insert the copied
538 * utrie_compact() will remove data blocks that are not used at all.
579 * - removes blocks that are identical with earlier ones
580 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
581 * - moves blocks in steps of the data granularity
582 * - moves and overlaps blocks that overlap with multiple values in the overlap regio
[all...] |
| /external/jpeg/ |
| transupp.c | 77 /* Horizontal mirroring of DCT blocks is accomplished by swapping
78 * pairs of blocks in-place. Within a DCT block, we perform horizontal
151 /* Bottom-edge blocks will be copied verbatim. */
200 * process all the available DCT blocks for every component.
279 /* Edge blocks are transposed but not mirrored. */
343 /* Edge blocks are transposed but not mirrored. */
403 /* Process the blocks that can be mirrored both ways. */
420 /* Any remaining right-edge blocks are only mirrored vertically. */
435 /* Process the blocks that can be mirrored. */
444 /* Any remaining right-edge blocks are only copied. *
[all...] |
| usage.doc | 155 N MCU blocks if "B" is attached to the number.
428 N MCU blocks if "B" is attached to the number.
446 transform complete blocks of DCT coefficient data in the desired way.
462 -trim Drop non-transformable edge blocks.
481 markers, such as comment blocks:
505 The JPEG standard allows "comment" (COM) blocks to occur within a JPEG file.
506 Although the standard doesn't actually define what COM blocks are for, they
509 them as text. COM blocks do not interfere with the image stored in the JPEG
514 blocks to a JPEG file.
516 rdjpgcom searches a JPEG file and prints the contents of any COM blocks o
[all...] |
| /external/llvm/docs/tutorial/ |
| LangImpl5.rst | 218 to either the "then" or "else" blocks, which contain the expressions for
221 Once the then/else blocks are finished executing, they both branch back
287 // Create blocks for the then and else cases. Insert the 'then' block at the
295 This code creates the basic blocks that are related to the if/then/else
296 statement, and correspond directly to the blocks in the example above.
302 Once it has that, it creates three blocks. Note that it passes
305 specified function. The other two blocks are created, but aren't yet
308 Once the blocks are created, we can emit the conditional branch that
309 chooses between them. Note that creating new blocks does not implicitly
337 important) aspect of the LLVM IR is that it `requires all basic blocks
[all...] |
| /external/llvm/lib/CodeGen/ |
| EarlyIfConversion.cpp | 76 // Instructions in the conditional blocks TBB and/or FBB are spliced into the
125 /// Instructions in Head that define values used by the conditional blocks.
129 /// Register units clobbered by the conditional blocks.
169 /// it is possible. Add any erased blocks to RemovedBlocks.
451 /// blocks.
505 /// Any basic blocks erased will be added to RemovedBlocks.
542 // Erase the now empty conditional blocks. It is likely that Head can fall
543 // through to Tail, and we can join the two blocks.
628 /// Update the dominator tree after if-conversion erased some blocks.
631 // TBB and FBB should not dominate any blocks
[all...] |
| ShrinkWrapping.cpp | 27 // which basic blocks require spills and restores for CSRs.
177 /// the entry block, all restores in return blocks. In this case,
323 /// propagateUsesAroundLoop - copy used register info from MBB to all blocks
353 /// 4. all CSRs are used in a subset of blocks, each of which dominates
354 /// all return blocks. These blocks, taken as a subgraph of the MCFG,
371 // Save refs to entry and return blocks.
630 /// level loops to the exit blocks of those loops.
652 assert(exitBlocks.size() > 0 && "Loop has no top level exit blocks?");
672 /// of changes to spilled reg sets. Add MBB to the set of blocks
[all...] |
| SplitKit.h | 50 /// Additional information about basic blocks where the current variable is
64 /// Live-through blocks without any uses don't get BlockInfo entries. They
95 /// UseBlocks - Blocks where CurLI has uses.
98 /// NumGapBlocks - Number of duplicate entries in UseBlocks for blocks where
105 /// NumThroughBlocks - Number of live-through blocks.
163 /// getUseBlocks - Return an array of BlockInfo objects for the basic blocks
167 /// getNumThroughBlocks - Return the number of through blocks.
173 /// getThroughBlocks - Return the set of through blocks.
176 /// getNumLiveBlocks - Return the number of blocks where CurLI is live.
181 /// countLiveBlocks - Return the number of blocks where li is live. This i
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| transupp.c | 77 /* Horizontal mirroring of DCT blocks is accomplished by swapping
78 * pairs of blocks in-place. Within a DCT block, we perform horizontal
151 /* Bottom-edge blocks will be copied verbatim. */
200 * process all the available DCT blocks for every component.
279 /* Edge blocks are transposed but not mirrored. */
343 /* Edge blocks are transposed but not mirrored. */
403 /* Process the blocks that can be mirrored both ways. */
420 /* Any remaining right-edge blocks are only mirrored vertically. */
435 /* Process the blocks that can be mirrored. */
444 /* Any remaining right-edge blocks are only copied. *
[all...] |
| usage.doc | 155 N MCU blocks if "B" is attached to the number.
428 N MCU blocks if "B" is attached to the number.
446 transform complete blocks of DCT coefficient data in the desired way.
462 -trim Drop non-transformable edge blocks.
481 markers, such as comment blocks:
505 The JPEG standard allows "comment" (COM) blocks to occur within a JPEG file.
506 Although the standard doesn't actually define what COM blocks are for, they
509 them as text. COM blocks do not interfere with the image stored in the JPEG
514 blocks to a JPEG file.
516 rdjpgcom searches a JPEG file and prints the contents of any COM blocks o
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlTree.java | 34 * well-formed blocks of text, for quote detection.
314 // Creating well-formed blocks within the html tree.
332 * Creates a list of Blocks, given a text-range.
333 * We may create multiple blocks if one single well-formed Block cannot be
344 ArrayList<Block> blocks = new ArrayList<Block>(); local
355 // Split up the block [start, end) into one or more blocks that
384 // or more blocks because the current node cannot be included
393 blocks.add(b);
404 blocks.add(b);
408 for (int i = 0; i < blocks.size(); i++)
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 35 * well-formed blocks of text, for quote detection.
347 // Creating well-formed blocks within the html tree.
365 * Creates a list of Blocks, given a text-range.
366 * We may create multiple blocks if one single well-formed Block cannot be
377 ArrayList<Block> blocks = new ArrayList<Block>(); local
388 // Split up the block [start, end) into one or more blocks that
417 // or more blocks because the current node cannot be included
426 blocks.add(b);
437 blocks.add(b);
441 for (int i = 0; i < blocks.size(); i++)
[all...] |
| /external/llvm/tools/bugpoint/ |
| Miscompilation.cpp | 43 cl::desc("Don't extract blocks when searching for miscompilations"),
494 /// TestFuncs - Extract all blocks for the miscompiled functions except for the
495 /// specified blocks. If the problem still exists, return true.
503 outs() << "but these " << BBs.size() << " blocks are extracted: ";
508 outs() << "blocks are extracted.";
551 /// extract as many basic blocks from the region as possible without obscuring
561 std::vector<BasicBlock*> Blocks;
565 Blocks.push_back(I);
567 // Use the list reducer to identify blocks that can be extracted without
568 // obscuring the bug. The Blocks list will end up containing blocks that mus
[all...] |
| /external/e2fsprogs/po/ |
| cs.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"
368 msgid "<The bad blocks inode>"
525 msgid "reading indirect blocks of inode %u"
654 msgid "Clone multiply-claimed blocks"
734 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
803 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
804 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| fr.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"
169 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"
802 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
803 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| es.po | 96 msgid "while sanity checking the bad blocks inode"
104 msgid "while reading the bad blocks inode"
122 msgid "while reading in list of bad blocks from file"
186 msgid "Illegal number of blocks!\n"
398 msgid "<The bad blocks inode>"
530 msgid "reading indirect blocks of inode %u"
666 msgid "Clone multiply-claimed blocks"
746 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
819 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
820 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| de.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"
118 "Warnung: Nicht zulässiger Block %u im »Bad Blocks«-Inode gefunden! "
169 msgid "Illegal number of blocks!\n"
369 msgid "<The bad blocks inode>"
370 msgstr "<Der »Bad Blocks«-Inode>"
521 msgid "reading indirect blocks of inode %u"
530 msgstr "Inode in »Bad Blocks«-Liste"
650 msgid "Clone multiply-claimed blocks"
[all...] |
| tr.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"
366 msgid "<The bad blocks inode>"
503 msgid "reading indirect blocks of inode %u"
635 msgid "Clone multiply-claimed blocks"
715 msgid "MULTIPLY-CLAIMED BLOCKS CLONED"
785 #. @-expanded: The filesystem size (according to the superblock) is %b blocks\n
786 #. @-expanded: The physical size of the device is %c blocks\
[all...] |
| /external/e2fsprogs/e2fsck/ |
| problem.c | 64 N_("Clone multiply-claimed blocks"), /* 14 */
92 N_("MULTIPLY-CLAIMED BLOCKS CLONED"), /* 14 */
159 N_("Note: if several inode or block bitmap blocks or part\n"
314 /* Backup journal inode blocks */
319 /* Reserved blocks w/o resize_inode */
407 /* Pass 1: Checking inodes, blocks, and sizes */
486 /* Inode has illegal blocks (latch question) */
491 /* Too many bad blocks in inode */
501 /* Bad block inode has illegal blocks (latch question) */
506 /* Duplicate or bad blocks in use! *
[all...] |
| /external/libpcap/ |
| optimize.c | 147 struct block **blocks; variable in typeref:struct:block
[all...] |
| /external/chromium/sdch/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...] |
| /external/chromium_org/sdch/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...] |
| /external/chromium_org/third_party/openssl/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/chromium_org/v8/src/ |
| hydrogen-gvn.cc | 369 block_side_effects_(graph->blocks()->length(), zone()),
370 loop_side_effects_(graph->blocks()->length(), zone()),
371 visited_on_paths_(graph->blocks()->length(), zone()) {
373 block_side_effects_.AddBlock(GVNFlagSet(), graph->blocks()->length(),
375 loop_side_effects_.AddBlock(GVNFlagSet(), graph->blocks()->length(),
396 for (int i = graph()->blocks()->length() - 1; i >= 0; --i) {
398 HBasicBlock* block = graph()->blocks()->at(i);
517 for (int i = graph()->blocks()->length() - 1; i >= 0; --i) {
518 HBasicBlock* block = graph()->blocks()->at(i);
529 ProcessLoopBlock(graph()->blocks()->at(j), block, side_effects
[all...] |
| /external/libvpx/libvpx/vp8/common/x86/ |
| idctllm_sse2.asm | 82 ; store blocks back out
115 ; special case when 2 blocks have 0 or 1 coeffs
311 ; Load up predict blocks
338 ; store blocks back out
370 ; special case when 2 blocks have 0 or 1 coeffs
385 ; Load up predict blocks
417 ; store blocks back out
447 ; special case when 2 blocks have 0 or 1 coeffs
648 ; Load up predict blocks
681 ; store blocks back ou
[all...] |
