forked from nmap/nmap
-
Notifications
You must be signed in to change notification settings - Fork 0
/
FingerPrintResults.cc
303 lines (259 loc) · 10.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
/***************************************************************************
* 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-2024 Nmap Software LLC ("The Nmap
* Project"). Nmap is also a registered trademark of the Nmap Project.
*
* This program is distributed under the terms of the Nmap Public Source
* License (NPSL). The exact license text applying to a particular Nmap
* release or source code control revision is contained in the LICENSE
* file distributed with that version of Nmap or source code control
* revision. More Nmap copyright/legal information is available from
* https://nmap.org/book/man-legal.html, and further information on the
* NPSL license itself can be found at https://nmap.org/npsl/ . This
* header summarizes some key points from the Nmap license, but is no
* substitute for the actual license text.
*
* Nmap is generally free for end users to download and use themselves,
* including commercial use. It is available from https://nmap.org.
*
* The Nmap license generally prohibits companies from using and
* redistributing Nmap in commercial products, but we sell a special Nmap
* OEM Edition with a more permissive license and special features for
* this purpose. See https://nmap.org/oem/
*
* If you have received a written Nmap license agreement or contract
* stating terms other than these (such as an Nmap OEM license), you may
* choose to use and redistribute Nmap under those terms instead.
*
* The official Nmap Windows builds include the Npcap software
* (https://npcap.com) for packet capture and transmission. It is under
* separate license terms which forbid redistribution without special
* permission. So the official Nmap Windows builds may not be redistributed
* without special permission (such as an Nmap OEM license).
*
* 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.
*
* Source code also allows you to port Nmap to new platforms, fix bugs, and
* add new features. You are highly encouraged to submit your changes as a
* Github PR or by email to the [email protected] mailing list for possible
* incorporation into the main distribution. Unless you specify otherwise, it
* is understood that you are offering us very broad rights to use your
* submissions as described in the Nmap Public Source License Contributor
* Agreement. This is important because we fund the project by selling licenses
* with various terms, and also because the inability to relicense code has
* caused devastating problems for other Free Software projects (such as KDE
* and NASM).
*
* The free version of Nmap 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. Warranties,
* indemnification and commercial support are all available through the
* Npcap OEM program--see https://nmap.org/oem/
*
***************************************************************************/
/* $Id$ */
#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;
distance_calculation_method = DIST_METHOD_NONE;
maxTimingRatio = 0;
incomplete = false;
this->cp = NULL;
}
FingerPrintResults::~FingerPrintResults() {
if (this->cp != NULL)
delete this->cp;
}
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++) {
FPs[i]->erase();
delete(FPs[i]);
FPs[i] = NULL;
}
numFPs = 0;
free(FPs);
}
// Max length string generated by printf("%X", u32)
#define VLEN_MAX (8 + 1)
const char *FingerPrintResults::cp_hex(u32 val) {
if (this->cp == NULL)
this->cp = new CharPool();
char v[VLEN_MAX] = {0};
int vlen = Snprintf(v, VLEN_MAX, "%X", val);
assert(vlen > 0 && vlen < VLEN_MAX);
return this->cp->dup(v, vlen);
}
const char *FingerPrintResults::cp_dup(const char *src, int len) {
if (this->cp == NULL)
this->cp = new CharPool();
return this->cp->dup(src, len);
}
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";
}
if (incomplete) {
return "Some probes failed to send so results incomplete";
}
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;
}
if (osscan_opentcpport <= 0 && osscan_closedtcpport <= 0) {
return "Missing a closed or open TCP port so results incomplete";
}
if (incomplete) {
return "Some probes failed to send so results incomplete";
}
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;
}