Searched refs:isEntry (Results 1 – 9 of 9) sorted by relevance
196 bool isEntry() const { return Index == 0; } in isEntry() function in __anon97d149770111::Block232 bool isEntry() const { return Blocks[0]->Index == 0; } in isEntry() function in __anon97d149770111::Chain648 if (SrcChain != DstChain && !DstChain->isEntry() && in mergeColdChains()770 if ((ChainPred->isEntry() || ChainSucc->isEntry()) && in computeMergeGain()771 !MergedBlocks.getFirstBlock()->isEntry()) in computeMergeGain()864 if (C1->isEntry() != C2->isEntry()) { in concatChains()865 return C1->isEntry(); in concatChains()
593 assert(Func.Blocks[Func.Entry].isEntry() && in FlowAdjuster()1058 assert((!Block.UnknownWeight || Block.Weight == 0 || Block.isEntry()) && in initializeNetwork()1071 assert((!Block.isEntry() || !Block.isExit()) && in initializeNetwork()1073 if (Block.isEntry()) { in initializeNetwork()1096 if (Block.isEntry()) { in initializeNetwork()1188 if (Block.isEntry()) { in verifyWeights()
108 bool isEntry(BlockT *Block) const { return is_contained(Entries, Block); } in isEntry() function214 if (isEntry(Block)) in print()
233 assert(!NewCycle->isEntry(Block)); in run()
58 bool isEntry() const { return PredJumps.empty(); }207 if (Func.Blocks[I].isEntry()) {
115 bool isEntry() const { return Index == PseudoProbeFirstId; } in isEntry() function
265 case DIEValue::isEntry: in hashAttribute()
560 if (Probe->isEntry()) in populateBodySamplesWithProbesForAllFunctions()1152 if (Probe->isEntry()) { in populateBodySamplesWithProbes()
2333 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion() local2334 if (isEntry) { in createIfRegion()2371 if (isEntry) { in createIfRegion()2375 if (isEntry) { in createIfRegion()