Lines Matching refs:blocks
18 MyStaticRec **assign_inner_blocks(int num_blocks, MyStaticRec *blocks);
21 // blocks.
35 // of basic blocks.
49 // basic blocks.
75 // Allocate space for all of the static blocks
76 MyStaticRec *blocks = new MyStaticRec[num_static_bb];
78 // Read in all the static blocks
80 trace->ReadStatic(&blocks[ii].bb);
81 blocks[ii].is_thumb = blocks[ii].bb.bb_addr & 1;
82 blocks[ii].bb.bb_addr &= ~1;
83 uint32_t num_insns = blocks[ii].bb.num_insns;
84 blocks[ii].insns = new uint32_t[num_insns];
85 blocks[ii].cycles = new uint32_t[num_insns];
86 memset(blocks[ii].cycles, 0, num_insns * sizeof(uint32_t));
87 trace->ReadStaticInsns(num_insns, blocks[ii].insns);
88 blocks[ii].elapsed = 0;
89 blocks[ii].freq = 0;
90 blocks[ii].inner = NULL;
93 MyStaticRec **sorted = assign_inner_blocks(num_static_bb, blocks);
108 blocks[bb_num].freq += 1;
109 for (MyStaticRec *bptr = blocks[bb_num].inner; bptr; bptr = bptr->inner)
113 for (MyStaticRec *bptr = &blocks[bb_num]; bptr; bptr = bptr->inner) {
132 // Sort the basic blocks into decreasing elapsed time
185 // Find the basic blocks that are subsets of other basic blocks.
186 MyStaticRec **assign_inner_blocks(int num_blocks, MyStaticRec *blocks)
191 // Create a list of pointers to the basic blocks that we can sort.
194 sorted[ii] = &blocks[ii];
197 // Sort the basic blocks into increasing address order
200 // Create pointers to inner blocks and break up the enclosing block