trunk/src/relationsx.c

/***************************************
 $Header: /home/amb/CVS/routino/src/relationsx.c,v 1.7 2010-10-09 14:14:42 amb Exp $

 Extended Relation data type functions.

 Part of the Routino routing software.
 ******************/ /******************
 This file Copyright 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/>.
 ***************************************/


#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/stat.h>

#include "waysx.h"
#include "relationsx.h"

#include "files.h"
#include "functions.h"


/* Variables */

/*+ The command line '--tmpdir' option or its default value. +*/
extern char *option_tmpdirname;


/*++++++++++++++++++++++++++++++++++++++
  Allocate a new relation list (create a new file or open an existing one).

  RelationsX *NewRelationList Returns the relation list.

  int append Set to 1 if the file is to be opened for appending (now or later).
  ++++++++++++++++++++++++++++++++++++++*/

RelationsX *NewRelationList(int append)
{
 RelationsX *relationsx;

 relationsx=(RelationsX*)calloc(1,sizeof(RelationsX));

 assert(relationsx); /* Check calloc() worked */

 relationsx->rfilename=(char*)malloc(strlen(option_tmpdirname)+32);

 if(append)
    sprintf(relationsx->rfilename,"%s/relationsx.route.input.tmp",option_tmpdirname);
 else
    sprintf(relationsx->rfilename,"%s/relationsx.route.%p.tmp",option_tmpdirname,relationsx);

 if(append)
   {
    off_t size,position=0;

    relationsx->rfd=OpenFileAppend(relationsx->rfilename);

    size=SizeFile(relationsx->rfilename);

    while(position<size)
      {
       FILESORT_VARINT relationsize;

       SeekFile(relationsx->rfd,position);
       ReadFile(relationsx->rfd,&relationsize,FILESORT_VARSIZE);

       relationsx->rxnumber++;
       position+=relationsize+FILESORT_VARSIZE;
      }

    SeekFile(relationsx->rfd,size);
   }
 else
    relationsx->rfd=OpenFileNew(relationsx->rfilename);

 return(relationsx);
}


/*++++++++++++++++++++++++++++++++++++++
  Free a relation list.

  RelationsX *relationsx The list to be freed.

  int keep Set to 1 if the file is to be kept.
  ++++++++++++++++++++++++++++++++++++++*/

void FreeRelationList(RelationsX *relationsx,int keep)
{
 if(!keep)
    DeleteFile(relationsx->rfilename);

 free(relationsx->rfilename);

 free(relationsx);
}


/*++++++++++++++++++++++++++++++++++++++
  Append a single relation to an unsorted route relation list.

  RelationsX* relationsx The set of relations to process.

  relation_t id The ID of the relation.

  allow_t routes The types of routes that this relation is for.

  way_t *ways The array of ways that are members of the relation.

  int nways The number of ways that are members of the relation.

  relation_t *relations The array of relations that are members of the relation.

  int nrelations The number of relations that are members of the relation.
  ++++++++++++++++++++++++++++++++++++++*/

void AppendRouteRelation(RelationsX* relationsx,relation_t id,allow_t routes,
                         way_t *ways,int nways,
                         relation_t *relations,int nrelations)
{
 RouteRelX relationx;
 FILESORT_VARINT size;
 way_t zeroway=0;
 relation_t zerorelation=0;

 relationx.id=id;
 relationx.routes=routes;

 size=sizeof(RouteRelX)+(nways+1)*sizeof(way_t)+(nrelations+1)*sizeof(relation_t);

 WriteFile(relationsx->rfd,&size,FILESORT_VARSIZE);
 WriteFile(relationsx->rfd,&relationx,sizeof(RouteRelX));

 WriteFile(relationsx->rfd,ways    ,nways*sizeof(way_t));
 WriteFile(relationsx->rfd,&zeroway,      sizeof(way_t));

 WriteFile(relationsx->rfd,relations    ,nrelations*sizeof(relation_t));
 WriteFile(relationsx->rfd,&zerorelation,           sizeof(relation_t));

 relationsx->rxnumber++;

 assert(!(relationsx->rxnumber==0)); /* Zero marks the high-water mark for relations. */
}


/*++++++++++++++++++++++++++++++++++++++
  Sort the list of relations.

  RelationsX* relationsx The set of relations to process.
  ++++++++++++++++++++++++++++++++++++++*/

void SortRelationList(RelationsX* relationsx)
{
 /* Don't need to sort route relations */
}


/*++++++++++++++++++++++++++++++++++++++
  Process the route relations and apply the information to the ways.

  RelationsX *relationsx The set of relations to process.

  WaysX *waysx The set of ways to update.
  ++++++++++++++++++++++++++++++++++++++*/

void ProcessRouteRelations(RelationsX *relationsx,WaysX *waysx)
{
 RouteRelX *unmatched=NULL,*lastunmatched=NULL;
 int nunmatched=0,lastnunmatched=0,iteration=0;
 int i,j;

 if(waysx->number==0)
    return;

 /* Map into memory */

#if !SLIM
 waysx->xdata=MapFileWriteable(waysx->filename);
#endif

 /* Open the file and read through it */

 relationsx->rfd=ReOpenFile(relationsx->rfilename);

 do
   {
    SeekFile(relationsx->rfd,0);

    /* Print the start message */

    printf("Processing Route Relations: Iteration=%d Relations=0",iteration);
    fflush(stdout);

    for(i=0;i<relationsx->rxnumber;i++)
      {
       FILESORT_VARINT size;
       RouteRelX relationx;
       way_t wayid;
       relation_t relationid;
       allow_t routes=Allow_None;

       /* Read each route relation */

       ReadFile(relationsx->rfd,&size,FILESORT_VARSIZE);
       ReadFile(relationsx->rfd,&relationx,sizeof(RouteRelX));

       /* Decide what type of route it is */

       if(iteration==0)
          routes=relationx.routes;
       else
         {
          if((lastunmatched[j].routes|relationx.routes)==relationx.routes)
             routes=0; /* Nothing new to add */
          else
             for(j=0;j<lastnunmatched;j++)
                if(lastunmatched[j].id==relationx.id)
                  {
                   routes=lastunmatched[j].routes;
                   break;
                  }
         }

       /* Loop through the ways */

       do
         {
          ReadFile(relationsx->rfd,&wayid,sizeof(way_t));

          /* Update the ways that are listed for the relation */

          if(wayid && routes)
            {
             index_t way=IndexWayX(waysx,wayid);

             if(way!=NO_WAY)
               {
                WayX *wayx=LookupWayX(waysx,way,1);

                if(routes&Allow_Foot)
                   wayx->way.props|=Properties_FootRoute;

                if(routes&Allow_Bicycle)
                   wayx->way.props|=Properties_BicycleRoute;

#if SLIM
                PutBackWayX(waysx,way,1);
#endif
               }
            }
         }
       while(wayid);

       /* Loop through the relations */

       do
         {
          ReadFile(relationsx->rfd,&relationid,sizeof(relation_t));

          /* Add the relations that are listed for this relation to the list for next time */

          if(relationid && routes && relationid!=relationx.id)
            {
             if(nunmatched%256==0)
                unmatched=(RouteRelX*)realloc((void*)unmatched,(nunmatched+256)*sizeof(RouteRelX));

             unmatched[nunmatched].id=relationid;
             unmatched[nunmatched].routes=routes;

             nunmatched++;
            }
         }
       while(relationid);

       if(!((i+1)%10000))
         {
          printf("\rProcessing Route Relations: Iteration=%d Relations=%d",iteration,i+1);
          fflush(stdout);
         }
      }

    if(lastunmatched)
       free(lastunmatched);

    lastunmatched=unmatched;
    lastnunmatched=nunmatched;

    unmatched=NULL;
    nunmatched=0;

    /* Print the final message */

    printf("\rProcessed Route Relations: Iteration=%d Relations=%d  \n",iteration,relationsx->rxnumber);
    fflush(stdout);
   }
 while(lastnunmatched && ++iteration<5);

 if(lastunmatched)
    free(lastunmatched);

 CloseFile(relationsx->rfd);

 /* Unmap from memory */

#if !SLIM
 waysx->xdata=UnmapFile(waysx->filename);
#endif
}
1	/***************************************
2	$Header: /home/amb/CVS/routino/src/relationsx.c,v 1.7 2010-10-09 14:14:42 amb Exp $
3
4	Extended Relation data type functions.
5
6	Part of the Routino routing software.
7	****************/ /****************
8	This file Copyright 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	#include <assert.h>
26	#include <stdlib.h>
27	#include <stdio.h>
28	#include <string.h>
29	#include <sys/stat.h>
30
31	#include "waysx.h"
32	#include "relationsx.h"
33
34	#include "files.h"
35	#include "functions.h"
36
37
38	/* Variables */
39
40	/+ The command line '--tmpdir' option or its default value. +/
41	extern char *option_tmpdirname;
42
43
44	/*++++++++++++++++++++++++++++++++++++++
45	Allocate a new relation list (create a new file or open an existing one).
46
47	RelationsX *NewRelationList Returns the relation list.
48
49	int append Set to 1 if the file is to be opened for appending (now or later).
50	++++++++++++++++++++++++++++++++++++++*/
51
52	RelationsX *NewRelationList(int append)
53	{
54	RelationsX *relationsx;
55
56	relationsx=(RelationsX*)calloc(1,sizeof(RelationsX));
57
58	assert(relationsx); /* Check calloc() worked */
59
60	relationsx->rfilename=(char*)malloc(strlen(option_tmpdirname)+32);
61
62	if(append)
63	sprintf(relationsx->rfilename,"%s/relationsx.route.input.tmp",option_tmpdirname);
64	else
65	sprintf(relationsx->rfilename,"%s/relationsx.route.%p.tmp",option_tmpdirname,relationsx);
66
67	if(append)
68	{
69	off_t size,position=0;
70
71	relationsx->rfd=OpenFileAppend(relationsx->rfilename);
72
73	size=SizeFile(relationsx->rfilename);
74
75	while(position<size)
76	{
77	FILESORT_VARINT relationsize;
78
79	SeekFile(relationsx->rfd,position);
80	ReadFile(relationsx->rfd,&relationsize,FILESORT_VARSIZE);
81
82	relationsx->rxnumber++;
83	position+=relationsize+FILESORT_VARSIZE;
84	}
85
86	SeekFile(relationsx->rfd,size);
87	}
88	else
89	relationsx->rfd=OpenFileNew(relationsx->rfilename);
90
91	return(relationsx);
92	}
93
94
95	/*++++++++++++++++++++++++++++++++++++++
96	Free a relation list.
97
98	RelationsX *relationsx The list to be freed.
99
100	int keep Set to 1 if the file is to be kept.
101	++++++++++++++++++++++++++++++++++++++*/
102
103	void FreeRelationList(RelationsX *relationsx,int keep)
104	{
105	if(!keep)
106	DeleteFile(relationsx->rfilename);
107
108	free(relationsx->rfilename);
109
110	free(relationsx);
111	}
112
113
114	/*++++++++++++++++++++++++++++++++++++++
115	Append a single relation to an unsorted route relation list.
116
117	RelationsX* relationsx The set of relations to process.
118
119	relation_t id The ID of the relation.
120
121	allow_t routes The types of routes that this relation is for.
122
123	way_t *ways The array of ways that are members of the relation.
124
125	int nways The number of ways that are members of the relation.
126
127	relation_t *relations The array of relations that are members of the relation.
128
129	int nrelations The number of relations that are members of the relation.
130	++++++++++++++++++++++++++++++++++++++*/
131
132	void AppendRouteRelation(RelationsX* relationsx,relation_t id,allow_t routes,
133	way_t *ways,int nways,
134	relation_t *relations,int nrelations)
135	{
136	RouteRelX relationx;
137	FILESORT_VARINT size;
138	way_t zeroway=0;
139	relation_t zerorelation=0;
140
141	relationx.id=id;
142	relationx.routes=routes;
143
144	size=sizeof(RouteRelX)+(nways+1)sizeof(way_t)+(nrelations+1)sizeof(relation_t);
145
146	WriteFile(relationsx->rfd,&size,FILESORT_VARSIZE);
147	WriteFile(relationsx->rfd,&relationx,sizeof(RouteRelX));
148
149	WriteFile(relationsx->rfd,ways ,nways*sizeof(way_t));
150	WriteFile(relationsx->rfd,&zeroway, sizeof(way_t));
151
152	WriteFile(relationsx->rfd,relations ,nrelations*sizeof(relation_t));
153	WriteFile(relationsx->rfd,&zerorelation, sizeof(relation_t));
154
155	relationsx->rxnumber++;
156
157	assert(!(relationsx->rxnumber==0)); /* Zero marks the high-water mark for relations. */
158	}
159
160
161	/*++++++++++++++++++++++++++++++++++++++
162	Sort the list of relations.
163
164	RelationsX* relationsx The set of relations to process.
165	++++++++++++++++++++++++++++++++++++++*/
166
167	void SortRelationList(RelationsX* relationsx)
168	{
169	/* Don't need to sort route relations */
170	}
171
172
173	/*++++++++++++++++++++++++++++++++++++++
174	Process the route relations and apply the information to the ways.
175
176	RelationsX *relationsx The set of relations to process.
177
178	WaysX *waysx The set of ways to update.
179	++++++++++++++++++++++++++++++++++++++*/
180
181	void ProcessRouteRelations(RelationsX relationsx,WaysX waysx)
182	{
183	RouteRelX unmatched=NULL,lastunmatched=NULL;
184	int nunmatched=0,lastnunmatched=0,iteration=0;
185	int i,j;
186
187	if(waysx->number==0)
188	return;
189
190	/* Map into memory */
191
192	#if !SLIM
193	waysx->xdata=MapFileWriteable(waysx->filename);
194	#endif
195
196	/* Open the file and read through it */
197
198	relationsx->rfd=ReOpenFile(relationsx->rfilename);
199
200	do
201	{
202	SeekFile(relationsx->rfd,0);
203
204	/* Print the start message */
205
206	printf("Processing Route Relations: Iteration=%d Relations=0",iteration);
207	fflush(stdout);
208
209	for(i=0;i<relationsx->rxnumber;i++)
210	{
211	FILESORT_VARINT size;
212	RouteRelX relationx;
213	way_t wayid;
214	relation_t relationid;
215	allow_t routes=Allow_None;
216
217	/* Read each route relation */
218
219	ReadFile(relationsx->rfd,&size,FILESORT_VARSIZE);
220	ReadFile(relationsx->rfd,&relationx,sizeof(RouteRelX));
221
222	/* Decide what type of route it is */
223
224	if(iteration==0)
225	routes=relationx.routes;
226	else
227	{
228	if((lastunmatched[j].routes\|relationx.routes)==relationx.routes)
229	routes=0; /* Nothing new to add */
230	else
231	for(j=0;j<lastnunmatched;j++)
232	if(lastunmatched[j].id==relationx.id)
233	{
234	routes=lastunmatched[j].routes;
235	break;
236	}
237	}
238
239	/* Loop through the ways */
240
241	do
242	{
243	ReadFile(relationsx->rfd,&wayid,sizeof(way_t));
244
245	/* Update the ways that are listed for the relation */
246
247	if(wayid && routes)
248	{
249	index_t way=IndexWayX(waysx,wayid);
250
251	if(way!=NO_WAY)
252	{
253	WayX *wayx=LookupWayX(waysx,way,1);
254
255	if(routes&Allow_Foot)
256	wayx->way.props\|=Properties_FootRoute;
257
258	if(routes&Allow_Bicycle)
259	wayx->way.props\|=Properties_BicycleRoute;
260
261	#if SLIM
262	PutBackWayX(waysx,way,1);
263	#endif
264	}
265	}
266	}
267	while(wayid);
268
269	/* Loop through the relations */
270
271	do
272	{
273	ReadFile(relationsx->rfd,&relationid,sizeof(relation_t));
274
275	/* Add the relations that are listed for this relation to the list for next time */
276
277	if(relationid && routes && relationid!=relationx.id)
278	{
279	if(nunmatched%256==0)
280	unmatched=(RouteRelX)realloc((void)unmatched,(nunmatched+256)*sizeof(RouteRelX));
281
282	unmatched[nunmatched].id=relationid;
283	unmatched[nunmatched].routes=routes;
284
285	nunmatched++;
286	}
287	}
288	while(relationid);
289
290	if(!((i+1)%10000))
291	{
292	printf("\rProcessing Route Relations: Iteration=%d Relations=%d",iteration,i+1);
293	fflush(stdout);
294	}
295	}
296
297	if(lastunmatched)
298	free(lastunmatched);
299
300	lastunmatched=unmatched;
301	lastnunmatched=nunmatched;
302
303	unmatched=NULL;
304	nunmatched=0;
305
306	/* Print the final message */
307
308	printf("\rProcessed Route Relations: Iteration=%d Relations=%d \n",iteration,relationsx->rxnumber);
309	fflush(stdout);
310	}
311	while(lastnunmatched && ++iteration<5);
312
313	if(lastunmatched)
314	free(lastunmatched);
315
316	CloseFile(relationsx->rfd);
317
318	/* Unmap from memory */
319
320	#if !SLIM
321	waysx->xdata=UnmapFile(waysx->filename);
322	#endif
323	}