Searched refs:merged_blocks (Results 1 – 5 of 5) sorted by relevance
102 let mut merged_blocks = Vec::new(); in simplify() localVariable121 merged_blocks.clear(); in simplify()125 inner_changed |= self.merge_successor(&mut merged_blocks, &mut terminator); in simplify()130 merged_blocks.iter().map(|&i| self.basic_blocks[i].statements.len()).sum(); in simplify()135 for &from in &merged_blocks { in simplify()208 merged_blocks: &mut Vec<BasicBlock>, in merge_successor()226 merged_blocks.push(target); in merge_successor()
251 if block.addr in function.merged_blocks:252 for a in function.merged_blocks[block.addr]:294 self.merged_blocks = dict()319 if node not in self.merged_blocks:320 self.merged_blocks[node] = []321 self.merged_blocks[node].append(succ)322 if succ in self.merged_blocks:323 self.merged_blocks[node] += self.merged_blocks[succ]324 del self.merged_blocks[succ]334 if n.addr in self.merged_blocks:[all …]
367 std::vector<MidiFile::DataBlock> merged_blocks; in FixupMidiData() local373 } else if (block.ticktime > last_ticktime || merged_blocks.size() == 0) { in FixupMidiData()374 merged_blocks.push_back(block); in FixupMidiData()377 …merged_blocks.back().data.insert(merged_blocks.back().data.end(), block.data.begin(), block.data.e… in FixupMidiData()380 std::swap(merged_blocks, target.blocks); in FixupMidiData()
87 merged_blocks :: [[(Key, DistinctBlocks)]]88 (new_substs, merged_blocks) = List.mapAccumL (List.mapAccumL go) mapEmpty grouped_blocks function95 updated_blocks = map (map (first (map (lookupBid subst')))) merged_blocks
1916 merged_blocks = _merge_blocks(1919 new_blocks = extend_blocks(merged_blocks, new_blocks)