a 'weak' property just as we do the same for
'weak' variables. // rdar://11814185

llvm-svn: 159859

As a conforming extension give tuple a noexcept default constructor conditionalized on its held types.

llvm-svn: 159858

llvm-svn: 159857

llvm-svn: 159856

llvm-svn: 159854

llvm-svn: 159852

Include file MipsGenRegisterInfo.inc.

llvm-svn: 159851

llvm-svn: 159850

llvm-svn: 159849

llvm-svn: 159848

over objective-c container collection. // rdar://9293227

llvm-svn: 159847

llvm-svn: 159846

currently we take address of std::vector's contents only after we finished
adding all comments (so no reallocation can happen), this will change in
future.

llvm-svn: 159845

llvm-svn: 159844

llvm-svn: 159843

llvm-svn: 159842

llvm-svn: 159841

SBSymbolContextList, we should include the
relevant header file.

llvm-svn: 159840

llvm-svn: 159839

For each Cmp, we check whether there is an earlier Sub which make Cmp
redundant. We handle the case where SUB operates on the same source operands as
Cmp, including the case where the two source operands are swapped.

llvm-svn: 159838

llvm-svn: 159837

This commit establishes a new bucket_count policy in the unordered containers:  The policy now allows a power-of-2 number of buckets to be requested (and that request honored) by the client.  And if the number of buckets is set to a power of 2, then the constraint of the hash to the number of buckets uses & instead of %.  If the client does not specify a number of buckets, then the policy remains unchanged:  a prime number of buckets is selected.  The growth policy is that the number of buckets is roughly doubled when needed.  While growing, either the prime, or the power-of-2 strategy will be preserved.  There is a small run time cost for putting in this switch.  For very cheap hash functions, e.g. identity for int, the cost can be as high as 18%.  However with more typical use cases, e.g. strings, the cost is in the noise level.  I've measured cases with very cheap hash functions (int) that using a power-of-2 number of buckets can make look up about twice as fast.  However I've also noted that a power-of-2 number of buckets is more susceptible to accidental catastrophic collisions.  Though I've also noted that accidental catastrophic collisions are also possible when using a prime number of buckets (but seems far less likely).  In short, this patch adds an extra tuning knob for those clients trying to get the last bit of performance squeezed out of their hash containers.  Casual users of the hash containers will not notice the introduction of this tuning knob.  Those clients who swear by power-of-2 hash containers can now opt-in to that strategy.  Clients who prefer a prime number of buckets can continue as they have.

llvm-svn: 159836

llvm-svn: 159835

llvm-svn: 159834

llvm-svn: 159833

llvm-svn: 159832

llvm-svn: 159831

llvm-svn: 159830

llvm-svn: 159829

llvm-svn: 159827

llvm-svn: 159826

llvm-svn: 159825

llvm-svn: 159824

llvm-svn: 159823

do so by factoring the CFAllocator logic into ReplaceCFAllocator(), which is called from
either the __CFInitialize wrapper or __asan_init(), depending on which of them is called later.

llvm-svn: 159822

A portable way to check whether __CFInitialize has been called: compare kCFAllocatorSystemDefault._base._cfisa to 0.
This should fix http://code.google.com/p/address-sanitizer/issues/detail?id=87 on both Lion and Snow Leopard.

llvm-svn: 159821

llvm-svn: 159820

This change may cause http://code.google.com/p/address-sanitizer/issues/detail?id=87 to re-appear on Lion.

llvm-svn: 159819

llvm-svn: 159818

It broke LLVM :: CodeGen/Thumb2/large-call.ll on several hosts.

llvm-svn: 159817