Author: dannyb
Date: Mon Sep 24 17:20:45 2007
New Revision: 42279
URL: http://llvm.org/viewvc/llvm-project?rev=42279&view=rev
Log:
Comment fixups
Modified:
llvm/trunk/include/llvm/ADT/SparseBitVector.h
llvm/trunk/lib/Analysis/IPA/Andersens.cpp
Modified: llvm/trunk/include/llvm/ADT/SparseBitVector.h
URL:
http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/SparseBitVector.h?rev=42279&r1=42278&r2=42279&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/SparseBitVector.h (original)
+++ llvm/trunk/include/llvm/ADT/SparseBitVector.h Mon Sep 24 17:20:45 2007
@@ -286,6 +286,7 @@
}
BecameZero = allzero;
}
+
// Get a hash value for this element;
uint64_t getHashValue() const {
uint64_t HashVal = 0;
Modified: llvm/trunk/lib/Analysis/IPA/Andersens.cpp
URL:
http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/IPA/Andersens.cpp?rev=42279&r1=42278&r2=42279&view=diff
==============================================================================
--- llvm/trunk/lib/Analysis/IPA/Andersens.cpp (original)
+++ llvm/trunk/lib/Analysis/IPA/Andersens.cpp Mon Sep 24 17:20:45 2007
@@ -30,11 +30,11 @@
// B can point to. Constraints can handle copies, loads, and stores, and
// address taking.
//
-// The Offline constraint graph optimization portion includes offline variable
-// substitution algorithms intended to pointer and location equivalences.
-// Pointer equivalences are those pointers that will have the same points-to
-// sets, and location equivalences are those variables that always appear
-// together in points-to sets.
+// The offline constraint graph optimization portion includes offline variable
+// substitution algorithms intended to computer pointer and location
+// equivalences. Pointer equivalences are those pointers that will have the
+// same points-to sets, and location equivalences are those variables that
+// always appear together in points-to sets.
//
// The inclusion constraint solving phase iteratively propagates the inclusion
// constraints until a fixed point is reached. This is an O(N^3) algorithm.
@@ -137,10 +137,10 @@
};
// Node class - This class is used to represent a node in the constraint
- // graph. Due to various optimizations, not always the case that there is
a
- // mapping from a Node to a Value. In particular, we add artificial Node's
- // that represent the set of pointed-to variables shared for each location
- // equivalent Node.
+ // graph. Due to various optimizations, it is not always the case that
+ // there is a mapping from a Node to a Value. In particular, we add
+ // artificial Node's that represent the set of pointed-to variables shared
+ // for each location equivalent Node.
struct Node {
Value *Val;
SparseBitVector<> *Edges;
@@ -160,15 +160,14 @@
// Number of incoming edges, used during variable substitution to early
// free the points-to sets
unsigned NumInEdges;
- // True if our ponits-to set is in the Set2PEClass map
+ // True if our points-to set is in the Set2PEClass map
bool StoredInHash;
- // True if our node has no indirect constraints (Complex or otherwise)
+ // True if our node has no indirect constraints (complex or otherwise)
bool Direct;
// True if the node is address taken, *or* it is part of a group of nodes
// that must be kept together. This is set to true for functions and
// their arg nodes, which must be kept at the same position relative to
// their base function node.
- // kept at the same position relative to their base function node.
bool AddressTaken;
// Nodes in cycles (or in equivalence classes) are united together using
a
_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
