Searched refs:isEntry (Results 1 – 8 of 8) sorted by relevance
221 bool isEntry() const { return Index == 0; } in isEntry() function in __anon762416430111::Block259 bool isEntry() const { return Blocks[0]->Index == 0; } in isEntry() function in __anon762416430111::Chain692 if (SrcChain != DstChain && !DstChain->isEntry() && in mergeColdChains()816 if ((ChainPred->isEntry() || ChainSucc->isEntry()) && in computeMergeGain()817 !MergedBlocks.getFirstBlock()->isEntry()) in computeMergeGain()909 if (C1->isEntry() != C2->isEntry()) { in concatChains()910 return C1->isEntry(); in concatChains()
1083 if (Block.isEntry()) { in initializeNetwork()1145 if (Block.isEntry()) { in assignBlockCosts()1222 assert(Func.Entry == 0 && Func.Blocks[0].isEntry()); in verifyInput()1224 assert(!Func.Blocks[I].isEntry() && "multiple entry blocks"); in verifyInput()1228 assert((!Block.isEntry() || !Block.isExit()) && in verifyInput()1233 assert((!Block.HasUnknownWeight || Block.Weight == 0 || Block.isEntry()) && in verifyInput()1257 if (Block.isEntry()) { in verifyOutput()
108 bool isEntry(const BlockT *Block) const { in isEntry() function216 if (isEntry(Block)) in print()
233 assert(!NewCycle->isEntry(Block)); in run()
58 bool isEntry() const { return PredJumps.empty(); }304 if (Func.Blocks[I].isEntry()) {
122 bool isEntry() const { return Index == PseudoProbeFirstId; } in isEntry() function
265 case DIEValue::isEntry: in hashAttribute()
2332 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion() local2333 if (isEntry) { in createIfRegion()2370 if (isEntry) { in createIfRegion()2374 if (isEntry) { in createIfRegion()