- GARY_INIT(r->variants, 0);
- struct point_variant *v = GARY_PUSH(r->variants);
- switch (sym->type)
- {
- case SYMBOLIZER_ICON:
- printf("DEBUG: Icon label\n");
- make_bitmap_icon(v, (struct sym_icon *) sym);
- break;
- case SYMBOLIZER_TEXT:
- printf("DEBUG: Text label\n");
- make_bitmap_label(v, (struct sym_text *) sym);
- default:
- // FIXME
- ;
- }
-}
-
-void make_graph(void)
-{
- hash_init();
- struct mempool *mp_edges = mp_new(BLOCK_SIZE);
-
- printf("Extracting nodes, will iterate over %lld ways\n", GARY_SIZE(buffer_line));
- for (uns i=0; i<GARY_SIZE(buffer_line); i++)
- {
- struct osm_way *way = (struct osm_way *) buffer_line[i].line->s.o;
- struct graph_node *g_prev = NULL;
- struct osm_node *o_prev = NULL;
-
- CLIST_FOR_EACH(struct osm_ref *, ref, way->nodes)
- {
- // FIXME: Shall osm_object's type be checked here?
- struct osm_node *o_node = (struct osm_node *) ref->o;
-
- struct graph_node *g_node = hash_find(ref->o->id);
- if (!g_node)
- {
- g_node = hash_new(ref->o->id);
- GARY_INIT(g_node->edges, 0);
- g_node->o = o_node;
- g_node->id = ref->o->id;
- g_node->num = num_nodes++;
- }
-
- if (! g_prev)
- {
- g_prev = g_node;
- o_prev = o_node;
- continue;
- }
-
- struct graph_edge *e = mp_alloc(mp_edges, sizeof(struct graph_edge)); num_edges_dbg++;
- e->num = num_edges++;
- e->id = buffer_line[i].line->s.o->id;
- e->color = buffer_line[i].line->color;
- e->length = hypot(abs(o_prev->x - o_node->x), abs(o_prev->y - o_node->y));
- e->visited = -1;
- e->prev = NULL;
- e->next = NULL;
- e->n1 = g_prev;
- e->n2 = g_node;
- e->longline = (uns) -1;
- e->line = buffer_line[i].line;
- e->dir = DIR_UNSET;
- e->label = NULL;
-
- struct graph_edge **edge = GARY_PUSH(g_prev->edges);
- *edge = e;
- edge = GARY_PUSH(g_node->edges);
- *edge = e;
-
- g_prev = g_node;
- o_prev = o_node;
- }
- }
-
- printf("Made graph with %d edges\n", num_edges_dbg);
-}
-
-void dump_graph(void)
-{
- HASH_FOR_ALL(hash, node)
- {
- printf("* Node: (%d) #%ju [%.2f; %.2f]\n", node->num, node->id, node->o->x, node->o->y);
- for (uns i=0; i<GARY_SIZE(node->edges); i++)
- {
- struct graph_edge *e = node->edges[i];
- printf("\t edge (%d) #%ju to ", e->num, e->id);
- if (node->edges[i]->n1->id == node->id)
- printf("(%d) #%ju [%.2f; %.2f]\n", e->n2->num, e->n2->id, e->n2->o->x, e->n2->o->y);
- else if (node->edges[i]->n2->id == node->id)
- printf("(%d) #%ju [%.2f; %.2f]\n", e->n1->num, e->n1->id, e->n1->o->x, e->n1->o->y);
- else
- printf("BEWARE! BEWARE! BEWARE!\n");
-
- printf("\t\t");
- if ((node->edges[i]->label)) printf("Labelled\n");
- if ((node->edges[i]->label) && (node->edges[i]->label->type == SYMBOLIZER_TEXT)) printf(" labelled %s;", osm_val_decode(((struct sym_text *) node->edges[i]->label)->text));
- printf(" colored %d;", node->edges[i]->color);
- printf(" length %.2f", node->edges[i]->length);
- printf("\n");
- }
- }
- HASH_END_FOR;
-}
-
-void label_graph(void)
-{
-printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
- for (uns i=0; i<GARY_SIZE(buffer_linelabel); i++)
- {
- if (buffer_linelabel[i].label->type == SYMBOLIZER_TEXT)
- printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
- CLIST_FOR_EACH(struct osm_ref *, ref, buffer_linelabel[i].way->nodes)
- {
- printf("Looking for node %ju\n", ref->o->id);
- struct graph_node *n = hash_find(ref->o->id);
- if (n == NULL)
- {
- // FIXME: What shall be done?
- }
- else
- {
- printf("Searching among %u edges\n", GARY_SIZE(n->edges));
- for (uns j=0; j<GARY_SIZE(n->edges); j++)
- {
- if (n->edges[j]->id == buffer_linelabel[i].way->o.id)
- {
- printf("Labelling node %ju\n", n->id);
- n->edges[j]->label = buffer_linelabel[i].label;
- n->edges[j]->zindex = buffer_linelabel[i].zindex;
- }
- }
- }
- }
- }
-}
-
-void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir)
-{
-printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
- struct graph_edge *candidate = NULL;
-
- for (uns i=0; i<GARY_SIZE(node->edges); i++)
- {
- struct graph_edge *other = node->edges[i];
-if (e->num == 987) printf("Got label %d\n", e->num);
- if ((other->longline != (uns) -1) && (other->longline != e->longline)) continue;
-if (e->num == 987) printf("Continuing with edge %d\n", e->num);
-
-printf("Testing %d ?= %d\n", other->visited, e->longline);
- if ((uns) other->visited != e->longline) {
- printf("Pushing new edge %d / %ju\n", other->num, other->id);
- struct graph_edge **e_ptr = GARY_PUSH(bfs_queue);
- *e_ptr = other;
- other->visited = e->longline;
- }
-
- if (((other->n1->id == node->id) && (other->n2->id == anode->id)) ||
- ((other->n2->id == node->id) && (other->n1->id == anode->id)))
- continue;
-
- if (((other->n1->id == node->id) || (other->n2->id == node->id)) &&
- (e->label) && (other->label) &&
- (e->label->type == SYMBOLIZER_TEXT) && (other->label->type == SYMBOLIZER_TEXT) &&
- (((struct sym_text *) e->label)->text == ((struct sym_text *) other->label)->text))
- {
- if (! candidate || (other->length > candidate->length))
- candidate = other;
- }
- }
-
- if (candidate)
- {
-printf("New line in longline %u\n", e->longline);
- struct graph_edge *other = candidate;
- other->longline = e->longline;
- other->dir = dir;
- if (((dir == DIR_BWD) && (other->n1->id == node->id)) ||
- ((dir == DIR_FWD) && (other->n2->id == node->id)))
- {
- struct graph_node *swp = other->n2;
- other->n2 = other->n1;
- other->n1 = swp;
- }
-
- switch (dir)
- {
- case DIR_BWD:
- e->prev = other;
- other->next = e;
- longlines[other->longline].first = other;
- break;
- case DIR_FWD:
- e->next = other;
- other->prev = e;
- break;
- default:
- printf("Oops\n");
- ASSERT(0);
- }
- }
-}
-
-void bfs(uns longline)
-{
-printf("BFS called for longline %u\n", longline);
-printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
- for (uns i=0; i<GARY_SIZE(bfs_queue); i++)
- {
- struct graph_edge *cur = bfs_queue[i];
- printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
- //ASSERT(! cur->visited);
-
- cur->visited = longline;
-
- if (cur->longline == (uns) -1)
- continue;
-
- if (cur->dir == DIR_UNSET)
- {
- cur->dir = DIR_CENTER;
- bfs_edge(cur, cur->n1, cur->n2, DIR_BWD);
- bfs_edge(cur, cur->n2, cur->n1, DIR_FWD);
- }
- else
- {
- switch (cur->dir)
- {
- case DIR_BWD:
- bfs_edge(cur, cur->n1, cur->n2, cur->dir);
- break;
- case DIR_FWD:
- bfs_edge(cur, cur->n2, cur->n1, cur->dir);
- break;
- default:
- // FIXME
- ;
- }
- }
- }
-}
-
-void bfs_wrapper(void)
-{
- GARY_INIT(bfs_queue, 0);
- GARY_INIT(longlines, 0);
-
- HASH_FOR_ALL(hash, node)
- {
- for (uns i=0; i<GARY_SIZE(node->edges); i++)
- {
- if ((node->edges[i]->label) && (node->edges[i]->longline == (uns) -1))
- {
- GARY_PUSH(longlines);
- longlines[num_longlines].first = node->edges[i];
- printf("Running new BFS\n");
- printf("Creating longline %u\n", num_longlines);
- GARY_RESIZE(bfs_queue, 0);
- struct graph_edge **e = GARY_PUSH(bfs_queue);
- *e = node->edges[i];
- node->edges[i]->longline = num_longlines;
- bfs(node->edges[i]->longline);
- //dump_longlines();
- printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
- printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
- num_longlines++;
- }
- }
- }
- HASH_END_FOR;
-
- GARY_FREE(bfs_queue);
-}
-
-void dump_longlines(void)
-{
-printf("*** Longlines dump\n");
- for (uns i=0; i<GARY_SIZE(longlines); i++)
- {
-printf("Longline %u:", i);
- struct graph_edge *e = longlines[i].first;
-if ((e->label) && (e->label->type == SYMBOLIZER_TEXT))
- printf(" labelled %s", osm_val_decode(((struct sym_text *) e->label)->text));
-printf("\n");
-
- while (e)
- {
- printf("\t#%ju (%d): [%.2f; %.2f] -- [%.2f; %.2f] (dir %d)\n",
- e->id, e->num, e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, e->dir);
-
- e = e->next;
- }
- }
-}
-
-struct request_line *make_new_line(void)
-{
- struct request_line *rl = GARY_PUSH(requests_line);
- rl->request.ind = num_requests++;
- rl->request.type = REQUEST_LINE;
- GARY_INIT(rl->sections, 0);
-
- return rl;
-}
-
-struct request_section *make_new_section(struct request_line *rl)
-{
- struct request_section *rls = GARY_PUSH(rl->sections);
- rls->request.ind = num_requests++;
- rls->request.type = REQUEST_SECTION;
- rls->num_segments = 0;
- GARY_INIT(rls->segments, 0);
-
- return rls;
-}
-
-struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym)
-{
- struct request_segment *rs = GARY_PUSH(rls->segments);
- rls->num_segments++;
-
- rs->request.ind = num_requests++;
- rs->request.type = REQUEST_SEGMENT;
-
- struct point_variant *v = malloc(sizeof(struct point_variant));