// Prevent recursion.
WillMaterializeAllForwardRefs = true;
- while (!BasicBlockFwdRefs.empty()) {
- Function *F = BasicBlockFwdRefs.begin()->first;
+ while (!BasicBlockFwdRefQueue.empty()) {
+ Function *F = BasicBlockFwdRefQueue.front();
+ BasicBlockFwdRefQueue.pop_front();
assert(F && "Expected valid function");
+ if (!BasicBlockFwdRefs.count(F))
+ // Already materialized.
+ continue;
+
// Check for a function that isn't materializable to prevent an infinite
// loop. When parsing a blockaddress stored in a global variable, there
// isn't a trivial way to check if a function will have a body without a
if (std::error_code EC = Materialize(F))
return EC;
}
+ assert(BasicBlockFwdRefs.empty() && "Function missing from queue");
// Reset state.
WillMaterializeAllForwardRefs = false;
MDKindMap.clear();
assert(BasicBlockFwdRefs.empty() && "Unresolved blockaddress fwd references");
+ BasicBlockFwdRefQueue.clear();
}
//===----------------------------------------------------------------------===//
} else {
// Otherwise insert a placeholder and remember it so it can be inserted
// when the function is parsed.
- BB = BasicBlock::Create(Context);
- BasicBlockFwdRefs[Fn].emplace_back(BBID, BB);
+ auto &FwdBBs = BasicBlockFwdRefs[Fn];
+ if (FwdBBs.empty())
+ BasicBlockFwdRefQueue.push_back(Fn);
+ if (FwdBBs.size() < BBID + 1)
+ FwdBBs.resize(BBID + 1);
+ if (!FwdBBs[BBID])
+ FwdBBs[BBID] = BasicBlock::Create(Context);
+ BB = FwdBBs[BBID];
}
V = BlockAddress::get(Fn, BB);
break;
unsigned NumUses = 0;
SmallDenseMap<const Use *, unsigned, 16> Order;
for (const Use &U : V->uses()) {
- if (NumUses > Record.size())
+ if (++NumUses > Record.size())
break;
- Order[&U] = Record[NumUses++];
+ Order[&U] = Record[NumUses - 1];
}
if (Order.size() != Record.size() || NumUses > Record.size())
// Mismatches can happen if the functions are being materialized lazily
FunctionBBs[i] = BasicBlock::Create(Context, "", F);
} else {
auto &BBRefs = BBFRI->second;
- std::sort(BBRefs.begin(), BBRefs.end(),
- [](const std::pair<unsigned, BasicBlock *> &LHS,
- const std::pair<unsigned, BasicBlock *> &RHS) {
- return LHS.first < RHS.first;
- });
- unsigned R = 0, RE = BBRefs.size();
- for (unsigned I = 0, E = FunctionBBs.size(); I != E; ++I)
- if (R != RE && BBRefs[R].first == I) {
- assert(I != 0 && "Invalid reference to entry block");
- BasicBlock *BB = BBRefs[R++].second;
- BB->insertInto(F);
- FunctionBBs[I] = BB;
+ // Check for invalid basic block references.
+ if (BBRefs.size() > FunctionBBs.size())
+ return Error(BitcodeError::InvalidID);
+ assert(!BBRefs.empty() && "Unexpected empty array");
+ assert(!BBRefs.front() && "Invalid reference to entry block");
+ for (unsigned I = 0, E = FunctionBBs.size(), RE = BBRefs.size(); I != E;
+ ++I)
+ if (I < RE && BBRefs[I]) {
+ BBRefs[I]->insertInto(F);
+ FunctionBBs[I] = BBRefs[I];
} else {
FunctionBBs[I] = BasicBlock::Create(Context, "", F);
}
- // Check for invalid basic block references.
- if (R != RE)
- return Error(BitcodeError::InvalidID);
// Erase from the table.
BasicBlockFwdRefs.erase(BBFRI);