Chris Lattner 39cacceb55 Ok, the "fix" for this is to do a real associative container. Symbol tables ... are ordered by name, not by slot, so the previous solution wasn't any good. On a large testcase, this reduces time to parse from 2.17s to 1.58s. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9002 91177308-0d34-0410-b5e6-96231b3b80d8		2003-10-10 05:43:47 +00:00
..
ArchiveReader.cpp	Update file header for renamed file	2003-09-22 23:42:00 +00:00
ConstantReader.cpp	Change getConstantValue to throw an exception on error, not return null	2003-10-09 20:41:16 +00:00
InstructionReader.cpp	Reserve space for PHI nodes when we read them in. This provides a VERY	2003-10-09 22:46:58 +00:00
Makefile
Reader.cpp	Ok, the "fix" for this is to do a real associative container. Symbol tables	2003-10-10 05:43:47 +00:00
ReaderInternals.h	Pass a vector around to reduce dynamic allocation	2003-10-09 20:45:42 +00:00
ReaderWrappers.cpp	Destroy allocated resources on exception.	2003-10-08 19:55:47 +00:00