trunk/src/nodesx.h

/***************************************
 $Header: /home/amb/CVS/routino/src/nodesx.h,v 1.34 2010-12-05 14:43:37 amb Exp $

 A header file for the extended nodes.

 Part of the Routino routing software.
 ******************/ /******************
 This file Copyright 2008-2010 Andrew M. Bishop

 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
 (at your option) 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 Affero 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, see <http://www.gnu.org/licenses/>.
 ***************************************/


#ifndef NODESX_H
#define NODESX_H    /*+ To stop multiple inclusions. +*/

#include <stdint.h>

#include "types.h"
#include "nodes.h"

#include "typesx.h"

#include "files.h"


/* Data structures */


/*+ An extended structure used for processing. +*/
struct _NodeX
{
 node_t       id;               /*+ The node identifier; initially the OSM value, later the Node index. +*/

 latlong_t    latitude;         /*+ The node latitude. +*/
 latlong_t    longitude;        /*+ The node longitude. +*/

 transports_t allow;            /*+ The node allowed traffic. +*/

 uint16_t     flags;            /*+ The node flags. +*/
};

/*+ A structure containing a set of nodes (memory format). +*/
struct _NodesX
{
 char     *filename;            /*+ The name of the temporary file. +*/
 int       fd;                  /*+ The file descriptor of the temporary file. +*/

 index_t   xnumber;             /*+ The number of unsorted extended nodes. +*/

#if !SLIM

 NodeX    *xdata;               /*+ The extended node data (sorted). +*/

#else

 NodeX     xcached[2];          /*+ Two cached nodes read from the file in slim mode. +*/

#endif

 index_t   number;              /*+ How many entries are still useful? +*/

 node_t   *idata;               /*+ The extended node IDs (sorted by ID). +*/

 uint8_t  *super;               /*+ A marker for super nodes (same order sorted nodes). +*/

#if !SLIM

 Node     *ndata;               /*+ The actual nodes (same order as geographically sorted nodes). +*/

#else

 char     *nfilename;           /*+ The name of the temporary file for nodes in slim mode. +*/
 int       nfd;                 /*+ The file descriptor of the temporary file. +*/

 Node      ncached[2];          /*+ Two cached nodes read from the file in slim mode. +*/

#endif

 index_t   latbins;             /*+ The number of bins containing latitude. +*/
 index_t   lonbins;             /*+ The number of bins containing longitude. +*/

 ll_bin_t  latzero;             /*+ The bin number of the furthest south bin. +*/
 ll_bin_t  lonzero;             /*+ The bin number of the furthest west bin. +*/

 index_t   latlonbin;           /*+ A temporary index into the offsets array. +*/

 index_t  *offsets;             /*+ An array of offset to the first node in each bin. +*/
};


/* Functions */

NodesX *NewNodeList(int append);
void FreeNodeList(NodesX *nodesx,int keep);

void SaveNodeList(NodesX *nodesx,const char *filename);

index_t IndexNodeX(NodesX* nodesx,node_t id);

void AppendNode(NodesX* nodesx,node_t id,double latitude,double longitude,transports_t allow,uint16_t flags);

void SortNodeList(NodesX *nodesx);

void SortNodeListGeographically(NodesX* nodesx);

void RemoveNonHighwayNodes(NodesX *nodesx,SegmentsX *segmentsx);

void CreateRealNodes(NodesX *nodesx,int iteration);

void IndexNodes(NodesX *nodesx,SegmentsX *segmentsx);


/* Macros / inline functions */

#if !SLIM

#define LookupNodeX(nodesx,index,position)      &(nodesx)->xdata[index]
  
#define LookupNodeXNode(nodesx,index,position)  &(nodesx)->ndata[index]

#else

static NodeX *LookupNodeX(NodesX* nodesx,index_t index,int position);

static Node *LookupNodeXNode(NodesX* nodesx,index_t index,int position);

static void PutBackNodeXNode(NodesX* nodesx,index_t index,int position);


/*++++++++++++++++++++++++++++++++++++++
  Lookup a particular extended node.

  NodeX *LookupNodeX Returns a pointer to the extended node with the specified id.

  NodesX* nodesx The set of nodes to process.

  index_t index The node index to look for.

  int position The position in the cache to use.
  ++++++++++++++++++++++++++++++++++++++*/

static inline NodeX *LookupNodeX(NodesX* nodesx,index_t index,int position)
{
 SeekFile(nodesx->fd,(off_t)index*sizeof(NodeX));

 ReadFile(nodesx->fd,&nodesx->xcached[position-1],sizeof(NodeX));

 return(&nodesx->xcached[position-1]);
}


/*++++++++++++++++++++++++++++++++++++++
  Lookup a particular extended node's normal node.

  Node *LookupNodeXNode Returns a pointer to the node with the specified id.

  NodesX* nodesx The set of nodes to process.

  index_t index The node index to look for.

  int position The position in the cache to use.
  ++++++++++++++++++++++++++++++++++++++*/

static inline Node *LookupNodeXNode(NodesX* nodesx,index_t index,int position)
{
 SeekFile(nodesx->nfd,(off_t)index*sizeof(Node));

 ReadFile(nodesx->nfd,&nodesx->ncached[position-1],sizeof(Node));

 return(&nodesx->ncached[position-1]);
}


/*++++++++++++++++++++++++++++++++++++++
  Put back an extended node's normal node.

  NodesX* nodesx The set of nodes to process.

  index_t index The node index to look for.

  int position The position in the cache to use.
  ++++++++++++++++++++++++++++++++++++++*/

static inline void PutBackNodeXNode(NodesX* nodesx,index_t index,int position)
{
 SeekFile(nodesx->nfd,(off_t)index*sizeof(Node));

 WriteFile(nodesx->nfd,&nodesx->ncached[position-1],sizeof(Node));
}

#endif /* SLIM */


#endif /* NODESX_H */
1	/***************************************
2	$Header: /home/amb/CVS/routino/src/nodesx.h,v 1.34 2010-12-05 14:43:37 amb Exp $
3
4	A header file for the extended nodes.
5
6	Part of the Routino routing software.
7	****************/ /****************
8	This file Copyright 2008-2010 Andrew M. Bishop
9
10	This program is free software: you can redistribute it and/or modify
11	it under the terms of the GNU Affero General Public License as published by
12	the Free Software Foundation, either version 3 of the License, or
13	(at your option) any later version.
14
15	This program is distributed in the hope that it will be useful,
16	but WITHOUT ANY WARRANTY; without even the implied warranty of
17	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18	GNU Affero General Public License for more details.
19
20	You should have received a copy of the GNU Affero General Public License
21	along with this program. If not, see <http://www.gnu.org/licenses/>.
22	***************************************/
23
24
25	#ifndef NODESX_H
26	#define NODESX_H /+ To stop multiple inclusions. +/
27
28	#include <stdint.h>
29
30	#include "types.h"
31	#include "nodes.h"
32
33	#include "typesx.h"
34
35	#include "files.h"
36
37
38	/* Data structures */
39
40
41	/+ An extended structure used for processing. +/
42	struct _NodeX
43	{
44	node_t id; /+ The node identifier; initially the OSM value, later the Node index. +/
45
46	latlong_t latitude; /+ The node latitude. +/
47	latlong_t longitude; /+ The node longitude. +/
48
49	transports_t allow; /+ The node allowed traffic. +/
50
51	uint16_t flags; /+ The node flags. +/
52	};
53
54	/+ A structure containing a set of nodes (memory format). +/
55	struct _NodesX
56	{
57	char filename; /+ The name of the temporary file. +*/
58	int fd; /+ The file descriptor of the temporary file. +/
59
60	index_t xnumber; /+ The number of unsorted extended nodes. +/
61
62	#if !SLIM
63
64	NodeX xdata; /+ The extended node data (sorted). +*/
65
66	#else
67
68	NodeX xcached[2]; /+ Two cached nodes read from the file in slim mode. +/
69
70	#endif
71
72	index_t number; /+ How many entries are still useful? +/
73
74	node_t idata; /+ The extended node IDs (sorted by ID). +*/
75
76	uint8_t super; /+ A marker for super nodes (same order sorted nodes). +*/
77
78	#if !SLIM
79
80	Node ndata; /+ The actual nodes (same order as geographically sorted nodes). +*/
81
82	#else
83
84	char nfilename; /+ The name of the temporary file for nodes in slim mode. +*/
85	int nfd; /+ The file descriptor of the temporary file. +/
86
87	Node ncached[2]; /+ Two cached nodes read from the file in slim mode. +/
88
89	#endif
90
91	index_t latbins; /+ The number of bins containing latitude. +/
92	index_t lonbins; /+ The number of bins containing longitude. +/
93
94	ll_bin_t latzero; /+ The bin number of the furthest south bin. +/
95	ll_bin_t lonzero; /+ The bin number of the furthest west bin. +/
96
97	index_t latlonbin; /+ A temporary index into the offsets array. +/
98
99	index_t offsets; /+ An array of offset to the first node in each bin. +*/
100	};
101
102
103	/* Functions */
104
105	NodesX *NewNodeList(int append);
106	void FreeNodeList(NodesX *nodesx,int keep);
107
108	void SaveNodeList(NodesX nodesx,const char filename);
109
110	index_t IndexNodeX(NodesX* nodesx,node_t id);
111
112	void AppendNode(NodesX* nodesx,node_t id,double latitude,double longitude,transports_t allow,uint16_t flags);
113
114	void SortNodeList(NodesX *nodesx);
115
116	void SortNodeListGeographically(NodesX* nodesx);
117
118	void RemoveNonHighwayNodes(NodesX nodesx,SegmentsX segmentsx);
119
120	void CreateRealNodes(NodesX *nodesx,int iteration);
121
122	void IndexNodes(NodesX nodesx,SegmentsX segmentsx);
123
124
125	/* Macros / inline functions */
126
127	#if !SLIM
128
129	#define LookupNodeX(nodesx,index,position) &(nodesx)->xdata[index]
130
131	#define LookupNodeXNode(nodesx,index,position) &(nodesx)->ndata[index]
132
133	#else
134
135	static NodeX LookupNodeX(NodesX nodesx,index_t index,int position);
136
137	static Node LookupNodeXNode(NodesX nodesx,index_t index,int position);
138
139	static void PutBackNodeXNode(NodesX* nodesx,index_t index,int position);
140
141
142	/*++++++++++++++++++++++++++++++++++++++
143	Lookup a particular extended node.
144
145	NodeX *LookupNodeX Returns a pointer to the extended node with the specified id.
146
147	NodesX* nodesx The set of nodes to process.
148
149	index_t index The node index to look for.
150
151	int position The position in the cache to use.
152	++++++++++++++++++++++++++++++++++++++*/
153
154	static inline NodeX LookupNodeX(NodesX nodesx,index_t index,int position)
155	{
156	SeekFile(nodesx->fd,(off_t)index*sizeof(NodeX));
157
158	ReadFile(nodesx->fd,&nodesx->xcached[position-1],sizeof(NodeX));
159
160	return(&nodesx->xcached[position-1]);
161	}
162
163
164	/*++++++++++++++++++++++++++++++++++++++
165	Lookup a particular extended node's normal node.
166
167	Node *LookupNodeXNode Returns a pointer to the node with the specified id.
168
169	NodesX* nodesx The set of nodes to process.
170
171	index_t index The node index to look for.
172
173	int position The position in the cache to use.
174	++++++++++++++++++++++++++++++++++++++*/
175
176	static inline Node LookupNodeXNode(NodesX nodesx,index_t index,int position)
177	{
178	SeekFile(nodesx->nfd,(off_t)index*sizeof(Node));
179
180	ReadFile(nodesx->nfd,&nodesx->ncached[position-1],sizeof(Node));
181
182	return(&nodesx->ncached[position-1]);
183	}
184
185
186	/*++++++++++++++++++++++++++++++++++++++
187	Put back an extended node's normal node.
188
189	NodesX* nodesx The set of nodes to process.
190
191	index_t index The node index to look for.
192
193	int position The position in the cache to use.
194	++++++++++++++++++++++++++++++++++++++*/
195
196	static inline void PutBackNodeXNode(NodesX* nodesx,index_t index,int position)
197	{
198	SeekFile(nodesx->nfd,(off_t)index*sizeof(Node));
199
200	WriteFile(nodesx->nfd,&nodesx->ncached[position-1],sizeof(Node));
201	}
202
203	#endif /* SLIM */
204
205
206	#endif /* NODESX_H */