Lines Matching refs:entry
97 /* Insert an entry into the global reverse hash table */
102 ipc_tree_entry_t entry);
104 /* Delete an entry from the local reverse hash table */
109 ipc_entry_t entry);
114 * Converts (space, obj) -> (name, entry).
115 * Returns TRUE if an entry was found.
142 * Inserts an entry into the appropriate reverse hash table,
153 ipc_entry_t entry)
159 (entry == &space->is_table[index]))
160 ipc_hash_local_insert(space, obj, index, entry);
164 (ipc_tree_entry_t) entry);
171 * Deletes an entry from the appropriate reverse hash table.
181 ipc_entry_t entry)
187 (entry == &space->is_table[index]))
188 ipc_hash_local_delete(space, obj, index, entry);
192 (ipc_tree_entry_t) entry);
229 * Converts (space, obj) -> (name, entry).
231 * Returns TRUE if an entry was found.
285 * Inserts an entry into the global reverse hash table.
295 ipc_tree_entry_t entry)
300 assert(entry->ite_name == name);
302 assert(entry->ite_space == space);
304 assert(entry->ite_object == obj);
314 entry->ite_next = bucket->ihgb_head;
315 bucket->ihgb_head = entry;
323 * Deletes an entry from the global reverse hash table.
333 ipc_tree_entry_t entry)
339 assert(entry->ite_name == name);
341 assert(entry->ite_space == space);
343 assert(entry->ite_object == obj);
354 if (this == entry) {
373 * throwing the entry into a bucket, the entry is rehashed
379 * Because at least one entry in the table (index 0) is always unused,
402 * Converts (space, obj) -> (name, entry).
404 * Returns TRUE if an entry was found.
435 ipc_entry_t entry = &table[index];
437 if (entry->ie_object == obj) {
438 *entryp = entry;
440 IE_BITS_GEN(entry->ie_bits));
454 * Inserts an entry into the space's reverse hash table.
464 __assert_only ipc_entry_t entry)
478 assert(entry == &table[index]);
479 assert(entry->ie_object == obj);
498 * Deletes an entry from the space's reverse hash table.
508 __assert_only ipc_entry_t entry)
522 assert(entry == &table[index]);
523 assert(entry->ie_object == obj);
678 ipc_tree_entry_t entry;
681 for (entry = bucket->ihgb_head;
682 entry != ITE_NULL;
683 entry = entry->ite_next)