llvm-mirror

mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-13 08:54:59 +00:00

History

Chris Lattner b8959ef7a1 Speed up updateDFSNumbers with two observations:

1. domtree is a tree, not a graph.  There is no need to avoid revisiting nodes with a set.
2. the worklist can contain the child iterator pointers so we don't get N^2 rescanning of children.

This speeds up updateDFSNumbers significantly, making it basically free.  On the testcase in PR1432,
this speeds up loopsimplify by another 3x, dropping it from the 12th most expensive pass to the to
the 30th. :)  It used to be #1.

llvm-svn: 40923

2007-08-08 06:24:20 +00:00

Analysis

reimplement dfs number computation to be significantly faster. This speeds up

2007-08-08 05:51:24 +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

This is the patch to provide clean intrinsic function overloading support in LLVM. It cleans up the intrinsic definitions and generally smooths the process for more complicated intrinsic writing. It will be used by the upcoming atomic intrinsics as well as vector and float intrinsics in the future.