/* +------------------------------------+ * | Inspire Internet Relay Chat Daemon | * +------------------------------------+ * * Inspire is copyright (C) 2002-2004 ChatSpike-Dev. * E-mail: * * * * Written by Craig Edwards, Craig McLure, and others. * This program is free but copyrighted software; see * the file COPYING for details. * * --------------------------------------------------- */ /* Now with added unF! ;) */ using namespace std; #include "inspircd.h" #include "inspircd_io.h" #include "inspircd_util.h" #include "inspircd_config.h" #include #include #include #include #include #include #include #include #ifdef GCC3 #include #else #include #endif #include #include #include #include #include #include #include #include #include "connection.h" #include "users.h" #include "servers.h" #include "ctables.h" #include "globals.h" #include "modules.h" #include "dynamic.h" #include "wildcard.h" #include "message.h" #include "mode.h" #include "commands.h" #include "xline.h" #include "inspstring.h" #include "dnsqueue.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "dns.h" #ifdef GCC3 #define nspace __gnu_cxx #else #define nspace std #endif extern int MaxWhoResults; extern std::vector modules; extern std::vector module_names; extern std::vector factory; extern std::vector fd_reap; extern int MODCOUNT; namespace nspace { #ifdef GCC34 template<> struct hash #else template<> struct nspace::hash #endif { size_t operator()(const struct in_addr &a) const { size_t q; memcpy(&q,&a,sizeof(size_t)); return q; } }; #ifdef GCC34 template<> struct hash #else template<> struct nspace::hash #endif { size_t operator()(const string &s) const { char a[MAXBUF]; static struct hash strhash; strlcpy(a,s.c_str(),MAXBUF); strlower(a); return strhash(a); } }; } struct StrHashComp { bool operator()(const string& s1, const string& s2) const { char a[MAXBUF],b[MAXBUF]; strlcpy(a,s1.c_str(),MAXBUF); strlcpy(b,s2.c_str(),MAXBUF); strlower(a); strlower(b); return (strcasecmp(a,b) == 0); } }; struct InAddr_HashComp { bool operator()(const in_addr &s1, const in_addr &s2) const { size_t q; size_t p; memcpy(&q,&s1,sizeof(size_t)); memcpy(&p,&s2,sizeof(size_t)); return (q == p); } }; typedef nspace::hash_map, StrHashComp> user_hash; typedef nspace::hash_map, StrHashComp> chan_hash; typedef nspace::hash_map, InAddr_HashComp> address_cache; typedef std::deque command_table; extern user_hash clientlist; extern chan_hash chanlist; extern user_hash whowas; extern command_table cmdlist; extern ClassVector Classes; extern char DNSServer[MAXBUF]; long max_fd_alloc = 0; extern time_t TIME; class Lookup { private: DNS resolver; char u[NICKMAX]; public: Lookup() { strcpy(u,""); } void Reset() { strcpy(u,""); } ~Lookup() { } bool DoLookup(std::string nick) { userrec* usr = Find(nick); if (usr) { log(DEBUG,"New Lookup class for %s with DNSServer set to '%s'",nick.c_str(),DNSServer); resolver.SetNS(DNSServer); if (!resolver.ReverseLookup(usr->host)) return false; strlcpy(u,nick.c_str(),NICKMAX); return true; } return false; } bool Done() { userrec* usr = NULL; if (resolver.HasResult()) { if (resolver.GetFD() != 0) { std::string hostname = resolver.GetResult(); usr = Find(u); if (usr) { if (usr->registered > 3) { usr->dns_done = true; return true; } if ((hostname != "") && (usr->registered != 7)) { strlcpy(usr->host,hostname.c_str(),MAXBUF); strlcpy(usr->dhost,hostname.c_str(),MAXBUF); WriteServ(usr->fd,"NOTICE Auth :Resolved your hostname: %s",hostname.c_str()); usr->dns_done = true; return true; } usr->dns_done = true; return true; } } else { usr = Find(u); if (usr) usr->dns_done = true; return true; } } return false; } int GetFD() { userrec* usr = Find(u); if (!usr) return 0; if (usr->dns_done) return 0; return usr->fd; } }; Lookup dnsq[MAXBUF]; bool lookup_dns(std::string nick) { userrec* u = Find(nick); if (u) { // place a new user into the queue... log(DEBUG,"Queueing DNS lookup for %s",u->nick); WriteServ(u->fd,"NOTICE Auth :Looking up your hostname..."); Lookup L; if (L.DoLookup(nick)) { for (int j = 0; j < MAXBUF; j++) { if (!dnsq[j].GetFD()) { dnsq[j] = L; return true; } } // calculate the maximum value, this saves cpu time later for (int p = 0; p < MAXBUF; p++) if (dnsq[p].GetFD()) max_fd_alloc = p; } else { return false; } } return false; } void dns_poll() { // do we have items in the queue? for (int j = 0; j <= max_fd_alloc; j++) { // are any ready, or stale? if (dnsq[j].GetFD()) { if (dnsq[j].Done()) { dnsq[j].Reset(); } } } // looks like someones freed an item, recalculate end of list. if ((!dnsq[max_fd_alloc].GetFD()) && (max_fd_alloc != 0)) for (int p = 0; p < MAXBUF; p++) if (dnsq[p].GetFD()) max_fd_alloc = p; }