tilemaker/src/pbf_processor.cpp at master · cyclemap/tilemaker · GitHub

History

785 lines (666 loc) · 24 KB

Raw

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

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

#include <iostream>

#include "pbf_processor.h"

#include "pbf_reader.h"

#include <boost/asio/thread_pool.hpp>

#include <boost/asio/post.hpp>

#include <unordered_set>

#include "node_store.h"

#include "way_store.h"

#include "osm_lua_processing.h"

#include "mmap_allocator.h"

using namespace std;

const std::string OptionSortTypeThenID = "Sort.Type_then_ID";

const std::string OptionLocationsOnWays = "LocationsOnWays";

std::atomic<uint64_t> blocksProcessed(0), blocksToProcess(0);

// Access is guarded by ioMutex.

// This counter decreases the chattiness of tilemaker's progress updates,

// especially when run in a non-interactive context.

uint64_t phaseProgress = 0;

// Thread-local so that we can re-use buffers during parsing.

thread_local PbfReader::PbfReader reader;

PbfProcessor::PbfProcessor(OSMStore &osmStore)

: osmStore(osmStore), compactWarningIssued(false)

{ }

bool PbfProcessor::ReadNodes(OsmLuaProcessing& output, PbfReader::PrimitiveGroup& pg, const PbfReader::PrimitiveBlock& pb, const SignificantTags& nodeKeys)

{

// ---- Read nodes

std::vector<NodeStore::element_t> nodes;

TagMap tags;

bool isCompactStore = osmStore.isCompactStore();

NodeID lastNodeId = 0;

for (auto& node : pg.nodes()) {

NodeID nodeId = node.id;

if (isCompactStore && lastNodeId != 0 && nodeId != lastNodeId + 1 && !compactWarningIssued.exchange(true)) {

std::lock_guard<std::mutex> lock(ioMutex);

std::cout << "warning: --compact mode enabled, but PBF has gaps in IDs" << std::endl;

std::cout << " to fix: osmium renumber your-file.osm.pbf -o renumbered.osm.pbf" << std::endl;

}

lastNodeId = nodeId;

LatpLon latplon = { int(lat2latp(double(node.lat)/10000000.0)*10000000.0), node.lon };

tags.reset();

// For tagged nodes, call Lua, then save the OutputObject

for (int n = node.tagStart; n < node.tagEnd; n += 2) {

auto keyIndex = pg.translateNodeKeyValue(n);

auto valueIndex = pg.translateNodeKeyValue(n + 1);

const protozero::data_view& key = pb.stringTable[keyIndex];

const protozero::data_view& value = pb.stringTable[valueIndex];

tags.addTag(key, value);

}

bool emitted = false;

if (output.canWriteNodes() && !tags.empty() && nodeKeys.filter(tags)) {

emitted = output.setNode(static_cast<NodeID>(nodeId), latplon, tags);

}

if (emitted || osmStore.usedNodes.test(nodeId))

nodes.push_back(std::make_pair(static_cast<NodeID>(nodeId), latplon));

}

if (nodes.size() > 0) {

osmStore.nodes.insert(nodes);

}

return !pg.nodes().empty();

}

bool PbfProcessor::ReadWays(

OsmLuaProcessing &output,

PbfReader::PrimitiveGroup& pg,

const PbfReader::PrimitiveBlock& pb,

const SignificantTags& wayKeys,

bool locationsOnWays,

uint shard,

uint effectiveShards

) {

// ---- Read ways

if (pg.ways().empty())

return false;

const bool wayStoreRequiresNodes = osmStore.ways.requiresNodes();

std::vector<WayStore::ll_element_t> llWays;

std::vector<std::pair<WayID, std::vector<NodeID>>> nodeWays;

TagMap tags;

LatpLonVec llVec;

std::vector<NodeID> nodeVec;

for (PbfReader::Way pbfWay : pg.ways()) {

tags.reset();

readTags(pbfWay, pb, tags);

if (!osmStore.way_is_used(pbfWay.id) && !wayKeys.filter(tags))

continue;

llVec.clear();

nodeVec.clear();

WayID wayId = static_cast<WayID>(pbfWay.id);

if (wayId >= pow(2,42)) throw std::runtime_error("Way ID negative or too large: "+std::to_string(wayId));

// Assemble nodelist

if (locationsOnWays) {

llVec.reserve(pbfWay.lats.size());

for (int k=0; k<pbfWay.lats.size(); k++) {

int lat = pbfWay.lats[k];

int lon = pbfWay.lons[k];

LatpLon ll = { int(lat2latp(double(lat)/10000000.0)*10000000.0), lon };

llVec.push_back(ll);

}

} else {

llVec.reserve(pbfWay.refs.size());

nodeVec.reserve(pbfWay.refs.size());

bool skipToNext = false;

for (int k=0; k<pbfWay.refs.size(); k++) {

NodeID nodeId = pbfWay.refs[k];

if (k == 0 && effectiveShards > 1 && !osmStore.nodes.contains(shard, nodeId)) {

skipToNext = true;

break;

}

try {

llVec.push_back(osmStore.nodes.at(static_cast<NodeID>(nodeId)));

nodeVec.push_back(nodeId);

} catch (std::out_of_range &err) {

if (osmStore.integrity_enforced()) throw err;

}

if (skipToNext)

continue;

}

if (llVec.empty()) continue;

try {

bool emitted = output.canWriteWays() && output.setWay(static_cast<WayID>(pbfWay.id), llVec, tags);

// If we need it for later, store the way's coordinates in the global way store

if (emitted || osmStore.way_is_used(wayId)) {

if (wayStoreRequiresNodes)

nodeWays.push_back(std::make_pair(wayId, nodeVec));

else

llWays.push_back(std::make_pair(wayId, WayStore::latplon_vector_t(llVec.begin(), llVec.end())));

}

} catch (std::out_of_range &err) {

// Way is missing a node?

cerr << endl << err.what() << endl;

}

if (wayStoreRequiresNodes) {

osmStore.ways.shard(shard).insertNodes(nodeWays);

} else {

osmStore.ways.shard(shard).insertLatpLons(llWays);

}

return true;

}

bool PbfProcessor::ScanWays(OsmLuaProcessing& output, PbfReader::PrimitiveGroup& pg, const PbfReader::PrimitiveBlock& pb, const SignificantTags& wayKeys) {

// Scan ways to see which nodes we need to save.

// This phase only runs if the Lua script has declared a `way_keys` variable.

if (pg.ways().empty())

return false;

TagMap tags;

// Note: unlike ScanRelations, we don't call into Lua. Instead, we statically inspect

// the tags on each way to decide if it will be emitted.

for (auto& way : pg.ways()) {

tags.reset();

readTags(way, pb, tags);

if (osmStore.way_is_used(way.id) || wayKeys.filter(tags)) {

for (const auto id : way.refs) {

osmStore.usedNodes.set(id);

}

return true;

}

bool PbfProcessor::ScanRelations(OsmLuaProcessing& output, PbfReader::PrimitiveGroup& pg, const PbfReader::PrimitiveBlock& pb, const SignificantTags& wayKeys) {

// Scan relations to see which ways we need to save

if (pg.relations().empty())

return false;

TagMap tags;

int typeKey = findStringPosition(pb, "type");

int mpKey = findStringPosition(pb, "multipolygon");

for (PbfReader::Relation pbfRelation : pg.relations()) {

bool isMultiPolygon = relationIsType(pbfRelation, typeKey, mpKey);

bool isAccepted = false;

WayID relid = static_cast<WayID>(pbfRelation.id);

tags.reset();

readTags(pbfRelation, pb, tags);

if (!isMultiPolygon) {

if (output.canReadRelations()) {

isAccepted = output.scanRelation(relid, tags);

}

if (!isAccepted) continue;

} else {

if (!wayKeys.filter(tags))

continue;

}

osmStore.usedRelations.set(relid);

for (int n=0; n < pbfRelation.memids.size(); n++) {

uint64_t lastID = pbfRelation.memids[n];

if (pbfRelation.types[n] == PbfReader::Relation::MemberType::NODE) {

if (isAccepted) {

const auto& roleView = pb.stringTable[pbfRelation.roles_sid[n]];

std::string role(roleView.data(), roleView.size());

osmStore.scannedRelations.relation_contains_node(relid, lastID, role);

if (osmStore.usedNodes.enabled())

osmStore.usedNodes.set(lastID);

}

} else if (pbfRelation.types[n] == PbfReader::Relation::MemberType::RELATION) {

if (isAccepted) {

const auto& roleView = pb.stringTable[pbfRelation.roles_sid[n]];

std::string role(roleView.data(), roleView.size());

osmStore.scannedRelations.relation_contains_relation(relid, lastID, role);

}

} else if (pbfRelation.types[n] == PbfReader::Relation::MemberType::WAY) {

if (lastID >= pow(2,42)) throw std::runtime_error("Way ID in relation "+std::to_string(relid)+" negative or too large: "+std::to_string(lastID));

osmStore.mark_way_used(static_cast<WayID>(lastID));

if (isAccepted) {

const auto& roleView = pb.stringTable[pbfRelation.roles_sid[n]];

std::string role(roleView.data(), roleView.size());

osmStore.scannedRelations.relation_contains_way(relid, lastID, role);

}

return true;

}

bool PbfProcessor::ReadRelations(

OsmLuaProcessing& output,

PbfReader::PrimitiveGroup& pg,

const PbfReader::PrimitiveBlock& pb,

const BlockMetadata& blockMetadata,

const SignificantTags& wayKeys,

uint shard,

uint effectiveShards

) {

// ---- Read relations

if (pg.relations().empty())

return false;

TagMap tags;

std::vector<RelationStore::element_t> relations;

int typeKey = findStringPosition(pb, "type");

int mpKey = findStringPosition(pb, "multipolygon");

int boundaryKey = findStringPosition(pb, "boundary");

int innerKey= findStringPosition(pb, "inner");

int outerKey= findStringPosition(pb, "outer");

if (typeKey >-1) {

int j = -1;

for (PbfReader::Relation pbfRelation : pg.relations()) {

j++;

if (j % blockMetadata.chunks != blockMetadata.chunk)

continue;

bool isMultiPolygon = relationIsType(pbfRelation, typeKey, mpKey);

bool isBoundary = relationIsType(pbfRelation, typeKey, boundaryKey);

if (!isMultiPolygon && !isBoundary && !output.canWriteRelations()) continue;

// Read relation members

WayVec outerWayVec, innerWayVec;

bool isInnerOuter = isBoundary || isMultiPolygon;

bool skipToNext = false;

bool firstWay = true;

for (int n = 0; n < pbfRelation.memids.size(); n++) {

uint64_t lastID = pbfRelation.memids[n];

if (pbfRelation.types[n] != PbfReader::Relation::MemberType::WAY) { continue; }

int32_t role = pbfRelation.roles_sid[n];

if (role==innerKey || role==outerKey) isInnerOuter=true;

WayID wayId = static_cast<WayID>(lastID);

if (firstWay && effectiveShards > 1 && !osmStore.ways.contains(shard, wayId)) {

skipToNext = true;

break;

}

if (firstWay)

firstWay = false;

(role == innerKey ? innerWayVec : outerWayVec).push_back(wayId);

}

if (skipToNext)

continue;

try {

tags.reset();

std::deque<protozero::data_view> dataviews;

if (osmStore.scannedRelations.has_relation_tags(pbfRelation.id)) {

const auto& scannedTags = osmStore.scannedRelations.relation_tags(pbfRelation.id);

for (const auto& entry : scannedTags) {

dataviews.push_back({entry.first.data(), entry.first.size()});

const auto& key = dataviews.back();

dataviews.push_back({entry.second.data(), entry.second.size()});

const auto& value = dataviews.back();

tags.addTag(key, value);

}

} else {

readTags(pbfRelation, pb, tags);

}

if (osmStore.usedRelations.test(pbfRelation.id) || wayKeys.filter(tags))

output.setRelation(pb.stringTable, pbfRelation, outerWayVec, innerWayVec, tags, isMultiPolygon, isInnerOuter);

} catch (std::out_of_range &err) {

// Relation is missing a member?

cerr << endl << err.what() << endl;

}

osmStore.relations_insert_front(relations);

return true;

}

// Returns true when block was completely handled, thus could be omited by another phases.

bool PbfProcessor::ReadBlock(

std::istream& infile,

OsmLuaProcessing& output,

const BlockMetadata& blockMetadata,

const SignificantTags& nodeKeys,

const SignificantTags& wayKeys,

bool locationsOnWays,

ReadPhase phase,

uint shard,

uint effectiveShards

)

{

infile.seekg(blockMetadata.offset);

protozero::data_view blob = reader.readBlob(blockMetadata.length, infile);

PbfReader::PrimitiveBlock& pb = reader.readPrimitiveBlock(blob);

if (infile.eof()) {

return true;

}

// Keep count of groups read during this phase.

std::size_t read_groups = 0;

int primitiveGroupSize = 0;

for (auto& pg : pb.groups()) {

primitiveGroupSize++;

auto output_progress = [&]()

{

if (ioMutex.try_lock()) {

// If we're interactive, show an update for each block.

// If we're not interactive, show an update for each 1% of blocks.

uint64_t blockProgress = blocksProcessed.load();

uint64_t minimumIncrement = blocksToProcess.load() / 100;

if (minimumIncrement < 1 || ISATTY)

minimumIncrement = 1;

if (phaseProgress == 0 || phaseProgress + minimumIncrement <= blockProgress) {

phaseProgress = blockProgress;

std::ostringstream str;

str << "\r";

void_mmap_allocator::reportStoreSize(str);

if (effectiveShards > 1)

str << std::to_string(shard + 1) << "/" << std::to_string(effectiveShards) << " ";

// TODO: revive showing the # of ways/relations?

str << "Block " << blocksProcessed.load() << "/" << blocksToProcess.load() << " ";

std::cout << str.str();

std::cout.flush();

}

ioMutex.unlock();

}

};

if(phase == ReadPhase::Nodes) {

bool done = ReadNodes(output, pg, pb, nodeKeys);

if(done) {

output_progress();

++read_groups;

continue;

}

if(phase == ReadPhase::WayScan) {

bool done = ScanWays(output, pg, pb, wayKeys);

if(done) {

if (ioMutex.try_lock()) {

size_t scanProgress = 100*blocksProcessed.load()/blocksToProcess.load();

if (scanProgress != phaseProgress) {

phaseProgress = scanProgress;

std::cout << "\r(Scanning for nodes used in ways: " << (100*blocksProcessed.load()/blocksToProcess.load()) << "%) ";

std::cout.flush();

}

ioMutex.unlock();

}

continue;

}

if(phase == ReadPhase::RelationScan) {

osmStore.ensureUsedWaysInited();

bool done = ScanRelations(output, pg, pb, wayKeys);

if(done) {

if (ioMutex.try_lock()) {

size_t scanProgress = 100*blocksProcessed.load()/blocksToProcess.load();

if (scanProgress != phaseProgress) {

phaseProgress = scanProgress;

std::cout << "\r(Scanning for ways used in relations: " << (100*blocksProcessed.load()/blocksToProcess.load()) << "%) ";

std::cout.flush();

}

ioMutex.unlock();

}

continue;

}

if(phase == ReadPhase::Ways) {

bool done = ReadWays(output, pg, pb, wayKeys, locationsOnWays, shard, effectiveShards);

if(done) {

output_progress();

++read_groups;

continue;

}

if(phase == ReadPhase::Relations) {

bool done = ReadRelations(output, pg, pb, blockMetadata, wayKeys, shard, effectiveShards);

if(done) {

output_progress();

++read_groups;

continue;

}

// Possible cases of a block contents:

// - single group

// - multiple groups of the same type

// - multiple groups of the different type

// In later case block would not be handled during this phase, and should be

// read again in remaining phases. Thus we return false to indicate that the

// block was not handled completelly.

if(read_groups != primitiveGroupSize) {

return false;

}

// We can only delete blocks if we're confident we've processed everything,

// which is not possible in the case of subdivided blocks.

return (shard + 1 == effectiveShards) && blockMetadata.chunks == 1;

}

bool blockHasPrimitiveGroupSatisfying(

std::istream& infile,

const BlockMetadata block,

std::function<bool(const PbfReader::PrimitiveGroup&)> test

) {

// We may have previously read to EOF, so clear the internal error state

infile.clear();

infile.seekg(block.offset);

protozero::data_view blob = reader.readBlob(block.length, infile);

PbfReader::PrimitiveBlock pb = reader.readPrimitiveBlock(blob);

if (infile.eof()) {

throw std::runtime_error("blockHasPrimitiveGroupSatisfying got unexpected eof");

}

for (auto& pg : pb.groups()) {

if (test(pg))

return false;

}

return true;

}

int PbfProcessor::ReadPbfFile(

uint shards,

bool hasSortTypeThenID,

const SignificantTags& nodeKeys,

const SignificantTags& wayKeys,

unsigned int threadNum,

const pbfreader_generate_stream& generate_stream,

const pbfreader_generate_output& generate_output,

const NodeStore& nodeStore,

const WayStore& wayStore

)

{

auto infile = generate_stream();

// ---- Read PBF

osmStore.clear();

PbfReader::HeaderBlock block = reader.readHeaderFromFile(*infile);

bool locationsOnWays = block.optionalFeatures.find(OptionLocationsOnWays) != block.optionalFeatures.end();

if (locationsOnWays) {

std::cout << ".osm.pbf file has locations on ways" << std::endl;

}

std::map<std::size_t, BlockMetadata> blocks;

// Track the filesize - note that we can't rely on tellg(), as

// its meant to be an opaque token useful only for seeking.

size_t filesize = 0;

while (true) {

PbfReader::BlobHeader bh = reader.readBlobHeader(*infile);

filesize += bh.datasize;

if (infile->eof()) {

break;

}

blocks[blocks.size()] = { static_cast<std::streamoff>(infile->tellg()), bh.datasize, true, true, true, 0, 1 };

infile->seekg(bh.datasize, std::ios_base::cur);

}

if (hasSortTypeThenID) {

// The PBF's blocks are sorted by type, then ID. We can do a binary search

// to learn where the blocks transition between object types, which

// enables a more efficient partitioning of work for reading.

std::vector<size_t> indexes;

for (int i = 0; i < blocks.size(); i++)

indexes.push_back(i);

const auto& waysStart = std::lower_bound(

indexes.begin(),

indexes.end(),

[&blocks, &infile](const auto &i, const auto &ignored) {

return blockHasPrimitiveGroupSatisfying(

*infile,

blocks[i],

[](const PbfReader::PrimitiveGroup& pg) {

for(auto w : pg.ways()) return true;

for(auto r : pg.relations()) return true;

return false;

}

);

}

);

const auto& relationsStart = std::lower_bound(

indexes.begin(),

indexes.end(),

[&blocks, &infile](const auto &i, const auto &ignored) {

return blockHasPrimitiveGroupSatisfying(

*infile,

blocks[i],

[](const PbfReader::PrimitiveGroup& pg) {

for (auto r : pg.relations()) return true;

return false;

}

);

}

);

for (auto it = indexes.begin(); it != indexes.end(); it++) {

blocks[*it].hasNodes = it <= waysStart;

blocks[*it].hasWays = it >= waysStart && it <= relationsStart;

blocks[*it].hasRelations = it >= relationsStart;

}

// PBFs generated by Osmium have 8,000 entities per block,

// and each block is about 64KB.

// PBFs generated by osmconvert (e.g., BBBike PBFs) have as

// many entities as fit in 31MB. Each block is about 16MB.

// Osmium PBFs seem to be processed about 3x faster than osmconvert

// PBFs, so try to hint to the user when they could speed up their

// pipeline.

if (filesize / blocks.size() > 1000000) {

std::cout << "warning: PBF has very large blocks, which may slow processing" << std::endl;

std::cout << " to fix: osmium cat -f pbf your-file.osm.pbf -o optimized.osm.pbf" << std::endl;

}

std::vector<ReadPhase> all_phases = { ReadPhase::RelationScan };

if (wayKeys.enabled()) {

osmStore.usedNodes.enable();

all_phases.push_back(ReadPhase::WayScan);

}

all_phases.push_back(ReadPhase::Nodes);

all_phases.push_back(ReadPhase::Ways);

all_phases.push_back(ReadPhase::Relations);

for(auto phase: all_phases) {

phaseProgress = 0;

uint effectiveShards = 1;

// On memory-constrained machines, we might read ways/relations

// multiple times in order to keep the working set of nodes limited.

if (phase == ReadPhase::Ways || phase == ReadPhase::Relations)

effectiveShards = shards;

for (int shard = 0; shard < effectiveShards; shard++) {

// If we're in ReadPhase::Ways, only do a pass if there is at least one

// entry in the pass's shard.

if (phase == ReadPhase::Ways && nodeStore.shard(shard).size() == 0)

continue;

// Ditto, but for relations

if (phase == ReadPhase::Relations && wayStore.shard(shard).size() == 0)

continue;

#ifdef CLOCK_MONOTONIC

timespec start, end;

clock_gettime(CLOCK_MONOTONIC, &start);

#endif

// Launch the pool with threadNum threads

boost::asio::thread_pool pool(threadNum);

std::mutex block_mutex;

// If we're in ReadPhase::Relations and there aren't many blocks left

// to read, increase parallelism by letting each thread only process

// a portion of the block.

if (phase == ReadPhase::Relations && blocks.size() < threadNum * 2) {

std::cout << "only " << blocks.size() << " relation blocks; subdividing for better parallelism" << std::endl;

std::map<std::size_t, BlockMetadata> moreBlocks;

for (const auto& block : blocks) {

BlockMetadata newBlock = block.second;

newBlock.chunks = threadNum;

for (size_t i = 0; i < threadNum; i++) {

newBlock.chunk = i;

moreBlocks[moreBlocks.size()] = newBlock;

}

blocks = moreBlocks;

}

std::deque<std::vector<IndexedBlockMetadata>> blockRanges;

std::map<std::size_t, BlockMetadata> filteredBlocks;

for (const auto& entry : blocks) {

if ((phase == ReadPhase::Nodes && entry.second.hasNodes) ||

(phase == ReadPhase::RelationScan && entry.second.hasRelations) ||

(phase == ReadPhase::WayScan && entry.second.hasWays) ||

(phase == ReadPhase::Ways && entry.second.hasWays) ||

(phase == ReadPhase::Relations && entry.second.hasRelations))

filteredBlocks[entry.first] = entry.second;

}

blocksToProcess = filteredBlocks.size();

blocksProcessed = 0;

phaseProgress = 0;

// Relations have very non-uniform processing times, so prefer

// to process them as granularly as possible.

size_t batchSize = 1;

// When creating NodeStore/WayStore, we try to give each worker

// large batches of contiguous blocks, so that they might benefit from

// long runs of sorted indexes, and locality of nearby IDs.

if (phase == ReadPhase::Nodes || phase == ReadPhase::Ways)

batchSize = (filteredBlocks.size() / (threadNum * 8)) + 1;

size_t consumed = 0;

auto it = filteredBlocks.begin();

while(it != filteredBlocks.end()) {

std::vector<IndexedBlockMetadata> blockRange;

blockRange.reserve(batchSize);

size_t max = consumed + batchSize;

for (; consumed < max && it != filteredBlocks.end(); consumed++) {

IndexedBlockMetadata ibm;

memcpy(&ibm, &it->second, sizeof(BlockMetadata));

ibm.index = it->first;

blockRange.push_back(ibm);

it++;

}

blockRanges.push_back(blockRange);

}

{

for(const std::vector<IndexedBlockMetadata>& blockRange: blockRanges) {

boost::asio::post(pool, [=, &blockRange, &blocks, &block_mutex, &nodeKeys, &wayKeys]() {

if (phase == ReadPhase::Nodes)

osmStore.nodes.batchStart();

if (phase == ReadPhase::Ways)

osmStore.ways.batchStart();

for (const IndexedBlockMetadata& indexedBlockMetadata: blockRange) {

auto infile = generate_stream();

auto output = generate_output();

if(ReadBlock(*infile, *output, indexedBlockMetadata, nodeKeys, wayKeys, locationsOnWays, phase, shard, effectiveShards)) {

const std::lock_guard<std::mutex> lock(block_mutex);

blocks.erase(indexedBlockMetadata.index);

}

blocksProcessed++;

}

});

}

pool.join();

#ifdef CLOCK_MONOTONIC

clock_gettime(CLOCK_MONOTONIC, &end);

uint64_t elapsedNs = 1e9 * (end.tv_sec - start.tv_sec) + end.tv_nsec - start.tv_nsec;

std::cout << "(" << std::to_string((uint32_t)(elapsedNs / 1e6)) << " ms)" << std::endl;

#endif

}

if(phase == ReadPhase::RelationScan) {

auto output = generate_output();

output->postScanRelations();

}

if(phase == ReadPhase::Nodes) {

osmStore.nodes.finalize(threadNum);

osmStore.usedNodes.clear();

}

if(phase == ReadPhase::Ways) {

osmStore.ways.finalize(threadNum);

}

return 0;

}

// Find a string in the dictionary

int PbfProcessor::findStringPosition(const PbfReader::PrimitiveBlock& pb, const std::string& str) {

for (int i = 0; i < pb.stringTable.size(); i++) {

if(str.size() == pb.stringTable[i].size() && memcmp(str.data(), pb.stringTable[i].data(), str.size()) == 0)

return i;

}

return -1;

}

// *************************************************

int ReadPbfBoundingBox(const std::string &inputFile, double &minLon, double &maxLon,

double &minLat, double &maxLat, bool &hasClippingBox)

{

fstream infile(inputFile, ios::in | ios::binary);

if (!infile) { cerr << "Couldn't open .pbf file " << inputFile << endl; return -1; }

auto header = reader.readHeaderFromFile(infile);

if (header.hasBbox) {

hasClippingBox = true;

minLon = header.bbox.minLon;

maxLon = header.bbox.maxLon;

minLat = header.bbox.minLat;

maxLat = header.bbox.maxLat;

}

infile.close();

return 0;

}

bool PbfHasOptionalFeature(const std::string& inputFile, const std::string& feature) {

std::ifstream infile(inputFile, std::ifstream::in | std::ifstream::binary);

auto header = reader.readHeaderFromFile(infile);

infile.close();

return header.optionalFeatures.find(feature) != header.optionalFeatures.end();

}

tilemaker/src/pbf_processor.cpp at master · cyclemap/tilemaker · GitHub

Uh oh!

Expand file tree

Breadcrumbs

pbf_processor.cpp

Latest commit

History

Breadcrumbs

pbf_processor.cpp

File metadata and controls