Changeset 446

Timestamp:

07/14/05 22:45:57 (8 years ago)

Author:

ahu

Message:

made dnsreplay lots more efficient

Files:

• trunk/pdns/pdns/dnsreplay.cc (modified) (11 diffs)

trunk/pdns/pdns/dnsreplay.cc

@@ -36 +36 @@
 
 StatBag S;
+bool s_quiet=true;
 
 class DNSIDManager
@@ -43 +44 @@
   int getID()
   {
-
-    for(unsigned int n=0; n < d_freeids.size() ; ++n)
+    for(uint16_t n=d_lastfreeid+1; n != d_lastfreeid ; ++n)
       if(!d_freeids[n]) {
         d_freeids[n]=1;
+        d_lastfreeid=n;
         return n;
       }
@@ -58 +59 @@
       throw runtime_error("Trying to release unused id: "+lexical_cast<string>(id));
     d_freeids[id]=0;
+    d_lastfreeid=id-1;
   }
 
 private:
   bitset<65536> d_freeids;
+  uint16_t d_lastfreeid;
 } s_idmanager;
 
@@ -82 +85 @@
 unsigned int s_weunmatched, s_origunmatched;
 unsigned int s_wednserrors, s_origdnserrors;
-// XXX FIXME wasteful
+
 void pruneQids()
 {
-  qids_t nqids;
   struct timeval now;
   gettimeofday(&now, 0);
-  for(qids_t::iterator i=qids.begin(); i!=qids.end(); ++i)
+
+  for(qids_t::iterator i=qids.begin(); i!=qids.end(); ) {
     if(now.tv_sec < i->second.d_sentTime.tv_sec + 4 || (now.tv_sec == i->second.d_sentTime.tv_sec &&  now.tv_usec < i->second.d_sentTime.tv_usec)) 
-      nqids[i->first]=i->second;
+      ++i;
     else {
       s_idmanager.releaseID(i->second.d_assignedID);
@@ -99 +102 @@
       else
         cerr<<"Impossible - finished QI in the pool"<<endl;
-    }
-
-  nqids.swap(qids);
+      qids.erase(i++);
+    }
+  }
 }
 
@@ -121 +124 @@
 {
   QuestionData qd=qids[qi];
-  cout<<qi<<", orig rcode: "<<qd.d_origRcode<<", ours: "<<qd.d_newRcode;
+
 
   set<DNSRecord> canonicOrig, canonicNew;
   compactAnswerSet(qd.d_origAnswers, canonicOrig);
   compactAnswerSet(qd.d_newAnswers, canonicNew);
-  
-  cout<<", "<<canonicOrig.size()<< " vs " << canonicNew.size()<<", perfect: ";
+
+  if(!s_quiet) {
+    cout<<qi<<", orig rcode: "<<qd.d_origRcode<<", ours: "<<qd.d_newRcode;  
+    cout<<", "<<canonicOrig.size()<< " vs " << canonicNew.size()<<", perfect: ";
+  }
 
   if(canonicOrig==canonicNew) {
     s_perfect++;
-    cout<<"yes\n";
+    if(!s_quiet)
+      cout<<"yes\n";
   }
   else {
-    cout<<"no\n";
+    if(!s_quiet)
+      cout<<"no\n";
     
     if(qd.d_norecursionavailable)
-      cout<<"\t* original nameserver did not provide recursion for this question *"<<endl;
+      if(!s_quiet)
+        cout<<"\t* original nameserver did not provide recursion for this question *"<<endl;
     if(qd.d_origRcode == qd.d_newRcode ) {
-      cout<<"\t* mostly correct *"<<endl;
+      if(!s_quiet)
+        cout<<"\t* mostly correct *"<<endl;
       s_mostly++;
     }
 
     if(!isRcodeOk(qd.d_origRcode) && isRcodeOk(qd.d_newRcode)) {
-      cout<<"\t* we better *"<<endl;
+      if(!s_quiet)
+        cout<<"\t* we better *"<<endl;
       s_webetter++;
     }
     if(isRcodeOk(qd.d_origRcode) && !isRcodeOk(qd.d_newRcode)) {
-      cout<<"\t* orig better *"<<endl;
+      if(!s_quiet)
+        cout<<"\t* orig better *"<<endl;
       s_origbetter++;
       s_origbetterset.insert(make_pair(qi.d_qname, qi.d_qtype));
     }
 
-    cout<<"orig:\n";
-    for(set<DNSRecord>::const_iterator i=canonicOrig.begin(); i!=canonicOrig.end(); ++i)
+    if(!s_quiet) {
+      cout<<"orig:\n";
+      for(set<DNSRecord>::const_iterator i=canonicOrig.begin(); i!=canonicOrig.end(); ++i)
+        cout<<"\t"<<i->d_label<<"\t"<<DNSRecordContent::NumberToType(i->d_type)<<"\t'"  << (i->d_content ? i->d_content->getZoneRepresentation() : "") <<"'\n";
+      cout<<"new:\n";
+      for(set<DNSRecord>::const_iterator i=canonicNew.begin(); i!=canonicNew.end(); ++i)
       cout<<"\t"<<i->d_label<<"\t"<<DNSRecordContent::NumberToType(i->d_type)<<"\t'"  << (i->d_content ? i->d_content->getZoneRepresentation() : "") <<"'\n";
-    cout<<"new:\n";
-    for(set<DNSRecord>::const_iterator i=canonicNew.begin(); i!=canonicNew.end(); ++i)
-      cout<<"\t"<<i->d_label<<"\t"<<DNSRecordContent::NumberToType(i->d_type)<<"\t'"  << (i->d_content ? i->d_content->getZoneRepresentation() : "") <<"'\n";
-    cout<<"\n";
+      cout<<"\n";
+    }
   }
 
@@ -251 +265 @@
     if(!((once++)%2000)) {
       Lock l(&s_lock);
+
+      if(qids.size() > 1000) {
+        cerr<<"Too many questions outstanding, waiting a second"<<endl;
+        sleep(1);
+      }
+      
       pruneQids();
+
+      cerr<<"There are "<<qids.size()<<" queries in flight"<<endl;
+
       cerr<<"we drop: "<<s_timedout<<", orig drop: "<<s_nooriginalanswer<<", "<<s_questions<<" questions sent, "<<s_answers
           <<" original answers, "<<s_perfect<<" perfect, "<<s_mostly<<" mostly correct"<<", "<<s_webetter<<" we better, "<<s_origbetter<<" orig better ("<<s_origbetterset.size()<<" diff)"<<endl;
@@ -273 +296 @@
           Lock l(&s_lock);
           if(qids.count(qi)) {
-            cout<<"Saw an exact duplicate question, "<<qi<< endl;
+            if(!s_quiet)
+              cout<<"Saw an exact duplicate question, "<<qi<< endl;
             continue;
           }
@@ -291 +315 @@
           double seconds=pr.d_pheader.ts.tv_sec - lastsent.tv_sec;
           double useconds=(pr.d_pheader.ts.tv_usec - lastsent.tv_usec);
+
+          if(useconds < 0) {
+            seconds-=1;
+            useconds+=1000000;
+          }
+
           double factor=10;
           
@@ -301 +331 @@
           tosleep.tv_sec=nanoseconds/1000000000UL;
           tosleep.tv_nsec=nanoseconds%1000000000UL;
-          
+
           nanosleep(&tosleep, 0);
           lastsent=pr.d_pheader.ts;
         }
+        if(!lastsent.tv_sec)
+          lastsent=pr.d_pheader.ts;
 
         //      cout<<"sending!"<<endl;
@@ -333 +365 @@
         else {
           s_origunmatched++;
-          cout<<"Unmatched original answer "<<qi<<endl;
+          if(!s_quiet)
+            cout<<"Unmatched original answer "<<qi<<endl;
         }
       }