llvm-svn: 42707

llvm-svn: 42698

llvm-svn: 42697

llvm-svn: 42696

Inspired by Laurence Tratt's patch

llvm-svn: 42695

llvm-svn: 42691

part widths.  Also, return the number of parts actually required to
hold the result's value.
Remove an over-cautious condition from rounding of float->hex conversion.

llvm-svn: 42669

llvm-svn: 42668

bindings headers themselves, hidden behind #ifdef __cplusplus.

llvm-svn: 42666

basic arithmetic works.
Rename RTLIB long double functions to distinguish
different flavors of long double; the lib functions
have different names, alas.

llvm-svn: 42644

llvm-svn: 42639

llvm-svn: 42633

produce two results.

llvm-svn: 42632

llvm-svn: 42631

Optimize |= case for empty RHS

llvm-svn: 42629

scheduler will try a number of tricks in order to avoid generating the
copies. This may not be possible in case the node produces a chain value
that prevent movement. Try unfolding the load from the node before to allow
it to be moved / cloned.

llvm-svn: 42625

address (not just from / to frameindexes).
- Added target hooks to unfold load / store instructions / SDNodes into separate
load, data processing, store instructions / SDNodes.

llvm-svn: 42621

llvm-svn: 42620

llvm-svn: 42613

llvm-svn: 42612

dereferencing things.

llvm-svn: 42605

Make SparseBitVector::set actually work properly when sets are not in ascending or descending order.

llvm-svn: 42604

Useful for diagnostics and debugging.

llvm-svn: 42598

Also, add a FIXME for a bug in PostDomTree calculation I noticed while writing this,

llvm-svn: 42593

Add a GraphTraits partial specialization to make the inverse of an inverse be the same as the underlying graph.

llvm-svn: 42592

llvm-svn: 42589

llvm-svn: 42584

it const.

Preparation for APFloat -> hexadecimal string conversion.

llvm-svn: 42576

llvm-svn: 42575

each one's runOnFunction method.

llvm-svn: 42563

llvm-svn: 42537

llvm-svn: 42499

llvm-svn: 42488

llvm-svn: 42487

llvm-svn: 42480

Template-ize more of the DomTree internal implementation details.  Only the calculate() methods for DomTree and PostDomTree remain to be merged/template-ized.

llvm-svn: 42476

llvm-svn: 42474

llvm-svn: 42470

This version enhances the previous patch to add root initialization
as discussed here:

http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20070910/053455.html

Collector gives its subclasses control over generic algorithms:

  unsigned NeededSafePoints; //< Bitmask of required safe points.
  bool CustomReadBarriers;   //< Default is to insert loads.
  bool CustomWriteBarriers;  //< Default is to insert stores.
  bool CustomRoots;          //< Default is to pass through to backend.
  bool InitRoots;            //< If set, roots are nulled during lowering.

It also has callbacks which collectors can hook:

  /// If any of the actions are set to Custom, this is expected to
  /// be overriden to create a transform to lower those actions to
  /// LLVM IR.
  virtual Pass *createCustomLoweringPass() const;

  /// beginAssembly/finishAssembly - Emit module metadata as
  /// assembly code.
  virtual void beginAssembly(Module &M, std::ostream &OS,
                             AsmPrinter &AP,
                             const TargetAsmInfo &TAI) const;
  virtual void finishAssembly(Module &M,
                              CollectorModuleMetadata &CMM,
                              std::ostream &OS, AsmPrinter &AP,
                              const TargetAsmInfo &TAI) const;  

Various other independent algorithms could be implemented, but were
not necessary for the initial two collectors. Some examples are
listed here:

http://llvm.org/docs/GarbageCollection.html#collector-algos

llvm-svn: 42466

llvm-svn: 42465