Lines Matching full:answer
50 * among the answer records in order to reduce DNS traffic. It is not supposed
57 * answer packet data as output
62 * the smallest TTL value among the answer records are used as the time
63 * to keep an answer in the cache.
65 * this is bad, but we absolutely want to avoid parsing the answer packets
68 * - the implementation is just a (query-data) => (answer-data) hash table
82 * if the function returns RESOLV_CACHE_FOUND, a copy of the answer data
83 * has been copied into the client-provided answer buffer.
87 * answer to the cache.
92 * 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
1016 const uint8_t* answer;
1023 * Parse the answer records and find the smallest
1024 * TTL among the answer records.
1027 * keep the answer in the cache.
1030 * indicates that the answer shall not be cached.
1033 answer_getTTL(const void* answer, int answerlen)
1041 if (ns_initparse(answer, answerlen, &handle) >= 0) {
1042 // get number of answer records
1122 entry_alloc( const Entry* init, const void* answer, int answerlen )
1138 e->answer = e->query + e->querylen;
1141 memcpy( (char*)e->answer, answer, e->answerlen );
1303 _dump_answer(const void* answer, int answerlen)
1314 res_pquery(statep, answer, answerlen, fp);
1441 void* answer,
1488 /* NOTE: we return UNSUPPORTED if the answer buffer is too short */
1490 XLOG(" ANSWER TOO LONG");
1494 memcpy( answer, e->answer, e->answerlen );
1515 const void* answer,
1534 XLOG_ANSWER(answer, answerlen);
1536 XLOG( "answer:");
1537 XLOG_BYTES(answer,answerlen);
1561 ttl = answer_getTTL(answer, answerlen);
1563 e = entry_alloc(key, answer, answerlen);
