1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define TLE struct tle
#define MAX_TLES 20000
TLE
{
char name_line[80], line1[80], line2[80];
};
int n_duplicates = 0, heavens_above_html_tles = 0;
int load_tles_from_file( FILE *ifile, TLE *tles, char *already_found)
{
int rval = 0;
char buff[80], prev_line[80];
*prev_line = '\0';
while( fgets( buff, sizeof( buff), ifile))
{
if( *buff == '1' && heavens_above_html_tles &&
!memcmp( buff + 69, "<B></B>", 7))
strcpy( buff + 69, "\n");
if( *buff == '1' && strlen( buff) > 69 && buff[69] < ' ')
{
char buff2[80];
const int norad_number = atoi( buff + 2);
if( fgets( buff2, sizeof( buff2), ifile))
if( *buff2 == '2' && strlen( buff2) > 69 && buff2[69] < ' ')
{
if( !already_found[norad_number])
{
if( heavens_above_html_tles) /* can't use HA names */
*prev_line = '\0';
strcpy( tles[rval].name_line, prev_line);
strcpy( tles[rval].line1, buff);
strcpy( tles[rval].line2, buff2);
already_found[norad_number] = 1;
rval++;
*buff = '\0';
}
else
n_duplicates++;
}
}
strcpy( prev_line, buff);
}
return( rval);
}
FILE *test_fopen( const char *filename, const char *permits)
{
FILE *rval = fopen( filename, permits);
if( !rval)
{
printf( "%s not opened\n", filename);
exit( -1);
}
return( rval);
}
void show_tle( FILE *ofile, const TLE *tle)
{
fprintf( ofile, "%s", tle->name_line);
fprintf( ofile, "%s", tle->line1);
fprintf( ofile, "%s", tle->line2);
}
static int compare_doubles( const char *buff1, const char *buff2)
{
const double d1 = atof( buff1);
const double d2 = atof( buff2);
int rval;
if( d1 < d2)
rval = -1;
else if( d1 > d2)
rval = 1;
else
rval = 0;
return( rval);
}
int tle_compare( const TLE *tle1, const TLE *tle2, const char sort_method)
{
int i, rval = 0;
switch( sort_method)
{
case 'n': case 'N': /* sort by NORAD number */
for( i = 2; !rval && i < 8; i++)
rval = tle1->line1[i] - tle2->line1[i];
break;
case 'm': case 'M': /* sort by mean motion */
rval = compare_doubles( tle1->line2 + 52, tle2->line2 + 52);
break;
case 'e': case 'E': /* sort by eccentricity */
for( i = 26; !rval && i < 33; i++)
rval = tle1->line2[i] - tle2->line2[i];
break;
case 'p': case 'P': /* sort by epoch */
for( i = 18; !rval && i < 32; i++)
rval = tle1->line1[i] - tle2->line1[i];
break;
}
if( sort_method >= 'A' && sort_method <= 'Z')
rval = -rval;
return( rval);
}
/* MS Windows lacks the re-entrant qsort_r; we have to use */
/* plain old non-re-entrant qsort and a global variable. */
/* BSD has it, but with the wrong order of arguments. */
#ifdef __linux
#define HAVE_REENTRANT_QSORT
#endif
#ifdef HAVE_REENTRANT_QSORT
int tle_compare_for_qsort_r( const void *a, const void *b, void *c)
{
return( tle_compare( (const TLE *)a, (const TLE *)b, *(char *)c));
}
#else
static char comparison_method;
int tle_compare_for_qsort( const void *a, const void *b)
{
return( tle_compare( (const TLE *)a, (const TLE *)b, comparison_method));
}
#endif
static void error_exit( void)
{
printf( "'mergetle' will merge TLEs from one or more files. Optionally,\n");
printf( "the output can be sorted. For example:\n\n");
printf( "mergetle geosynch.tle molniya.tle visual.tle -se -oall.tle\n\n");
printf( "would create a file 'all.tle', containing elements from the three\n");
printf( "input .tle files, sorted by NORAD number. If a satellite appears\n");
printf( "in more than one .tle, the .tle from the first file on the command\n");
printf( "line is used. Options are:\n\n");
printf( "-sn, -sN Sort output by ascending/descending NORAD number\n");
printf( "-sm, -sM Sort output by ascending/descending mean motion\n");
printf( "-se, -sE Sort output by ascending/descending eccentricity\n");
printf( "-sp, -sP Sort output by ascending/descending epoch\n");
printf( "-o(filename) Set name of output .tle file (default is out.tle)\n");
printf( "-n Remove names from input TLEs\n");
printf( "-h Remove HTML tags from input. This allows you to extract\n");
printf( " TLEs from certain Web pages.\n");
exit( -1);
}
int main( const int argc, const char **argv)
{
TLE *tles = (TLE *)calloc( MAX_TLES, sizeof( TLE));
char *already_found = (char *)calloc( 100000, sizeof( char));
int n_found = 0, i, strip_names = 0;
char sort_method = 0;
const char *output_filename = "out.tle";
FILE *ofile;
if( argc < 2)
error_exit( );
for( i = 1; i < argc; i++)
if( argv[i][0] == '-')
switch( argv[i][1])
{
case 'o':
output_filename = argv[i] + 2;
break;
case 's':
sort_method = argv[i][2];
break;
case 'n':
strip_names = 1;
printf( "Names will be removed in output\n");
break;
case 'h':
heavens_above_html_tles = 1;
printf( "HTML tags will be removed from input\n");
break;
default:
printf( "Ignoring unknown option '%s'\n", argv[i]);
break;
}
else
{
FILE *ifile = test_fopen( argv[i], "rb");
int n;
n_duplicates = 0;
n = load_tles_from_file( ifile, tles + n_found, already_found);
printf( "%d TLEs added from %s, with %d duplicates found\n",
n, argv[i], n_duplicates);
n_found += n;
fclose( ifile);
}
free( already_found);
if( strip_names)
for( i = 0; i < n_found; i++)
tles[i].name_line[0] = '\0';
#ifndef HAVE_REENTRANT_QSORT
comparison_method = sort_method;
qsort( tles, n_found, sizeof( TLE), tle_compare_for_qsort);
#else
qsort_r( tles, n_found, sizeof( TLE), tle_compare_for_qsort_r, &sort_method);
#endif
ofile = test_fopen( output_filename, "wb");
for( i = 0; i < n_found; i++)
show_tle( ofile, tles + i);
}
|
