unsigned bucket_index;
assert(pbqp);
- assert(node);
node_vec = node->costs;
node_len = node_vec->len;
bucket_index = node->bucket_index;
/* We want to reduce a node with maximum degree. */
node = get_node_with_max_degree();
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
#if KAPS_DUMP
int is_src;
assert(pbqp);
- assert(node);
edge = node->edges[0];
mat = edge->costs;
if (is_src) {
other = edge->tgt;
- assert(other);
/* Update pointer for brute force solver. */
other = pbqp->nodes[other->index];
node->solution = pbqp_matrix_get_col_min_index(mat, other->solution, vec);
} else {
other = edge->src;
- assert(other);
/* Update pointer for brute force solver. */
other = pbqp->nodes[other->index];
int edge_bucket_contains(pbqp_edge_bucket_t bucket, pbqp_edge_t *edge)
{
- assert(edge);
-
return edge->bucket_index < edge_bucket_get_length(bucket)
&& bucket[edge->bucket_index] == edge;
}
int node_bucket_contains(pbqp_node_bucket_t bucket, pbqp_node_t *node)
{
- assert(node);
-
return node->bucket_index < node_bucket_get_length(bucket)
&& bucket[node->bucket_index] == node;
}
assert(bucket_len > 0);
node = (*bucket)[bucket_len - 1];
- assert(node);
ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
node->bucket_index = UINT_MAX;
unsigned node_index;
pbqp_node_t *other;
- assert(node);
assert(node_bucket_contains(*bucket, node));
- assert(bucket_len > 0);
node_index = node->bucket_index;
other = (*bucket)[bucket_len - 1];
/* We want to reduce a node with maximum degree. */
node = get_node_with_max_degree();
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
#if KAPS_DUMP
plist_insert_back(rpeo, node);
} while(node_is_reduced(node));
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
/* Check whether we can merge a neighbor into the current node. */
node = merged_node;
merged_node = NULL;
- assert(node);
if (node_is_reduced(node))
return;
vector_t *vec;
int is_src;
- assert(pbqp);
- assert(node);
-
- (void) pbqp;
-
edge = node->edges[0];
mat = edge->costs;
is_src = edge->src == node;
if (is_src) {
other = edge->tgt;
- assert(other);
-
node->solution = pbqp_matrix_get_col_min_index(mat, other->solution, vec);
} else {
other = edge->src;
- assert(other);
-
node->solution = pbqp_matrix_get_row_min_index(mat, other->solution, vec);
}
plist_insert_front(rpeo, node);
} while(node_is_reduced(node));
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
/* Check whether we can merge a neighbor into the current node. */
node = merged_node;
merged_node = NULL;
- assert(node);
if (node_is_reduced(node))
return;
/* get neighbor node */
edge = node->edges[edge_index];
- assert(edge);
neighbor = edge->src == node ? edge->tgt : edge->src;
- assert(neighbor);
assert(neighbor != node);
static void dump_vector(FILE *f, vector_t *vec)
{
unsigned index;
- assert(vec);
fprintf(f, "<span class=\"vector\">( ");
unsigned len = vec->len;
static void dump_matrix(FILE *f, pbqp_matrix_t *mat)
{
unsigned row, col;
- assert(mat);
num *p = mat->entries;
- assert(mat->cols> 0);
- assert(mat->rows> 0);
+ assert(mat->cols > 0);
+ assert(mat->rows > 0);
fprintf(f, "\t\\begin{pmatrix}\n");
for (row = 0; row < mat->rows; ++row) {
fprintf(f, "\t %s", cost2a(*p++));
{
unsigned src_index;
- assert(pbqp);
- assert(pbqp->dump_file);
-
fputs("<p>", pbqp->dump_file);
for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
pbqp_node_t *src_node = get_node(pbqp, src_index);
void dump_node(FILE *file, pbqp_node_t *node)
{
- assert(file);
-
if (node) {
fprintf(file, "\tc<sub>%d</sub> = ", node->index);
dump_vector(file, node->costs);
{
unsigned index;
- assert(pbqp);
- assert(pbqp->dump_file);
-
/* dump node costs */
fputs("<p>", pbqp->dump_file);
for (index = 0; index < pbqp->num_nodes; ++index) {
void dump_section(FILE *f, int level, const char *txt)
{
- assert(f);
-
fprintf(f, "<h%d>%s</h%d>\n", level, txt, level);
}
{
unsigned src_index;
- assert(pbqp);
- assert(pbqp->dump_file);
-
fputs("<p>\n<graph>\n\tgraph input {\n", pbqp->dump_file);
for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
pbqp_node_t *node = get_node(pbqp, src_index);
void pbqp_dump_input(pbqp_t *pbqp)
{
- assert(pbqp);
- assert(pbqp->dump_file);
-
dump_section(pbqp->dump_file, 1, "1. PBQP Problem");
dump_section(pbqp->dump_file, 2, "1.1 Topology");
pbqp_dump_graph(pbqp);
void dump_simplifyedge(pbqp_t *pbqp, pbqp_edge_t *edge)
{
- assert(pbqp);
- assert(pbqp->dump_file);
-
dump_node(pbqp->dump_file, edge->src);
dump_edge(pbqp->dump_file, edge);
dump_node(pbqp->dump_file, edge->tgt);
pbqp_node_t *src_node = get_node(pbqp, src_index);
pbqp_node_t *tgt_node = get_node(pbqp, tgt_index);
- assert(src_node);
assert(tgt_node);
len = ARR_LEN(src_node->edges);
num get_node_solution(pbqp_t *pbqp, unsigned node_index)
{
pbqp_node_t *node = get_node(pbqp, node_index);
- assert(node);
return node->solution;
}
#if KAPS_DUMP
void set_dumpfile(pbqp *pbqp, FILE *f)
{
- assert(pbqp);
pbqp->dump_file = f;
}
#endif
pbqp_matrix_t *pbqp_matrix_alloc(pbqp_t *pbqp, unsigned rows, unsigned cols)
{
- assert(cols> 0);
- assert(rows> 0);
+ assert(cols > 0);
+ assert(rows > 0);
unsigned length = rows * cols;
pbqp_matrix_t *mat = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*mat) + sizeof(*mat->entries) * length);
- assert(mat);
mat->cols = cols;
mat->rows = rows;
unsigned rows = m->rows;
unsigned len = rows * cols;
pbqp_matrix_t *copy = (pbqp_matrix_t*)obstack_alloc(&pbqp->obstack, sizeof(*copy) + sizeof(*copy->entries) * len);
- assert(copy);
for (i = 0; i < rows; ++i) {
for (j = 0; j < cols; ++j) {
{
unsigned len;
- assert(mat);
len = mat->rows * mat->cols;
pbqp_matrix_t *tmp = pbqp_matrix_copy_and_transpose(pbqp, mat);
int i;
int len;
- assert(sum);
- assert(summand);
assert(sum->cols == summand->cols);
assert(sum->rows == summand->rows);
unsigned row_index;
unsigned row_len;
- assert(mat);
assert(col < mat->cols);
row_len = mat->rows;
unsigned col_index;
unsigned col_len;
- assert(mat);
assert(row < mat->rows);
col_len = mat->cols;
void pbqp_matrix_set(pbqp_matrix_t *mat, unsigned row, unsigned col, num value)
{
- assert(mat);
assert(col < mat->cols);
assert(row < mat->rows);
unsigned row_index;
num min = INF_COSTS;
- assert(matrix);
- assert(flags);
assert(matrix->rows == flags->len);
unsigned col_len = matrix->cols;
unsigned min_index = 0;
num min = INF_COSTS;
- assert(matrix);
- assert(flags);
assert(matrix->rows == flags->len);
unsigned col_len = matrix->cols;
unsigned row_index;
unsigned row_len;
- assert(matrix);
- assert(flags);
assert(matrix->rows == flags->len);
col_len = matrix->cols;
unsigned col_index;
num min = INF_COSTS;
- assert(matrix);
- assert(flags);
assert(matrix->cols == flags->len);
unsigned len = flags->len;
unsigned min_index = 0;
num min = INF_COSTS;
- assert(matrix);
- assert(flags);
assert(matrix->cols == flags->len);
unsigned len = flags->len;
unsigned col_index;
unsigned col_len;
- assert(matrix);
- assert(flags);
assert(matrix->cols == flags->len);
col_len = matrix->cols;
unsigned row_index;
unsigned row_len;
- assert(mat);
- assert(src_vec);
- assert(tgt_vec);
assert(mat->cols = tgt_vec->len);
assert(mat->rows = src_vec->len);
unsigned row_index;
unsigned row_len;
- assert(mat);
- assert(vec);
assert(mat->rows == vec->len);
col_len = mat->cols;
unsigned row_index;
unsigned row_len;
- assert(mat);
- assert(vec);
assert(mat->cols == vec->len);
col_len = mat->cols;
unsigned node_index;
unsigned node_len;
- assert(pbqp);
node_len = pbqp->num_nodes;
#if KAPS_TIMING
unsigned src_index;
unsigned new_infinity = 0;
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 0);
mat = edge->costs;
- assert(mat);
/* Normalize towards source node. */
for (src_index = 0; src_index < src_len; ++src_index) {
unsigned tgt_index;
unsigned new_infinity = 0;
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 0);
mat = edge->costs;
- assert(mat);
/* Normalize towards target node. */
for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
unsigned edge_index;
unsigned edge_len;
- assert(pbqp);
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 1);
mat = edge->costs;
- assert(mat);
mapping = NEW_ARR_F(unsigned, tgt_len);
unsigned tgt_index;
assert(old_edge);
-
if (old_edge == edge)
continue;
old_matrix = old_edge->costs;
- assert(old_matrix);
if (old_edge->tgt == src_node) {
other_node = old_edge->src;
other_node = old_edge->tgt;
other_len = old_matrix->cols;
}
- assert(other_node);
other_vec = other_node->costs;
new_matrix = pbqp_matrix_alloc(pbqp, tgt_len, other_len);
unsigned edge_index;
unsigned edge_len;
- assert(pbqp);
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 1);
mat = edge->costs;
- assert(mat);
mapping = NEW_ARR_F(unsigned, src_len);
continue;
old_matrix = old_edge->costs;
- assert(old_matrix);
if (old_edge->tgt == tgt_node) {
other_node = old_edge->src;
other_node = old_edge->tgt;
other_len = old_matrix->cols;
}
- assert(other_node);
other_vec = other_node->costs;
new_matrix = pbqp_matrix_alloc(pbqp, src_len, other_len);
unsigned edge_index;
unsigned edge_len;
- assert(node);
- assert(pbqp);
-
edges = node->edges;
edge_len = pbqp_node_get_degree(node);
/* ALAP: Merge neighbors into given node. */
while(edge_bucket_get_length(rm_bucket) > 0) {
pbqp_edge_t *edge = edge_bucket_pop(&rm_bucket);
- assert(edge);
/* If the edge is not deleted: Try a merge. */
if (edge->src == node)
int src_len;
int tgt_len;
- assert(pbqp);
- assert(edge);
-
(void) pbqp;
src_node = edge->src;
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 0);
mat = edge->costs;
- assert(mat);
#if KAPS_DUMP
if (pbqp->dump_file) {
unsigned node_index;
unsigned node_len;
- assert(pbqp);
-
#if KAPS_TIMING
ir_timer_t *t_int_simpl = ir_timer_new();
ir_timer_start(t_int_simpl);
FILE *file;
#endif
- assert(pbqp);
-
(void) pbqp;
#if KAPS_DUMP
for (node_index = 0; node_index < node_len; ++node_index) {
pbqp_node_t *node = node_buckets[0][node_index];
- assert(node);
node->solution = vector_get_min_index(node->costs);
solution = pbqp_add(solution,
pbqp_matrix_t *mat;
vector_t *vec;
int is_src;
-
- assert(pbqp);
- assert(node);
-
(void) pbqp;
edge = node->edges[0];
if (is_src) {
other = edge->tgt;
- assert(other);
-
node->solution = pbqp_matrix_get_col_min_index(mat, other->solution, vec);
} else {
other = edge->src;
- assert(other);
-
node->solution = pbqp_matrix_get_row_min_index(mat, other->solution, vec);
}
unsigned col_index;
unsigned row_index;
- assert(pbqp);
-
if (src_is_src) {
src_node = src_edge->tgt;
} else {
unsigned node_index;
unsigned node_len = node_bucket_get_length(reduced_bucket);
- assert(pbqp);
-
#if KAPS_DUMP
if (pbqp->dump_file) {
dump_section(pbqp->dump_file, 2, "Back Propagation");
int is_src = edge->src == node;
pbqp_node_t *other_node;
- (void ) pbqp;
+ (void) pbqp;
assert(pbqp_node_get_degree(node) == 1);
if (is_src) {
unsigned row_len;
unsigned node_len;
- assert(pbqp);
assert(pbqp_node_get_degree(node) == 2);
if (src_is_src) {
unsigned src_index;
unsigned new_infinity = 0;
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
src_vec = src_node->costs;
tgt_vec = tgt_node->costs;
- assert(src_vec);
- assert(tgt_vec);
src_len = src_vec->len;
tgt_len = tgt_vec->len;
assert(tgt_len > 0);
mat = edge->costs;
- assert(mat);
for (src_index = 0; src_index < src_len; ++src_index) {
num elem = mat->entries[src_index * tgt_len + col_index];
unsigned tgt_index;
unsigned new_infinity = 0;
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(tgt_node);
tgt_vec = tgt_node->costs;
- assert(tgt_vec);
tgt_len = tgt_vec->len;
assert(tgt_len > 0);
mat = edge->costs;
- assert(mat);
for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
num elem = mat->entries[row_index * tgt_len + tgt_index];
vector_t *node_vec;
unsigned max_degree = pbqp_node_get_degree(node);
- assert(node);
node->solution = selected_index;
node_vec = node->costs;
node_len = node_vec->len;
num min = INF_COSTS;
int is_src;
- assert(pbqp);
- assert(node);
node_vec = node->costs;
node_len = node_vec->len;
max_degree = pbqp_node_get_degree(node);
}
pbqp_edge_t *edge = OALLOC(&pbqp->obstack, pbqp_edge_t);
- assert(edge);
pbqp_node_t *src_node = get_node(pbqp, src_index);
- assert(src_node);
pbqp_node_t *tgt_node = get_node(pbqp, tgt_index);
- assert(tgt_node);
if (transpose) {
edge->costs = pbqp_matrix_copy_and_transpose(pbqp, costs);
pbqp_node_t *src_node;
pbqp_node_t *tgt_node;
- assert(edge);
-
src_node = edge->src;
tgt_node = edge->tgt;
- assert(src_node);
- assert(tgt_node);
disconnect_edge(src_node, edge);
disconnect_edge(tgt_node, edge);
{
unsigned deleted;
- assert(edge);
-
deleted = (edge->src == NULL) && (edge-> tgt == NULL);
return deleted;
pbqp_node_t *alloc_node(pbqp_t *pbqp, unsigned node_index, vector_t *costs)
{
pbqp_node_t *node = OALLOC(&pbqp->obstack, pbqp_node_t);
- assert(node);
node->edges = NEW_ARR_F(pbqp_edge_t *, 0);
node->costs = vector_copy(pbqp, costs);
unsigned edge_len;
assert(node);
- assert(edge);
-
if (edge->src != node && edge->tgt != node) return 0;
edges = node->edges;
unsigned pbqp_node_get_degree(pbqp_node_t *node)
{
- assert(node);
return ARR_LEN(node->edges);
}
unsigned edge_length = pbqp_node_get_degree(node);
pbqp_node_t *copy = OALLOC(&pbqp->obstack, pbqp_node_t);
- assert(copy);
-
copy->edges = NEW_ARR_F(pbqp_edge_t *, 0);
for (edge_index = 0; edge_index < edge_length; ++edge_index) {
pbqp_edge_t *edge_copy = NULL;
{
assert(length > 0);
vector_t *vec = (vector_t*)obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
- assert(vec);
vec->len = length;
memset(vec->entries, 0, sizeof(*vec->entries) * length);
int i;
int len;
- assert(sum);
- assert(summand);
assert(sum->len == summand->len);
len = sum->len;
unsigned index;
unsigned len;
- assert(vec);
-
len = vec->len;
for (index = 0; index < len; ++index) {
unsigned index;
unsigned len;
- assert(vec);
- assert(mat);
assert(vec->len == mat->rows);
assert(col_index < mat->cols);
unsigned index;
unsigned len;
- assert(vec);
- assert(mat);
assert(vec->len == mat->cols);
assert(row_index < mat->rows);
unsigned len;
num min = INF_COSTS;
- assert(vec);
-
len = vec->len;
assert(len > 0);
unsigned min_index = 0;
num min = INF_COSTS;
- assert(vec);
-
len = vec->len;
assert(len > 0);