Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | Initial checking: defult the make_vector function | Chris Lattner | 2003-01-28 | 1 | -0/+29 | |
| | | | | llvm-svn: 5424 | |||||
* | Move annotation to support library | Chris Lattner | 2003-01-14 | 1 | -9/+7 | |
| | | | | llvm-svn: 5268 | |||||
* | New files for miscompilation detection | Chris Lattner | 2002-12-23 | 1 | -0/+46 | |
| | | | | llvm-svn: 5120 | |||||
* | Fix header | Chris Lattner | 2002-12-12 | 1 | -1/+2 | |
| | | | | llvm-svn: 4966 | |||||
* | Bug fix in operator==() and in method fini(). | Vikram S. Adve | 2002-12-06 | 1 | -4/+5 | |
| | | | | llvm-svn: 4945 | |||||
* | Several fixes: | Vikram S. Adve | 2002-11-27 | 1 | -18/+47 | |
| | | | | | | | | | | | (1) Applied patch from Casey to implement iterator::operator= correctly: it should use a pointer, not a reference. (2) Added operators == and !=, and method all(). (3) Important bug fix: excess bits need to be ignored in operations like ==, count(), and all(). We do this by ensuring excess bits in the last bitset are always 0. llvm-svn: 4837 | |||||
* | Add facility to compute peak memory usage | Chris Lattner | 2002-11-18 | 1 | -0/+11 | |
| | | | | llvm-svn: 4752 | |||||
* | Fix warning | Chris Lattner | 2002-11-15 | 1 | -3/+1 | |
| | | | | llvm-svn: 4708 | |||||
* | Add tarj_end() method | Chris Lattner | 2002-11-10 | 1 | -0/+5 | |
| | | | | llvm-svn: 4684 | |||||
* | Fix a problem where bad graphs could be generated | Chris Lattner | 2002-11-10 | 1 | -1/+3 | |
| | | | | llvm-svn: 4671 | |||||
* | Include HashExtras.h since it is almost always needed anyway. | Vikram S. Adve | 2002-11-08 | 2 | -0/+4 | |
| | | | | llvm-svn: 4626 | |||||
* | Make maxSize a private variable, add a size() accessor | Chris Lattner | 2002-11-06 | 1 | -4/+6 | |
| | | | | llvm-svn: 4573 | |||||
* | An implementation of the bit-vector representation of sets. | Vikram S. Adve | 2002-11-06 | 1 | -0/+239 | |
| | | | | llvm-svn: 4568 | |||||
* | Allow memory sizes to be negative, eliminate TmpRSS | Chris Lattner | 2002-11-04 | 1 | -5/+3 | |
| | | | | llvm-svn: 4539 | |||||
* | Generic graph iterator to enumerate the SCCs of a graph | Vikram S. Adve | 2002-11-04 | 1 | -0/+221 | |
| | | | | | | in linear time using Tarjan's DFS algorithm. llvm-svn: 4531 | |||||
* | Statistic class should return const reference to *this, not a reference to | Chris Lattner | 2002-10-31 | 1 | -6/+6 | |
| | | | | | | the data type. llvm-svn: 4458 | |||||
* | Don't #include <Support/*>, #include "Support/*" | Chris Lattner | 2002-10-28 | 4 | -4/+4 | |
| | | | | llvm-svn: 4325 | |||||
* | Add neccesary #include | Chris Lattner | 2002-10-27 | 1 | -0/+1 | |
| | | | | llvm-svn: 4294 | |||||
* | Old GCC's don't have an <ostream> | Chris Lattner | 2002-10-27 | 1 | -1/+1 | |
| | | | | llvm-svn: 4293 | |||||
* | Don't emit braces around something without outgoing edges | Chris Lattner | 2002-10-18 | 1 | -3/+5 | |
| | | | | llvm-svn: 4225 | |||||
* | Break up the GraphWriter into smaller chunks to be used in different ways | Chris Lattner | 2002-10-17 | 1 | -10/+17 | |
| | | | | llvm-svn: 4207 | |||||
* | As wierd as it feels to type it, const void* is more generic than void* | Chris Lattner | 2002-10-17 | 1 | -9/+19 | |
| | | | | llvm-svn: 4206 | |||||
* | Allow simple nodes to have outgoing edges | Chris Lattner | 2002-10-16 | 1 | -5/+16 | |
| | | | | llvm-svn: 4202 | |||||
* | * Factor printing code again, add emitSimpleNode method | Chris Lattner | 2002-10-16 | 1 | -8/+29 | |
| | | | | llvm-svn: 4198 | |||||
* | * Add new DOTGraphTraits::addCustomGraphFeatures method | Chris Lattner | 2002-10-16 | 2 | -0/+13 | |
| | | | | llvm-svn: 4197 | |||||
* | * Significantly refactor GraphWriter into a class. | Chris Lattner | 2002-10-16 | 1 | -41/+69 | |
| | | | | llvm-svn: 4194 | |||||
* | - Generic graph printing infrastructure changes: | Chris Lattner | 2002-10-16 | 1 | -18/+19 | |
| | | | | | | | | * Only print outgoing edges from a cell if the destination isn't null. This is important for DSGraphs, which have sources with no edges. * Allow Node attributes to override shape of the node llvm-svn: 4192 | |||||
* | disable the unused "pointer" member | Chris Lattner | 2002-10-13 | 1 | -1/+3 | |
| | | | | llvm-svn: 4144 | |||||
* | Add dummy entries to document what members can be added | Chris Lattner | 2002-10-13 | 1 | -0/+7 | |
| | | | | llvm-svn: 4141 | |||||
* | * Don't only print out reachable nodes in the graph. | Chris Lattner | 2002-10-10 | 1 | -7/+7 | |
| | | | | | | | * use new api to get all nodes in the graph * Allow custom graph traits llvm-svn: 4109 | |||||
* | Add new getGraphProperties that may be specialized by graphs | Chris Lattner | 2002-10-10 | 1 | -0/+8 | |
| | | | | llvm-svn: 4108 | |||||
* | Don't rotate paper. | Chris Lattner | 2002-10-07 | 1 | -2/+1 | |
| | | | | llvm-svn: 4066 | |||||
* | - Allow printing generic LLVM graphs to 'dot' files, so they can be | Chris Lattner | 2002-10-07 | 2 | -0/+188 | |
| | | | | | | visualized easily. llvm-svn: 4061 | |||||
* | The wall clock timer (implementing using the RTC or cycle counter on x86) is | Chris Lattner | 2002-10-03 | 1 | -7/+1 | |
| | | | | | | | so much more accurate than the per process timers that we get better results (less noise) by sorting according to wall time than process time. llvm-svn: 4034 | |||||
* | - Rework Statistics: | Chris Lattner | 2002-10-01 | 2 | -97/+12 | |
| | | | | | | | | | | | * Renamed StatisticReporter.h/cpp to Statistic.h/cpp * Broke constructor to take two const char * arguments instead of one, so that indendation can be taken care of automatically. * Sort the list by pass name when printing * Make sure to print all statistics as a group, instead of randomly when the statistics dtors are called. llvm-svn: 3999 | |||||
* | Checkin generic interval timer support | Chris Lattner | 2002-10-01 | 1 | -0/+136 | |
| | | | | llvm-svn: 3992 | |||||
* | Fix ambiguity problem due to builtin log2(double) function | Chris Lattner | 2002-09-17 | 1 | -1/+1 | |
| | | | | llvm-svn: 3800 | |||||
* | Add ilist_iterator constructor from a node reference. | Vikram S. Adve | 2002-09-16 | 1 | -0/+1 | |
| | | | | llvm-svn: 3756 | |||||
* | Fix to work correctly under linux | Chris Lattner | 2002-09-14 | 1 | -9/+18 | |
| | | | | llvm-svn: 3720 | |||||
* | Add support for MacOS and (hopefully) other BSD derivatives. | Vikram S. Adve | 2002-09-14 | 1 | -1/+5 | |
| | | | | llvm-svn: 3717 | |||||
* | Tighten up sanity checking | Chris Lattner | 2002-09-13 | 1 | -3/+1 | |
| | | | | llvm-svn: 3706 | |||||
* | Try to work well on multiple platforms. | Chris Lattner | 2002-09-13 | 1 | -4/+12 | |
| | | | | llvm-svn: 3704 | |||||
* | Add better linux support by using the right macro. This still should be | Chris Lattner | 2002-09-13 | 1 | -1/+1 | |
| | | | | | | autoconfiscated, but for now this is sufficient. llvm-svn: 3701 | |||||
* | Checkin patch written by Casey Carter, enabling support for the redhat GCC 2.96 | Chris Lattner | 2002-09-13 | 1 | -0/+4 | |
| | | | | | | compiler. llvm-svn: 3697 | |||||
* | Checkin initial support for automatic memory leak detection routines | Chris Lattner | 2002-09-08 | 1 | -0/+79 | |
| | | | | llvm-svn: 3617 | |||||
* | Simplify interface to parsers. | Chris Lattner | 2002-08-07 | 1 | -92/+77 | |
| | | | | llvm-svn: 3255 | |||||
* | Add support for GCC 3.0.4 | Chris Lattner | 2002-07-25 | 2 | -0/+26 | |
| | | | | llvm-svn: 3080 | |||||
* | GCC 3.1 changes | Chris Lattner | 2002-07-25 | 2 | -1/+8 | |
| | | | | llvm-svn: 3076 | |||||
* | GCC 3.1 fixes | Chris Lattner | 2002-07-24 | 4 | -8/+24 | |
| | | | | llvm-svn: 3066 | |||||
* | Changes to build with GCC 3.1 | Chris Lattner | 2002-07-24 | 2 | -14/+16 | |
| | | | | llvm-svn: 3064 |