- Dec 10, 2007
-
-
Anders Carlsson authored
llvm-svn: 44808
-
Chris Lattner authored
llvm-svn: 44807
-
Anders Carlsson authored
llvm-svn: 44806
-
Chuck Rose III authored
llvm-svn: 44805
-
Anders Carlsson authored
llvm-svn: 44804
-
Chris Lattner authored
These should probably be something like: CFI(".cfi_def_cfa_offset 16\n") where CFI is defined to a noop on darwin and other platforms that don't support those directives. llvm-svn: 44803
-
Duncan Sands authored
on functions as it calculates them. llvm-svn: 44802
-
Chris Lattner authored
llvm-svn: 44801
-
Devang Patel authored
llvm-svn: 44800
-
Devang Patel authored
llvm-svn: 44799
-
Devang Patel authored
llvm-svn: 44798
-
Ted Kremenek authored
llvm-svn: 44797
-
Duncan Sands authored
using the minimum possible number of bytes. For little endian targets run on little endian machines, apints are stored in memory from LSB to MSB as before. For big endian targets on big endian machines they are stored from MSB to LSB which wasn't always the case before (if the target and host endianness doesn't match values are stored according to the host's endianness). Doing this requires knowing the endianness of the host, which is determined when configuring - thanks go to Anton for this. Only having access to little endian machines I was unable to properly test the big endian part, which is also the most complicated... llvm-svn: 44796
-
Chris Lattner authored
llvm-svn: 44795
-
Anton Korobeynikov authored
All bad stuff from SSE version is implicitely inherited :) llvm-svn: 44794
-
Anton Korobeynikov authored
broken, because doesn't mark xmm regs properly llvm-svn: 44793
-
Anton Korobeynikov authored
This will allow us (theoretically) to unwind through JITer. The code wasn't verified, so I'm pretty sure offsets are wrong :) llvm-svn: 44792
-
Duncan Sands authored
get it to compile. llvm-svn: 44791
-
Anders Carlsson authored
llvm-svn: 44790
-
Chris Lattner authored
llvm-svn: 44789
-
Chris Lattner authored
llvm-svn: 44788
-
Chris Lattner authored
llvm-svn: 44787
-
Owen Anderson authored
how the CodeGen machinery works. llvm-svn: 44786
-
Christopher Lamb authored
Improve branch folding by recgonizing that explict successor relationships impact the value of fall-through choices. llvm-svn: 44785
-
Chris Lattner authored
llvm-svn: 44784
-
Chris Lattner authored
llvm-svn: 44783
-
Chris Lattner authored
llvm-svn: 44782
-
Chris Lattner authored
start making features be a more detailed description of the features/goals section on the main page. llvm-svn: 44781
-
Chris Lattner authored
llvm-svn: 44780
-
Chris Lattner authored
llvm-svn: 44779
-
Chris Lattner authored
llvm-svn: 44778
-
Chris Lattner authored
llvm-svn: 44777
-
Chris Lattner authored
llvm-svn: 44776
-
Gordon Henriksen authored
llvm-svn: 44775
-
Gordon Henriksen authored
llvm-svn: 44774
-
Gordon Henriksen authored
methods are new to Function: bool hasCollector() const; const std::string &getCollector() const; void setCollector(const std::string &); void clearCollector(); The assembly representation is as such: define void @f() gc "shadow-stack" { ... The implementation uses an on-the-side table to map Functions to collector names, such that there is no overhead. A StringPool is further used to unique collector names, which are extremely likely to be unique per process. llvm-svn: 44769
-
Chris Lattner authored
llvm-svn: 44763
-
Chris Lattner authored
llvm-svn: 44762
-
Chris Lattner authored
llvm-svn: 44761
-
Gordon Henriksen authored
_sabre_: it has a major problem: by the time ~Value is run, all of the "parts" of the derived classes have been destroyed _sabre_: the vtable lives to fight another day llvm-svn: 44760
-