Dan Gohman fed90b6d09 Fold the useful features of alist and alist_node into ilist, and
a new ilist_node class, and remove them. Unlike alist_node,
ilist_node doesn't attempt to manage storage itself, so it avoids
the associated problems, including being opaque in gdb.

Adjust the Recycler class so that it doesn't depend on alist_node.
Also, change it to use explicit Size and Align parameters, allowing
it to work when the largest-sized node doesn't have the greatest
alignment requirement.

Change MachineInstr's MachineMemOperand list from a pool-backed
alist to a std::list for now.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@54146 91177308-0d34-0410-b5e6-96231b3b80d8
2008-07-28 21:51:04 +00:00
..
2008-05-30 22:47:19 +00:00
2008-03-23 13:44:17 +00:00
2008-07-27 21:46:04 +00:00
2008-07-16 15:59:56 +00:00
2008-04-30 04:56:14 +00:00
2008-07-17 16:51:19 +00:00
2008-04-01 04:00:45 +00:00
2008-07-05 22:41:37 +00:00
2008-07-01 17:44:24 +00:00
2008-06-24 17:46:48 +00:00
2008-05-30 22:40:06 +00:00