smtpping-1.1.3/000077500000000000000000000000001273353255000133625ustar00rootroot00000000000000smtpping-1.1.3/.gitignore000066400000000000000000000000741273353255000153530ustar00rootroot00000000000000CMakeCache.txt CMakeFiles/ cmake_install.cmake *.o smtpping smtpping-1.1.3/CMakeLists.txt000066400000000000000000000011301273353255000161150ustar00rootroot00000000000000CMAKE_MINIMUM_REQUIRED(VERSION 2.8) PROJECT(smtpping) SET(TARGET_NAME "smtpping") ADD_EXECUTABLE(${TARGET_NAME} smtpping.cpp resolver.cpp ) IF("${CMAKE_SYSTEM}" MATCHES "Darwin") ADD_DEFINITIONS(-DBIND_8_COMPAT) ENDIF() TARGET_LINK_LIBRARIES(${TARGET_NAME} resolv pthread ) IF (NOT DEFINED BIN_INSTALL_DIR) SET(BIN_INSTALL_DIR "bin") ENDIF(NOT DEFINED BIN_INSTALL_DIR) IF (NOT DEFINED MAN_INSTALL_DIR) SET(MAN_INSTALL_DIR "man") ENDIF(NOT DEFINED MAN_INSTALL_DIR) INSTALL(TARGETS ${TARGET_NAME} DESTINATION ${BIN_INSTALL_DIR}) INSTALL(FILES smtpping.1 DESTINATION ${MAN_INSTALL_DIR}/man1) smtpping-1.1.3/LICENSE000066400000000000000000000432541273353255000143770ustar00rootroot00000000000000 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. smtpping-1.1.3/README.md000066400000000000000000000014561273353255000146470ustar00rootroot00000000000000A simple, portable tool for measuring SMTP server delay, delay variation and throughput. Feel free to contact [![Coverity Scan Build](https://img.shields.io/coverity/scan/7287.svg)](https://scan.coverity.com/projects/halonsecurity-smtpping) Usage ----- The two first examples measures delay, and the last example measures throughput (`-r -w0`) using 50 threads (`-P50`). ``` $ smtpping test@halon.io $ smtpping test@halon.io @10.2.0.31 $ smtpping -P50 -r -w0 test@halon.io @10.2.0.31 ``` Building -------- Building on *NIX can be done manually using a C++ compiler such as GNU's `g++` or by using `cmake`. It could be easily ported to a Makefile. ``` $ cmake . $ make ``` Building on Windows ------------------- A project file for Dev-C++ is included, should be quite portable to eg. VS. smtpping-1.1.3/resolver.cpp000066400000000000000000000136541273353255000157400ustar00rootroot00000000000000/* SMTP PING Copyright (C) 2011 Halon Security 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. */ #include "resolver.hpp" #include #include #if defined(__WIN32__) #include #include #include #else #include #include #include #include #endif #include /* * initialize thread-safe m_res structure */ Resolver::Resolver() { #ifdef __WIN32__ m_hDnsInst = LoadLibrary("DNSAPI.DLL"); if (m_hDnsInst) { m_lpfnDnsRecordListFree = reinterpret_cast(GetProcAddress(m_hDnsInst, "DnsRecordListFree")); m_lpfnDnsQuery = reinterpret_cast(GetProcAddress(m_hDnsInst, "DnsQuery_A")); } #else memset((void*)&m_res, 0, sizeof m_res); res_ninit(&m_res); #endif } /* * close thread-safe m_res structure */ Resolver::~Resolver() { #ifdef __WIN32__ if (m_hDnsInst) { FreeLibrary(m_hDnsInst); m_hDnsInst = NULL; } #else res_nclose(&m_res); #endif } bool Resolver::Lookup(const std::string& domain, RecordType recordType, std::vector& result) { std::map > prioMap; #ifdef __WIN32__ if (!m_lpfnDnsRecordListFree || !m_lpfnDnsQuery) return false; int req_rec_type; #ifndef DNS_TYPE_AAAA # define DNS_TYPE_AAAA (28) #endif switch(recordType) { case RR_A: req_rec_type = DNS_TYPE_A; break; case RR_AAAA: req_rec_type = DNS_TYPE_AAAA; break; case RR_MX: req_rec_type = DNS_TYPE_MX; break; default: return false; } PDNS_RECORD pRec = NULL; if (m_lpfnDnsQuery(domain.c_str(), req_rec_type, DNS_QUERY_STANDARD, NULL, &pRec, NULL) != ERROR_SUCCESS) return false; PDNS_RECORD pRecFirst = pRec; while (pRec) { if (req_rec_type == pRec->wType && pRec->Flags.S.Section == DNSREC_ANSWER) { if (pRec->wType == DNS_TYPE_MX) { prioMap[(int)pRec->Data.MX.wPreference].push_back(pRec->Data.MX.pNameExchange); } if (pRec->wType == DNS_TYPE_AAAA) { SOCKADDR_IN6 addr; memset(&addr, 0, sizeof addr); addr.sin6_family = AF_INET6; addr.sin6_addr = *((in_addr6*)&(pRec->Data.AAAA.Ip6Address)); char buf[128]; DWORD bufsize = sizeof buf; if (WSAAddressToStringA((sockaddr*)&addr, sizeof addr, NULL, buf, &bufsize) == 0) { prioMap[0].push_back(buf); } } if (pRec->wType == DNS_TYPE_A) { SOCKADDR_IN addr; memset(&addr, 0, sizeof addr); addr.sin_family = AF_INET; addr.sin_addr = *((in_addr*)&(pRec->Data.A.IpAddress)); char buf[128]; DWORD bufsize = sizeof buf; if (WSAAddressToStringA((sockaddr*)&addr, sizeof addr, NULL, buf, &bufsize) == 0) { prioMap[0].push_back(buf); } } } pRec = pRec->pNext; } m_lpfnDnsRecordListFree(pRecFirst, DnsFreeRecordList); #else unsigned char response[64 * 1024]; memset(response, 0, sizeof response); unsigned char *resData, *resEnd; unsigned short rec_len, rec_pref; unsigned short rec_type; HEADER* header; int req_rec_type; switch(recordType) { case RR_A: req_rec_type = T_A; break; case RR_AAAA: req_rec_type = T_AAAA; break; case RR_MX: req_rec_type = T_MX; break; default: return false; } int len = res_nquery(&m_res, domain.c_str(), C_IN, req_rec_type, (unsigned char*)&response, sizeof response); if (len < 0) { if (m_res.res_h_errno == NO_DATA) return true; return false; } if (len > (int)sizeof response) { return false; } header = (HEADER*)&response; resData = (unsigned char*)&response + HFIXEDSZ; resEnd = (unsigned char*)&response + len; int answer_count = ntohs((unsigned short)header->ancount); int query_count = ntohs((unsigned short)header->qdcount); for (int i = 0; i < query_count; i++) { if ((len = dn_skipname(resData, resEnd)) < 0) return false; resData += len + QFIXEDSZ; } char buf[MAXDNAME + 1]; for (int i = 0; i < answer_count; i++) { len = dn_expand((unsigned char*)&response, resEnd, resData, (char*)&buf, sizeof buf - 1); if (len < 0) return false; resData += len; GETSHORT(rec_type, resData); resData += INT16SZ + INT32SZ; GETSHORT(rec_len, resData); switch(rec_type) { case T_MX: GETSHORT(rec_pref, resData); rec_len -= sizeof(short); break; default: rec_pref = 0; break; } if (rec_type == req_rec_type) { switch(rec_type) { case T_A: { char buf[INET_ADDRSTRLEN]; if (inet_ntop(AF_INET, (const struct sockaddr_in*)resData, buf, INET_ADDRSTRLEN)) { prioMap[rec_pref].push_back(buf); } } break; case T_AAAA: { char buf[INET6_ADDRSTRLEN]; if (inet_ntop(AF_INET6, (const struct sockaddr_in6*)resData, buf, INET6_ADDRSTRLEN)) { prioMap[rec_pref].push_back(buf); } } break; case T_MX: { char buf[MAXDNAME + 1]; len = dn_expand((unsigned char*)&response, resEnd, resData, (char*)&buf, sizeof buf - 1); if (len < 0) return false; prioMap[rec_pref].push_back(buf); } break; } } resData += rec_len; } #endif // merge map std::map >::iterator i; for(i = prioMap.begin(); i != prioMap.end(); ++i) { std::sort(i->second.begin(), i->second.end()); result.insert(result.end(), i->second.begin(), i->second.end()); } return true; } smtpping-1.1.3/resolver.hpp000066400000000000000000000035151273353255000157400ustar00rootroot00000000000000/* SMTP PING Copyright (C) 2011 Halon Security 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. */ #ifndef _RESOLVER_HPP_ #define _RESOLVER_HPP_ #include #include #include #if defined(__APPLE__) or defined(__FreeBSD__) or defined(__linux) #include #include #endif #ifdef __WIN32__ #include #include typedef VOID (WINAPI DNSRECORDLISTFREE)(PDNS_RECORD, DNS_FREE_TYPE); typedef DNSRECORDLISTFREE* LPDNSRECORDLISTFREE; typedef DNS_STATUS (WINAPI DNSQUERY)(LPCTSTR, WORD, DWORD, PIP4_ARRAY, PDNS_RECORD*, PVOID*); typedef DNSQUERY* LPDNSQUERY; #else #include #endif #ifndef MSG_NOSIGNAL #define MSG_NOSIGNAL 0 #endif class Resolver { public: typedef enum { RR_MX, RR_A, RR_AAAA, } RecordType; Resolver(); ~Resolver(); bool Lookup(const std::string& domain, RecordType recordType, std::vector& result); int GetLastError() const { #ifndef __WIN32__ return m_res.res_h_errno; #endif } private: #ifdef __WIN32__ HINSTANCE m_hDnsInst; LPDNSRECORDLISTFREE m_lpfnDnsRecordListFree; LPDNSQUERY m_lpfnDnsQuery; #else struct __res_state m_res; #endif }; #endif smtpping-1.1.3/smtpping.1000066400000000000000000000051631273353255000153120ustar00rootroot00000000000000.\" Copyright (C) 2015 Halon Security .\" .\" 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. .\" .Dd $Mdocdate: December 3 2015 $ .Dt SMTPPING 1 .Os .Sh NAME .Nm smtpping .Nd SMTP benchmarking and measurement tool .Sh SYNOPSIS .Nm .Op Fl dqrJ46 .Op Fl p Ar port .Op Fl w Ar wait .Op Fl c Ar count .Op Fl P Ar parallell .Op Fl s Ar size .Op Fl f Ar file .Op Fl H Ar hello .Op Fl S Ar sender .Ar recipient .Op Ar @server .Sh DESCRIPTION .Nm is a small tool that performs SMTP server delay, delay variation and throughput measurements. .Pp It must be invoked with the .Ar recipient email address. Normally, the .Ar server should also be specified (prefixed with @); otherwise .Nm will try to find the recipient domain's MX record, falling back on A/AAAA records. .Pp The following options are available: .Bl -tag -width Ds .It Fl 4 Use IPv4. .It Fl 6 Use IPv6. .It Fl p Ar port Specifies the TCP port to use (default: 25). .It Fl w Ar wait Time in milliseconds to wait between pings (default: 1000). .It Fl c Ar count Number of pings to send (default: unlimited). .It Fl P Ar processes Number of parallell worker processes (default: 1). To measure throughput, it's recommended to use .Fl r and .Fl w0 with this option. .It Fl s Ar size Ping message size in kilobytes (default: 10). Cannot be used in conjunction with the .Fl f option. .It Fl f Ar file Send the specified email file (message/rfc822) instead of a generated message. Cannot be used in conjunction with the .Fl s option. .It Fl H Ar helo HELO name (default: localhost.localdomain). .It Fl S Ar sender Sender address (default: <>). .It Fl r Display rate instead of transaction delays. To measure throughput, it's recommended to use .Fl w0 and possibly .Fl P with this option. .It Fl q Display less verbose output. .It Fl d Display more verbose output. .El .Sh AUTHORS .An -nosplit The .Nm program was written by .An Anders Berggren Aq Mt anders@desh.se and .An Erik Lax Aq Mt erik@datahack.se for Halon Security AB. smtpping-1.1.3/smtpping.cpp000066400000000000000000000426531273353255000157410ustar00rootroot00000000000000/* SMTP PING Copyright (C) 2011 Halon Security 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. */ #include #include #include #include #include #include #include #include #include #include #include using std::string; using std::vector; #ifdef __WIN32__ #include #include #include #else #include #include #include #include #include #include #if _POSIX_SEMAPHORES && MAP_ANONYMOUS #define SUPPORT_RATE #endif #endif /* DNS Resolver */ #include "resolver.hpp" /* * Global Variables */ bool debug = false; #define APP_VERSION "1.1.3" #define APP_NAME "smtpping" /* * Signal Handlers (abort ping and show statistics) */ bool abort_ping = false; void abort(int) { abort_ping = true; signal(SIGINT, SIG_DFL); } /* * SMTPReadLine: read a smtp line and return status code * return false on disconnect */ bool SMTPReadLine(int s, std::string& ret) { #ifdef __WIN32__ #define MSG_NOSIGNAL 0 #endif char buf[1]; string cmd; int r; do { r = recv(s, buf, sizeof buf, MSG_NOSIGNAL); if (r > 0) cmd += buf[0]; if (buf[0] == '\n') { if (debug) fprintf(stderr, "response %s", cmd.c_str()); /* support multi-line responses */ if (cmd.size() > 4 && cmd[3] == ' ') { ret = cmd.substr(0, 3); return true; } else cmd.clear(); } } while(r > 0); return false; } /* * high resolution timers (should return ms with 2 decimals) */ #ifdef WIN32 #include double PCFreq = 0.0; __int64 CounterStart = 0; /* initialize counters */ void StartCounter() { LARGE_INTEGER li; if(!QueryPerformanceFrequency(&li)) return; PCFreq = double(li.QuadPart)/1000.0; QueryPerformanceCounter(&li); CounterStart = li.QuadPart; } /* GetHighResTime(): should be ported */ double GetHighResTime() { LARGE_INTEGER li; QueryPerformanceCounter(&li); return double(li.QuadPart-CounterStart)/PCFreq; } #else #include /* GetHighResTime(): should be ported */ double GetHighResTime() { struct timeval tv; if(gettimeofday(&tv, NULL) != 0) return 0; return (tv.tv_sec * 1000.0) + (tv.tv_usec / 1000.0); } #endif /* * usage information, displays all arugments and a short help */ void usage(const char* name, FILE* fp, int status) { fprintf(fp, "Usage: " APP_NAME " [ARGS] x@y.z [@server]\n" "Where: x@y.z is the address that will receive e-mail\n" " server is the address to connect to (optional)\n" " ARGS is one or many of: (optional)\n" " -h, --help\tShow this help message\n" " -d, --debug\tShow more debugging\n" " -4\t\tUse IPv4\n" " -6\t\tUse IPv6\n" " -p, --port\tWhich TCP port to use [default: 25]\n" " -w, --wait\tTime to wait between PINGs [default: 1000]" " (ms)\n" " -c, --count\tNumber of messages [default: unlimited]\n" " -P, --parallel\tNumber of parallel workers [default: 1]\n" " -s, --size\tMessage size in kilobytes [default: 10]" " (KiB)\n" " -f, --file\tSend message file (RFC 822)\n" " -H, --helo\tHELO domain [default: localhost.localdomain]\n" " -S, --sender\tSender address [default: empty]\n" " -r, --rate\tShow message rate per second\n" " -q, --quiet\tShow less output\n" " -J\t\tRun in jailed mode (forbid --file)\n" "\n" " If no @server is specified, " APP_NAME " will try to find " "the recipient domain's\n MX record, falling back on A/AAAA " "records.\n" "\n" " " APP_NAME " " APP_VERSION " built on " __DATE__ " (c) Halon Security \n" ); exit(status); } int main(int argc, char* argv[]) { /* register signal handlers */ signal(SIGINT, abort); #ifdef __WIN32__ /* initialize winsock */ WSAData wData; WSAStartup(MAKEWORD(2,2), &wData); #endif /* default pareamters */ const char *smtp_helo = "localhost.localdomain"; const char *smtp_from = ""; const char *smtp_port = "25"; const char *smtp_rcpt = NULL; const char *smtp_file = NULL; unsigned int smtp_probes = 0; unsigned int smtp_probe_wait = 1000; unsigned int smtp_data_size = 10; unsigned int forks = 0; bool show_rate = false; bool quiet = false; bool safe_mode = false; unsigned int proto = 0; /* no arguments: show help */ if (argc < 2) usage(argv[0], stderr, 2); /* getopts/longopts */ static struct option longopts[] = { { "help", no_argument, NULL, 'h' }, { "helo", required_argument, NULL, 'H' }, { "sender", required_argument, NULL, 'S' }, { "count", required_argument, NULL, 'c' }, { "wait", required_argument, NULL, 'w' }, { "parallel", required_argument, NULL, 'P' }, { "size", required_argument, NULL, 's' }, { "port", required_argument, NULL, 'p' }, { "file", required_argument, NULL, 'f' }, { "rate", required_argument, NULL, 'r' }, { "quiet", required_argument, NULL, 'q' }, { NULL, 0, NULL, 0 } }; opterr = 0; optind = 0; int ch; while ((ch = getopt_long(argc, argv, "H:S:s:hw:c:P:p:df:rqJ46", longopts, NULL)) != -1) { switch(ch) { case 'H': smtp_helo = optarg; break; case 'S': smtp_from = optarg; break; case 's': smtp_data_size = strtoul(optarg, NULL, 10); break; case 'h': usage(argv[0], stdout, 0); break; case 'w': smtp_probe_wait = strtoul(optarg, NULL, 10); break; case 'c': smtp_probes = strtoul(optarg, NULL, 10); break; case 'p': smtp_port = optarg; break; case 'P': forks = strtoul(optarg, NULL, 10); break; case 'd': debug = true; break; case 'r': show_rate = true; quiet = true; break; case 'q': quiet = true; break; case 'f': smtp_file = optarg; break; case 'J': safe_mode = true; break; case '4': proto = AF_INET; break; case '6': proto = AF_INET6; break; default: usage(argv[0], stderr, 2); break; } } if (safe_mode && smtp_file) usage(argv[0], stderr, 2); argc -= optind; argv += optind; /* no e-mail or mx specified */ if (argc < 1) usage(argv[0], stderr, 2); /* mail address */ smtp_rcpt = argv[0]; string data; if (smtp_file) { /* read smtp_file */ std::ifstream ifs(smtp_file, std::ios::in | std::ios::binary); if (!ifs.good()) fprintf(stderr, "warning: file %s could not be opened\n" , smtp_file); else data.append(std::istreambuf_iterator(ifs.rdbuf()), std::istreambuf_iterator()); data += ".\r\n"; } else { /* generate message with approximatly size */ data += "Subject: SMTP Ping\r\n"; data += "Content-Type: text/plain\r\n"; data += string("From: <") + smtp_from + ">\r\n"; data += string("To: <") + smtp_rcpt + ">\r\n"; data += "\r\n"; while (data.size() / 1024 < smtp_data_size) data += "AABBCCDDEEFFGGHHIIJJKKLLMMNNOOPPQQRRSSTTUUVVWWXXYYZZ" "00112233445566778899\r\n"; data += "\r\n.\r\n"; } Resolver resolv; vector address; /* user@example.com @mailserver */ if (argc > 1) { if (argv[1][0] != '@') usage(argv[0], stderr, 2); /* jmp past '@' */ const char* domain = argv[1] + 1; /* resolve as A/AAAA */ if (!resolv.Lookup(domain, Resolver::RR_A, address)) if (debug) fprintf(stderr, "warning: failed to resolve " "A for %s\n", domain); if (!resolv.Lookup(domain, Resolver::RR_AAAA, address)) if (debug) fprintf(stderr, "warning: failed to resolve " "AAAA for %s\n", domain); /* could not resolve, try to use address */ if (address.empty()) address.push_back(domain); } else { /* use mailaddress as mx */ const char* domain = strrchr(smtp_rcpt, '@'); /* no domain, abort! */ if (!domain) usage(argv[0], stderr, 2); /* jmp past '@' */ domain += 1; /* resolve as MX, with A/AAAA fallback */ vector mx; if (!resolv.Lookup(domain, Resolver::RR_MX, mx)) { /* if dns failed, we should not try A/AAAA, only if no data is returned */ fprintf(stderr, "failed to resolve %s\n", domain); } else { /* no data, try A/AAAAA */ if (mx.empty()) { if (debug) fprintf(stderr, " no mx, failling " "back on A/AAAA record for %s\n", domain); if (!resolv.Lookup(domain, Resolver::RR_A, address)) if (debug) fprintf(stderr, "failed to " "resolve A for %s\n", domain); if (!resolv.Lookup(domain, Resolver::RR_AAAA, address)) if (debug) fprintf(stderr, "failed to " "resolve AAAA for %s\n", domain); } else { /* resolve all mx */ for(vector::const_iterator i = mx.begin(); i != mx.end(); ++i) { bool ok = false; if (!resolv.Lookup(*i, Resolver::RR_A, address)) { if (debug) fprintf(stderr, "warning: failed " "to resolve A for %s\n", i->c_str()); else ok = true; } if (!resolv.Lookup(*i, Resolver::RR_AAAA, address)) { if (debug) fprintf(stderr, "warning: failed to " "resolve AAAA for %s\n", i->c_str()); else ok = true; } /* could not reslove as either A or AAAA: maybe it's an IP */ if (!ok) address.push_back(*i); } } } } #ifdef SUPPORT_RATE sem_t* sem = (sem_t*)mmap(NULL, sizeof(sem_t), PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0); if (sem_init(sem, 1, 1) != 0) fprintf(stderr, "sem_init: failed\n"); size_t* counter = (size_t*)mmap(NULL, sizeof(size_t), PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0); *counter = 0; #else if (show_rate) { fprintf(stderr, "-r is not supported on this platform\n"); return 1; } #endif unsigned int child = 1; if (forks > 1) { #ifdef __WIN32__ fprintf(stderr, "-P is not supported on this platform\n"); return 1; #else pid_t pid; for (; child <= forks; ++child) { pid = fork(); if (pid == 0) goto spawn; } #ifdef SUPPORT_RATE while (show_rate && !abort_ping) { sem_wait(sem); printf("%zu/s\n", *counter); *counter = 0; sem_post(sem); sleep(1); } #endif while ((pid = waitpid(-1, NULL, 0))) { if (errno == ECHILD) { break; } } return 0; #endif } else if (show_rate) { fprintf(stderr, "-r only works with -P2 or greater\n"); return 1; } spawn: /* register statistics */ #define STATS_GLOB(name) \ double smtp_##name##_min = -1, smtp_##name##_max = -1,\ smtp_##name##_sum = 0 , smtp_##name##_num = 0; STATS_GLOB(connect); STATS_GLOB(banner); STATS_GLOB(helo); STATS_GLOB(mailfrom); STATS_GLOB(rcptto); STATS_GLOB(data); STATS_GLOB(datasent); STATS_GLOB(quit); #define STATS(name, min) \ double smtp_##name = GetHighResTime();\ if (smtp_##name - smtp_##min < smtp_##name##_min ||\ smtp_##name##_min == -1)\ smtp_##name##_min = smtp_##name - smtp_##min;\ if (smtp_##name - smtp_##min > smtp_##name##_max ||\ smtp_##name##_max == -1)\ smtp_##name##_max = smtp_##name - smtp_##min;\ smtp_##name##_sum += smtp_##name - smtp_##min; smtp_##name##_num++; #define STATS_TIME(name) \ (smtp_##name - smtp_init) #define STATS_SESSION_TIME(name) \ (smtp_##name - smtp_connect) /* connect to the first working address */ unsigned int smtp_seq = 0; vector::const_iterator i; for(i = address.begin(); i != address.end(); ++i) { struct addrinfo *res = NULL, resTmp; memset(&resTmp, 0, sizeof resTmp); resTmp.ai_family = AF_UNSPEC; resTmp.ai_socktype = SOCK_STREAM; int r = getaddrinfo(i->c_str(), smtp_port, &resTmp, &res); if (r != 0) { fprintf(stderr, "getaddrinfo() failed %s: %s\n", i->c_str(), gai_strerror(r)); continue; } if (proto && res->ai_family != proto) continue; /* print header */ if (!quiet) printf("PING %s ([%s]:%s): %d bytes (SMTP DATA)\n", smtp_rcpt, i->c_str(), smtp_port, (unsigned int)data.size()); reconnect: /* abort by ctrl+c or if smtp_seq is done */ if (abort_ping || (smtp_probes && smtp_seq >= smtp_probes)) { freeaddrinfo(res); break; } /* sleep between smtp_req */ if (smtp_seq > 0) { #ifdef __WIN32__ Sleep(smtp_probe_wait); #else usleep(smtp_probe_wait * 1000); #endif } /* only increase if smtp_req > 0 */ if (smtp_seq > 0) smtp_seq++; int s = socket(res->ai_family, res->ai_socktype, res->ai_protocol); if (s == -1) { fprintf(stderr, "seq=%u: socket() failed\n", smtp_seq); if (smtp_seq == 0) { freeaddrinfo(res); continue; } else { goto reconnect; } } /* initiate counters on windows */ #ifdef __WIN32__ StartCounter(); #endif /* start up time */ double smtp_init = GetHighResTime(); /* connect */ if (connect(s, res->ai_addr, res->ai_addrlen) != 0) { fprintf(stderr, "seq=%u: connect() failed " "%s\n", smtp_seq, i->c_str()); if (smtp_seq == 0) { freeaddrinfo(res); continue; } else { close(s); goto reconnect; } } STATS(connect, init); /* if it's working, start smtp_req */ if (smtp_seq == 0) smtp_seq = 1; /* * < SMTP Banner */ string ret, cmd; if (!SMTPReadLine(s, ret) || ret != "220") { fprintf(stderr, "seq=%u: recv: BANNER failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(banner, connect); /* * > HELO helo * < 250 OK */ cmd = string("HELO ") + smtp_helo + "\r\n"; if (send(s, cmd.c_str(), cmd.size(), 0) != (int)cmd.size()) { fprintf(stderr, "seq=%u: send: failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret) || ret != "250") { fprintf(stderr, "seq=%u: recv: HELO failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(helo, connect); /* * > MAIL FROM:
* < 250 OK */ cmd = string("MAIL FROM: <") + smtp_from + ">\r\n"; if (send(s, cmd.c_str(), cmd.size(), 0) != (int)cmd.size()) { fprintf(stderr, "seq=%u: send: failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret) || ret != "250") { fprintf(stderr, "seq=%u: recv: MAIL FROM failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(mailfrom, connect); /* * > RCPT TO:
* < 250 OK */ cmd = string("RCPT TO: <") + smtp_rcpt + ">\r\n"; if (send(s, cmd.c_str(), cmd.size(), 0) != (int)cmd.size()) { fprintf(stderr, "seq=%u: send: failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret) || ret != "250") { fprintf(stderr, "seq=%u: recv: RCPT TO failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(rcptto, connect); /* * > DATA * < 354 Feed me */ cmd = string("DATA\r\n"); if (send(s, cmd.c_str(), cmd.size(), 0) != (int)cmd.size()) { fprintf(stderr, "seq=%u: send: failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret) || ret != "354") { fprintf(stderr, "seq=%u: recv: DATA failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(data, connect); /* * > data... * < ??? Mkay */ if (send(s, data.c_str(), data.size(), 0) != (int)data.size()) { fprintf(stderr, "seq=%u: send: failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret)) { fprintf(stderr, "seq=%u: recv: EOM failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(datasent, connect); /* * > QUIT * < ??? Mkay */ cmd = string("QUIT\r\n"); if (send(s, cmd.c_str(), cmd.size(), 0) != (int)cmd.size()) { fprintf(stderr, "seq=%u: send: QUIT failed\n", smtp_seq); close(s); goto reconnect; } if (!SMTPReadLine(s, ret)) { fprintf(stderr, "seq=%u: recv: QUIT failed (%s)\n", smtp_seq, ret.c_str()); close(s); goto reconnect; } STATS(quit, connect); shutdown(s, 2); close(s); #ifdef SUPPORT_RATE if (forks > 1) { sem_wait(sem); (*counter)++; sem_post(sem); } #endif /* print statistics */ if (!quiet) printf("seq=%u, connect=%.2lf ms, helo=%.2lf ms, " "mailfrom=%.2lf ms, rcptto=%.2lf ms, datasent=%.2lf ms, " "quit=%.2lf ms\n", smtp_seq, STATS_TIME(connect), STATS_SESSION_TIME(helo), STATS_SESSION_TIME(mailfrom), STATS_SESSION_TIME(rcptto), STATS_SESSION_TIME(datasent), STATS_SESSION_TIME(quit) ); /* next loop */ goto reconnect; } /* if we successfully connected somewhere */ if (forks > 1) ; else if (i != address.end() && smtp_seq > 0) { printf("\n--- %s SMTP ping statistics ---\n", i->c_str()); printf("%u e-mail messages transmitted\n", smtp_seq); #define SHOWSTAT(x) \ printf(#x " min/avg/max = %.2lf/%.2lf/%.2lf ms\n", \ smtp_##x##_min, smtp_##x##_num>0?smtp_##x##_sum / smtp_##x##_num:0, \ smtp_##x##_max); SHOWSTAT(connect); SHOWSTAT(banner); SHOWSTAT(helo); SHOWSTAT(mailfrom); SHOWSTAT(rcptto); SHOWSTAT(data); SHOWSTAT(datasent); SHOWSTAT(quit); } else { printf("\n--- no pings were sent ---\n"); } #ifdef __WIN32__ if (abort_ping) { printf("Aborted by Control-C\n"); } WSACleanup(); #endif return 0; } smtpping-1.1.3/smtpping.dev000066400000000000000000000021761273353255000157310ustar00rootroot00000000000000[Project] FileName=smtpping.dev Name=smtpping UnitCount=3 Type=1 Ver=1 ObjFiles= Includes= Libs= PrivateResource= ResourceIncludes= MakeIncludes= Compiler= CppCompiler= Linker=-lws2_32_@@_ IsCpp=1 Icon= ExeOutput= ObjectOutput= OverrideOutput=0 OverrideOutputName=smtpping.exe HostApplication= Folders= CommandLine= UseCustomMakefile=0 CustomMakefile= IncludeVersionInfo=0 SupportXPThemes=0 CompilerSet=0 CompilerSettings=0000000000000000000000 [Unit1] FileName=resolver.cpp CompileCpp=1 Folder=smtpping Compile=1 Link=1 Priority=1000 OverrideBuildCmd=0 BuildCmd= [Unit2] FileName=resolver.hpp CompileCpp=1 Folder=smtpping Compile=1 Link=1 Priority=1000 OverrideBuildCmd=0 BuildCmd= [Unit3] FileName=smtpping.cpp CompileCpp=1 Folder=smtpping Compile=1 Link=1 Priority=1000 OverrideBuildCmd=0 BuildCmd= [VersionInfo] Major=0 Minor=1 Release=1 Build=1 LanguageID=1033 CharsetID=1252 CompanyName= FileVersion= FileDescription=Developed using the Dev-C++ IDE InternalName= LegalCopyright= LegalTrademarks= OriginalFilename= ProductName= ProductVersion= AutoIncBuildNr=0