rrset_ref
struct rrset_ref ref;
struct rrset_ref ref;
sizeof(struct reply_info)-sizeof(struct rrset_ref));
struct rrset_ref ref;
sizeof(struct reply_info)-sizeof(struct rrset_ref));
sizeof(struct reply_info) - sizeof(struct rrset_ref));
rrset_update_id(struct rrset_ref* ref, struct alloc_cache* alloc)
rrset_cache_update(struct rrset_cache* r, struct rrset_ref* ref,
struct rrset_ref ref;
rrset_array_lock(struct rrset_ref* ref, size_t count, time_t timenow)
rrset_array_unlock(struct rrset_ref* ref, size_t count)
struct rrset_ref* ref, size_t count)
int rrset_cache_update(struct rrset_cache* r, struct rrset_ref* ref,
int rrset_array_lock(struct rrset_ref* ref, size_t count, time_t timenow);
void rrset_array_unlock(struct rrset_ref* ref, size_t count);
struct rrset_ref* ref, size_t count);
struct rrset_ref;
size_t s = sizeof(struct reply_info) - sizeof(struct rrset_ref) +
sizeof(struct rrset_ref) * (total));
memset( &rep->ref[0], 0, sizeof(struct rrset_ref) * total);
struct rrset_ref* x = (struct rrset_ref*)a;
struct rrset_ref* y = (struct rrset_ref*)b;
qsort(&rep->ref[0], rep->rrset_count, sizeof(struct rrset_ref),
- sizeof(struct rrset_ref);
s += r->rrset_count * sizeof(struct rrset_ref);
struct rrset_ref ref[1];
sizeof(struct reply_info) - sizeof(struct rrset_ref));
sizeof(struct rrset_ref) * (rep->rrset_count-1) +
sizeof(struct rrset_ref) * rep->rrset_count);
struct rrset_ref ref;
size_t s = sizeof (struct reply_info) - sizeof (struct rrset_ref)
+ elem->rrset_count * sizeof (struct rrset_ref)
struct rrset_ref ref;
struct rrset_ref ref;
sizeof(struct reply_info)-sizeof(struct rrset_ref));
struct rrset_ref ref;
sizeof(struct reply_info)-sizeof(struct rrset_ref));
sizeof(struct reply_info) - sizeof(struct rrset_ref));
rrset_update_id(struct rrset_ref* ref, struct alloc_cache* alloc)
rrset_cache_update(struct rrset_cache* r, struct rrset_ref* ref,
struct rrset_ref ref;
rrset_array_lock(struct rrset_ref* ref, size_t count, time_t timenow)
rrset_array_unlock(struct rrset_ref* ref, size_t count)
struct rrset_ref* ref, size_t count)
int rrset_cache_update(struct rrset_cache* r, struct rrset_ref* ref,
int rrset_array_lock(struct rrset_ref* ref, size_t count, time_t timenow);
void rrset_array_unlock(struct rrset_ref* ref, size_t count);
struct rrset_ref* ref, size_t count);
struct rrset_ref;
size_t s = sizeof(struct reply_info) - sizeof(struct rrset_ref) +
sizeof(struct rrset_ref) * (total));
memset( &rep->ref[0], 0, sizeof(struct rrset_ref) * total);
struct rrset_ref* x = (struct rrset_ref*)a;
struct rrset_ref* y = (struct rrset_ref*)b;
qsort(&rep->ref[0], rep->rrset_count, sizeof(struct rrset_ref),
- sizeof(struct rrset_ref);
s += r->rrset_count * sizeof(struct rrset_ref);
struct rrset_ref ref[1];
sizeof(struct reply_info) - sizeof(struct rrset_ref));