HomeSort by: relevance | last modified time | path
    Searched refs:dnptrs (Results 1 - 6 of 6) sorted by relevancy

  /src/lib/libc/resolv/
res_mkquery.c 125 u_char *dnptrs[20], **dpp, **lastdnptr; local in function:res_nmkquery
149 dpp = dnptrs;
152 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
161 if ((n = dn_comp(dname, cp, (int)(ep - cp - QFIXEDSZ), dnptrs,
178 dnptrs, lastdnptr);
res_comp.c 132 u_char **dnptrs, u_char **lastdnptr)
135 (void *)dnptrs,
  /src/lib/libc/nameser/
ns_name.c 516 *\li 'dnptrs' is an array of pointers to previous compressed names.
517 *\li dnptrs[0] is a pointer to the beginning of the message. The array
520 * by 'dnptrs'.
523 *\li The list of pointers in dnptrs is updated for labels inserted into
530 const u_char **dnptrs, const u_char **lastdnptr)
541 if (dnptrs != NULL) {
542 if ((msg = *dnptrs++) != NULL) {
543 for (cpp = dnptrs; *cpp != NULL; cpp++)
578 l = dn_find(srcp, msg, (const u_char * const *)dnptrs,
652 *\li 'dnptrs' is an array of pointers to previous compressed names
    [all...]
  /src/lib/libresolv/
ns_sign.c 94 time_t in_timesigned, u_char **dnptrs, u_char **lastdnptr)
117 (void *)dnptrs,
285 u_char **dnptrs, u_char **lastdnptr)
301 dnptrs, lastdnptr));
324 n = dn_comp(state->key->dk_key_name, cp, (int)(eob - cp), dnptrs,
res_mkupdate.c 97 u_char *dnptrs[20], **dpp, **lastdnptr; local in function:res_nmkupdate
113 dpp = dnptrs;
116 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
185 if ((n = dn_comp(rrecp->r_dname, cp, buflen, dnptrs,
231 n = dn_comp(buf2, cp, buflen, dnptrs, lastdnptr);
245 dnptrs, lastdnptr);
285 n = dn_comp(buf2, cp, buflen, dnptrs, lastdnptr);
328 n = dn_comp(buf2, cp, buflen, dnptrs,
    [all...]
  /src/include/arpa/
nameser.h 147 const u_char *dnptrs[25]; member in struct:ns_newmsg

Completed in 15 milliseconds