| iter_utils.h (266114) | iter_utils.h (276605) |
|---|---|
| 1/* 2 * iterator/iter_utils.h - iterative resolver module utility functions. 3 * 4 * Copyright (c) 2007, NLnet Labs. All rights reserved. 5 * 6 * This software is open source. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 110 unchanged lines hidden (view full) --- 119 * @param qinf: query info, the query for which answer is stored. 120 * @param rep: reply in dns_msg from dns_alloc_msg for example. 121 * @param is_referral: If true, then the given message to be stored is a 122 * referral. The cache implementation may use this as a hint. 123 * @param leeway: prefetch TTL leeway to expire old rrsets quicker. 124 * @param pside: true if dp is parentside, thus message is 'fresh' and NS 125 * can be prefetch-updates. 126 * @param region: to copy modified (cache is better) rrs back to. | 1/* 2 * iterator/iter_utils.h - iterative resolver module utility functions. 3 * 4 * Copyright (c) 2007, NLnet Labs. All rights reserved. 5 * 6 * This software is open source. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 110 unchanged lines hidden (view full) --- 119 * @param qinf: query info, the query for which answer is stored. 120 * @param rep: reply in dns_msg from dns_alloc_msg for example. 121 * @param is_referral: If true, then the given message to be stored is a 122 * referral. The cache implementation may use this as a hint. 123 * @param leeway: prefetch TTL leeway to expire old rrsets quicker. 124 * @param pside: true if dp is parentside, thus message is 'fresh' and NS 125 * can be prefetch-updates. 126 * @param region: to copy modified (cache is better) rrs back to. |
| 127 * @param flags: with BIT_CD for dns64 AAAA translated queries. |
|
| 127 * @return void, because we are not interested in alloc errors, 128 * the iterator and validator can operate on the results in their 129 * scratch space (the qstate.region) and are not dependent on the cache. 130 * It is useful to log the alloc failure (for the server operator), 131 * but the query resolution can continue without cache storage. 132 */ 133void iter_dns_store(struct module_env* env, struct query_info* qinf, 134 struct reply_info* rep, int is_referral, time_t leeway, int pside, | 128 * @return void, because we are not interested in alloc errors, 129 * the iterator and validator can operate on the results in their 130 * scratch space (the qstate.region) and are not dependent on the cache. 131 * It is useful to log the alloc failure (for the server operator), 132 * but the query resolution can continue without cache storage. 133 */ 134void iter_dns_store(struct module_env* env, struct query_info* qinf, 135 struct reply_info* rep, int is_referral, time_t leeway, int pside, |
| 135 struct regional* region); | 136 struct regional* region, uint16_t flags); |
| 136 137/** 138 * Select randomly with n/m probability. 139 * For shuffle NS records for address fetching. 140 * @param rnd: random table 141 * @param n: probability. 142 * @param m: divisor for probability. 143 * @return true with n/m probability. --- 195 unchanged lines hidden --- | 137 138/** 139 * Select randomly with n/m probability. 140 * For shuffle NS records for address fetching. 141 * @param rnd: random table 142 * @param n: probability. 143 * @param m: divisor for probability. 144 * @return true with n/m probability. --- 195 unchanged lines hidden --- |