trunk/src/filedumper.c

/***************************************
 $Header: /home/amb/CVS/routino/src/filedumper.c,v 1.11 2009-01-18 16:03:45 amb Exp $

 Memory file dumper.
 ******************/ /******************
 Written by Andrew M. Bishop

 This file Copyright 2008,2009 Andrew M. Bishop
 It may be distributed under the GNU Public License, version 2, or
 any higher version.  See section COPYING of the GNU Public license
 for conditions under which this file may be redistributed.
 ***************************************/


#include <stdio.h>
#include <stdlib.h>

#include "functions.h"


int main(int argc,char** argv)
{
 Nodes    *OSMNodes;
 Ways     *OSMWays;
 Segments *OSMSegments;
 Nodes    *SuperNodes;
 Segments *SuperSegments;
 Ways     *SuperWays;
// int i;
// distance_t longest=0;
// duration_t slowest=0;

 /* Examine the nodes */

 OSMNodes=LoadNodeList("data/nodes.mem");

 printf("Nodes\n");
 printf("-----\n");

 printf("sizeof(Node)=%9d Bytes\n",sizeof(Node));
 printf("number      =%9d\n",OSMNodes->number);
 printf("total size  =%9d Bytes\n",sizeof(OSMNodes)-sizeof(OSMNodes->nodes)+OSMNodes->number*sizeof(Node));

#ifdef NBINS_NODES
// for(i=0;i<=NBINS_NODES;i++)
//    printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
#endif

 /* Examine the ways */

 OSMWays=LoadWayList("data/ways.mem");

 printf("\n");
 printf("Ways\n");
 printf("----\n");

 printf("sizeof(Way) =%9d Bytes\n",sizeof(Way));
 printf("number      =%9d\n",OSMWays->number);
 printf("total size  =%9d Bytes\n",sizeof(OSMWays)-sizeof(OSMWays->ways)+OSMWays->number*sizeof(Way));

#ifdef NBINS_WAYS
// for(i=0;i<=NBINS_WAYS;i++)
//    printf("offset[%4d] is %ld\n",i,OSMWays->offset[i]);
#endif

 /* Examine the segments */

 OSMSegments=LoadSegmentList("data/segments.mem");

 printf("\n");
 printf("Segments\n");
 printf("--------\n");

 printf("sizeof(Segment)=%9d Bytes\n",sizeof(Segment));
 printf("number         =%9d\n",OSMSegments->number);
 printf("total size     =%9d Bytes\n",sizeof(OSMSegments)-sizeof(OSMSegments->segments)+OSMSegments->number*sizeof(Segment));

#ifdef NBINS_NODES
// for(i=0;i<=NBINS_NODES;i++)
//    printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
#endif

// for(i=0;i<OSMSegments->number;i++)
//   {
//    if(OSMSegments->segments[i].distance>longest)
//       longest=OSMSegments->segments[i].distance;
//    if(OSMSegments->segments[i].duration>slowest)
//       slowest=OSMSegments->segments[i].duration;
//   }
//
// printf("Longest distance = %.1f km\n",distance_to_km(longest));
// printf("Longest duration = %.1f min\n",duration_to_minutes(slowest));

 /* Examine the super-nodes */

 SuperNodes=LoadNodeList("data/super-nodes.mem");

 printf("\n");
 printf("SuperNodes\n");
 printf("----------\n");

 printf("sizeof(Node)=%9d Bytes\n",sizeof(Node));
 printf("number      =%9d\n",SuperNodes->number);
 printf("total size  =%9d Bytes\n",sizeof(SuperNodes)-sizeof(SuperNodes->nodes)+SuperNodes->number*sizeof(Node));

#ifdef NBINS_NODES
// for(i=0;i<=NBINS_NODES;i++)
//    printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
#endif

 /* Examine the super-ways */

 SuperWays=LoadWayList("data/super-ways.mem");

 printf("\n");
 printf("Super-Ways\n");
 printf("----------\n");

 printf("sizeof(Way) =%9d Bytes\n",sizeof(Way));
 printf("number      =%9d\n",SuperWays->number);
 printf("total size  =%9d Bytes\n",sizeof(SuperWays)-sizeof(SuperWays->ways)+SuperWays->number*sizeof(Way));

#ifdef NBINS_WAYS
// for(i=0;i<=NBINS_WAYS;i++)
//    printf("offset[%4d] is %ld\n",i,SuperWays->offset[i]);
#endif

 /* Examine the super-segments */

 SuperSegments=LoadSegmentList("data/super-segments.mem");

 printf("\n");
 printf("SuperSegments\n");
 printf("-------------\n");

 printf("sizeof(Segment)=%9d Bytes\n",sizeof(Segment));
 printf("number         =%9d\n",SuperSegments->number);
 printf("total size     =%9d Bytes\n",sizeof(SuperSegments)-sizeof(SuperSegments->segments)+SuperSegments->number*sizeof(Segment));

// for(i=0;i<SuperSegments->number;i++)
//   {
//    if(SuperSegments->segments[i].distance>longest)
//       longest=SuperSegments->segments[i].distance;
//    if(SuperSegments->segments[i].duration>slowest)
//       slowest=SuperSegments->segments[i].duration;
//   }
//
// printf("Longest distance = %.1f km\n",distance_to_km(longest));
// printf("Longest duration = %.1f min\n",duration_to_minutes(slowest));

 return(0);
}
1	amb	2	/***************************************
2	amb	54	$Header: /home/amb/CVS/routino/src/filedumper.c,v 1.11 2009-01-18 16:03:45 amb Exp $
3	amb	2
4			Memory file dumper.
5			****************/ /****************
6			Written by Andrew M. Bishop
7
8	amb	6	This file Copyright 2008,2009 Andrew M. Bishop
9	amb	2	It may be distributed under the GNU Public License, version 2, or
10			any higher version. See section COPYING of the GNU Public license
11			for conditions under which this file may be redistributed.
12			***************************************/
13
14
15			#include <stdio.h>
16			#include <stdlib.h>
17
18			#include "functions.h"
19
20
21			int main(int argc,char** argv)
22			{
23	amb	26	Nodes *OSMNodes;
24			Ways *OSMWays;
25			Segments *OSMSegments;
26	amb	33	Nodes *SuperNodes;
27	amb	26	Segments *SuperSegments;
28	amb	54	Ways *SuperWays;
29	amb	26	// int i;
30			// distance_t longest=0;
31			// duration_t slowest=0;
32	amb	13
33	amb	9	/* Examine the nodes */
34	amb	2
35	amb	26	OSMNodes=LoadNodeList("data/nodes.mem");
36	amb	2
37	amb	6	printf("Nodes\n");
38			printf("-----\n");
39
40	amb	9	printf("sizeof(Node)=%9d Bytes\n",sizeof(Node));
41			printf("number =%9d\n",OSMNodes->number);
42	amb	26	printf("total size =%9d Bytes\n",sizeof(OSMNodes)-sizeof(OSMNodes->nodes)+OSMNodes->number*sizeof(Node));
43	amb	2
44	amb	26	#ifdef NBINS_NODES
45			// for(i=0;i<=NBINS_NODES;i++)
46			// printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
47			#endif
48
49	amb	9	/* Examine the ways */
50	amb	2
51	amb	26	OSMWays=LoadWayList("data/ways.mem");
52	amb	6
53			printf("\n");
54			printf("Ways\n");
55			printf("----\n");
56
57	amb	26	printf("sizeof(Way) =%9d Bytes\n",sizeof(Way));
58			printf("number =%9d\n",OSMWays->number);
59			printf("total size =%9d Bytes\n",sizeof(OSMWays)-sizeof(OSMWays->ways)+OSMWays->number*sizeof(Way));
60	amb	6
61	amb	26	#ifdef NBINS_WAYS
62			// for(i=0;i<=NBINS_WAYS;i++)
63			// printf("offset[%4d] is %ld\n",i,OSMWays->offset[i]);
64			#endif
65
66	amb	9	/* Examine the segments */
67	amb	6
68	amb	26	OSMSegments=LoadSegmentList("data/segments.mem");
69	amb	2
70	amb	6	printf("\n");
71			printf("Segments\n");
72			printf("--------\n");
73
74	amb	9	printf("sizeof(Segment)=%9d Bytes\n",sizeof(Segment));
75			printf("number =%9d\n",OSMSegments->number);
76	amb	26	printf("total size =%9d Bytes\n",sizeof(OSMSegments)-sizeof(OSMSegments->segments)+OSMSegments->number*sizeof(Segment));
77	amb	2
78	amb	26	#ifdef NBINS_NODES
79			// for(i=0;i<=NBINS_NODES;i++)
80			// printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
81			#endif
82	amb	13
83	amb	26	// for(i=0;i<OSMSegments->number;i++)
84			// {
85			// if(OSMSegments->segments[i].distance>longest)
86			// longest=OSMSegments->segments[i].distance;
87			// if(OSMSegments->segments[i].duration>slowest)
88			// slowest=OSMSegments->segments[i].duration;
89			// }
90			//
91			// printf("Longest distance = %.1f km\n",distance_to_km(longest));
92			// printf("Longest duration = %.1f min\n",duration_to_minutes(slowest));
93	amb	13
94	amb	54	/* Examine the super-nodes */
95	amb	31
96	amb	33	SuperNodes=LoadNodeList("data/super-nodes.mem");
97	amb	31
98	amb	49	printf("\n");
99	amb	33	printf("SuperNodes\n");
100			printf("----------\n");
101	amb	31
102			printf("sizeof(Node)=%9d Bytes\n",sizeof(Node));
103	amb	33	printf("number =%9d\n",SuperNodes->number);
104			printf("total size =%9d Bytes\n",sizeof(SuperNodes)-sizeof(SuperNodes->nodes)+SuperNodes->number*sizeof(Node));
105	amb	31
106			#ifdef NBINS_NODES
107			// for(i=0;i<=NBINS_NODES;i++)
108			// printf("offset[%4d] is %ld\n",i,OSMNodes->offset[i]);
109			#endif
110
111	amb	54	/* Examine the super-ways */
112
113			SuperWays=LoadWayList("data/super-ways.mem");
114
115			printf("\n");
116			printf("Super-Ways\n");
117			printf("----------\n");
118
119			printf("sizeof(Way) =%9d Bytes\n",sizeof(Way));
120			printf("number =%9d\n",SuperWays->number);
121			printf("total size =%9d Bytes\n",sizeof(SuperWays)-sizeof(SuperWays->ways)+SuperWays->number*sizeof(Way));
122
123			#ifdef NBINS_WAYS
124			// for(i=0;i<=NBINS_WAYS;i++)
125			// printf("offset[%4d] is %ld\n",i,SuperWays->offset[i]);
126			#endif
127
128	amb	15	/* Examine the super-segments */
129
130	amb	26	SuperSegments=LoadSegmentList("data/super-segments.mem");
131	amb	15
132			printf("\n");
133			printf("SuperSegments\n");
134			printf("-------------\n");
135
136	amb	26	printf("sizeof(Segment)=%9d Bytes\n",sizeof(Segment));
137			printf("number =%9d\n",SuperSegments->number);
138			printf("total size =%9d Bytes\n",sizeof(SuperSegments)-sizeof(SuperSegments->segments)+SuperSegments->number*sizeof(Segment));
139	amb	15
140	amb	26	// for(i=0;i<SuperSegments->number;i++)
141			// {
142			// if(SuperSegments->segments[i].distance>longest)
143			// longest=SuperSegments->segments[i].distance;
144			// if(SuperSegments->segments[i].duration>slowest)
145			// slowest=SuperSegments->segments[i].duration;
146			// }
147			//
148			// printf("Longest distance = %.1f km\n",distance_to_km(longest));
149			// printf("Longest duration = %.1f min\n",duration_to_minutes(slowest));
150	amb	15
151	amb	2	return(0);
152			}