diff options
author | Krzysztof Parzyszek <kparzysz@codeaurora.org> | 2016-01-12 16:51:55 +0000 |
---|---|---|
committer | Krzysztof Parzyszek <kparzysz@codeaurora.org> | 2016-01-12 16:51:55 +0000 |
commit | 8dca45efa8148c41556c3b03fe6536e97b67a89a (patch) | |
tree | fac6b3837dfc450a62bda12eca789a4fc8a556be | |
parent | 4b83a4f6fe8f8d921e8a94f8d46a972348ddc415 (diff) | |
download | bcm5719-llvm-8dca45efa8148c41556c3b03fe6536e97b67a89a.tar.gz bcm5719-llvm-8dca45efa8148c41556c3b03fe6536e97b67a89a.zip |
Fix compiler warnings from r257477
llvm-svn: 257483
-rw-r--r-- | llvm/lib/Target/Hexagon/RDFGraph.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Target/Hexagon/RDFGraph.cpp b/llvm/lib/Target/Hexagon/RDFGraph.cpp index 5bce110b17e..9b47422153b 100644 --- a/llvm/lib/Target/Hexagon/RDFGraph.cpp +++ b/llvm/lib/Target/Hexagon/RDFGraph.cpp @@ -315,7 +315,7 @@ void NodeAllocator::startNewBlock() { // 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. // 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"); 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. unsigned SS = Stack.size(); bool IsDelim; - assert(P >= 0 && P < SS); + assert(P < SS); do { P++; IsDelim = isDelimiter(Stack[P-1]); |