upstream/unbound
1
0
Fork 0
mirror of https://github.com/NLnetLabs/unbound.git synced 2025-12-20 23:00:56 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

review comments. updated ldns tarball with 1.6.2.

Browse source 
git-svn-id: file:///svn/unbound/trunk@1898 be551aaa-1e26-0410-a405-d3ace91eadb9
This commit is contained in:
Wouter Wijngaards 2009-11-11 16:18:38 +00:00
parent 5bc9a80e40
commit eb6253aa6c
6 changed files with 10 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
doc/Changelog
View file

@ -1,3 +1,7 @@
11 November 2009: Wouter
- ldns tarball updated (to 1.6.2).
- review comments.
10 November 2009: Wouter 10 November 2009: Wouter
- Thanks to Surfnet found bug in new dnssec-retry code that failed - Thanks to Surfnet found bug in new dnssec-retry code that failed
to combine well when combined with DLV and a particular failure. to combine well when combined with DLV and a particular failure.

BIN
ldns-src.tar.gz
View file

Binary file not shown.

5
testcode/replay.c
View file

@ -243,7 +243,7 @@ read_assign_step(char* remain, struct replay_moment* mom)
fatal_exit("cannot parse assign: %s", remain); fatal_exit("cannot parse assign: %s", remain);
mom->variable = strdup(buf); mom->variable = strdup(buf);
if(eq != '=') if(eq != '=')
fatal_exit("no = in assign: %s", remain); fatal_exit("no '=' in assign: %s", remain);
remain += skip; remain += skip;
if(remain[0]) remain[strlen(remain)-1]=0; /* remove newline */ if(remain[0]) remain[strlen(remain)-1]=0; /* remove newline */
mom->string = strdup(remain); mom->string = strdup(remain);
@ -308,7 +308,8 @@ replay_moment_read(char* remain, FILE* in, const char* name, int* lineno,
remain++; remain++;
mom->string = strdup(remain); mom->string = strdup(remain);
if(!mom->string) fatal_exit("out of memory"); if(!mom->string) fatal_exit("out of memory");
mom->string[strlen(mom->string)-1]=0; if(strlen(mom->string)>0)
mom->string[strlen(mom->string)-1]=0;
remain += strlen(mom->string); remain += strlen(mom->string);
} }
} else if(parse_keyword(&remain, "CHECK_AUTOTRUST")) { } else if(parse_keyword(&remain, "CHECK_AUTOTRUST")) {

2
testcode/replay.h
View file

@ -88,7 +88,7 @@
* o number is that number. * o number is that number.
* o ${variables and arithmetic } * o ${variables and arithmetic }
* o +, -, / and *. Note, evaluated left-to-right. Use ${} for brackets. * o +, -, / and *. Note, evaluated left-to-right. Use ${} for brackets.
* So again, no precedence rules, so 2+3*4 === ${2+3}*4 === 20. * So again, no precedence rules, so 2+3*4 == ${2+3}*4 = 20.
* Do 2+${3*4} to get 24. * Do 2+${3*4} to get 24.
* o ${function params} * o ${function params}
* o ${time} is the current time for the simulated unbound. * o ${time} is the current time for the simulated unbound.

2
util/config_file.c
View file

@ -1144,7 +1144,7 @@ void errinf_origin(struct module_qstate* qstate, struct sock_list *origin)
char buf[256]; char buf[256];
if(p == origin) if(p == origin)
snprintf(buf, sizeof(buf), "from "); snprintf(buf, sizeof(buf), "from ");
else snprintf(buf, sizeof(buf), "and from "); else snprintf(buf, sizeof(buf), "and ");
if(p->len == 0) if(p->len == 0)
snprintf(buf+strlen(buf), sizeof(buf)-strlen(buf), snprintf(buf+strlen(buf), sizeof(buf)-strlen(buf),
"cache"); "cache");

2
util/net_help.c
View file

@ -506,7 +506,7 @@ void sock_list_insert(struct sock_list** list, struct sockaddr_storage* addr,
add->next = *list; add->next = *list;
add->len = len; add->len = len;
*list = add; *list = add;
if(len) memcpy(&add->addr, addr, len); if(len) memmove(&add->addr, addr, len);
} }
void sock_list_prepend(struct sock_list** list, struct sock_list* add) void sock_list_prepend(struct sock_list** list, struct sock_list* add)