| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| fntry1_1.cpp | 2 // Bug: g++ silently ignores function-try-blocks in templates.
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| fntry1_1.cpp | 2 // Bug: g++ silently ignores function-try-blocks in templates.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| dqblk_v1.h | 14 /* Numbers of blocks needed for updates */
|
| dqblk_v2.h | 13 /* Numbers of blocks needed for updates */
|
| efs_fs_sb.h | 38 __be32 fs_tfree; /* total free data blocks */
52 __u32 total_blocks; /* total number of blocks in filesystem */
53 __u32 group_size; /* # of blocks a group consists of */
54 __u32 data_free; /* # of free data blocks */
56 __u16 inode_blocks; /* # of blocks used for inodes in every grp */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_v1.h | 14 /* Numbers of blocks needed for updates */
|
| dqblk_v2.h | 13 /* Numbers of blocks needed for updates */
|
| efs_fs_sb.h | 38 __be32 fs_tfree; /* total free data blocks */
52 __u32 total_blocks; /* total number of blocks in filesystem */
53 __u32 group_size; /* # of blocks a group consists of */
54 __u32 data_free; /* # of free data blocks */
56 __u16 inode_blocks; /* # of blocks used for inodes in every grp */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_v1.h | 14 /* Numbers of blocks needed for updates */
|
| dqblk_v2.h | 13 /* Numbers of blocks needed for updates */
|
| efs_fs_sb.h | 38 __be32 fs_tfree; /* total free data blocks */
52 __u32 total_blocks; /* total number of blocks in filesystem */
53 __u32 group_size; /* # of blocks a group consists of */
54 __u32 data_free; /* # of free data blocks */
56 __u16 inode_blocks; /* # of blocks used for inodes in every grp */
|
| /sdk/emulator/qtools/ |
| post_trace.cpp | 28 // Count the number of static basic blocks and instructions.
48 // Allocate space for all of the static blocks
49 MyStaticRec *blocks = new MyStaticRec[num_static_bb]; local
51 // Read the static blocks again and save pointers to them
54 trace->ReadStatic(&blocks[ii].bb);
55 uint32_t num_insns = blocks[ii].bb.num_insns;
57 blocks[ii].insns = new uint32_t[num_insns];
58 trace->ReadStaticInsns(num_insns, blocks[ii].insns);
64 uint32_t num_insns = blocks[num_static_bb - 1].bb.num_insns;
65 uint32_t *insn_ptr = blocks[num_static_bb - 1].insns
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 46 while(pool->blocks) {
47 struct memory_block * block = pool->blocks;
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
63 pool->blocks = newblock;
90 block->next = pool->blocks;
91 pool->blocks = block;
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 46 while(pool->blocks) {
47 struct memory_block * block = pool->blocks;
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
63 pool->blocks = newblock;
90 block->next = pool->blocks;
91 pool->blocks = block;
|
| /external/llvm/test/CodeGen/SystemZ/Large/ |
| branch-range-02.py | 3 # RUN: python %s | llc -mtriple=s390x-linux-gnu -align-all-blocks=8 | FileCheck %s
19 # with N == 256 + 4. The -align-all-blocks=8 option ensures that all blocks
20 # are 256 bytes in size. The first 4 blocks and the last 4 blocks are then
39 # ...lots of other blocks...
59 blocks = 256 + 4 variable
67 for i in xrange(blocks):
70 next = 'b%d' % (i + 1) if i + 1 < blocks else 'end'
71 other = 'end' if 2 * i < blocks else 'b0
[all...] |
| /external/chromium_org/net/disk_cache/ |
| disk_format_base.h | 7 // A block file is a file designed to store blocks of data of a given size. It
8 // is able to store data that spans from one to four consecutive "blocks", and
9 // it grows as needed to store up to approximately 65000 blocks. It has a fixed
10 // size header used for book keeping such as tracking free of blocks on the
11 // file. For example, a block-file for 1KB blocks will grow from 8KB when
12 // totally empty to about 64MB when completely full. At that point, data blocks
14 // 65000 blocks. The first file contains the number of the second file, and the
37 // Bitmap to track used blocks on a block-file.
40 // A block-file is the file used to store information in blocks (could be
41 // EntryStore blocks, RankingsNode blocks or user-data blocks)
[all...] |
| /external/kernel-headers/original/linux/ |
| efs_fs_sb.h | 39 __be32 fs_tfree; /* total free data blocks */
53 __u32 total_blocks; /* total number of blocks in filesystem */
54 __u32 group_size; /* # of blocks a group consists of */
55 __u32 data_free; /* # of free data blocks */
57 __u16 inode_blocks; /* # of blocks used for inodes in every grp */
|
| /external/valgrind/main/memcheck/tests/ |
| leak-delta.stderr.exp | 2 10 bytes in 1 blocks are still reachable in loss record ... of ...
9 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
14 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
20 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ...
27 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
33 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ...
38 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ...
44 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ...
49 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ...
55 32 (+32) bytes in 1 (+1) blocks are definitely lost in loss record ... of ..
[all...] |
| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering.h | 46 // blocks of a problem so that it is suitable for use with Schur
48 // ordering of the parameter blocks and the return value is size of
57 // fixed blocks]
63 // blocks occur in the program.
68 // parameter blocks of a problem in a sequence of independent
69 // sets. The ordering covers all the non-constant parameter blocks in
74 // Builds a graph on the parameter blocks of a Problem, whose
77 // parameter blocks that are marked constant. An edge connects two
78 // parameter blocks, if they co-occur in a residual block.
|
| /external/chromium_org/v8/src/ |
| hydrogen-redundant-phi.cc | 34 // Gather all phis from all blocks first.
35 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
36 ZoneList<HPhi*> all_phis(blocks->length(), zone());
37 for (int i = 0; i < blocks->length(); ++i) {
38 HBasicBlock* block = blocks->at(i);
49 for (int i = 0; i < blocks->length(); ++i) {
50 for (int j = 0; j < blocks->at(i)->phis()->length(); j++) {
51 ASSERT(blocks->at(i)->phis()->at(j)->GetRedundantReplacement() == NULL);
|
| /external/e2fsprogs/e2fsck/ |
| badblocks.c | 2 * badblocks.c --- replace/append bad blocks to the bad block inode
39 * illegal blocks, clear them.
45 _("while sanity checking the bad blocks inode"));
50 * If we're appending to the bad blocks inode, read in the
51 * current bad blocks.
57 _("while reading the bad blocks inode"));
63 * Now read in the bad blocks from the file; if
93 _("while reading in list of bad blocks from file"));
98 * Finally, update the bad blocks from the bad_block_map
|
| /external/e2fsprogs/tests/ |
| README | 38 badbblocks.img Filesystem with illegal blocks in the bad block inode.
43 badtable.img Filesystem with blocks shared between the bitmaps and
44 inode table blocks and the bad block inode
45 bbfile.img Filesystem with files containing bad blocks
48 dup.img Filesystem with blocks claimed by two different files
49 dup2.img Filesystem with blocks claimed by three different files
50 dupfsblks.img Filesystem with blocks claimed by a file and
52 dupsuper.img Filesystem with blocks claimed by a file and
63 okgroup.img Filesystem that's exactly 8193 blocks long
|
| /external/markdown/markdown/ |
| blockparser.py | 38 """ Parse Markdown blocks into an ElementTree object.
67 blocks which will be split on blank lines, it could contain only one
77 def parseBlocks(self, parent, blocks):
78 """ Process blocks of markdown text and attach to given etree node.
80 Given a list of ``blocks``, each blockprocessor is stepped through
81 until there are no blocks left. While an extension could potentially
89 while blocks:
91 if processor.test(parent, blocks[0]):
92 processor.run(parent, blocks)
|
| /external/valgrind/main/gdbserver_tests/ |
| mcleak.stderr.exp | 5 10 bytes in 1 blocks are still reachable in loss record ... of ...
19 leaked: 32 bytes in 1 blocks
20 dubious: 0 bytes in 0 blocks
21 reachable: 64 bytes in 3 blocks
22 suppressed: 0 bytes in 0 blocks
23 10 bytes in 1 blocks are still reachable in loss record ... of ...
28 21 bytes in 1 blocks are still reachable in loss record ... of ...
33 32 bytes in 1 blocks are definitely lost in loss record ... of ...
38 33 bytes in 1 blocks are still reachable in loss record ... of ...
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_internal-cipher.c | 106 size_t i, j, blocks; local
119 blocks = len / AES_BLOCK_SIZE;
120 for (i = 0; i < blocks; i++) {
133 blocks = len / 8;
134 for (i = 0; i < blocks; i++) {
147 blocks = len / 8;
148 for (i = 0; i < blocks; i++) {
169 size_t i, j, blocks; local
183 blocks = len / AES_BLOCK_SIZE;
184 for (i = 0; i < blocks; i++)
[all...] |
