mirror of
https://github.com/nmap/nmap.git
synced 2025-12-06 04:31:29 +00:00
3a67da3a7e
instead of a custom hash table and an STL list instead of a custom linked list. The biggest gain comes from using the list.sort method rather than inserting ports in sorted order (equivalent to insertion sort). The new code passes Doug's p-switch-tests. Here are time comparisons, using the old and new services code, and using the standard nmap-services file and the 65535-port nmap-services-huge. The times are the duration of the call to nmap_services_init. Three trials were done for each case, except for the old-code/nmap-services-huge case. nmap-services: old code: 0.215 0.201 0.227 (average 0.214 s) new code: 0.025 0.022 0.023 (average 0.023 s) nmap-services-huge: old code: 441.014 (average 441.014 s) new code: 0.984 0.975 0.978 (average 0.979 s)
492 lines
19 KiB
C++
492 lines
19 KiB
C++
|
|
/***************************************************************************
|
|
* services.cc -- Various functions relating to reading the nmap-services *
|
|
* file and port <-> service mapping *
|
|
* *
|
|
***********************IMPORTANT NMAP LICENSE TERMS************************
|
|
* *
|
|
* The Nmap Security Scanner is (C) 1996-2008 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 with the clarifications and exceptions described *
|
|
* below. 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 sales@insecure.com). Dozens of software vendors already *
|
|
* license Nmap technology such as host discovery, port scanning, OS *
|
|
* detection, and version detection. *
|
|
* *
|
|
* 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-db 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://nmap.org 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 dozens *
|
|
* of software 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 of 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 v2.0 for more details at *
|
|
* http://www.gnu.org/licenses/gpl-2.0.html , or in the COPYING file *
|
|
* included with Nmap. *
|
|
* *
|
|
***************************************************************************/
|
|
|
|
/* $Id$ */
|
|
|
|
#include <list>
|
|
#include <map>
|
|
|
|
#include "services.h"
|
|
#include "NmapOps.h"
|
|
#include "charpool.h"
|
|
#include "nmap_error.h"
|
|
#include "utils.h"
|
|
|
|
/* This structure is the key for looking up services in the
|
|
port/proto -> service map. */
|
|
struct port_spec {
|
|
int portno; /* Network byte order */
|
|
std::string proto;
|
|
|
|
/* Sort in the usual nmap-services order. */
|
|
bool operator<(const port_spec& other) const {
|
|
if (this->portno < other.portno)
|
|
return true;
|
|
else if (this->portno > other.portno)
|
|
return false;
|
|
else
|
|
return this->proto < other.proto;
|
|
}
|
|
};
|
|
|
|
/* This is a servent augmented by a frequency ratio. */
|
|
struct service_node : public servent {
|
|
public:
|
|
double ratio;
|
|
};
|
|
|
|
/* Compare the ratios of two service nodes for top-ports purposes. Larger ratios
|
|
come before smaller. */
|
|
bool service_node_ratio_compare(const service_node& a, const service_node& b) {
|
|
return a.ratio > b.ratio;
|
|
}
|
|
|
|
extern NmapOps o;
|
|
static int numtcpports = 0;
|
|
static int numudpports = 0;
|
|
static std::map<port_spec, service_node> service_table;
|
|
static std::list<service_node> services_by_ratio;
|
|
static int services_initialized = 0;
|
|
static int ratio_format = 0; // 0 = /etc/services no-ratio format. 1 = new nmap format
|
|
|
|
static int nmap_services_init() {
|
|
if (services_initialized) return 0;
|
|
|
|
char filename[512];
|
|
FILE *fp;
|
|
char servicename[128], proto[16];
|
|
u16 portno;
|
|
char *p;
|
|
char line[1024];
|
|
int lineno = 0;
|
|
int res;
|
|
double ratio;
|
|
int ratio_n, ratio_d;
|
|
|
|
if (nmap_fetchfile(filename, sizeof(filename), "nmap-services") != 1) {
|
|
#ifndef WIN32
|
|
error("Unable to find nmap-services! Resorting to /etc/services");
|
|
strcpy(filename, "/etc/services");
|
|
#else
|
|
int len, wnt = GetVersion() < 0x80000000;
|
|
error("Unable to find nmap-services! Resorting to /etc/services");
|
|
if(wnt)
|
|
len = GetSystemDirectory(filename, 480); // be safe
|
|
else
|
|
len = GetWindowsDirectory(filename, 480); // be safe
|
|
if(!len)
|
|
error("Get%sDirectory failed (%d) @#!#@",
|
|
wnt ? "System" : "Windows", GetLastError());
|
|
else
|
|
{
|
|
if(wnt)
|
|
strcpy(filename + len, "\\drivers\\etc\\services");
|
|
else
|
|
strcpy(filename + len, "\\services");
|
|
}
|
|
#endif
|
|
}
|
|
|
|
fp = fopen(filename, "r");
|
|
if (!fp) {
|
|
fatal("Unable to open %s for reading service information", filename);
|
|
}
|
|
/* Record where this data file was found. */
|
|
o.loaded_data_files["nmap-services"] = filename;
|
|
|
|
while(fgets(line, sizeof(line), fp)) {
|
|
lineno++;
|
|
p = line;
|
|
while(*p && isspace((int) *p))
|
|
p++;
|
|
if (*p == '#')
|
|
continue;
|
|
|
|
res = sscanf(line, "%127s %hu/%15s %d/%d", servicename, &portno, proto, &ratio_n, &ratio_d);
|
|
|
|
if (res == 3) {
|
|
ratio = 0;
|
|
} else if (res == 5) {
|
|
if (ratio_n < 0 || ratio_d < 0)
|
|
fatal("%s:%d contains an invalid negative value", filename, lineno);
|
|
|
|
if (ratio_n > ratio_d)
|
|
fatal("%s:%d has a ratio %g. All ratios must be < 1", filename, lineno, (double)ratio_n/ratio_d);
|
|
|
|
if (ratio_d == 0)
|
|
fatal("%s:%d has a ratio denominator of 0 causing a division by 0 error", filename, lineno);
|
|
|
|
ratio = (double)ratio_n / ratio_d;
|
|
ratio_format = 1;
|
|
} else {
|
|
continue;
|
|
}
|
|
|
|
portno = htons(portno);
|
|
|
|
port_spec ps;
|
|
ps.portno = portno;
|
|
ps.proto = proto;
|
|
|
|
/* Now we make sure our service table doesn't have duplicates */
|
|
std::map<port_spec, service_node>::iterator i;
|
|
i = service_table.find(ps);
|
|
if (i != service_table.end()) {
|
|
if (o.debugging)
|
|
error("Port %d proto %s is duplicated in services file %s", ntohs(portno), proto, filename);
|
|
continue;
|
|
}
|
|
|
|
if (strncasecmp(proto, "tcp", 3) == 0) {
|
|
numtcpports++;
|
|
} else if (strncasecmp(proto, "udp", 3) == 0) {
|
|
numudpports++;
|
|
} else if (strncasecmp(proto, "ddp", 3) == 0) {
|
|
/* ddp is some apple thing...we don't "do" that */
|
|
} else if (strncasecmp(proto, "divert", 6) == 0) {
|
|
/* divert sockets are for freebsd's natd */
|
|
} else if (strncasecmp(proto, "#", 1) == 0) {
|
|
/* possibly misplaced comment, but who cares? */
|
|
} else {
|
|
if (o.debugging)
|
|
error("Unknown protocol (%s) on line %d of services file %s.", proto, lineno, filename);
|
|
continue;
|
|
}
|
|
|
|
struct service_node sn;
|
|
|
|
sn.s_name = cp_strdup(servicename);
|
|
sn.s_port = portno;
|
|
sn.s_proto = cp_strdup(proto);
|
|
sn.s_aliases = NULL;
|
|
sn.ratio = ratio;
|
|
|
|
service_table[ps] = sn;
|
|
|
|
services_by_ratio.push_back(sn);
|
|
}
|
|
|
|
/* Sort the list of ports sorted by frequency for top-ports purposes. */
|
|
services_by_ratio.sort(service_node_ratio_compare);
|
|
|
|
fclose(fp);
|
|
services_initialized = 1;
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
/* Adds ports whose names match mask and one or more protocols
|
|
* specified by range_type to porttbl. Increases the respective
|
|
* protocol counts in ports.
|
|
* Returns the number of ports added in total.
|
|
*/
|
|
|
|
int addportsfromservmask(char *mask, u8 *porttbl, int range_type) {
|
|
std::map<port_spec, service_node>::iterator i;
|
|
int t = 0;
|
|
|
|
if (!services_initialized && nmap_services_init() == -1)
|
|
fatal("%s: Couldn't get port numbers", __func__);
|
|
|
|
for (i = service_table.begin(); i != service_table.end(); i++) {
|
|
service_node& current = i->second;
|
|
if (wildtest(mask, current.s_name)) {
|
|
if ((range_type & SCAN_TCP_PORT) && strcmp(current.s_proto, "tcp") == 0) {
|
|
porttbl[ntohs(current.s_port)] |= SCAN_TCP_PORT;
|
|
t++;
|
|
}
|
|
if ((range_type & SCAN_UDP_PORT) && strcmp(current.s_proto, "udp") == 0) {
|
|
porttbl[ntohs(current.s_port)] |= SCAN_UDP_PORT;
|
|
t++;
|
|
}
|
|
}
|
|
}
|
|
|
|
return t;
|
|
}
|
|
|
|
|
|
|
|
/* Port must be in network byte order. */
|
|
struct servent *nmap_getservbyport(int port, const char *proto) {
|
|
std::map<port_spec, service_node>::iterator i;
|
|
port_spec ps;
|
|
|
|
if (nmap_services_init() == -1)
|
|
return NULL;
|
|
|
|
ps.portno = port;
|
|
ps.proto = proto;
|
|
i = service_table.find(ps);
|
|
if (i != service_table.end())
|
|
return &i->second;
|
|
|
|
/* Couldn't find it ... oh well. */
|
|
return NULL;
|
|
}
|
|
|
|
|
|
|
|
static int port_compare(const void *a, const void *b) {
|
|
unsigned short ua = *((unsigned short *) a), ub = *((unsigned short *) b);
|
|
if (ua > ub) return 1;
|
|
else return -1;
|
|
}
|
|
|
|
|
|
|
|
// is_port_member() returns true if serv is an element of ptsdata.
|
|
// This could be implemented MUCH more efficiently but it should only be
|
|
// called when you use a non-default top-ports or port-ratio value TOGETHER WITH
|
|
// a -p portlist.
|
|
|
|
static bool is_port_member(const struct scan_lists *ptsdata, const struct service_node *serv) {
|
|
int i;
|
|
|
|
if (strcmp(serv->s_proto, "tcp") == 0) {
|
|
for (i=0; i<ptsdata->tcp_count; i++)
|
|
if (ntohs(serv->s_port) == ptsdata->tcp_ports[i])
|
|
return true;
|
|
} else if (strcmp(serv->s_proto, "udp") == 0) {
|
|
for (i=0; i<ptsdata->udp_count; i++)
|
|
if (ntohs(serv->s_port) == ptsdata->udp_ports[i])
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
// gettoppts() sets its third parameter, a scan_list, with the most
|
|
// common ports scanned by Nmap according to the ratios specified in
|
|
// the nmap-services file.
|
|
//
|
|
// If level is below 1.0 then we treat it as a minimum ratio and we
|
|
// add all ports with ratios above level.
|
|
//
|
|
// If level is 1 or above, we treat it as a "top ports" directive
|
|
// and return the N highest ratio ports (where N==level).
|
|
//
|
|
// This function doesn't support IP protocol scan so only call this
|
|
// function if o.TCPScan() || o.UDPScan()
|
|
|
|
void gettoppts(double level, char *portlist, struct scan_lists * ports) {
|
|
int ti=0, ui=0;
|
|
struct scan_lists ptsdata = { 0 };
|
|
bool ptsdata_initialized = false;
|
|
const struct service_node *current;
|
|
std::list<service_node>::iterator i;
|
|
|
|
if (!services_initialized && nmap_services_init() == -1)
|
|
fatal("%s: Couldn't get port numbers", __func__);
|
|
|
|
if (ratio_format == 0) {
|
|
if (level != -1)
|
|
fatal("Unable to use --top-ports or --port-ratio with an old style (no-ratio) services file");
|
|
|
|
if (portlist){
|
|
getpts(portlist, ports);
|
|
return;
|
|
}else if (o.fastscan){
|
|
getpts("[-]", ports);
|
|
return;
|
|
}else{
|
|
getpts("1-1024,[1025-]", ports);
|
|
return;
|
|
}
|
|
}
|
|
|
|
// TOP PORT DEFAULTS
|
|
if (level == -1) {
|
|
if (portlist){
|
|
getpts(portlist, ports);
|
|
return;
|
|
}
|
|
if (o.fastscan) level = 100;
|
|
else level = 0.01;
|
|
}
|
|
|
|
if (portlist){
|
|
getpts(portlist, &ptsdata);
|
|
ptsdata_initialized = true;
|
|
}
|
|
if (level < 1) {
|
|
for (i = services_by_ratio.begin(); i != services_by_ratio.end(); i++) {
|
|
current = &(*i);
|
|
if (ptsdata_initialized && !is_port_member(&ptsdata, current))
|
|
continue;
|
|
if (current->ratio >= level) {
|
|
if (o.TCPScan() && strcmp(current->s_proto, "tcp") == 0)
|
|
ports->tcp_count++;
|
|
else if (o.UDPScan() && strcmp(current->s_proto, "udp") == 0)
|
|
ports->udp_count++;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (ports->tcp_count)
|
|
ports->tcp_ports = (unsigned short *)safe_zalloc(ports->tcp_count * sizeof(unsigned short));
|
|
|
|
if (ports->udp_count)
|
|
ports->udp_ports = (unsigned short *)safe_zalloc(ports->udp_count * sizeof(unsigned short));
|
|
|
|
ports->prots = NULL;
|
|
|
|
for (i = services_by_ratio.begin(); i != services_by_ratio.end(); i++) {
|
|
current = &(*i);
|
|
if (ptsdata_initialized && !is_port_member(&ptsdata, current))
|
|
continue;
|
|
if (current->ratio >= level) {
|
|
if (o.TCPScan() && strcmp(current->s_proto, "tcp") == 0)
|
|
ports->tcp_ports[ti++] = ntohs(current->s_port);
|
|
else if (o.UDPScan() && strcmp(current->s_proto, "udp") == 0)
|
|
ports->udp_ports[ui++] = ntohs(current->s_port);
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
} else if (level >= 1) {
|
|
if (level > 65536)
|
|
fatal("Level argument to gettoppts (%g) is too large", level);
|
|
|
|
if (o.TCPScan()) {
|
|
ports->tcp_count = MIN((int) level, numtcpports);
|
|
ports->tcp_ports = (unsigned short *)safe_zalloc(ports->tcp_count * sizeof(unsigned short));
|
|
}
|
|
if (o.UDPScan()) {
|
|
ports->udp_count = MIN((int) level, numudpports);
|
|
ports->udp_ports = (unsigned short *)safe_zalloc(ports->udp_count * sizeof(unsigned short));
|
|
}
|
|
|
|
ports->prots = NULL;
|
|
|
|
for (i = services_by_ratio.begin(); i != services_by_ratio.end(); i++) {
|
|
current = &(*i);
|
|
if (ptsdata_initialized && !is_port_member(&ptsdata, current))
|
|
continue;
|
|
if (o.TCPScan() && strcmp(current->s_proto, "tcp") == 0 && ti < ports->tcp_count)
|
|
ports->tcp_ports[ti++] = ntohs(current->s_port);
|
|
else if (o.UDPScan() && strcmp(current->s_proto, "udp") == 0 && ui < ports->udp_count)
|
|
ports->udp_ports[ui++] = ntohs(current->s_port);
|
|
}
|
|
|
|
if (ti < ports->tcp_count) ports->tcp_count = ti;
|
|
if (ui < ports->udp_count) ports->udp_count = ui;
|
|
} else
|
|
fatal("Argument to gettoppts (%g) should be a positive ratio below 1 or an integer of 1 or higher", level);
|
|
|
|
if (ptsdata_initialized) {
|
|
free_scan_lists(&ptsdata);
|
|
ptsdata_initialized = false;
|
|
}
|
|
|
|
if (ports->tcp_count > 1)
|
|
qsort(ports->tcp_ports, ports->tcp_count, sizeof(unsigned short), &port_compare);
|
|
|
|
if (ports->udp_count > 1)
|
|
qsort(ports->udp_ports, ports->udp_count, sizeof(unsigned short), &port_compare);
|
|
|
|
if (o.debugging && level < 1)
|
|
log_write(LOG_STDOUT, "PORTS: Using ports open on %g%% or more average hosts (TCP:%d, UDP:%d)\n", level*100, ports->tcp_count, ports->udp_count);
|
|
else if (o.debugging && level >= 1)
|
|
log_write(LOG_STDOUT, "PORTS: Using top %d ports found open (TCP:%d, UDP:%d)\n", (int) level, ports->tcp_count, ports->udp_count);
|
|
}
|
|
|