X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FSupport%2FConstantRange.cpp;h=0d22b323502174376c92db9023299ea1be7f338f;hb=73b43b9b549a75fb0015c825df68abd95705a67c;hp=4f132e5ed5fd2900f949c5031fcb80b6e00afbea;hpb=377b1190cbcf99e9298300d890c4b744dd2ed2c7;p=oota-llvm.git diff --git a/lib/Support/ConstantRange.cpp b/lib/Support/ConstantRange.cpp index 4f132e5ed5f..0d22b323502 100644 --- a/lib/Support/ConstantRange.cpp +++ b/lib/Support/ConstantRange.cpp @@ -2,8 +2,8 @@ // // The LLVM Compiler Infrastructure // -// This file was developed by the LLVM research group and is distributed under -// the University of Illinois Open Source License. See LICENSE.TXT for details. +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // @@ -248,8 +248,10 @@ ConstantRange ConstantRange::intersectWith(const ConstantRange &CR) const { /// maximalIntersectWith - Return the range that results from the intersection /// of this range with another range. The resultant range is guaranteed to -/// include all elements contained in both input ranges, and is also guaranteed -/// to be the smallest possible set that does so. +/// include all elements contained in both input ranges, and to have the +/// smallest possible set size that does so. Because there may be two +/// intersections with the same set size, A.maximalIntersectWith(B) might not +/// be equal to B.maximalIntersect(A). ConstantRange ConstantRange::maximalIntersectWith(const ConstantRange &CR) const { assert(getBitWidth() == CR.getBitWidth() && "ConstantRange types don't agree!"); @@ -462,7 +464,7 @@ ConstantRange ConstantRange::truncate(uint32_t DstTySize) const { /// void ConstantRange::print(std::ostream &OS) const { OS << "[" << Lower.toStringSigned(10) << "," - << Upper.toStringSigned(10) << " )"; + << Upper.toStringSigned(10) << ")"; } /// dump - Allow printing from a debugger easily...