Benjamin Kramer 250eb005d9 Avoid O(n*m) complexity in StringRef::find_first(_not)_of(StringRef). ... - Cache used characters in a bitset to reduce memory overhead to just 32 bytes. - On my core2 this code is faster except when the checked string was very short (smaller than the list of delimiters). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@111817 91177308-0d34-0410-b5e6-96231b3b80d8		2010-08-23 18:16:08 +00:00
..
Analysis	Now that PassInfo and Pass::ID have been separated, move the rest of the passes over to the new registration API.	2010-08-23 17:52:01 +00:00
Archive
AsmParser	Create the new linker type "linker_private_weak_def_auto".	2010-08-20 22:05:50 +00:00
Bitcode	Create the new linker type "linker_private_weak_def_auto".	2010-08-20 22:05:50 +00:00
CodeGen	Now that PassInfo and Pass::ID have been separated, move the rest of the passes over to the new registration API.	2010-08-23 17:52:01 +00:00
CompilerDriver	llvmc: Cut global namespace pollution.	2010-08-20 11:24:44 +00:00
ExecutionEngine	remove some dead code.	2010-08-23 03:12:06 +00:00
Linker
MC	Revert part of my last commit. the mingw32 build bot doesn't seem to like it.	2010-08-23 05:25:23 +00:00
Support	Avoid O(n*m) complexity in StringRef::find_first(_not)_of(StringRef).	2010-08-23 18:16:08 +00:00
System	Fix --disable-threads build, PR7949.	2010-08-20 20:54:37 +00:00
Target	random improvement for variable shift codegen.	2010-08-23 17:30:29 +00:00
Transforms	Re-enable LazyValueInfo. Monitoring for failures.	2010-08-23 18:12:23 +00:00
VMCore	Now that PassInfo and Pass::ID have been separated, move the rest of the passes over to the new registration API.	2010-08-23 17:52:01 +00:00
Makefile