You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

dnslib.c 20KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970
  1. /**************************************
  2. * AUTHOR: Federico Tomassini *
  3. * Copyright (C) Federico Tomassini *
  4. * Contact effetom@gmail.com *
  5. ***********************************************
  6. ******* BEGIN 3/2006 ********
  7. *************************************************************************
  8. * *
  9. * This program is free software; you can redistribute it and/or modify *
  10. * it under the terms of the GNU General Public License as published by *
  11. * the Free Software Foundation; either version 2 of the License, or *
  12. * (at your option) any later version. *
  13. * *
  14. * This program is distributed in the hope that it will be useful, *
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of *
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
  17. * GNU General Public License for more details. *
  18. * *
  19. ************************************************************************/
  20. #define _GNU_SOURCE
  21. #include <string.h>
  22. #include "dnslib.h"
  23. #include "err_errno.h"
  24. #include "log.h"
  25. #include "xmalloc.h"
  26. /*
  27. * Takes a label: is there a ptr?
  28. * Returns:
  29. * -1 is a malformed label is found
  30. * 0 if there's no pointer
  31. * <offset from start_pkt> if a pointer is found
  32. */
  33. int
  34. getlblptr(char *buf)
  35. {
  36. uint16_t dlbl;
  37. char c[2];
  38. memcpy(c, buf, 2);
  39. if (!LBL_PTR(*c)) /* No ptr */
  40. return 0;
  41. if (LBL_PTR(*c) != LBL_PTR_MASK) {
  42. debug(DBG_INSANE, "In getlblptr: invalid octet %02x",
  43. (unsigned char) c[0]);
  44. err_ret(ERR_DNSMLO, -1);
  45. }
  46. (*c) &= LBL_PTR_OFF_MASK;
  47. memcpy(&dlbl, c, 2);
  48. dlbl = ntohs(dlbl);
  49. return dlbl; /* offset */
  50. }
  51. /*
  52. * Reads a contiguous octet-sequence-label.
  53. * Writes on dst.
  54. * There are two limits:
  55. * the name has to be less than MAX_SEQ_LBL_LEN
  56. * we must stay in pkt_len
  57. * -limit- is the less limit
  58. *
  59. * Returns:
  60. * -1 On error
  61. * Bytes readed if OK
  62. */
  63. int
  64. read_label_octet(const char *src, char *dst, int limit)
  65. {
  66. int how;
  67. how = *src++;
  68. if (how > limit || how > DNS_MAX_LABELS) {
  69. error("In read_label_octet: got %d with limti %d\n", how, limit);
  70. err_ret(ERR_DNSMSL, -1);
  71. }
  72. memcpy(dst, src, how);
  73. return how;
  74. }
  75. /*
  76. * Converts a dns compliant sequence label name to string.
  77. * we start to read at -buf-
  78. * we need start_pkt for pointers
  79. * we need limit to remain under pktlen
  80. * Returns:
  81. * Bytes readed if OK
  82. * -1 on error
  83. */
  84. int
  85. lbltoname(char *buf, char *start_pkt, char *dst, int limit)
  86. {
  87. char *crow;
  88. int how, recursion = 0;
  89. int ptr;
  90. int writed = 0, readed = 0;
  91. int new_limit = limit;
  92. crow = buf;
  93. while (*crow) {
  94. ptr = getlblptr(crow);
  95. if (ptr) { /* Got a pointer.... or got an error */
  96. if (ptr == -1) {
  97. debug(DBG_INSANE, err_str);
  98. err_ret(ERR_DNSMSL, -1);
  99. }
  100. if (++recursion > MAX_RECURSION_PTR)
  101. err_ret(ERR_DNSTRP, -1);
  102. if (recursion == 1)
  103. readed += 2; /* we read the pointer */
  104. crow = start_pkt + ptr;
  105. new_limit = limit - (int) (crow - buf);
  106. if (new_limit <= 0
  107. || new_limit > (int) (buf - start_pkt) + limit)
  108. err_ret(ERR_DNSPLB, -1);
  109. if (getlblptr(crow))
  110. err_ret(ERR_DNSPTP, -1);
  111. }
  112. how =
  113. read_label_octet(crow, dst,
  114. min(new_limit, DNS_MAX_HNAME_LEN - writed));
  115. if (how == -1) {
  116. debug(DBG_INSANE, err_str);
  117. err_ret(ERR_DNSMSL, -1);
  118. }
  119. if (!recursion)
  120. readed += how + 1;
  121. writed += how + 1;
  122. dst += how;
  123. crow += how + 1;
  124. *dst++ = (*crow) ? '.' : 0;
  125. }
  126. if (!recursion)
  127. readed++;
  128. return readed;
  129. }
  130. /*
  131. * DNS PTR query ask for 4.3.2.1.in-addr.arpa to know
  132. * who is 1.2.3.4.
  133. * This function reads this type of query transalting it
  134. * in the second form.
  135. * Writes result on *dst.
  136. * -1 on error.
  137. */
  138. int
  139. swap_straddr(char *src, char *dst)
  140. {
  141. char a[3];
  142. int i, slen;
  143. char *crow, *tmp, *atom;
  144. int count = 0, offset = 0;
  145. slen = strlen(src);
  146. if (slen > DNS_MAX_HNAME_LEN)
  147. goto mlf_addr;
  148. tmp = src;
  149. for (i = 0; i < 4; i++) {
  150. count = 0;
  151. atom = a;
  152. while (*tmp && *tmp != '.') {
  153. if (count > 2)
  154. goto mlf_addr;
  155. *atom++ = *tmp++;
  156. count++;
  157. }
  158. if (!count)
  159. goto mlf_addr;
  160. crow = dst + slen - count - offset;
  161. strncpy(crow, a, count);
  162. offset += count;
  163. if (!(*tmp))
  164. break;
  165. else {
  166. if (i == 3)
  167. goto mlf_addr;
  168. *(crow - 1) = '.';
  169. offset++;
  170. tmp++;
  171. }
  172. }
  173. *(dst + slen) = 0;
  174. return 0;
  175. mlf_addr:
  176. debug(DBG_INSANE, "in swap_straddr: invalid address `%s`.\n", src);
  177. err_ret(ERR_DNSMDD, -1);
  178. }
  179. int
  180. swap_straddr6(char *src, char *dst)
  181. {
  182. int slen;
  183. char *tmp;
  184. slen = strlen(src);
  185. tmp = src + slen - 1;
  186. while (tmp != src)
  187. *dst++ = *tmp--;
  188. *dst++ = *tmp;
  189. *dst = 0;
  190. return 0;
  191. }
  192. int
  193. rm_inv_prefix(char *src, char *dst)
  194. {
  195. char *temp;
  196. int ret;
  197. if (!src) {
  198. debug(DBG_INSANE, "In rm_inv_prefix: NULL argument!");
  199. err_ret(ERR_DNSMDD, -1);
  200. }
  201. if (!
  202. ((temp = (char *) strcasestr(src, DNS_INV_PREFIX)) ||
  203. (temp = (char *) strcasestr(src, DNS_INV_PREFIX6)) ||
  204. (temp = (char *) strcasestr(src, OLD_DNS_INV_PREFIX6)))) {
  205. debug(DBG_INSANE, "In rm_inv_prefix(): no suffix for PTR query.");
  206. err_ret(ERR_DNSMDD, -1);
  207. }
  208. if (temp - src >= DNS_MAX_HNAME_LEN) {
  209. error("In rm_inv_prefix(): name too long.");
  210. err_ret(ERR_DNSMDD, -1);
  211. }
  212. ret = strstr(temp, "6") ? AF_INET6 : AF_INET;
  213. strncpy(dst, src, temp - src);
  214. dst[temp - src] = 0;
  215. return ret;
  216. }
  217. int
  218. add_inv_prefix(char *s, int family)
  219. {
  220. if (family == AF_INET)
  221. strcat(s, DNS_INV_PREFIX);
  222. else
  223. strcat(s, DNS_INV_PREFIX6);
  224. return 0;
  225. }
  226. int
  227. swapped_straddr(char *src, char *dst)
  228. {
  229. char temp[DNS_MAX_HNAME_LEN];
  230. int res;
  231. res = rm_inv_prefix(src, temp);
  232. if (res == -1) {
  233. error(err_str);
  234. err_ret(ERR_DNSMDD, -1);
  235. }
  236. if (res == AF_INET)
  237. res = swap_straddr(temp, dst);
  238. else
  239. res = swap_straddr6(temp, dst);
  240. if (res == -1) {
  241. error(err_str);
  242. err_ret(ERR_DNSMDD, -1);
  243. }
  244. return 0;
  245. }
  246. int
  247. swapped_straddr_pref(char *src, char *dst, int family)
  248. {
  249. int res;
  250. if (family == AF_INET)
  251. res = swap_straddr(src, dst);
  252. else
  253. res = swap_straddr6(src, dst);
  254. if (res == -1) {
  255. error(err_str);
  256. err_ret(ERR_DNSMDD, -1);
  257. }
  258. add_inv_prefix(dst, family);
  259. return 0;
  260. }
  261. /*
  262. * Converts a domain_name_string into a sequence label format,
  263. * dns compliant. Writes on dst.
  264. * -1 on error, number of bytes writed on success
  265. */
  266. int
  267. nametolbl(char *name, char *dst)
  268. {
  269. char *crow;
  270. int offset = 0, res;
  271. if (strlen(name) > DNS_MAX_HNAME_LEN) {
  272. debug(DBG_INSANE, "Malformed name: %s.", name);
  273. err_ret(ERR_DNSMDA, -1);
  274. }
  275. while ((crow = strstr(name + 1, "."))) {
  276. res = crow - name;
  277. if (res > DNS_MAX_LABELS) {
  278. debug(DBG_INSANE, "Malformed name: %s.", name);
  279. err_ret(ERR_DNSMDA, -1);
  280. }
  281. *dst = (char) res; /* write the octet length */
  282. dst++;
  283. offset++;
  284. memcpy(dst, name, (size_t) res); /* write label */
  285. name += res + 1;
  286. dst += res;
  287. offset += res; /* shift ptrs */
  288. }
  289. if (!name)
  290. return offset;
  291. if ((res = (char) strlen(name)) > DNS_MAX_LABELS) {
  292. debug(DBG_INSANE, "Malformed name: %s", name);
  293. err_ret(ERR_DNSMDA, -1);
  294. }
  295. *dst++ = (char) res;
  296. strcpy(dst, name);
  297. offset += res + 2;
  298. return offset;
  299. }
  300. /*
  301. * Disassembles DNS packet headers, writing a yet allocated
  302. * dns_pkt_hdr struct.
  303. * No controls on len, bcz <<--the min_pkt_len is controlled
  304. * by recv.-->>
  305. * Returns the number of bytes readed (always DNS_HDR_SZ).
  306. */
  307. int
  308. d_hdr_u(char *buf, dns_pkt_hdr * dph)
  309. {
  310. uint8_t c;
  311. uint16_t s;
  312. // ROW 1
  313. memcpy(&s, buf, sizeof(uint16_t));
  314. dph->id = ntohs(s);
  315. // ROW 2
  316. buf += 2;
  317. memcpy(&c, buf, sizeof(uint8_t));
  318. dph->qr = (c >> 7) & 0x01;
  319. dph->opcode = (c >> 3) & 0x0f;
  320. dph->aa = (c >> 2) & 0x01;
  321. dph->tc = (c >> 1) & 0x01;
  322. dph->rd = c & 0x01;
  323. buf++;
  324. memcpy(&c, buf, sizeof(uint8_t));
  325. dph->ra = (c >> 7) & 0x01;
  326. dph->z = (c >> 4) & 0x07;
  327. dph->rcode = c & 0x0f;
  328. // ROW 3
  329. buf++;
  330. memcpy(&s, buf, sizeof(uint16_t));
  331. dph->qdcount = ntohs(s);
  332. // ROW 4
  333. buf += 2;
  334. memcpy(&s, buf, sizeof(uint16_t));
  335. dph->ancount = ntohs(s);
  336. // ROW 5
  337. buf += 2;
  338. memcpy(&s, buf, sizeof(uint16_t));
  339. dph->nscount = ntohs(s);
  340. // ROW 6
  341. buf += 2;
  342. memcpy(&s, buf, sizeof(uint16_t));
  343. dph->arcount = ntohs(s);
  344. buf += 2;
  345. return DNS_HDR_SZ; // i.e. 12 :)
  346. }
  347. /*
  348. * This function alloc a new dns_pkt_qst to store a dns_question_section.
  349. * The new dns_pkt_qst is also added to the principal dp-struct
  350. * Returns bytes readed if OK. -1 otherwise.
  351. */
  352. int
  353. d_qst_u(char *start_buf, char *buf, dns_pkt * dp, int limit_len)
  354. {
  355. int count;
  356. uint16_t s;
  357. dns_pkt_qst *dpq;
  358. dpq = dns_add_qst(dp);
  359. /* get name */
  360. if ((count = lbltoname(buf, start_buf, dpq->qname, limit_len)) == -1) {
  361. error(err_str);
  362. err_ret(ERR_DNSMDD, 1);
  363. }
  364. buf += count;
  365. /* Now we have to write 2+2 bytes */
  366. if (count + 4 > limit_len)
  367. err_ret(ERR_DNSPLB, 1);
  368. /* shift to type and class */
  369. memcpy(&s, buf, 2);
  370. dpq->qtype = ntohs(s);
  371. count += 2;
  372. buf += 2;
  373. memcpy(&s, buf, 2);
  374. dpq->qclass = ntohs(s);
  375. count += 2;
  376. return count;
  377. }
  378. /*
  379. * Disassembles a DNS qst_section_set.
  380. * Use the above function for each question section.
  381. * -1 on error. Number of bytes readed on success.
  382. * If -1 is returned, rcode ha sto be set to E_INTRPRT
  383. */
  384. int
  385. d_qsts_u(char *start_buf, char *buf, dns_pkt * dp, int limit_len)
  386. {
  387. int offset = 0, res;
  388. int i, count;
  389. if (!(count = DP_QDCOUNT(dp)))
  390. return 0; /* No questions. */
  391. for (i = 0; i < count; i++) {
  392. if ((res =
  393. d_qst_u(start_buf, buf + offset, dp,
  394. limit_len - offset)) == -1) {
  395. error(err_str);
  396. err_ret(ERR_DNSMDD, -1);
  397. }
  398. offset += res;
  399. }
  400. return offset;
  401. }
  402. /*
  403. * The behavior of this function is in all similar to dpkttoqst.
  404. * Returns -1 on error. Bytes readed otherwise.
  405. */
  406. int
  407. d_a_u(char *start_buf, char *buf, dns_pkt_a ** dpa_orig, int limit_len)
  408. {
  409. int count, rdlen;
  410. dns_pkt_a *dpa;
  411. uint16_t s;
  412. uint32_t ui;
  413. dpa = dns_add_a(dpa_orig);
  414. /* get name */
  415. if ((count = lbltoname(buf, start_buf, dpa->name, limit_len)) == -1) {
  416. error(err_str);
  417. err_ret(ERR_DNSMDD, -1);
  418. }
  419. buf += count;
  420. /* Now we have to write 2+2+4+2 bytes */
  421. if (count + 10 > limit_len)
  422. err_ret(ERR_DNSPLB, -1);
  423. memcpy(&s, buf, 2);
  424. dpa->type = ntohs(s);
  425. count += 2;
  426. buf += 2;
  427. memcpy(&s, buf, 2);
  428. dpa->cl = ntohs(s);
  429. count += 2;
  430. buf += 2;
  431. memcpy(&ui, buf, 4);
  432. dpa->ttl = ntohl(ui);
  433. count += 4;
  434. buf += 4;
  435. memcpy(&s, buf, 2);
  436. dpa->rdlength = ntohs(s);
  437. count += 2;
  438. buf += 2;
  439. rdlen = dpa->rdlength;
  440. if (rdlen > DNS_MAX_HNAME_LEN)
  441. err_ret(ERR_DNSMDD, -1);
  442. /* Now we have to write dpa->rdlength bytes */
  443. if (count + rdlen > limit_len)
  444. err_ret(ERR_DNSPLB, -1);
  445. if (dpa->type == T_A) {
  446. memcpy(dpa->rdata, buf, rdlen); /* 32bit address */
  447. count += rdlen;
  448. } else if (dpa->type == T_AAAA) {
  449. memcpy(dpa->rdata, buf, rdlen); /* 128bit address */
  450. count += rdlen;
  451. } else if (dpa->type == T_MX) {
  452. memcpy(dpa->rdata, buf, 2);
  453. if ((ui =
  454. lbltoname(buf + 2, start_buf, dpa->rdata + 2,
  455. rdlen - 2)) == -1) {
  456. error(err_str);
  457. err_ret(ERR_DNSMDD, -1);
  458. }
  459. if (rdlen != ui + 2) {
  460. debug(DBG_NORMAL,
  461. "In d_a_u(): rdlen (%d) differs from readed bytes (%d).",
  462. rdlen, ui + 2);
  463. err_ret(ERR_DNSMDD, -1);
  464. }
  465. count += 2 + ui;
  466. } else {
  467. if ((ui = lbltoname(buf, start_buf, dpa->rdata, rdlen)) == -1) {
  468. error(err_str);
  469. err_intret(ERR_DNSMDD);
  470. }
  471. if (rdlen != ui) {
  472. debug(DBG_NORMAL,
  473. "In d_a_u(): rdlen (%d) differs from readed bytes (%d).",
  474. rdlen, ui);
  475. err_ret(ERR_DNSMDD, -1);
  476. }
  477. count += ui;
  478. }
  479. return count;
  480. }
  481. /*
  482. * like d_qs_u. count is the number of section to read.
  483. * -1 on error. Bytes readed otherwise.
  484. */
  485. int
  486. d_as_u(char *start_buf, char *buf, dns_pkt_a ** dpa, int limit_len,
  487. int count)
  488. {
  489. int offset = 0, res;
  490. int i;
  491. if (!count)
  492. return 0;
  493. for (i = 0; i < count; i++) {
  494. if ((res =
  495. d_a_u(start_buf, buf + offset, dpa,
  496. limit_len - offset)) == -1) {
  497. error(err_str);
  498. err_intret(ERR_DNSMDD);
  499. }
  500. offset += res;
  501. }
  502. return offset;
  503. }
  504. /*
  505. * This is a main function: takes the pkt-buf and translate
  506. * it in structured data.
  507. * It cares about dns_pkt allocations.
  508. *
  509. * Returns:
  510. * -1 on E_INTRPRT
  511. * 0 if pkt must be discarded.
  512. * Number of bytes read otherwise
  513. */
  514. int
  515. d_u(char *buf, int pktlen, dns_pkt ** dpp)
  516. {
  517. dns_pkt *dp;
  518. int offset = 0, res;
  519. char *crow;
  520. crow = buf;
  521. /* Controls pkt consistency: we must at least read pkt headers */
  522. if (pktlen < DNS_HDR_SZ)
  523. err_ret(ERR_DNSMDP, 0);
  524. *dpp = dp = create_dns_pkt();
  525. /* Writes headers */
  526. offset += d_hdr_u(buf, &(dp->pkt_hdr));
  527. if (pktlen > DNS_MAX_SZ) /* If pkt is too long: the headers are written,
  528. * so we can reply with E_INTRPRT
  529. */
  530. err_intret(ERR_DNSPLB);
  531. crow += offset;
  532. /* Writes qsts */
  533. if (dp->pkt_hdr.qdcount) {
  534. if ((res = d_qsts_u(buf, crow, dp, pktlen - offset)) == -1) {
  535. error(err_str);
  536. err_intret(ERR_DNSMDP);
  537. }
  538. offset += res;
  539. crow += res;
  540. }
  541. if (dp->pkt_hdr.ancount) {
  542. if ((res =
  543. d_as_u(buf, crow, &(dp->pkt_answ), pktlen - offset,
  544. DP_ANCOUNT(dp))) == -1) {
  545. error(err_str);
  546. err_intret(ERR_DNSMDP);
  547. }
  548. offset += res;
  549. }
  550. /*crow+=res;
  551. if ((res=dpkttoas(buf,crow,&(dp->pkt_auth),pktlen-offset,DP_NSCOUNT(dp)))==-1)
  552. return -1;
  553. offset+=res;
  554. crow+=res;
  555. if ((res=dpkttoas(buf,crow,&(dp->pkt_add),pktlen-offset,DP_ARCOUNT(dp)))==-1)
  556. return -1; */
  557. return offset;
  558. }
  559. /*
  560. * This function is the d_hdr_u inverse.
  561. * Takes a dns_pkt struct and builds the
  562. * header pkt-buffer
  563. * Returns the number of bytes writed.
  564. */
  565. int
  566. d_hdr_p(dns_pkt * dp, char *buf)
  567. {
  568. char *crow = buf;
  569. uint16_t u;
  570. dns_pkt_hdr *dph;
  571. dph = &(dp->pkt_hdr);
  572. u = htons(dph->id);
  573. memcpy(buf, &u, 2);
  574. buf += 2;
  575. if (dph->qr)
  576. *buf |= 0x80;
  577. *buf |= dph->opcode << 3;
  578. *buf |= dph->aa << 2;
  579. *buf |= dph->tc << 1;
  580. *buf |= dph->rd;
  581. buf++;
  582. *buf |= dph->ra << 7;
  583. *buf |= dph->z << 4;
  584. *buf |= dph->rcode;
  585. buf++;
  586. u = htons(dph->qdcount);
  587. memcpy(buf, &u, 2);
  588. buf += 2;
  589. u = htons(dph->ancount);
  590. memcpy(buf, &u, 2);
  591. buf += 2;
  592. u = htons(dph->nscount);
  593. memcpy(buf, &u, 2);
  594. buf += 2;
  595. u = htons(dph->arcount);
  596. memcpy(buf, &u, 2);
  597. buf += 2;
  598. return (int) (buf - crow);
  599. }
  600. /*
  601. * Translate a struct dns_pkt_qst in the dns-buffer buf.
  602. * Returns:
  603. * -1 On error
  604. * Bytes writed otherwise.
  605. */
  606. int
  607. d_qst_p(dns_pkt_qst * dpq, char *buf, int limitlen)
  608. {
  609. int offset;
  610. uint16_t u;
  611. if ((offset = nametolbl(dpq->qname, buf)) == -1) {
  612. error(err_str);
  613. err_ret(ERR_DNSMDA, -1);
  614. }
  615. if (offset + 4 > limitlen)
  616. err_ret(ERR_DNSPLB, -1);
  617. buf += offset;
  618. u = htons(dpq->qtype);
  619. memcpy(buf, &u, 2);
  620. buf += 2;
  621. offset += 2;
  622. u = htons(dpq->qclass);
  623. memcpy(buf, &u, 2);
  624. buf += 2;
  625. offset += 2;
  626. return offset;
  627. }
  628. /*
  629. * Translates the question sections of a struct dns_pkt
  630. * into buf.
  631. * Returns:
  632. * -1 on error.
  633. * Number of bytes writed otherwise,
  634. */
  635. int
  636. d_qsts_p(dns_pkt * dp, char *buf, int limitlen)
  637. {
  638. int offset = 0, res;
  639. int i;
  640. dns_pkt_qst *dpq;
  641. dpq = dp->pkt_qst;
  642. for (i = 0; dpq && i < DP_QDCOUNT(dp); i++) {
  643. if ((res = d_qst_p(dpq, buf + offset, limitlen - offset)) == -1) {
  644. error(err_str);
  645. err_ret(ERR_DNSMDA, -1);
  646. }
  647. offset += res;
  648. dpq = dpq->next;
  649. }
  650. return offset;
  651. }
  652. int
  653. d_a_p(dns_pkt_a * dpa, char *buf, int limitlen)
  654. {
  655. int offset, rdlen;
  656. uint16_t u;
  657. int i;
  658. if ((rdlen = nametolbl(dpa->name, buf)) == -1)
  659. return -1;
  660. offset = rdlen;
  661. if (offset + 10 > limitlen)
  662. err_intret(ERR_DNSPLB);
  663. buf += offset;
  664. u = htons(dpa->type);
  665. memcpy(buf, &u, 2);
  666. buf += 2;
  667. offset += 2;
  668. u = htons(dpa->cl);
  669. memcpy(buf, &u, 2);
  670. buf += 2;
  671. offset += 2;
  672. i = htonl(dpa->ttl);
  673. memcpy(buf, &i, 4);
  674. buf += 4;
  675. offset += 4;
  676. if (dpa->type == T_A) {
  677. if (offset + dpa->rdlength > limitlen)
  678. err_intret(ERR_DNSPLB);
  679. memcpy(buf + 2, dpa->rdata, dpa->rdlength);
  680. offset += dpa->rdlength;
  681. } else if (dpa->type == T_MX) {
  682. memcpy(buf + 2, dpa->rdata, 2);
  683. if ((rdlen = nametolbl(dpa->rdata + 2, buf + 4)) == -1) {
  684. error(err_str);
  685. err_ret(ERR_DNSMDA, -1);
  686. }
  687. offset += rdlen + 2;
  688. if (offset > limitlen)
  689. err_ret(ERR_DNSPLB, -1);
  690. dpa->rdlength = rdlen + 2;
  691. } else {
  692. if ((rdlen = nametolbl(dpa->rdata, buf + 2)) == -1) {
  693. error(err_str);
  694. err_ret(ERR_DNSMDA, -1);
  695. }
  696. offset += rdlen;
  697. if (offset > limitlen)
  698. err_ret(ERR_DNSPLB, -1);
  699. dpa->rdlength = rdlen;
  700. }
  701. u = htons(dpa->rdlength);
  702. memcpy(buf, &u, 2);
  703. offset += 2;
  704. return offset;
  705. }
  706. int
  707. d_as_p(dns_pkt_a * dpa, char *buf, int limitlen, int count)
  708. {
  709. int offset = 0, res;
  710. int i;
  711. for (i = 0; dpa && i < count; i++) {
  712. if ((res = d_a_p(dpa, buf + offset, limitlen - offset)) == -1) {
  713. error(err_str);
  714. err_ret(ERR_DNSMDA, -1);
  715. }
  716. offset += res;
  717. dpa = dpa->next;
  718. }
  719. return offset;
  720. }
  721. /*
  722. * Transform a dns_pkt structure in char stream.
  723. *
  724. * Returns:
  725. * -1 on error
  726. * len(stream) if OK
  727. *
  728. * The stream has at least the header section writed.
  729. * `buf' must be at least of DNS_MAX_SZ bytes.
  730. *
  731. * DANGER: This function realeses *ALWAYS* the dns_pkt *dp!!!!
  732. */
  733. int
  734. d_p(dns_pkt * dp, char *buf)
  735. {
  736. int offset, res;
  737. memset(buf, 0, DNS_MAX_SZ);
  738. offset = d_hdr_p(dp, buf);
  739. buf += offset;
  740. if ((res = d_qsts_p(dp, buf, DNS_MAX_SZ - offset)) == -1)
  741. goto server_fail;
  742. offset += res;
  743. buf += res;
  744. if ((res =
  745. d_as_p(dp->pkt_answ, buf, DNS_MAX_SZ - offset,
  746. DP_ANCOUNT(dp))) == -1)
  747. goto server_fail;
  748. offset += res;
  749. /*buf+=res;
  750. if ( (res=astodpkt(dp->pkt_auth,buf,DNS_MAX_SZ-offset,DP_NSCOUNT(dp)))==-1)
  751. goto server_fail;
  752. offset+=res;
  753. buf+=res; */
  754. /*if ( (res=astodpkt(dp->pkt_add,buf,DNS_MAX_SZ-offset,DP_ARCOUNT(dp)))==-1)
  755. goto server_fail;
  756. offset+=res; */
  757. destroy_dns_pkt(dp);
  758. return offset;
  759. server_fail:
  760. error(err_str);
  761. destroy_dns_pkt(dp);
  762. err_ret(ERR_DNSPDS, -1);
  763. }
  764. /* Memory Functions */
  765. dns_pkt *
  766. create_dns_pkt(void)
  767. {
  768. dns_pkt *dp;
  769. dp = xmalloc(DNS_PKT_SZ);
  770. memset(dp, 0, DNS_PKT_SZ);
  771. dp->pkt_qst = NULL;
  772. dp->pkt_answ = NULL;
  773. dp->pkt_add = NULL;
  774. dp->pkt_auth = NULL;
  775. return dp;
  776. }
  777. dns_pkt_qst *
  778. create_dns_pkt_qst(void)
  779. {
  780. dns_pkt_qst *dpq;
  781. dpq = xmalloc(DNS_PKT_QST_SZ);
  782. dpq->next = NULL;
  783. memset(dpq->qname, 0, DNS_MAX_HNAME_LEN);
  784. return dpq;
  785. }
  786. dns_pkt_a *
  787. create_dns_pkt_a(void)
  788. {
  789. dns_pkt_a *dpa;
  790. dpa = xmalloc(DNS_PKT_A_SZ);
  791. memset(dpa->name, 0, DNS_MAX_HNAME_LEN);
  792. memset(dpa->rdata, 0, DNS_MAX_HNAME_LEN);
  793. dpa->next = NULL;
  794. return dpa;
  795. }
  796. dns_pkt_qst *
  797. dns_add_qst(dns_pkt * dp)
  798. {
  799. dns_pkt_qst *dpq, *temp;
  800. dpq = create_dns_pkt_qst();
  801. temp = dp->pkt_qst;
  802. if (!temp) {
  803. dp->pkt_qst = dpq;
  804. return dpq;
  805. }
  806. while (temp->next)
  807. temp = temp->next;
  808. temp->next = dpq;
  809. return dpq;
  810. }
  811. void
  812. dns_del_last_qst(dns_pkt * dp)
  813. {
  814. dns_pkt_qst *dpq = dp->pkt_qst;
  815. if (!dpq)
  816. return;
  817. if (!(dpq->next)) {
  818. xfree(dpq);
  819. dp->pkt_qst = NULL;
  820. return;
  821. }
  822. while ((dpq->next)->next);
  823. xfree(dpq->next);
  824. dpq->next = NULL;
  825. return;
  826. }
  827. dns_pkt_a *
  828. dns_add_a(dns_pkt_a ** dpa)
  829. {
  830. dns_pkt_a *dpa_add, *a;
  831. int count = 0;
  832. a = *dpa;
  833. dpa_add = create_dns_pkt_a();
  834. if (!a) {
  835. (*dpa) = dpa_add;
  836. } else {
  837. while (a->next) {
  838. a = a->next;
  839. count++;
  840. }
  841. a->next = dpa_add;
  842. }
  843. return dpa_add;
  844. }
  845. void
  846. dns_a_default_fill(dns_pkt * dp, dns_pkt_a * dpa)
  847. {
  848. strcpy(dpa->name, dp->pkt_qst->qname);
  849. dpa->cl = C_IN;
  850. dpa->ttl = DNS_TTL;
  851. dpa->type = dp->pkt_qst->qtype;
  852. }
  853. void
  854. destroy_dns_pkt(dns_pkt * dp)
  855. {
  856. dns_pkt_a *dpa, *dpa_t;
  857. dns_pkt_qst *dpq, *dpq_t;
  858. if (dp->pkt_qst) {
  859. dpq = dp->pkt_qst;
  860. while (dpq) {
  861. dpq_t = dpq->next;
  862. xfree(dpq);
  863. dpq = dpq_t;
  864. }
  865. }
  866. if (dp->pkt_answ) {
  867. dpa = dp->pkt_answ;
  868. while (dpa) {
  869. dpa_t = dpa->next;
  870. xfree(dpa);
  871. dpa = dpa_t;
  872. }
  873. }
  874. if (dp->pkt_add) {
  875. dpa = dp->pkt_add;
  876. while (dpa) {
  877. dpa_t = dpa->next;
  878. xfree(dpa);
  879. dpa = dpa_t;
  880. }
  881. }
  882. if (dp->pkt_auth) {
  883. dpa = dp->pkt_auth;
  884. while (dpa) {
  885. dpa_t = dpa->next;
  886. xfree(dpa);
  887. dpa = dpa_t;
  888. }
  889. }
  890. xfree(dp);
  891. return;
  892. }