forked from OSchip/llvm-project
parent
4b83a4f6fe
commit
8dca45efa8
|
@ -315,7 +315,7 @@ void NodeAllocator::startNewBlock() {
|
||||||
// Check if the block index is still within the allowed range, i.e. less
|
// Check if the block index is still within the allowed range, i.e. less
|
||||||
// than 2^N, where N is the number of bits in NodeId for the block index.
|
// than 2^N, where N is the number of bits in NodeId for the block index.
|
||||||
// BitsPerIndex is the number of bits per node index.
|
// BitsPerIndex is the number of bits per node index.
|
||||||
assert((Blocks.size() < (1 << (8*sizeof(NodeId)-BitsPerIndex))) &&
|
assert((Blocks.size() < (1U << (8*sizeof(NodeId)-BitsPerIndex))) &&
|
||||||
"Out of bits for block index");
|
"Out of bits for block index");
|
||||||
ActiveEnd = P;
|
ActiveEnd = P;
|
||||||
}
|
}
|
||||||
|
@ -789,7 +789,7 @@ unsigned DataFlowGraph::DefStack::nextUp(unsigned P) const {
|
||||||
// The input position P does not have to point to a non-delimiter.
|
// The input position P does not have to point to a non-delimiter.
|
||||||
unsigned SS = Stack.size();
|
unsigned SS = Stack.size();
|
||||||
bool IsDelim;
|
bool IsDelim;
|
||||||
assert(P >= 0 && P < SS);
|
assert(P < SS);
|
||||||
do {
|
do {
|
||||||
P++;
|
P++;
|
||||||
IsDelim = isDelimiter(Stack[P-1]);
|
IsDelim = isDelimiter(Stack[P-1]);
|
||||||
|
|
Loading…
Reference in New Issue