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 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784
|
/***************************************************************************
* portlist.cc -- Functions for manipulating various lists of ports *
* maintained internally by Nmap. *
* *
***********************IMPORTANT NMAP LICENSE TERMS************************
* *
* The Nmap Security Scanner is (C) 1996-2004 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. 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 may be *
* willing to sell alternative licenses (contact sales@insecure.com). *
* Many security scanner vendors already license Nmap technology such as *
* our remote OS fingerprinting database and code, service/version *
* detection system, and port scanning code. *
* *
* Note that the GPL places important restrictions on "derived works", yet *
* it does not provide a detailed definition of that term. To avoid *
* misunderstandings, we consider an application to constitute a *
* "derivative work" for the purpose of this license if it does any of the *
* following: *
* o Integrates source code from Nmap *
* o Reads or includes Nmap copyrighted data files, such as *
* nmap-os-fingerprints or nmap-service-probes. *
* o Executes Nmap and parses the results (as opposed to typical shell or *
* execution-menu apps, which simply display raw Nmap output and so are *
* not derivative works.) *
* o Integrates/includes/aggregates Nmap into a proprietary executable *
* installer, such as those produced by InstallShield. *
* o Links to a library or executes a program that does any of the above *
* *
* The term "Nmap" should be taken to also include any portions or derived *
* works of Nmap. This list is not exclusive, but is just meant to *
* clarify our interpretation of derived works with some common examples. *
* These restrictions only apply when you actually redistribute Nmap. For *
* example, nothing stops you from writing and selling a proprietary *
* front-end to Nmap. Just distribute it by itself, and point people to *
* http://www.insecure.org/nmap/ to download Nmap. *
* *
* We don't consider these to be added restrictions on top of the GPL, but *
* just a clarification of how we interpret "derived works" as it applies *
* to our GPL-licensed Nmap product. This is similar to the way Linus *
* Torvalds has announced his interpretation of how "derived works" *
* applies to Linux kernel modules. Our interpretation refers only to *
* Nmap - we don't speak for any other GPL products. *
* *
* If you have any questions about the GPL licensing restrictions on using *
* Nmap in non-GPL works, we would be 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 many *
* security vendors, and generally include a perpetual license as well as *
* providing for priority support and updates as well as helping to fund *
* the continued development of Nmap technology. Please email *
* sales@insecure.com for further information. *
* *
* As a 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 Copying.OpenSSL file, and distribute linked *
* combinations including the two. You must obey the GNU GPL in all *
* respects for all of the code used other than OpenSSL. If you modify *
* this file, you may extend this exception to your version of the file, *
* but you are not obligated to do so. *
* *
* If you received these files with a written license agreement or *
* contract stating terms other than the terms above, then that *
* alternative license agreement takes precedence over these comments. *
* *
* 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 fyodor@insecure.org for possible incorporation into the main *
* distribution. By sending these changes to Fyodor or one the *
* Insecure.Org development mailing lists, it is assumed that you are *
* offering Fyodor and 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 GNU *
* General Public License for more details at *
* http://www.gnu.org/copyleft/gpl.html , or in the COPYING file included *
* with Nmap. *
* *
***************************************************************************/
/* $Id: portlist.cc 3355 2006-05-15 22:37:31Z fyodor $ */
#include "portlist.h"
#include "nmap_error.h"
#include "nmap.h"
#include "NmapOps.h"
using namespace std;
#if HAVE_STRINGS_H
#include <strings.h>
#endif /* HAVE_STRINGS_H */
extern NmapOps o; /* option structure */
Port::Port() {
portno = proto = 0;
owner = NULL;
rpc_status = RPC_STATUS_UNTESTED;
rpc_program = rpc_lowver = rpc_highver = 0;
state = confidence = 0;
next = NULL;
serviceprobe_results = PROBESTATE_INITIAL;
serviceprobe_service = NULL;
serviceprobe_product = serviceprobe_version = serviceprobe_extrainfo = NULL;
serviceprobe_hostname = serviceprobe_ostype = serviceprobe_devicetype = NULL;
serviceprobe_tunnel = SERVICE_TUNNEL_NONE;
serviceprobe_fp = NULL;
}
Port::~Port() {
if (owner)
free(owner);
if (serviceprobe_product)
free(serviceprobe_product);
if (serviceprobe_version)
free(serviceprobe_version);
if (serviceprobe_extrainfo)
free(serviceprobe_extrainfo);
if (serviceprobe_hostname)
free(serviceprobe_hostname);
if (serviceprobe_ostype)
free(serviceprobe_ostype);
if (serviceprobe_devicetype)
free(serviceprobe_devicetype);
if (serviceprobe_service)
free(serviceprobe_service);
if (serviceprobe_fp)
free(serviceprobe_fp);
}
// Uses the sd->{product,version,extrainfo} if available to fill
// out sd->fullversion. If unavailable, it will be set to zero length.
static void populateFullVersionString(struct serviceDeductions *sd) {
char *dst = sd->fullversion;
unsigned int spaceleft = sizeof(sd->fullversion) - 1;
dst[0] = '\0';
if (sd->product && spaceleft >= strlen(sd->product)) {
strncat(dst, sd->product, spaceleft);
spaceleft -= strlen(sd->product);
}
if (sd->version && spaceleft >= (strlen(sd->version) + 1)) {
strncat(dst, " ", spaceleft);
strncat(dst, sd->version, spaceleft);
spaceleft -= strlen(sd->version) + 1;
}
if (sd->extrainfo && spaceleft >= (strlen(sd->extrainfo) + 3)) {
strncat(dst, " (", spaceleft);
strncat(dst, sd->extrainfo, spaceleft);
strncat(dst, ")", spaceleft);
spaceleft -= strlen(sd->extrainfo) + 3;
}
}
// pass in an allocated struct serviceDeductions (don't worry about
// initializing, and you don't have to free any internal ptrs. See the
// serviceDeductions definition for the fields that are populated.
// Returns 0 if at least a name is available.
int Port::getServiceDeductions(struct serviceDeductions *sd) {
struct servent *service;
assert(sd);
memset(sd, 0, sizeof(struct serviceDeductions));
sd->service_fp = serviceprobe_fp;
sd->service_tunnel = serviceprobe_tunnel;
sd->rpc_status = rpc_status;
sd->rpc_program = rpc_program;
sd->rpc_lowver = rpc_lowver;
sd->rpc_highver = rpc_highver;
// First priority is RPC
if (rpc_status == RPC_STATUS_UNKNOWN || rpc_status == RPC_STATUS_GOOD_PROG ) {
assert(serviceprobe_service);
sd->name = serviceprobe_service;
sd->name_confidence = (rpc_status == RPC_STATUS_UNKNOWN)? 8 : 10;
sd->dtype = SERVICE_DETECTION_PROBED; // RPC counts as probed
sd->version = serviceprobe_version;
sd->extrainfo = serviceprobe_extrainfo;
sd->hostname = serviceprobe_hostname;
sd->ostype = serviceprobe_ostype;
sd->devicetype = serviceprobe_devicetype;
populateFullVersionString(sd);
return 0;
} else if (serviceprobe_results == PROBESTATE_FINISHED_HARDMATCHED
|| serviceprobe_results == PROBESTATE_FINISHED_SOFTMATCHED) {
assert(serviceprobe_service);
sd->dtype = SERVICE_DETECTION_PROBED;
sd->name = serviceprobe_service;
sd->name_confidence = 10;
sd->product = serviceprobe_product;
sd->version = serviceprobe_version;
sd->extrainfo = serviceprobe_extrainfo;
sd->hostname = serviceprobe_hostname;
sd->ostype = serviceprobe_ostype;
sd->devicetype = serviceprobe_devicetype;
populateFullVersionString(sd);
return 0;
} else if (serviceprobe_results == PROBESTATE_EXCLUDED) {
service = nmap_getservbyport(htons(portno), (proto == IPPROTO_TCP)? "tcp" : "udp");
if (service) sd->name = service->s_name;
sd->name_confidence = 2; // Since we didn't even check it, we aren't very confident
sd->dtype = SERVICE_DETECTION_TABLE;
sd->product = serviceprobe_product; // Should have a string that says port was excluded
populateFullVersionString(sd);
return 0;
} else if (serviceprobe_results == PROBESTATE_FINISHED_TCPWRAPPED) {
sd->dtype = SERVICE_DETECTION_PROBED;
sd->name = "tcpwrapped";
sd->name_confidence = 8;
return 0;
}
// So much for service detection or RPC. Maybe we can find it in the file
service = nmap_getservbyport(htons(portno), (proto == IPPROTO_TCP)? "tcp" : "udp");
if (service) {
sd->dtype = SERVICE_DETECTION_TABLE;
sd->name = service->s_name;
sd->name_confidence = 3;
return 0;
}
// Couldn't find it. [shrug]
return -1;
}
// sname should be NULL if sres is not
// PROBESTATE_FINISHED_MATCHED. product,version, and/or extrainfo
// will be NULL if unavailable. Note that this function makes its
// own copy of sname and product/version/extrainfo. This function
// also takes care of truncating the version strings to a
// 'reasonable' length if neccessary, and cleaning up any unprintable
// chars. (these tests are to avoid annoying DOS (or other) attacks
// by malicious services). The fingerprint should be NULL unless
// one is available and the user should submit it. tunnel must be
// SERVICE_TUNNEL_NULL (normal) or SERVICE_TUNNEL_SSL (means ssl was
// detected and we tried to tunnel through it ).
void Port::setServiceProbeResults(enum serviceprobestate sres,
const char *sname,
enum service_tunnel_type tunnel,
const char *product, const char *version,
const char *extrainfo, const char *hostname,
const char *ostype, const char *devicetype,
const char *fingerprint) {
int slen;
serviceprobe_results = sres;
unsigned char *p;
serviceprobe_tunnel = tunnel;
if (sname) serviceprobe_service = strdup(sname);
if (fingerprint) serviceprobe_fp = strdup(fingerprint);
if (product) {
slen = strlen(product);
if (slen > 64) slen = 64;
serviceprobe_product = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_product, product, slen);
serviceprobe_product[slen] = '\0';
p = (unsigned char *) serviceprobe_product;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
if (version) {
slen = strlen(version);
if (slen > 64) slen = 64;
serviceprobe_version = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_version, version, slen);
serviceprobe_version[slen] = '\0';
p = (unsigned char *) serviceprobe_version;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
if (extrainfo) {
slen = strlen(extrainfo);
if (slen > 128) slen = 128;
serviceprobe_extrainfo = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_extrainfo, extrainfo, slen);
serviceprobe_extrainfo[slen] = '\0';
p = (unsigned char *) serviceprobe_extrainfo;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
if (hostname) {
slen = strlen(hostname);
if (slen > 64) slen = 64;
serviceprobe_hostname = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_hostname, hostname, slen);
serviceprobe_hostname[slen] = '\0';
p = (unsigned char *) serviceprobe_hostname;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
if (ostype) {
slen = strlen(ostype);
if (slen > 64) slen = 64;
serviceprobe_ostype = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_ostype, ostype, slen);
serviceprobe_ostype[slen] = '\0';
p = (unsigned char *) serviceprobe_ostype;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
if (devicetype) {
slen = strlen(devicetype);
if (slen > 64) slen = 64;
serviceprobe_devicetype = (char *) safe_malloc(slen + 1);
memcpy(serviceprobe_devicetype, devicetype, slen);
serviceprobe_devicetype[slen] = '\0';
p = (unsigned char *) serviceprobe_devicetype;
while(*p) {
if (!isprint((int)*p)) *p = '.';
p++;
}
}
}
/* Sets the results of an RPC scan. if rpc_status is not
RPC_STATUS_GOOD_PROGRAM, pass 0 for the other args. This function
takes care of setting the port's service and version appropriately. */
void Port::setRPCProbeResults(int rpcs, unsigned long rpcp,
unsigned int rpcl, unsigned int rpch) {
rpc_status = rpcs;
const char *newsvc;
char verbuf[128];
rpc_status = rpcs;
if (rpc_status == RPC_STATUS_GOOD_PROG) {
rpc_program = rpcp;
rpc_lowver = rpcl;
rpc_highver = rpch;
// Now set the service/version info
newsvc = nmap_getrpcnamebynum(rpcp);
if (!newsvc) newsvc = "rpc.unknownprog"; // should never happen
if (serviceprobe_service)
free(serviceprobe_service);
serviceprobe_service = strdup(newsvc);
serviceprobe_product = strdup(newsvc);
if (rpc_lowver == rpc_highver)
snprintf(verbuf, sizeof(verbuf), "%i", rpc_lowver);
else
snprintf(verbuf, sizeof(verbuf), "%i-%i", rpc_lowver, rpc_highver);
serviceprobe_version = strdup(verbuf);
snprintf(verbuf, sizeof(verbuf), "rpc #%li", rpc_program);
serviceprobe_extrainfo = strdup(verbuf);
} else if (rpc_status == RPC_STATUS_UNKNOWN) {
if (serviceprobe_service)
free(serviceprobe_service);
serviceprobe_service = strdup("rpc.unknown");
}
}
/*****************************************************************************/
/* Convert protocol name from in.h to enum portlist_proto.
* So IPPROTO_TCP will be changed to PORTLIST_PROTO_TCP and so on. */
#define INPROTO2PORTLISTPROTO(p) \
((p)==IPPROTO_TCP ? PORTLIST_PROTO_TCP : \
(p)==IPPROTO_UDP ? PORTLIST_PROTO_UDP : \
PORTLIST_PROTO_IP)
PortList::PortList() {
int proto;
memset(state_counts_proto, 0, sizeof(state_counts_proto));
memset(port_list, 0, sizeof(port_list));
for(proto=0; proto < PORTLIST_PROTO_MAX; proto++) {
if(port_list_count[proto] > 0)
port_list[proto] = (Port**) safe_zalloc(sizeof(Port*)*port_list_count[proto]);
}
numports = 0;
idstr = NULL;
}
PortList::~PortList() {
int proto, i;
if (idstr) {
free(idstr);
idstr = NULL;
}
for(proto=0; proto < PORTLIST_PROTO_MAX; proto++) { // for every protocol
if(port_list[proto]) {
for(i=0; i < port_list_count[proto]; i++) { // free every Port
if(port_list[proto][i])
delete port_list[proto][i];
}
free(port_list[proto]);
}
}
}
int PortList::addPort(u16 portno, u8 protocol, char *owner, int state) {
Port *current;
char msg[128];
int proto = INPROTO2PORTLISTPROTO(protocol);
assert(state < PORT_HIGHEST_STATE);
if ((state == PORT_OPEN && o.verbose) || (o.debugging > 1)) {
if (owner && *owner) {
snprintf(msg, sizeof(msg), " (owner: %s)", owner);
} else msg[0] = '\0';
log_write(LOG_STDOUT, "Discovered %s port %hu/%s%s%s\n",
statenum2str(state), portno,
proto2ascii(protocol), msg, idstr? idstr : "");
log_flush(LOG_STDOUT);
}
/* Make sure state is OK */
if (state != PORT_OPEN && state != PORT_CLOSED && state != PORT_FILTERED &&
state != PORT_UNFILTERED && state != PORT_OPENFILTERED &&
state != PORT_CLOSEDFILTERED)
fatal("addPort: attempt to add port number %d with illegal state %d\n", portno, state);
assert(protocol!=IPPROTO_IP || portno<256);
current = getPortEntry(portno, protocol);
if (current) {
/* We must discount our statistics from the old values. Also warn
if a complete duplicate */
if (o.debugging && current->state == state && (!owner || !*owner)) {
error("Duplicate port (%hu/%s)\n", portno, proto2ascii(protocol));
}
state_counts_proto[proto][current->state]--;
} else {
current = new Port();
current->portno = portno;
current->proto = protocol;
numports++;
setPortEntry(portno, protocol, current);
}
current->state = state;
state_counts_proto[proto][state]++;
if (owner && *owner) {
if (current->owner)
free(current->owner);
current->owner = strdup(owner);
}
return 0; /*success */
}
int PortList::removePort(u16 portno, u8 protocol) {
Port *answer = NULL;
printf("Removed %d\n", portno);
answer = getPortEntry(portno, protocol);
if (!answer)
return -1;
setPortEntry(portno, protocol, NULL);
if (o.verbose) {
log_write(LOG_STDOUT, "Deleting port %hu/%s, which we thought was %s\n",
portno, proto2ascii(answer->proto),
statenum2str(answer->state));
log_flush(LOG_STDOUT);
}
/* Discount statistics */
state_counts_proto[INPROTO2PORTLISTPROTO(protocol)][answer->state]--;
numports--;
delete answer;
return 0;
}
/* Saves an identification string for the target containing these
ports (an IP address might be a good example, but set what you
want). Only used when printing new port updates. Optional. A
copy is made. */
void PortList::setIdStr(const char *id) {
int len = 0;
if (idstr) free(idstr);
if (!id) { idstr = NULL; return; }
len = strlen(id);
len += 5; // " on " + \0
idstr = (char *) safe_malloc(len);
snprintf(idstr, len, " on %s", id);
}
int PortList::getStateCounts(int protocol, int state){
return(state_counts_proto[INPROTO2PORTLISTPROTO(protocol)][state]);
}
int PortList::getStateCounts(int state){
int sum=0, proto;
for(proto=0; proto < PORTLIST_PROTO_MAX; proto++)
sum += state_counts_proto[proto][state];
return(sum);
}
/* A function for iterating through the ports. Give NULL for the
first "afterthisport". Then supply the most recent returned port
for each subsequent call. When no more matching ports remain, NULL
will be returned. To restrict returned ports to just one protocol,
specify IPPROTO_TCP or IPPROTO_UDP for allowed_protocol. A TCPANDUDP
for allowed_protocol matches either. A 0 for allowed_state matches
all possible states. This function returns ports in numeric
order from lowest to highest, except that if you ask for both TCP &
UDP, every TCP port will be returned before we start returning UDP
ports */
Port *PortList::nextPort(Port *afterthisport,
int allowed_protocol, int allowed_state) {
int proto;
int mapped_pno;
Port *port;
if(afterthisport) {
proto = INPROTO2PORTLISTPROTO(afterthisport->proto);
assert(port_map[proto]!=NULL); // Hmm, it's not posible to handle port that doesn't have anything in map
assert(afterthisport->proto!=IPPROTO_IP || afterthisport->portno<256);
mapped_pno = port_map[proto][afterthisport->portno];
mapped_pno++; // we're interested in next port after current
}else { // running for the first time
if(allowed_protocol == TCPANDUDP) // if both protocols, then first search TCP
proto = INPROTO2PORTLISTPROTO(IPPROTO_TCP);
else
proto = INPROTO2PORTLISTPROTO(allowed_protocol);
mapped_pno = 0;
}
if(port_list[proto] != NULL) {
for(;mapped_pno < port_list_count[proto]; mapped_pno++) {
port = port_list[proto][mapped_pno];
if(port && (allowed_state==0 || port->state==allowed_state))
return(port);
}
}
/* if all protocols, than after TCP search UDP */
if(allowed_protocol == TCPANDUDP && proto == INPROTO2PORTLISTPROTO(IPPROTO_TCP))
return(nextPort(NULL, IPPROTO_UDP, allowed_state));
return(NULL);
}
Port *PortList::getPortEntry(u16 portno, u8 protocol) {
int proto = INPROTO2PORTLISTPROTO(protocol);
int mapped_pno;
assert(protocol!=IPPROTO_IP || portno<256);
if(port_map[proto]==NULL || port_list[proto]==NULL)
fatal("getPortEntry(%i,%i): you're trying to access uninitialized protocol", portno, protocol);
mapped_pno = port_map[proto][portno];
assert(mapped_pno < port_list_count[proto]);
assert(mapped_pno >= 0);
/* The ugly hack: we allow only port 0 to be mapped to 0 position */
if(mapped_pno==0 && portno!=0) {
error("WARNING: getPortEntry(%i,%i): this port was not mapped", portno, protocol);
return(NULL);
}else
return(port_list[proto][mapped_pno]);
}
void PortList::setPortEntry(u16 portno, u8 protocol, Port *port) {
int proto = INPROTO2PORTLISTPROTO(protocol);
int mapped_pno;
assert(protocol!=IPPROTO_IP || portno<256);
if(port_map[proto]==NULL || port_list[proto]==NULL)
fatal("setPortEntry(%i,%i): you're trying to access uninitialized protocol", portno, protocol);
mapped_pno = port_map[proto][portno];
assert(mapped_pno < port_list_count[proto]);
assert(mapped_pno >= 0);
/* The ugly hack: we allow only port 0 to be mapped to 0 position */
if(mapped_pno==0 && portno!=0) {
error("WARNING: setPortEntry(%i,%i): this port was not mapped", portno, protocol);
return;
}
port_list[proto][mapped_pno] = port;
}
u16 *PortList::port_map[PORTLIST_PROTO_MAX];
int PortList::port_list_count[PORTLIST_PROTO_MAX];
/* This function must be runned before any PortList object is created.
* It must be runned for every used protocol. The data in "ports"
* should be sorted. */
void PortList::initializePortMap(int protocol, u16 *ports, int portcount) {
int i;
int unused_zero; // aren't we using 0 port?
int ports_max = (protocol == IPPROTO_IP) ? 256 : 65536;
int proto = INPROTO2PORTLISTPROTO(protocol);
if(port_map[proto]!=NULL)
fatal("initializePortMap: portmap for protocol %i already initialized", protocol);
assert(port_list_count[proto]==0);
/* this memory will never be freed, but this is the way it has to be. */
port_map[proto] = (u16*) safe_zalloc(sizeof(u16)*ports_max);
/* Is zero port to be unused? */
if(portcount==0 || ports[0]!=0)
unused_zero = 1;
else
unused_zero = 0;
/* The ugly hack: if we don't use 0 port, than we need one more extra element. */
port_list_count[proto] = portcount + unused_zero;
for(i=0; i < portcount; i++) {
/* The ugly hack: if we don't use 0 port, than we must start counting from 1 */
port_map[proto][ports[i]] = i + unused_zero; // yes, this is the key line
}
/* So now port_map should have such structure (lets scan 2nd,4th and 6th port):
* port_map[0,0,1,0,2,0,3,...] <- indexes to port_list structure
* port_list[0,port_2,port_4,port_6]
* But if we scan 0, 2, and 4 port:
* port_map[0,0,1,0,2,...] // yes, this 0 in first place isn't mistake
* port_list[port_0,port_2,port_4]
* And in both cases we scan three ports. Ugly, isn't it? :) */
}
/* Cycles through the 0 or more "ignored" ports which should be
consolidated for Nmap output. They are returned sorted by the
number of prots in the state, starting with the most common. It
should first be called with PORT_UNKNOWN to obtain the most popular
ignored state (if any). Then call with that state to get the next
most popular one. Returns the state if there is one, but returns
PORT_UNKNOWN if there are no (more) states which qualify for
consolidation */
int PortList::nextIgnoredState(int prevstate) {
int beststate = PORT_UNKNOWN;
for(int state=0; state < PORT_HIGHEST_STATE; state++) {
/* The state must be ignored */
if (!isIgnoredState(state))
continue;
/* We can't give the same state again ... */
if (state == prevstate) continue;
/* If a previous state was given, we must have fewer ports than
that one, or be tied but be a larger state number */
if (prevstate != PORT_UNKNOWN &&
(getStateCounts(state) > getStateCounts(prevstate) ||
(getStateCounts(state) == getStateCounts(prevstate) && state <= prevstate)))
continue;
/* We only qualify if we have more ports than the current best */
if (beststate != PORT_UNKNOWN && getStateCounts(beststate) >= getStateCounts(state))
continue;
/* Yay! We found the best state so far ... */
beststate = state;
}
return beststate;
}
/* Returns true if a state should be ignored (consolidated), false otherwise */
bool PortList::isIgnoredState(int state) {
if (o.debugging > 2)
return false;
if (state == PORT_OPEN || state == PORT_UNKNOWN || state == PORT_TESTING ||
state == PORT_FRESH)
return false; /* Cannot be ignored */
int max_per_state = 25; // Ignore states with more ports than this
/* We will show more ports when verbosity is requested */
if (o.verbose || o.debugging)
max_per_state *= (o.verbose + 50 * o.debugging);
if (getStateCounts(state) > max_per_state)
return true;
return false;
}
int PortList::numIgnoredStates() {
int numstates = 0;
for(int state=0; state < PORT_HIGHEST_STATE; state++) {
if (isIgnoredState(state))
numstates++;
}
return numstates;
}
int PortList::numIgnoredPorts() {
int numports = 0;
for(int state=0; state < PORT_HIGHEST_STATE; state++) {
if (isIgnoredState(state))
numports += getStateCounts(state);
}
return numports;
}
// Move some popular TCP ports to the beginning of the portlist, because
// that can speed up certain scans. You should have already done any port
// randomization, this should prevent the ports from always coming out in the
// same order.
void random_port_cheat(u16 *ports, int portcount) {
int allportidx = 0;
int popportidx = 0;
int earlyreplidx = 0;
u16 pop_ports[] = { 21, 22, 23, 25, 53, 80, 113, 256, 389, 443, 554, 636, 1723, 3389 };
int num_pop_ports = sizeof(pop_ports) / sizeof(u16);
for(allportidx = 0; allportidx < portcount; allportidx++) {
// see if the currentport is a popular port
for(popportidx = 0; popportidx < num_pop_ports; popportidx++) {
if (ports[allportidx] == pop_ports[popportidx]) {
// This one is popular! Swap it near to the beginning.
if (allportidx != earlyreplidx) {
ports[allportidx] = ports[earlyreplidx];
ports[earlyreplidx] = pop_ports[popportidx];
}
earlyreplidx++;
break;
}
}
}
}
|