| /external/v8/src/crankshaft/ |
| hydrogen-redundant-phi.cc | 16 HBasicBlock* block = blocks->at(i); local
17 for (int j = 0; j < block->phis()->length(); j++) {
18 all_phis.Add(block->phis()->at(j), zone());
36 void HRedundantPhiEliminationPhase::ProcessBlock(HBasicBlock* block) {
37 ProcessPhis(block->phis());
59 phi->block()->RemovePhi(phi);
|
| /frameworks/base/libs/androidfw/tests/ |
| AppAsLib_test.cpp | 38 ssize_t block = table.getResource(app::R::integer::number1, &val); local
39 ASSERT_GE(block, 0);
57 ssize_t block = table.getResource(lib::R::integer::number1, &val); local
58 ASSERT_GE(block, 0);
76 ssize_t block = table.getResource(lib::R::integer::number1, &val); local
77 ASSERT_GE(block, 0);
|
| /libcore/ojluni/src/main/java/java/lang/ |
| CharSequence.java | 147 public void forEachRemaining(IntConsumer block) {
149 block.accept(charAt(cur));
182 public void forEachRemaining(IntConsumer block) {
189 block.accept(c1);
194 block.accept(Character.toCodePoint(c1, c2));
196 block.accept(c1);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/hfpclient/connserv/ |
| HfpClientConnectionService.java | 78 HfpClientDeviceBlock block = null;
79 if ((block = createBlockForDevice(device)) == null) {
80 Log.w(TAG, "Block already exists for device " + device + " ignoring.");
89 HfpClientDeviceBlock block = mDeviceBlocks.remove(device);
90 if (block == null) {
91 Log.w(TAG, "Disconnect for device but no block " + device);
94 block.cleanup();
95 // Block should be subsequently garbage collected
96 block = null;
103 HfpClientDeviceBlock block = findBlockForDevice(call.getDevice())
190 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
209 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
227 HfpClientDeviceBlock block = findBlockForHandle(connectionManagerAccount); local
255 HfpClientDeviceBlock block = findBlockForDevice(bd1); local
307 HfpClientDeviceBlock block = new HfpClientDeviceBlock(this, device, mHeadsetProfile); local
[all...] |
| /external/icu/icu4c/source/common/ |
| utrie.cpp | 85 /* preallocate and reset the first data block (block index 0) */
89 /* preallocate and reset the first block (number 0) and Latin-1 (U+0000..U+00ff) after that */
95 /* do this at least for trie->index[0] even if that block is only partly used for Latin-1 */
192 * @return -1 if no new data block available (out of memory in data array)
205 /* allocate a new data block */
213 /* copy-on-write for a block from a setRange() */
223 int32_t block; local
230 block=utrie_getDataBlock(trie, c);
231 if(block<0)
241 int32_t block; local
291 int32_t block, rest, repeatBlock; local
379 int32_t block, i; local
410 int32_t indexLength, block; local
564 int32_t block; local
939 uint16_t block; local
1066 int32_t l, i, j, block, prevBlock, nullBlock, offset; local
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 358 // Per-block GVN. Will also update the ValueSet of the dominated and
360 void VisitBasicBlock(HBasicBlock* block);
366 ValueSet* FindSetFor(HBasicBlock* block) const {
367 ValueSet* result = sets_[block->GetBlockId()];
368 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId();
372 void AbandonSetFor(HBasicBlock* block) {
373 DCHECK(sets_[block->GetBlockId()] != nullptr)
374 << "Block B" << block->GetBlockId() << " expected to have a set"
[all...] |
| gvn_test.cc | 40 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); local
41 graph->AddBlock(block);
42 entry->AddSuccessor(block);
44 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter,
53 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter,
62 HInstruction* to_remove = block->GetLastInstruction();
63 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter,
72 HInstruction* different_offset = block->GetLastInstruction();
74 block->AddInstruction(new (GetAllocator()) HInstanceFieldSet(parameter,
84 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter
121 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); local
201 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); local
[all...] |
| pretty_printer.h | 73 void VisitBasicBlock(HBasicBlock* block) OVERRIDE {
75 PrintInt(block->GetBlockId());
76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors();
85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors();
95 HGraphVisitor::VisitBasicBlock(block);
127 void VisitBasicBlock(HBasicBlock* block) OVERRIDE {
128 current_block_ = block;
129 HPrettyPrinter::VisitBasicBlock(block);
|
| /bionic/linker/ |
| linker_block_allocator.h | 49 void free(void* block);
54 LinkerBlockAllocatorPage* find_page(void* block);
|
| /external/e2fsprogs/lib/ext2fs/ |
| bmap.c | 2 * bmap.c --- logical to physical block mapping
32 blk_t block, blk_t *phys_blk);
136 char *block_buf, int bmap_flags, blk64_t block,
153 * Except for the logical block (lblk) that was passed in, search all
155 * If any such map exists, calculate the physical block that maps to
156 * the logical block and return that.
158 * The old code wouldn't even look if (block % cluster_ratio) == 0;
175 /* Try to map a logical block to an already-allocated physical cluster. */
206 char *block_buf, int bmap_flags, blk64_t block,
221 retval = ext2fs_extent_set_bmap(handle, block,
[all...] |
| /external/eigen/test/ |
| zerosized.cpp | 55 zeroReduction(m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols));
56 zeroReduction(m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0));
57 zeroReduction(m.template block<0,1>(0,0));
58 zeroReduction(m.template block<1,0>(0,0));
59 Matrix<Scalar,Dynamic,Dynamic> prod = m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0) * m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols);
62 prod = m.template block<1,0>(0,0) * m.template block<0,1>(0,0);
|
| /external/gptfdisk/ |
| crc32.cc | 27 /* chksum_crc() -- to a given block, this one calculates the
32 uint32_t chksum_crc32 (unsigned char *block, unsigned int length)
40 crc = ((crc >> 8) & 0x00FFFFFF) ^ crc_tab[(crc ^ *block++) & 0xFF];
|
| /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/compiler/nir/ |
| nir_lower_patch_vertices.c | 31 nir_foreach_block(block, function->impl) {
34 nir_foreach_instr_safe(instr, block) {
|
| nir_move_vec_src_uses_to_dest.c | 57 } else if (def->parent_instr->block == instr->block) {
60 return nir_block_dominates(def->parent_instr->block, instr->block);
65 move_vec_src_uses_to_dest_block(nir_block *block)
67 nir_foreach_instr(instr, block) {
185 nir_foreach_block(block, impl) {
186 move_vec_src_uses_to_dest_block(block);
|
| /external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
| ir3_depth.c | 132 ir3_insert_by_depth(instr, &instr->block->instr_list);
136 remove_unused_by_block(struct ir3_block *block)
138 list_for_each_entry_safe (struct ir3_instruction, instr, &block->instr_list, node) {
166 list_for_each_entry (struct ir3_block, block, &ir->block_list, node) {
167 if (block->condition)
168 ir3_instr_depth(block->condition);
172 list_for_each_entry (struct ir3_block, block, &ir->block_list, node) {
173 remove_unused_by_block(block);
|
| ir3_nir_lower_if_else.c | 62 valid_dest(nir_block *block, nir_dest *dest)
75 * successor or in the current block
79 if (dest_instr->block == block)
82 (dest_instr->block == block->successors[0]))
91 block_check_for_allowed_instrs(nir_block *block)
93 nir_foreach_instr(instr, block) {
114 * the end of the block w/ a phi..
128 if (!valid_dest(block, &tex->dest)
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene.h | 52 /* Commands per command block (ideally so sizeof(cmd_block) is a power of
57 /* Bytes per data block.
110 * Include the first block of data statically to ensure we can always
208 * Grow the block list if needed.
214 struct data_block *block = list->head; local
217 assert(block != NULL);
220 debug_printf("alloc %u block %u/%u tot %u/%u\n",
221 size, block->used, DATA_BLOCK_SIZE,
224 if (block->used + size > DATA_BLOCK_SIZE) {
225 block = lp_scene_new_data_block( scene )
248 struct data_block *block = list->head; local
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cmod_propagation.cpp | 52 opt_cmod_propagation_local(const gen_device_info *devinfo, bblock_t *block)
55 int ip = block->end_ip + 1;
57 foreach_inst_in_block_reverse_safe(fs_inst, inst, block) {
103 inst->remove(block);
128 inst->remove(block);
154 inst->remove(block);
175 foreach_block_reverse(block, cfg) {
176 progress = opt_cmod_propagation_local(devinfo, block) || progress;
|
| brw_predicated_break.cpp | 61 foreach_block (block, s->cfg) {
62 if (block->start_ip != block->end_ip)
68 backend_instruction *jump_inst = block->end();
73 backend_instruction *if_inst = block->prev()->end();
77 backend_instruction *endif_inst = block->next()->start();
81 bblock_t *jump_block = block;
114 block = earlier_block;
117 /* Now look at the first instruction of the block following the BREAK. If
|
| brw_vec4_cmod_propagation.cpp | 39 opt_cmod_propagation_local(bblock_t *block)
42 int ip = block->end_ip + 1;
44 foreach_inst_in_block_reverse_safe(vec4_instruction, inst, block) {
90 inst->remove(block);
115 inst->remove(block);
141 inst->remove(block);
162 foreach_block_reverse(block, cfg) {
163 progress = opt_cmod_propagation_local(block) || progress;
|
| /external/valgrind/helgrind/tests/ |
| annotate_hbefore.c | 95 UWord block[4] = { (UWord)addr, expected, nyu, 2 }; local
105 : /*in*/ "S"(&block[0])
108 assert(block[3] == 0 || block[3] == 1);
109 return block[3] & 1;
118 UWord block[4] = { (UWord)addr, expected, nyu, 2 }; local
130 : /*in*/ "S"(&block[0])
133 assert(block[3] == 0 || block[3] == 1);
134 return block[3] & 1
144 UWord block[2] = { (UWord)addr, nyu }; local
177 UWord block[2] = { (UWord)addr, nyu }; local
229 UWord block[3] = { (UWord)addr, nyu, expected}; local
262 UWord block[3] = { (UWord)addr, nyu, expected}; local
[all...] |
| /external/valgrind/memcheck/tests/ |
| clo_redzone_128.stderr.exp | 4 Address 0x........ is 69 bytes after a block of size 128 alloc'd
|
| /frameworks/av/media/libstagefright/mpeg2ts/ |
| HlsSampleDecryptor.cpp | 117 // encrypted_block: protected block uses 10% skip encryption
310 ALOGE("decryptBlock: size (%zu) not a multiple of block size", size);
321 AString HlsSampleDecryptor::aesBlockToStr(uint8_t block[AES_BLOCK_SIZE]) {
324 if (block == NULL) {
328 block[0], block[1], block[2], block[3], block[4], block[5], block[6], block[7]
[all...] |
| /frameworks/support/core/ktx/src/main/java/androidx/core/content/ |
| Context.kt | 42 * Executes [block] on a [TypedArray] receiver. The [TypedArray] holds the attribute
65 block: TypedArray.() -> Unit
67 obtainStyledAttributes(set, attrs, defStyleAttr, defStyleRes).apply(block).recycle()
71 * Executes [block] on a [TypedArray] receiver. The [TypedArray] holds the the values
82 block: TypedArray.() -> Unit
84 obtainStyledAttributes(resourceId, attrs).apply(block).recycle()
|
