Searched refs:table (Results 1 - 25 of 31) sorted by relevance

12

/darwin-on-arm/xnu/bsd/libkern/
H A Dscanc.c66 scanc(u_int size, u_char *cp, const u_char table[], int mask0) argument
72 for (end = &cp[size]; cp != end && (table[*cp] & mask) == 0; ++cp);
/darwin-on-arm/xnu/osfmk/ipc/
H A Dipc_table.h87 * in the table, so ipc_entry_get won't allocate it.
92 * The ipr_size field of the first element in a table of
100 * for the next larger size of table, not the one currently in use.
105 ipc_table_elems_t its_size; /* number of elements in table */
111 /* Initialize IPC capabilities table storage */
120 /* Allocate a table */
124 /* Free a table */
127 void * table);
133 #define it_entries_free(its, table) \
135 (void *)(table))
[all...]
H A Dipc_entry.c136 ipc_entry_t table; local
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; local
274 entry = &table[index];
302 (next_index = table[free_inde
357 ipc_entry_t table; local
407 ipc_entry_t table; local
462 ipc_entry_t otable, table; local
[all...]
H A Dipc_space.c133 ipc_entry_t table; local
141 table = it_entries_alloc(initial);
142 if (table == IE_NULL) {
148 memset((void *) table, 0, new_size * sizeof(struct ipc_entry));
151 * Initialize the free list in the table.
157 ipc_entry_t entry = &table[index];
162 table[new_size-1].ie_next = 0;
167 space->is_table = table;
212 * will not destroy the entire port table of a shared space. Instead
219 ipc_entry_t table; local
281 ipc_entry_t table; local
[all...]
H A Dipc_table.c170 * Allocate a table.
179 vm_offset_t table; local
184 if (kmem_alloc(kalloc_map, &table, size) != KERN_SUCCESS)
185 table = 0;
187 return (void *)table;
194 * Free a table allocated with ipc_table_alloc or
203 void * table)
206 kfree(table, size);
208 kmem_free(kalloc_map, (vm_offset_t)table, size);
201 ipc_table_free( vm_size_t size, void * table) argument
H A Dipc_hash.c63 * Entry hash table operations.
90 /* Delete an entry from the local reverse hash table */
119 * Inserts an entry into the appropriate reverse hash table,
141 * Deletes an entry from the appropriate reverse hash table.
160 * Each space has a local reverse hash table, which holds
161 * entries from the space's table. In fact, the hash table
162 * just uses a field (ie_index) in the table itself.
164 * The local hash table is an open-addressing hash table,
201 ipc_hash_table_lookup( ipc_entry_t table, ipc_entry_num_t size, ipc_object_t obj, mach_port_name_t *namep, ipc_entry_t *entryp) argument
249 ipc_hash_table_insert( ipc_entry_t table, ipc_entry_num_t size, ipc_object_t obj, mach_port_index_t index, __assert_only ipc_entry_t entry) argument
289 ipc_hash_table_delete( ipc_entry_t table, ipc_entry_num_t size, ipc_object_t obj, mach_port_index_t index, __assert_only ipc_entry_t entry) argument
[all...]
H A Dipc_hash.h63 * Declarations of entry hash table operations.
78 /* Lookup (space, obj) in the appropriate reverse hash table */
85 /* Insert an entry into the appropriate reverse hash table */
92 /* Delete an entry from the appropriate reverse hash table */
101 * local primitives are for table entries.
104 /* Lookup (space, obj) in local hash table */
106 ipc_entry_t table,
112 /* Inserts an entry into the local reverse hash table */
114 ipc_entry_t table,
120 /* Delete an entry from the appropriate reverse hash table */
[all...]
H A Dipc_port.c160 ipc_port_request_t ipr, table; local
168 table = port->ip_requests;
170 if (table == IPR_NULL)
173 index = table->ipr_next;
177 ipr = &table[index];
180 table->ipr_next = ipr->ipr_next;
200 * Grow a port's table of requests.
206 * KERN_SUCCESS Grew the table.
207 * KERN_SUCCESS Somebody else grew the table.
209 * KERN_RESOURCE_SHORTAGE Couldn't allocate new table
330 ipc_port_request_t ipr, table; local
361 ipc_port_request_t ipr, table; local
400 ipc_port_request_t ipr, table; local
[all...]
H A Dipc_port.h352 ipc_port_request_t ipr, table; \
356 table = port->ip_requests; \
357 assert(table != IPR_NULL); \
359 ipr = &table[index]; \
H A Dmach_debug.c179 ipc_entry_t table; local
229 /* walk the table for this space */
230 table = space->is_table;
235 ipc_entry_t entry = &table[index];
259 /* prepare the table out-of-line data for return */
H A Dmach_port.c224 ipc_entry_t table; local
315 table = space->is_table;
319 ipc_entry_t entry = &table[index];
1151 ipc_entry_t entry, table; local
1188 table = space->is_table;
1192 ipc_entry_t ientry = &table[index];
1677 ipc_port_request_t table; local
1692 table = port->ip_requests;
1693 if (table == IPR_NULL)
1696 *(int *)info = table
[all...]
/darwin-on-arm/xnu/libkern/zlib/
H A Dinftrees.h40 indexed that table entry, or it provides a pointer to another
41 table that indexes more bits of the code. op indicates whether
42 the entry is a pointer to another table, a literal, a length or
43 distance, an end-of-block, or an invalid code. For a table
45 that table. For a length or distance, the low four bits of op
50 the current table to the next table. Each entry is four bytes. */
52 unsigned char op; /* operation, extra bits, table bits */
54 unsigned short val; /* offset in table or code value */
59 0000tttt - table lin
[all...]
H A Dinftrees.c49 The code lengths are lens[0..codes-1]. The result starts at *table,
53 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
55 requested root table index bits, and on return it is the actual root
56 table index bits. It will differ if the request is greater than the
59 int inflate_table(type, lens, codes, table, bits, work)
63 code FAR * FAR *table;
70 unsigned root; /* number of index bits for root table */
71 unsigned curr; /* number of index bits for current table */
72 unsigned drop; /* code bits to drop for sub-table */
74 unsigned used; /* code entries in table use
[all...]
H A Dzutil.c236 local ptr_table table[MAX_PTR]; variable
237 /* This table is used to remember the original form of pointers
239 * Since MSDOS is not a preemptive multitasking OS, this table is not
259 table[next_ptr].org_ptr = buf;
264 table[next_ptr++].new_ptr = buf;
277 if (ptr != table[n].new_ptr) continue;
279 farfree(table[n].org_ptr);
281 table[n-1] = table[n];
H A Dcrc32.c127 The first table is simply the CRC of all possible eight bit values. This is
163 and then the byte reversal of those as well as the first table */
210 local void write_table(out, table)
212 const unsigned long FAR *table;
217 fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n],
/darwin-on-arm/xnu/osfmk/vm/
H A Ddefault_freezer.c56 * Create the mapping table that will
65 default_freezer_mapping_table_t table; local
67 table = kalloc(sizeof(struct default_freezer_mapping_table));
68 if (table) {
69 memset(table, 0, sizeof(*table));
71 panic("Could not allocate mapping table\n");
74 table->object = object;
75 table->offset = offset;
77 return table;
103 default_freezer_mapping_store( default_freezer_mapping_table_t table, memory_object_offset_t table_offset, memory_object_t memory_object, memory_object_offset_t offset) argument
139 default_freezer_mapping_update( default_freezer_mapping_table_t table, memory_object_t memory_object, memory_object_offset_t offset, memory_object_offset_t *table_offset, boolean_t remove_entry) argument
421 default_freezer_mapping_table_t table = NULL; local
[all...]
/darwin-on-arm/xnu/EXTERNAL_HEADERS/architecture/i386/
H A DMakefile23 table.h
/darwin-on-arm/xnu/iokit/Kernel/
H A DIOService.cpp417 // The default score is from the property table, & may be altered
667 OSDictionary * table; local
677 while( (table = (OSDictionary *) newTables->getFirstObject())) {
680 set = (OSSet *) copyExistingServices( table,
698 if( getDebugFlags( table ) & kIOLogMatch)
701 newTables->removeObject(table);
741 * a property table.
744 bool IOService::matchPropertyTable( OSDictionary * table, SInt32 * score ) argument
746 return( matchPropertyTable(table) );
749 bool IOService::matchPropertyTable( OSDictionary * table )
3008 OSDictionary * table; local
3513 OSDictionary * table; member in struct:IOServiceMatchContext
3525 OSDictionary * table = ctx->table; local
4605 matchInternal(OSDictionary * table, uint32_t options, uint32_t * did) argument
4754 passiveMatch( OSDictionary * table, bool changesOK ) argument
4759 matchPassive(OSDictionary * table, uint32_t options) argument
[all...]
H A DIOServicePrivate.h177 virtual bool matchPropertyTable( OSDictionary * table );
/darwin-on-arm/xnu/bsd/kern/
H A Dmakesyscalls.sh66 echo "usage: $0 input-file [<names|proto|header|table|audit> [<config-file>]]" 1>&2
85 table)
169 printf " * System call switch table.\n *\n" > syslegal
788 # define value in syscall table file to permit redifintion because of the way
H A Dtty_compat.c91 static int ttcompatspeedtab(int speed, struct speedtab *table);
130 * Description: Given a baud rate value as an integer, and a speed table,
132 * contents of the table. This effectively changes termios.h
136 * struct speedtab *table Baud rate table to speed code table
139 * not find an answer in the table.
150 ttcompatspeedtab(int speed, struct speedtab *table) argument
154 for ( ; table->sp_speed > 0; table
[all...]
/darwin-on-arm/xnu/iokit/IOKit/
H A DIOService.h196 The driver class is instantiated and <code>init()</code> called with its property table. The new driver instance is then attached to the provider, and has its @link probe probe@/link method called with the provider as an argument. The default <code>probe</code> method does nothing but return success, but a driver may implement this method to interrogate the provider to make sure it can work with it. It may also modify its probe score at this time. After probe, the driver is detached and the next in the list is considered (ie. attached, probed, and detached).
234 A string or collection of strings that match the provider's name. The comparison is implemented with the @link //apple_ref/cpp/instm/IORegistryEntry/compareNames/virtualbool/(OSObject*,OSString**) IORegistryEntry::compareNames@/link method, which supports a single string, or any collection (OSArray, OSSet, OSDictionary etc.) of strings. IOService objects with device tree properties (eg. IOPCIDevice) will also be matched based on that standard's "compatible", "name", "device_type" properties. The matching name will be left in the driver's property table in the <code>kIONameMatchedKey</code> property.
258 The name successfully matched name from the <code>kIONameMatchKey</code> property will be left in the driver's property table as the <code>kIONameMatchedKey</code> property.
465 @param score Pointer to the current driver's probe score, which is used to order multiple matching drivers in the same match category. It defaults to the value of the <code>IOProbeScore</code> property in the drivers property table, or <code>kIODefaultProbeScore</code> if none is specified. The <code>probe</code> method may alter the score to affect start order.
620 @param table The dictionary of properties to be matched against.
621 @param score Pointer to the current driver's probe score, which is used to order multiple matching drivers in the same match category. It defaults to the value of the <code>IOProbeScore</code> property in the drivers property table, or <code>kIODefaultProbeScore</code> if none is specified.
624 virtual bool matchPropertyTable( OSDictionary * table,
627 virtual bool matchPropertyTable( OSDictionary * table );
747 @param table If zero, <code>serviceMatching</code> creates a matching dictionary and returns a reference to it, otherwise the matching properties are added to the specified dictionary.
751 OSDictionary * table
[all...]
/darwin-on-arm/xnu/bsd/net/
H A Dpf_ioctl.c763 * XXX - we need to remove the table *before* detaching
764 * the rule to make sure the table code does not delete
4260 struct pfr_table *table; local
4268 table = _MALLOC(sizeof (*table), M_TEMP, M_WAITOK);
4271 _FREE(table, M_TEMP);
4282 _FREE(table, M_TEMP);
4289 _FREE(table, M_TEMP);
4297 bzero(table, sizeof (*table));
4330 struct pfr_table *table; local
4394 struct pfr_table *table; local
[all...]
/darwin-on-arm/xnu/bsd/dev/i386/
H A Ddis_tables.c141 JTAB, /* jump table */
248 * IND - indirect to another to another table
260 #define IND(table) {(instable_t *)table, 0, "", 0, 0, 0, 0, 0, 0}
261 #define INDx(table) {(instable_t *)table, 0, "", 0, 0, 1, 0, 0, 0}
278 #define IND(table) {(instable_t *)table, 0, "", 0, 0, 0, 0, 0}
279 #define INDx(table) {(instable_t *)table,
[all...]
/darwin-on-arm/xnu/bsd/sys/
H A Dtty.h310 int ttspeedtab(int speed, struct speedtab *table);

Completed in 231 milliseconds

12