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

  /src/include/
res_update.h 35 struct ns_updrec { struct
36 TAILQ_ENTRY(ns_updrec) r_link, r_glink;
50 typedef struct ns_updrec ns_updrec; typedef in typeref:struct:ns_updrec
51 typedef TAILQ_HEAD(ns_updqueu, ns_updrec) ns_updque;
60 int res_mkupdate(ns_updrec *, u_char *, int);
61 int res_update(ns_updrec *);
62 ns_updrec * res_mkupdrec(int, const char *, u_int, u_int, u_long);
63 void res_freeupdrec(ns_updrec *);
64 int res_nmkupdate(res_state, ns_updrec *, u_char *, int)
    [all...]
  /src/lib/libresolv/
res_update.c 78 TAILQ_HEAD(, ns_updrec) z_rrlist;
99 res_nupdate(res_state statp, ns_updrec *rrecp_in, ns_tsig_key *key) {
100 ns_updrec *rrecp;
res_mkupdate.c 84 res_nmkupdate(res_state statp, ns_updrec *rrecp_in, u_char *buf, int buflen) {
85 ns_updrec *rrecp_start = rrecp_in;
89 ns_updrec *rrecp;
925 ns_updrec *
928 ns_updrec *rrecp = (ns_updrec *)calloc(1, sizeof(ns_updrec));
946 res_freeupdrec(ns_updrec *rrecp) {
  /src/lib/libc/resolv/
res_data.c 209 res_mkupdate(ns_updrec *rrecp_in, u_char *buf, int buflen) {
278 res_update(ns_updrec *rrecp_in) {

Completed in 15 milliseconds