| /external/markdown/docs/ |
| writing_extensions.txt | 207 * **``blocks``**: A list of all remaining blocks of the document. Your run
212 of the ``blocks`` list for future parsing.
214 Please be aware that a single block can span multiple text blocks. For example,
279 Parses a chunk of markdown text composed of multiple blocks and attaches
280 those blocks to the ``parent`` Element. The ``parent`` is altered in place
284 * **``parseBlocks(parent, blocks)``**:
286 Parses a list of blocks of text and attaches those blocks to the ``parent``
289 blocks of text
[all...] |
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| pvmp3_stereo_proc.cpp | 291 * mixed blocks processing
317 * mixed blocks processing: intensity bound inside long blocks
319 /* 1. long blocks up to intensity border: not intensity */
347 /* 2. long blocks from intensity border up to sfb band 8: intensity */
370 /* 3. short blocks from sfbcnt to last sfb do intensity stereo */
391 * mixed blocks processing: intensity bound outside long blocks
396 * 2. short blocks from sfb band 3 up to intensity border: normal stereo, ms stereo and intensity
465 /* 1. long blocks up to sfb band 8: not intensity *
[all...] |
| /external/valgrind/main/exp-sgcheck/ |
| sg_main.c | 166 /* Hopefully the .base test hits most of the time. For the blocks
298 identical blocks are claimed to have different sizes. In which
317 /* This makes the blocks identical, at the size of the
322 stage will get rid of one of the blocks. This is
331 /* If there are any blocks which overlap and have the same
348 "overlapping stack blocks\n");
384 XArray* blocks = VG_(di_get_stack_blocks_at_ip)( ip, True/*arrays only*/ ); local
385 tl_assert(blocks);
386 return StackBlocks__find_and_dealloc__or_add( blocks );
559 overlapping stack blocks. *
1185 XArray* blocks; \/* XArray* of StackBlock, or NULL if none *\/ member in struct:__anon30808
[all...] |
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JITMemoryManager.cpp | 54 /// Allocated blocks have just this header, free'd blocks have FreeRangeHeader
104 /// Free blocks are kept on a circularly linked list.
109 /// getMinBlockSize - Get the minimum size for a memory block. Blocks
161 /// If possible, coalesce this block with neighboring blocks. Return the
203 // Link this into the linked list of free blocks.
229 // Don't allow blocks to be trimmed below minimum required size
300 // confuse them with the blocks of memory described above.
306 // Circular list of free blocks.
606 // The last three blocks are never deallocated or touched
[all...] |
| /system/core/toolbox/ |
| dd.c | 110 uint64_t cpy_cnt; /* # of blocks to copy */
357 /* Read errors count as full blocks. */
361 /* Handle full input blocks. */
366 /* Handle partial input blocks. */
419 /* If there are pending sparse blocks, make sure
458 * Write one or more blocks out. The common case is writing a full
583 * Seeking past the end of file can cause null blocks to be written to the
607 * blocks for other devices.
981 (st.swab == 1) ? "block" : "blocks");
987 (st.trunc == 1) ? "block" : "blocks");
[all...] |
| /external/ceres-solver/docs/source/ |
| solving.rst | 251 the way the parameter blocks interact that it is beneficial to modify
493 respectively. Further, let the camera blocks be of size :math:`c` and
494 the point blocks be of size :math:`s` (for most problems :math:`c` =
500 no term :math:`f_{i}` that includes two or more point blocks. This in
507 with :math:`p` blocks of size :math:`c\times c` and :math:`C \in
508 \mathbb{R}^{qs\times qs}` is a block diagonal matrix with :math:`q` blocks
522 a block diagonal matrix, with small diagonal blocks of size
524 inverting each of these blocks is cheap. This allows us to eliminate
539 symmetric positive definite matrix, with blocks of size :math:`c\times
724 blocks. Each parameter block belongs to exactly one group, and eac
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| compiler.py | 246 """Stop visiting at blocks."""
268 """Stop visiting a blocks."""
339 """Visiting stops at for blocks. However the block sequence
354 """Stop visiting at blocks."""
380 # a registry for all blocks. Because blocks are moved out
382 self.blocks = {}
641 functions. Those are currently macros and call blocks and in
775 # find all blocks
777 if block.name in self.blocks
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| debugallocation.cc | 121 "If greater than 0, keep freed blocks in a queue instead of "
123 "the total size of all blocks in the queue would otherwise exceed "
156 // A circular buffer to hold freed blocks of memory. MallocBlock::Deallocate
157 // (below) pushes blocks into this queue instead of returning them to the
190 // Maximum number of blocks kept in the free queue before being freed.
315 // A queue of freed blocks. Instead of releasing blocks to the allocator
317 // to keep the total size of all the freed blocks below the limit set by
321 static size_t free_queue_size_; // total size of blocks in free_queue_
557 // recently freed blocks. Free only enough blocks to keep fro
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| debugallocation.cc | 120 "If greater than 0, keep freed blocks in a queue instead of "
122 "the total size of all blocks in the queue would otherwise exceed "
158 // A circular buffer to hold freed blocks of memory. MallocBlock::Deallocate
159 // (below) pushes blocks into this queue instead of returning them to the
192 // Maximum number of blocks kept in the free queue before being freed.
317 // A queue of freed blocks. Instead of releasing blocks to the allocator
319 // to keep the total size of all the freed blocks below the limit set by
323 static size_t free_queue_size_; // total size of blocks in free_queue_
559 // recently freed blocks. Free only enough blocks to keep fro
[all...] |
| /external/bzip2/ |
| bzip2.1 | 267 compresses large files in blocks. The block size affects
340 compresses files in blocks, usually 900kbytes long. Each
344 recover data from the undamaged blocks in the file.
349 damaged blocks can be distinguished from undamaged ones.
353 blocks in .bz2 files, and write each block out into its own .bz2
364 "rec00002file.bz2", etc, containing the extracted blocks.
372 files, as these will contain many blocks. It is clearly
|
| bzip2.1.preformatted | 209 _b_z_i_p_2 compresses large files in blocks. The block size
285 _b_z_i_p_2 compresses files in blocks, usually 900kbytes long.
289 undamaged blocks in the file.
294 also carries its own 32?bit CRC, so damaged blocks can be
298 search for blocks in .bz2 files, and write each block out
306 the extracted blocks. The output filenames are
312 files, as these will contain many blocks. It is clearly
|
| bzip2.txt | 206 bzip2 compresses large files in blocks. The block size
282 bzip2 compresses files in blocks, usually 900kbytes long.
286 undamaged blocks in the file.
291 also carries its own 32-bit CRC, so damaged blocks can be
295 search for blocks in .bz2 files, and write each block out
303 the extracted blocks. The output filenames are
309 files, as these will contain many blocks. It is clearly
|
| /external/chromium_org/sync/internal_api/public/base/ |
| unique_position.cc | 388 // The compressed string is a series of blocks, almost all of which are 8 bytes
391 // full-length blocks are either repeated character blocks or plain data blocks.
392 // All blocks are entirely self-contained. Their decoded values are independent
428 // 1. Iterate through the input string and produce output blocks one at a time.
611 // any partial blocks. There's no way they could be invalid anyway.
|
| /external/chromium_org/third_party/freetype/src/base/ |
| ftdbgmem.c | 30 #define KEEPALIVE /* `Keep alive' means that freed blocks aren't released
62 FT_Long cur_blocks; /* current number of allocated blocks */
63 FT_Long max_blocks; /* max. number of allocated blocks */
64 FT_Long all_blocks; /* total number of blocks allocated */
86 * memory block. If KEEPALIVE is defined, blocks that are freed by
353 /* remove all blocks from the table, revealing leaked ones */
417 "FreeType: %ld bytes of memory leaked in %ld blocks\n",
|
| /external/chromium_org/third_party/libwebp/enc/ |
| vp8enci.h | 74 // The predicted blocks can be accessed using offsets to yuv_p_ and
76 // +----+ YUV Samples area. See VP8Scan[] for accessing the blocks.
138 // Layout of prediction blocks
144 // chroma 8x8, two U/V blocks side by side (hence: 16x8 each)
212 int nb_skip_; // number of skipped blocks
267 uint32_t nz; // non-zero blocks
283 uint8_t* preds_; // intra mode predictors (4x4 blocks)
|
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-jbd.h | 102 * Standard header for all descriptor blocks:
150 * The revoke descriptor: used on disk to describe a series of blocks to
178 __u32 s_maxlen; /* total blocks in journal file */
204 __u32 s_max_transaction; /* Limit of journal blocks per trans.*/
205 __u32 s_max_trans_data; /* Limit of data blocks per trans. */
523 /* Journal free: how many free blocks are there in the journal? */
583 /* The revoke table: maintains the list of revoked blocks in the
|
| /external/freetype/src/base/ |
| ftdbgmem.c | 30 #define KEEPALIVE /* `Keep alive' means that freed blocks aren't released
62 FT_Long cur_blocks; /* current number of allocated blocks */
63 FT_Long max_blocks; /* max. number of allocated blocks */
64 FT_Long all_blocks; /* total number of blocks allocated */
86 * memory block. If KEEPALIVE is defined, blocks that are freed by
353 /* remove all blocks from the table, revealing leaked ones */
417 "FreeType: %ld bytes of memory leaked in %ld blocks\n",
|
| /external/llvm/lib/CodeGen/ |
| PHIElimination.cpp | 65 /// in predecessor basic blocks.
147 // Eliminate PHI instructions by inserting copies into predecessor blocks.
179 /// predecessor basic blocks.
184 return false; // Quick exit for basic blocks without PHIs.
412 // really is dead at the PHI copy, there will be no successor blocks which
548 return false; // Quick exit for basic blocks without PHIs.
564 // out-of-line blocks into the loop which is very bad for code placement.
|
| /external/skia/tests/ |
| RoundRectTest.cpp | 294 // for the circle we expect 6 blocks to be out on the
310 // the corners (then the rest in) and no blocks out
330 // first 6 blocks out for NE (same as circle case)
334 // first 3 blocks out for SE (same as simple case)
336 // first two blocks out for S
338 // first 9 blocks out for SW
340 // first two blocks out for W (same as S)
|
| /external/webp/src/enc/ |
| vp8enci.h | 74 // The predicted blocks can be accessed using offsets to yuv_p_ and
76 // +----+ YUV Samples area. See VP8Scan[] for accessing the blocks.
138 // Layout of prediction blocks
144 // chroma 8x8, two U/V blocks side by side (hence: 16x8 each)
212 int nb_skip_; // number of skipped blocks
267 uint32_t nz; // non-zero blocks
283 uint8_t* preds_; // intra mode predictors (4x4 blocks)
|
| /frameworks/base/core/java/android/text/ |
| DynamicLayout.java | 368 * Create the initial block structure, cutting the text into blocks of at least
425 * It updates the internal block data structure. The text is split in blocks
427 * When a range of lines is edited, new blocks (from 0 to 3 depending on the
428 * overlap structure) will replace the set of overlapping blocks.
429 * Blocks are listed in order and are represented by their ending line number.
431 * this class simply invalidates the index of blocks overlapping a modification.
723 // The first index of the blocks whose locations are changed
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| tarfile.py | 68 BLOCKSIZE = 512 # length of processing blocks
270 blocks, remainder = divmod(length, BUFSIZE)
271 for b in xrange(blocks):
551 blocks, remainder = divmod(pos - self.pos, self.bufsize)
552 for i in xrange(blocks):
989 """Return a tar header as a string of 512 byte blocks.
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| tarfile.py | 68 BLOCKSIZE = 512 # length of processing blocks
270 blocks, remainder = divmod(length, BUFSIZE)
271 for b in xrange(blocks):
551 blocks, remainder = divmod(pos - self.pos, self.bufsize)
552 for i in xrange(blocks):
989 """Return a tar header as a string of 512 byte blocks.
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 45 /// getRoots - Return the root blocks of the current CFG. This may include
46 /// multiple blocks if we are computing post dominators. For forward
291 // If NewBB strictly dominates other blocks, then it is now the immediate
425 "Two blocks are not in same function");
505 /// dominate any other blocks. Removes node from its immediate dominator's
528 /// dominate any other blocks. Invalidates any node pointing to removed
742 /// getRoots - Return the root blocks of the current CFG. This may include
743 /// multiple blocks if we are computing post dominators. For forward
847 /// dominate any other blocks. Removes node from its immediate dominator's
|
| /external/stlport/src/ |
| allocators.cpp | 187 * allocator instances might exchange memory blocks making the implementation
255 // Header of blocks of memory that have been allocated as part of
282 // List of blocks of free memory
536 //We are going to add a small memory block to keep all the allocated blocks
587 // We couldn't satisfy it from the list of free blocks, get new memory.
602 // Not enough to put into list of free blocks, divvy it up here.
614 // Add node to list of available blocks and recursively allocate from it.
644 // Push excess memory allocated in this chunk into list of free memory blocks
670 // Clear the free blocks and all freelistst. This makes sure that if
[all...] |
