Chris Lattner 0162c1815e Compute the argument list as lazily as possible. This ensures that clients ... that don't use it don't have to pay the memory cost for the arguments. This allows us to avoid creating Argument nodes for many prototypes and for clients who lazily deserialize code from a bytecode file. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41166 91177308-0d34-0410-b5e6-96231b3b80d8		2007-08-18 06:14:52 +00:00
..
Analysis	Cache non-local memory dependence analysis. This is a significant compile	2007-08-16 21:27:05 +00:00
Archive	finishing touches of bytecode -> bitcode changes. also unbreak Windows	2007-07-06 20:28:40 +00:00
AsmParser	regenerate	2007-08-06 21:00:46 +00:00
Bitcode	Patch 10 for long double. Doing constants right needs expanding ConstantFP	2007-08-09 22:51:36 +00:00
CodeGen	Fold C ? 0 : 1 to ~C or zext(~C) or trunc(~C) depending the types.	2007-08-18 05:57:05 +00:00
Debugger	switch this to bitcode instead of bytecode	2007-05-06 09:29:13 +00:00
ExecutionEngine	move assertion into mutex guard, a partial fix for PR1606.	2007-08-13 20:08:16 +00:00
Linker	Improve error handling in the linker by:	2007-08-16 07:47:30 +00:00
Support	This adds a bunch of static functions that implement unsigned	2007-08-16 15:56:55 +00:00
System	Fix PR1581, patch by Timo Savola	2007-07-31 06:00:51 +00:00
Target	MipsHi now has ouput flag	2007-08-18 02:37:46 +00:00
Transforms	Avoid spliting loops where two split condition branches are not independent.	2007-08-18 00:00:32 +00:00
VMCore	Compute the argument list as lazily as possible. This ensures that clients	2007-08-18 06:14:52 +00:00
Makefile	build lib/Archive instead of lib/Bytecode	2007-05-06 19:50:06 +00:00