bcm5719-llvm - Project Ortega BCM5719 LLVM

	Commit message (Collapse)	Author	Age	Files	Lines
*	[C++11] Use 'nullptr'.	Craig Topper	2014-06-08	1	-2/+2
\| \| \| \|	llvm-svn: 210442
*	[C++11] Replace llvm::next and llvm::prior with std::next and std::prev.	Benjamin Kramer	2014-03-02	1	-3/+3
\| \| \| \| \| \|	Remove the old functions. llvm-svn: 202636
*	Add an iplist::clearAndLeakNodesUnsafely() function.	Jakob Stoklund Olesen	2013-01-04	1	-0/+33
\| \| \| \| \| \| \| \| \| \| \| \|	The iplist::clear() function can be quite expensive because it traverses the entire list, calling deleteNode() and removeNodeFromList() on each element. If node destruction and deallocation can be handled some other way, clearAndLeakNodesUnsafely() can be used to jettison all nodes without bringing them into cache. The function name is meant to be ominous. llvm-svn: 171540
*	Sort a few more #include lines in tools/... unittests/... and utils/...	Chandler Carruth	2013-01-02	1	-1/+1
\| \| \| \|	llvm-svn: 171363
*	Add an assertion for a likely ilist::splice() contract violation.	Jakob Stoklund Olesen	2012-12-18	1	-0/+21
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	The single-element ilist::splice() function supports a noop move: List.splice(I, List, I); The corresponding std::list function doesn't allow that, so add a unit test to document that behavior. This also means that List.splice(I, List, F); is somewhat surprisingly not equivalent to List.splice(I, List, F, next(F)); This patch adds an assertion to catch the illegal case I == F above. Alternatively, we could make I == F a legal noop, but that would make ilist differ even more from std::list. llvm-svn: 170443
*	Sort the #include lines for unittest/...	Chandler Carruth	2012-12-04	1	-2/+2
\| \| \| \|	llvm-svn: 169250
*	Fix const ilist_node::get{Prev,Next}Node() to actually compile. Picky, picky.	Daniel Dunbar	2010-05-13	1	-0/+5
\| \| \| \|	llvm-svn: 103723
*	ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.	Daniel Dunbar	2010-05-12	1	-0/+39
	- This provides a convenient alternative to using something llvm::prior or manual iterator access, for example:: if (T *Prev = foo->getPrevNode()) ... instead of:: iterator it(foo); if (it != begin()) { --it; ... } - Chris, please review. llvm-svn: 103647