Searched refs:PredInfo (Results 1 – 3 of 3) sorted by relevance
128 BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal); in BuildBlockList() local129 BBMapBucket.second = PredInfo; in BuildBlockList()130 Info->Preds[p] = PredInfo; in BuildBlockList()132 if (PredInfo->AvailableVal) { in BuildBlockList()133 RootList.push_back(PredInfo); in BuildBlockList()136 WorkList.push_back(PredInfo); in BuildBlockList()351 BBInfo *PredInfo = Info->Preds[p]; in FindAvailableVals() local352 BlkT *Pred = PredInfo->BB; in FindAvailableVals()354 if (PredInfo->DefBB != PredInfo) in FindAvailableVals()355 PredInfo = PredInfo->DefBB; in FindAvailableVals()[all …]
139 BBInfo *PredInfo = new (Allocator) BBInfo(Pred, PredVal); in BuildBlockList() local140 BBMapBucket.second = PredInfo; in BuildBlockList()141 Info->Preds[p] = PredInfo; in BuildBlockList()143 if (PredInfo->AvailableVal) { in BuildBlockList()144 RootList.push_back(PredInfo); in BuildBlockList()147 WorkList.push_back(PredInfo); in BuildBlockList()362 BBInfo *PredInfo = Info->Preds[p]; in FindAvailableVals() local363 BlkT *Pred = PredInfo->BB; in FindAvailableVals()365 if (PredInfo->DefBB != PredInfo) in FindAvailableVals()366 PredInfo = PredInfo->DefBB; in FindAvailableVals()[all …]
837 BlockInfo *PredInfo = &BBInfo[Pred->getBlockID()]; in handlePredecessor() local838 assert(PredInfo->UnprocessedSuccessors > 0); in handlePredecessor()840 if (--PredInfo->UnprocessedSuccessors == 0) in handlePredecessor()841 mergeEntryMap(std::move(PredInfo->ExitMap)); in handlePredecessor()843 mergeEntryMap(PredInfo->ExitMap.clone()); in handlePredecessor()