| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| pyassem.py | 15 self.blocks = misc.Set()
16 self.blocks.add(self.entry)
17 self.blocks.add(self.exit)
47 # for unreachable blocks. That doesn't appear to be very common
55 self.blocks.add(b)
77 """Return the blocks in reverse postorder
85 return self.blocks.elements()
99 """Order blocks so that they are emitted in the right order"""
104 # - all reachable blocks must be emitted
107 # Find all the blocks to be emitted
[all...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| BlockDumper.java | 51 /** whether or not to registerize (make rop blocks) */
77 * @param rop whether or not to registerize (make rop blocks)
298 BasicBlockList blocks = rmeth.getBlocks(); local
299 int[] order = blocks.getLabelsInOrder();
304 BasicBlock bb = blocks.get(blocks.indexOfLabel(label));
|
| /dalvik/vm/compiler/ |
| Utility.cpp | 58 * See if there are previously allocated arena blocks before the last
89 /* Reclaim all the arena blocks allocated so far */
178 ALOGD("%d blocks in total", cUnit->numBlocks);
247 ALOGD("Compiler arena uses %d blocks (%d bytes each)",
370 void dvmDumpBlockBitVector(const GrowableList *blocks, char *msg,
379 (BasicBlock *) dvmGrowableListGetElement(blocks, i);
|
| Frontend.cpp | 561 dvmGrowableListIteratorInit(&bottomBlock->successorBlockList.blocks,
727 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
757 dvmGrowableListIteratorInit(&bb->successorBlockList.blocks,
814 dvmGrowableListIteratorInit(&predBB->successorBlockList.blocks,
841 /* Identify code range in try blocks and set up the empty catch blocks */
857 /* Mark all the insn offsets in Try blocks */
869 /* Iterate over each of the handlers to enqueue the empty Catch blocks */
885 * Create dummy catch blocks first. Since these are created before
886 * other blocks are processed, "split" is specified as false
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/des/ |
| speed.c | 255 printf("Doing DES_cbc_encrypt on %ld byte blocks for 10 seconds\n",
259 printf("Doing DES_cbc_encrypt %ld times on %ld byte blocks\n",cc,
267 printf("%ld DES_cbc_encrypt's of %ld byte blocks in %.2f second\n",
272 printf("Doing DES_ede_cbc_encrypt on %ld byte blocks for 10 seconds\n",
276 printf("Doing DES_ede_cbc_encrypt %ld times on %ld byte blocks\n",cd,
288 printf("%ld DES_ede_cbc_encrypt's of %ld byte blocks in %.2f second\n",
|
| /external/icu4c/samples/ufortune/resources/ |
| root.txt | 62 "99 blocks of crud on the disk,
63 99 blocks of crud!
65 100 blocks of crud on the disk!
67 100 blocks of crud on the disk,
68 100 blocks of crud!
70 101 blocks of crud on the disk! ...",
|
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 12 // code into the preheader block, or by sinking code to the exit blocks if it is
126 /// SinkRegion - Walk the specified region of the CFG (defined by all blocks
135 /// blocks dominated by the specified block, and that are in the current
151 /// this function moves it to the exit blocks and patches up SSA form as
177 // Check to see if any of the basic blocks in CurLoop invalidate *V.
239 // Because subloops have already been incorporated into AST, we skip blocks in
245 if (LI->getLoopFor(BB) == L) // Ignore blocks in subloops.
298 /// SinkRegion - Walk the specified region of the CFG (defined by all blocks
311 // We are processing blocks in reverse dfo, so process children first.
334 // Check to see if we can sink this instruction to the exit blocks
[all...] |
| /external/openssl/crypto/des/ |
| speed.c | 255 printf("Doing DES_cbc_encrypt on %ld byte blocks for 10 seconds\n",
259 printf("Doing DES_cbc_encrypt %ld times on %ld byte blocks\n",cc,
267 printf("%ld DES_cbc_encrypt's of %ld byte blocks in %.2f second\n",
272 printf("Doing DES_ede_cbc_encrypt on %ld byte blocks for 10 seconds\n",
276 printf("Doing DES_ede_cbc_encrypt %ld times on %ld byte blocks\n",cd,
288 printf("%ld DES_ede_cbc_encrypt's of %ld byte blocks in %.2f second\n",
|
| /external/srec/portable/src/ |
| pmemory_ext.c | 97 /* maintain a static list of allocated blocks (didn't want to perform any dynamic allocation).
98 * This list can be scanned by PortMemScan() to determine if any allocated blocks
101 * allocated blocks are only freed at program termination, which sometimes doesn't happen.
125 /* AddToAllocList() : maintain an array of allocated blocks that can be
140 /* RemoveFromAllocList() : maintain an array of allocated blocks that can be
165 /* PortMemScan() : scan the array of allocated blocks, confirming that no
|
| /external/chromium_org/third_party/openssl/openssl/ssl/ |
| s3_cbc.c | 546 /* variance_blocks is the number of blocks of the hash that we have to
554 * say that the final two blocks can vary based on the padding.
557 * required to be minimal. Therefore we say that the final six blocks
561 * cannot be this many blocks then variance_blocks can be reduced. */
570 /* num_blocks is the maximum number of hash blocks. */
573 * the final blocks specially because the padding value could cause the
574 * end to appear somewhere in the final |variance_blocks| blocks and we
598 /* For SSLv3, if we're going to have any starting blocks then we need
668 /* We now process the final hash blocks. For each block, we construct
702 /* The final bytes of one of the blocks contains th
[all...] |
| /external/openssl/ssl/ |
| s3_cbc.c | 546 /* variance_blocks is the number of blocks of the hash that we have to
554 * say that the final two blocks can vary based on the padding.
557 * required to be minimal. Therefore we say that the final six blocks
561 * cannot be this many blocks then variance_blocks can be reduced. */
570 /* num_blocks is the maximum number of hash blocks. */
573 * the final blocks specially because the padding value could cause the
574 * end to appear somewhere in the final |variance_blocks| blocks and we
598 /* For SSLv3, if we're going to have any starting blocks then we need
668 /* We now process the final hash blocks. For each block, we construct
702 /* The final bytes of one of the blocks contains th
[all...] |
| /external/chromium/net/disk_cache/ |
| block_files.cc | 24 // type of entry that can be stored there (number of consecutive blocks).
27 // Returns the type of block (number of consecutive blocks that can be stored)
37 // target is the type of block to use (number of empty blocks), and size is the
38 // actual number of blocks to use.
165 // records. |block_count| is the number of blocks to allocate.
178 // this file yet so that it is easier to find empty blocks when we start
463 header->empty[3] = (new_size - header->max_entries) / 4; // 4 blocks entries
589 // We are interested in the total number of blocks used by this file type, and
590 // the max number of blocks that we can store (reported as the percentage of
591 // used blocks). In order to find out the number of used blocks, we have t
[all...] |
| /external/e2fsprogs/e2fsck/ |
| pass1b.c | 5 * only invoked if pass 1 discovered blocks which are in use by more
8 * Pass1B scans the data blocks of all the inodes again, generating a
9 * complete list of duplicate blocks and which inodes have claimed
17 * blocks, the user is prompted if s/he would like to clone the file
18 * (so that the file gets a fresh copy of the duplicated blocks) or
73 * is sharing blocks with other inodes. This information is collected
76 * of multiply-claimed blocks.
207 * Main procedure for handling duplicate blocks
254 * Scan the inodes looking for inodes that contain duplicate blocks.
361 * Pass 1c: Scan directories for inodes with duplicate blocks. Thi
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| inode.c | 111 errcode_t (*save_get_blocks)(ext2_filsys f, ext2_ino_t ino, blk_t *blocks);
266 * blocks in the inode table.
279 * bad blocks. :-)
287 * is no longer the case. If we run out of bad blocks, then
300 * (We could try to handle runs of bad blocks, but that
315 * read in, adjust the number of blocks to read so that we we
327 * read in more blocks from the current blockgroup's inode table.
335 * Figure out how many blocks to read; we read at most
337 * many blocks left to read.
452 * need to read in more blocks
[all...] |
| /external/grub/stage2/ |
| fsys_ext2fs.c | 46 * Constants relative to the data blocks, from ext2_fs.h
58 __u32 s_blocks_count; /* Blocks count */
59 __u32 s_r_blocks_count; /* Reserved blocks count */
60 __u32 s_free_blocks_count; /* Free blocks count */
65 __u32 s_blocks_per_group; /* # Blocks per group */
80 __u16 s_def_resuid; /* Default uid for reserved blocks */
81 __u16 s_def_resgid; /* Default gid for reserved blocks */
87 __u32 bg_block_bitmap; /* Blocks bitmap block */
90 __u16 bg_free_blocks_count; /* Free blocks count */
108 __u32 i_blocks; /* Blocks count *
[all...] |
| /external/libpcap/doc/ |
| pcap.html | 158 Experimental Blocks (deserved to a further investigation)<br />
160 Other Packet Blocks (experimental)<br />
170 Traffic Statistics and Monitoring Blocks (experimental)<br />
204 <p>A capture file is organized in blocks, that are appended one to another to form the file. All the blocks share a common format, which is shown in <a href="#formatblock">Figure 1</a>.
235 <p>This structure, shared among all blocks, makes easy to process a file and to skip unneeded or unknown blocks. Blocks can be nested one inside the others (NOTE: needed?). Some of the blocks are mandatory, i.e. a dump file is not valid if they are not present, other are optional.
237 <p>The structure of the blocks allows to define other blocks if needed. A parser that does non understand them can simply ignore (…)
[all...] |
| pcap.txt | 77 5. Experimental Blocks (deserved to a further investigation) . . 23
78 5.1 Other Packet Blocks (experimental) . . . . . . . . . . . . . . 23
83 5.6 Traffic Statistics and Monitoring Blocks (experimental) . . . 25
179 A capture file is organized in blocks, that are appended one to
180 another to form the file. All the blocks share a common format, which
214 This structure, shared among all blocks, makes easy to process a file
215 and to skip unneeded or unknown blocks. Blocks can be nested one
216 inside the others (NOTE: needed?). Some of the blocks are mandatory,
220 The structure of the blocks allows to define other blocks if needed
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
| r600_hw_context.c | 140 block->status |= R600_BLOCK_STATUS_DIRTY; /* dirty all blocks at start */
226 if (!range->blocks)
227 range->blocks = calloc(1 << HASH_SHIFT, sizeof(void *));
228 if (!range->blocks)
231 range->blocks[CTX_BLOCK_ID(reg[i + j].offset)] = block;
547 if (!ctx->range[i].blocks)
550 block = ctx->range[i].blocks[j];
554 range->blocks[CTX_BLOCK_ID(offset)] = NULL;
562 free(ctx->range[i].blocks);
565 free(ctx->blocks);
[all...] |
| /external/mesa3d/src/gallium/drivers/r600/ |
| r600_hw_context.c | 140 block->status |= R600_BLOCK_STATUS_DIRTY; /* dirty all blocks at start */
226 if (!range->blocks)
227 range->blocks = calloc(1 << HASH_SHIFT, sizeof(void *));
228 if (!range->blocks)
231 range->blocks[CTX_BLOCK_ID(reg[i + j].offset)] = block;
547 if (!ctx->range[i].blocks)
550 block = ctx->range[i].blocks[j];
554 range->blocks[CTX_BLOCK_ID(offset)] = NULL;
562 free(ctx->range[i].blocks);
565 free(ctx->blocks);
[all...] |
| /dalvik/vm/alloc/ |
| Copying.cpp | 57 * The block queue exists to thread lists of blocks from the various
68 * more contiguous blocks. Objects that are small enough to fit
71 * blocks. When half the available blocks are filled, a garbage
78 * scheme; blocks containing such objects are grayed (promoted) at the
153 * We use 512-byte blocks.
183 /* Total number of blocks available for allocation. */
194 * Base and limit blocks. Basically the shifted start address of
195 * the block. We convert blocks to a relative number when
294 * blocks
587 size_t aligned, available, blocks; local
[all...] |
| /external/llvm/docs/ |
| BitCodeFormat.rst | 49 * `Blocks`_, which define nested content.
140 A bitstream is a sequential series of `Blocks`_ and `Data Records`_. Both of
164 Blocks
167 Blocks in a bitstream denote nested regions of the stream, and are identified by
169 function bodies). Block IDs 0-7 are reserved for `standard blocks`_ whose
171 specific. Nested blocks capture the hierarchical structure of the data encoded
172 in it, and various properties are associated with blocks as the file is parsed.
173 Block definitions allow the reader to efficiently skip blocks in constant time
174 if the reader wants a summary of blocks, or if it wants to efficiently skip data
187 enclosing blocks see the abbreviation). Abbreviations can also be define
[all...] |
| /external/valgrind/main/exp-dhat/ |
| dh_main.c | 56 static ULong g_tot_blocks = 0; // total blocks allocated
59 static ULong g_cur_blocks_live = 0; // curr # blocks live
62 static ULong g_max_blocks_live = 0; // bytes and blocks at
67 //--- an Interval Tree of live blocks ---//
70 /* Tracks information about live blocks. */
86 /* May not contain zero-sized blocks. May not contain
87 overlapping blocks. */
91 to contain non-zero sized, non-overlapping blocks, it's good
177 // The current number of blocks and bytes live for this AP
180 // The number of blocks and bytes live at the max-livenes
[all...] |
| /art/compiler/dex/ |
| dataflow_iterator.h | 26 * This class supports iterating over lists of basic blocks in various
29 * auxiliary data associated with the basic blocks may be changed during the iteration,
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SetFactory.java | 51 * The total size of a bitset for this would be the count of blocks
62 * @param szBlocks {@code >=0;} count of basic blocks in method
|
| /developers/build/prebuilts/gradle/BorderlessButtons/BorderlessButtonsSample/src/main/java/com/example/android/borderlessbuttons/ |
| MainActivity.java | 35 * See <a href="http://developer.android.com/design/building-blocks/buttons.html#borderless">
40 "http://developer.android.com/design/building-blocks/buttons.html#borderless");
|
