-
Notifications
You must be signed in to change notification settings - Fork 1
/
FingerPrintResults.cc
333 lines (292 loc) · 15.6 KB
/
FingerPrintResults.cc
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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
/***************************************************************************
* FingerPrintResults.cc -- The FingerPrintResults class the results of OS *
* fingerprint matching against a certain host. *
* *
***********************IMPORTANT NMAP LICENSE TERMS************************
* *
* The Nmap Security Scanner is (C) 1996-2013 Insecure.Com LLC. Nmap is *
* also a registered trademark of Insecure.Com LLC. This program is free *
* software; you may redistribute and/or modify it under the terms of the *
* GNU General Public License as published by the Free Software *
* Foundation; Version 2 ("GPL"), BUT ONLY WITH ALL OF THE CLARIFICATIONS *
* AND EXCEPTIONS DESCRIBED HEREIN. This guarantees your right to use, *
* modify, and redistribute this software under certain conditions. If *
* you wish to embed Nmap technology into proprietary software, we sell *
* alternative licenses (contact [email protected]). Dozens of software *
* vendors already license Nmap technology such as host discovery, port *
* scanning, OS detection, version detection, and the Nmap Scripting *
* Engine. *
* *
* Note that the GPL places important restrictions on "derivative works", *
* yet it does not provide a detailed definition of that term. To avoid *
* misunderstandings, we interpret that term as broadly as copyright law *
* allows. For example, we consider an application to constitute a *
* derivative work for the purpose of this license if it does any of the *
* following with any software or content covered by this license *
* ("Covered Software"): *
* *
* o Integrates source code from Covered Software. *
* *
* o Reads or includes copyrighted data files, such as Nmap's nmap-os-db *
* or nmap-service-probes. *
* *
* o Is designed specifically to execute Covered Software and parse the *
* results (as opposed to typical shell or execution-menu apps, which will *
* execute anything you tell them to). *
* *
* o Includes Covered Software in a proprietary executable installer. The *
* installers produced by InstallShield are an example of this. Including *
* Nmap with other software in compressed or archival form does not *
* trigger this provision, provided appropriate open source decompression *
* or de-archiving software is widely available for no charge. For the *
* purposes of this license, an installer is considered to include Covered *
* Software even if it actually retrieves a copy of Covered Software from *
* another source during runtime (such as by downloading it from the *
* Internet). *
* *
* o Links (statically or dynamically) to a library which does any of the *
* above. *
* *
* o Executes a helper program, module, or script to do any of the above. *
* *
* This list is not exclusive, but is meant to clarify our interpretation *
* of derived works with some common examples. Other people may interpret *
* the plain GPL differently, so we consider this a special exception to *
* the GPL that we apply to Covered Software. Works which meet any of *
* these conditions must conform to all of the terms of this license, *
* particularly including the GPL Section 3 requirements of providing *
* source code and allowing free redistribution of the work as a whole. *
* *
* As another special exception to the GPL terms, Insecure.Com LLC grants *
* permission to link the code of this program with any version of the *
* OpenSSL library which is distributed under a license identical to that *
* listed in the included docs/licenses/OpenSSL.txt file, and distribute *
* linked combinations including the two. *
* *
* Any redistribution of Covered Software, including any derived works, *
* must obey and carry forward all of the terms of this license, including *
* obeying all GPL rules and restrictions. For example, source code of *
* the whole work must be provided and free redistribution must be *
* allowed. All GPL references to "this License", are to be treated as *
* including the terms and conditions of this license text as well. *
* *
* Because this license imposes special exceptions to the GPL, Covered *
* Work may not be combined (even as part of a larger work) with plain GPL *
* software. The terms, conditions, and exceptions of this license must *
* be included as well. This license is incompatible with some other open *
* source licenses as well. In some cases we can relicense portions of *
* Nmap or grant special permissions to use it in other open source *
* software. Please contact [email protected] with any such requests. *
* Similarly, we don't incorporate incompatible open source software into *
* Covered Software without special permission from the copyright holders. *
* *
* If you have any questions about the licensing restrictions on using *
* Nmap in other works, are happy to help. As mentioned above, we also *
* offer alternative license to integrate Nmap into proprietary *
* applications and appliances. These contracts have been sold to dozens *
* of software vendors, and generally include a perpetual license as well *
* as providing for priority support and updates. They also fund the *
* continued development of Nmap. Please email [email protected] for further *
* information. *
* *
* If you have received a written license agreement or contract for *
* Covered Software stating terms other than these, you may choose to use *
* and redistribute Covered Software under those terms instead of these. *
* *
* Source is provided to this software because we believe users have a *
* right to know exactly what a program is going to do before they run it. *
* This also allows you to audit the software for security holes (none *
* have been found so far). *
* *
* Source code also allows you to port Nmap to new platforms, fix bugs, *
* and add new features. You are highly encouraged to send your changes *
* to the [email protected] mailing list for possible incorporation into the *
* main distribution. By sending these changes to Fyodor or one of the *
* Insecure.Org development mailing lists, or checking them into the Nmap *
* source code repository, it is understood (unless you specify otherwise) *
* that you are offering the Nmap Project (Insecure.Com LLC) the *
* unlimited, non-exclusive right to reuse, modify, and relicense the *
* code. Nmap will always be available Open Source, but this is important *
* because the inability to relicense code has caused devastating problems *
* for other Free Software projects (such as KDE and NASM). We also *
* occasionally relicense the code to third parties as discussed above. *
* If you wish to specify special license conditions of your *
* contributions, just say so when you send them. *
* *
* 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 Nmap *
* license file for more details (it's in a COPYING file included with *
* Nmap, and also available from https://svn.nmap.org/nmap/COPYING *
* *
***************************************************************************/
/* $Id: FingerPrintResults.cc 32741 2014-02-20 18:44:12Z dmiller $ */
#include "FingerPrintResults.h"
#include "osscan.h"
#include "NmapOps.h"
extern NmapOps o;
FingerPrintResults::FingerPrintResults() {
num_perfect_matches = num_matches = 0;
overall_results = OSSCAN_NOMATCHES;
memset(accuracy, 0, sizeof(accuracy));
isClassified = false;
osscan_opentcpport = osscan_closedtcpport = osscan_closedudpport = -1;
distance = -1;
distance_guess = -1;
maxTimingRatio = 0;
}
FingerPrintResults::~FingerPrintResults() {
}
FingerPrintResultsIPv4::FingerPrintResultsIPv4() {
FPs = (FingerPrint **) safe_zalloc(o.maxOSTries() * sizeof(FingerPrint *));
numFPs = 0;
}
FingerPrintResultsIPv4::~FingerPrintResultsIPv4() {
int i;
/* Free OS fingerprints of OS scanning was done */
for(i=0; i < numFPs; i++) {
delete(FPs[i]);
FPs[i] = NULL;
}
numFPs = 0;
free(FPs);
}
FingerPrintResultsIPv6::FingerPrintResultsIPv6() {
unsigned int i;
begin_time.tv_sec = 0;
begin_time.tv_usec = 0;
for (i = 0; i < sizeof(fp_responses) / sizeof(*fp_responses); i++)
fp_responses[i] = NULL;
flow_label = 0;
}
FingerPrintResultsIPv6::~FingerPrintResultsIPv6() {
unsigned int i;
for (i = 0; i < sizeof(fp_responses) / sizeof(*fp_responses); i++) {
if (fp_responses[i])
delete fp_responses[i];
}
}
const struct OS_Classification_Results *FingerPrintResults::getOSClassification() {
if (!isClassified) { populateClassification(); isClassified = true; }
return &OSR;
}
/* If the fingerprint is of potentially poor quality, we don't want to
print it and ask the user to submit it. In that case, the reason
for skipping the FP is returned as a static string. If the FP is
great and should be printed, NULL is returned. */
const char *FingerPrintResults::OmitSubmissionFP() {
static char reason[128];
if (o.scan_delay > 500) { // This can screw up the sequence timing
Snprintf(reason, sizeof(reason), "Scan delay (%d) is greater than 500", o.scan_delay);
return reason;
}
if (o.timing_level > 4)
return "Timing level 5 (Insane) used";
if (osscan_opentcpport <= 0)
return "Missing an open TCP port so results incomplete";
if (osscan_closedtcpport <= 0)
return "Missing a closed TCP port so results incomplete";
/* This can happen if the TTL in the response to the UDP probe is somehow
greater than the TTL in the probe itself. We exclude -1 because that is
used to mean the distance is unknown, though there's a chance it could
have come from the distance calculation. */
if (distance < -1) {
Snprintf(reason, sizeof(reason), "Host distance (%d network hops) appears to be negative", distance);
return reason;
}
if (distance > 5) {
Snprintf(reason, sizeof(reason), "Host distance (%d network hops) is greater than five", distance);
return reason;
}
if (maxTimingRatio > 1.4) {
Snprintf(reason, sizeof(reason), "maxTimingRatio (%e) is greater than 1.4", maxTimingRatio);
return reason;
}
if (osscan_closedudpport < 0 && !o.udpscan) {
/* If we didn't get a U1 response, that might be just
because we didn't search for an closed port rather than
because this OS doesn't respond to that sort of probe.
So we don't print FP if U1 response is lacking AND no UDP
scan was performed. */
return "Didn't receive UDP response. Please try again with -sSU";
}
return NULL;
}
/* IPv6 classification is more robust to errors than IPv4, so apply less
stringent conditions than the general OmitSubmissionFP. */
const char *FingerPrintResultsIPv6::OmitSubmissionFP() {
static char reason[128];
if (o.scan_delay > 500) { // This can screw up the sequence timing
Snprintf(reason, sizeof(reason), "Scan delay (%d) is greater than 500", o.scan_delay);
return reason;
}
return NULL;
}
/* Goes through fingerprinting results to populate OSR */
void FingerPrintResults::populateClassification() {
std::vector<OS_Classification>::iterator osclass;
int printno;
OSR.OSC_num_perfect_matches = OSR.OSC_num_matches = 0;
OSR.overall_results = OSSCAN_SUCCESS;
if (overall_results == OSSCAN_TOOMANYMATCHES) {
// The normal classification overflowed so we don't even have all the perfect matches,
// I don't see any good reason to do classification.
OSR.overall_results = OSSCAN_TOOMANYMATCHES;
return;
}
for(printno = 0; printno < num_matches; printno++) {
// a single print may have multiple classifications
for (osclass = matches[printno]->OS_class.begin();
osclass != matches[printno]->OS_class.end();
osclass++) {
if (!classAlreadyExistsInResults(&*osclass)) {
// Then we have to add it ... first ensure we have room
if (OSR.OSC_num_matches == MAX_FP_RESULTS) {
// Out of space ... if the accuracy of this one is 100%, we have a problem
if (printno < num_perfect_matches)
OSR.overall_results = OSSCAN_TOOMANYMATCHES;
return;
}
// We have space, but do we even want this one? No point
// including lesser matches if we have 1 or more perfect
// matches.
if (OSR.OSC_num_perfect_matches > 0 && printno >= num_perfect_matches) {
return;
}
// OK, we will add the new class
OSR.OSC[OSR.OSC_num_matches] = &*osclass;
OSR.OSC_Accuracy[OSR.OSC_num_matches] = accuracy[printno];
if (printno < num_perfect_matches)
OSR.OSC_num_perfect_matches++;
OSR.OSC_num_matches++;
}
}
}
if (OSR.OSC_num_matches == 0)
OSR.overall_results = OSSCAN_NOMATCHES;
return;
}
/* Return true iff s and t are both NULL or both the same string. */
static bool strnulleq(const char *s, const char *t) {
if (s == NULL && t == NULL)
return true;
else if (s == NULL || t == NULL)
return false;
else
return strcmp(s, t) == 0;
}
// Go through any previously entered classes to see if this is a dupe;
bool FingerPrintResults::classAlreadyExistsInResults(struct OS_Classification *OSC) {
int i;
for (i=0; i < OSR.OSC_num_matches; i++) {
if (strnulleq(OSC->OS_Vendor, OSR.OSC[i]->OS_Vendor) &&
strnulleq(OSC->OS_Family, OSR.OSC[i]->OS_Family) &&
strnulleq(OSC->Device_Type, OSR.OSC[i]->Device_Type) &&
strnulleq(OSC->OS_Generation, OSR.OSC[i]->OS_Generation)) {
// Found a duplicate!
return true;
}
}
// Went through all the results -- no duplicates found
return false;
}