160 struct BytecodeRegion {  struct
164     ChunkVector<BytecodeRegion *> preds; // List of predessesor blocks  argument
165     ChunkVector<BytecodeRegion *> succs; // List of successors blocks  argument
166     ChunkVector<BytecodeRegion *> trys; // List of trys blocks  argument
167     ChunkVector<BytecodeRegion *> catches; // List of catches blocks  argument
175     BytecodeRegion(Chunk* chunk) : preds(chunk), succs(chunk),  in BytecodeRegion()  argument
184     bool operator <(const BytecodeRegion &target) const  argument
192 …      std::sort(catches.begin(), catches.end(), [](BytecodeRegion *first, BytecodeRegion *second) {  in SortCatches()  argument
198     void EraseThisBlock(ChunkVector<BytecodeRegion *> &blocks)  in EraseThisBlock()  argument
212 using BytecodeGraph = ChunkVector<BytecodeRegion*>;  argument
340     void EnumerateBlock(BytecodeRegion &bb, const Callback &cb)  in EnumerateBlock()
354     BytecodeRegion &GetBasicBlockById(size_t id)  in GetBasicBlockById()
360     void AddBasicBlock(BytecodeRegion* region)  in AddBasicBlock()
553     void NewJSGate(BytecodeRegion &bb);
554     void NewJump(BytecodeRegion &bbd);
555     GateRef NewReturn(BytecodeRegion &bb);
556     void NewByteCode(BytecodeRegion &bb);
557     void MergeThrowGate(BytecodeRegion &bb, uint32_t bcIndex);
558     void MergeExceptionGete(BytecodeRegion &bb, const BytecodeInfo& bytecodeInfo, uint32_t bcIndex);
563     void ClearUnreachableRegion(ChunkVector<BytecodeRegion*>& pendingList);
564     void RemoveUnusedPredsInfo(BytecodeRegion& bb);
569     void PrintBytecodeInfo(BytecodeRegion& region);
573     BytecodeRegion &RegionAt(size_t i)  in RegionAt()