pax_global_header00006660000000000000000000000064134471741340014522gustar00rootroot0000000000000052 comment=742b1a3074cce677910b69fca91e2512945aa273 onesixtyone-master/000077500000000000000000000000001344717413400147435ustar00rootroot00000000000000onesixtyone-master/.gitignore000066400000000000000000000002341344717413400167320ustar00rootroot00000000000000# Object files *.o *.ko # Libraries *.lib *.a # Shared objects (inc. Windows DLLs) *.dll *.so *.so.* *.dylib # Executables *.exe *.out *.app onesixtyone onesixtyone-master/.travis.yml000066400000000000000000000015161344717413400170570ustar00rootroot00000000000000dist: trusty sudo: required language: c compiler: - clang - gcc before_install: - echo -n | openssl s_client -connect scan.coverity.com:443 | sed -ne '/-BEGIN CERTIFICATE-/,/-END CERTIFICATE-/p' | sudo tee -a /etc/ssl/certs/ca- - sudo apt-get -qq update - sudo apt-get install -y snmpd - sudo /etc/init.d/snmpd restart script: - make onesixtyone - bash dotest.sh env: global: - secure: "abOgeVMbdhZ+jR89TO4OFmVhxP+hle56wHnP2er20YTt/BCBCJB2CfNm/+HMgxdtBdGgxYwFUBtPiun7sKecaZJlu1CA7G+1vcpHrm+TeJvBK9eiyA300ts591uc+qS0ugtSmt931kVzpN9HNeKQqgotWoFALCtmlCr28wRO//Q=" addons: coverity_scan: project: name: "trailofbits/onesixtyone" description: "Build submitted via Travis CI" notification_email: dan@trailofbits.com build_command: "make onesixtyone" branch_pattern: coverity_scan onesixtyone-master/ChangeLog000066400000000000000000000011061344717413400165130ustar00rootroot000000000000002016-11-22 onesixtyone 0.3.3 * support netmasks * add -p, -s options for custom port and short mode respectively * fix bugs with long inputs * migrate logf to logr 2004-01-05 onesixtyone 0.3.2 * fixed version number and added a Makefile 2002-03-17 onesixtyone 0.3.1 * replaced in_addr_t with int, should fix compile problems on some Linux distributions (thanks to skeruno) 2002-03-14 onesixtyone 0.3 * compiles on FreeBSD (thanks to Eric Zerangue) * compiles on OpenBSD (thanks to methodic) * compiles on Solaris 2002-03-01 onesixtyone 0.2 * initial public release onesixtyone-master/INSTALL000066400000000000000000000003651344717413400160000ustar00rootroot00000000000000Linux, FreeBSD, OpenBSD: gcc -o onesixtyone onesixtyone.c Solaris: gcc -o onesixtyone onesixtyone.c -lsocket -lnsl Installation is not necessary, just run the program from the current directory. If you wish you may copy it to /usr/local/bin onesixtyone-master/LICENSE000066400000000000000000000432541344717413400157600ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. 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. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. onesixtyone-master/Makefile000066400000000000000000000002701344717413400164020ustar00rootroot00000000000000onesixtyone: onesixtyone.c gcc -o onesixtyone onesixtyone.c solaris: onesixtyone.c cc -o onesixtyone onesixtyone.c -lsocket -lnsl clean: rm -rf onesixtyone .PHONY: solaris clean onesixtyone-master/README.md000066400000000000000000000057571344717413400162400ustar00rootroot00000000000000onesixtyone =========== [![Build Status](https://travis-ci.org/trailofbits/onesixtyone.svg)](https://travis-ci.org/trailofbits/onesixtyone) [![Coverity Scan Build Status](https://scan.coverity.com/projects/10906/badge.svg)](https://scan.coverity.com/projects/onesixtyone) The SNMP protocol is a stateless, datagram oriented protocol. An SNMP scanner is a program that sends SNMP requests to multiple IP addresses, trying different community strings and waiting for a reply. Unfortunately SNMP servers don't respond to requests with invalid community strings and the underlying UDP protocol does not reliably report closed UDP ports. This means that 'no response' from the probed IP address can mean either of the following: * machine unreachable * SNMP server not running * invalid community string * the response datagram has not yet arrived The approach taken by most SNMP scanners is to send the request, wait for n seconds and assume that the community string is invalid. If only 1 of every hundred scanned IP addresses responds to the SNMP request, the scanner will spend 99\*n seconds waiting for replies that will never come. This makes traditional SNMP scanners very inefficient. onesixtyone takes a different approach to SNMP scanning. It takes advantage of the fact that SNMP is a connectionless protocol and sends all SNMP requests as fast as it can. Then the scanner waits for responses to come back and logs them, in a fashion similar to Nmap ping sweeps. By default onesixtyone waits for 10 milliseconds between sending packets, which is adequate for 100MBs switched networks. The user can adjust this value via the -w command line option. If set to 0, the scanner will send packets as fast as the kernel would accept them, which may lead to packet drop. Running onesixtyone on a class B network (switched 100MBs with 1Gbs backbone) with -w 10 gives us a performance of 3 seconds per class C, with no dropped packets. All 65536 IP addresses were scanned in less than 13 minutes. onesixtyone sends a request for the system.sysDescr.0 value, which is present on almost all SNMP enabled devices. This returned value gives us a description of the system software running on the device. Here is an excerpt of a log file: ``` 192.168.120.92 [1234] HP ETHERNET MULTI-ENVIRONMENT,ROM A.05.03,JETDIRECT, JD24,EEPROM A.05.05 130.160.108.146 [public] Hardware: x86 Family 15 Model 0 Stepping 10 AT/AT COMPATIBLE - Software: Windows 2000 Version 5.0 (Build 2195 Uniprocessor Free) 192.168.112.64 [public] Power Macintosh, hardware type 406; MacOS 9.0; OpenTransport 2.5.2 192.168.104.254 [public] Novell NetWare 4.11 August 22, 1996 192.168.112.83 [public] Macintosh Quadra 650, System Software 7.1 192.168.244.210 [public] RICOH Aficio 850 / RICOH Network Printer D model 192.168.240.39 [public] Cisco Systems WS-C5000 192.168.244.103 [public] HPJ3210A AdvanceStack 10BT Switching Hub Management Module, ROM A.01.02, EEPROM A.01.01, HW A.01.00 ``` ### Authors onesixtyone was designed and implemented by Alex Sotirov (alex@trailofbits.com). onesixtyone-master/dict.txt000066400000000000000000000005321344717413400164270ustar00rootroot000000000000001234 2read 4changes CISCO IBM OrigEquipMfr SNMP SUN TENmanUFactOryPOWER access admin agent all cisco community default enable field guest hello ibm manager mngt monitor netman network none openview pass password private proxy public read read-only read-write root router secret security snmp snmpd solaris sun switch system tech test world write onesixtyone-master/dotest.sh000077500000000000000000000001701344717413400166020ustar00rootroot00000000000000#!/bin/bash result=$(./onesixtyone 127.0.0.1) if [[ "$result" == *"public"* ]]; then echo "OK" exit 0 fi exit 1 onesixtyone-master/onesixtyone.c000066400000000000000000000547201344717413400175030ustar00rootroot00000000000000/* onesixtyone version 0.3.3 Copyright (C) 2002,2003 solareclipse@phreedom.org This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. 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. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include #include #include #include #include #include #include #include #include #include #include #include #include #ifndef INADDR_NONE /* Solaris is broken */ #define INADDR_NONE -1 #endif #define MAX_COMMUNITIES 16384 #define MAX_HOSTS 65535 #define MAX_COMMUNITY_SIZE 32 char* snmp_errors[] = { "NO ERROR", /* 0 */ "TOO BIG", /* 1 */ "NO SUCH NAME", /* 2 */ "BAD VALUE", /* 3 */ "READ ONLY", /* 4 */ "GENERIC ERROR", /* 5 */ "NO ACCESS", /* 6 */ "WRONG TYPE", /* 7 */ "WRONG LENGTH", /* 8 */ "WRONG ENCODING", /* 9 */ "WRONG VALUE", /* 10 */ "NO CREATION", /* 11 */ "INCONSISTENT VALUE", /* 12 */ "RESOURCE UNAVAILABLE", /* 13 */ "COMMIT FAILED", /* 14 */ "UNDO FAILED", /* 15 */ "AUTHORIZATION ERROR", /* 16 */ "NOT WRITABLE", /* 17 */ "INCONSISTENT NAME", /* 18 */ }; struct { int debug; int log; int port; int print_ip; int quiet; long wait; FILE* log_fd; } o; int community_count = 2; char* community[MAX_COMMUNITIES] = { "public", "private" }; int host_count = 0; struct { int addr; char* sysDescr; /* char* communities[];*/ } host[MAX_HOSTS]; void usage() { int i; printf("onesixtyone 0.3.3 [options] \n"); printf(" -c file with community names to try\n"); printf(" -i file with target hosts\n"); printf(" -o output log\n"); printf(" -p specify an alternate destination SNMP port\n"); printf(" -d debug mode, use twice for more information\n\n"); printf(" -s short mode, only print IP addresses\n\n"); printf(" -w n wait n milliseconds (1/1000 of a second) between sending packets (default 10)\n"); printf(" -q quiet mode, do not print log to stdout, use with -l\n"); printf("host is either an IPv4 address or an IPv4 address and a netmask\n"); printf("default community names are:"); for (i = 0; i < community_count; i++) printf(" %s", community[i]); printf("\n\n"); printf("Max number of hosts : \t\t%d\n", MAX_HOSTS); printf("Max community length: \t\t%d\n", MAX_COMMUNITY_SIZE); printf("Max number of communities: \t%d\n", MAX_COMMUNITIES); printf("\n\n"); printf("examples: onesixtyone 192.168.4.0/24 public\n"); printf(" onesixtyone -c dict.txt -i hosts -o my.log -w 100\n\n"); } void read_communities(char* filename) { FILE* fd; int i, c; int ch; if (o.debug > 0) printf("Using community file %s\n", filename); if ((fd = fopen(filename, "r")) == 0) { printf("Error opening community file %s\n", filename); exit(1); } const int max_c = MAX_COMMUNITY_SIZE - 1; for (i = 0; i < MAX_COMMUNITIES && !feof(fd); ++i) { char* ptr = (char*)malloc(MAX_COMMUNITY_SIZE); if (!ptr) { fprintf(stderr, "Failed to allocate memory for community string %d\n", i); exit(-1); } community[i] = ptr; community[i][0] = '\0'; for (c = 0; (ch = fgetc(fd)) != EOF && !isspace(ch); ++c) { if (c < max_c) { community[i][c] = (char)ch; community[i][c + 1] = '\0'; } } community[i][max_c] = '\0'; } if (o.debug && i == MAX_COMMUNITIES) { printf("MAX_COMMUNITIES (%d) reached. Remaining communities will be skipped \n", i); } community_count = i; fclose(fd); } int add_host(const char *ipmask) { int ret = -1; char *addr = NULL; char *slash; struct addrinfo hints; struct addrinfo *result = NULL; in_addr_t longtmp; unsigned long i, ips; struct in_addr startaddr; struct in_addr endaddr; int netmask = 32; addr = strdup(ipmask); slash = strchr(addr, '/'); if (slash != NULL) { netmask = atoi(slash + 1); if (netmask <= 0 || netmask > 32) { goto OUT; } *slash = '\0'; } memset(&hints, 0, sizeof(struct addrinfo)); hints.ai_family = AF_INET; /* Allow IPv4 */ hints.ai_socktype = SOCK_DGRAM; /* Datagram socket */ hints.ai_flags = AI_NUMERICHOST | AI_NUMERICSERV; /* no dns */ hints.ai_protocol = 0; /* IPv4 */ hints.ai_canonname = NULL; hints.ai_addr = NULL; hints.ai_next = NULL; if (getaddrinfo(addr, NULL, &hints, &result) != 0) { goto OUT; } longtmp = ntohl(((struct sockaddr_in *)result->ai_addr)->sin_addr.s_addr); startaddr.s_addr = longtmp & (0 - (1 << (32 - netmask))); endaddr.s_addr = longtmp | ((1 << (32 - netmask)) - 1); if (startaddr.s_addr > endaddr.s_addr) { goto OUT; } ips = endaddr.s_addr - startaddr.s_addr + 1; for (i = 0; i < ips; i++) { if (host_count >= MAX_HOSTS) { goto OUT; } host[host_count++].addr = htonl(startaddr.s_addr++); } ret = 0; OUT: free(addr); freeaddrinfo(result); return ret; } void read_hosts(char* filename) { FILE* fd; char buf[100]; int ch; size_t c; if (strcmp(filename, "-") == 0) { if (o.debug > 0) printf("Reading hosts from stdin\n"); fd = stdin; } else { if (o.debug > 0) printf("Reading hosts from input file %s\n", filename); if ((fd = fopen(filename, "r")) == 0) { printf("Error opening input file %s\n", filename); exit(1); } } host_count = 0; c = 0; ch = 0; do { ch = fgetc(fd); if (ch == '\n' || ch == ' ' || ch == '\t' || ch == EOF) { buf[c] = '\0'; if (c > 0) { /* skip blank lines */ if (add_host((const char*)&buf) == -1) { printf("Malformed IP address: %s\n", buf); exit(1); } c = 0; } } else if (ch != '\r') { buf[c++] = ch; } if (c > sizeof(buf) - 1) { printf("IP address too long\n"); exit(1); } } while (ch != EOF); if (fd != stdin) fclose(fd); if (o.debug > 0) printf("%d hosts read from file\n", host_count); } void init_options(int argc, char *argv[]) { char community_filename[250]; char input_filename[250]; char log_filename[255]; int input_file; int community_file; int arg, i; o.debug = 0; o.log = 0; o.port = 161; o.print_ip = 0; o.quiet = 0; o.wait = 10; input_file = 0; community_file = 0; o.log_fd = NULL; while ((arg = getopt(argc, argv, "c:di:o:p:s:w:q")) != EOF) { switch (arg) { case 'c': community_file = 1; strncpy(community_filename, optarg, sizeof(community_filename)); break; case 'd': o.debug++; break; case 'i': input_file = 1; strncpy(input_filename, optarg, sizeof(input_filename)); break; case 'o': o.log = 1; strncpy(log_filename, optarg, sizeof(log_filename)); break; case 'p': if (strtol(optarg, NULL, 10) == 0) { printf("Malformed port: %s\n", optarg); exit(1); } else { o.port = strtol(optarg, NULL, 10); } break; case 's': o.print_ip = 1; break; case 'w': o.wait = atol(optarg); /* convert to nanoseconds */ break; case 'q': o.quiet = 1; break; case '?': usage(); exit(1); break; } } if (o.debug) { if (o.debug > 0) printf("Debug level %d\n", o.debug); } if (!input_file) { if (optind >= argc) { usage(); exit(1); } if (add_host((const char*)argv[optind++]) == -1) { printf("Malformed IP address: %s\n", argv[optind - 1]); exit(1); } if (o.debug > 0) printf("Target ip read from command line: %s\n", argv[optind - 1]); } else { read_hosts((char*)&input_filename); } if (community_file) { read_communities((char*)&community_filename); } if (optind < argc) { if (community_file) { usage(); exit(1); } community[0] = argv[optind++]; community_count = 1; if (o.debug > 0) printf("Community read from command line: %s\n", community[0]);; } if (optind < argc) { usage(); exit(1); } if (o.log) { if ((o.log_fd = fopen(log_filename, "w")) == 0) { printf("Error opening log file %s\n", log_filename); exit(1); } printf("Logging to file %s\n", log_filename); } else if (o.quiet && !o.print_ip) { printf("Warning: quiet mode specified without logging, you will lose your scan results\n"); } if (o.debug > 0) { printf("%d communities:", community_count); for (i = 0; i < community_count; i++) printf(" %s", community[i]); printf("\n"); } if (o.debug > 0) printf("Waiting for %ld milliseconds between packets\n", o.wait); } int build_snmp_req(char* buf, size_t buf_size, char* target_community) { int i; static int id; char object[] = "\x30\x0e\x30\x0c\x06\x08\x2b\x06\x01\x02\x01\x01\x01\x0\x05\x00"; if (21 + strlen(target_community) + strlen(object) > buf_size) { printf("SNMP packet length exceeded.\nCommunity: %s\nObject: %s\n", target_community, object); exit(1); } if (--id > 0x7ffe) id = 0; memset(buf, 0, buf_size); buf[0] = 0x30; buf[1] = 19 + strlen(target_community) + sizeof(object) - 1; // Version: 1 buf[2] = 0x02; buf[3] = 0x01; buf[4] = 0x00; // Community buf[5] = 0x04; buf[6] = strlen(target_community); strcpy((buf + 7), target_community); i = 7 + strlen(target_community); // PDU type: GET buf[i++] = 0xa0; buf[i++] = 12 + sizeof(object) - 1; // Request ID buf[i++] = 0x02; buf[i++] = 0x04; buf[i++] = (char)((id >> 24) & 0xff); buf[i++] = (char)((id >> 16) & 0xff); buf[i++] = (char)((id >> 8) & 0xff); buf[i++] = (char)((id >> 0) & 0xff); // Error status: no error buf[i++] = 0x02; buf[i++] = 0x01; buf[i++] = 0x00; // Error index buf[i++] = 0x02; buf[i++] = 0x01; buf[i++] = 0x00; // Object ID memcpy((char*)&buf[i], &object, sizeof(object) - 1); i = i + sizeof(object) - 1; return (i); } void logr(char* fmt, ...) { va_list args, args2; va_start(args, fmt); if (!o.quiet) { va_copy(args2, args); vprintf(fmt, args2); va_end(args2); } if (o.log) vfprintf(o.log_fd, fmt, args); va_end(args); } int parse_asn_length(u_char* buf, int buf_size, int* i) { int len; if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[*i] < 0x81) { len = buf[*i]; *i += 1; } else if (buf[*i] == 0x81) { *i += 1; if ((*i) + 1 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } len = buf[*i]; *i += 1; } else if (buf[*i] == 0x82) { *i += 1; if ((*i) + 2 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } len = (buf[*i] << 8) + buf[(*i) + 1]; *i += 2; } else if (buf[*i] == 0x83) { *i += 1; if ((*i) + 3 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } len = (buf[*i] << 16) + (buf[(*i) + 1] << 8) + buf[(*i) + 2]; *i += 3; } else if (buf[*i] == 0x84) { *i += 1; if ((*i) + 4 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } len = (buf[*i] << 24) + (buf[(*i) + 1] << 16) + (buf[(*i) + 2] << 8) + buf[(*i) + 3]; *i += 4; } else { logr("Unable to decode SNMP packet: wrong length\n"); return -1; } if ((*i) + len > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } return len; } int skip_asn_length(u_char* buf, int buf_size, int* i) { int ret; if ((ret = parse_asn_length(buf, buf_size, i)) > 0) *i += ret; return ret; } int parse_asn_integer(u_char* buf, int buf_size, int* i) { int ret; if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[*i] == 0x81) { *i += 1; if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } } if (buf[*i] == 0x01) { if ((*i) + 2 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } ret = (int)buf[(*i) + 1]; *i += 2; } else if (buf[*i] == 0x02) { if ((*i) + 3 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } ret = ((int)buf[(*i) + 1] << 8) + (int)buf[(*i) + 2]; *i += 3; } else if (buf[*i] == 0x04) { if ((*i) + 5 > buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } ret = ((int)buf[(*i) + 1] << 24) + ((int)buf[(*i) + 2] << 16) + ((int)buf[(*i) + 3] << 8) + (int)buf[(*i) + 4]; *i += 5; } else { logr("Unable to decode SNMP packet: unrecognized integer length\n"); return -1; } return ret; } int print_asn_string(u_char* buf, int buf_size, int* i) { int ret; int string_end; if ((ret = parse_asn_length(buf, buf_size, i)) == -1) return -1; else string_end = *i + ret; for (; *i < string_end; *i += 1) { if (buf[*i] < 0x20 || buf[*i] > 0x80) logr(" "); else logr("%c", buf[*i]); } return 0; } int parse_snmp_header(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x30) { logr("Unable to decode SNMP packet: wrong header\n"); return -1; } if (parse_asn_length(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_version(u_char* buf, int buf_size, int* i) { int ret; if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x02) { logr("Unable to decode SNMP packet: snmp version invalid\n"); return -1; } if ((ret = parse_asn_integer(buf, buf_size, i)) == -1) return -1; else if (ret != 0) { logr("Unable to decode SNMP packet: snmp version invalid\n"); return -1; } return 0; } int parse_snmp_community(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x04) { logr("Unable to decode SNMP packet: community name not found\n"); return -1; } logr("["); if (print_asn_string(buf, buf_size, i) == -1) return -1; logr("] "); return 0; } int parse_snmp_pdu(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0xa2) { logr("Unable to decode SNMP packet: PDU type not RESPONSE (0xa2)\n"); return -1; } if (parse_asn_length(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_requestid(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x02) { logr("Unable to decode SNMP packet: request id invalid\n"); return -1; } if (parse_asn_integer(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_errorcode(u_char* buf, int buf_size, int* i) { int ret; if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x02) { logr("Unable to decode SNMP packet: error code invalid\n"); return -1; } if ((ret = parse_asn_integer(buf, buf_size, i)) < 0) return -1; if (ret != 0) { if (ret < 0 || ret > 18) { logr("Unable to decode SNMP packet: error code invalid\n"); return -1; } logr("Host responded with error %s\n", snmp_errors[ret]); return -1; } return 0; } int parse_snmp_errorindex(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x02) { logr("Unable to decode SNMP packet: error index invalid\n"); return -1; } if (parse_asn_integer(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_objheader(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x30) { logr("Unable to decode SNMP packet: invalid object header\n"); return -1; } if (parse_asn_length(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_objheader6(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x06) { logr("Unable to decode SNMP packet: invalid object header\n"); return -1; } if (skip_asn_length(buf, buf_size, i) < 0) return -1; return 0; } int parse_snmp_value(u_char* buf, int buf_size, int* i) { if (*i >= buf_size) { logr("Unable to decode SNMP packet: buffer overflow\n"); return -1; } if (buf[(*i)++] != 0x04) { logr("Unable to decode SNMP packet: invalid value\n"); return -1; } if (print_asn_string(buf, buf_size, i) < 0) return -1; return 0; } void parse_snmp_response(u_char* buf, int buf_size) { int i; i = 0; if (parse_snmp_header(buf, buf_size, &i) == -1) return; if (parse_snmp_version(buf, buf_size, &i) == -1) return; if (parse_snmp_community(buf, buf_size, &i) == -1) return; if (parse_snmp_pdu(buf, buf_size, &i) == -1) return; if (parse_snmp_requestid(buf, buf_size, &i) == -1) return; if (parse_snmp_errorcode(buf, buf_size, &i) == -1) return; if (parse_snmp_errorindex(buf, buf_size, &i) == -1) return; if (i + 3 <= buf_size && buf[i] == 0x00 && buf[i + 1] == 0x30 && buf[i + 2] == 0x20) // Bug in an HP JetDirect i += 3; if (parse_snmp_objheader(buf, buf_size, &i) == -1) return; if (parse_snmp_objheader(buf, buf_size, &i) == -1) return; // yes, this should be called twice if (parse_snmp_objheader6(buf, buf_size, &i) == -1) return; if (parse_snmp_value(buf, buf_size, &i) == -1) return; logr("\n"); } /* Subtract the `struct timeval' values X and Y, * storing the result in RESULT. * Return 1 if the difference is negative, otherwise 0. */ int timeval_subtract(struct timeval *result, struct timeval *x, struct timeval *y) { int nsec; /* Perform the carry for the later subtraction by updating y. */ if (x->tv_usec < y->tv_usec) { nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1; y->tv_usec -= 1000000 * nsec; y->tv_sec += nsec; } if (x->tv_usec - y->tv_usec > 1000000) { nsec = (x->tv_usec - y->tv_usec) / 1000000; y->tv_usec += 1000000 * nsec; y->tv_sec -= nsec; } /* Compute the time remaining to wait. tv_usec is certainly positive. */ result->tv_sec = x->tv_sec - y->tv_sec; result->tv_usec = x->tv_usec - y->tv_usec; /* Return 1 if result is negative. */ return x->tv_sec < y->tv_sec; } void receive_snmp(int sock, long wait, struct sockaddr_in* remote_addr) { struct timeval tv_now, tv_until, tv_wait; unsigned int remote_addr_len; char buf[1500]; int ret; fd_set fds; gettimeofday(&tv_now, NULL); tv_until.tv_sec = tv_now.tv_sec; tv_until.tv_usec = tv_now.tv_usec + wait * 1000; if (tv_until.tv_usec >= 1000000) { tv_until.tv_sec += tv_until.tv_usec / 1000000; tv_until.tv_usec = tv_until.tv_usec % 1000000; } tv_wait.tv_sec = wait / 1000; tv_wait.tv_usec = wait % 1000 * 1000; do { /* Put the socket into the fd set */ FD_ZERO(&fds); FD_SET(sock, &fds); if ((ret = select(sock + 1, &fds, NULL, NULL, &tv_wait)) == -1) { printf("Error in pselect\n"); exit(1); } else if (ret > 0) { memset(&buf, 0x0, sizeof(buf)); remote_addr_len = sizeof(*remote_addr); ret = recvfrom(sock, &buf, sizeof(buf), 0, (struct sockaddr*)remote_addr, &remote_addr_len); if (ret < 0) { if (errno == ECONNRESET) { printf("%s ICMP unreach received\n", inet_ntoa(remote_addr->sin_addr)); } else { printf("Error in recvfrom\n"); } } logr("%s ", inet_ntoa(remote_addr->sin_addr)); parse_snmp_response((u_char*)&buf, ret); if (o.print_ip) { int quiet = o.quiet; o.quiet = 0; logr("%s\n", inet_ntoa(remote_addr->sin_addr)); o.quiet = quiet; } if (o.log) fflush(o.log_fd); } gettimeofday(&tv_now, NULL); } while (timeval_subtract(&tv_wait, &tv_until, &tv_now) == 0); } int main(int argc, char* argv[]) { struct sockaddr_in local_addr; struct sockaddr_in remote_addr; int sock; int ret; int c, i; char sendbuf[1500]; int sendbuf_size; init_options(argc, argv); /* socket creation */ sock = socket(AF_INET, SOCK_DGRAM, 0); if (sock < 0) { printf("Error creating socket\n"); exit(1); } local_addr.sin_family = AF_INET; local_addr.sin_addr.s_addr = htonl(INADDR_ANY); local_addr.sin_port = htons(0); ret = bind(sock, (struct sockaddr *)&local_addr, sizeof(local_addr)); if (ret < 0) { printf("Error binding socket\n"); exit(1); } /* remote address */ remote_addr.sin_family = AF_INET; remote_addr.sin_port = htons(o.port); if (!o.quiet) printf("Scanning %d hosts, %d communities\n", host_count, community_count); for (c = 0; c < community_count; c++) { if (o.debug > 0) printf("Trying community %s\n", community[c]); sendbuf_size = build_snmp_req((char*)&sendbuf, sizeof(sendbuf), community[c]); for (i = 0; i < host_count; i++) { remote_addr.sin_addr.s_addr = host[i].addr; if (o.debug > 1) printf("Sending to ip %s\n", inet_ntoa(*(struct in_addr*)&remote_addr.sin_addr.s_addr)); ret = sendto(sock, &sendbuf, sendbuf_size, 0, (struct sockaddr*)&remote_addr, sizeof(remote_addr)); if (ret < 0) { if (!o.quiet) printf("Error in sendto: %s\n", strerror(errno)); /* exit(1); */ } receive_snmp(sock, o.wait, &remote_addr); } } if (o.debug > 0) printf("All packets sent, waiting for responses.\n"); /* wait for 5 seconds */ receive_snmp(sock, 5000, &remote_addr); if (o.debug > 0) printf("done.\n"); if (o.log) fclose(o.log_fd); return 0; } onesixtyone-master/tis.config000066400000000000000000000001251344717413400167270ustar00rootroot00000000000000 { name: "Unitialized value", files: [ "onesixtyone.c" ], main: "main" }