HomeSort by relevance Sort by last modified time
    Searched refs:block (Results 1 - 25 of 2598) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/mesa3d/src/compiler/nir/
nir_control_flow_private.h 38 void nir_handle_add_jump(nir_block *block);
39 void nir_handle_remove_jump(nir_block *block, nir_jump_type type);
nir_dominance.c 37 init_block(nir_block *block, nir_function_impl *impl)
39 if (block == nir_start_block(impl))
40 block->imm_dom = block;
42 block->imm_dom = NULL;
43 block->num_dom_children = 0;
46 set_foreach(block->dom_frontier, entry) {
47 _mesa_set_remove(block->dom_frontier, entry);
72 calc_dominance(nir_block *block)
76 set_foreach(block->predecessors, entry)
    [all...]
  /external/libvpx/libvpx/vp8/common/
mbpitch.c 18 x->block[r * 4 + c].predictor = x->predictor + r * 4 * 16 + c * 4;
24 x->block[16 + r * 2 + c].predictor =
31 x->block[20 + r * 2 + c].predictor =
37 x->block[r].qcoeff = x->qcoeff + r * 16;
38 x->block[r].dqcoeff = x->dqcoeff + r * 16;
39 x->block[r].eob = x->eobs + r;
44 int block; local
46 for (block = 0; block < 16; ++block) /* y blocks *
    [all...]
  /art/compiler/optimizing/
common_dominator.h 36 // Create a finder starting with a given block.
37 explicit CommonDominator(HBasicBlock* block)
38 : dominator_(block), chain_length_(ChainLength(block)) {
41 // Update the common dominator with another block.
42 void Update(HBasicBlock* block) {
43 DCHECK(block != nullptr);
45 dominator_ = block;
46 chain_length_ = ChainLength(block);
51 if (block == block2)
    [all...]
side_effects_analysis.cc 29 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
30 SideEffects effects = GetBlockEffects(block);
32 if (block->IsLoopHeader()) {
33 effects = GetLoopEffects(block);
40 for (HBasicBlock* block : graph_->GetPostOrder()) {
42 // Update `effects` with the side effects of all instructions in this block.
43 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done();
48 // more information to side-effects of this block.
54 block_effects_[block->GetBlockId()] = effects;
56 if (block->IsLoopHeader())
    [all...]
  /external/clang/test/CodeGenObjCXX/
block-nested-in-lambda.cpp 3 // CHECK: %[[BLOCK_CAPTURED0:.*]] = getelementptr inbounds <{ i8*, i32, i32, i8*, %struct.__block_descriptor*, i32*, i32* }>, <{ i8*, i32, i32, i8*, %struct.__block_descriptor*, i32*, i32* }>* %[[BLOCK:.*]], i32 0, i32 5
7 // CHECK: %[[BLOCK_CAPTURED1:.*]] = getelementptr inbounds <{ i8*, i32, i32, i8*, %struct.__block_descriptor*, i32*, i32* }>, <{ i8*, i32, i32, i8*, %struct.__block_descriptor*, i32*, i32* }>* %[[BLOCK]], i32 0, i32 6
16 auto block = ^{
19 block();
  /external/deqp-deps/SPIRV-Tools/source/opt/
dominator_analysis.cpp 29 BasicBlock* block = b1; local
30 while (block && seen.insert(block).second) {
31 block = ImmediateDominator(block);
34 block = b2;
35 while (block && !seen.count(block)) {
36 block = ImmediateDominator(block);
    [all...]
  /external/swiftshader/third_party/SPIRV-Tools/source/opt/
dominator_analysis.cpp 29 BasicBlock* block = b1; local
30 while (block && seen.insert(block).second) {
31 block = ImmediateDominator(block);
34 block = b2;
35 while (block && !seen.count(block)) {
36 block = ImmediateDominator(block);
    [all...]
  /external/rootdev/
rootdev_test.sh 83 out=$("${ROOTDEV}" --block $WORKDIR 2>/dev/null)
90 local block=$1
92 mkdir -p $block
94 mkdir -p $block/sda/sda1
95 mkdir -p $block/sda/sda2
96 echo "10:0" > $block/sda/dev
97 echo "10:1" > $block/sda/sda1/dev
98 echo "10:2" > $block/sda/sda2/dev
105 local block=$WORKDIR/sys/block
    [all...]
  /external/v8/src/compiler/
frame-elider.cc 23 for (InstructionBlock* block : instruction_blocks()) {
24 if (block->needs_frame()) continue;
25 for (int i = block->code_start(); i < block->code_end(); ++i) {
30 block->mark_needs_frame();
45 for (InstructionBlock* block : instruction_blocks()) {
46 if (block->needs_frame()) {
47 // Special case: The start block needs a frame.
48 if (block->predecessors().empty()) {
49 block->mark_must_construct_frame()
    [all...]
schedule.cc 36 bool BasicBlock::LoopContains(BasicBlock* block) const {
39 DCHECK_LE(0, block->rpo_number_);
41 return block->rpo_number_ >= rpo_number_ &&
42 block->rpo_number_ < loop_end_->rpo_number_;
101 std::ostream& operator<<(std::ostream& os, const BasicBlock& block) {
102 os << "B" << block.id();
104 AssemblerDebugInfo info = block.debug_info();
109 const BasicBlock* current_block = &block;
161 BasicBlock* Schedule::block(Node* node) const { function in class:v8::internal::compiler::Schedule
182 BasicBlock* block = this->block(a) local
188 BasicBlock* block = new (zone_) local
    [all...]
  /external/ltp/testcases/kernel/fs/mongo/
map5.c 15 int block; local
38 block = 0;
44 while (ioctl(fd, FIBMAP, &block) == 0) {
46 last_block = block - 1;
47 first_block = block;
49 if (block != last_block + 1) {
53 first_block = block;
54 last_block = block;
59 if (!block) {
69 block = i
    [all...]
  /external/clang/tools/libclang/
Index_Internal.h 25 #define INVOKE_BLOCK2(block, arg1, arg2) block(arg1, arg2)
29 // define and call the block manually.
31 #define INVOKE_BLOCK2(block, arg1, arg2) block->invoke(block, arg1, arg2)
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/
NodeWithBlockStmt.java 9 T setBody(BlockStmt block);
12 BlockStmt block = new BlockStmt(); local
13 setBody(block);
14 block.setParentNode((Node) this);
16 return block;
  /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/stmt/
SynchronizedStmt.java 37 private BlockStmt block; field in class:SynchronizedStmt
42 public SynchronizedStmt(final Expression expr, final BlockStmt block) {
44 setBlock(block);
48 final BlockStmt block) {
51 setBlock(block);
70 return block;
79 * @param block
82 public SynchronizedStmt setBlock(final BlockStmt block) {
83 this.block = block;
    [all...]
  /external/mesa3d/src/gallium/drivers/vc4/
vc4_qir_emit_uniform_stream_resets.c 27 * Adds updates to the uniform stream address at the start of each basic block
31 * have performed optimization know how many uniforms are used in each block.
39 block_reads_any_uniform(struct qblock *block)
41 qir_for_each_inst(inst, block) {
54 qir_for_each_block(block, c) {
55 if (block != qir_entry_block(c) &&
56 (block_reads_any_uniform(block) ||
57 block == qir_exit_block(c))) {
75 /* Pushes to the top of the block, so in reverse
78 list_add(&add->link, &block->instructions)
    [all...]
  /external/skia/src/gpu/
GrMemoryPool.cpp 75 BlockHeader* block = CreateBlock(blockSize); local
77 block->fPrev = fTail;
78 block->fNext = nullptr;
80 fTail->fNext = block;
81 fTail = block;
82 fSize += block->fSize;
88 // We stash a pointer to the block header, just before the allocated space,
116 BlockHeader* block = allocData->fHeader; local
117 SkASSERT(kAssignedMarker == block->fBlockSentinal);
118 if (1 == block->fLiveCount)
153 BlockHeader* block = local
174 BlockHeader* block = fHead; local
    [all...]
  /external/skqp/src/gpu/
GrMemoryPool.cpp 75 BlockHeader* block = CreateBlock(blockSize); local
77 block->fPrev = fTail;
78 block->fNext = nullptr;
80 fTail->fNext = block;
81 fTail = block;
82 fSize += block->fSize;
88 // We stash a pointer to the block header, just before the allocated space,
116 BlockHeader* block = allocData->fHeader; local
117 SkASSERT(kAssignedMarker == block->fBlockSentinal);
118 if (1 == block->fLiveCount)
153 BlockHeader* block = local
174 BlockHeader* block = fHead; local
    [all...]
  /external/libpcap/
gencode.h 207 struct slist *jt; /*only for relative jump in block*/
208 struct slist *jf; /*only for relative jump in block*/
240 struct block *succ;
241 struct block *pred;
245 struct block { struct
257 struct block *head;
258 struct block *link; /* link field used by optimizer */
275 struct block *b; /* protocol checks */
297 void gen_and(struct block *, struct block *);
    [all...]
  /external/compiler-rt/lib/builtins/arm/
udivmodsi4.S 57 * This depends on the fixed instruction size of block.
60 * block(shift) implements the test-and-update-quotient core.
109 /* Last block, no need to update r3 or r4. */
121 #define block(shift) \ define
127 block(31)
128 block(30)
129 block(29)
130 block(28)
131 block(27)
132 block(26
    [all...]
udivsi3.S 57 * This depends on the fixed instruction size of block.
60 * block(shift) implements the test-and-update-quotient core.
107 /* Last block, no need to update r2 or r3. */
118 #define block(shift) \ define
124 block(31)
125 block(30)
126 block(29)
127 block(28)
128 block(27)
129 block(26
    [all...]
umodsi3.S 55 * This depends on the fixed instruction size of block.
58 * block(shift) implements the test-and-update-quotient core.
103 /* Last block, no need to update r2 or r3. */
112 #define block(shift) \ define
117 block(31)
118 block(30)
119 block(29)
120 block(28)
121 block(27)
122 block(26
    [all...]
  /external/mesa3d/src/gallium/drivers/r600/
r600_perfcounter.c 33 /* Max counters per HW block */
40 struct r600_perfcounter_block *block = pc->blocks; local
44 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
45 unsigned total = block->num_groups * block->num_selectors;
49 return block;
53 *base_gid += block->num_groups;
63 struct r600_perfcounter_block *block = pc->blocks; local
65 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
66 if (*index < block->num_groups
76 struct r600_perfcounter_block *block; member in struct:r600_pc_group
140 struct r600_perfcounter_block *block = group->block; local
168 struct r600_perfcounter_block *block = group->block; local
307 struct r600_perfcounter_block *block; local
363 struct r600_perfcounter_block *block = group->block; local
394 struct r600_perfcounter_block *block; local
519 struct r600_perfcounter_block *block; local
561 struct r600_perfcounter_block *block; local
608 struct r600_perfcounter_block *block = &pc->blocks[pc->num_blocks]; local
    [all...]
  /external/mesa3d/src/gallium/drivers/radeon/
r600_perfcounter.c 29 /* Max counters per HW block */
36 struct r600_perfcounter_block *block = pc->blocks; local
40 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
41 unsigned total = block->num_groups * block->num_selectors;
45 return block;
49 *base_gid += block->num_groups;
59 struct r600_perfcounter_block *block = pc->blocks; local
61 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
62 if (*index < block->num_groups
72 struct r600_perfcounter_block *block; member in struct:r600_pc_group
136 struct r600_perfcounter_block *block = group->block; local
164 struct r600_perfcounter_block *block = group->block; local
303 struct r600_perfcounter_block *block; local
359 struct r600_perfcounter_block *block = group->block; local
390 struct r600_perfcounter_block *block; local
515 struct r600_perfcounter_block *block; local
557 struct r600_perfcounter_block *block; local
604 struct r600_perfcounter_block *block = &pc->blocks[pc->num_blocks]; local
    [all...]
  /external/clang/test/CodeGen/
2010-06-17-asmcrash.c 9 void avg_pixels8_mmx2(uint8_t *block, const uint8_t *pixels, int line_size, int h)
12 :"+g"(h), "+S"(pixels), "+D"(block)

Completed in 921 milliseconds

1 2 3 4 5 6 7 8 91011>>