Chris Lattner
|
f131358f59
|
Generalize ExportSymbols into PLATFORMLINKOPTS
llvm-svn: 4542
|
2002-11-04 20:50:33 +00:00 |
Chris Lattner
|
745b8516d2
|
Allow memory sizes to be negative, eliminate TmpRSS
llvm-svn: 4539
|
2002-11-04 19:20:09 +00:00 |
Chris Lattner
|
32856be0f0
|
Allow memory sizes to be negative, remove obsolete TmpRSS field
llvm-svn: 4538
|
2002-11-04 19:19:36 +00:00 |
Chris Lattner
|
203be1a568
|
mallinfo is not available on sun apparently :(
llvm-svn: 4537
|
2002-11-04 19:01:41 +00:00 |
Chris Lattner
|
5d606a09ff
|
Instcombine this away:
%A = getelementptr [4 x int]* %M, long 0, long 0
%B = getelementptr int* %A, long 2
llvm-svn: 4536
|
2002-11-04 16:43:32 +00:00 |
Chris Lattner
|
d113c7013e
|
Add new getelementptr elimination test
llvm-svn: 4535
|
2002-11-04 16:35:14 +00:00 |
Chris Lattner
|
1085bdf49f
|
Add a transformation to turn:
malloc Ty, C
int
malloc [C x Ty], 1
llvm-svn: 4534
|
2002-11-04 16:18:53 +00:00 |
Chris Lattner
|
9771be0482
|
New testcase for malloc promotion
llvm-svn: 4533
|
2002-11-04 16:18:07 +00:00 |
Vikram S. Adve
|
5beed607f4
|
Simple passes that print out SCCs in the CFGs or in the CallGraph of a module.
llvm-svn: 4532
|
2002-11-04 14:20:22 +00:00 |
Vikram S. Adve
|
a9c3afbe4f
|
Generic graph iterator to enumerate the SCCs of a graph
in linear time using Tarjan's DFS algorithm.
llvm-svn: 4531
|
2002-11-04 14:15:57 +00:00 |
Chris Lattner
|
7e8b76009f
|
Change the "Cannot merge two portions of the same node yet" from an assertion
into a "oh crap, lets collapse" case
llvm-svn: 4530
|
2002-11-04 06:48:26 +00:00 |
Chris Lattner
|
4a8f7f2159
|
Add information about why this testcase fails
llvm-svn: 4529
|
2002-11-04 06:16:13 +00:00 |
Chris Lattner
|
eaa6d1370f
|
Convert uint gep operands to long
llvm-svn: 4528
|
2002-11-04 06:09:46 +00:00 |
Chris Lattner
|
a685b90b35
|
Convert old style gep index from uint to long
llvm-svn: 4527
|
2002-11-04 06:07:04 +00:00 |
Chris Lattner
|
0544dadbee
|
Ack: Fix bug in previous checkin.
llvm-svn: 4526
|
2002-11-04 05:50:42 +00:00 |
Chris Lattner
|
4262f815b5
|
Be more generous about level raising constant expressions don't force each
constant to one particular type.
llvm-svn: 4525
|
2002-11-04 05:46:37 +00:00 |
Chris Lattner
|
2743db5934
|
Implement a new -print-callgraph analysis that turns a callgraph into a dot
graph
llvm-svn: 4524
|
2002-11-04 02:55:30 +00:00 |
Chris Lattner
|
669c6cf459
|
Make sure to _delete_ memory allocated by worklists
llvm-svn: 4523
|
2002-11-04 02:54:22 +00:00 |
Chris Lattner
|
0ac3e3c039
|
Implement methods needed to print out call graph
llvm-svn: 4522
|
2002-11-04 02:53:39 +00:00 |
Chris Lattner
|
cd691d2047
|
Give a better error message in an unhandled case
llvm-svn: 4521
|
2002-11-04 02:29:15 +00:00 |
Chris Lattner
|
ee792946bb
|
Minor fix to space accounting
llvm-svn: 4520
|
2002-11-04 01:49:45 +00:00 |
Chris Lattner
|
db3e21f9fe
|
Improve the clean target
llvm-svn: 4519
|
2002-11-04 00:33:19 +00:00 |
Chris Lattner
|
559f5118d1
|
Implement MaxRSS in terms of mallinfo instead of the system RSS. This gives
us much more accurate numbers and actually WORKS.
llvm-svn: 4518
|
2002-11-04 00:32:44 +00:00 |
Chris Lattner
|
b9d55473b5
|
Allow the call graph to be called from analyze naturally with print implemented
llvm-svn: 4517
|
2002-11-04 00:21:19 +00:00 |
Chris Lattner
|
a20fabc7ec
|
Rename ValueMap to ScalarMap
llvm-svn: 4516
|
2002-11-03 21:27:48 +00:00 |
Chris Lattner
|
bd7af8e664
|
Rename NewNode flag to HeapNode
llvm-svn: 4515
|
2002-11-03 21:24:04 +00:00 |
Chris Lattner
|
4b6a813048
|
Change the letters used to represent stack and heap allocations to "S" and "H"
respectively. This is to make presentation easier in the paper.
llvm-svn: 4514
|
2002-11-03 19:46:15 +00:00 |
Chris Lattner
|
64b4ee3abc
|
Check in header file that was missing, thus broke the build
llvm-svn: 4513
|
2002-11-03 19:24:49 +00:00 |
Vikram S. Adve
|
a8ebc7af15
|
Disable correlated expressions pass until it is reliable.
llvm-svn: 4512
|
2002-11-03 12:41:50 +00:00 |
Anand Shukla
|
320febba68
|
code to lightly instrument at branches
llvm-svn: 4511
|
2002-11-03 01:45:20 +00:00 |
Chris Lattner
|
36051c0c56
|
Move function to cpp file from header
llvm-svn: 4510
|
2002-11-02 22:07:51 +00:00 |
Misha Brukman
|
5ab3a23f2e
|
Fixed comment on top of DSNode.h, added note to DSSupport.h as to why
functions were split out from DSNode class.
llvm-svn: 4509
|
2002-11-02 21:18:53 +00:00 |
Chris Lattner
|
781986c436
|
Implement signed and unsigned division and remainder
llvm-svn: 4508
|
2002-11-02 20:54:46 +00:00 |
Chris Lattner
|
b322f1666a
|
Enable div and mod tests
llvm-svn: 4507
|
2002-11-02 20:54:11 +00:00 |
Chris Lattner
|
d12e1bc777
|
Implement multiply operator
llvm-svn: 4506
|
2002-11-02 20:28:58 +00:00 |
Chris Lattner
|
97c2c655c8
|
Enable multiply tests
llvm-svn: 4505
|
2002-11-02 20:28:47 +00:00 |
Chris Lattner
|
656474b680
|
New testcase for arithmetic operations
llvm-svn: 4504
|
2002-11-02 20:13:40 +00:00 |
Chris Lattner
|
e823fb32f4
|
* Implement subtract
* Merge add code into logical code
llvm-svn: 4503
|
2002-11-02 20:13:22 +00:00 |
Chris Lattner
|
dd873d2179
|
shuffle code around a bit, implement and, or, xor
llvm-svn: 4502
|
2002-11-02 20:04:26 +00:00 |
Chris Lattner
|
bde990f226
|
New testcase for logical operators
llvm-svn: 4501
|
2002-11-02 20:04:02 +00:00 |
Chris Lattner
|
abe3280ad9
|
Add PHI node support, add comment for branch function
llvm-svn: 4500
|
2002-11-02 19:45:49 +00:00 |
Chris Lattner
|
856c0850ab
|
Make phi test a bit more challenging
llvm-svn: 4499
|
2002-11-02 19:45:30 +00:00 |
Chris Lattner
|
16af2d5aa8
|
Implement unconditional branching support
llvm-svn: 4498
|
2002-11-02 19:27:56 +00:00 |
Chris Lattner
|
3c9f5f45f6
|
Only test that uncond branch works
llvm-svn: 4497
|
2002-11-02 19:27:45 +00:00 |
Chris Lattner
|
cfb187f6bb
|
* Fix nonconstant shift case
* Turn table into 2d table
llvm-svn: 4496
|
2002-11-02 01:41:55 +00:00 |
Chris Lattner
|
a604a85c55
|
Expose a LJELLO variable
llvm-svn: 4495
|
2002-11-02 01:41:07 +00:00 |
Chris Lattner
|
b6f549bc6a
|
Tests results are invalidated when jello is rebuilt
llvm-svn: 4494
|
2002-11-02 01:40:24 +00:00 |
Chris Lattner
|
ff3d28f403
|
Use a more table driven approach to handling types. Seems to simplify the
code a bit
llvm-svn: 4493
|
2002-11-02 01:15:18 +00:00 |
Chris Lattner
|
63f4e752cd
|
Make switch statements denser, but only because of the follow-on patch
llvm-svn: 4492
|
2002-11-02 00:49:56 +00:00 |
Chris Lattner
|
122b73b7a6
|
* Remove dead variable
* Shift amount is always guaranteed to be 8 bits
llvm-svn: 4491
|
2002-11-02 00:44:25 +00:00 |