HomeSort by relevance Sort by last modified time
    Searched refs:block (Results 176 - 200 of 2292) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/valgrind/main/none/tests/x86/
bt_everything.c 147 UChar* block; local
153 block = calloc(200,1);
154 block += 100;
162 case 0: c = btsl_mem(block, bitoff); break;
163 case 1: c = btrl_mem(block, bitoff); break;
164 case 2: c = btcl_mem(block, bitoff); break;
165 case 3: c = btl_mem(block, bitoff); break;
172 block -= 100;
175 UChar ch = block[n];
176 /* printf("%d ", (int)block[n]); *
    [all...]
  /external/bzip2/
blocksort.c 3 /*--- Block sorting machinery ---*/
9 lossless, block-sorting data compression.
195 ((UChar*)eclass) [0 .. nblock-1] holds block
199 ((UChar*)eclass) [0 .. nblock-1] holds block
253 /*-- set sentinel bits for block-end detection --*/
316 Reconstruct the original block in
321 VPrintf0 ( " reconstructing block ...\n" );
349 UChar* block,
360 c1 = block[i1]; c2 = block[i2]
1034 UChar* block = s->block; local
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
BlockAddresses.java 27 * the blocks of a particular method. Each block has a corresponding
32 * block (indexed by basic block label) */
36 * of each basic block (indexed by basic block label) */
40 * final instruction) of each basic block (indexed by basic block
47 * @param method {@code non-null;} the method to have block addresses for
61 * Gets the instance for the start of the given block.
63 * @param block {@code non-null;} the block in questio
    [all...]
  /dalvik/dx/src/com/android/dx/dex/code/
BlockAddresses.java 27 * the blocks of a particular method. Each block has a corresponding
32 * block (indexed by basic block label) */
36 * of each basic block (indexed by basic block label) */
40 * final instruction) of each basic block (indexed by basic block
47 * @param method {@code non-null;} the method to have block addresses for
61 * Gets the instance for the start of the given block.
63 * @param block {@code non-null;} the block in questio
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_format_etc.c 29 struct etc1_block block; local
36 etc1_parse_block(&block, src);
43 etc1_fetch_texel(&block, i, j, tmp);
69 struct etc1_block block; local
74 etc1_parse_block(&block, src);
75 etc1_fetch_texel(&block, i, j, tmp);
  /external/chromium_org/v8/src/
hydrogen-redundant-phi.cc 38 HBasicBlock* block = blocks->at(i); local
39 for (int j = 0; j < block->phis()->length(); j++) {
40 all_phis.Add(block->phis()->at(j), zone());
58 void HRedundantPhiEliminationPhase::ProcessBlock(HBasicBlock* block) {
59 ProcessPhis(block->phis());
81 phi->block()->RemovePhi(phi);
hydrogen-environment-liveness.h 54 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live);
56 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live);
65 // Per-block data. All these lists are indexed by block_id.
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
BlockAddresses.java 27 * the blocks of a particular method. Each block has a corresponding
32 * block (indexed by basic block label) */
36 * of each basic block (indexed by basic block label) */
40 * final instruction) of each basic block (indexed by basic block
47 * @param method {@code non-null;} the method to have block addresses for
61 * Gets the instance for the start of the given block.
63 * @param block {@code non-null;} the block in questio
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_format_etc.c 29 struct etc1_block block; local
36 etc1_parse_block(&block, src);
43 etc1_fetch_texel(&block, i, j, tmp);
69 struct etc1_block block; local
74 etc1_parse_block(&block, src);
75 etc1_fetch_texel(&block, i, j, tmp);
  /external/chromium_org/third_party/icu/source/common/
utrie.c 83 /* preallocate and reset the first data block (block index 0) */
87 /* preallocate and reset the first block (number 0) and Latin-1 (U+0000..U+00ff) after that */
93 /* do this at least for trie->index[0] even if that block is only partly used for Latin-1 */
190 * @return -1 if no new data block available (out of memory in data array)
203 /* allocate a new data block */
211 /* copy-on-write for a block from a setRange() */
221 int32_t block; local
228 block=utrie_getDataBlock(trie, c);
229 if(block<0)
239 int32_t block; local
289 int32_t block, rest, repeatBlock; local
377 int32_t block, i; local
408 int32_t indexLength, block; local
562 int32_t block; local
937 uint16_t block; local
1064 int32_t l, i, j, block, prevBlock, nullBlock, offset; local
    [all...]
  /external/icu4c/common/
utrie.cpp 83 /* preallocate and reset the first data block (block index 0) */
87 /* preallocate and reset the first block (number 0) and Latin-1 (U+0000..U+00ff) after that */
93 /* do this at least for trie->index[0] even if that block is only partly used for Latin-1 */
190 * @return -1 if no new data block available (out of memory in data array)
203 /* allocate a new data block */
211 /* copy-on-write for a block from a setRange() */
221 int32_t block; local
228 block=utrie_getDataBlock(trie, c);
229 if(block<0)
239 int32_t block; local
289 int32_t block, rest, repeatBlock; local
377 int32_t block, i; local
408 int32_t indexLength, block; local
562 int32_t block; local
937 uint16_t block; local
1064 int32_t l, i, j, block, prevBlock, nullBlock, offset; local
    [all...]
  /external/chromium-trace/trace-viewer/src/tracing/tracks/
drawing_container.css 15 display: block;
  /external/chromium_org/chrome/browser/resources/file_manager/foreground/css/
list.css 9 display: block;
25 display: block;
29 display: inline-block;
50 display: block;
  /external/chromium_org/chrome/browser/resources/local_ntp/
most_visited_iframe.css 12 display: block;
  /external/chromium_org/chrome/browser/resources/options/
home_page_overlay.css 7 display: block;
  /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
SVGRootInlineBox.h 36 SVGRootInlineBox(RenderBlockFlow* block)
37 : RootInlineBox(block)
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_scene.h 111 * Include the first block of data statically to ensure we can always
200 * Grow the block list if needed.
206 struct data_block *block = list->head; local
209 assert(block != NULL);
212 debug_printf("alloc %u block %u/%u tot %u/%u\n",
213 size, block->used, DATA_BLOCK_SIZE,
216 if (block->used + size > DATA_BLOCK_SIZE) {
217 block = lp_scene_new_data_block( scene );
218 if (!block) {
225 ubyte *data = block->data + block->used
240 struct data_block *block = list->head; local
    [all...]
  /external/chromium_org/third_party/skia/include/core/
SkWriter32.h 30 * The caller can specify an initial block of storage, which the caller manages.
66 Block* block = fTail; local
67 if (NULL == block || block->available() < size) {
68 block = this->doReserve(size);
71 return block->alloc(size);
155 // if we could query how much is avail in the current block, we might
157 // in the current block
211 struct Block {
244 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
255 Block* block = this; local
    [all...]
  /external/chromium_org/ui/webui/resources/css/
bubble_button.css 7 display: inline-block;
  /external/libnfc-nci/src/hal/int/
nfc_hal_nv_co.h 86 void nfc_hal_nv_co_read (UINT8 *p_buf, UINT16 nbytes, UINT8 block);
106 void nfc_hal_nv_co_write (const UINT8 *p_buf, UINT16 nbytes, UINT8 block);
  /external/libnfc-nci/src/nfa/include/
nfa_nv_co.h 89 NFC_API extern void nfa_nv_co_read (UINT8 *p_buf, UINT16 nbytes, UINT8 block);
109 NFC_API extern void nfa_nv_co_write (const UINT8 *p_buf, UINT16 nbytes, UINT8 block);
  /external/markdown/markdown/extensions/
def_list.py 31 def test(self, parent, block):
32 return bool(self.RE.search(block))
35 block = blocks.pop(0)
36 m = self.RE.search(block)
37 terms = [l.strip() for l in block[:m.start()].split('\n') if l.strip()]
38 d, theRest = self.detab(block[m.end():])
82 def create_item(parent, block):
83 """ Create a new dd and parse the block with it as the parent. """
85 self.parser.parseBlocks(dd, [block])
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_scene.h 111 * Include the first block of data statically to ensure we can always
200 * Grow the block list if needed.
206 struct data_block *block = list->head; local
209 assert(block != NULL);
212 debug_printf("alloc %u block %u/%u tot %u/%u\n",
213 size, block->used, DATA_BLOCK_SIZE,
216 if (block->used + size > DATA_BLOCK_SIZE) {
217 block = lp_scene_new_data_block( scene );
218 if (!block) {
225 ubyte *data = block->data + block->used
240 struct data_block *block = list->head; local
    [all...]
  /external/skia/include/core/
SkWriter32.h 30 * The caller can specify an initial block of storage, which the caller manages.
66 Block* block = fTail; local
67 if (NULL == block || block->available() < size) {
68 block = this->doReserve(size);
71 return block->alloc(size);
155 // if we could query how much is avail in the current block, we might
157 // in the current block
211 struct Block {
244 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
255 Block* block = this; local
    [all...]
  /external/valgrind/main/memcheck/tests/
clo_redzone_128.stderr.exp 4 Address 0x........ is 69 bytes after a block of size 128 alloc'd

Completed in 351 milliseconds

1 2 3 4 5 6 78 91011>>