Searched refs:blocks (Results 26 - 50 of 415) sorted by relevance

1234567891011>>

/external/lldb/test/lang/objc/blocks/
H A DMakefile3 OBJC_SOURCES := ivars-in-blocks.m main.m
/external/markdown/markdown/
H A Dblockparser.py38 """ 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/memcheck/tests/
H A Dlks.stderr.exp2 All heap blocks were freed -- no leaks are possible
5 definitely lost: 48 bytes in 3 blocks
6 indirectly lost: 32 bytes in 2 blocks
7 possibly lost: 0 bytes in 0 blocks
8 still reachable: 64 bytes in 4 blocks
9 suppressed: 96 bytes in 6 blocks
12 leaked: 80 bytes in 5 blocks
13 dubious: 0 bytes in 0 blocks
14 reachable: 64 bytes in 4 blocks
15 suppressed: 96 bytes in 6 blocks
[all...]
H A Dpointer-trace.stderr.exp1 1,000 bytes in 1 blocks are definitely lost in loss record ... of ...
H A Dstatic_malloc.stderr.exp1 10 bytes in 1 blocks are definitely lost in loss record ... of ...
/external/chromium_org/media/base/
H A Daudio_block_fifo.cc13 AudioBlockFifo::AudioBlockFifo(int channels, int frames, int blocks) argument
20 IncreaseCapacity(blocks);
88 void AudioBlockFifo::IncreaseCapacity(int blocks) { argument
89 DCHECK_GT(blocks, 0);
91 // Create |blocks| of audio buses and insert them to the containers.
92 audio_blocks_.reserve(audio_blocks_.size() + blocks);
95 for (int i = 0; i < blocks; ++i) {
107 // Update the write pointer if it is on top of the new inserted blocks.
109 write_block_ += blocks;
112 read_block_ += blocks;
[all...]
H A Daudio_block_fifo.h15 // The FIFO is composed of blocks of AudioBus elements, it accepts interleaved
21 // Creates a new AudioBlockFifo and allocates |blocks| memory, each block
23 AudioBlockFifo(int channels, int frames, int blocks);
48 // Dynamically increase |blocks| of memory to the FIFO.
49 void IncreaseCapacity(int blocks);
68 // Number of available blocks of memory to be consumed.
/external/chromium_org/v8/src/
H A Dhydrogen-redundant-phi.cc11 // Gather all phis from all blocks first.
12 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
13 ZoneList<HPhi*> all_phis(blocks->length(), zone());
14 for (int i = 0; i < blocks->length(); ++i) {
15 HBasicBlock* block = blocks->at(i);
26 for (int i = 0; i < blocks->length(); ++i) {
27 for (int j = 0; j < blocks->at(i)->phis()->length(); j++) {
28 DCHECK(blocks->at(i)->phis()->at(j)->GetRedundantReplacement() == NULL);
H A Dhydrogen-sce.cc16 for (int i = 0; i < graph()->blocks()->length(); i++) {
17 HBasicBlock* block = graph()->blocks()->at(i);
H A Dhydrogen-mark-deoptimize.cc45 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
46 for (int i = 0; i < blocks->length(); ++i) {
47 const HBasicBlock* block(blocks->at(i));
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Daes-cbc.c29 int i, j, blocks; local
36 blocks = data_len / AES_BLOCK_SIZE;
37 for (i = 0; i < blocks; i++) {
62 int i, j, blocks; local
69 blocks = data_len / AES_BLOCK_SIZE;
70 for (i = 0; i < blocks; i++) {
/external/wpa_supplicant_8/src/crypto/
H A Daes-cbc.c29 int i, j, blocks; local
36 blocks = data_len / AES_BLOCK_SIZE;
37 for (i = 0; i < blocks; i++) {
62 int i, j, blocks; local
69 blocks = data_len / AES_BLOCK_SIZE;
70 for (i = 0; i < blocks; i++) {
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Daes-cbc.c29 int i, j, blocks; local
36 blocks = data_len / AES_BLOCK_SIZE;
37 for (i = 0; i < blocks; i++) {
62 int i, j, blocks; local
69 blocks = data_len / AES_BLOCK_SIZE;
70 for (i = 0; i < blocks; i++) {
/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DRopMethod.java28 private final BasicBlockList blocks; field in class:RopMethod
41 * the labels for the blocks that return, if calculated
48 * @param blocks {@code non-null;} basic block list of the method
51 public RopMethod(BasicBlockList blocks, int firstLabel) { argument
52 if (blocks == null) {
53 throw new NullPointerException("blocks == null");
60 this.blocks = blocks;
73 return blocks;
130 RopMethod result = new RopMethod(blocks
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DRandom.h74 uint32_t * blocks = reinterpret_cast<uint32_t*>(blob); local
78 blocks[0] = rand_u32();
79 blocks++;
83 uint8_t * tail = reinterpret_cast<uint8_t*>(blocks);
101 uint32_t * blocks = (uint32_t*)blob; local
105 *blocks++ = rand_u32();
109 uint8_t * tail = (uint8_t*)blocks;
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_dense_matrix.cc42 const vector<int>& blocks) {
43 const int num_blocks = blocks.size();
48 num_rows_ += blocks[i];
61 // Assume that the user does not hold any locks on any cell blocks
79 // Assume that the user does not hold any locks on any cell blocks
41 BlockRandomAccessDenseMatrix( const vector<int>& blocks) argument
H A Dcompressed_col_sparse_matrix_utils.cc80 // be skipped like the rows in other row blocks too.
93 void BlockOrderingToScalarOrdering(const vector<int>& blocks, argument
96 CHECK_EQ(blocks.size(), block_ordering.size());
97 const int num_blocks = blocks.size();
103 cursor += blocks[i];
106 scalar_ordering->resize(block_starts.back() + blocks.back());
110 const int block_size = blocks[block_id];
/external/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_dense_alloc_test.cc34 IndexT blocks[N]; local
38 blocks[i] = idx;
45 IndexT idx = blocks[i];
/external/genext2fs/
H A Dtest-mount.sh34 # Usage: dtest-mount file-size number-of-blocks
36 size=$1; blocks=$2
38 dgen $size $blocks
47 pass dtest $size $blocks
54 # Usage: ftest-mount spec-file number-of-blocks
56 fname=$1; blocks=$2
58 fgen $fname $blocks
75 pass ftest $fname $blocks
H A Dtest-gen.lib9 # Usage: dgen file-size number-of-blocks
11 size=$1; blocks=$2
23 ./genext2fs -N 17 -b $blocks -d test -f -q ext2.img
28 # Usage: fgen spec-file number-of-blocks
30 fname=$1; blocks=$2;
34 ./genext2fs -N 92 -b $blocks -D test/$fname -f ext2.img
/external/valgrind/main/gdbserver_tests/
H A Dmcleak.stderr.exp5 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/chromium_org/third_party/boringssl/src/crypto/modes/
H A Dctr.c176 size_t blocks = len / 16; local
180 if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28))
181 blocks = (1U << 28);
185 * amount of blocks to the exact overflow point... */
186 ctr32 += (uint32_t)blocks;
187 if (ctr32 < blocks) {
188 blocks -= ctr32;
191 (*func)(in, out, blocks, key, ivec);
197 blocks *= 16;
198 len -= blocks;
[all...]
/external/openssl/crypto/modes/
H A Dctr128.c210 size_t blocks = len/16; local
216 if (sizeof(size_t)>sizeof(unsigned int) && blocks>(1U<<28))
217 blocks = (1U<<28);
222 * amount of blocks to the exact overflow point...
224 ctr32 += (u32)blocks;
225 if (ctr32 < blocks) {
226 blocks -= ctr32;
229 (*func)(in,out,blocks,key,ivec);
234 blocks *= 16;
235 len -= blocks;
[all...]
/external/openssl/crypto/evp/
H A De_rc4_hmac_md5.c81 MD5_CTX *ctx,const void *inp,size_t blocks);
123 blocks; local
137 if (plen>md5_off && (blocks=(plen-md5_off)/MD5_CBLOCK) &&
143 &key->md,in+md5_off,blocks);
144 blocks *= MD5_CBLOCK;
145 rc4_off += blocks;
146 md5_off += blocks;
147 key->md.Nh += blocks>>29;
148 key->md.Nl += blocks<<=3;
149 if (key->md.Nl<(unsigned int)blocks) ke
[all...]
/external/chromium_org/third_party/markdown/
H A Dblockparser.py72 """ Parse Markdown blocks into an ElementTree object.
102 blocks which will be split on blank lines, it could contain only one
112 def parseBlocks(self, parent, blocks):
113 """ Process blocks of markdown text and attach to given etree node.
115 Given a list of ``blocks``, each blockprocessor is stepped through
116 until there are no blocks left. While an extension could potentially
124 while blocks:
126 if processor.test(parent, blocks[0]):
127 if processor.run(parent, blocks) is not False:

Completed in 871 milliseconds

1234567891011>>