Lines Matching defs:table

136 	ipc_entry_t table;
143 table = space->is_table;
144 first_free = table->ie_next;
150 free_entry = &table[first_free];
151 table->ie_next = free_entry->ie_next;
169 * the table isn't allowed to grow big enough.
262 * If we are under the table cutoff,
272 ipc_entry_t table = space->is_table;
274 entry = &table[index];
302 (next_index = table[free_index].ie_next)
307 table[free_index].ie_next =
308 table[next_index].ie_next;
313 IE_BITS_GEN(table[free_index].ie_bits)),
314 &table[free_index]);
326 * We grow the table so that the name
357 ipc_entry_t table;
371 table = space->is_table;
374 if ((index < size) && (entry == &table[index])) {
377 entry->ie_next = table->ie_next;
378 table->ie_next = index;
385 assert(entry == &table[index]);
407 ipc_entry_t table;
412 table = space->is_table;
416 assert(entry == &table[index]);
441 * Grows the table in a space.
448 * KERN_SUCCESS Grew the table.
449 * KERN_SUCCESS Somebody else grew the table.
452 * KERN_RESOURCE_SHORTAGE Couldn't allocate a new table.
462 ipc_entry_t otable, table;
474 * Somebody else is growing the table.
527 * We'll attempt to grow the table.
531 * table. Modification of entries (other than hashes) will
543 table = it_entries_alloc(its);
544 if (table == IE_NULL) {
554 table[i].ie_object = IO_NULL;
555 table[i].ie_bits = IE_BITS_GEN_MASK;
556 table[i].ie_index = 0;
557 table[i].ie_next = i + 1;
559 table[size-1].ie_next = 0;
561 /* clear out old entries in new table */
562 memset((void *)table, 0, osize * sizeof(*table));
568 * Within the range of the table that changed, determine what we
570 * corresponding entry in the old table (so it won't change
576 ipc_entry_t entry = &table[i];
584 ipc_hash_table_delete(table, size, entry->ie_object, i, entry);
592 ipc_hash_table_insert(table, size, entry->ie_object, i, entry);
600 table[0].ie_next = otable[0].ie_next; /* always rebase the freelist */
609 if (table[free_index].ie_object != IPC_OBJECT_NULL)
611 i = table[free_index].ie_next;
639 it_entries_free(its, table);
666 assert(table[free_index].ie_next == 0 &&
667 table[free_index].ie_object == IO_NULL);
668 table[free_index].ie_next = osize;
675 space->is_table = table;
685 * Now we need to free the old table.