Benjamin Kramer b5188f163a Simplify common predecessor finding. ... - Walking over pred_begin/pred_end is an expensive operation. - PHINodes contain a value for each predecessor anyway. - While it may look like we used to save a few iterations with the set, be aware that getIncomingValueForBlock does a linear search on the values of the phi node. - Another -5% on ARMDisassembler.cpp (Release build). This was the last entry in the profile that was obviously wasting time. llvm-svn: 145937		2011-12-06 16:14:29 +00:00
clang	Install cpuid.h when building with cmake too.	2011-12-06 15:46:47 +00:00
compiler-rt	[asan] remove format warnings in sysinfo/sysinfo.cc	2011-12-06 01:08:31 +00:00
debuginfo-tests	Testcase for r133065	2011-06-15 17:57:23 +00:00
libcxx	Starting using murmur2 when combining multiple size_t's into a single hash, and also for basic_string. Also made hash<thread::id> ever so slighly more portable. I had to tweak one test which is questionable (definitely not portable) anyway.	2011-12-05 00:08:45 +00:00
libcxxabi	Updated heuristic regulating small string buffer	2011-12-01 00:08:59 +00:00
lldb	<rdar://problem/10487848>	2011-12-06 04:51:14 +00:00
llvm	Simplify common predecessor finding.	2011-12-06 16:14:29 +00:00
polly	Update isl.	2011-12-06 10:48:32 +00:00