/*
open source routing machine
Copyright (C) Dennis Luxen, others 2010
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU AFFERO General Public License as published by
the Free Software Foundation; either version 3 of the License, or
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
or see http://www.gnu.org/licenses/agpl.txt.
*/
#include "DataStructures/QueryEdge.h"
#include "DataStructures/SharedMemoryFactory.h"
#include "DataStructures/SharedMemoryVectorWrapper.h"
#include "DataStructures/StaticGraph.h"
#include "Server/DataStructures/SharedDataType.h"
#include "Util/BoostFilesystemFix.h"
#include "Util/GraphLoader.h"
#include "Util/IniFile.h"
#include "Util/SimpleLogger.h"
#include "typedefs.h"
#include <boost/integer.hpp>
#include <boost/filesystem/fstream.hpp>
#include <string>
#include <vector>
typedef StaticGraph<QueryEdge::EdgeData> QueryGraph;
void StoreIntegerInSharedMemory(
const uint64_t value,
const SharedDataType data_type)
{
SharedMemory * memory = SharedMemoryFactory::Get(
data_type,
sizeof(uint64_t)
);
uint64_t * ptr = static_cast<uint64_t *>( memory->Ptr() );
*ptr = value;
}
int main(int argc, char * argv[]) {
try {
LogPolicy::GetInstance().Unmute();
SimpleLogger().Write() << "Checking input parameters";
boost::filesystem::path base_path = boost::filesystem::absolute(
(argc > 1 ? argv[1] : "server.ini")
).parent_path();
IniFile server_config((argc > 1 ? argv[1] : "server.ini"));
//check contents of config file
if ( !server_config.Holds("hsgrData")) {
throw OSRMException("no ram index file name in server ini");
}
if ( !server_config.Holds("ramIndex") ) {
throw OSRMException("no mem index file name in server ini");
}
if ( !server_config.Holds("nodesData") ) {
throw OSRMException("no nodes file name in server ini");
}
if ( !server_config.Holds("edgesData") ) {
throw OSRMException("no edges file name in server ini");
}
//generate paths of data files
boost::filesystem::path hsgr_path = boost::filesystem::absolute(
server_config.GetParameter("hsgrData"),
base_path
);
boost::filesystem::path ram_index_path = boost::filesystem::absolute(
server_config.GetParameter("ramIndex"),
base_path
);
boost::filesystem::path node_data_path = boost::filesystem::absolute(
server_config.GetParameter("nodesData"),
base_path
);
boost::filesystem::path edge_data_path = boost::filesystem::absolute(
server_config.GetParameter("edgesData"),
base_path
);
boost::filesystem::path name_data_path = boost::filesystem::absolute(
server_config.GetParameter("namesData"),
base_path
);
boost::filesystem::path timestamp_path = boost::filesystem::absolute(
server_config.GetParameter("timestamp"),
base_path
);
// check if data files empty
if ( 0 == boost::filesystem::file_size( node_data_path ) ) {
throw OSRMException("nodes file is empty");
}
if ( 0 == boost::filesystem::file_size( edge_data_path ) ) {
throw OSRMException("edges file is empty");
}
//TODO: remove any previous data
// Loading street names
SimpleLogger().Write() << "Loading names index";
uint64_t number_of_bytes = 0;
boost::filesystem::ifstream name_stream(
name_data_path, std::ios::binary
);
unsigned number_of_elements = 0;
name_stream.read((char *)&number_of_elements, sizeof(unsigned));
BOOST_ASSERT_MSG(0 != number_of_elements, "name file broken");
StoreIntegerInSharedMemory(number_of_elements, NAME_INDEX_SIZE);
number_of_bytes = sizeof(unsigned)*number_of_elements;
SharedMemory * index_memory = SharedMemoryFactory::Get(
NAMES_INDEX,
number_of_bytes
);
unsigned * index_ptr = static_cast<unsigned *>( index_memory->Ptr() );
name_stream.read((char*)index_ptr, number_of_bytes);
SimpleLogger().Write() << "Loading names list";
name_stream.read((char *)&number_of_bytes, sizeof(unsigned));
StoreIntegerInSharedMemory(number_of_bytes, NAME_INDEX_SIZE);
SharedMemory * char_memory = SharedMemoryFactory::Get(
NAMES_LIST, number_of_bytes+1
);
char * char_ptr = static_cast<char *>( char_memory->Ptr() );
name_stream.read(char_ptr, number_of_bytes);
name_stream.close();
std::vector<QueryGraph::_StrNode> node_list;
std::vector<QueryGraph::_StrEdge> edge_list;
//TODO: Read directly into shared memory
unsigned m_check_sum = 0;
SimpleLogger().Write() << "Loading graph node list";
uint64_t m_number_of_nodes = readHSGRFromStream(
hsgr_path,
node_list,
edge_list,
&m_check_sum
);
StoreIntegerInSharedMemory(node_list.size(), GRAPH_NODE_LIST_SIZE);
SharedMemory * graph_node_memory = SharedMemoryFactory::Get(
GRAPH_NODE_LIST,
sizeof(QueryGraph::_StrNode)*node_list.size()
);
QueryGraph::_StrNode * graph_node_ptr = static_cast<QueryGraph::_StrNode *>(
graph_node_memory->Ptr()
);
std::copy(node_list.begin(), node_list.end(), graph_node_ptr);
SimpleLogger().Write() << "Loading graph edge list";
StoreIntegerInSharedMemory(edge_list.size(), GRAPH_EDGE_LIST_SIZE);
SharedMemory * graph_edge_memory = SharedMemoryFactory::Get(
GRAPH_EDGE_LIST,
sizeof(QueryGraph::_StrEdge)*edge_list.size()
);
QueryGraph::_StrEdge * graph_edge_ptr = static_cast<QueryGraph::_StrEdge *>(
graph_edge_memory->Ptr()
);
std::copy(edge_list.begin(), edge_list.end(), graph_edge_ptr);
// load checksum
SimpleLogger().Write() << "Loading check sum";
StoreIntegerInSharedMemory(m_check_sum, CHECK_SUM);
SimpleLogger().Write() << "Loading timestamp";
std::string m_timestamp;
if( boost::filesystem::exists(timestamp_path) ) {
boost::filesystem::ifstream timestampInStream( timestamp_path );
if(!timestampInStream) {
SimpleLogger().Write(logWARNING) << timestamp_path << " not found";
}
getline(timestampInStream, m_timestamp);
timestampInStream.close();
}
if(m_timestamp.empty()) {
m_timestamp = "n/a";
}
if(25 < m_timestamp.length()) {
m_timestamp.resize(25);
}
StoreIntegerInSharedMemory(m_timestamp.length(), TIMESTAMP_SIZE);
SharedMemory * timestamp_memory = SharedMemoryFactory::Get(
TIMESTAMP, m_timestamp.length()
);
char * timestamp_ptr = static_cast<char *>( timestamp_memory->Ptr() );
std::copy(
m_timestamp.c_str(),
m_timestamp.c_str()+m_timestamp.length(),
timestamp_ptr
);
//Loading information for original edges
boost::filesystem::ifstream edges_input_stream(
edge_data_path,
std::ios::binary
);
unsigned number_of_edges = 0;
edges_input_stream.read((char*)&number_of_edges, sizeof(unsigned));
SimpleLogger().Write() << "Loading via node, coordinates and turn instruction list";
StoreIntegerInSharedMemory(number_of_edges, NAME_ID_LIST_SIZE);
StoreIntegerInSharedMemory(number_of_edges, TURN_INSTRUCTION_LIST_SIZE);
StoreIntegerInSharedMemory(number_of_edges, VIA_NODE_LIST_SIZE);
SharedMemory * name_id_memory = SharedMemoryFactory::Get(
NAME_ID_LIST,
number_of_edges*sizeof(unsigned)
);
unsigned * name_id_ptr = static_cast<unsigned *>( name_id_memory->Ptr() );
SharedMemory *via_node_memory = SharedMemoryFactory::Get(
VIA_NODE_LIST,
number_of_edges*sizeof(unsigned)
);
unsigned * via_node_ptr = static_cast<unsigned *>( via_node_memory->Ptr() );
SharedMemory *turn_instruction_memory = SharedMemoryFactory::Get(
TURN_INSTRUCTION_LIST,
number_of_edges*sizeof(TurnInstruction)
);
unsigned * turn_instructions_ptr = static_cast<unsigned *>( turn_instruction_memory->Ptr() );
OriginalEdgeData current_edge_data;
for(unsigned i = 0; i < number_of_edges; ++i) {
edges_input_stream.read(
(char*)&(current_edge_data),
sizeof(OriginalEdgeData)
);
via_node_ptr[i] = current_edge_data.viaNode;
name_id_ptr[i] = current_edge_data.nameID;
turn_instructions_ptr[i] = current_edge_data.turnInstruction;
}
edges_input_stream.close();
// Loading list of coordinates
SimpleLogger().Write(logDEBUG) << "Loading coordinates list";
boost::filesystem::ifstream nodes_input_stream(
node_data_path,
std::ios::binary
);
unsigned number_of_nodes = 0;
nodes_input_stream.read((char *)&number_of_nodes, sizeof(unsigned));
StoreIntegerInSharedMemory(number_of_nodes, COORDINATE_LIST_SIZE);
SharedMemory *coordinates_memory = SharedMemoryFactory::Get(
COORDINATE_LIST,
number_of_nodes*sizeof(FixedPointCoordinate)
);
FixedPointCoordinate * coordinates_ptr = static_cast<FixedPointCoordinate *>( coordinates_memory->Ptr() );
NodeInfo current_node;
for(unsigned i = 0; i < number_of_nodes; ++i) {
nodes_input_stream.read((char *)¤t_node, sizeof(NodeInfo));
coordinates_ptr[i] = FixedPointCoordinate(current_node.lat, current_node.lon);
}
nodes_input_stream.close();
// Loading r-tree search data structure
SimpleLogger().Write() << "loading r-tree search list";
boost::filesystem::ifstream tree_node_file(
ram_index_path,
std::ios::binary
);
uint32_t tree_size = 0;
tree_node_file.read((char*)&tree_size, sizeof(uint32_t));
StoreIntegerInSharedMemory(tree_size, R_SEARCH_TREE_SIZE);
//SimpleLogger().Write() << "reading " << tree_size << " tree nodes in " << (sizeof(TreeNode)*tree_size) << " bytes";
SharedMemory * rtree_memory = SharedMemoryFactory::Get(
R_SEARCH_TREE,
tree_size*sizeof(TreeNode);
);
char * rtree_ptr = static_cast<char *>( rtree_memory->Ptr() );
tree_node_file.read(rtree_ptr, sizeof(TreeNode)*tree_size);
tree_node_file.close();
} catch(const std::exception & e) {
SimpleLogger().Write(logWARNING) << "caught exception: " << e.what();
}
//
return 0;
}