| /external/mesa3d/src/compiler/nir/ |
| nir_repair_ssa.c | 63 return src->parent_instr->block;
74 if (!nir_block_dominates(def->parent_instr->block, get_src_block(src))) {
85 BITSET_SET(state->def_set, def->parent_instr->block->index);
91 nir_phi_builder_value_set_block_def(val, def->parent_instr->block, def);
95 if (!nir_block_dominates(def->parent_instr->block, src_block)) {
116 nir_foreach_block(block, impl) {
117 nir_foreach_instr_safe(instr, block) {
|
| nir_opt_conditional_discard.c | 33 nir_opt_conditional_discard_block(nir_builder *b, nir_block *block)
35 if (nir_cf_node_is_first(&block->cf_node))
38 nir_cf_node *prev_node = nir_cf_node_prev(&block->cf_node);
46 /* check there is only one else block and it is empty */
52 /* check there is only one then block and it has only one instruction in it */
75 /* Get the first instruction in the then block and confirm it is
118 nir_foreach_block_safe(block, function->impl) {
119 progress |= nir_opt_conditional_discard_block(&builder, block);
|
| nir_opt_remove_phis.c | 60 * instruction. b can't be another phi node in the same block, since the only
61 * time when phi nodes can source other phi nodes defined in the same block is
67 remove_phis_block(nir_block *block, nir_builder *b)
71 nir_foreach_instr_safe(instr, block) {
126 b->cursor = nir_after_phis(block);
149 nir_foreach_block(block, impl) {
150 progress |= remove_phis_block(block, &bld);
|
| nir_opt_trivial_continues.c | 36 lower_trivial_continues_block(nir_block *block, nir_loop *loop)
39 nir_instr *first_instr = nir_block_first_instr(block);
41 /* The block contains only a continue if anything */
42 nir_cf_node *prev_node = nir_cf_node_prev(&block->cf_node);
53 * calls above shouldn't be adding instructions to this block since it
56 first_instr = nir_block_first_instr(block);
60 nir_instr *last_instr = nir_block_last_instr(block);
64 /* We're at the end of a block that goes straight through to the end of the
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene.c | 73 /* We'll need at least one command block per bin. Make sure that's
77 /* We'll also need space for at least one other data block */
281 struct data_block *block, *tmp; local
283 for (block = list->head->next; block; block = tmp) {
284 tmp = block->next;
285 FREE(block);
312 struct cmd_block *block = lp_scene_alloc(scene, sizeof(struct cmd_block)); local
313 if (block) {
339 struct data_block *block = MALLOC_STRUCT(data_block); local
362 const struct data_block *block; local
[all...] |
| /external/swiftshader/src/Common/ |
| Memory.cpp | 63 unsigned char *block; member in struct:sw::Allocation
68 unsigned char *block = new unsigned char[bytes + sizeof(Allocation) + alignment]; local
71 if(block)
73 aligned = (unsigned char*)((uintptr_t)(block + sizeof(Allocation) + alignment - 1) & -(intptr_t)alignment);
77 allocation->block = block;
102 delete[] allocation->block;
|
| /external/tensorflow/tensorflow/contrib/eager/python/examples/resnet50/ |
| resnet50.py | 34 """_IdentityBlock is the block that has no conv layer at shortcut.
40 block: 'a','b'..., current block label, used for generating layer names
45 def __init__(self, kernel_size, filters, stage, block, data_format):
49 conv_name_base = 'res' + str(stage) + block + '_branch'
50 bn_name_base = 'bn' + str(stage) + block + '_branch'
96 """_ConvBlock is the block that has a conv layer at shortcut.
102 block: 'a','b'..., current block label, used for generating layer names
114 block,
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| critical.go | 7 // critical splits critical edges (those that go from a block with
8 // more than one outedge to a block with more than one inedge).
11 // maps from phi arg ID to the new block created for that argument
12 blocks := make([]*Block, f.NumValues())
23 // block, this is easier to handle than the general
24 // case of a block with multiple phi values.
35 // reset our block map
49 continue // only single output block
52 var d *Block // new block used to remove critical edg
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| critical.go | 7 // critical splits critical edges (those that go from a block with
8 // more than one outedge to a block with more than one inedge).
11 // maps from phi arg ID to the new block created for that argument
12 blocks := make([]*Block, f.NumValues())
23 // block, this is easier to handle than the general
24 // case of a block with multiple phi values.
35 // reset our block map
49 continue // only single output block
52 var d *Block // new block used to remove critical edg
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/val/ |
| basic_block.cpp | 56 for (auto& block : next_blocks) {
57 block->predecessors_.push_back(this);
58 successors_.push_back(block);
59 if (block->reachable_ == false) block->set_reachable(reachable_);
83 const BasicBlock* block,
85 : current_(block), dom_func_(dominator_func) {}
|
| /external/boringssl/src/crypto/fipsmodule/modes/ |
| cbc.c | 57 block128_f block) {
71 (*block)(out, out, key);
82 (*block)(out, out, key);
97 (*block)(out, out, key);
112 block128_f block) {
129 // is no need to decrypt to a temporary block.
136 (*block)(in, out, key);
147 (*block)(in, out, key);
159 // |out| is less than two blocks behind |in|. Decrypting an input block
160 // directly to |out| would overwrite a ciphertext block before it is used a
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| tst_iscan.c | 39 static void iscan_test_read_blk64(unsigned long long block, int count, errcode_t err)
49 printf("%llu-%llu", block, block+count-1);
51 printf("%llu", block);
53 for (i=0; i < count; i++, block++) {
54 if (ext2fs_test_block_bitmap2(touched_map, block)) {
55 printf("\nDuplicate block?!? --- %llu\n", block);
59 ext2fs_mark_block_bitmap2(touched_map, block);
63 static void iscan_test_read_blk(unsigned long block, int count, errcode_t err
[all...] |
| /external/tensorflow/tensorflow/core/lib/core/ |
| arena.cc | 71 // satisfying alignment without exhausting the current block.
96 // There is no guarantee the first block is properly aligned, so
106 // (though GetMemory() can also make a new block for really big
111 AllocatedBlock* block = AllocNewBlock(block_size_, alignment); local
112 freestart_ = block->mem;
113 remaining_ = block->size;
137 AllocatedBlock* block; local
138 // Find the next block.
141 block = &first_blocks_[blocks_alloced_++];
145 // Adds another block to the vector
[all...] |
| /external/capstone/windows/ |
| winkernel_mm.c | 38 CS_WINKERNEL_MEMBLOCK *block = NULL; local
45 block = (CS_WINKERNEL_MEMBLOCK *)ExAllocatePoolWithTag(
47 if (!block) {
50 block->size = size;
52 return block->data;
|
| /external/eigen/doc/ |
| tutorial.cpp | 19 // demo fixed-size block() expression as lvalue and as rvalue
20 m4.block<3,3>(0,1) = m3;
21 m3.row(2) = m4.block<1,3>(2,0);
25 // demo dynamic-size block()
28 m4.block(0,1,3,3).setIdentity();
33 m4.diagonal().block(1,2).setOnes();
55 m3 = m3 * m4.block<3,3>(1,1); // here Eigen chooses NOT to evaluate block() into a temporary
56 // because accessing coefficients of that block expression is not more costly than accessing
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| TrieBuilder.java | 22 * very useful when you have a block of Unicode data that contains significant
40 * Number of data values in a stage 2 (data array) block. 2, 4, 8, ..,
81 * Checks if the character belongs to a zero block in the trie
83 * @return true if ch is in the zero block
102 * Bit 31 is set if the data block is used by multiple index values
171 * The alignment size of a stage 2 data block. Also the granularity for
215 * Set a value in the trie index map to indicate which data block
227 // mark each block that _is_ used with 0
232 // never move the all-initial-value block 0
237 * Finds the same index block as the otherBloc
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| TrieBuilder.java | 21 * very useful when you have a block of Unicode data that contains significant
38 * Number of data values in a stage 2 (data array) block. 2, 4, 8, ..,
79 * Checks if the character belongs to a zero block in the trie
81 * @return true if ch is in the zero block
100 * Bit 31 is set if the data block is used by multiple index values
169 * The alignment size of a stage 2 data block. Also the granularity for
213 * Set a value in the trie index map to indicate which data block
225 // mark each block that _is_ used with 0
230 // never move the all-initial-value block 0
235 * Finds the same index block as the otherBloc
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_dead_control_flow.cpp | 43 foreach_block_safe (block, s->cfg) {
44 bblock_t *prev_block = block->prev();
49 backend_instruction *const inst = block->start();
64 bblock_t *const endif_block = block;
89 /* If ENDIF was in its own block, then we've now deleted it and
91 * __next block pointer was pointing to.
101 bblock_t *const else_block = block;
|
| /external/squashfs-tools/kernel/fs/squashfs/ |
| symlink.c | 52 u64 block = squashfs_i(inode)->start; local
59 TRACE("Entered squashfs_symlink_readpage, page index %ld, start block "
60 "%llx, offset %x\n", page->index, block, offset);
66 bytes = squashfs_read_metadata(sb, NULL, &block, &offset,
84 entry = squashfs_cache_get(sb, msblk->block_cache, block, 0);
99 block = entry->next_index;
|
| /external/valgrind/memcheck/tests/amd64/ |
| bt_everything.c | 421 char* block; local
428 block = calloc(200,1);
429 block += 100;
437 case 0: c = btsl_mem(block, bitoff); break;
438 case 1: c = btrl_mem(block, bitoff); break;
439 case 2: c = btcl_mem(block, bitoff); break;
440 case 3: c = btl_mem(block, bitoff); break;
441 case 4: c = btsq_mem(block, bitoff); break;
442 case 5: c = btrq_mem(block, bitoff); break;
443 case 6: c = btcq_mem(block, bitoff); break
[all...] |
| /external/webrtc/webrtc/modules/rtp_rtcp/source/rtcp_packet/ |
| dlrr.cc | 19 // DLRR Report Block (RFC 3611).
24 // | BT=5 | reserved | block length |
27 // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
33 // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
41 LOG(LS_WARNING) << "Invalid size for dlrr block.";
67 // Create block header.
91 SubBlock block; local
92 block.ssrc = ssrc;
93 block.last_rr = last_rr;
94 block.delay_since_last_rr = delay_last_rr
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| cfa.h | 37 // Control Flow Analysis of control flow graphs of basic block nodes |BB|.
46 cbb_ptr block; ///< pointer to the block member in struct:spvtools::CFA::block_info
50 /// Returns true if a block with @p id is found in the @p work_list vector
54 /// @param[in] id The ID of the block being checked
56 /// @return true if the edge work_list.back().block->id() => id is a back-edge
71 /// @param[in] preorder A function that will be called for every block in a
73 /// @param[in] postorder A function that will be called for every block in a
100 /// block
104 /// pair is its immediate dominator in the sense of Cooper et.al., where a block
[all...] |
| /system/keymaster/km_openssl/ |
| iso18033kdf.cpp | 44 for (size_t block = 0; block < num_blocks; block++) {
57 !Uint32ToBigEndianByteArray(block + start_counter_, counter.get()) ||
71 size_t block_start = digest_size_ * block;
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/arm/ |
| armv8-a-it-bad.s | 5 @ Wide instruction in IT block is deprecated.
9 @ This IT block is not deprecated.
13 @ IT block of more than one instruction is deprecated.
24 @ This automatic IT block is valid
34 @ Test automatic IT block generation at end of a file.
|
| /device/linaro/bootloader/arm-trusted-firmware/plat/socionext/uniphier/ |
| uniphier_nand.c | 74 static int uniphier_nand_block_isbad(struct uniphier_nand *nand, int block)
76 int page = nand->pages_per_block * block;
83 if (block < ARRAY_SIZE(nand->bbt) &&
84 nand->bbt[block] != UNIPHIER_NAND_BBT_UNKNOWN)
85 return nand->bbt[block];
110 if (block < ARRAY_SIZE(nand->bbt))
111 nand->bbt[block] = is_bad;
114 WARN("found bad block at %d. skip.\n", block);
169 int block = 0 local
[all...] |
