Searched refs:isEntry (Results 1 – 8 of 8) sorted by relevance
226 bool isEntry() const { return Index == 0; } in isEntry() function296 bool isEntry() const { return Nodes[0]->Index == 0; } in isEntry() function815 if (SrcChain != DstChain && !DstChain->isEntry() && in mergeColdChains()938 if ((ChainPred->isEntry() || ChainSucc->isEntry()) && in computeMergeGain()939 !MergedNodes.getFirstNode()->isEntry()) in computeMergeGain()992 if (L->isEntry() != R->isEntry()) in concatChains()993 return L->isEntry(); in concatChains()
1084 if (Block.isEntry()) { in initializeNetwork() 1146 if (Block.isEntry()) { in assignBlockCosts() 1223 assert(Func.Entry == 0 && Func.Blocks[0].isEntry()); in verifyInput() 1226 assert(!Func.Blocks[I].isEntry() && "multiple entry blocks"); in verifyInput() 1242 assert((!Block.isEntry() || !Block.isExit()) && in verifyInput() 1247 assert((!Block.HasUnknownWeight || Block.Weight == 0 || Block.isEntry()) && in verifyInput() 1271 if (Block.isEntry()) { in verifyOutput()
36 bool isEntry() const { return PredJumps.empty(); } in isEntry() function283 if (Func.Blocks[I].isEntry()) { in createFlowFunction()
106 bool isEntry(const BlockT *Block) const { in isEntry() function 216 if (isEntry(Block)) in print()
265 assert(!NewCycle->isEntry(Block)); in run()
126 bool isEntry() const { return Index == PseudoProbeFirstId; } in isEntry() function
265 case DIEValue::isEntry: in hashAttribute()
2327 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion() 2328 if (isEntry) { in createIfRegion() 2365 if (isEntry) { in createIfRegion() 2369 if (isEntry) { in createIfRegion() 2332 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); createIfRegion() local