llvm-svn: 77375

llvm-svn: 77188

 - This is now shorter, simpler, safer, and more efficient, what a deal.

llvm-svn: 77119

and efficient on a StringRef.

llvm-svn: 77117

values.  Hopefully this fixes PR4622.

llvm-svn: 77088

llvm-svn: 77051

test for it. The test is by no means complete, but it tests the problem I was
fixing.

llvm-svn: 77025

Revert the ConstantInt constructors back to their 2.5 forms where possible, thanks to contexts-on-types.  More to come.

llvm-svn: 77011

 - Not currently used.

llvm-svn: 76956

llvm-svn: 76904

bots like the BumpPtrAllocator changes.

llvm-svn: 76902

an off-by-one error.

llvm-svn: 76891

 - Yay for '-'s and simplifications!

 - I kept StringMap::GetOrCreateValue for compatibility purposes, this can
   eventually go away. Likewise the StringMapEntry Create functions still follow
   the old style.

 - NIFC.

llvm-svn: 76888

- Rename member function size(). New name is length().
- Store string beginning and length. Earlier it used to store string end.

llvm-svn: 76841

Reverting r76825 and r76828, since they caused clang runtime errors and some build failure involving memset.

llvm-svn: 76838

Derive MDNode from MetadataBase instead of Constant. Emit MDNodes into METADATA_BLOCK in bitcode file.

llvm-svn: 76834

out of memory, and also make the default memory manager allocate more memory
when it runs out.

Also, switch function stubs and global data over to using the BumpPtrAllocator.

This makes it so the JIT no longer mmaps (or the equivalent on Windows) 16 MB
of memory, and instead allocates in 512K slabs.  I suspect this size could go
lower, especially on embedded platforms, now that more slabs can be allocated.

llvm-svn: 76828

malloc, so there should be no functional changes to other code.

These changes are necessary since I have plans to use this allocator in the JIT
memory manager, and it needs a special allocator.

I also added some tests which helped me pinpoint some bugs.

llvm-svn: 76825

llvm-svn: 76754

llvm-svn: 76744

llvm-svn: 76559

llvm-svn: 76543

llvm-svn: 76542

return the smallest union of two ranges instead of just any range that happens
to contain the union.

llvm-svn: 76360

all values belonging to the intersection will belong to the resulting range.
The former was inconsistent about that point (either way is fine, just pick
one.) This is part of PR4545.

llvm-svn: 76289

 - Reid, please check, I'm not sure if this is what was intended.

llvm-svn: 76286

Also a test commit.

llvm-svn: 76276

 - Patch by Ryan Flynn!

llvm-svn: 76081

llvm-svn: 75703

llvm-svn: 75583

again to Daniel Dunbar and KLEE!

llvm-svn: 75449

Found by Daniel Dunbar and KLEE.

llvm-svn: 75448

Begin the painful process of tearing apart the rat'ss nest that is Constants.cpp and ConstantFold.cpp.
This involves temporarily hard wiring some parts to use the global context.  This isn't ideal, but it's
the only way I could figure out to make this process vaguely incremental.

llvm-svn: 75445

generally return Full on all wrapped inputs. "Fixes" PR4545.

llvm-svn: 75444

large as the full set, only those one size smaller. Thanks to Daniel Dunbar
who found this bug using Klee!

llvm-svn: 75443

llvm-svn: 75422

llvm-svn: 75413

Some = [10, 2730). A subset of that is [1024..2048) which covers every possible
10-bit pattern.

llvm-svn: 75411

llvm-svn: 75410

A full set is a constant range that represents any number. If you take the
umax of that and [5, 10) you end up with [5, INT_MAX] because the values less
than 5 would be umax's against a value which is at least 5.

llvm-svn: 75372