Nigel
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixing a -Woverflow warning from GCC by using a more natural datatype for this operation. NFC. 

llvm-svn: 217670
This commit is contained in:
Aaron Ballman 2014-09-12 12:42:15 +00:00
parent c287f4a358
commit 6afd1eb322
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
clang/include/clang/Analysis/Analyses/ThreadSafetyTIL.h
View File

@ -1669,7 +1669,7 @@ private:
SCFG *CFGPtr; // The CFG that contains this block.
int BlockID : 31; // unique id for this BB in the containing CFG.
// IDs are in topological order.
int Visited : 1; // Bit to determine if a block has been visited
bool Visited : 1; // Bit to determine if a block has been visited
// during a traversal.
BlockArray Predecessors; // Predecessor blocks in the CFG.
InstrArray Args; // Phi nodes. One argument per predecessor.

4
clang/lib/Analysis/ThreadSafetyTIL.cpp
View File

@ -170,7 +170,7 @@ int BasicBlock::renumberInstrs(int ID) {
// block, and ID should be the total number of blocks.
int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {
if (Visited) return ID;
Visited = 1;
Visited = true;
for (auto *Block : successors())
ID = Block->topologicalSort(Blocks, ID);
// set ID and update block array in place.
@ -195,7 +195,7 @@ int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) {
// Visited is assumed to have been set by the topologicalSort. This pass
// assumes !Visited means that we've visited this node before.
if (!Visited) return ID;
Visited = 0;
Visited = false;
if (DominatorNode.Parent)
ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID);
for (auto *Pred : Predecessors)