PBQP.cpp File Reference

#include "PBQP.h"
#include "llvm/Config/alloca.h"
#include <limits>
#include <cassert>
#include <cstring>

Include dependency graph for PBQP.cpp:

Go to the source code of this file.

Namespaces
namespace	llvm
Classes
struct	llvm::adjnode
struct	llvm::bucketnode
struct	llvm::pbqp
Typedefs
typedef struct llvm::adjnode	llvm::adjnode
typedef struct llvm::bucketnode	llvm::bucketnode
Functions
bool	llvm::isInf (PBQPNum n)
pbqp *	llvm::alloc_pbqp (int num_nodes)
void	llvm::free_pbqp (pbqp *this_)
static adjnode *	llvm::find_adjnode (pbqp *this_, int u, int v)
static adjnode *	llvm::alloc_adjnode (pbqp *this_, int u, PBQPMatrix *costs)
static void	llvm::insert_adjnode (pbqp *this_, int u, adjnode *adj_ptr)
static void	llvm::remove_adjnode (pbqp *this_, int u, adjnode *adj_ptr)
static int	llvm::get_deg (pbqp *this_, int u)
static void	llvm::reinsert_node (pbqp *this_, int u)
static void	llvm::remove_node (pbqp *this_, int u)
static void	llvm::insert_edge (pbqp *this_, int u, int v, PBQPMatrix *costs)
static void	llvm::delete_edge (pbqp *this_, int u, int v)
void	llvm::add_pbqp_nodecosts (pbqp *this_, int u, PBQPVector *costs)
static PBQPMatrix *	llvm::get_costmatrix_ptr (pbqp *this_, int u, int v)
static PBQPMatrix *	llvm::pbqp_get_costmatrix (pbqp *this_, int u, int v)
void	llvm::add_pbqp_edgecosts (pbqp *this_, int u, int v, PBQPMatrix *costs)
static void	llvm::pbqp_remove_bucket (pbqp *this_, bucketnode *bucket)
static int	llvm::pop_node (pbqp *this_, int deg)
static void	llvm::add_to_bucketlist (pbqp *this_, bucketnode *bucket, int deg)
static void	llvm::reorder_node (pbqp *this_, int u)
static void	llvm::reorder_adjnodes (pbqp *this_, int u)
static void	llvm::create_bucket (pbqp *this_, int u, int deg)
static void	llvm::create_bucketlist (pbqp *this_)
static void	llvm::disconnect_trivialnode (pbqp *this_, int u)
static void	llvm::eliminate_trivial_nodes (pbqp *this_)
static bool	llvm::normalize_matrix (PBQPMatrix *m, PBQPVector *u, PBQPVector *v)
static void	llvm::simplify_edge (pbqp *this_, int u, int v)
static void	llvm::eliminate_independent_edges (pbqp *this_)
static void	llvm::apply_RI (pbqp *this_, int x)
static void	llvm::apply_RII (pbqp *this_, int x)
static void	llvm::apply_RN (pbqp *this_, int x)
static void	llvm::compute_tc_info (pbqp *this_, adjnode *p)
static int	llvm::is_colorable (pbqp *this_, int x)
int	llvm::pop_colorablenode (pbqp *this_)
static void	llvm::reduce_pbqp (pbqp *this_)
static void	llvm::determine_solution (pbqp *this_, int x)
static void	llvm::back_propagate (pbqp *this_)
static void	llvm::determine_trivialsolution (pbqp *this_)
static void	llvm::check_pbqp (pbqp *this_)
void	llvm::solve_pbqp (pbqp *this_)
int	llvm::get_pbqp_solution (pbqp *this_, int x)
bool	llvm::is_pbqp_optimal (pbqp *this_)