llvm-svn: 120817

llvm-svn: 120803

llvm-svn: 120785

a file exists when it shouldn't.

llvm-svn: 120784

llvm-svn: 120776

llvm-svn: 120616

llvm-svn: 120600

llvm-svn: 120590

setAllBits(), setBit(unsigned), etc.

llvm-svn: 120564

llvm-svn: 120560

Support/PathV2: Add has_{root_path,root_name,root_directory,parent_path,filename,stem,extension} implementation.

llvm-svn: 120559

I'm going to replace this all anyway with a proper table and separated tests
when done.

llvm-svn: 120558

llvm-svn: 120550

llvm-svn: 120547

llvm-svn: 120546

llvm-svn: 120539

llvm-svn: 120514

llvm-svn: 120513

llvm-svn: 120496

llvm-svn: 120349

llvm-svn: 120330

llvm-svn: 120329

llvm-svn: 120298

We always disallowed overlapping inserts with different values, and this makes
the insertion code smaller and faster.

If an overwriting insert is needed, it can be added as a separate method that
trims any existing intervals before inserting. The immediate use cases for
IntervalMap don't need this - they only use disjoint insertions.

llvm-svn: 120264

These iterators don't point anywhere, and they can't be compared to anything.
They are only good for assigning to.

llvm-svn: 120239

This is a version of find() that always searches forwards and is faster for
local searches.

llvm-svn: 120237

llvm-svn: 120227

Implement iterator::erase() in a simple version that erases nodes when they
become empty, but doesn't try to redistribute elements among siblings for better
packing.

Handle coalescing across leaf nodes which may require erasing entries.

llvm-svn: 120226

GNU ld/PECOFF accepts but ignores them below;
  --version-script
  --export-dynamic
  --rpath

FIXME: autoconf should be aware of them.
llvm-svn: 120179

Change temporary debugging code to write a dot file directly.

llvm-svn: 120171

llvm-svn: 120105

llvm-svn: 120103

llvm-svn: 120101

to use lowercase letters for the start of most
method names and to replace some method names
with more descriptive names (e.g., "getLeft()"
instead of "Left()").  No real functionality
change.

llvm-svn: 120070

being in terms of excessively complex template logic.

llvm-svn: 119992

llvm-svn: 119872

llvm-svn: 119871

llvm-svn: 119870

This is a sorted interval map data structure for small keys and values with
automatic coalescing and bidirectional iteration over coalesced intervals.

Except for coalescing intervals, it provides similar functionality to std::map.
It is however much more compact for small keys and values, and hopefully faster
too.

The container object itself can hold the first few intervals without any
allocations, then it switches to a cache conscious B+-tree representation. A
recycling allocator can be shared between many containers, even between
containers holding different types.

The IntervalMap is initially intended to be used with SlotIndex intervals for:

- Backing store for LiveIntervalUnion that is smaller and faster than std::set.

- Backing store for LiveInterval with less overhead than std::vector for typical
  intervals and O(N log N) merging of large intervals. 99% of virtual registers
  need 4 entries or less and would benefit from the small object optimization.

- Backing store for LiveDebugVariable which doesn't exist yet, but will track
  debug variables during register allocation.

This is a work in progress. Missing items are:

- Performance metrics.
- erase().
- insert() shrinkage.
- clear().
- More performance metrics.
- Simplification and detemplatization.

llvm-svn: 119787

CMake can pass *.def to link.exe.

llvm-svn: 119783