Lines Matching refs:answer
51 * among the answer records in order to reduce DNS traffic. It is not supposed
58 * answer packet data as output
63 * the smallest TTL value among the answer records are used as the time
64 * to keep an answer in the cache.
66 * this is bad, but we absolutely want to avoid parsing the answer packets
69 * - the implementation is just a (query-data) => (answer-data) hash table
83 * if the function returns RESOLV_CACHE_FOUND, a copy of the answer data
84 * has been copied into the client-provided answer buffer.
88 * answer to the cache.
93 * note that RESOLV_CACHE_UNSUPPORTED is also returned if the answer buffer
378 * ANSWER (variable)
397 * ANCount: 16 : Answer count (0 in queries)
402 * the ANSWER is made of ANCount RRs
455 * NOTE: we don't parse the answer packets, so don't need to deal with NAME
1012 const uint8_t* answer;
1067 * Parse the answer records and find the appropriate
1069 * the answer records if found or from the SOA record
1073 * keep the answer in the cache.
1076 * indicates that the answer shall not be cached.
1079 answer_getTTL(const void* answer, int answerlen)
1087 if (ns_initparse(answer, answerlen, &handle) >= 0) {
1088 // get number of answer records
1174 entry_alloc( const Entry* init, const void* answer, int answerlen )
1190 e->answer = e->query + e->querylen;
1193 memcpy( (char*)e->answer, answer, e->answerlen );
1482 _dump_answer(const void* answer, int answerlen)
1493 res_pquery(statep, answer, answerlen, fp);
1642 void* answer,
1697 /* NOTE: we return UNSUPPORTED if the answer buffer is too short */
1699 XLOG(" ANSWER TOO LONG");
1703 memcpy( answer, e->answer, e->answerlen );
1724 const void* answer,
1743 answer, answerlen);
1745 XLOG( "answer:");
1746 XLOG_BYTES(answer,answerlen);
1773 ttl = answer_getTTL(answer, answerlen);
1775 e = entry_alloc(key, answer, answerlen);
