1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724
|
/* tile-write.cpp. Writes openstreetmap map tiles using a series of rules
(defined near the top) and a pre-processed database file of roads, paths,
and areas arranged as a quad-tree in the same fashion as the tiles.
Current issues:
No text support - would be easy to add.
*/
#include "../../utils/qthelpers.h"
#include <string>
#include <string.h>
#include <stdio.h>
#include <stdarg.h>
#include <list>
#include <vector>
#include <map>
#include <algorithm>
#ifdef TILE_WRITE_MAIN
#include <iostream>
#define qCritical() std::cout
#else
#include <QDebug>
#endif
#include "types.h"
#include "tile-write.h"
#include "img_writer.h"
#include "quadtile.h"
#define DB_VERSION "org.hollo.quadtile.pqdb.03"
#ifdef PROFILELOGGING
#include <sys/time.h>
static char g_timelog_str[256];
static struct timeval g_timelog_tz, g_timelog_tz2;
#define TIMELOGINIT(A) {strncpy(g_timelog_str, (A), 256);\
gettimeofday(&g_timelog_tz, 0);}
#define TIMELOG(A) {gettimeofday(&g_timelog_tz2,0); \
fprintf(stderr, "%s: %-25s %10ldms\n", g_timelog_str, (A), (g_timelog_tz2.tv_sec-g_timelog_tz.tv_sec)*1000 + g_timelog_tz2.tv_usec/1000 - g_timelog_tz.tv_usec/1000); g_timelog_tz = g_timelog_tz2;}
#else
#define TIMELOGINIT(A)
#define TIMELOG(A)
#endif
/* Logging stuff - integrate to MoNav*/
enum logLevel {LOG_VERBOSE, LOG_DEBUG, LOG_ERROR, LOG_CRITICAL};
static void Log(enum logLevel lvl, const char *fmt, ...)
{
if(lvl < LOG_ERROR) return;
va_list argp;
va_start(argp, fmt);
if(lvl>=LOG_VERBOSE) vfprintf(stdout, fmt, argp);
va_end(argp);
}
/*Way. FIXME this class has been ported across
from another application in which it needed far more functionality.
Needs pruning and lots of clean up */
struct coord {
unsigned long x, y;
};
class Way {
public:
Way() {ncoords=0;};
bool init(FILE *fp);
void print();
bool draw(ImgWriter &img, DrawingRules & rules,
unsigned long tilex, unsigned long tiley,
int zoom, int magnification, int pass);
static bool sort_by_type(Way w1, Way w2) {return w1.type<w2.type;};
static void new_tile() {allcoords.clear();};
osm_type_t type;
private:
int coordi, ncoords;
static std::vector<coord> allcoords; //Coords for all loaded ways.
};
std::vector<coord> Way::allcoords;
//Initialise a way from the database. fp has been seeked to the start of the
//way we wish to read.
bool Way::init(FILE *fp)
{
unsigned char buf[18];
if(fread(buf, 11, 1, fp)!=1) {
Log(LOG_ERROR, "Failure to read any of the way\n");
return false;
}
type = (osm_type_t) buf[0];
int nqtiles = (((int) buf[1]) << 8) | buf[2];
coord c;
c.x = buf2l(buf+3);
c.y = buf2l(buf+7);
coordi = allcoords.size();
ncoords = 1;
allcoords.push_back(c);
//Add the cordinates
for(int i=1;i<nqtiles;i++) {
if(fread(buf, 4, 1, fp)!=1) {
Log(LOG_ERROR, "Failed to read remainder of route\n");
return false;
}
long dx = ((buf[0]<<8) | buf[1]) << 4;
long dy = ((buf[2]<<8) | buf[3]) << 4;
dx -= 1<<19; dy -= 1<<19;
c.x += (dx);
c.y += (dy);
allcoords.push_back(c);
ncoords++;
}
return true;
}
static int g_nways=0, g_ndrawnways=0;
//Draw this way to an img tile.
bool Way::draw(ImgWriter &img, DrawingRules & rules,
unsigned long tilex, unsigned long tiley,
int zoom, int magnification, int pass)
{
g_nways++;
int r, g, b;
double width;
bool polygon;
if(!rules.get_rule(type, zoom, pass, &r, &g, &b, &width, &polygon)) return false;
img.SetPen(r, g, b, width * magnification);
g_ndrawnways++;
int oldx=0, oldy=0;
ImgWriter::coord *c=NULL;
if(polygon) {
c = new ImgWriter::coord[ncoords];
}
int j=0;
for(std::vector<coord>::iterator i=allcoords.begin() + coordi;
i!=allcoords.begin() + coordi + ncoords; i++){
int newx, newy;
if(zoom<10 && i!=allcoords.begin() + coordi)
i = allcoords.begin() + coordi + ncoords -1;
//The coords are in the range 0 to 1ULL<<31
//We want to divide by 2^31 and multiply by 2^zoom and multiply
//by 2^8 (=256 - the no of pixels in a tile) to get to pixel
//scale at current zoom. We do this with a shift as it's faster
//and performance sensitive on profiling. Note we can't do
//(i->x - tilex) >> (31-8-zoom) as if(tilex>i->x) we'll be shifting
//a negative number. We shift each part separately, and then cast to a
//signed number before subtracting.
newx = (long) ((i->x) >> (31-8-zoom)) - (long) (tilex >> (31-8-zoom));
newy = (long) ((i->y) >> (31-8-zoom)) - (long) (tiley >> (31-8-zoom));
newx *= magnification;
newy *= magnification;
if(!polygon && i!=allcoords.begin() + coordi) {
img.DrawLine(oldx, oldy, newx, newy);
}
if(polygon) {c[j].x = newx; c[j++].y = newy;}
oldx=newx; oldy=newy;
}
if(polygon) {
img.FillPoly(c, ncoords);
delete [] c;
}
return true;
}
/* DrawingRules - load from rendering.qrr */
DrawingRules::DrawingRules(const std::string &filename) :
filename( filename )
{
load_rules();
}
bool DrawingRules::get_rule(osm_type_t type, int zoom, int pass,
int *r, int *g, int *b, double *width, bool *polygon)
{
if(pass<0 || pass>1) return false;
for(std::vector<struct DrawingRule>::iterator rule = drawing_rules.begin();
rule!=drawing_rules.end(); rule++) {
if(type >= rule->type_from && type <= rule->type_to &&
zoom>=rule->zoom_from && zoom<=rule->zoom_to) {
if(rule->red[pass]==-1) return false;
*r = rule->red[pass];
*g = rule->green[pass];
*b = rule->blue[pass];
*width = rule->width[pass];
*polygon = rule->polygon;
return true;
}
}
return false;
}
bool DrawingRules::load_rules()
{
static std::map<std::string, osm_type_t> type_table;
type_table["AREA_PARK"] = AREA_PARK;
type_table["AREA_CAMPSITE"] = AREA_CAMPSITE;
type_table["AREA_NATURE"] = AREA_NATURE;
type_table["AREA_CEMETERY"] = AREA_CEMETERY;
type_table["AREA_RESIDENTIAL"] = AREA_RESIDENTIAL;
type_table["AREA_BARRACKS"] = AREA_BARRACKS;
type_table["AREA_MILITARY"] = AREA_MILITARY;
type_table["AREA_FIELD"] = AREA_FIELD;
type_table["AREA_DANGER_AREA"] = AREA_DANGER_AREA;
type_table["AREA_MEADOW"] = AREA_MEADOW;
type_table["AREA_COMMON"] = AREA_COMMON;
type_table["AREA_FOREST"] = AREA_FOREST;
type_table["AREA_WATER"] = AREA_WATER;
type_table["AREA_WOOD"] = AREA_WOOD;
type_table["AREA_RETAIL"] = AREA_RETAIL;
type_table["AREA_INDUSTRIAL"] = AREA_INDUSTRIAL;
type_table["AREA_PARKING"] = AREA_PARKING;
type_table["AREA_BUILDING"] = AREA_BUILDING;
type_table["HW_PEDESTRIAN"] = HW_PEDESTRIAN;
type_table["HW_PATH"] = HW_PATH;
type_table["HW_FOOTWAY"] = HW_FOOTWAY;
type_table["HW_STEPS"] = HW_STEPS;
type_table["HW_BRIDLEWAY"] = HW_BRIDLEWAY;
type_table["HW_CYCLEWAY"] = HW_CYCLEWAY;
type_table["HW_PRIVATE"] = HW_PRIVATE;
type_table["HW_UNSURFACED"] = HW_UNSURFACED;
type_table["HW_UNCLASSIFIED"] = HW_UNCLASSIFIED;
type_table["HW_RESIDENTIAL"] = HW_RESIDENTIAL;
type_table["HW_LIVING_STREET"] = HW_LIVING_STREET;
type_table["HW_SERVICE"] = HW_SERVICE;
type_table["HW_TERTIARY"] = HW_TERTIARY;
type_table["HW_SECONDARY"] = HW_SECONDARY;
type_table["HW_PRIMARY"] = HW_PRIMARY;
type_table["HW_TRUNK"] = HW_TRUNK;
type_table["HW_MOTORWAY"] = HW_MOTORWAY;
type_table["RW_RAIL"] = RW_RAIL;
type_table["WATERWAY"] = WATERWAY;
type_table["PLACE_TOWN"] = PLACE_TOWN;
drawing_rules.clear();
std::map<std::string, long> colourMap;
char buf[4096];
FILE *fp = fopen(filename.c_str(), "r");
if(!fp) {
qCritical() << "Can't find rendering rules:" << filename.c_str();
return false;
}
while(fgets(buf, 4095, fp)) {
if(strlen(buf)<1) return false;
buf[strlen(buf)-1]=0;
std::vector<std::string> tokens;
tokenise(buf, tokens);
if(tokens.size()<5) continue;
int i=1;
if(tokens[0] == "Colour:") {
if(tokens.size()!=5) continue;
int red, green, blue;
i++;
if(!sscanf(tokens[i++].c_str(), "%i", &red)) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &green)) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &blue)) continue;
printf("%s: %d, %d, %d\n", tokens[1].c_str(), red, green, blue);
colourMap[tokens[1]] = (red << 16) | (green << 8) | (blue + 1);
}
else if(tokens[0]=="Line:") {
if(tokens.size()<7) continue;
DrawingRule r;
memset(&r, 0, sizeof(DrawingRule));
r.red[1] = -1; //Disable 2nd pass by default.
r.type_from = type_table[tokens[i++]];
r.type_to = type_table[tokens[i++]];
r.polygon = false;
r.zoom_from = atoi(tokens[i++].c_str());
r.zoom_to = atoi(tokens[i++].c_str());
std::string tmp = tokens[i++];
if(colourMap[tmp]) {
//Colour is stored +1 so we can store black (0) and find it.
long col = colourMap[tmp]-1;
r.red[0] = col >> 16;
r.green[0] = (col >> 8) & 0xFF;
r.blue[0] = (col & 0xFF);
} else {
if(!sscanf(tmp.c_str(), "%i", &r.red[0])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.green[0])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.blue[0])) continue;
}
r.width[0] = atof(tokens[i++].c_str());
if(i== (int) tokens.size()) {
drawing_rules.push_back(r);
continue;
}
tmp = tokens[i++];
if(colourMap[tmp]) {
long col = colourMap[tmp]-1;
r.red[1] = col >> 16;
r.green[1] = (col >> 8) & 0xFF;
r.blue[1] = (col & 0xFF);
} else {
if(!sscanf(tmp.c_str(), "%i", &r.red[1])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.green[1])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.blue[1])) continue;
}
r.width[1] = atof(tokens[i++].c_str());
drawing_rules.push_back(r);
}
else if(tokens[0]=="Area:") {
if(tokens.size()<5) continue;
DrawingRule r;
memset(&r, 0, sizeof(DrawingRule));
r.type_from = type_table[tokens[i++]];
r.type_to = r.type_from;
r.polygon = true;
r.zoom_from = atoi(tokens[i++].c_str());
r.zoom_to = atoi(tokens[i++].c_str());
std::string tmp = tokens[i++];
if(colourMap[tmp]) {
//Colour is stored +1 so we can store black (0) and find it.
long col = colourMap[tmp]-1;
r.red[0] = col >> 16;
r.green[0] = (col >> 8) & 0xFF;
r.blue[0] = (col & 0xFF);
} else {
if(!sscanf(tmp.c_str(), "%i", &r.red[0])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.green[0])) continue;
if(!sscanf(tokens[i++].c_str(), "%i", &r.blue[0])) continue;
}
r.width[0] = -1;
r.red[1] = -1;
drawing_rules.push_back(r);
}
}
fclose(fp);
return true;
}
/* Static helper function */
void DrawingRules::tokenise(const std::string &input, std::vector<std::string> &output)
{
const char *s = input.c_str();
char* buffer = new char[strlen( s ) + 1];
strcpy( buffer, s );
const char *p = strtok(buffer, " ");
while(p) {
output.push_back(p);
p = strtok(NULL, " ");
}
delete buffer;
}
/* A recursive index class into the quadtile way database. */
class qindex {
public:
static qindex *load(FILE *fp);
long get_index(quadtile q, int _level, int *_nways=NULL);
int max_safe_zoom;
private:
qindex(){level = -1;};
qindex *child[4];
long long q, qmask;
long offset;
int nways;
int level;
};
//Static function to load the index from the start of the DB
qindex *qindex::load(FILE *fp)
{
Log(LOG_DEBUG, "Load index\n");
if(!fp) return false;
char tmp[100];
if(!fgets(tmp, 100, fp)) return false;
if(strncmp(tmp, DB_VERSION, strlen(DB_VERSION))) {
Log(LOG_ERROR, "Not a DB file, or wrong version\n");
return false;
}
char *s=strstr(tmp, "depth=");
int max_safe_zoom;
if(s) max_safe_zoom = atoi(s+6);
else {
Log(LOG_ERROR, "Can't read maximum safe zoom\n");
return false;
}
unsigned char buf[8];
memset(buf, 0, 8);
if(fread(buf+5, 3, 1, fp)!=1) {
Log(LOG_ERROR, "Failed to read index file\n");
return NULL;
}
int nidx = (int) buf2ll(buf);
Log(LOG_DEBUG, "Load %d index items\n", nidx);
qindex *result;
result = new qindex[nidx];
result->max_safe_zoom = max_safe_zoom;
result[0].level = 0;
result[0].qmask = 0x3FFFFFFFFFFFFFFFLL;
for(int i=0; i<nidx;i++) {
result[i].max_safe_zoom = max_safe_zoom;
if(result[i].level==-1) {
Log(LOG_ERROR, "Inconsistent index file - orphaned child\n");
delete result;
return NULL;
}
unsigned char buf[28];
if(fread(buf, 28, 1, fp)!=1) {
Log(LOG_ERROR, "Failed read of index file\n");
delete result;
return NULL;
}
result[i].q = buf2ll(buf);
result[i].offset = (buf[8] << 24) |
(buf[9] << 16) |
(buf[10]<< 8) |
buf[11];
result[i].nways = (buf[12] << 24) |
(buf[13] << 16) |
(buf[14]<< 8) |
buf[15];
//nways = buf[12];
for(int j=0;j<4;j++) {
long child_offset = (buf[16+j*3] << 16) |
(buf[17+j*3] << 8) |
buf[18+j*3];
if(child_offset>=0xFFFFFE) result[i].child[j]=NULL;
else {
result[i].child[j] = result + child_offset;
if(child_offset > nidx) {
Log(LOG_ERROR, "Inconsistent index file - child too big %x %d\n", (int)child_offset, i);
delete result;
return NULL;
}
result[i].child[j]->level = result[i].level+1;
result[i].child[j]->qmask = result[i].qmask >> 2;
}
}
}
return result;
}
//Get the offset into the DB file where we can read the first way from
//quadtile _q (masked with level - ie. the first way in the same level
//_level map tile as _q
long qindex::get_index(quadtile _q, int _level, int *_nways)
{
if(_level > max_safe_zoom) _level = max_safe_zoom;
if((_q & (~qmask))!=q) return(-1); //We don't contain _q
//We contain _q.
if(_level==level) {
//If we are the same level as the request, we have the answer.
*_nways = nways;
return offset;
}
//See whether our children have the answer
long result=-1;
for(int i=0;i<4;i++) {
if(child[i]) result = child[i]->get_index(_q, _level, _nways);
if(result!=-1) return result;
}
//If execution reaches here, _q/_level refers to a tile within us
//which none of our children claim - ie. an empty section of this tile.
*_nways = 0;
return 0;
}
TileWriter::TileWriter( QString dir )
: dr(fileInDirectory( dir, "rendering.qrr" ).toLocal8Bit().constData() )
{
img = new ImgWriter;
filename[0] = fileInDirectory( dir, "ways.all.pqdb" ).toLocal8Bit().constData();
filename[1] = fileInDirectory( dir, "ways.motorway.pqdb" ).toLocal8Bit().constData();
filename[2] = fileInDirectory( dir, "places.pqdb" ).toLocal8Bit().constData();
for(int i=0;i<3;i++) {
db[i] = fopen(filename[i].c_str(), "rb");
qidx[i] = qindex::load(db[i]);
printf("Opening %s\n", filename[i].c_str());
}
}
/*Static function. Way types that are drawn similarly (eg.
HIGHWAY_RESIDENTIAL / HIGHWAY_LIVING_STREET) should have their first passes
drawn together then second passes to make the pics look right. */
bool TileWriter::need_next_pass(int type1, int type2)
{
if(type1==type2) return false;
if(type1 > HW_UNSURFACED && type1<HW_SECONDARY &&
type2 > HW_UNSURFACED && type2<HW_SECONDARY) return false;
return true;
}
//For tile x/y/zoom use the index to seek to the relavent part of the db file,
//and return in nways the number of ways needed to load. Factored out from
//draw_image() as it's also needed for place names.
bool TileWriter::query_index(int x, int y, int zoom, int cur_db, int *nways) const
{
if(!db[cur_db]) return false;
//Work out which quadtile to load.
long z = 1UL << zoom;
double xf = ((double)x)/z;
double yf = ((double)y)/z;
quadtile qmask, q;
qmask = 0x3FFFFFFFFFFFFFFFLL >> ((zoom>qidx[cur_db]->max_safe_zoom ? qidx[cur_db]->max_safe_zoom : zoom)*2);
//binary_printf(qmask); binary_printf(q);
q = xy2q(xf, yf);
Log(LOG_VERBOSE, "Finding seek point\n");
//Seek to the relevant point in the db.
long offset = qidx[cur_db]->get_index(q & ~qmask, zoom, nways);
if(*nways==0) return true;
if(offset==-1 || fseek(db[cur_db], offset, SEEK_SET)==-1) {
Log(LOG_ERROR, "Failed to find index\n");
return false;
}
return true;
}
//The main entry point into the class. Draw the map tile described by x, y
//and zoom, and save it into _imgname if it is not an empty string. The tile
//is held in memory and the raw image data can be accessed by get_img_data()
bool TileWriter::draw_image(QString _imgname, int x, int y, int zoom, int magnification)
{
TIMELOGINIT("Draw_image");
//FILE *fp = fopen(filename.c_str(), "rb");
int current_db = zoom>12 ? 0 : 1;
Log(LOG_DEBUG, "Write %s, %d, %d, %d\n", _imgname.toUtf8().constData(), x, y, zoom);
int nways;
if(!query_index(x, y, zoom, current_db, &nways)) return false;
//Initialise the image.
Log(LOG_VERBOSE, "Initialising image with %d ways\n", nways);
img->NewImage(256 * magnification, 256 * magnification, _imgname.toLocal8Bit().constData() );
img->SetBG(242, 238, 232);
TIMELOG("Image initialisation");
//load the ways.
Way::new_tile();
Log(LOG_VERBOSE, "Loading ways\n");
Way s;
typedef std::vector<Way> WayList;
WayList waylist;
for(int i=0; i<nways;i++) {
Way s;
if(!s.init(db[current_db])) continue;
waylist.push_back(s);
}
TIMELOG("Loading ways");
if(waylist.size()==0) { //We de-reference waylist.begin() later.
Log(LOG_VERBOSE, "Empty tile\n");
if(_imgname.size()) img->Save();
return true;
}
//Sort by way-type, with least important roads first. This stops minor roads
//intruding on the colour of major roads that they join.
Log(LOG_VERBOSE, "Sorting ways\n");
std::sort(waylist.begin(), waylist.end(), Way::sort_by_type);
TIMELOG("Sorting ways");
unsigned long itilex = x << (31-zoom), itiley = y << (31-zoom);
//This is a pain. We have to do both passes of one type before moving on to
//the next type.
Log(LOG_VERBOSE, "Drawing ways\n");
int current_type = waylist.begin()->type;
std::vector<Way>::iterator cur_type_start, i, j;
cur_type_start = waylist.begin();
for(i=waylist.begin(); i!=waylist.end(); i++) {
if(need_next_pass(i->type, current_type)) { //Do the second pass.
for(j=cur_type_start; j!=i; j++)
if(!j->draw(*img, dr, itilex, itiley, zoom, magnification, 1)) break;
current_type = i->type;
cur_type_start = i;
}
i->draw(*img, dr, itilex, itiley, zoom, magnification, 0);
}
//Do second pass for the last type.
for(j=cur_type_start; j!=waylist.end(); j++)
if(!j->draw(*img, dr, itilex, itiley, zoom, magnification, 1)) break;
TIMELOG("Drawing");
Log(LOG_VERBOSE, "Saving img\n");
if(_imgname.size()) img->Save();
Log(LOG_VERBOSE, "Done\n");
TIMELOG("Saving");
//for(i=waylist.begin();i!=waylist.end();i++) delete *i;
TIMELOG("Cleanup");
Log(LOG_VERBOSE, "Drew %d/%d ways\n", g_ndrawnways, g_nways);
emit image_finished( x, y, zoom, magnification, QByteArray( ( const char* ) img->get_img_data(), 256 * magnification * 256 * magnification * 3 ) );
return true;
}
//x,y,zoom refer to an osm map tile. Return all placenames within this
//tile. The data will be drawn at actualzoom, so adjust tilex/tiley and
//select which places to draw based on this.
void TileWriter::get_placenames(int x, int y, int zoom, int actualzoom,
std::vector<struct placename> &result) const
{
int placenamedb = 2;
int nways;
if(!query_index(x, y, zoom, placenamedb, &nways)) return;
char buf[256];
unsigned char ubuf[10];
for(int i=0; i<nways;i++) {
if(fread(ubuf, 10, 1, db[placenamedb])!=1) return;
struct placename p;
p.type = ubuf[9];
int namelen = ubuf[8];
quadtile q = buf2ll(ubuf);
quadtile x, y;
demux(q, &x, &y);
p.tilex = (double) x / (double) (1ULL<<(31-actualzoom));
p.tiley = (double) y / (double) (1ULL<<(31-actualzoom));
if(fread(buf, namelen, 1, db[placenamedb])!=1) return;
buf[namelen]=0;
if(p.type>=5 && actualzoom<13) continue; //ignore hamlets
if(p.type>=4 && actualzoom<12) continue; //and suburbs
if(p.type>=3 && actualzoom<13) continue; //and stations
if(p.type>=2 && actualzoom<12) continue; //and villages
if(p.type>=1 && actualzoom<9) continue; //and towns
p.name = std::string(buf);
result.push_back(p);
}
}
//Stuff for ease of profiling
//Compile with:
// g++ -DPROFILELOGGING -DTILE_WRITE_MAIN -O3 -pg -o tile-write tile-write.cpp -lagg
//
// expects data files in current dir. Either run with no args to time
// building the compiled in area, 1 arg for building the whole area without any
// time spent saving/converting image formats, or with 3 args of x, y, z (to display
// tile) or 4 args: x,y,z,i to draw the tile i times for profiling.
#ifdef TILE_WRITE_MAIN
#include <math.h>
#include <stdlib.h>
#include <sys/time.h>
void get_tile(double lat, double lon, int zoom, int *x, int *y)
{
double mlat = (( 1-log(tan(lat*M_PI/180) + (1/cos(lat*M_PI/180)))/M_PI)/2);
double mlon = (lon+180.0)/360.0;
*x = mlon * pow(2, zoom);
*y = mlat * pow(2, zoom);
}
int main(int argc, char *argv[])
{
TileWriter t("./");
struct timeval tv1, tv2;
long totalmsecs[18] = {0};
int maxmsecs[18] = {0}, ntiles[18] = {0};
int total_tiles=0, max_tiles=10000000, i;
if(argc==1 || argc==2) {
char buf[1024];
for(int z=5; z<=16; z++) {
sprintf(buf, "mkdir %d >/dev/null 2>&1", z); i=system(buf);
int x1, y1, x2, y2;
//get_tile(58, -6, z, &x1, &y1);
//get_tile(50, 2, z, &x2, &y2);
get_tile(51.6, -0.4, z, &x1, &y1);
get_tile(51.2, 0.1, z, &x2, &y2);
for(int x=x1; x<=x2; x++) {
sprintf(buf, "mkdir %d/%d >/dev/null 2>&1", z, x); i=system(buf);
for(int y=y1; y<=y2; y++) {
sprintf(buf, "%d/%d/%d.png", z, x, y);
printf("%s\n", buf);
gettimeofday(&tv1, 0);
t.draw_image(argc==1 ? buf : "", x, y, z, 1);
gettimeofday(&tv2, 0);
int msecs = (tv2.tv_sec-tv1.tv_sec)*1000 + (tv2.tv_usec - tv1.tv_usec)/1000;
if(msecs > maxmsecs[z]) maxmsecs[z] = msecs;
totalmsecs[z] += msecs;
ntiles[z] ++;
if(++total_tiles > max_tiles) goto stats;
}
}
}
goto stats;
} else {
int x = atoi(argv[2]);
int y = atoi(argv[3]);
int z = atoi(argv[1]);
if(argc==4) {
t.draw_image("test.png", x, y, z, 1);
int i = system("eog test.png");
} else {
int count = atoi(argv[4]);
for(int i=0;i<count;i++) {
t.draw_image("", x, y, z, 1);
}
}
}
return 0;
stats:
for(int z=0;z<18;z++) {
if(!ntiles[z]) continue;
printf(" Zoom lvl: %2d, n =%5d, total = %5ldms, avg = %3ldms, max = %3dms\n",
z, ntiles[z], totalmsecs[z], totalmsecs[z]/ntiles[z], maxmsecs[z]);
}
return 0;
}
#endif /* TILE_WRITE_MAIN */
|