From: Wouter Wijngaards <wouter@nlnetlabs.nl>
Date: Fri, 27 Apr 2007 09:37:38 +0000 (+0000)
Subject: TODO listing, comment fix
X-Git-Tag: release-0.3~39
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=379d94c4b280e8e25dc63ee3e300a795fa60f61a;p=thirdparty%2Funbound.git

TODO listing, comment fix


git-svn-id: file:///svn/unbound/trunk@264 be551aaa-1e26-0410-a405-d3ace91eadb9
---

diff --git a/doc/TODO b/doc/TODO
index 143766f1e..002a11dbe 100644
--- a/doc/TODO
+++ b/doc/TODO
@@ -11,4 +11,5 @@ o possible optimization, so that precious id number resource is not depleted
   by parsing of messages. Delay malloc, as above, or try to reverse release
   special id numbers, and if you release the next_id number for the thread
   it reuses that id number.
-o calculate rdata size during parse step, instead of delay until copy.
+o use rbtree to compress domain names in messages, sorted AXFRs of 16Kb
+  and so on. This may be faster for that case.
diff --git a/util/data/msgreply.c b/util/data/msgreply.c
index eb9cb46a6..34ac938f9 100644
--- a/util/data/msgreply.c
+++ b/util/data/msgreply.c
@@ -612,7 +612,7 @@ compress_tree_insert(struct compress_tree_node** tree, uint8_t* dname,
 	while(p) {
 		c = dname_lab_cmp(dname, labs, p->dname, p->labs, &m);
 		log_assert(c != 0); /* may not already be in tree */
-		if(c==0) return p;
+		if(c==0) return p; /* insert only once */
 		if(c<0)	{
 			prev = &p->left;
 			p = p->left;