mirror of
https://github.com/mapbox/tippecanoe.git
synced 2025-01-22 12:28:03 +00:00
611 lines
16 KiB
C++
611 lines
16 KiB
C++
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
#include <sqlite3.h>
|
|
#include <limits.h>
|
|
#include <vector>
|
|
#include <string>
|
|
#include <map>
|
|
#include <zlib.h>
|
|
#include <math.h>
|
|
#include "vector_tile.pb.h"
|
|
#include "tile.h"
|
|
|
|
extern "C" {
|
|
#include "projection.h"
|
|
#include "pool.h"
|
|
#include "mbtiles.h"
|
|
}
|
|
|
|
std::string dequote(std::string s);
|
|
|
|
struct stats {
|
|
int minzoom;
|
|
int maxzoom;
|
|
double midlat, midlon;
|
|
double minlat, minlon, maxlat, maxlon;
|
|
};
|
|
|
|
// https://github.com/mapbox/mapnik-vector-tile/blob/master/src/vector_tile_compression.hpp
|
|
inline bool is_compressed(std::string const &data) {
|
|
return data.size() > 2 && (((uint8_t) data[0] == 0x78 && (uint8_t) data[1] == 0x9C) || ((uint8_t) data[0] == 0x1F && (uint8_t) data[1] == 0x8B));
|
|
}
|
|
|
|
// https://github.com/mapbox/mapnik-vector-tile/blob/master/src/vector_tile_compression.hpp
|
|
inline int decompress(std::string const &input, std::string &output) {
|
|
z_stream inflate_s;
|
|
inflate_s.zalloc = Z_NULL;
|
|
inflate_s.zfree = Z_NULL;
|
|
inflate_s.opaque = Z_NULL;
|
|
inflate_s.avail_in = 0;
|
|
inflate_s.next_in = Z_NULL;
|
|
if (inflateInit2(&inflate_s, 32 + 15) != Z_OK) {
|
|
fprintf(stderr, "error: %s\n", inflate_s.msg);
|
|
}
|
|
inflate_s.next_in = (Bytef *) input.data();
|
|
inflate_s.avail_in = input.size();
|
|
size_t length = 0;
|
|
do {
|
|
output.resize(length + 2 * input.size());
|
|
inflate_s.avail_out = 2 * input.size();
|
|
inflate_s.next_out = (Bytef *) (output.data() + length);
|
|
int ret = inflate(&inflate_s, Z_FINISH);
|
|
if (ret != Z_STREAM_END && ret != Z_OK && ret != Z_BUF_ERROR) {
|
|
fprintf(stderr, "error: %s\n", inflate_s.msg);
|
|
return 0;
|
|
}
|
|
|
|
length += (2 * input.size() - inflate_s.avail_out);
|
|
} while (inflate_s.avail_out == 0);
|
|
inflateEnd(&inflate_s);
|
|
output.resize(length);
|
|
return 1;
|
|
}
|
|
|
|
// https://github.com/mapbox/mapnik-vector-tile/blob/master/src/vector_tile_compression.hpp
|
|
static inline int compress(std::string const &input, std::string &output) {
|
|
z_stream deflate_s;
|
|
deflate_s.zalloc = Z_NULL;
|
|
deflate_s.zfree = Z_NULL;
|
|
deflate_s.opaque = Z_NULL;
|
|
deflate_s.avail_in = 0;
|
|
deflate_s.next_in = Z_NULL;
|
|
deflateInit2(&deflate_s, Z_BEST_COMPRESSION, Z_DEFLATED, 31, 8, Z_DEFAULT_STRATEGY);
|
|
deflate_s.next_in = (Bytef *) input.data();
|
|
deflate_s.avail_in = input.size();
|
|
size_t length = 0;
|
|
do {
|
|
size_t increase = input.size() / 2 + 1024;
|
|
output.resize(length + increase);
|
|
deflate_s.avail_out = increase;
|
|
deflate_s.next_out = (Bytef *) (output.data() + length);
|
|
int ret = deflate(&deflate_s, Z_FINISH);
|
|
if (ret != Z_STREAM_END && ret != Z_OK && ret != Z_BUF_ERROR) {
|
|
return -1;
|
|
}
|
|
length += (increase - deflate_s.avail_out);
|
|
} while (deflate_s.avail_out == 0);
|
|
deflateEnd(&deflate_s);
|
|
output.resize(length);
|
|
return 0;
|
|
}
|
|
|
|
void handle(std::string message, int z, unsigned x, unsigned y, struct pool **file_keys, char ***layernames, int *nlayers, sqlite3 *outdb, std::vector<std::string> &header, std::map<std::string, std::vector<std::string> > &mapping, struct pool *exclude, int ifmatched) {
|
|
GOOGLE_PROTOBUF_VERIFY_VERSION;
|
|
|
|
// https://github.com/mapbox/mapnik-vector-tile/blob/master/examples/c%2B%2B/tileinfo.cpp
|
|
mapnik::vector::tile tile;
|
|
mapnik::vector::tile outtile;
|
|
int features_added = 0;
|
|
|
|
if (is_compressed(message)) {
|
|
std::string uncompressed;
|
|
decompress(message, uncompressed);
|
|
if (!tile.ParseFromString(uncompressed)) {
|
|
fprintf(stderr, "Couldn't decompress tile %d/%u/%u\n", z, x, y);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
} else if (!tile.ParseFromString(message)) {
|
|
fprintf(stderr, "Couldn't parse tile %d/%u/%u\n", z, x, y);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
for (int l = 0; l < tile.layers_size(); l++) {
|
|
mapnik::vector::tile_layer layer = tile.layers(l);
|
|
mapnik::vector::tile_layer *outlayer = outtile.add_layers();
|
|
|
|
outlayer->set_name(layer.name());
|
|
outlayer->set_version(layer.version());
|
|
outlayer->set_extent(layer.extent());
|
|
|
|
const char *ln = layer.name().c_str();
|
|
|
|
int ll;
|
|
for (ll = 0; ll < *nlayers; ll++) {
|
|
if (strcmp((*layernames)[ll], ln) == 0) {
|
|
break;
|
|
}
|
|
}
|
|
if (ll == *nlayers) {
|
|
*file_keys = (struct pool *) realloc(*file_keys, (ll + 1) * sizeof(struct pool));
|
|
*layernames = (char **) realloc(*layernames, (ll + 1) * sizeof(char *));
|
|
|
|
if (*file_keys == NULL) {
|
|
perror("realloc file_keys");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
if (*layernames == NULL) {
|
|
perror("realloc layernames");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
pool_init(&((*file_keys)[ll]), 0);
|
|
(*layernames)[ll] = strdup(ln);
|
|
if ((*layernames)[ll] == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
*nlayers = ll + 1;
|
|
}
|
|
|
|
struct pool keys, values;
|
|
pool_init(&keys, 0);
|
|
pool_init(&values, 0);
|
|
|
|
for (int f = 0; f < layer.features_size(); f++) {
|
|
mapnik::vector::tile_feature feat = layer.features(f);
|
|
std::vector<int> feature_tags;
|
|
int matched = 0;
|
|
|
|
for (int t = 0; t + 1 < feat.tags_size(); t += 2) {
|
|
const char *key = layer.keys(feat.tags(t)).c_str();
|
|
mapnik::vector::tile_value const &val = layer.values(feat.tags(t + 1));
|
|
char *value;
|
|
int type = -1;
|
|
|
|
if (val.has_string_value()) {
|
|
value = strdup(val.string_value().c_str());
|
|
if (value == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
type = VT_STRING;
|
|
} else if (val.has_int_value()) {
|
|
if (asprintf(&value, "%lld", (long long) val.int_value()) >= 0) {
|
|
type = VT_NUMBER;
|
|
}
|
|
} else if (val.has_double_value()) {
|
|
if (asprintf(&value, "%g", val.double_value()) >= 0) {
|
|
type = VT_NUMBER;
|
|
}
|
|
} else if (val.has_float_value()) {
|
|
if (asprintf(&value, "%g", val.float_value()) >= 0) {
|
|
type = VT_NUMBER;
|
|
}
|
|
} else if (val.has_bool_value()) {
|
|
if (asprintf(&value, "%s", val.bool_value() ? "true" : "false") >= 0) {
|
|
type = VT_BOOLEAN;
|
|
}
|
|
} else if (val.has_sint_value()) {
|
|
if (asprintf(&value, "%lld", (long long) val.sint_value()) >= 0) {
|
|
type = VT_NUMBER;
|
|
}
|
|
} else if (val.has_uint_value()) {
|
|
if (asprintf(&value, "%llu", (long long) val.uint_value()) >= 0) {
|
|
type = VT_NUMBER;
|
|
}
|
|
} else {
|
|
continue;
|
|
}
|
|
|
|
if (type < 0) {
|
|
continue;
|
|
}
|
|
|
|
if (!is_pooled(exclude, key, VT_STRING)) {
|
|
if (!is_pooled(&((*file_keys)[ll]), key, type)) {
|
|
char *copy = strdup(key);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
pool(&((*file_keys)[ll]), copy, type);
|
|
}
|
|
|
|
struct pool_val *k, *v;
|
|
|
|
if (is_pooled(&keys, key, VT_STRING)) {
|
|
k = pool(&keys, key, VT_STRING);
|
|
} else {
|
|
char *copy = strdup(key);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
k = pool(&keys, copy, VT_STRING);
|
|
}
|
|
|
|
if (is_pooled(&values, value, type)) {
|
|
v = pool(&values, value, type);
|
|
} else {
|
|
char *copy = strdup(value);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
v = pool(&values, copy, type);
|
|
}
|
|
|
|
feature_tags.push_back(k->n);
|
|
feature_tags.push_back(v->n);
|
|
}
|
|
|
|
if (header.size() > 0 && strcmp(key, header[0].c_str()) == 0) {
|
|
std::map<std::string, std::vector<std::string> >::iterator ii = mapping.find(std::string(value));
|
|
|
|
if (ii != mapping.end()) {
|
|
std::vector<std::string> fields = ii->second;
|
|
matched = 1;
|
|
|
|
for (size_t i = 1; i < fields.size(); i++) {
|
|
std::string joinkey = header[i];
|
|
std::string joinval = fields[i];
|
|
int type = VT_STRING;
|
|
|
|
if (joinval.size() > 0) {
|
|
if (joinval[0] == '"') {
|
|
joinval = dequote(joinval);
|
|
} else if ((joinval[0] >= '0' && joinval[0] <= '9') || joinval[0] == '-') {
|
|
type = VT_NUMBER;
|
|
}
|
|
}
|
|
|
|
const char *sjoinkey = joinkey.c_str();
|
|
const char *sjoinval = joinval.c_str();
|
|
|
|
if (!is_pooled(exclude, sjoinkey, VT_STRING)) {
|
|
if (!is_pooled(&((*file_keys)[ll]), sjoinkey, type)) {
|
|
char *copy = strdup(sjoinkey);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
pool(&((*file_keys)[ll]), copy, type);
|
|
}
|
|
|
|
struct pool_val *k, *v;
|
|
|
|
if (is_pooled(&keys, sjoinkey, VT_STRING)) {
|
|
k = pool(&keys, sjoinkey, VT_STRING);
|
|
} else {
|
|
char *copy = strdup(sjoinkey);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
k = pool(&keys, copy, VT_STRING);
|
|
}
|
|
|
|
if (is_pooled(&values, sjoinval, type)) {
|
|
v = pool(&values, sjoinval, type);
|
|
} else {
|
|
char *copy = strdup(sjoinval);
|
|
if (copy == NULL) {
|
|
perror("Out of memory");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
v = pool(&values, copy, type);
|
|
}
|
|
|
|
feature_tags.push_back(k->n);
|
|
feature_tags.push_back(v->n);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
free(value);
|
|
}
|
|
|
|
if (matched || !ifmatched) {
|
|
mapnik::vector::tile_feature *outfeature = outlayer->add_features();
|
|
outfeature->set_type(feat.type());
|
|
|
|
for (int g = 0; g < feat.geometry_size(); g++) {
|
|
outfeature->add_geometry(feat.geometry(g));
|
|
}
|
|
|
|
for (size_t i = 0; i < feature_tags.size(); i++) {
|
|
outfeature->add_tags(feature_tags[i]);
|
|
}
|
|
|
|
features_added++;
|
|
}
|
|
}
|
|
|
|
struct pool_val *pv;
|
|
for (pv = keys.head; pv != NULL; pv = pv->next) {
|
|
outlayer->add_keys(pv->s, strlen(pv->s));
|
|
}
|
|
for (pv = values.head; pv != NULL; pv = pv->next) {
|
|
mapnik::vector::tile_value *tv = outlayer->add_values();
|
|
|
|
if (pv->type == VT_NUMBER) {
|
|
tv->set_double_value(atof(pv->s));
|
|
} else if (pv->type == VT_BOOLEAN) {
|
|
tv->set_bool_value(pv->s[0] == 't');
|
|
} else {
|
|
tv->set_string_value(pv->s);
|
|
}
|
|
}
|
|
|
|
pool_free_strings(&keys);
|
|
pool_free_strings(&values);
|
|
}
|
|
|
|
if (features_added == 0) {
|
|
return;
|
|
}
|
|
|
|
std::string s;
|
|
std::string compressed;
|
|
|
|
outtile.SerializeToString(&s);
|
|
compress(s, compressed);
|
|
|
|
if (compressed.size() > 500000) {
|
|
fprintf(stderr, "Tile %d/%u/%u size is %lld, >500000. Skipping this tile\n.", z, x, y, (long long) compressed.size());
|
|
return;
|
|
}
|
|
|
|
mbtiles_write_tile(outdb, z, x, y, compressed.data(), compressed.size());
|
|
}
|
|
|
|
double min(double a, double b) {
|
|
if (a < b) {
|
|
return a;
|
|
} else {
|
|
return b;
|
|
}
|
|
}
|
|
|
|
double max(double a, double b) {
|
|
if (a > b) {
|
|
return a;
|
|
} else {
|
|
return b;
|
|
}
|
|
}
|
|
|
|
void decode(char *fname, char *map, struct pool **file_keys, char ***layernames, int *nlayers, sqlite3 *outdb, struct stats *st, std::vector<std::string> &header, std::map<std::string, std::vector<std::string> > &mapping, struct pool *exclude, int ifmatched) {
|
|
sqlite3 *db;
|
|
|
|
if (sqlite3_open(fname, &db) != SQLITE_OK) {
|
|
fprintf(stderr, "%s: %s\n", fname, sqlite3_errmsg(db));
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
const char *sql = "SELECT zoom_level, tile_column, tile_row, tile_data from tiles;";
|
|
sqlite3_stmt *stmt;
|
|
if (sqlite3_prepare_v2(db, sql, -1, &stmt, NULL) != SQLITE_OK) {
|
|
fprintf(stderr, "%s: select failed: %s\n", fname, sqlite3_errmsg(db));
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
while (sqlite3_step(stmt) == SQLITE_ROW) {
|
|
long long zoom = sqlite3_column_int(stmt, 0);
|
|
long long x = sqlite3_column_int(stmt, 1);
|
|
long long y = sqlite3_column_int(stmt, 2);
|
|
y = (1LL << zoom) - 1 - y;
|
|
|
|
int len = sqlite3_column_bytes(stmt, 3);
|
|
const char *s = (const char *) sqlite3_column_blob(stmt, 3);
|
|
|
|
fprintf(stderr, "%lld/%lld/%lld \r", zoom, x, y);
|
|
|
|
handle(std::string(s, len), zoom, x, y, file_keys, layernames, nlayers, outdb, header, mapping, exclude, ifmatched);
|
|
}
|
|
|
|
sqlite3_finalize(stmt);
|
|
|
|
if (sqlite3_prepare_v2(db, "SELECT value from metadata where name = 'minzoom'", -1, &stmt, NULL) == SQLITE_OK) {
|
|
if (sqlite3_step(stmt) == SQLITE_ROW) {
|
|
int minzoom = sqlite3_column_int(stmt, 0);
|
|
st->minzoom = min(st->minzoom, minzoom);
|
|
}
|
|
sqlite3_finalize(stmt);
|
|
}
|
|
if (sqlite3_prepare_v2(db, "SELECT value from metadata where name = 'maxzoom'", -1, &stmt, NULL) == SQLITE_OK) {
|
|
if (sqlite3_step(stmt) == SQLITE_ROW) {
|
|
int maxzoom = sqlite3_column_int(stmt, 0);
|
|
st->maxzoom = max(st->maxzoom, maxzoom);
|
|
}
|
|
sqlite3_finalize(stmt);
|
|
}
|
|
if (sqlite3_prepare_v2(db, "SELECT value from metadata where name = 'center'", -1, &stmt, NULL) == SQLITE_OK) {
|
|
if (sqlite3_step(stmt) == SQLITE_ROW) {
|
|
const unsigned char *s = sqlite3_column_text(stmt, 0);
|
|
sscanf((char *) s, "%lf,%lf", &st->midlon, &st->midlat);
|
|
}
|
|
sqlite3_finalize(stmt);
|
|
}
|
|
if (sqlite3_prepare_v2(db, "SELECT value from metadata where name = 'bounds'", -1, &stmt, NULL) == SQLITE_OK) {
|
|
if (sqlite3_step(stmt) == SQLITE_ROW) {
|
|
const unsigned char *s = sqlite3_column_text(stmt, 0);
|
|
double minlon, minlat, maxlon, maxlat;
|
|
sscanf((char *) s, "%lf,%lf,%lf,%lf", &minlon, &minlat, &maxlon, &maxlat);
|
|
st->minlon = min(minlon, st->minlon);
|
|
st->maxlon = max(maxlon, st->maxlon);
|
|
st->minlat = min(minlat, st->minlat);
|
|
st->maxlat = max(maxlat, st->maxlat);
|
|
}
|
|
sqlite3_finalize(stmt);
|
|
}
|
|
|
|
if (sqlite3_close(db) != SQLITE_OK) {
|
|
fprintf(stderr, "%s: could not close database: %s\n", fname, sqlite3_errmsg(db));
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
}
|
|
|
|
void usage(char **argv) {
|
|
fprintf(stderr, "Usage: %s [-f] [-i] [-c joins.csv] [-x exclude ...] -o new.mbtiles source.mbtiles ...\n", argv[0]);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
#define MAXLINE 10000 /* XXX */
|
|
|
|
std::vector<std::string> split(char *s) {
|
|
std::vector<std::string> ret;
|
|
|
|
while (*s && *s != '\n') {
|
|
char *start = s;
|
|
int within = 0;
|
|
|
|
for (; *s && *s != '\n'; s++) {
|
|
if (*s == '"') {
|
|
within = !within;
|
|
}
|
|
|
|
if (*s == ',' && !within) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
std::string v = std::string(start, s - start);
|
|
ret.push_back(v);
|
|
|
|
if (*s == ',') {
|
|
s++;
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
std::string dequote(std::string s) {
|
|
std::string out;
|
|
for (size_t i = 0; i < s.size(); i++) {
|
|
if (s[i] == '"') {
|
|
if (i + 1 < s.size() && s[i + 1] == '"') {
|
|
out.push_back('"');
|
|
}
|
|
} else {
|
|
out.push_back(s[i]);
|
|
}
|
|
}
|
|
return out;
|
|
}
|
|
|
|
void readcsv(char *fn, std::vector<std::string> &header, std::map<std::string, std::vector<std::string> > &mapping) {
|
|
FILE *f = fopen(fn, "r");
|
|
if (f == NULL) {
|
|
perror(fn);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
char s[MAXLINE];
|
|
if (fgets(s, MAXLINE, f)) {
|
|
header = split(s);
|
|
|
|
for (size_t i = 0; i < header.size(); i++) {
|
|
header[i] = dequote(header[i]);
|
|
}
|
|
}
|
|
while (fgets(s, MAXLINE, f)) {
|
|
std::vector<std::string> line = split(s);
|
|
if (line.size() > 0) {
|
|
line[0] = dequote(line[0]);
|
|
}
|
|
|
|
for (size_t i = 0; i < line.size() && i < header.size(); i++) {
|
|
// printf("putting %s\n", line[0].c_str());
|
|
mapping.insert(std::pair<std::string, std::vector<std::string> >(line[0], line));
|
|
}
|
|
}
|
|
|
|
fclose(f);
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
char *outfile = NULL;
|
|
char *csv = NULL;
|
|
int force = 0;
|
|
int ifmatched = 0;
|
|
|
|
std::vector<std::string> header;
|
|
std::map<std::string, std::vector<std::string> > mapping;
|
|
|
|
struct pool exclude;
|
|
pool_init(&exclude, 0);
|
|
|
|
extern int optind;
|
|
extern char *optarg;
|
|
int i;
|
|
|
|
while ((i = getopt(argc, argv, "fo:c:x:i")) != -1) {
|
|
switch (i) {
|
|
case 'o':
|
|
outfile = optarg;
|
|
break;
|
|
|
|
case 'f':
|
|
force = 1;
|
|
break;
|
|
|
|
case 'i':
|
|
ifmatched = 1;
|
|
break;
|
|
|
|
case 'c':
|
|
if (csv != NULL) {
|
|
fprintf(stderr, "Only one -c for now\n");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
csv = optarg;
|
|
readcsv(csv, header, mapping);
|
|
break;
|
|
|
|
case 'x':
|
|
pool(&exclude, optarg, VT_STRING);
|
|
break;
|
|
|
|
default:
|
|
usage(argv);
|
|
}
|
|
}
|
|
|
|
if (argc - optind < 1 || outfile == NULL) {
|
|
usage(argv);
|
|
}
|
|
|
|
if (force) {
|
|
unlink(outfile);
|
|
}
|
|
|
|
sqlite3 *outdb = mbtiles_open(outfile, argv, 0);
|
|
struct stats st;
|
|
memset(&st, 0, sizeof(st));
|
|
st.minzoom = st.minlat = st.minlon = INT_MAX;
|
|
st.maxzoom = st.maxlat = st.maxlon = INT_MIN;
|
|
|
|
struct pool *file_keys = NULL;
|
|
char **layernames = NULL;
|
|
int nlayers = 0;
|
|
|
|
for (i = optind; i < argc; i++) {
|
|
decode(argv[i], csv, &file_keys, &layernames, &nlayers, outdb, &st, header, mapping, &exclude, ifmatched);
|
|
}
|
|
|
|
struct pool *fk[nlayers];
|
|
for (i = 0; i < nlayers; i++) {
|
|
fk[i] = &(file_keys[i]);
|
|
}
|
|
|
|
mbtiles_write_metadata(outdb, outfile, layernames, st.minzoom, st.maxzoom, st.minlat, st.minlon, st.maxlat, st.maxlon, st.midlat, st.midlon, fk, nlayers, 0);
|
|
mbtiles_close(outdb, argv);
|
|
|
|
return 0;
|
|
}
|