HomeSort by: relevance | last modified time | path
    Searched defs:table (Results 1 - 25 of 139) sorted by relevancy

1 2 3 4 5 6

  /src/usr.bin/mklocale/
yacc.y 131 | table
135 table : entry label
136 | table entry
746 err(1, "writing runetype_ext table #%d to %s", n, locale_file);
  /src/sys/dev/acpi/
acpi_slit.c 46 ACPI_TABLE_HEADER *table; local in function:acpislit_exist
49 rv = AcpiGetTable(ACPI_SIG_SLIT, 1, (ACPI_TABLE_HEADER **)&table);
54 if (table == NULL)
57 if (table->Length == 0xffffffff)
60 slit = (ACPI_TABLE_SLIT *)table;
  /src/sys/dev/sysmon/
sysmon_envsys_tables.c 140 * Returns the entry from specified table with type == key
145 const struct sme_descr_entry *table = sme_find_table(table_id); local in function:sme_find_table_entry
147 if (table != NULL)
148 for (; table->type != -1; table++)
149 if (table->type == key)
150 return table;
158 const struct sme_descr_entry *table = sme_find_table(table_id); local in function:sme_find_table_desc
160 if (table != NULL)
161 for (; table->type != -1; table++
    [all...]
  /src/distrib/utils/more/
position.c 43 * Routines dealing with the "position" table.
44 * This is a table which tells the position (in the input file) of the
47 * {{ The position table is scrolled by moving all the entries.
48 * Would be better to have a circular table
58 static off_t *table; /* The position table */ variable in typeref:typename:off_t *
85 return (table[where]);
89 * Add a new file position to the bottom of the position table.
98 * Scroll the position table up.
101 table[i-1] = table[i]
    [all...]
  /src/games/ching/castching/
castching.c 74 static int table[2][2][2] = { variable in typeref:typename:int[2][2][2]
114 string[i] = table[getrnum()&01][getrnum()&01][getrnum()&01] + '0';
  /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/smumgr/
smu10_smumgr.h 39 void *table; member in struct:smu_table_entry
vega10_smumgr.h 35 void *table; member in struct:smu_table_entry
vega12_smumgr.h 36 void *table; member in struct:smu_table_entry
vega20_smumgr.h 35 void *table; member in struct:smu_table_entry
57 uint8_t *table, uint16_t workload_type);
59 uint8_t *table, uint16_t workload_type);
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/bios/
nouveau_nvkm_subdev_bios_iccsense.c 69 u32 table, entry; local in function:nvbios_iccsense_parse
71 table = nvbios_iccsense_table(bios, &ver, &hdr, &cnt, &len);
72 if (!table || !cnt)
92 entry = table + hdr + i * len;
  /src/sys/external/bsd/drm2/dist/drm/vgem/
vgem_drv.h 52 struct sg_table *table; member in struct:drm_vgem_gem_object
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_hashtab.h 52 struct hlist_head *table; member in struct:drm_open_hash
72 * hash table manipulation functions are never run simultaneously.
  /src/tests/lib/libc/stdlib/
t_abs.c 50 } table[] = { local in function:ATF_TC_BODY
59 for (size_t i = 0; i < __arraycount(table); i++)
60 ATF_CHECK(abs(table[i].val) == table[i].res);
74 } table[] = { local in function:ATF_TC_BODY
86 for (size_t i = 0; i < __arraycount(table); i++)
87 ATF_CHECK(imaxabs(table[i].val) == table[i].res);
101 } table[] = { local in function:ATF_TC_BODY
112 for (size_t i = 0; i < __arraycount(table); i++
127 } table[] = { local in function:ATF_TC_BODY
    [all...]
  /src/usr.sbin/bootp/common/
hash.h 29 * Generalized hash table ADT
74 * hash_Lookup(table, hashcode, compare, key);
80 * The actual hash table index will be the passed hashcode modulo
81 * the hash table size.
92 * Various hash table definitions
118 hash_member *table[1]; /* Dynamically extended */
117 hash_member *table[1]; \/* Dynamically extended *\/ member in struct:hash_tblstruct
  /src/sys/arch/ia64/ia64/
mainbus.c 72 ACPI_TABLE_MADT *table; local in function:mainbus_attach
94 table = (ACPI_TABLE_MADT *)
97 sig = table->Header.Signature;
100 len = table->Header.Length;
101 if (ACPI_FAILURE(AcpiUtChecksum((void *)table, len)))
104 end = (char *)table + table->Header.Length;
105 p = (char *)(table + 1);
  /src/sys/arch/arm/at91/
at91rm9200bus.c 135 } table[] = { local in function:at91rm9200bus_search_peripherals
168 for (i = 0; table[i].addr; i++)
169 (*found_func)(self, table[i].addr, table[i].pid);
at91sam9260bus.c 132 } table[] = { local in function:at91sam9260bus_search_peripherals
158 for (i = 0; table[i].addr; i++)
159 found_func(self, table[i].addr, table[i].pid);
at91sam9261bus.c 126 } table[] = { local in function:at91sam9261bus_search_peripherals
154 for (i = 0; table[i].addr; i++)
155 (*found_func)(self, table[i].addr, table[i].pid);
  /src/games/primes/
primes.c 50 * primes - generate a table of primes between two values
80 * Eratosthenes sieve table
83 * odd. If the base of table is 1, table[i] represents 2*i-1. After the
84 * sieve, table[i] == 1 if and only if 2*i-1 is prime.
88 static char table[TABSIZE]; /* Eratosthenes sieve of odd numbers */ variable in typeref:typename:char[]
213 char *tab_lim; /* the limit to sieve on the table */
214 const uint64_t *p; /* prime table pointer */
277 memcpy(table, &pattern[factor], pattern_size-factor);
281 memcpy(&table[fact_lim], pattern, pattern_size)
    [all...]
  /src/libexec/talkd/
table.c 1 /* $NetBSD: table.c,v 1.11 2015/09/03 08:16:36 dholland Exp $ */
35 static char sccsid[] = "@(#)table.c 8.1 (Berkeley) 6/4/93";
37 __RCSID("$NetBSD: table.c,v 1.11 2015/09/03 08:16:36 dholland Exp $");
42 * Routines to handle insertion, deletion, etc on the table
76 TABLE_ENTRY *table = NIL; variable in typeref:typename:TABLE_ENTRY *
81 * Look in the table for an invitation that matches the current
94 for (ptr = table; ptr != NIL; ptr = ptr->next) {
127 * out of date entries in the table while we are it.
131 for (ptr = table; ptr != NIL; ptr = ptr->next) {
172 ptr->next = table;
    [all...]
  /src/sys/arch/ia64/acpi/
madt.c 124 ACPI_TABLE_MADT *table; local in function:ia64_probe_sapics
141 table = (ACPI_TABLE_MADT *)
145 printf("Table '%c%c%c%c' at %p\n",
146 table->Header.Signature[0],
147 table->Header.Signature[1],
148 table->Header.Signature[2],
149 table->Header.Signature[3], table);
151 if (strncmp(table->Header.Signature, ACPI_SIG_MADT,
153 ACPI_FAILURE(AcpiUtChecksum((void *)table,
224 ACPI_TABLE_MADT *table; local in function:ia64_count_cpus
    [all...]
  /src/games/ching/printching/
printching.c 70 } table[] = { variable in typeref:typename:const struct __anonc07732ed0108[]
146 if (table[i].lines == lower)
147 lnum = table[i].trinum;
148 if (table[i].lines == upper)
149 unum = table[i].trinum;
  /src/games/sail/
assorted.c 48 table(struct ship *from, struct ship *on, function in typeref:typename:void
  /src/include/
search.h 28 struct _ENTRY *table; member in struct:hsearch_data
  /src/lib/libc/stdlib/
hcreate.c 35 * SysV/XPG4 hash table functions.
91 _DIAGASSERT(htable.table == NULL);
93 /* Make sure this isn't called when a table already exists. */
94 if (htable.table != NULL) {
104 struct internal_head *table; local in function:hcreate_r
124 /* Allocate the table. */
127 table = NULL;
128 errno = reallocarr(&table, nel, sizeof(*table));
131 head->table = (void *)table
160 struct internal_head *table; local in function:hdestroy1_r
201 struct internal_head *table, *chain; local in function:hsearch_r
    [all...]

Completed in 32 milliseconds

1 2 3 4 5 6