trunk/src/nodesx.h

/***************************************
 A header file for the extended nodes.

 Part of the Routino routing software.
 ******************/ /******************
 This file Copyright 2008-2011 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, finally the first segment. +*/

 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   number;              /*+ The number of extended nodes still being considered. +*/

#if !SLIM

 NodeX    *data;                /*+ The extended node data (when mapped into memory). +*/

#else

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

#endif

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

 index_t  *gdata;               /*+ The final node indexes (sorted geographically). +*/

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

 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. +*/
};


/* Functions in nodesx.c */

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 UpdateNodes(NodesX *nodesx,SegmentsX *segmentsx);


/* Macros and inline functions */

#define ClearBit(xx,yy)    (xx)[(yy)/8]&=~(1<<((yy)%8))
#define SetBit(xx,yy)      (xx)[(yy)/8]|= (1<<((yy)%8))
#define IsBitSet(xx,yy)   ((xx)[(yy)/8]&  (1<<((yy)%8)))


#if !SLIM

#define LookupNodeX(nodesx,index,position)      &(nodesx)->data[index]
  
#define PutBackNodeX(nodesx,index,position)     /* nop */

#else

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

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


/*++++++++++++++++++++++++++++++++++++++
  Lookup a particular extended node with the specified id from the file on disk.

  NodeX *LookupNodeX Returns a pointer to a cached copy of the extended node.

  NodesX *nodesx The set of nodes to use.

  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->cached[position-1],sizeof(NodeX));

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


/*++++++++++++++++++++++++++++++++++++++
  Put back an extended node's data into the file on disk.

  NodesX *nodesx The set of nodes to modify.

  index_t index The node index to put back.

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

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

 WriteFile(nodesx->fd,&nodesx->cached[position-1],sizeof(NodeX));
}

#endif /* SLIM */


#endif /* NODESX_H */
1	/***************************************
2	A header file for the extended nodes.
3
4	Part of the Routino routing software.
5	****************/ /****************
6	This file Copyright 2008-2011 Andrew M. Bishop
7
8	This program is free software: you can redistribute it and/or modify
9	it under the terms of the GNU Affero General Public License as published by
10	the Free Software Foundation, either version 3 of the License, or
11	(at your option) any later version.
12
13	This program is distributed in the hope that it will be useful,
14	but WITHOUT ANY WARRANTY; without even the implied warranty of
15	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16	GNU Affero General Public License for more details.
17
18	You should have received a copy of the GNU Affero General Public License
19	along with this program. If not, see <http://www.gnu.org/licenses/>.
20	***************************************/
21
22
23	#ifndef NODESX_H
24	#define NODESX_H /+ To stop multiple inclusions. +/
25
26	#include <stdint.h>
27
28	#include "types.h"
29	#include "nodes.h"
30
31	#include "typesx.h"
32
33	#include "files.h"
34
35
36	/* Data structures */
37
38
39	/+ An extended structure used for processing. +/
40	struct _NodeX
41	{
42	node_t id; /+ The node identifier; initially the OSM value, later the Node index, finally the first segment. +/
43
44	latlong_t latitude; /+ The node latitude. +/
45	latlong_t longitude; /+ The node longitude. +/
46
47	transports_t allow; /+ The node allowed traffic. +/
48
49	uint16_t flags; /+ The node flags. +/
50	};
51
52	/+ A structure containing a set of nodes (memory format). +/
53	struct _NodesX
54	{
55	char filename; /+ The name of the temporary file. +*/
56	int fd; /+ The file descriptor of the temporary file. +/
57
58	index_t number; /+ The number of extended nodes still being considered. +/
59
60	#if !SLIM
61
62	NodeX data; /+ The extended node data (when mapped into memory). +*/
63
64	#else
65
66	NodeX cached[2]; /+ Two cached nodes read from the file in slim mode. +/
67
68	#endif
69
70	node_t idata; /+ The extended node IDs (sorted by ID). +*/
71
72	index_t gdata; /+ The final node indexes (sorted geographically). +*/
73
74	uint8_t super; /+ A bit-mask marker for super nodes (same order as sorted nodes). +*/
75
76	index_t latbins; /+ The number of bins containing latitude. +/
77	index_t lonbins; /+ The number of bins containing longitude. +/
78
79	ll_bin_t latzero; /+ The bin number of the furthest south bin. +/
80	ll_bin_t lonzero; /+ The bin number of the furthest west bin. +/
81	};
82
83
84	/* Functions in nodesx.c */
85
86	NodesX *NewNodeList(int append);
87	void FreeNodeList(NodesX *nodesx,int keep);
88
89	void SaveNodeList(NodesX nodesx,const char filename);
90
91	index_t IndexNodeX(NodesX *nodesx,node_t id);
92
93	void AppendNode(NodesX *nodesx,node_t id,double latitude,double longitude,transports_t allow,uint16_t flags);
94
95	void SortNodeList(NodesX *nodesx);
96
97	void SortNodeListGeographically(NodesX *nodesx);
98
99	void RemoveNonHighwayNodes(NodesX nodesx,SegmentsX segmentsx);
100
101	void UpdateNodes(NodesX nodesx,SegmentsX segmentsx);
102
103
104	/* Macros and inline functions */
105
106	#define ClearBit(xx,yy) (xx)[(yy)/8]&=~(1<<((yy)%8))
107	#define SetBit(xx,yy) (xx)[(yy)/8]\|= (1<<((yy)%8))
108	#define IsBitSet(xx,yy) ((xx)[(yy)/8]& (1<<((yy)%8)))
109
110
111	#if !SLIM
112
113	#define LookupNodeX(nodesx,index,position) &(nodesx)->data[index]
114
115	#define PutBackNodeX(nodesx,index,position) /* nop */
116
117	#else
118
119	static NodeX LookupNodeX(NodesX nodesx,index_t index,int position);
120
121	static void PutBackNodeX(NodesX *nodesx,index_t index,int position);
122
123
124	/*++++++++++++++++++++++++++++++++++++++
125	Lookup a particular extended node with the specified id from the file on disk.
126
127	NodeX *LookupNodeX Returns a pointer to a cached copy of the extended node.
128
129	NodesX *nodesx The set of nodes to use.
130
131	index_t index The node index to look for.
132
133	int position The position in the cache to use.
134	++++++++++++++++++++++++++++++++++++++*/
135
136	static inline NodeX LookupNodeX(NodesX nodesx,index_t index,int position)
137	{
138	SeekFile(nodesx->fd,(off_t)index*sizeof(NodeX));
139
140	ReadFile(nodesx->fd,&nodesx->cached[position-1],sizeof(NodeX));
141
142	return(&nodesx->cached[position-1]);
143	}
144
145
146	/*++++++++++++++++++++++++++++++++++++++
147	Put back an extended node's data into the file on disk.
148
149	NodesX *nodesx The set of nodes to modify.
150
151	index_t index The node index to put back.
152
153	int position The position in the cache to use.
154	++++++++++++++++++++++++++++++++++++++*/
155
156	static inline void PutBackNodeX(NodesX *nodesx,index_t index,int position)
157	{
158	SeekFile(nodesx->fd,(off_t)index*sizeof(NodeX));
159
160	WriteFile(nodesx->fd,&nodesx->cached[position-1],sizeof(NodeX));
161	}
162
163	#endif /* SLIM */
164
165
166	#endif /* NODESX_H */