src/netbits.h

   1 /* netbits.h
   2  * Header file for miscellaneous primitive network routines for Survex
   3  * Copyright (C) 1994,1997,1998,2001,2006,2015 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
  18  */
  19
  20 void clear_last_leg(void);
  21
  22 node *StnFromPfx(prefix *name);
  23
  24 linkfor *copy_link(linkfor *leg);
  25 linkfor *addto_link(linkfor *leg, const linkfor *leg2);
  26
  27 void addlegbyname(prefix *fr_name, prefix *to_name, bool fToFirst,
  28                   real dx, real dy, real dz, real vx, real vy, real vz
  29 #ifndef NO_COVARIANCES
  30                   , real cyz, real czx, real cxy
  31 #endif
  32                   );
  33
  34 void process_equate(prefix *name1, prefix *name2);
  35
  36 void addfakeleg(node *fr, node *to,
  37                 real dx, real dy, real dz, real vx, real vy, real vz
  38 #ifndef NO_COVARIANCES
  39                 , real cyz, real czx, real cxy
  40 #endif
  41                 );
  42
  43 /* insert at head of double-linked list */
  44 void add_stn_to_list(node **list, node *stn);
  45
  46 /* remove from double-linked list */
  47 void remove_stn_from_list(node **list, node *stn);
  48
  49 /* one node must only use leg[0] */
  50 #define one_node(S) (!(S)->leg[1] && (S)->leg[0])
  51
  52 /* two node must only use leg[0] and leg[1] */
  53 #define two_node(S) (!(S)->leg[2] && (S)->leg[1])
  54
  55 /* three node iff it uses leg[2] */
  56 #define three_node(S) ((S)->leg[2])
  57
  58 /* NB FOR_EACH_STN() can't be nested - but it's hard to police as we can't
  59  * easily set stn_iter to NULL if the loop is exited with break */
  60
  61 /* Need stn_iter so we can adjust iterator if the stn it points to is deleted */
  62 extern node *stn_iter;
  63 #define FOR_EACH_STN(S,L) \
  64  for (stn_iter = (L); ((S) = stn_iter) != NULL;\
  65  stn_iter = ((S) == stn_iter) ? stn_iter->next : stn_iter)
  66
  67 #define print_prefix(N) fprint_prefix(stdout, (N))
  68
  69 char *sprint_prefix(const prefix *ptr);
  70 void fprint_prefix(FILE *fh, const prefix *ptr);
  71
  72 /* r = ab ; r,a,b are variance matrices */
  73 void mulss(var *r, /*const*/ svar *a, /*const*/ svar *b);
  74
  75 #ifdef NO_COVARIANCES
  76 /* In the NO_COVARIANCES case, v and s are the same so we only need one
  77  * version. */
  78 # define smulvs(R,A,B) mulss(R,A,B)
  79 #else
  80 /* r = ab ; r,a,b are variance matrices */
  81 void smulvs(svar *r, /*const*/ var *a, /*const*/ svar *b);
  82 #endif
  83
  84 /* r = ab ; r,b delta vectors; a variance matrix */
  85 void mulsd(delta *r, /*const*/ svar *a, /*const*/ delta *b);
  86
  87 /* r = ca ; r,a variance matrices; c real scaling factor  */
  88 void mulsc(svar *r, /*const*/ svar *a, real c);
  89
  90 /* r = a + b ; r,a,b delta vectors */
  91 void adddd(delta *r, /*const*/ delta *a, /*const*/ delta *b);
  92
  93 /* r = a - b ; r,a,b delta vectors */
  94 void subdd(delta *r, /*const*/ delta *a, /*const*/ delta *b);
  95
  96 /* r = a + b ; r,a,b variance matrices */
  97 void addss(svar *r, /*const*/ svar *a, /*const*/ svar *b);
  98
  99 /* r = a - b ; r,a,b variance matrices */
 100 void subss(svar *r, /*const*/ svar *a, /*const*/ svar *b);
 101
 102 /* r = (b^-1)a ; r,a delta vectors; b variance matrix */
 103 void divds(delta *r, /*const*/ delta *a, /*const*/ svar *b);
 104
 105 /* inv = v^-1 ; inv,v variance matrices */
 106 int invert_svar(svar *inv, /*const*/ svar *v);
 107
 108 /* Is v zero? */
 109 bool fZeros(/*const*/ svar *v);
 110
 111 #define PR "%8.6f"
 112
 113 #ifdef NO_COVARIANCES
 114 # define print_var(V) printf("("PR","PR","PR")\n", (V)[0], (V)[1], (V)[2])
 115 # define print_svar(V) printf("("PR","PR","PR")\n", (V)[0], (V)[1], (V)[2])
 116 #else
 117 # define print_var(V) \
 118 printf("/"PR","PR","PR"\\\n|"PR","PR","PR"|\n\\"PR","PR","PR"/\n",\
 119 (V)[0][0], (V)[0][1], (V)[0][2],\
 120 (V)[1][0], (V)[1][1], (V)[1][2],\
 121 (V)[2][0], (V)[2][1], (V)[2][2])
 122 # define print_svar(V) \
 123 printf("/"PR","PR","PR"\\\n:"PR","PR","PR":\n\\"PR","PR","PR"/\n",\
 124 (V)[0], (V)[3], (V)[4],\
 125 (V)[3], (V)[1], (V)[5],\
 126 (V)[4], (V)[5], (V)[2])
 127 #endif
 128
 129 #define print_d(D) printf("("PR","PR","PR")", (D)[0], (D)[1], (D)[2])