⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ns_print.c

📁 bind 9.3结合mysql数据库
💻 C
📖 第 1 页 / 共 2 页
字号:
		char base64_key[NS_MD5RSA_MAX_BASE64];		u_int keyflags, protocol, algorithm, key_id;		const char *leader;		int n;		if (rdlen < 0U + NS_INT16SZ + NS_INT8SZ + NS_INT8SZ)			goto formerr;		/* Key flags, Protocol, Algorithm. */		key_id = dst_s_dns_key_id(rdata, edata-rdata);		keyflags = ns_get16(rdata);  rdata += NS_INT16SZ;		protocol = *rdata++;		algorithm = *rdata++;		len = SPRINTF((tmp, "0x%04x %u %u",			       keyflags, protocol, algorithm));		T(addstr(tmp, len, &buf, &buflen));		/* Public key data. */		len = b64_ntop(rdata, edata - rdata,			       base64_key, sizeof base64_key);		if (len < 0)			goto formerr;		if (len > 15) {			T(addstr(" (", 2, &buf, &buflen));			leader = "\n\t\t";			spaced = 0;		} else			leader = " ";		for (n = 0; n < len; n += 48) {			T(addstr(leader, strlen(leader), &buf, &buflen));			T(addstr(base64_key + n, MIN(len - n, 48),				 &buf, &buflen));		}		if (len > 15)			T(addstr(" )", 2, &buf, &buflen));		n = SPRINTF((tmp, " ; key_tag= %u", key_id));		T(addstr(tmp, n, &buf, &buflen));		break;	    }	case ns_t_sig: {		char base64_key[NS_MD5RSA_MAX_BASE64];		u_int type, algorithm, labels, footprint;		const char *leader;		u_long t;		int n;		if (rdlen < 22U)			goto formerr;		/* Type covered, Algorithm, Label count, Original TTL. */	        type = ns_get16(rdata);  rdata += NS_INT16SZ;		algorithm = *rdata++;		labels = *rdata++;		t = ns_get32(rdata);  rdata += NS_INT32SZ;		len = SPRINTF((tmp, "%s %d %d %lu ",			       p_type(type), algorithm, labels, t));		T(addstr(tmp, len, &buf, &buflen));		if (labels > (u_int)dn_count_labels(name))			goto formerr;		/* Signature expiry. */		t = ns_get32(rdata);  rdata += NS_INT32SZ;		len = SPRINTF((tmp, "%s ", p_secstodate(t)));		T(addstr(tmp, len, &buf, &buflen));		/* Time signed. */		t = ns_get32(rdata);  rdata += NS_INT32SZ;		len = SPRINTF((tmp, "%s ", p_secstodate(t)));		T(addstr(tmp, len, &buf, &buflen));		/* Signature Footprint. */		footprint = ns_get16(rdata);  rdata += NS_INT16SZ;		len = SPRINTF((tmp, "%u ", footprint));		T(addstr(tmp, len, &buf, &buflen));		/* Signer's name. */		T(addname(msg, msglen, &rdata, origin, &buf, &buflen));		/* Signature. */		len = b64_ntop(rdata, edata - rdata,			       base64_key, sizeof base64_key);		if (len > 15) {			T(addstr(" (", 2, &buf, &buflen));			leader = "\n\t\t";			spaced = 0;		} else			leader = " ";		if (len < 0)			goto formerr;		for (n = 0; n < len; n += 48) {			T(addstr(leader, strlen(leader), &buf, &buflen));			T(addstr(base64_key + n, MIN(len - n, 48),				 &buf, &buflen));		}		if (len > 15)			T(addstr(" )", 2, &buf, &buflen));		break;	    }	case ns_t_nxt: {		int n, c;		/* Next domain name. */		T(addname(msg, msglen, &rdata, origin, &buf, &buflen));		/* Type bit map. */		n = edata - rdata;		for (c = 0; c < n*8; c++)			if (NS_NXT_BIT_ISSET(c, rdata)) {				len = SPRINTF((tmp, " %s", p_type(c)));				T(addstr(tmp, len, &buf, &buflen));			}		break;	    }	case ns_t_cert: {		u_int c_type, key_tag, alg;		int n;		unsigned int siz;		char base64_cert[8192], tmp[40];		const char *leader;		c_type  = ns_get16(rdata); rdata += NS_INT16SZ;		key_tag = ns_get16(rdata); rdata += NS_INT16SZ;		alg = (u_int) *rdata++;		len = SPRINTF((tmp, "%d %d %d ", c_type, key_tag, alg));		T(addstr(tmp, len, &buf, &buflen));		siz = (edata-rdata)*4/3 + 4; /* "+4" accounts for trailing \0 */		if (siz > sizeof(base64_cert) * 3/4) {			const char *str = "record too long to print";			T(addstr(str, strlen(str), &buf, &buflen));		}		else {			len = b64_ntop(rdata, edata-rdata, base64_cert, siz);			if (len < 0)				goto formerr;			else if (len > 15) {				T(addstr(" (", 2, &buf, &buflen));				leader = "\n\t\t";				spaced = 0;			}			else				leader = " ";				for (n = 0; n < len; n += 48) {				T(addstr(leader, strlen(leader),					 &buf, &buflen));				T(addstr(base64_cert + n, MIN(len - n, 48),					 &buf, &buflen));			}			if (len > 15)				T(addstr(" )", 2, &buf, &buflen));		}		break;	    }	case ns_t_tkey: {		/* KJD - need to complete this */		u_long t;		int mode, err, keysize;		/* Algorithm name. */		T(addname(msg, msglen, &rdata, origin, &buf, &buflen));		T(addstr(" ", 1, &buf, &buflen));		/* Inception. */		t = ns_get32(rdata);  rdata += NS_INT32SZ;		len = SPRINTF((tmp, "%s ", p_secstodate(t)));		T(addstr(tmp, len, &buf, &buflen));		/* Experation. */		t = ns_get32(rdata);  rdata += NS_INT32SZ;		len = SPRINTF((tmp, "%s ", p_secstodate(t)));		T(addstr(tmp, len, &buf, &buflen));		/* Mode , Error, Key Size. */		/* Priority, Weight, Port. */		mode = ns_get16(rdata);  rdata += NS_INT16SZ;		err  = ns_get16(rdata);  rdata += NS_INT16SZ;		keysize  = ns_get16(rdata);  rdata += NS_INT16SZ;		len = SPRINTF((tmp, "%u %u %u ", mode, err, keysize));		T(addstr(tmp, len, &buf, &buflen));		/* XXX need to dump key, print otherdata length & other data */		break;	    }	case ns_t_tsig: {		/* BEW - need to complete this */		int n;		T(len = addname(msg, msglen, &rdata, origin, &buf, &buflen));		T(addstr(" ", 1, &buf, &buflen));		rdata += 8; /* time */		n = ns_get16(rdata); rdata += INT16SZ;		rdata += n; /* sig */		n = ns_get16(rdata); rdata += INT16SZ; /* original id */		sprintf(buf, "%d", ns_get16(rdata));		rdata += INT16SZ;		addlen(strlen(buf), &buf, &buflen);		break;	    }	case ns_t_a6: {		struct in6_addr a;		int pbyte, pbit;		/* prefix length */		if (rdlen == 0U) goto formerr;		len = SPRINTF((tmp, "%d ", *rdata));		T(addstr(tmp, len, &buf, &buflen));		pbit = *rdata;		if (pbit > 128) goto formerr;		pbyte = (pbit & ~7) / 8;		rdata++;		/* address suffix: provided only when prefix len != 128 */		if (pbit < 128) {			if (rdata + pbyte >= edata) goto formerr;			memset(&a, 0, sizeof(a));			memcpy(&a.s6_addr[pbyte], rdata, sizeof(a) - pbyte);			(void) inet_ntop(AF_INET6, &a, buf, buflen);			addlen(strlen(buf), &buf, &buflen);			rdata += sizeof(a) - pbyte;		}		/* prefix name: provided only when prefix len > 0 */		if (pbit == 0)			break;		if (rdata >= edata) goto formerr;		T(addstr(" ", 1, &buf, &buflen));		T(addname(msg, msglen, &rdata, origin, &buf, &buflen));				break;	    }	case ns_t_opt: {		len = SPRINTF((tmp, "%u bytes", class));		T(addstr(tmp, len, &buf, &buflen));		break;	    }	default:		comment = "unknown RR type";		goto hexify;	}	return (buf - obuf); formerr:	comment = "RR format error"; hexify: {	int n, m;	char *p;	len = SPRINTF((tmp, "\\# %u%s\t; %s", edata - rdata,		       rdlen != 0 ? " (" : "", comment));	T(addstr(tmp, len, &buf, &buflen));	while (rdata < edata) {		p = tmp;		p += SPRINTF((p, "\n\t"));		spaced = 0;		n = MIN(16, edata - rdata);		for (m = 0; m < n; m++)			p += SPRINTF((p, "%02x ", rdata[m]));		T(addstr(tmp, p - tmp, &buf, &buflen));		if (n < 16) {			T(addstr(")", 1, &buf, &buflen));			T(addtab(p - tmp + 1, 48, spaced, &buf, &buflen));		}		p = tmp;		p += SPRINTF((p, "; "));		for (m = 0; m < n; m++)			*p++ = (isascii(rdata[m]) && isprint(rdata[m]))				? rdata[m]				: '.';		T(addstr(tmp, p - tmp, &buf, &buflen));		rdata += n;	}	return (buf - obuf);    }}/* Private. *//* * size_t * prune_origin(name, origin) *	Find out if the name is at or under the current origin. * return: *	Number of characters in name before start of origin, *	or length of name if origin does not match. * notes: *	This function should share code with samedomain(). */static size_tprune_origin(const char *name, const char *origin) {	const char *oname = name;	while (*name != '\0') {		if (origin != NULL && ns_samename(name, origin) == 1)			return (name - oname - (name > oname));		while (*name != '\0') {			if (*name == '\\') {				name++;				/* XXX need to handle \nnn form. */				if (*name == '\0')					break;			} else if (*name == '.') {				name++;				break;			}			name++;		}	}	return (name - oname);}/* * int * charstr(rdata, edata, buf, buflen) *	Format a <character-string> into the presentation buffer. * return: *	Number of rdata octets consumed *	0 for protocol format error *	-1 for output buffer error * side effects: *	buffer is advanced on success. */static intcharstr(const u_char *rdata, const u_char *edata, char **buf, size_t *buflen) {	const u_char *odata = rdata;	size_t save_buflen = *buflen;	char *save_buf = *buf;	if (addstr("\"", 1, buf, buflen) < 0)		goto enospc;	if (rdata < edata) {		int n = *rdata;		if (rdata + 1 + n <= edata) {			rdata++;			while (n-- > 0) {				if (strchr("\n\"\\", *rdata) != NULL)					if (addstr("\\", 1, buf, buflen) < 0)						goto enospc;				if (addstr((const char *)rdata, 1,					   buf, buflen) < 0)					goto enospc;				rdata++;			}		}	}	if (addstr("\"", 1, buf, buflen) < 0)		goto enospc;	return (rdata - odata); enospc:	errno = ENOSPC;	*buf = save_buf;	*buflen = save_buflen;	return (-1);}static intaddname(const u_char *msg, size_t msglen,	const u_char **pp, const char *origin,	char **buf, size_t *buflen){	size_t newlen, save_buflen = *buflen;	char *save_buf = *buf;	int n;	n = dn_expand(msg, msg + msglen, *pp, *buf, *buflen);	if (n < 0)		goto enospc;	/* Guess. */	newlen = prune_origin(*buf, origin);	if (**buf == '\0') {		goto root;	} else if (newlen == 0U) {		/* Use "@" instead of name. */		if (newlen + 2 > *buflen)			goto enospc;        /* No room for "@\0". */		(*buf)[newlen++] = '@';		(*buf)[newlen] = '\0';	} else {		if (((origin == NULL || origin[0] == '\0') ||		    (origin[0] != '.' && origin[1] != '\0' &&		    (*buf)[newlen] == '\0')) && (*buf)[newlen - 1] != '.') {			/* No trailing dot. */ root:			if (newlen + 2 > *buflen)				goto enospc;	/* No room for ".\0". */			(*buf)[newlen++] = '.';			(*buf)[newlen] = '\0';		}	}	*pp += n;	addlen(newlen, buf, buflen);	**buf = '\0';	return (newlen); enospc:	errno = ENOSPC;	*buf = save_buf;	*buflen = save_buflen;	return (-1);}static voidaddlen(size_t len, char **buf, size_t *buflen) {	INSIST(len <= *buflen);	*buf += len;	*buflen -= len;}static intaddstr(const char *src, size_t len, char **buf, size_t *buflen) {	if (len >= *buflen) {		errno = ENOSPC;		return (-1);	}	memcpy(*buf, src, len);	addlen(len, buf, buflen);	**buf = '\0';	return (0);}static intaddtab(size_t len, size_t target, int spaced, char **buf, size_t *buflen) {	size_t save_buflen = *buflen;	char *save_buf = *buf;	int t;	if (spaced || len >= target - 1) {		T(addstr("  ", 2, buf, buflen));		spaced = 1;	} else {		for (t = (target - len - 1) / 8; t >= 0; t--)			if (addstr("\t", 1, buf, buflen) < 0) {				*buflen = save_buflen;				*buf = save_buf;				return (-1);			}		spaced = 0;	}	return (spaced);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -