summaryrefslogtreecommitdiffstats
path: root/package/busybox/busybox-1.5.0-max_host_len_40.patch
diff options
context:
space:
mode:
authorPeter Korsgaard <jacmet@sunsite.dk>2008-03-26 21:53:15 +0000
committerPeter Korsgaard <jacmet@sunsite.dk>2008-03-26 21:53:15 +0000
commit9c078e173aa2ce9d386942e8acb6acf811eeeddf (patch)
tree4e75fb59cfd5a889f9c07197d4118ade21c406a2 /package/busybox/busybox-1.5.0-max_host_len_40.patch
parent49a411ea7374a4f2bb5d8ed69b99d2cd5a6fee2e (diff)
downloadbuildroot-novena-9c078e173aa2ce9d386942e8acb6acf811eeeddf.tar.gz
buildroot-novena-9c078e173aa2ce9d386942e8acb6acf811eeeddf.zip
busybox: remove unused configs/patches
Diffstat (limited to 'package/busybox/busybox-1.5.0-max_host_len_40.patch')
-rw-r--r--package/busybox/busybox-1.5.0-max_host_len_40.patch37
1 files changed, 0 insertions, 37 deletions
diff --git a/package/busybox/busybox-1.5.0-max_host_len_40.patch b/package/busybox/busybox-1.5.0-max_host_len_40.patch
deleted file mode 100644
index 7b9ba1f77..000000000
--- a/package/busybox/busybox-1.5.0-max_host_len_40.patch
+++ /dev/null
@@ -1,37 +0,0 @@
-diff -ur busybox-1.5.0/networking/dnsd.c busybox-1.5.0-patched/networking/dnsd.c
---- busybox-1.5.0/networking/dnsd.c 2007-03-22 15:21:23.000000000 -0500
-+++ busybox-1.5.0-patched/networking/dnsd.c 2007-04-13 06:53:49.000000000 -0500
-@@ -30,7 +30,7 @@
- #define DEBUG 0
-
- enum {
-- MAX_HOST_LEN = 16, // longest host name allowed is 15
-+ MAX_HOST_LEN = 41, // longest host name allowed is 40
- IP_STRING_LEN = 18, // .xxx.xxx.xxx.xxx\0
-
- //must be strlen('.in-addr.arpa') larger than IP_STRING_LEN
-@@ -186,17 +186,21 @@
- {
- int i;
- struct dns_entry *d=dnsentry;
-+ char *p,*q;
-+
-+ q = (char *)&(qs[1]);
-+ p = &(d->name[1]);
-
- do {
- #if DEBUG
-- char *p,*q;
-- q = (char *)&(qs[1]);
-- p = &(d->name[1]);
- fprintf(stderr, "\n%s: %d/%d p:%s q:%s %d",
- __FUNCTION__, (int)strlen(p), (int)(d->name[0]),
- p, q, (int)strlen(q));
- #endif
- if (type == REQ_A) { /* search by host name */
-+ p = &(d->name[1]);
-+ if(strlen(q) != strlen(p))
-+ continue;
- for (i = 1; i <= (int)(d->name[0]); i++)
- if (tolower(qs[i]) != d->name[i])
- break;