17 |
* along with OSM2Go. If not, see <http://www.gnu.org/licenses/>. |
* along with OSM2Go. If not, see <http://www.gnu.org/licenses/>. |
18 |
*/ |
*/ |
19 |
|
|
|
/* these defines select one of three possible xml parsers */ |
|
|
/* this is in fact selected depending on the plattform in the Makefile */ |
|
|
// #define OSM_DOM_PARSER |
|
|
// #define OSM_STREAM_PARSER |
|
|
|
|
20 |
#include <stdio.h> |
#include <stdio.h> |
21 |
#include <stdlib.h> |
#include <stdlib.h> |
22 |
#include <string.h> |
#include <string.h> |
35 |
#error "Tree not enabled in libxml" |
#error "Tree not enabled in libxml" |
36 |
#endif |
#endif |
37 |
|
|
|
/* determine where a node/way/relation read from the osm file */ |
|
|
/* is inserted into the internal database */ |
|
|
// #define OSM_SORT_ID |
|
|
#define OSM_SORT_LAST |
|
|
// #define OSM_SORT_FIRST |
|
|
|
|
38 |
/* ------------------------- bounds handling --------------------- */ |
/* ------------------------- bounds handling --------------------- */ |
39 |
|
|
40 |
static void osm_bounds_free(bounds_t *bounds) { |
static void osm_bounds_free(bounds_t *bounds) { |
47 |
bounds->ll_min.lon, bounds->ll_max.lon); |
bounds->ll_min.lon, bounds->ll_max.lon); |
48 |
} |
} |
49 |
|
|
|
#ifdef OSM_DOM_PARSER |
|
|
static bounds_t *osm_parse_osm_bounds(osm_t *osm, |
|
|
xmlDocPtr doc, xmlNode *a_node) { |
|
|
char *prop; |
|
|
|
|
|
if(osm->bounds) { |
|
|
errorf(NULL, "Doubly defined bounds"); |
|
|
return NULL; |
|
|
} |
|
|
|
|
|
bounds_t *bounds = g_new0(bounds_t, 1); |
|
|
|
|
|
bounds->ll_min.lat = bounds->ll_min.lon = NAN; |
|
|
bounds->ll_max.lat = bounds->ll_max.lon = NAN; |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"minlat"))) { |
|
|
bounds->ll_min.lat = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"maxlat"))) { |
|
|
bounds->ll_max.lat = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"minlon"))) { |
|
|
bounds->ll_min.lon = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"maxlon"))) { |
|
|
bounds->ll_max.lon = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if(isnan(bounds->ll_min.lat) || isnan(bounds->ll_min.lon) || |
|
|
isnan(bounds->ll_max.lat) || isnan(bounds->ll_max.lon)) { |
|
|
errorf(NULL, "Invalid coordinate in bounds (%f/%f/%f/%f)", |
|
|
bounds->ll_min.lat, bounds->ll_min.lon, |
|
|
bounds->ll_max.lat, bounds->ll_max.lon); |
|
|
|
|
|
osm_bounds_free(bounds); |
|
|
return NULL; |
|
|
} |
|
|
|
|
|
|
|
|
/* calculate map zone which will be used as a reference for all */ |
|
|
/* drawing/projection later on */ |
|
|
pos_t center = { (bounds->ll_max.lat + bounds->ll_min.lat)/2, |
|
|
(bounds->ll_max.lon + bounds->ll_min.lon)/2 }; |
|
|
|
|
|
pos2lpos_center(¢er, &bounds->center); |
|
|
|
|
|
/* the scale is needed to accomodate for "streching" */ |
|
|
/* by the mercartor projection */ |
|
|
bounds->scale = cos(DEG2RAD(center.lat)); |
|
|
|
|
|
pos2lpos_center(&bounds->ll_min, &bounds->min); |
|
|
bounds->min.x -= bounds->center.x; |
|
|
bounds->min.y -= bounds->center.y; |
|
|
bounds->min.x *= bounds->scale; |
|
|
bounds->min.y *= bounds->scale; |
|
|
|
|
|
pos2lpos_center(&bounds->ll_max, &bounds->max); |
|
|
bounds->max.x -= bounds->center.x; |
|
|
bounds->max.y -= bounds->center.y; |
|
|
bounds->max.x *= bounds->scale; |
|
|
bounds->max.y *= bounds->scale; |
|
|
|
|
|
return bounds; |
|
|
} |
|
|
#endif |
|
|
|
|
50 |
/* ------------------------- user handling --------------------- */ |
/* ------------------------- user handling --------------------- */ |
51 |
|
|
52 |
void osm_users_free(user_t *user) { |
void osm_users_free(user_t *user) { |
246 |
} |
} |
247 |
} |
} |
248 |
|
|
|
#ifdef OSM_DOM_PARSER |
|
|
static node_t *osm_parse_osm_node(osm_t *osm, |
|
|
xmlDocPtr doc, xmlNode *a_node) { |
|
|
xmlNode *cur_node = NULL; |
|
|
|
|
|
/* allocate a new node structure */ |
|
|
node_t *node = g_new0(node_t, 1); |
|
|
node->pos.lat = node->pos.lon = NAN; |
|
|
|
|
|
char *prop; |
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"id"))) { |
|
|
node->id = strtoul(prop, NULL, 10); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"lat"))) { |
|
|
node->pos.lat = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"lon"))) { |
|
|
node->pos.lon = g_ascii_strtod(prop, NULL); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"user"))) { |
|
|
node->user = osm_user(osm, prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"visible"))) { |
|
|
node->visible = (strcasecmp(prop, "true") == 0); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"timestamp"))) { |
|
|
node->time = convert_iso8601(prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
/* append node to end of hash table if present */ |
|
|
if(osm->node_hash) { |
|
|
hash_item_t **item = &osm->node_hash->hash[ID2HASH(node->id)]; |
|
|
while(*item) item = &(*item)->next; |
|
|
|
|
|
*item = g_new0(hash_item_t, 1); |
|
|
(*item)->data.node = node; |
|
|
} |
|
|
|
|
|
/* scan for tags and attach a list of tags */ |
|
|
tag_t **tag = &node->tag; |
|
|
for (cur_node = a_node->children; cur_node; cur_node = cur_node->next) { |
|
|
if (cur_node->type == XML_ELEMENT_NODE) { |
|
|
if(strcasecmp((char*)cur_node->name, "tag") == 0) { |
|
|
/* attach tag to node */ |
|
|
*tag = osm_parse_osm_tag(osm, doc, cur_node); |
|
|
if(*tag) tag = &((*tag)->next); |
|
|
} else |
|
|
printf("found unhandled osm/node/%s\n", cur_node->name); |
|
|
} |
|
|
} |
|
|
|
|
|
pos2lpos(osm->bounds, &node->pos, &node->lpos); |
|
|
|
|
|
return node; |
|
|
} |
|
|
#endif |
|
|
|
|
249 |
/* ------------------- way handling ------------------- */ |
/* ------------------- way handling ------------------- */ |
250 |
|
|
251 |
void osm_node_chain_free(node_chain_t *node_chain) { |
void osm_node_chain_free(node_chain_t *node_chain) { |
350 |
return NULL; |
return NULL; |
351 |
} |
} |
352 |
|
|
|
#ifdef OSM_DOM_PARSER |
|
|
static way_t *osm_parse_osm_way(osm_t *osm, |
|
|
xmlDocPtr doc, xmlNode *a_node) { |
|
|
xmlNode *cur_node = NULL; |
|
|
|
|
|
/* allocate a new way structure */ |
|
|
way_t *way = g_new0(way_t, 1); |
|
|
|
|
|
char *prop; |
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"id"))) { |
|
|
way->id = strtoul(prop, NULL, 10); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"user"))) { |
|
|
way->user = osm_user(osm, prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"visible"))) { |
|
|
way->visible = (strcasecmp(prop, "true") == 0); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"timestamp"))) { |
|
|
way->time = convert_iso8601(prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
/* append way to end of hash table if present */ |
|
|
if(osm->way_hash) { |
|
|
hash_item_t **item = &osm->way_hash->hash[ID2HASH(way->id)]; |
|
|
while(*item) item = &(*item)->next; |
|
|
|
|
|
*item = g_new0(hash_item_t, 1); |
|
|
(*item)->data.way = way; |
|
|
} |
|
|
|
|
|
/* scan for tags/nodes and attach their lists */ |
|
|
tag_t **tag = &way->tag; |
|
|
node_chain_t **node_chain = &way->node_chain; |
|
|
|
|
|
for (cur_node = a_node->children; cur_node; cur_node = cur_node->next) { |
|
|
if (cur_node->type == XML_ELEMENT_NODE) { |
|
|
if(strcasecmp((char*)cur_node->name, "tag") == 0) { |
|
|
/* attach tag to node */ |
|
|
*tag = osm_parse_osm_tag(osm, doc, cur_node); |
|
|
if(*tag) tag = &((*tag)->next); |
|
|
} else if(strcasecmp((char*)cur_node->name, "nd") == 0) { |
|
|
*node_chain = osm_parse_osm_way_nd(osm, doc, cur_node); |
|
|
if(*node_chain) |
|
|
node_chain = &((*node_chain)->next); |
|
|
} else |
|
|
printf("found unhandled osm/node/%s\n", cur_node->name); |
|
|
} |
|
|
} |
|
|
|
|
|
return way; |
|
|
} |
|
|
#endif |
|
|
|
|
353 |
/* ------------------- relation handling ------------------- */ |
/* ------------------- relation handling ------------------- */ |
354 |
|
|
355 |
void osm_member_free(member_t *member) { |
void osm_member_free(member_t *member) { |
393 |
|
|
394 |
member_t *member = relation->member; |
member_t *member = relation->member; |
395 |
while(member) { |
while(member) { |
396 |
switch(member->type) { |
switch(member->object.type) { |
397 |
case ILLEGAL: |
case ILLEGAL: |
398 |
case NODE_ID: |
case NODE_ID: |
399 |
case WAY_ID: |
case WAY_ID: |
401 |
break; |
break; |
402 |
|
|
403 |
case NODE: |
case NODE: |
404 |
if(member->node) |
if(member->object.node) |
405 |
printf(" Member: Node, id = %lu, role = %s\n", |
printf(" Member: Node, id = %lu, role = %s\n", |
406 |
member->node->id, member->role); |
member->object.node->id, member->role); |
407 |
break; |
break; |
408 |
|
|
409 |
case WAY: |
case WAY: |
410 |
if(member->way) |
if(member->object.way) |
411 |
printf(" Member: Way, id = %lu, role = %s\n", |
printf(" Member: Way, id = %lu, role = %s\n", |
412 |
member->way->id, member->role); |
member->object.way->id, member->role); |
413 |
break; |
break; |
414 |
|
|
415 |
case RELATION: |
case RELATION: |
416 |
if(member->relation) |
if(member->object.relation) |
417 |
printf(" Member: Relation, id = %lu, role = %s\n", |
printf(" Member: Relation, id = %lu, role = %s\n", |
418 |
member->relation->id, member->role); |
member->object.relation->id, member->role); |
419 |
break; |
break; |
420 |
} |
} |
421 |
|
|
436 |
xmlDocPtr doc, xmlNode *a_node) { |
xmlDocPtr doc, xmlNode *a_node) { |
437 |
char *prop; |
char *prop; |
438 |
member_t *member = g_new0(member_t, 1); |
member_t *member = g_new0(member_t, 1); |
439 |
member->type = ILLEGAL; |
member->object.type = ILLEGAL; |
440 |
|
|
441 |
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"type"))) { |
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"type"))) { |
442 |
if(strcasecmp(prop, "way") == 0) member->type = WAY; |
if(strcasecmp(prop, "way") == 0) member->object.type = WAY; |
443 |
else if(strcasecmp(prop, "node") == 0) member->type = NODE; |
else if(strcasecmp(prop, "node") == 0) member->object.type = NODE; |
444 |
else if(strcasecmp(prop, "relation") == 0) member->type = RELATION; |
else if(strcasecmp(prop, "relation") == 0) member->object.type = RELATION; |
445 |
xmlFree(prop); |
xmlFree(prop); |
446 |
} |
} |
447 |
|
|
448 |
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"ref"))) { |
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"ref"))) { |
449 |
item_id_t id = strtoul(prop, NULL, 10); |
item_id_t id = strtoul(prop, NULL, 10); |
450 |
|
|
451 |
switch(member->type) { |
switch(member->object.type) { |
452 |
case ILLEGAL: |
case ILLEGAL: |
453 |
printf("Unable to store illegal type\n"); |
printf("Unable to store illegal type\n"); |
454 |
break; |
break; |
455 |
|
|
456 |
case WAY: |
case WAY: |
457 |
/* search matching way */ |
/* search matching way */ |
458 |
member->way = osm_get_way_by_id(osm, id); |
member->object.way = osm_get_way_by_id(osm, id); |
459 |
if(!member->way) { |
if(!member->object.way) { |
460 |
member->type = WAY_ID; |
member->object.type = WAY_ID; |
461 |
member->id = id; |
member->object.id = id; |
462 |
} |
} |
463 |
break; |
break; |
464 |
|
|
465 |
case NODE: |
case NODE: |
466 |
/* search matching node */ |
/* search matching node */ |
467 |
member->node = osm_get_node_by_id(osm, id); |
member->object.node = osm_get_node_by_id(osm, id); |
468 |
if(!member->node) { |
if(!member->object.node) { |
469 |
member->type = NODE_ID; |
member->object.type = NODE_ID; |
470 |
member->id = id; |
member->object.id = id; |
471 |
} |
} |
472 |
break; |
break; |
473 |
|
|
474 |
case RELATION: |
case RELATION: |
475 |
/* search matching relation */ |
/* search matching relation */ |
476 |
member->relation = osm_get_relation_by_id(osm, id); |
member->object.relation = osm_get_relation_by_id(osm, id); |
477 |
if(!member->relation) { |
if(!member->object.relation) { |
478 |
member->type = NODE_ID; |
member->object.type = NODE_ID; |
479 |
member->id = id; |
member->object.id = id; |
480 |
} |
} |
481 |
break; |
break; |
482 |
|
|
497 |
return member; |
return member; |
498 |
} |
} |
499 |
|
|
|
#ifdef OSM_DOM_PARSER |
|
|
static relation_t *osm_parse_osm_relation(osm_t *osm, |
|
|
xmlDocPtr doc, xmlNode *a_node) { |
|
|
xmlNode *cur_node = NULL; |
|
|
|
|
|
/* allocate a new relation structure */ |
|
|
relation_t *relation = g_new0(relation_t, 1); |
|
|
|
|
|
char *prop; |
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"id"))) { |
|
|
relation->id = strtoul(prop, NULL, 10); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"user"))) { |
|
|
relation->user = osm_user(osm, prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"visible"))) { |
|
|
relation->visible = (strcasecmp(prop, "true") == 0); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
if((prop = (char*)xmlGetProp(a_node, (unsigned char*)"timestamp"))) { |
|
|
relation->time = convert_iso8601(prop); |
|
|
xmlFree(prop); |
|
|
} |
|
|
|
|
|
/* scan for tags and attach a list of tags */ |
|
|
tag_t **tag = &relation->tag; |
|
|
member_t **member = &relation->member; |
|
|
|
|
|
for (cur_node = a_node->children; cur_node; cur_node = cur_node->next) { |
|
|
if (cur_node->type == XML_ELEMENT_NODE) { |
|
|
if(strcasecmp((char*)cur_node->name, "tag") == 0) { |
|
|
/* attach tag to node */ |
|
|
*tag = osm_parse_osm_tag(osm, doc, cur_node); |
|
|
if(*tag) tag = &((*tag)->next); |
|
|
} else if(strcasecmp((char*)cur_node->name, "member") == 0) { |
|
|
*member = osm_parse_osm_relation_member(osm, doc, cur_node); |
|
|
if(*member) member = &((*member)->next); |
|
|
} else |
|
|
printf("found unhandled osm/node/%s\n", cur_node->name); |
|
|
} |
|
|
} |
|
|
|
|
|
return relation; |
|
|
} |
|
|
|
|
|
/* ----------------------- generic xml handling -------------------------- */ |
|
|
|
|
|
/* parse osm entry */ |
|
|
static void osm_parse_osm(osm_t *osm, xmlDocPtr doc, xmlNode * a_node) { |
|
|
xmlNode *cur_node = NULL; |
|
|
|
|
|
for (cur_node = a_node->children; cur_node; cur_node = cur_node->next) { |
|
|
if (cur_node->type == XML_ELEMENT_NODE) { |
|
|
if(strcasecmp((char*)cur_node->name, "bounds") == 0) |
|
|
osm->bounds = osm_parse_osm_bounds(osm, doc, cur_node); |
|
|
else if(strcasecmp((char*)cur_node->name, "node") == 0) { |
|
|
/* parse node and attach it to chain */ |
|
|
node_t *new = osm_parse_osm_node(osm, doc, cur_node); |
|
|
if(new) { |
|
|
node_t **node = &osm->node; |
|
|
|
|
|
#ifdef OSM_SORT_ID |
|
|
/* search chain of nodes */ |
|
|
while(*node && ((*node)->id < new->id)) |
|
|
node = &(*node)->next; |
|
|
#endif |
|
|
|
|
|
#ifdef OSM_SORT_LAST |
|
|
while(*node) node = &(*node)->next; |
|
|
#endif |
|
|
|
|
|
/* insert into chain */ |
|
|
new->next = *node; |
|
|
*node = new; |
|
|
} |
|
|
} else if(strcasecmp((char*)cur_node->name, "way") == 0) { |
|
|
/* parse way and attach it to chain */ |
|
|
way_t *new = osm_parse_osm_way(osm, doc, cur_node); |
|
|
if(new) { |
|
|
way_t **way = &osm->way; |
|
|
|
|
|
#ifdef OSM_SORT_ID |
|
|
/* insert into chain */ |
|
|
while(*way && ((*way)->id < new->id)) |
|
|
way = &(*way)->next; |
|
|
#endif |
|
|
|
|
|
#ifdef OSM_SORT_LAST |
|
|
while(*way) way = &(*way)->next; |
|
|
#endif |
|
|
|
|
|
/* insert into chain */ |
|
|
new->next = *way; |
|
|
*way = new; |
|
|
} |
|
|
} else if(strcasecmp((char*)cur_node->name, "relation") == 0) { |
|
|
/* parse relation and attach it to chain */ |
|
|
relation_t *new = osm_parse_osm_relation(osm, doc, cur_node); |
|
|
if(new) { |
|
|
relation_t **relation = &osm->relation; |
|
|
|
|
|
#ifdef OSM_SORT_ID |
|
|
/* search chain of ways */ |
|
|
while(*relation && ((*relation)->id < new->id)) |
|
|
relation = &(*relation)->next; |
|
|
#endif |
|
|
|
|
|
#ifdef OSM_SORT_LAST |
|
|
while(*relation) relation = &(*relation)->next; |
|
|
#endif |
|
|
|
|
|
/* insert into chain */ |
|
|
new->next = *relation; |
|
|
*relation = new; |
|
|
} |
|
|
} else |
|
|
printf("found unhandled osm/%s\n", cur_node->name); |
|
|
|
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
/* parse root element and search for "osm" */ |
|
|
static osm_t *osm_parse_root(xmlDocPtr doc, xmlNode * a_node) { |
|
|
osm_t *osm; |
|
|
xmlNode *cur_node = NULL; |
|
|
|
|
|
/* allocate memory to hold osm file description */ |
|
|
osm = g_new0(osm_t, 1); |
|
|
osm->node_hash = g_new0(hash_table_t, 1); |
|
|
osm->way_hash = g_new0(hash_table_t, 1); |
|
|
|
|
|
for (cur_node = a_node; cur_node; cur_node = cur_node->next) { |
|
|
if (cur_node->type == XML_ELEMENT_NODE) { |
|
|
/* parse osm osm file ... */ |
|
|
if(strcasecmp((char*)cur_node->name, "osm") == 0) |
|
|
osm_parse_osm(osm, doc, cur_node); |
|
|
else |
|
|
printf("found unhandled %s\n", cur_node->name); |
|
|
} |
|
|
} |
|
|
|
|
|
return osm; |
|
|
} |
|
|
|
|
|
static osm_t *osm_parse_doc(xmlDocPtr doc) { |
|
|
osm_t *osm; |
|
|
|
|
|
/* Get the root element node */ |
|
|
xmlNode *root_element = xmlDocGetRootElement(doc); |
|
|
|
|
|
osm = osm_parse_root(doc, root_element); |
|
|
|
|
|
/*free the document */ |
|
|
xmlFreeDoc(doc); |
|
|
|
|
|
/* |
|
|
* Free the global variables that may |
|
|
* have been allocated by the parser. |
|
|
*/ |
|
|
xmlCleanupParser(); |
|
|
|
|
|
return osm; |
|
|
} |
|
|
#endif |
|
|
|
|
500 |
/* ------------------ osm handling ----------------- */ |
/* ------------------ osm handling ----------------- */ |
501 |
|
|
502 |
/* the two hash tables eat over 512kBytes memory and may thus be */ |
/* the two hash tables eat over 512kBytes memory and may thus be */ |
543 |
osm_relations_dump(osm->relation); |
osm_relations_dump(osm->relation); |
544 |
} |
} |
545 |
|
|
546 |
#ifdef OSM_STREAM_PARSER |
/* -------------------------- stream parser ------------------- */ |
|
/* -------------------------- stream parser tests ------------------- */ |
|
547 |
|
|
548 |
#include <libxml/xmlreader.h> |
#include <libxml/xmlreader.h> |
549 |
|
|
679 |
xmlFree(prop); |
xmlFree(prop); |
680 |
} |
} |
681 |
|
|
682 |
|
/* new in api 0.6: */ |
683 |
|
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "version"))) { |
684 |
|
node->version = strtoul(prop, NULL, 10); |
685 |
|
xmlFree(prop); |
686 |
|
} |
687 |
|
|
688 |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "lat"))) { |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "lat"))) { |
689 |
node->pos.lat = g_ascii_strtod(prop, NULL); |
node->pos.lat = g_ascii_strtod(prop, NULL); |
690 |
xmlFree(prop); |
xmlFree(prop); |
782 |
xmlFree(prop); |
xmlFree(prop); |
783 |
} |
} |
784 |
|
|
785 |
|
/* new in api 0.6: */ |
786 |
|
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "version"))) { |
787 |
|
way->version = strtoul(prop, NULL, 10); |
788 |
|
xmlFree(prop); |
789 |
|
} |
790 |
|
|
791 |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "user"))) { |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "user"))) { |
792 |
way->user = osm_user(osm, prop); |
way->user = osm_user(osm, prop); |
793 |
xmlFree(prop); |
xmlFree(prop); |
848 |
static member_t *process_member(xmlTextReaderPtr reader, osm_t *osm) { |
static member_t *process_member(xmlTextReaderPtr reader, osm_t *osm) { |
849 |
char *prop; |
char *prop; |
850 |
member_t *member = g_new0(member_t, 1); |
member_t *member = g_new0(member_t, 1); |
851 |
member->type = ILLEGAL; |
member->object.type = ILLEGAL; |
852 |
|
|
853 |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "type"))) { |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "type"))) { |
854 |
if(strcasecmp(prop, "way") == 0) member->type = WAY; |
if(strcasecmp(prop, "way") == 0) member->object.type = WAY; |
855 |
else if(strcasecmp(prop, "node") == 0) member->type = NODE; |
else if(strcasecmp(prop, "node") == 0) member->object.type = NODE; |
856 |
else if(strcasecmp(prop, "relation") == 0) member->type = RELATION; |
else if(strcasecmp(prop, "relation") == 0) member->object.type = RELATION; |
857 |
xmlFree(prop); |
xmlFree(prop); |
858 |
} |
} |
859 |
|
|
860 |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "ref"))) { |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "ref"))) { |
861 |
item_id_t id = strtoul(prop, NULL, 10); |
item_id_t id = strtoul(prop, NULL, 10); |
862 |
|
|
863 |
switch(member->type) { |
switch(member->object.type) { |
864 |
case ILLEGAL: |
case ILLEGAL: |
865 |
printf("Unable to store illegal type\n"); |
printf("Unable to store illegal type\n"); |
866 |
break; |
break; |
867 |
|
|
868 |
case WAY: |
case WAY: |
869 |
/* search matching way */ |
/* search matching way */ |
870 |
member->way = osm_get_way_by_id(osm, id); |
member->object.way = osm_get_way_by_id(osm, id); |
871 |
if(!member->way) { |
if(!member->object.way) { |
872 |
member->type = WAY_ID; |
member->object.type = WAY_ID; |
873 |
member->id = id; |
member->object.id = id; |
874 |
} |
} |
875 |
break; |
break; |
876 |
|
|
877 |
case NODE: |
case NODE: |
878 |
/* search matching node */ |
/* search matching node */ |
879 |
member->node = osm_get_node_by_id(osm, id); |
member->object.node = osm_get_node_by_id(osm, id); |
880 |
if(!member->node) { |
if(!member->object.node) { |
881 |
member->type = NODE_ID; |
member->object.type = NODE_ID; |
882 |
member->id = id; |
member->object.id = id; |
883 |
} |
} |
884 |
break; |
break; |
885 |
|
|
886 |
case RELATION: |
case RELATION: |
887 |
/* search matching relation */ |
/* search matching relation */ |
888 |
member->relation = osm_get_relation_by_id(osm, id); |
member->object.relation = osm_get_relation_by_id(osm, id); |
889 |
if(!member->relation) { |
if(!member->object.relation) { |
890 |
member->type = NODE_ID; |
member->object.type = NODE_ID; |
891 |
member->id = id; |
member->object.id = id; |
892 |
} |
} |
893 |
break; |
break; |
894 |
|
|
919 |
xmlFree(prop); |
xmlFree(prop); |
920 |
} |
} |
921 |
|
|
922 |
|
/* new in api 0.6: */ |
923 |
|
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "version"))) { |
924 |
|
relation->version = strtoul(prop, NULL, 10); |
925 |
|
xmlFree(prop); |
926 |
|
} |
927 |
|
|
928 |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "user"))) { |
if((prop = (char*)xmlTextReaderGetAttribute(reader, BAD_CAST "user"))) { |
929 |
relation->user = osm_user(osm, prop); |
relation->user = osm_user(osm, prop); |
930 |
xmlFree(prop); |
xmlFree(prop); |
1061 |
return osm; |
return osm; |
1062 |
} |
} |
1063 |
|
|
1064 |
/* ----------------------- end of stream parser tests ------------------- */ |
/* ----------------------- end of stream parser ------------------- */ |
|
#endif |
|
|
|
|
|
#ifdef OSM_QND_XML_PARSER |
|
|
/* -------------------------- qnd-xml parser tests ------------------- */ |
|
1065 |
|
|
1066 |
#ifdef USE_FLOAT |
#include <sys/time.h> |
|
#define GET_PROP_POS(a,b,c) qnd_xml_get_prop_float(a, b, c) |
|
|
#else |
|
|
#define GET_PROP_POS(a,b,c) qnd_xml_get_prop_double(a, b, c) |
|
|
#endif |
|
1067 |
|
|
1068 |
gboolean osm_bounds_cb(qnd_xml_stack_t *stack, |
osm_t *osm_parse(char *filename) { |
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
1069 |
|
|
1070 |
/* get parent pointer */ |
struct timeval start; |
1071 |
osm_t *osm = (osm_t*)stack->prev->userdata[0]; |
gettimeofday(&start, NULL); |
1072 |
|
|
1073 |
if(osm->bounds) { |
LIBXML_TEST_VERSION; |
|
errorf(NULL, "Doubly defined bounds"); |
|
|
return FALSE; |
|
|
} |
|
|
|
|
|
bounds_t *bounds = osm->bounds = g_new0(bounds_t, 1); |
|
|
|
|
|
bounds->ll_min.lat = bounds->ll_min.lon = NAN; |
|
|
bounds->ll_max.lat = bounds->ll_max.lon = NAN; |
|
|
|
|
|
GET_PROP_POS(attributes, "minlat", &bounds->ll_min.lat); |
|
|
GET_PROP_POS(attributes, "minlon", &bounds->ll_min.lon); |
|
|
GET_PROP_POS(attributes, "maxlat", &bounds->ll_max.lat); |
|
|
GET_PROP_POS(attributes, "maxlon", &bounds->ll_max.lon); |
|
|
|
|
|
if(isnan(bounds->ll_min.lat) || isnan(bounds->ll_min.lon) || |
|
|
isnan(bounds->ll_max.lat) || isnan(bounds->ll_max.lon)) { |
|
|
errorf(NULL, "Invalid coordinate in bounds (%f/%f/%f/%f)", |
|
|
bounds->ll_min.lat, bounds->ll_min.lon, |
|
|
bounds->ll_max.lat, bounds->ll_max.lon); |
|
|
|
|
|
osm_bounds_free(bounds); |
|
|
osm->bounds = NULL; |
|
|
return FALSE; |
|
|
} |
|
|
|
|
|
|
|
|
/* calculate map zone which will be used as a reference for all */ |
|
|
/* drawing/projection later on */ |
|
|
pos_t center = { (bounds->ll_max.lat + bounds->ll_min.lat)/2, |
|
|
(bounds->ll_max.lon + bounds->ll_min.lon)/2 }; |
|
|
|
|
|
pos2lpos_center(¢er, &bounds->center); |
|
|
|
|
|
/* the scale is needed to accomodate for "streching" */ |
|
|
/* by the mercartor projection */ |
|
|
bounds->scale = cos(DEG2RAD(center.lat)); |
|
|
|
|
|
pos2lpos_center(&bounds->ll_min, &bounds->min); |
|
|
bounds->min.x -= bounds->center.x; |
|
|
bounds->min.y -= bounds->center.y; |
|
|
bounds->min.x *= bounds->scale; |
|
|
bounds->min.y *= bounds->scale; |
|
|
|
|
|
pos2lpos_center(&bounds->ll_max, &bounds->max); |
|
|
bounds->max.x -= bounds->center.x; |
|
|
bounds->max.y -= bounds->center.y; |
|
|
bounds->max.x *= bounds->scale; |
|
|
bounds->max.y *= bounds->scale; |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
static gboolean osm_tag_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
tag_t *tag = *(tag_t**)stack->prev->userdata[1] = g_new0(tag_t, 1); |
|
|
|
|
|
tag->key = qnd_xml_get_prop_str(attributes, "k"); |
|
|
tag->value = qnd_xml_get_prop_str(attributes, "v"); |
|
|
|
|
|
if(!tag->key || !tag->value) { |
|
|
printf("incomplete tag key/value %s/%s\n", tag->key, tag->value); |
|
|
osm_tags_free(tag); |
|
|
tag = NULL; |
|
|
} else |
|
|
stack->prev->userdata[1] = &tag->next; |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
static gboolean osm_node_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
osm_t *osm = (osm_t*)stack->prev->userdata[0]; |
|
|
|
|
|
/* allocate a new node structure. userdata[1] points to the current */ |
|
|
/* position a new node is to be stored */ |
|
|
node_t *node = *(node_t**)stack->prev->userdata[1] = |
|
|
stack->userdata[0] = g_new0(node_t, 1); |
|
|
stack->prev->userdata[1] = &node->next; |
|
|
|
|
|
qnd_xml_get_prop_gulong(attributes, "id", &node->id); |
|
|
GET_PROP_POS(attributes, "lat", &node->pos.lat); |
|
|
GET_PROP_POS(attributes, "lon", &node->pos.lon); |
|
|
node->user = osm_user(osm, qnd_xml_get_prop(attributes, "user")); |
|
|
node->visible = qnd_xml_get_prop_is(attributes, "visible", "true"); |
|
|
node->time = convert_iso8601(qnd_xml_get_prop(attributes, "timestamp")); |
|
|
|
|
|
pos2lpos(osm->bounds, &node->pos, &node->lpos); |
|
|
|
|
|
/* store current tag pointer in userdata for fast access to current tag */ |
|
|
stack->userdata[1] = &node->tag; |
|
|
|
|
|
/* append node to end of hash table if present */ |
|
|
if(osm->node_hash) { |
|
|
hash_item_t **item = &osm->node_hash->hash[ID2HASH(node->id)]; |
|
|
while(*item) item = &(*item)->next; |
|
|
|
|
|
*item = g_new0(hash_item_t, 1); |
|
|
(*item)->data.node = node; |
|
|
} |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
static gboolean osm_way_nd_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
osm_t *osm = (osm_t*)stack->prev->prev->userdata[0]; |
|
|
|
|
|
item_id_t id; |
|
|
if(qnd_xml_get_prop_gulong(attributes, "ref", &id)) { |
|
|
/* allocate a new node_chain structure */ |
|
|
node_chain_t *node_chain = *(node_chain_t**)stack->prev->userdata[2] = |
|
|
g_new0(node_chain_t, 1); |
|
|
|
|
|
/* search matching node */ |
|
|
node_chain->node = osm_get_node_by_id(osm, id); |
|
|
if(!node_chain->node) printf("Node id %lu not found\n", id); |
|
|
else node_chain->node->ways++; |
|
|
|
|
|
stack->prev->userdata[2] = &node_chain->next; |
|
|
} |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
gboolean osm_way_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
osm_t *osm = (osm_t*)stack->prev->userdata[0]; |
|
|
|
|
|
/* allocate a new way structure. userdata[2] points to the current */ |
|
|
/* position a new way is to be stored in the way list */ |
|
|
way_t *way = *(way_t**)stack->prev->userdata[2] = |
|
|
stack->userdata[0] = g_new0(way_t, 1); |
|
|
stack->prev->userdata[2] = &way->next; |
|
|
|
|
|
qnd_xml_get_prop_gulong(attributes, "id", &way->id); |
|
|
way->user = osm_user(osm, qnd_xml_get_prop(attributes, "user")); |
|
|
way->visible = qnd_xml_get_prop_is(attributes, "visible", "true"); |
|
|
way->time = convert_iso8601(qnd_xml_get_prop(attributes, "timestamp")); |
|
|
|
|
|
/* store current tag and node_chain pointers in userdata for fast */ |
|
|
/* access to current tag/node_chain entry */ |
|
|
stack->userdata[1] = &way->tag; |
|
|
stack->userdata[2] = &way->node_chain; |
|
|
|
|
|
/* append way to end of hash table if present */ |
|
|
if(osm->way_hash) { |
|
|
hash_item_t **item = &osm->way_hash->hash[ID2HASH(way->id)]; |
|
|
while(*item) item = &(*item)->next; |
|
|
|
|
|
*item = g_new0(hash_item_t, 1); |
|
|
(*item)->data.way = way; |
|
|
} |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
static gboolean osm_rel_member_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
osm_t *osm = (osm_t*)stack->prev->prev->userdata[0]; |
|
|
|
|
|
member_t *member = *(member_t**)stack->prev->userdata[2] = |
|
|
g_new0(member_t, 1); |
|
|
stack->prev->userdata[2] = &member->next; |
|
|
member->type = ILLEGAL; |
|
|
|
|
|
char *type = qnd_xml_get_prop(attributes, "type"); |
|
|
if(type) { |
|
|
if(strcasecmp(type, "way") == 0) member->type = WAY; |
|
|
else if(strcasecmp(type, "node") == 0) member->type = NODE; |
|
|
else if(strcasecmp(type, "relation") == 0) member->type = RELATION; |
|
|
} |
|
|
|
|
|
item_id_t id; |
|
|
if(qnd_xml_get_prop_gulong(attributes, "ref", &id)) { |
|
|
switch(member->type) { |
|
|
case ILLEGAL: |
|
|
printf("Unable to store illegal type\n"); |
|
|
break; |
|
|
|
|
|
case WAY: |
|
|
/* search matching way */ |
|
|
member->way = osm_get_way_by_id(osm, id); |
|
|
if(!member->way) { |
|
|
member->type = WAY_ID; |
|
|
member->id = id; |
|
|
} |
|
|
break; |
|
|
|
|
|
case NODE: |
|
|
/* search matching node */ |
|
|
member->node = osm_get_node_by_id(osm, id); |
|
|
if(!member->node) { |
|
|
member->type = NODE_ID; |
|
|
member->id = id; |
|
|
} |
|
|
break; |
|
|
|
|
|
case RELATION: |
|
|
/* search matching relation */ |
|
|
member->relation = osm_get_relation_by_id(osm, id); |
|
|
if(!member->relation) { |
|
|
member->type = NODE_ID; |
|
|
member->id = id; |
|
|
} |
|
|
break; |
|
|
|
|
|
case WAY_ID: |
|
|
case NODE_ID: |
|
|
case RELATION_ID: |
|
|
break; |
|
|
} |
|
|
} |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
gboolean osm_rel_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
osm_t *osm = (osm_t*)stack->prev->userdata[0]; |
|
|
|
|
|
/* allocate a new relation structure. userdata[3] points to the current */ |
|
|
/* position a new relation is to be stored at in the relation list */ |
|
|
relation_t *relation = *(relation_t**)stack->prev->userdata[3] = |
|
|
stack->userdata[0] = g_new0(relation_t, 1); |
|
|
stack->prev->userdata[3] = &relation->next; |
|
|
|
|
|
qnd_xml_get_prop_gulong(attributes, "id", &relation->id); |
|
|
relation->user = osm_user(osm, qnd_xml_get_prop(attributes, "user")); |
|
|
relation->visible = qnd_xml_get_prop_is(attributes, "visible", "true"); |
|
|
relation->time = convert_iso8601(qnd_xml_get_prop(attributes, "timestamp")); |
|
|
|
|
|
/* store current tag and member pointers in userdata for fast access */ |
|
|
/* to current tag and members in their chains */ |
|
|
stack->userdata[1] = &relation->tag; |
|
|
stack->userdata[2] = &relation->member; |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
gboolean osm_cb(qnd_xml_stack_t *stack, |
|
|
qnd_xml_attribute_t *attributes, gpointer data) { |
|
|
|
|
|
g_assert(!stack->userdata[0]); |
|
|
|
|
|
/* also set parents (roots) userdata as it's the parsers return value */ |
|
|
osm_t *osm = stack->prev->userdata[0] = |
|
|
stack->userdata[0] = g_new0(osm_t, 1); |
|
|
|
|
|
osm->node_hash = g_new0(hash_table_t, 1); |
|
|
osm->way_hash = g_new0(hash_table_t, 1); |
|
|
|
|
|
/* store direct pointers for faster list access */ |
|
|
/* (otherwise we'd have to search the end of the lists for every item */ |
|
|
/* to be attached) */ |
|
|
stack->userdata[1] = &osm->node; |
|
|
stack->userdata[2] = &osm->way; |
|
|
stack->userdata[3] = &osm->relation; |
|
|
|
|
|
return TRUE; |
|
|
} |
|
|
|
|
|
|
|
|
/* these structures describe the content qnd_xml expects while parsing */ |
|
|
qnd_xml_entry_t osm_node_tag = { "tag", osm_tag_cb, QND_XML_LEAF }; |
|
|
|
|
|
qnd_xml_entry_t osm_way_tag = { "tag", osm_tag_cb, QND_XML_LEAF }; |
|
|
qnd_xml_entry_t osm_way_nd = { "nd", osm_way_nd_cb, QND_XML_LEAF }; |
|
|
|
|
|
qnd_xml_entry_t osm_rel_tag = { "tag", osm_tag_cb, QND_XML_LEAF }; |
|
|
qnd_xml_entry_t osm_rel_member = { "member", osm_rel_member_cb, QND_XML_LEAF }; |
|
|
|
|
|
qnd_xml_entry_t osm_bounds = { "bounds", osm_bounds_cb, QND_XML_LEAF }; |
|
|
|
|
|
qnd_xml_entry_t *node_children[] = { &osm_node_tag }, |
|
|
osm_node = { "node", osm_node_cb, QND_XML_CHILDREN(node_children) }; |
|
|
|
|
|
qnd_xml_entry_t *way_children[] = { &osm_way_tag, &osm_way_nd }, |
|
|
osm_way = { "way", osm_way_cb, QND_XML_CHILDREN(way_children) }; |
|
|
|
|
|
qnd_xml_entry_t *rel_children[] = { &osm_rel_tag, &osm_rel_member }, |
|
|
osm_rel = { "rel", osm_rel_cb, QND_XML_CHILDREN(rel_children) }; |
|
|
|
|
|
/* the osm element */ |
|
|
qnd_xml_entry_t *osm_children[] = { |
|
|
&osm_bounds, &osm_node, &osm_way, &osm_rel }; |
|
|
qnd_xml_entry_t osm = { "osm", osm_cb, QND_XML_CHILDREN(osm_children) }; |
|
|
|
|
|
/* the root element */ |
|
|
qnd_xml_entry_t *root_children[] = { &osm }; |
|
|
qnd_xml_entry_t root = { "<root>", NULL, QND_XML_CHILDREN(root_children) }; |
|
|
|
|
|
// gcc `pkg-config --cflags --libs glib-2.0` -o qnd_xml qnd_xml.c |
|
|
|
|
|
|
|
|
|
|
|
/* ----------------------- end of qnd-xml parser tests ------------------- */ |
|
|
#endif |
|
|
|
|
|
|
|
|
#include <sys/time.h> |
|
|
|
|
|
osm_t *osm_parse(char *filename) { |
|
|
|
|
|
struct timeval start; |
|
|
gettimeofday(&start, NULL); |
|
|
|
|
|
#ifdef OSM_STREAM_PARSER |
|
|
LIBXML_TEST_VERSION; |
|
1074 |
|
|
1075 |
// use stream parser |
// use stream parser |
1076 |
osm_t *osm = process_file(filename); |
osm_t *osm = process_file(filename); |
1077 |
xmlCleanupParser(); |
xmlCleanupParser(); |
|
#endif |
|
|
|
|
|
#ifdef OSM_DOM_PARSER |
|
|
LIBXML_TEST_VERSION; |
|
|
|
|
|
// parse into a tree |
|
|
/* parse the file and get the DOM */ |
|
|
xmlDoc *doc = NULL; |
|
|
if ((doc = xmlReadFile(filename, NULL, 0)) == NULL) { |
|
|
xmlErrorPtr errP = xmlGetLastError(); |
|
|
errorf(NULL, "While parsing \"%s\":\n\n%s", filename, errP->message); |
|
|
return NULL; |
|
|
} |
|
|
|
|
|
osm_t *osm = osm_parse_doc(doc); |
|
|
#endif |
|
|
|
|
|
#ifdef OSM_QND_XML_PARSER |
|
|
osm_t *osm = NULL; |
|
|
if(!(osm = qnd_xml_parse(filename, &root, NULL))) { |
|
|
errorf(NULL, "While parsing \"%s\"", filename); |
|
|
return NULL; |
|
|
} |
|
|
#endif |
|
1078 |
|
|
1079 |
struct timeval end; |
struct timeval end; |
1080 |
gettimeofday(&end, NULL); |
gettimeofday(&end, NULL); |
1168 |
gboolean osm_node_has_tag(node_t *node) { |
gboolean osm_node_has_tag(node_t *node) { |
1169 |
tag_t *tag = node->tag; |
tag_t *tag = node->tag; |
1170 |
|
|
1171 |
|
/* created_by tags don't count as real tags */ |
1172 |
if(tag && strcasecmp(tag->key, "created_by") == 0) |
if(tag && strcasecmp(tag->key, "created_by") == 0) |
1173 |
tag = tag->next; |
tag = tag->next; |
1174 |
|
|
1191 |
while(tag) { |
while(tag) { |
1192 |
/* make sure "created_by" tag contains our id */ |
/* make sure "created_by" tag contains our id */ |
1193 |
if(strcasecmp(tag->key, "created_by") == 0) { |
if(strcasecmp(tag->key, "created_by") == 0) { |
1194 |
g_free(tag->value); |
if(strcasecmp(tag->value, PACKAGE " v" VERSION) != 0) { |
1195 |
tag->value = g_strdup(PACKAGE " v" VERSION); |
g_free(tag->value); |
1196 |
|
tag->value = g_strdup(PACKAGE " v" VERSION); |
1197 |
|
} |
1198 |
} |
} |
1199 |
|
|
1200 |
xmlNodePtr tag_node = xmlNewChild(node, NULL, BAD_CAST "tag", NULL); |
xmlNodePtr tag_node = xmlNewChild(node, NULL, BAD_CAST "tag", NULL); |
1205 |
} |
} |
1206 |
|
|
1207 |
/* build xml representation for a way */ |
/* build xml representation for a way */ |
1208 |
char *osm_generate_xml(osm_t *osm, type_t type, void *item) { |
static char *osm_generate_xml(osm_t *osm, item_id_t changeset, |
1209 |
|
type_t type, void *item) { |
1210 |
char str[32]; |
char str[32]; |
1211 |
xmlChar *result = NULL; |
xmlChar *result = NULL; |
1212 |
int len = 0; |
int len = 0; |
1215 |
|
|
1216 |
xmlDocPtr doc = xmlNewDoc(BAD_CAST "1.0"); |
xmlDocPtr doc = xmlNewDoc(BAD_CAST "1.0"); |
1217 |
xmlNodePtr root_node = xmlNewNode(NULL, BAD_CAST "osm"); |
xmlNodePtr root_node = xmlNewNode(NULL, BAD_CAST "osm"); |
1218 |
|
#ifndef API06 |
1219 |
xmlNewProp(root_node, BAD_CAST "version", BAD_CAST "0.5"); |
xmlNewProp(root_node, BAD_CAST "version", BAD_CAST "0.5"); |
1220 |
xmlNewProp(root_node, BAD_CAST "generator", BAD_CAST PACKAGE " V" VERSION); |
xmlNewProp(root_node, BAD_CAST "generator", BAD_CAST PACKAGE " v" VERSION); |
1221 |
|
#endif |
1222 |
xmlDocSetRootElement(doc, root_node); |
xmlDocSetRootElement(doc, root_node); |
1223 |
|
|
1224 |
switch(type) { |
switch(type) { |
1232 |
snprintf(str, sizeof(str), "%u", (unsigned)node->id); |
snprintf(str, sizeof(str), "%u", (unsigned)node->id); |
1233 |
xmlNewProp(node_node, BAD_CAST "id", BAD_CAST str); |
xmlNewProp(node_node, BAD_CAST "id", BAD_CAST str); |
1234 |
} |
} |
1235 |
g_ascii_dtostr(str, sizeof(str), node->pos.lat); |
#ifdef API06 |
1236 |
|
snprintf(str, sizeof(str), "%u", (unsigned)node->version); |
1237 |
|
xmlNewProp(node_node, BAD_CAST "version", BAD_CAST str); |
1238 |
|
snprintf(str, sizeof(str), "%u", (unsigned)changeset); |
1239 |
|
xmlNewProp(node_node, BAD_CAST "changeset", BAD_CAST str); |
1240 |
|
#endif |
1241 |
|
g_ascii_formatd(str, sizeof(str), LL_FORMAT, node->pos.lat); |
1242 |
xmlNewProp(node_node, BAD_CAST "lat", BAD_CAST str); |
xmlNewProp(node_node, BAD_CAST "lat", BAD_CAST str); |
1243 |
g_ascii_dtostr(str, sizeof(str), node->pos.lon); |
g_ascii_formatd(str, sizeof(str), LL_FORMAT, node->pos.lon); |
1244 |
xmlNewProp(node_node, BAD_CAST "lon", BAD_CAST str); |
xmlNewProp(node_node, BAD_CAST "lon", BAD_CAST str); |
1245 |
osm_generate_tags(node->tag, node_node); |
osm_generate_tags(node->tag, node_node); |
1246 |
} |
} |
1252 |
xmlNodePtr way_node = xmlNewChild(root_node, NULL, BAD_CAST "way", NULL); |
xmlNodePtr way_node = xmlNewChild(root_node, NULL, BAD_CAST "way", NULL); |
1253 |
snprintf(str, sizeof(str), "%u", (unsigned)way->id); |
snprintf(str, sizeof(str), "%u", (unsigned)way->id); |
1254 |
xmlNewProp(way_node, BAD_CAST "id", BAD_CAST str); |
xmlNewProp(way_node, BAD_CAST "id", BAD_CAST str); |
1255 |
|
#ifdef API06 |
1256 |
|
snprintf(str, sizeof(str), "%u", (unsigned)way->version); |
1257 |
|
xmlNewProp(way_node, BAD_CAST "version", BAD_CAST str); |
1258 |
|
snprintf(str, sizeof(str), "%u", (unsigned)changeset); |
1259 |
|
xmlNewProp(way_node, BAD_CAST "changeset", BAD_CAST str); |
1260 |
|
#endif |
1261 |
|
|
1262 |
node_chain_t *node_chain = way->node_chain; |
node_chain_t *node_chain = way->node_chain; |
1263 |
while(node_chain) { |
while(node_chain) { |
1279 |
BAD_CAST "relation", NULL); |
BAD_CAST "relation", NULL); |
1280 |
snprintf(str, sizeof(str), "%u", (unsigned)relation->id); |
snprintf(str, sizeof(str), "%u", (unsigned)relation->id); |
1281 |
xmlNewProp(rel_node, BAD_CAST "id", BAD_CAST str); |
xmlNewProp(rel_node, BAD_CAST "id", BAD_CAST str); |
1282 |
|
#ifdef API06 |
1283 |
|
snprintf(str, sizeof(str), "%u", (unsigned)relation->version); |
1284 |
|
xmlNewProp(rel_node, BAD_CAST "version", BAD_CAST str); |
1285 |
|
snprintf(str, sizeof(str), "%u", (unsigned)changeset); |
1286 |
|
xmlNewProp(rel_node, BAD_CAST "changeset", BAD_CAST str); |
1287 |
|
#endif |
1288 |
|
|
1289 |
member_t *member = relation->member; |
member_t *member = relation->member; |
1290 |
while(member) { |
while(member) { |
1291 |
xmlNodePtr m_node = xmlNewChild(rel_node,NULL,BAD_CAST "member", NULL); |
xmlNodePtr m_node = xmlNewChild(rel_node,NULL,BAD_CAST "member", NULL); |
1292 |
char *str = NULL; |
char *str = NULL; |
1293 |
|
|
1294 |
switch(member->type) { |
switch(member->object.type) { |
1295 |
case NODE: |
case NODE: |
1296 |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "node"); |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "node"); |
1297 |
str = g_strdup_printf("%ld", member->node->id); |
str = g_strdup_printf("%ld", member->object.node->id); |
1298 |
break; |
break; |
1299 |
|
|
1300 |
case WAY: |
case WAY: |
1301 |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "way"); |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "way"); |
1302 |
str = g_strdup_printf("%ld", member->way->id); |
str = g_strdup_printf("%ld", member->object.way->id); |
1303 |
break; |
break; |
1304 |
|
|
1305 |
case RELATION: |
case RELATION: |
1306 |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "relation"); |
xmlNewProp(m_node, BAD_CAST "type", BAD_CAST "relation"); |
1307 |
str = g_strdup_printf("%ld", member->relation->id); |
str = g_strdup_printf("%ld", member->object.relation->id); |
1308 |
break; |
break; |
1309 |
|
|
1310 |
default: |
default: |
1344 |
} |
} |
1345 |
|
|
1346 |
/* build xml representation for a node */ |
/* build xml representation for a node */ |
1347 |
char *osm_generate_xml_node(osm_t *osm, node_t *node) { |
char *osm_generate_xml_node(osm_t *osm, item_id_t changeset, node_t *node) { |
1348 |
return osm_generate_xml(osm, NODE, node); |
return osm_generate_xml(osm, changeset, NODE, node); |
1349 |
} |
} |
1350 |
|
|
1351 |
/* build xml representation for a way */ |
/* build xml representation for a way */ |
1352 |
char *osm_generate_xml_way(osm_t *osm, way_t *way) { |
char *osm_generate_xml_way(osm_t *osm, item_id_t changeset, way_t *way) { |
1353 |
return osm_generate_xml(osm, WAY, way); |
return osm_generate_xml(osm, changeset, WAY, way); |
1354 |
} |
} |
1355 |
|
|
1356 |
/* build xml representation for a relation */ |
/* build xml representation for a relation */ |
1357 |
char *osm_generate_xml_relation(osm_t *osm, relation_t *relation) { |
char *osm_generate_xml_relation(osm_t *osm, item_id_t changeset, |
1358 |
return osm_generate_xml(osm, RELATION, relation); |
relation_t *relation) { |
1359 |
|
return osm_generate_xml(osm, changeset, RELATION, relation); |
1360 |
} |
} |
1361 |
|
|
1362 |
|
/* build xml representation for a changeset */ |
1363 |
|
char *osm_generate_xml_changeset(osm_t *osm, char *comment) { |
1364 |
|
xmlChar *result = NULL; |
1365 |
|
int len = 0; |
1366 |
|
|
1367 |
|
/* tags for this changeset */ |
1368 |
|
tag_t tag_comment = { |
1369 |
|
.key = "comment", .value = comment, .next = NULL }; |
1370 |
|
tag_t tag_creator = { |
1371 |
|
.key = "created_by", .value = PACKAGE " v" VERSION, .next = &tag_comment }; |
1372 |
|
|
1373 |
|
LIBXML_TEST_VERSION; |
1374 |
|
|
1375 |
|
xmlDocPtr doc = xmlNewDoc(BAD_CAST "1.0"); |
1376 |
|
xmlNodePtr root_node = xmlNewNode(NULL, BAD_CAST "osm"); |
1377 |
|
xmlDocSetRootElement(doc, root_node); |
1378 |
|
|
1379 |
|
xmlNodePtr cs_node = xmlNewChild(root_node, NULL, BAD_CAST "changeset", NULL); |
1380 |
|
osm_generate_tags(&tag_creator, cs_node); |
1381 |
|
|
1382 |
|
xmlDocDumpFormatMemoryEnc(doc, &result, &len, "UTF-8", 1); |
1383 |
|
xmlFreeDoc(doc); |
1384 |
|
xmlCleanupParser(); |
1385 |
|
|
1386 |
|
// puts("xml encoding result:"); |
1387 |
|
// puts((char*)result); |
1388 |
|
|
1389 |
|
return (char*)result; |
1390 |
|
} |
1391 |
|
|
1392 |
|
|
1393 |
/* the following three functions are eating much CPU power */ |
/* the following three functions are eating much CPU power */ |
1394 |
/* as they search the objects lists. Hashing is supposed to help */ |
/* as they search the objects lists. Hashing is supposed to help */ |
1395 |
node_t *osm_get_node_by_id(osm_t *osm, item_id_t id) { |
node_t *osm_get_node_by_id(osm_t *osm, item_id_t id) { |
1525 |
printf("Creating new node\n"); |
printf("Creating new node\n"); |
1526 |
|
|
1527 |
node_t *node = g_new0(node_t, 1); |
node_t *node = g_new0(node_t, 1); |
1528 |
|
node->version = 1; |
1529 |
node->lpos.x = x; |
node->lpos.x = x; |
1530 |
node->lpos.y = y; |
node->lpos.y = y; |
1531 |
node->visible = TRUE; |
node->visible = TRUE; |
1532 |
node->time = time(NULL); |
node->time = time(NULL); |
1533 |
|
|
1534 |
|
#ifndef API06 |
1535 |
/* add created_by tag */ |
/* add created_by tag */ |
1536 |
node->tag = g_new0(tag_t, 1); |
node->tag = g_new0(tag_t, 1); |
1537 |
node->tag->key = g_strdup("created_by"); |
node->tag->key = g_strdup("created_by"); |
1538 |
node->tag->value = g_strdup(PACKAGE " v" VERSION); |
node->tag->value = g_strdup(PACKAGE " v" VERSION); |
1539 |
|
#endif |
1540 |
|
|
1541 |
/* convert screen position back to ll */ |
/* convert screen position back to ll */ |
1542 |
lpos2pos(osm->bounds, &node->lpos, &node->pos); |
lpos2pos(osm->bounds, &node->lpos, &node->pos); |
1573 |
printf("Creating new way\n"); |
printf("Creating new way\n"); |
1574 |
|
|
1575 |
way_t *way = g_new0(way_t, 1); |
way_t *way = g_new0(way_t, 1); |
1576 |
|
way->version = 1; |
1577 |
way->visible = TRUE; |
way->visible = TRUE; |
1578 |
way->flags = OSM_FLAG_NEW; |
way->flags = OSM_FLAG_NEW; |
1579 |
way->time = time(NULL); |
way->time = time(NULL); |
1580 |
|
|
1581 |
|
#ifndef API06 |
1582 |
/* add created_by tag */ |
/* add created_by tag */ |
1583 |
way->tag = g_new0(tag_t, 1); |
way->tag = g_new0(tag_t, 1); |
1584 |
way->tag->key = g_strdup("created_by"); |
way->tag->key = g_strdup("created_by"); |
1585 |
way->tag->value = g_strdup(PACKAGE " v" VERSION); |
way->tag->value = g_strdup(PACKAGE " v" VERSION); |
1586 |
|
#endif |
1587 |
|
|
1588 |
return way; |
return way; |
1589 |
} |
} |
1689 |
|
|
1690 |
member_t *member = relation->member; |
member_t *member = relation->member; |
1691 |
while(member) { |
while(member) { |
1692 |
switch(member->type) { |
switch(member->object.type) { |
1693 |
case NODE: |
case NODE: |
1694 |
/* nodes are checked directly */ |
/* nodes are checked directly */ |
1695 |
if(member->node == node) |
if(member->object.node == node) |
1696 |
is_member = TRUE; |
is_member = TRUE; |
1697 |
break; |
break; |
1698 |
|
|
1699 |
case WAY: { |
case WAY: { |
1700 |
/* ways have to be checked for the nodes they consist of */ |
/* ways have to be checked for the nodes they consist of */ |
1701 |
node_chain_t *chain = member->way->node_chain; |
node_chain_t *chain = member->object.way->node_chain; |
1702 |
while(chain && !is_member) { |
while(chain && !is_member) { |
1703 |
if(chain->node == node) |
if(chain->node == node) |
1704 |
is_member = TRUE; |
is_member = TRUE; |
1736 |
|
|
1737 |
member_t *member = relation->member; |
member_t *member = relation->member; |
1738 |
while(member) { |
while(member) { |
1739 |
switch(member->type) { |
switch(member->object.type) { |
1740 |
case WAY: { |
case WAY: { |
1741 |
/* ways can be check directly */ |
/* ways can be check directly */ |
1742 |
if(member->way == way) |
if(member->object.way == way) |
1743 |
is_member = TRUE; |
is_member = TRUE; |
1744 |
} break; |
} break; |
1745 |
|
|
1806 |
while(relation) { |
while(relation) { |
1807 |
member_t **member = &relation->member; |
member_t **member = &relation->member; |
1808 |
while(*member) { |
while(*member) { |
1809 |
if(((*member)->type == NODE) && |
if(((*member)->object.type == NODE) && |
1810 |
((*member)->node == node)) { |
((*member)->object.node == node)) { |
1811 |
|
|
1812 |
printf(" from relation #%ld\n", relation->id); |
printf(" from relation #%ld\n", relation->id); |
1813 |
|
|
1831 |
while(relation) { |
while(relation) { |
1832 |
member_t **member = &relation->member; |
member_t **member = &relation->member; |
1833 |
while(*member) { |
while(*member) { |
1834 |
if(((*member)->type == WAY) && |
if(((*member)->object.type == WAY) && |
1835 |
((*member)->way == way)) { |
((*member)->object.way == way)) { |
1836 |
|
|
1837 |
printf(" from relation #%ld\n", relation->id); |
printf(" from relation #%ld\n", relation->id); |
1838 |
|
|
1852 |
printf("Creating new relation\n"); |
printf("Creating new relation\n"); |
1853 |
|
|
1854 |
relation_t *relation = g_new0(relation_t, 1); |
relation_t *relation = g_new0(relation_t, 1); |
1855 |
|
relation->version = 1; |
1856 |
relation->visible = TRUE; |
relation->visible = TRUE; |
1857 |
relation->flags = OSM_FLAG_NEW; |
relation->flags = OSM_FLAG_NEW; |
1858 |
relation->time = time(NULL); |
relation->time = time(NULL); |
1859 |
|
|
1860 |
|
#ifndef API06 |
1861 |
/* add created_by tag */ |
/* add created_by tag */ |
1862 |
relation->tag = g_new0(tag_t, 1); |
relation->tag = g_new0(tag_t, 1); |
1863 |
relation->tag->key = g_strdup("created_by"); |
relation->tag->key = g_strdup("created_by"); |
1864 |
relation->tag->value = g_strdup(PACKAGE " v" VERSION); |
relation->tag->value = g_strdup(PACKAGE " v" VERSION); |
1865 |
|
#endif |
1866 |
|
|
1867 |
return relation; |
return relation; |
1868 |
} |
} |
1980 |
} |
} |
1981 |
} |
} |
1982 |
|
|
1983 |
void osm_way_revert(way_t *way) { |
void osm_way_reverse(way_t *way) { |
1984 |
node_chain_t *new = NULL; |
node_chain_t *new = NULL; |
1985 |
|
|
1986 |
/* walk old chain first to last */ |
/* walk old chain first to last */ |
1998 |
way->node_chain = new; |
way->node_chain = new; |
1999 |
} |
} |
2000 |
|
|
2001 |
|
static const char *DS_ONEWAY_FWD = "yes"; |
2002 |
|
static const char *DS_ONEWAY_REV = "-1"; |
2003 |
|
static const char *DS_LEFT_SUFFIX = ":left"; |
2004 |
|
static const char *DS_RIGHT_SUFFIX = ":right"; |
2005 |
|
|
2006 |
|
/* Reverse direction-sensitive tags like "oneway". Marks the way as dirty if |
2007 |
|
* anything is changed, and returns the number of flipped tags. */ |
2008 |
|
|
2009 |
|
guint |
2010 |
|
osm_way_reverse_direction_sensitive_tags (way_t *way) { |
2011 |
|
tag_t *tag = way->tag; |
2012 |
|
guint n_tags_altered = 0; |
2013 |
|
while (tag != NULL) { |
2014 |
|
char *lc_key = g_ascii_strdown(tag->key, -1); |
2015 |
|
char *lc_value = g_ascii_strdown(tag->value, -1); |
2016 |
|
|
2017 |
|
if (strcmp(lc_key, "oneway") == 0) { |
2018 |
|
// oneway={yes/true/1/-1} is unusual. |
2019 |
|
// Favour "yes" and "-1". |
2020 |
|
if ((strcmp(lc_value, DS_ONEWAY_FWD) == 0) || |
2021 |
|
(strcmp(lc_value, "true") == 0) || |
2022 |
|
(strcmp(lc_value, "1") == 0)) { |
2023 |
|
g_free(tag->value); |
2024 |
|
tag->value = g_strdup(DS_ONEWAY_REV); |
2025 |
|
n_tags_altered++; |
2026 |
|
} |
2027 |
|
else if (strcmp(lc_value, DS_ONEWAY_REV) == 0) { |
2028 |
|
g_free(tag->value); |
2029 |
|
tag->value = g_strdup(DS_ONEWAY_FWD); |
2030 |
|
n_tags_altered++; |
2031 |
|
} |
2032 |
|
else { |
2033 |
|
printf("warning: unknown tag: %s=%s\n", tag->key, tag->value); |
2034 |
|
} |
2035 |
|
} |
2036 |
|
|
2037 |
|
// :left and :right suffixes |
2038 |
|
else if (g_str_has_suffix(lc_key, DS_LEFT_SUFFIX)) { |
2039 |
|
char *key_old = tag->key; |
2040 |
|
char *lastcolon = rindex(key_old, ':'); |
2041 |
|
g_assert(lastcolon != NULL); |
2042 |
|
*lastcolon = '\000'; |
2043 |
|
tag->key = g_strconcat(key_old, DS_RIGHT_SUFFIX, NULL); |
2044 |
|
*lastcolon = ':'; |
2045 |
|
g_free(key_old); |
2046 |
|
n_tags_altered++; |
2047 |
|
} |
2048 |
|
else if (g_str_has_suffix(lc_key, DS_RIGHT_SUFFIX)) { |
2049 |
|
char *key_old = tag->key; |
2050 |
|
char *lastcolon = rindex(key_old, ':'); |
2051 |
|
g_assert(lastcolon != NULL); |
2052 |
|
*lastcolon = '\000'; |
2053 |
|
tag->key = g_strconcat(key_old, DS_LEFT_SUFFIX, NULL); |
2054 |
|
*lastcolon = ':'; |
2055 |
|
g_free(key_old); |
2056 |
|
n_tags_altered++; |
2057 |
|
} |
2058 |
|
|
2059 |
|
g_free(lc_key); |
2060 |
|
g_free(lc_value); |
2061 |
|
tag = tag->next; |
2062 |
|
} |
2063 |
|
if (n_tags_altered > 0) { |
2064 |
|
way->flags |= OSM_FLAG_DIRTY; |
2065 |
|
} |
2066 |
|
return n_tags_altered; |
2067 |
|
} |
2068 |
|
|
2069 |
|
/* Reverse a way's role within relations where the role is direction-sensitive. |
2070 |
|
* Returns the number of roles flipped, and marks any relations changed as |
2071 |
|
* dirty. */ |
2072 |
|
|
2073 |
|
static const char *DS_ROUTE_FORWARD = "forward"; |
2074 |
|
static const char *DS_ROUTE_REVERSE = "reverse"; |
2075 |
|
|
2076 |
|
guint |
2077 |
|
osm_way_reverse_direction_sensitive_roles(osm_t *osm, way_t *way) { |
2078 |
|
relation_chain_t *rel_chain0, *rel_chain; |
2079 |
|
rel_chain0 = rel_chain = osm_way_to_relation(osm, way); |
2080 |
|
guint n_roles_flipped = 0; |
2081 |
|
|
2082 |
|
for (; rel_chain != NULL; rel_chain = rel_chain->next) { |
2083 |
|
char *type = osm_tag_get_by_key(rel_chain->relation->tag, "type"); |
2084 |
|
|
2085 |
|
// Route relations; http://wiki.openstreetmap.org/wiki/Relation:route |
2086 |
|
if (strcasecmp(type, "route") == 0) { |
2087 |
|
|
2088 |
|
// First find the member corresponding to our way: |
2089 |
|
member_t *member = rel_chain->relation->member; |
2090 |
|
for (; member != NULL; member = member->next) { |
2091 |
|
if (member->object.type == WAY) { |
2092 |
|
if (member->object.way == way) |
2093 |
|
break; |
2094 |
|
} |
2095 |
|
if (member->object.type == WAY_ID) { |
2096 |
|
if (member->object.id == way->id) |
2097 |
|
break; |
2098 |
|
} |
2099 |
|
} |
2100 |
|
g_assert(member); // osm_way_to_relation() broken? |
2101 |
|
|
2102 |
|
// Then flip its role if it's one of the direction-sensitive ones |
2103 |
|
if (member->role == NULL) { |
2104 |
|
printf("null role in route relation -> ignore\n"); |
2105 |
|
} |
2106 |
|
else if (strcasecmp(member->role, DS_ROUTE_FORWARD) == 0) { |
2107 |
|
g_free(member->role); |
2108 |
|
member->role = g_strdup(DS_ROUTE_REVERSE); |
2109 |
|
rel_chain->relation->flags |= OSM_FLAG_DIRTY; |
2110 |
|
++n_roles_flipped; |
2111 |
|
} |
2112 |
|
else if (strcasecmp(member->role, DS_ROUTE_REVERSE) == 0) { |
2113 |
|
g_free(member->role); |
2114 |
|
member->role = g_strdup(DS_ROUTE_FORWARD); |
2115 |
|
rel_chain->relation->flags |= OSM_FLAG_DIRTY; |
2116 |
|
++n_roles_flipped; |
2117 |
|
} |
2118 |
|
|
2119 |
|
// TODO: what about numbered stops? Guess we ignore them; there's no |
2120 |
|
// consensus about whether they should be placed on the way or to one side |
2121 |
|
// of it. |
2122 |
|
|
2123 |
|
}//if-route |
2124 |
|
|
2125 |
|
|
2126 |
|
} |
2127 |
|
if (rel_chain0) { |
2128 |
|
g_free(rel_chain0); |
2129 |
|
} |
2130 |
|
return n_roles_flipped; |
2131 |
|
} |
2132 |
|
|
2133 |
node_t *osm_way_get_first_node(way_t *way) { |
node_t *osm_way_get_first_node(way_t *way) { |
2134 |
node_chain_t *chain = way->node_chain; |
node_chain_t *chain = way->node_chain; |
2135 |
if(!chain) return NULL; |
if(!chain) return NULL; |
2189 |
} |
} |
2190 |
|
|
2191 |
/* return plain text of type */ |
/* return plain text of type */ |
2192 |
char *osm_type_string(type_t type) { |
char *osm_object_type_string(object_t *object) { |
2193 |
const struct { type_t type; char *name; } types[] = { |
const struct { type_t type; char *name; } types[] = { |
2194 |
{ ILLEGAL, "illegal" }, |
{ ILLEGAL, "illegal" }, |
2195 |
{ NODE, "node" }, |
{ NODE, "node" }, |
2203 |
|
|
2204 |
int i; |
int i; |
2205 |
for(i=0;types[i].name;i++) |
for(i=0;types[i].name;i++) |
2206 |
if(type == types[i].type) |
if(object->type == types[i].type) |
2207 |
return types[i].name; |
return types[i].name; |
2208 |
|
|
2209 |
return NULL; |
return NULL; |
2210 |
} |
} |
2211 |
|
|
2212 |
char *osm_object_string(type_t type, void *object) { |
char *osm_object_string(object_t *object) { |
2213 |
char *type_str = osm_type_string(type); |
char *type_str = osm_object_type_string(object); |
2214 |
|
|
2215 |
if(!object) |
if(!object) |
2216 |
return g_strdup_printf("%s #<invalid>", type_str); |
return g_strdup_printf("%s #<invalid>", type_str); |
2217 |
|
|
2218 |
switch(type) { |
switch(object->type) { |
2219 |
case ILLEGAL: |
case ILLEGAL: |
2220 |
return g_strdup_printf("%s #<unspec>", type_str); |
return g_strdup_printf("%s #<unspec>", type_str); |
2221 |
break; |
break; |
2222 |
case NODE: |
case NODE: |
2223 |
return g_strdup_printf("%s #%ld", type_str, ((node_t*)object)->id); |
return g_strdup_printf("%s #%ld", type_str, object->node->id); |
2224 |
|
break; |
2225 |
|
case WAY: |
2226 |
|
return g_strdup_printf("%s #%ld", type_str, object->way->id); |
2227 |
|
break; |
2228 |
|
case RELATION: |
2229 |
|
return g_strdup_printf("%s #%ld", type_str, object->relation->id); |
2230 |
|
break; |
2231 |
|
case NODE_ID: |
2232 |
|
case WAY_ID: |
2233 |
|
case RELATION_ID: |
2234 |
|
return g_strdup_printf("%s #%ld", type_str, object->id); |
2235 |
|
break; |
2236 |
|
} |
2237 |
|
return NULL; |
2238 |
|
} |
2239 |
|
|
2240 |
|
char *osm_object_id_string(object_t *object) { |
2241 |
|
if(!object) return NULL; |
2242 |
|
|
2243 |
|
switch(object->type) { |
2244 |
|
case ILLEGAL: |
2245 |
|
return NULL; |
2246 |
|
break; |
2247 |
|
case NODE: |
2248 |
|
return g_strdup_printf("#%ld", object->node->id); |
2249 |
|
break; |
2250 |
|
case WAY: |
2251 |
|
return g_strdup_printf("#%ld", object->way->id); |
2252 |
|
break; |
2253 |
|
case RELATION: |
2254 |
|
return g_strdup_printf("#%ld", object->relation->id); |
2255 |
|
break; |
2256 |
|
case NODE_ID: |
2257 |
|
case WAY_ID: |
2258 |
|
case RELATION_ID: |
2259 |
|
return g_strdup_printf("#%ld", object->id); |
2260 |
|
break; |
2261 |
|
} |
2262 |
|
return NULL; |
2263 |
|
} |
2264 |
|
|
2265 |
|
tag_t *osm_object_get_tags(object_t *object) { |
2266 |
|
if(!object) return NULL; |
2267 |
|
|
2268 |
|
switch(object->type) { |
2269 |
|
case ILLEGAL: |
2270 |
|
return NULL; |
2271 |
|
break; |
2272 |
|
case NODE: |
2273 |
|
return object->node->tag; |
2274 |
break; |
break; |
2275 |
case WAY: |
case WAY: |
2276 |
return g_strdup_printf("%s #%ld", type_str, ((way_t*)object)->id); |
return object->way->tag; |
2277 |
break; |
break; |
2278 |
case RELATION: |
case RELATION: |
2279 |
return g_strdup_printf("%s #%ld", type_str, ((relation_t*)object)->id); |
return object->relation->tag; |
2280 |
break; |
break; |
2281 |
case NODE_ID: |
case NODE_ID: |
2282 |
case WAY_ID: |
case WAY_ID: |
2283 |
case RELATION_ID: |
case RELATION_ID: |
2284 |
return g_strdup_printf("%s #%ld", type_str, *((item_id_t*)object)); |
return NULL; |
2285 |
break; |
break; |
2286 |
} |
} |
2287 |
return NULL; |
return NULL; |
2288 |
} |
} |
2289 |
|
|
2290 |
|
|
2291 |
|
gint osm_relation_members_num(relation_t *relation) { |
2292 |
|
gint num = 0; |
2293 |
|
member_t *member = relation->member; |
2294 |
|
while(member) { |
2295 |
|
num++; |
2296 |
|
member = member->next; |
2297 |
|
} |
2298 |
|
return num; |
2299 |
|
} |
2300 |
|
|
2301 |
|
void osm_object_set_flags(object_t *object, int set, int clr) { |
2302 |
|
|
2303 |
|
switch(object->type) { |
2304 |
|
case NODE: |
2305 |
|
object->node->flags |= set; |
2306 |
|
object->node->flags &= ~clr; |
2307 |
|
break; |
2308 |
|
|
2309 |
|
case WAY: |
2310 |
|
object->way->flags |= set; |
2311 |
|
object->way->flags &= ~clr; |
2312 |
|
break; |
2313 |
|
|
2314 |
|
case RELATION: |
2315 |
|
object->relation->flags |= set; |
2316 |
|
object->relation->flags &= ~clr; |
2317 |
|
break; |
2318 |
|
|
2319 |
|
default: |
2320 |
|
g_assert(0); |
2321 |
|
break; |
2322 |
|
} |
2323 |
|
} |
2324 |
|
|
2325 |
// vim:et:ts=8:sw=2:sts=2:ai |
// vim:et:ts=8:sw=2:sts=2:ai |