| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
http://llvm.org/bugs/show_bug.cgi?id=14919.
llvm-svn: 172447
|
|
|
|
|
|
| |
http://llvm.org/bugs/show_bug.cgi?id=14892.
llvm-svn: 172436
|
|
|
|
|
|
| |
http://llvm.org/bugs/show_bug.cgi?id=14648.
llvm-svn: 172435
|
|
|
|
| |
llvm-svn: 172250
|
|
|
|
| |
llvm-svn: 171980
|
|
|
|
|
|
| |
-I to that directory; rename 'iterators.h' to 'iterator_test.h'; remove hard-coded paths to include files from more than 350 source files
llvm-svn: 171594
|
|
|
|
| |
llvm-svn: 171498
|
|
|
|
|
|
| |
for libc++
llvm-svn: 171479
|
|
|
|
| |
llvm-svn: 171456
|
|
|
|
| |
llvm-svn: 171452
|
|
|
|
| |
llvm-svn: 171443
|
|
|
|
| |
llvm-svn: 171321
|
|
|
|
| |
llvm-svn: 170706
|
|
|
|
|
|
| |
bounds" calls
llvm-svn: 170435
|
|
|
|
|
|
| |
http://llvm.org/bugs/show_bug.cgi?id=14585.
llvm-svn: 170026
|
|
|
|
| |
llvm-svn: 169686
|
|
|
|
|
|
| |
- Also, support overriding them with lit parameters.
llvm-svn: 168749
|
|
|
|
|
|
| |
http://llvm.org/bugs/show_bug.cgi?id=13874
llvm-svn: 164266
|
|
|
|
| |
llvm-svn: 161289
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
allocate two
integers which remain unused and are subsequently leaked, so the test
fail when run under valgrind. Unless I'm overlooking a subtle reason
why they are needed I think they can be removed, allowing these tests
to pass under valgrind. The attached patch removes the variables. If
there is a reason for them to exist, I can change this to just delete
them at the end of the test.
llvm-svn: 161195
|
|
|
|
|
|
|
|
|
| |
tests so
that the valgrind configuration passed to lit.py is used to run .pass
tests.
llvm-svn: 161193
|
|
|
|
|
|
|
|
|
| |
test/input.output/iostream.format/output.streams/ostream.formatted/ostream.inserters.arithmetic/pointer.pass.cpp
to accept '(nil)' as a valid representation for NULL so that the test
passes on Linux. The same thing is already done in some other tests,
like in /test/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.members/put_pointer.pass.cpp.
llvm-svn: 161188
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
section in libc++. This requires a recompiled dylib. Failure to rebuild
the dylib will result in a link-time error if and only if the functions from
[util.smartptr.shared.atomic] are used.
The implementation is not lock free. After considerable thought, I know of no
way to make the implementation lock free. Ideas welcome along that front. But
changing the ABI of shared_ptr is not on the table at this point.
The mutex used to lock these function is encapsulated by std::__sp_mut. The
only thing the client knows about std::__sp_mut is that it has a void* data
member, can't be constructed, and has lock and unlock members. Within the
binary __sp_mut is currently implemented as a pointer to a std::mutex. That can
change in the future without disturbing the ABI (as long as sizeof(__sp_mut)
remains constant.
I specifically did not make __sp_mut a spin lock as I have a pathological
distrust of spin locks. Testing on OS X reveals that the use of std::mutex in
this role is not a large performance penalty as long as the contention for the
mutex is low (more likely to get the lock than to have to wait). In the future
we can still make __sp_mut a spin lock if that is what is desired (without ABI
damage).
The dylib contains 16 __sp_mut's to be chosen based on the hash of the address
of the shared_ptr. The constant 16 is a ball-park reasonable space/time
tradeoff.
std::hash<T*> was changed to call __murmur2_or_cityhash, instead of the identity
function. I had thought we had already done this, but I was mistaken.
All of this is under #if __has_feature(cxx_atomic) even though the
implementation is not lock free, because the signatures require access to
std::memory_order, which is currently available only under
__has_feature(cxx_atomic).
llvm-svn: 160940
|
|
|
|
|
|
| |
<cstddef>. This was brought to my attention by Salvatore Benedetto in his port to a bare-metal coretex-m3. This exposed two test bugs where an explicit #include <cstdlib> was needed.
llvm-svn: 160786
|
|
|
|
| |
llvm-svn: 160604
|
|
|
|
| |
llvm-svn: 160593
|
|
|
|
| |
llvm-svn: 160585
|
|
|
|
| |
llvm-svn: 160566
|
|
|
|
| |
llvm-svn: 160565
|
|
|
|
| |
llvm-svn: 160564
|
|
|
|
|
|
| |
Args...> to only check Fp, and not Args... . This should be sufficient to give the desired high quality diagnostics under both bind and function. And this allows a test reported by Rich E on cfe-dev to pass. Tracked by <rdar://problem/11880602>.
llvm-svn: 160285
|
|
|
|
| |
llvm-svn: 160184
|
|
|
|
|
|
| |
Jonathan Coxhead for reporting this bug.
llvm-svn: 160136
|
|
|
|
| |
llvm-svn: 159921
|
|
|
|
| |
llvm-svn: 159899
|
|
|
|
| |
llvm-svn: 159857
|
|
|
|
| |
llvm-svn: 159846
|
|
|
|
|
|
| |
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: 157832
|
|
|
|
|
|
| |
changed a while back and I'm just now updating to these new rules. In a nutshell, you've got to know you're emplacing to a pair and use one of pair's constructors. I made one extension: If you want to emplace the key and default construct the mapped_type, you can just emplace(key), as opposed to emplace(piecewise_construct, forward_as_tuple(key), forward_as_tuple()).
llvm-svn: 157503
|
|
|
|
|
|
|
| |
at the moment, but they allow these tests to be used to test clang against
libstdc++. Add myself to the credits file, as suggested by Howard.
llvm-svn: 155085
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
compare-and-exchange failed (it should update the expected value to the current
value, and the tests were checking that it didn't...).
Results of the atomics part of the test suite on FreeBSD with clang trunk and
the atomic.c from compiler-rt (currently kludged into the test, not installed
properly):
****************************************************
Results for /root/libc++/test/atomics:
using clang version 3.1 (trunk 153415)
Target: x86_64-unknown-freebsd10.0
Thread model: posix
with -std=c++0x -stdlib=libc++ -pthread /tmp/atomic.o
----------------------------------------------------
sections without tests : 0
sections with failures : 0
sections without failures: 14
+ ----
total number of sections : 14
----------------------------------------------------
number of tests failed : 0
number of tests passed : 52
+ ----
total number of tests : 52
****************************************************
Yay!
llvm-svn: 154095
|
|
|
|
|
|
|
|
| |
copyable.
Now all of the test cases compile. Some of them even run!
llvm-svn: 154094
|
|
|
|
| |
llvm-svn: 153896
|
|
|
|
|
|
| |
addresses http://llvm.org/bugs/show_bug.cgi?id=12436.
llvm-svn: 153873
|
|
|
|
|
|
| |
is/will be making convincing arguments that a modified form of LWG 2051 (currently NAD Future) is easily acheivable and desirable. He has demonstrated that a tuple<T...> where all of the T are implicitly convertible from U... should have a tuple constructor that is also implicit, instead of explicit. This would support the use cases in LWG 2051 while not undermining T... with explicit conversions from U.... This check-in is an experimental implementation of Daniel's work. I believe this work to be mature enough to warrant inclusion into libc++. If anyone sees real-world problems that this check in causes, please let me know and I will revert it, and provide the feedback to the LWG.
llvm-svn: 153855
|
|
|
|
|
|
| |
part is just some renaming as the variable was already in use, conflicting with something else in the LLVM tree. Contributed by Ruben Van Boxem.
llvm-svn: 153036
|
|
|
|
| |
llvm-svn: 152716
|
|
|
|
| |
llvm-svn: 152501
|
|
|
|
| |
llvm-svn: 151719
|