source: git/src/diffpos.c @ b6de07d

RELEASE/1.0RELEASE/1.1RELEASE/1.2debug-cidebug-ci-sanitisersfaster-cavernloglog-selectstereowalls-datawalls-data-hanging-as-warning
Last change on this file since b6de07d was 421b7d2, checked in by Olly Betts <olly@…>, 23 years ago

Whitespace preening.

git-svn-id: file:///home/survex-svn/survex/trunk@1660 4b37db11-9a0c-4f06-9ece-9ab7cdaee568

  • Property mode set to 100644
File size: 6.2 KB
Line 
1/* diffpos.c */
2/* Utility to compare two SURVEX .pos or .3d files */
3/* Copyright (C) 1994,1996,1998,1999,2001 Olly Betts
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
18 */
19
20#ifdef HAVE_CONFIG_H
21# include <config.h>
22#endif
23
24#include <stdio.h>
25#include <stdlib.h>
26#include <string.h>
27#include <math.h>
28
29#include "cavern.h" /* just for REAL_EPSILON */
30#include "cmdline.h"
31#include "debug.h"
32#include "filelist.h"
33#include "hash.h"
34#include "img.h"
35#include "namecmp.h"
36
37/* macro to just convert argument to a string */
38#define STRING(X) _STRING(X)
39#define _STRING(X) #X
40
41/* very small value for comparing floating point numbers with */
42#define EPSILON (REAL_EPSILON * 1000)
43
44/* default threshold is 1cm */
45#define DFLT_MAX_THRESHOLD 0.01
46
47static double threshold = DFLT_MAX_THRESHOLD;
48
49static const struct option long_opts[] = {
50   /* const char *name; int has_arg (0 no_argument, 1 required_*, 2 optional_*); int *flag; int val; */
51   {"survey", required_argument, 0, 's'},
52   {"help", no_argument, 0, HLP_HELP},
53   {"version", no_argument, 0, HLP_VERSION},
54   {0, 0, 0, 0}
55};
56
57#define short_opts "s:"
58
59static struct help_msg help[] = {
60/*                              <-- */
61   {HLP_ENCODELONG(0),          "only load the sub-survey with this prefix"},
62   {0, 0}
63};
64
65typedef struct station {
66   struct station *next;
67   char *name;
68   img_point pt;
69} station;
70
71typedef struct added {
72   struct added *next;
73   char *name;
74} added;
75
76static int
77cmp_pname(const void *a, const void *b)
78{
79   return name_cmp(*(const char **)a, *(const char **)b);
80}
81
82static station **htab;
83static bool fChanged = fFalse;
84
85static added *added_list = NULL;
86static OSSIZE_T c_added = 0;
87
88static void
89tree_init(void)
90{
91   size_t i;
92   htab = osmalloc(0x2000 * sizeof(int));
93   for (i = 0; i < 0x2000; i++) htab[i] = NULL;
94}
95
96static void
97tree_insert(const char *name, const img_point *pt)
98{
99   int v = hash_string(name) & 0x1fff;
100   station *stn;
101
102   /* Catch duplicate labels - .3d files shouldn't have them, but some do
103    * due to a couple of bugs in some versions of Survex
104    */
105   for (stn = htab[v]; stn; stn = stn->next) {
106      if (strcmp(stn->name, name) == 0) return; /* found dup */
107   }
108
109   stn = osnew(station);
110   stn->name = osstrdup(name);
111   stn->pt = *pt;
112   stn->next = htab[v];
113   htab[v] = stn;
114}
115
116static void
117tree_remove(const char *name, const img_point *pt)
118{
119   int v = hash_string(name) & 0x1fff;
120   station **prev;
121   station *p;
122
123   for (prev = &htab[v]; *prev; prev = &((*prev)->next)) {
124      if (strcmp((*prev)->name, name) == 0) break;
125   }
126
127   if (!*prev) {
128      added *add = osnew(added);
129      add->name = osstrdup(name);
130      add->next = added_list;
131      added_list = add;
132      c_added++;
133      fChanged = fTrue;
134      return;
135   }
136
137   if (fabs(pt->x - (*prev)->pt.x) - threshold > EPSILON ||
138       fabs(pt->y - (*prev)->pt.y) - threshold > EPSILON ||
139       fabs(pt->z - (*prev)->pt.z) - threshold > EPSILON) {
140      printf(msg(/*Moved by (%3.2f,%3.2f,%3.2f): %s*/500),
141             pt->x - (*prev)->pt.x,
142             pt->y - (*prev)->pt.y,
143             pt->z - (*prev)->pt.z,
144             name);
145      putnl();
146      fChanged = fTrue;
147   }
148
149   osfree((*prev)->name);
150   p = *prev;
151   *prev = p->next;
152   osfree(p);
153}
154
155static int
156tree_check(void)
157{
158   size_t c = 0;
159   char **names;
160   size_t i;
161
162   if (c_added) {
163      names = osmalloc(c_added * ossizeof(char *));
164      for (i = 0; i < c_added; i++) {
165         added *old;
166         ASSERT(added_list);
167         names[i] = added_list->name;
168         old = added_list;
169         added_list = old->next;
170         osfree(old);
171      }
172      ASSERT(added_list == NULL);
173      qsort(names, c_added, sizeof(char *), cmp_pname);
174      for (i = 0; i < c_added; i++) {
175         printf(msg(/*Added: %s*/501), names[i]);
176         putnl();
177         osfree(names[i]);
178      }
179      osfree(names);
180   }
181
182   for (i = 0; i < 0x2000; i++) {
183      station *p;
184      for (p = htab[i]; p; p = p->next) c++;
185   }
186   if (c == 0) return fChanged;
187
188   names = osmalloc(c * ossizeof(char *));
189   c = 0;
190   for (i = 0; i < 0x2000; i++) {
191      station *p;
192      for (p = htab[i]; p; p = p->next) names[c++] = p->name;
193   }
194   qsort(names, c, sizeof(char *), cmp_pname);
195   for (i = 0; i < c; i++) {
196      printf(msg(/*Deleted: %s*/502), names[i]);
197      putnl();
198   }
199   return fTrue;
200}
201
202static void
203parse_file(const char *fnm, const char *survey,
204           void (*tree_func)(const char *, const img_point *))
205{
206   img_point pt;
207   int result;
208
209   img *pimg = img_open_survey(fnm, survey);
210   if (!pimg) fatalerror(img_error(), fnm);
211
212   do {
213      result = img_read_item(pimg, &pt);
214      switch (result) {
215       case img_MOVE:
216       case img_LINE:
217         break;
218       case img_LABEL:
219         tree_func(pimg->label, &pt);
220         break;
221       case img_BAD:
222         img_close(pimg);
223         fatalerror(img_error(), fnm);
224      }
225   } while (result != img_STOP);
226
227   img_close(pimg);
228}
229
230int
231main(int argc, char **argv)
232{
233   char *fnm1, *fnm2;
234   const char *survey = NULL;
235
236   msg_init(argv);
237
238   cmdline_set_syntax_message("FILE1 FILE2 [THRESHOLD]",
239                              "FILE1 and FILE2 can be .pos or .3d files\n"
240                              "THRESHOLD is the max. ignorable change along "
241                              "any axis in metres (default "
242                              STRING(DFLT_MAX_THRESHOLD)")");
243   cmdline_init(argc, argv, short_opts, long_opts, NULL, help, 2, 3);
244   while (1) {
245      int opt = cmdline_getopt();
246      if (opt == EOF) break;
247      if (opt == 's') survey = optarg;
248   }
249   fnm1 = argv[optind++];
250   fnm2 = argv[optind++];
251   if (argv[optind]) {
252      optarg = argv[optind];
253      threshold = cmdline_double_arg();
254   }
255
256   tree_init();
257
258   parse_file(fnm1, survey, tree_insert);
259
260   parse_file(fnm2, survey, tree_remove);
261
262   return tree_check() ? EXIT_FAILURE : EXIT_SUCCESS;
263}
Note: See TracBrowser for help on using the repository browser.