/freebsd-11-stable/contrib/sqlite3/ |
H A D | sqlite3.c | 1446 ** entry represents the name of corresponding result column as obtained 1743 ** for their own use. The pMethods entry is a pointer to an 1967 ** into the array entry, allowing the current retry settings to be 2256 ** the third parameter to entry points of [loadable extensions]. This 3439 ** ^Each entry in most SQLite tables (except for [WITHOUT ROWID] tables) 7683 ** ^The entry point is zProc. 7685 ** entry point name on its own. It first tries "sqlite3_extension_init". 7752 ** xEntryPoint() is the entry point for a statically linked [SQLite extension] 7758 ** entry point where as follows: 7776 ** ^Calling sqlite3_auto_extension(X) with an entry poin [all...] |
H A D | shell.c | 1168 ** particular directory entry should be skipped over when searching for 1169 ** the next directory entry that should be returned by the readdir() or 1191 extern INT readdir_r(LPDIR dirp, LPDIRENT entry, LPDIRENT *result); 1330 LPDIRENT entry, 1341 entry->d_ino = dirp->d_first.d_ino; 1342 entry->d_attributes = dirp->d_first.d_attributes; 1343 strncpy(entry->d_name, dirp->d_first.d_name, NAME_MAX); 1344 entry->d_name[NAME_MAX] = '\0'; 1346 *result = entry; 1361 entry 1328 readdir_r( LPDIR dirp, LPDIRENT entry, LPDIRENT *result ) argument [all...] |
/freebsd-11-stable/testcode/ |
H A D | fake_event.c | 90 /** the pending entry for this commpoint (if any) */ 204 struct entry** entry, struct fake_pending **pend) 207 struct entry* e; 219 *entry = e; 230 * @param entry: returns the pointer to entry that matches. 231 * @param pend: the pending that the entry must match. 235 pending_find_match(struct replay_runtime* runtime, struct entry** entry, argument 203 pending_matches_current(struct replay_runtime* runtime, struct entry** entry, struct fake_pending **pend) argument 269 pending_matches_range(struct replay_runtime* runtime, struct entry** entry, struct fake_pending** pend) argument 312 count_reply_packets(struct entry* entry) argument 327 fill_buffer_with_reply(sldns_buffer* buffer, struct entry* entry, uint8_t* q, size_t qlen, int tcp_pkt_counter) argument 366 answer_callback_from_entry(struct replay_runtime* runtime, struct entry* entry, struct fake_pending* pend) argument 817 struct entry* entry = NULL; local [all...] |
/freebsd-11-stable/contrib/unbound/validator/ |
H A D | autotrust.c | 385 free(r->entry.data); 754 ubds->entry.data = packed_rrset_heap_data( 756 if(!ubds->entry.data) 766 ubdnskey->entry.data = packed_rrset_heap_data( 768 if(!ubdnskey->entry.data) { 1463 struct packed_rrset_data* d = (struct packed_rrset_data*)k->entry.data; 1528 dnskey_rrset->entry.data; 1575 ds_rrset->entry.data; 1619 dnskey_rrset->entry.data; 2378 * to recreate the key entry i [all...] |
/freebsd-11-stable/contrib/unbound/util/storage/ |
H A D | lruhash.c | 167 bin_overflow_remove(struct lruhash_bin* bin, struct lruhash_entry* entry) argument 172 if(p == entry) { 187 /* does not delete MRU entry, so table will not be empty. */ 191 us. We still need the hashbin and entry write lock to make 192 sure we flush all users away from the entry. 197 and we know num>1, so there is a previous lru entry. */ 201 /* schedule entry for deletion */ 266 lru_front(struct lruhash* table, struct lruhash_entry* entry) argument 268 entry->lru_prev = NULL; 269 entry 277 lru_remove(struct lruhash* table, struct lruhash_entry* entry) argument 288 lru_touch(struct lruhash* table, struct lruhash_entry* entry) argument 300 lruhash_insert(struct lruhash* table, hashvalue_type hash, struct lruhash_entry* entry, void* data, void* cb_arg) argument 358 struct lruhash_entry* entry; local 380 struct lruhash_entry* entry; local 553 lru_demote(struct lruhash* table, struct lruhash_entry* entry) argument 576 lruhash_insert_or_retrieve(struct lruhash* table, hashvalue_type hash, struct lruhash_entry* entry, void* data, void* cb_arg) argument [all...] |
/freebsd-11-stable/contrib/unbound/util/ |
H A D | netevent.c | 4256 struct internal_signal* entry = (struct internal_signal*)calloc(1, local 4258 if(!entry) { 4264 entry->ev = ub_signal_new(comsig->base->eb->base, sig, 4266 if(entry->ev == NULL) { 4268 free(entry); 4271 if(ub_signal_add(entry->ev, NULL) != 0) { 4273 ub_event_free(entry->ev); 4274 free(entry); 4278 entry->next = comsig->ev_signal; 4279 comsig->ev_signal = entry; [all...] |
/freebsd-11-stable/contrib/unbound/util/data/ |
H A D | packed_rrset.h | 109 * entry into hashtable. Note the lock is never destroyed, 113 struct lruhash_entry entry; member in struct:ub_packed_rrset_key 117 * zero is an unused entry, and never a valid id. 118 * Check this value after getting entry.lock. 120 * the id (which needs a writelock on entry.lock). 310 * Calculate memory size of rrset entry. For hash table usage. 443 * @param key: key with data entry.
|
H A D | packed_rrset.c | 61 free(pkey->entry.data); 62 pkey->entry.data = NULL; 75 s += packed_rrset_sizeof(d) + lock_get_mem(&k->entry.lock); 204 d = (struct packed_rrset_data*)rrset->entry.data; 276 entry.data; 307 entry.data; 325 entry.data; 337 key->entry.data; 343 memset(&ck->entry, 0, sizeof(ck->entry)); [all...] |
H A D | msgreply.h | 215 * Structure to keep hash table entry for message replies. 220 /** the hash table entry, data is struct reply_info* */ 221 struct lruhash_entry entry; member in struct:msgreply_entry 347 * Setup query info entry
|
H A D | msgreply.c | 158 rep->rrsets[i]->entry.key = rep->rrsets[i]; 164 rep->rrsets[i]->entry.data = NULL; 399 pk->entry.data = (void*)data; 400 pk->entry.key = (void*)pk; 401 pk->entry.hash = pset->hash; 431 data = (struct packed_rrset_data*)rep->rrsets[i]->entry.data; 524 rep->ref[i].key->entry.data; 606 + q->key.qname_len + lock_get_mem(&q->entry.lock) 617 lock_rw_destroy(&q->entry.lock); 649 e->entry [all...] |
H A D | msgencode.c | 459 key->entry.data;
|
/freebsd-11-stable/contrib/unbound/services/ |
H A D | rpz.c | 348 rrset->entry.key = rrset; 375 rrset->entry.data = pd; 777 d = (struct packed_rrset_data*)p->rrset->entry.data; 811 d = raddr->data->entry.data; 818 raddr->data->entry.data = NULL;
|
H A D | mesh.c | 142 * exact same data in memory (i.e., they come from the same ACL entry), we 398 verbose(VERB_ALGO, "Serve expired: unchecked entry needs " 400 goto bail_out; /* need to validate cache entry first */ 403 verbose(VERB_ALGO, "Serve expired: secure entry" 1110 * callback results to mesh cb entry 1114 * @param r: callback entry 1181 * Send reply to mesh reply entry 1185 * @param r: reply entry 1186 * @param r_buffer: buffer to use for reply entry. 1542 dsrc = qinfo->local_alias->rrset->entry [all...] |
H A D | localzone.c | 339 rrset->rrset->entry.key = rrset->rrset; 348 rrset->rrset->entry.data = pd; 486 rrset_negative->entry.key = rrset_negative; 489 rrset_negative->entry.data = pd; 553 pd = (struct packed_rrset_data*)rrset->rrset->entry.data; 697 /* find localzone entry */ 1115 /* setup parent ptrs for lookup during data entry */ 1322 r->entry.key = r; 1333 r->entry.data = d; 1340 d = (struct packed_rrset_data*)r->entry [all...] |
H A D | authzone.c | 105 /** delete xfer structure (not its tree entry) */ 162 k->entry.data; 173 key.entry.key = &key; 174 key.entry.data = rrset->data; 179 key.entry.hash = rrset_key_hash(&key.rk); 1279 /* really also a nonexisting entry, because no records 1288 /* nonexisting entry, because no such name */ 1297 /* an rrsets==NULL entry is not kept around for empty nonterminals, 2348 d = (struct packed_rrset_data*)msg->rep->rrsets[msg->rep->rrset_count-1]->entry.data; 2451 memset(&(*cname)->entry, [all...] |
/freebsd-11-stable/contrib/unbound/services/cache/ |
H A D | rrset.c | 103 * tablelock -> entrylock (for that entry caller holds) 116 lock_rw_rdlock(&key->entry.lock); 117 if(key->id == id && key->entry.hash == hash) { 118 lru_touch(table, &key->entry); 120 lock_rw_unlock(&key->entry.lock); 176 lock_rw_wrlock(&ref->key->entry.lock); 182 lock_rw_unlock(&ref->key->entry.lock); 191 hashvalue_type h = k->entry.hash; 207 equal = rrsetdata_equal((struct packed_rrset_data*)k->entry. 209 if(!need_to_update_rrset(k->entry [all...] |
/freebsd-11-stable/contrib/unbound/respip/ |
H A D | respip.c | 232 rrset->entry.key = rrset; 240 rrset->entry.data = pd; 284 pd = raddr->data->entry.data; 492 struct packed_rrset_data* data = key->entry.data; 501 memset(&ck->entry, 0, sizeof(ck->entry)); 502 ck->entry.hash = key->entry.hash; 503 ck->entry.key = ck; 531 ck->entry [all...] |
/freebsd-11-stable/contrib/unbound/libunbound/ |
H A D | libworker.c | 460 data = (struct packed_rrset_data*)answer->entry.data; 483 entry.data;
|
/freebsd-11-stable/contrib/unbound/ipset/ |
H A D | ipset.c | 166 d = (struct packed_rrset_data*)rrset->entry.data;
|
/freebsd-11-stable/contrib/unbound/dynlibmod/examples/ |
H A D | helloworld.c | 63 int id, struct outbound_entry* entry) { 62 operate(struct module_qstate* qstate, enum module_ev event, int id, struct outbound_entry* entry) argument
|
/freebsd-11-stable/contrib/unbound/dnstap/ |
H A D | unbound-dnstap-socket.c | 347 struct tap_socket_list* entry = (struct tap_socket_list*) local 348 malloc(sizeof(*entry)); 349 if(!entry) 351 entry->next = *liststart; 352 entry->s = s; 353 *liststart = entry; 375 struct tap_socket_list* entry; local 376 for(entry = list; entry; entry [all...] |
/freebsd-11-stable/contrib/unbound/dns64/ |
H A D | dns64.c | 792 memset(&dk->entry, 0, sizeof(dk->entry)); 793 dk->entry.key = dk; 794 dk->entry.hash = rrset_key_hash(&dk->rk); 795 dk->entry.data = dd; 853 fd = (struct packed_rrset_data*)fk->entry.data; 858 /* also sets dk->entry.hash */ 874 dk->entry.hash = fk->entry.hash; 890 dk->entry [all...] |
/freebsd-11-stable/contrib/unbound/daemon/ |
H A D | worker.c | 108 * Also has to be at least one to break ties (and overwrite cached entry). 431 s = ((struct packed_rrset_data*)rep->rrsets[i]->entry.data) 438 s = ((struct packed_rrset_data*)rep->rrsets[i]->entry.data) 455 s = ((struct packed_rrset_data*)rep->rrsets[i]->entry.data) 703 verbose(VERB_ALGO, "Cache reply: unchecked entry needs " 705 goto bail_out; /* need to validate cache entry first */ 711 verbose(VERB_ALGO, "Cache reply: secure entry" 1444 struct packed_rrset_data* d = rrset->entry.data;
|
H A D | remote.c | 1619 /* entry is locked */ 1682 /* entry is locked */ 1699 /* entry is locked */ 1717 /* entry is locked */ 1772 /* entry is locked */ 1785 /* entry is locked */ 1798 /* entry is locked */ 1839 /* entry is locked */ 1856 /* entry is locked */ 1871 /* entry i [all...] |
/freebsd-11-stable/contrib/unbound/contrib/ |
H A D | build-unbound-localzone-from-hosts.pl | 29 foreach my $entry ( @entries ) { 31 $ip = $entry; 37 if ( ($ip ne '127.0.0.1' and $ip ne '::1') or $entry =~ 'localhost' ) { 39 $ptrhash{$ip} = $entry; 40 print ZONE "local-data-ptr: \"$ip $entry\"\n"; 52 print ZONE "local-data: \"$entry ${a} $ip\"\n";
|