Lang Hames 57902cc070 [PBQP] Unique allowed-sets for nodes in the PBQP graph and use pairs of these ... sets as keys into a cache of interference matrice values in the Interference constraint adder. Creating interference matrices was one of the large remaining time-sinks in PBQP. Caching them reduces the total compile time (when using PBQP) on the nightly test suite by ~10%. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@220688 91177308-0d34-0410-b5e6-96231b3b80d8		2014-10-27 17:44:25 +00:00
..
CostAllocator.h	[PBQP] Unique allowed-sets for nodes in the PBQP graph and use pairs of these	2014-10-27 17:44:25 +00:00
Graph.h	[PBQP] Unique allowed-sets for nodes in the PBQP graph and use pairs of these	2014-10-27 17:44:25 +00:00
Math.h	[PBQP] Use DenseSet rather than std::set for PBQP's PoolCostAllocator	2014-10-20 04:26:23 +00:00
ReductionRules.h	[PBQP] Replace PBQPBuilder with composable constraints (PBQPRAConstraint).	2014-10-09 18:20:51 +00:00
Solution.h	[PBQP] Replace PBQPBuilder with composable constraints (PBQPRAConstraint).	2014-10-09 18:20:51 +00:00