search for: sparsebitvector

The warning is: R:\SDKs\llvm\trunk\include\llvm/ADT/SparseBitVector.h(58) : warning C4099: 'llvm::ilist_sentinel_traits<llvm::SparseBitVectorElement<ElementSize>>' : type name first seen using 'struct' now seen using 'class' R:\SDKs\llvm\trunk\include\llvm/ADT/SparseBitVector.h(275) : see reference to class template insta...

Hi all, Did someone forget to check-in a patch? I'm getting this error during compilation on PPC: /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/lib/Analysis/IPA/Andersens.cpp: In function 'void dumpToDOUT(llvm::SparseBitVector<128u>*)': /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/lib/Analysis/IPA/Andersens.cpp:1189: error: no matching function for call to 'dump(llvm::SparseBitVector<128u>&, llvm::OStream)' /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/l...

...atch? I'm getting this error during >> compilation on PPC: > > A recent checkout compiled fine for me (on x86). > >> /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ >> lib/Analysis/IPA/Andersens.cpp: >> In function 'void dumpToDOUT(llvm::SparseBitVector<128u>*)': >> /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ >> lib/Analysis/IPA/Andersens.cpp:1189: >> error: no matching function for call to >> 'dump(llvm::SparseBitVector<128u>&, llvm::OStream)' >> /Volumes/SandBox/C...

...meone forget to check-in a patch? I'm getting this error during > compilation on PPC: A recent checkout compiled fine for me (on x86). > /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ > lib/Analysis/IPA/Andersens.cpp: > In function 'void dumpToDOUT(llvm::SparseBitVector<128u>*)': > /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ > lib/Analysis/IPA/Andersens.cpp:1189: > error: no matching function for call to > 'dump(llvm::SparseBitVector<128u>&, llvm::OStream)' > /Volumes/SandBox/Clean/llvm-9999-01.r...

Here is the latest shrink wrapping patch, with fixes for issues identified by Evan. I am including a few small additions/fixes to include/llvm/ADT/{SparseBitVector,DepthFirstIterator}.h. Files: include/llvm/ADT/DepthFirstIterator.h include/llvm/ADT/SparseBitVector.h lib/CodeGen/PrologEpilogInserter.cpp Evan, let me know how it looks when you get a chance. Thanks much, John > -------------- next part -------------- An HTML attachment was scrubbed...

...> during >>> compilation on PPC: >> >> A recent checkout compiled fine for me (on x86). >> >>> /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ >>> lib/Analysis/IPA/Andersens.cpp: >>> In function 'void dumpToDOUT(llvm::SparseBitVector<128u>*)': >>> /Volumes/SandBox/Clean/llvm-9999-01.roots/llvm-9999-01~obj/src/llvm/ >>> lib/Analysis/IPA/Andersens.cpp:1189: >>> error: no matching function for call to >>> 'dump(llvm::SparseBitVector<128u>&, llvm::OStream)' >>&gt...

On Sep 24, 2007, at 3:15 PM, Dale Johannesen wrote: > > On Sep 24, 2007, at 3:07 PM, Bill Wendling wrote: > >> A debug or release build? >> >> -bw > > Both, actually. Weird. I see a potential problem, though. The code is like this: void dumpToDOUT(SparseBitVector<> *bitmap) { dump(*bitmap, DOUT); } where dump expects an llvm::OStream& for the second argument. However, when NDEBUG is #defined, DOUT is "llvm::OStream(0)", so it can't be passed by reference. -bw

...t; Don't forget to update ProgrammersManual.html "Picking the Right > Data Structure for a Task" section. :) It doesn't talk about bitvector at all. I'm not sure whether i should add it to set like containers, or add a section about bitsets that talks about bitvector and sparsebitvector. In either case, I think this should be a followup patch, but if you guys really want it done as part of this one, I will. > > - > Devang > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu &gt...

...ack, > it becomes really really really bad :) I agree that avoiding the indirection would be good, but, in practice, getting the data structure in and refining it later also is fine. Please valgrind it when it has a client to make sure it isn't leaking memory. Some minor comments: +/// SparseBitVector is an implementation of a bitvector that is sparse by only +/// storing the elements that have non-zero bits set. In order to make this +/// fast for the most common cases, SparseBitVector is implemented as a linked list Please wrap lines to fit in 80 columns. + template <int ElementSize = 1...

On 9/4/07, Dan Gohman <djg at cray.com> wrote: > On Tue, Sep 04, 2007 at 10:35:10AM -0400, Daniel Berlin wrote: > > On 9/4/07, Dan Gohman <djg at cray.com> wrote: > > > On Fri, Aug 31, 2007 at 08:10:33PM -0400, Daniel Berlin wrote: > > > > + template <int ElementSize> > > > > + class SparseBitmap { > > > > > > Do you

...mmit access (since part of his patch has already been committed)? Evan On Mar 16, 2009, at 3:23 PM, John Mosby wrote: > Here is the latest shrink wrapping patch, with fixes for issues > identified by Evan. > > I am including a few small additions/fixes to include/llvm/ADT/ > {SparseBitVector,DepthFirstIterator}.h. > > Files: > include/llvm/ADT/DepthFirstIterator.h > include/llvm/ADT/SparseBitVector.h > lib/CodeGen/PrologEpilogInserter.cpp > > Evan, let me know how it looks when you get a chance. > > Thanks much, > John > > > <shrink- &gt...

LGTM. Was that the last use of SparseBitVector? Thanks, /jakob > On 30 Oct 2013, at 22:34, Rafael Espíndola <rafael.espindola at gmail.com> wrote: > >> On 30 October 2013 20:08, Evan Cheng <evan.cheng at apple.com> wrote: >> The current implementation in LLVM is experimental at best. It probably should be ripped...

...rote: > > > > > On Sep 24, 2007, at 3:07 PM, Bill Wendling wrote: > > > >> A debug or release build? > >> > >> -bw > > > > Both, actually. > > Weird. I see a potential problem, though. The code is like this: > > void dumpToDOUT(SparseBitVector<> *bitmap) { > dump(*bitmap, DOUT); > } > > where dump expects an llvm::OStream& for the second argument. > However, when NDEBUG is #defined, DOUT is "llvm::OStream(0)", so it > can't be passed by reference. What compiler are you compiling with? I build...

...iel Berlin <dberlin at dberlin.org> wrote: > On 9/24/07, Bill Wendling <isanbard at gmail.com> wrote: > > On Sep 24, 2007, at 3:15 PM, Dale Johannesen wrote: > > > > Weird. I see a potential problem, though. The code is like this: > > > > void dumpToDOUT(SparseBitVector<> *bitmap) { > > dump(*bitmap, DOUT); > > } > > > > where dump expects an llvm::OStream& for the second argument. > > However, when NDEBUG is #defined, DOUT is "llvm::OStream(0)", so it > > can't be passed by reference. > What compil...

.../Optional.h" #include "llvm/ADT/PointerUnion.h" #include "llvm/ADT/STLExtras.h" #include "llvm/ADT/SetVector.h" #include "llvm/ADT/SmallPtrSet.h" #include "llvm/ADT/SmallSet.h" #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/SparseBitVector.h" #include "llvm/ADT/Statistic.h" #include "llvm/ADT/StringExtras.h" #include "llvm/ADT/StringMap.h" #include "llvm/ADT/StringRef.h" #include "llvm/ADT/StringSet.h" #include "llvm/ADT/StringSwitch.h" #include "llvm/ADT/TinyPtrVe...

...d :) > > I agree that avoiding the indirection would be good, but, in practice, > getting the data structure in and refining it later also is fine. > > Please valgrind it when it has a client to make sure it isn't leaking > memory. > > Some minor comments: > > +/// SparseBitVector is an implementation of a bitvector that is sparse by only > +/// storing the elements that have non-zero bits set. In order to make this > +/// fast for the most common cases, SparseBitVector is implemented as a linked list > > Please wrap lines to fit in 80 columns. Done > > +...

...nt Sparse Bitmap ----*- C++ -*-===// Add '-'s to make the first line line exactly 80 cols. > +/// SparseBitmap is an implementation of a bitvector that is sparse by only > +/// storing the elements that have non-zero bits set. In order to make this I'd like to suggest the name SparseBitVector for this class, to correspond with the name of the existing BitVector class, which has a similar interface, but isn't sparse. > + SparseBitmapElement(unsigned Idx) { This misses an explicit keyword. > + if (Bitmap.Elements.empty()) > + { > + AtEnd =...

...ve-intervals option that enables that pass order. Then do the same to phi-elim: Live Variable Analysis Slot index numbering Live Interval Analysis Eliminate PHI nodes for register allocation Two-Address instruction pass Then LiveVariables can be deleted. (And so can SparseBitVector). When live intervals are computed on SSA form, we can use tricks to speed up live range computations for values that span large loops by resurrecting the MachineLoopRanges analysis. /jakob

The attached patch adds a SparseBitmap implementation, which more or less works the same way as GCC's sparse bitmap. That is, we only store non-zero bits (broken up into elements of some bit size), and store the elements in a linked list. We keep track of the last accessed part of the linked list, so in-order tests/sets/resets are all constant time, rather than linear time. Set operations

....h" >> #include "llvm/ADT/STLExtras.h" >> #include "llvm/ADT/SetVector.h" >> #include "llvm/ADT/SmallPtrSet.h" >> #include "llvm/ADT/SmallSet.h" >> #include "llvm/ADT/SmallVector.h" >> #include "llvm/ADT/SparseBitVector.h" >> #include "llvm/ADT/Statistic.h" >> #include "llvm/ADT/StringExtras.h" >> #include "llvm/ADT/StringMap.h" >> #include "llvm/ADT/StringRef.h" >> #include "llvm/ADT/StringSet.h" >> #include "llvm/ADT/...