Searched refs:table (Results 251 - 275 of 348) sorted by relevance

<<11121314

/haiku-fatelf/src/bin/gdb/bfd/
H A Delf32-hppa.c52 from the standard ELF linker hash table. We use this as a place to
55 The second is the stub hash table which is derived from the
56 base BFD hash table. The stub hash table holds the information
161 /* Base hash table entry structure. */
177 /* The symbol table entry, if any, that this was derived from. */
218 /* The main hash table. */
221 /* The stub hash table. */
280 #define hppa_stub_hash_lookup(table, string, create, copy) \
282 bfd_hash_lookup ((table), (strin
289 stub_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument
326 hppa_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument
2965 struct bfd_hash_table *table; local
[all...]
H A Daoutx.h586 /* The file offsets of the string table and symbol table. */
1815 of bytes in the string table but is to be interpreted as the
1817 the string table is stored in the __DYNAMIC structure and the
1905 /* We use a hash table when writing out symbols so that we only write
1911 This hash table code breaks dbx on SunOS 4.1.3, so we don't do it
1937 doesn't understand a hashed string table. */
1947 space taken up by the string table size. */
1965 /* The string table starts with the size. */
2308 /* Base relative relocs are always against the symbol table,
[all...]
H A Decoff.c654 /* ECOFF symbol table routines. The ECOFF symbol table is described
945 /* Read an ECOFF symbol table. */
968 /* If we've already read in the symbol table, do nothing. */
1360 store 5 successive words in the aux. table:
1860 debugging information in the symbol table. However, it would be a
1867 the symbol table, so this function only handles the other debugging
2251 /* At least on Ultrix, the symbol table of an executable file must
2926 the string table, followed by the string table itsel
[all...]
H A Delf32-m68k.c193 /* The size in bytes of an entry in the procedure linkage table. */
197 /* The first entry in a procedure linkage table looks like this. See
209 /* Subsequent entries in a procedure linkage table look like this. */
216 0, 0, 0, 0, /* replaced with offset into relocation table. */
224 /* Procedure linkage table entries for the cpu32 */
242 0, 0, 0, 0, /* replaced with offset into relocation table. */
252 regular ELF linker hash table. */
279 /* m68k ELF linker hash table. */
289 /* Get the m68k ELF linker hash table from a link_info structure. */
294 /* Create an entry in an m68k ELF linker hash table
[all...]
H A Dlibbfd-in.h431 (struct bfd_hash_entry *entry, struct bfd_hash_table *table,
441 /* Generic link hash table creation routine. */
445 /* Generic link hash table destruction routine. */
523 /* Write out the .stabstr string table when linking stabs in sections. */
554 /* Create a string table. */
558 /* Create an XCOFF .debug section style string table. */
562 /* Free a string table. */
566 /* Get the size of a string table. */
570 /* Add a string to a string table. */
574 /* Write out a string table
[all...]
H A Dvms.h636 PARAMS ((struct bfd_hash_entry *entry, struct bfd_hash_table *table,
H A Dsrec.c88 so a short symbol table could look like:
199 structures is built to represent the symbol table (if there is
1084 asymbol **table = bfd_get_outsymbols (abfd); local
1093 asymbol *s = table[i];
1179 /* Return the amount of memory needed to read the symbol table. */
1188 /* Return the symbol table. */
H A Delf64-sh64.c63 extending the regular ELF linker hash table. */
90 /* sh ELF linker hash table. */
97 /* Traverse an sh ELF linker hash table. */
99 #define sh64_elf64_link_hash_traverse(table, func, info) \
101 (&(table)->root, \
105 /* Get the sh ELF linker hash table from a link_info structure. */
264 /* A 16 bit switch table entry. This is generated for an expression
281 /* A 32 bit switch table entry. This is generated for an expression
324 /* An 8 bit switch table entry. This is generated for an expression
1616 /* Section symbols are never (?) placed in the hash table, s
3149 sh64_elf64_link_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument
[all...]
H A Dxsym.c164 bfd_sym_parse_disk_table_v32 (buf, len, table)
167 bfd_sym_table_info *table;
171 table->dti_first_page = bfd_getb16 (buf);
172 table->dti_page_count = bfd_getb16 (buf + 2);
173 table->dti_object_count = bfd_getb32 (buf + 4);
1992 fprintf (f, "name table (NTE) contains %lu bytes:\n\n", name_table_len);
2015 fprintf (f, "resource table (RTE) contains %lu objects:\n\n",
2043 fprintf (f, "module table (MTE) contains %lu objects:\n\n",
2071 fprintf (f, "file reference table (FRTE) contains %lu objects:\n\n",
2099 fprintf (f, "contained modules table (CMT
[all...]
/haiku-fatelf/src/bin/gawk/
H A Dio.c1508 } table[] = { local
1519 int devcount = sizeof(table) / sizeof(table[0]);
1531 if (STREQN(name, table[i].name, table[i].compare)) {
1532 iop = & table[i].iob;
1537 } else if ((*table[i].fp)(iop, name, mode) == 0)
1546 /* not in table, fall through to regular code */
H A Dawkgram.y2428 * Install a name in the symbol table, even if it is already there.
2514 /* dump_vars --- dump the symbol table */
2520 NODE **table;
2524 emalloc(table, NODE **, var_count * sizeof(NODE *), "dump_vars");
2536 table[j++] = p;
2541 qsort(table, j, sizeof(NODE *), var_comp);
2544 p = table[i];
2564 free(table);
2632 * Walk through symbol table countng functions.
2768 * Extra work, build up and save a list of the parameter names in a table
[all...]
/haiku-fatelf/src/bin/gdb/readline/doc/
H A Dtexi2html217 # uses file of this name for table of contents file
672 # Overview -- Short table of contents
695 # $T2H_OVERVIEW -- lines of short table of contents
696 # $T2H_TOC -- lines of table of contents
1198 <table border = "1">
1270 'Contents', 'table of contents',
1271 'Overview', 'short table of contents',
1431 # *except* "image generating environments" such as "figure", "table"
1438 # image generating environments such as "figure", "table" or "minipage".
1956 q{'</pre></td></tr></table>'}
[all...]
/haiku-fatelf/src/bin/bash/support/
H A Dtexi2html216 # uses file of this name for table of contents file
671 # Overview -- Short table of contents
694 # $T2H_OVERVIEW -- lines of short table of contents
695 # $T2H_TOC -- lines of table of contents
1197 <table border = "1">
1269 'Contents', 'table of contents',
1270 'Overview', 'short table of contents',
1430 # *except* "image generating environments" such as "figure", "table"
1437 # image generating environments such as "figure", "table" or "minipage".
1955 q{'</pre></td></tr></table>'}
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A DChangeLog-3.x225 "%s does not have a symbol-table.\n".
518 Also fix mistaken comment about preserving order of original table.
670 * dbxread.c (symbol_file_command): Pass string table size to
672 (read_dbx_symtab): Before indexing into string table, check
673 string table index for reasonableness.
735 table size"... delete extra parameter to error.
841 opcode table with gas, and thus produce disassembly that looks
1420 removed a typo) to bring this into accord with gas' table; also
1465 lack of symbol table, use _filtered.
1466 (print_frame_arg_vars): Tell the user if no symbol table
[all...]
H A Dsymtab.h1 /* Symbol table definitions for GDB.
312 information to build a useful minimal symbol table using this structure.
314 symbol table, these minimal symbols are still useful for quickly mapping
316 used to figure out what full symbol table entries need to be read in. */
364 the `next' pointer for the demangled hash table. */
487 /* In a symbol table, value is SYMBOL_BLOCK_VALUE of a `struct block'.
488 In a partial symbol table, SYMBOL_VALUE_ADDRESS is the start address
526 to be determined from the minimal symbol table whenever the
620 using the aclass as an index into an ops table, the aclass and
622 32-bits from each symbol (relative to a symbol lookup, any table
[all...]
/haiku-fatelf/src/add-ons/input_server/methods/canna/lib/
H A Dromaji.c46 static struct RkRxDic *OpenRoma(char *table);
369 OpenRoma(char *table) argument
376 if (table || *table) {
377 retval = RkwOpenRoma(table);
381 printf("���������������������������������������������������� \"%s\" ������������������������\n", table);
391 sprintf(rdic, "%sdic/user/%s/%s", uinfo->topdir, uinfo->uname, table);
396 sprintf(rdic, "%s/%s", p, table);
420 strcat(rdic, table);
441 table);
[all...]
/haiku-fatelf/src/bin/bash/
H A Dvariables.h40 HASH_TABLE *table; /* variables at this scope */ member in struct:var_context
/haiku-fatelf/src/libs/ncurses/test/
H A Dncurses.c1190 static const chtype table[] = local
1204 for (n = 0; n < SIZEOF(table); n++) {
1205 if ((table[n] & attr) != 0
1482 static const attr_t table[] = local
1496 for (n = 0; n < SIZEOF(table); n++) {
1497 if ((table[n] & attr) != 0
2291 static const char *table[] = local
2316 for (j = 0; j < SIZEOF(table); ++j) {
2317 P(table[j]);
/haiku-fatelf/src/system/libroot/posix/glibc/stdio-common/
H A Dvfprintf.c274 /* This table maps a character into a number representing a
309 # define JUMP(ChExpr, table) \
316 : table[CHAR_CLASS (spec)]; \
323 # define JUMP(ChExpr, table) \
329 : table[CHAR_CLASS (spec)]; \
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxmlregexp.c453 * 3/ build a table state x atom for the transitions
537 * Allocate the transition table. The first entry for each
1973 * too costly, and maintining the table is like too much
3458 * @comp: the precompiled exec with a compact table
6123 xmlExpNodePtr *table; member in struct:_xmlExpCtxt
6156 ret->table = xmlMalloc(size * sizeof(xmlExpNodePtr));
6157 if (ret->table == NULL) {
6161 memset(ret->table, 0, size * sizeof(xmlExpNodePtr));
6165 xmlFree(ret->table);
6187 if (ctxt->table !
[all...]
/haiku-fatelf/src/bin/sharutils/doc/
H A Dtexinfo.tex853 % @asis just yields its argument. Used with @table, for example.
1079 % Fonts for short table of contents.
1423 % Tables -- @table, @ftable, @vtable, @item(x), @kitem(x), @xitem(x).
1425 % default indentation of table text
1429 % margin between end of table item and start of table text.
1435 % Note @table, @vtable, and @vtable define @item, @itemx, etc., with
1509 \def\item{\errmessage{@item while not in a table}}
1510 \def\itemx{\errmessage{@itemx while not in a table}}
1511 \def\kitem{\errmessage{@kitem while not in a table}}
[all...]
/haiku-fatelf/src/bin/diffutils/config/
H A Dtexinfo.tex835 % @asis just yields its argument. Used with @table, for example.
1344 % Fonts for short table of contents.
1813 % Tables -- @table, @ftable, @vtable, @item(x), @kitem(x), @xitem(x).
1815 % default indentation of table text
1819 % margin between end of table item and start of table text.
1825 % Note @table, @vtable, and @vtable define @item, @itemx, etc., with
1898 \def\item{\errmessage{@item while not in a table}}
1899 \def\itemx{\errmessage{@itemx while not in a table}}
1900 \def\kitem{\errmessage{@kitem while not in a table}}
[all...]
/haiku-fatelf/src/bin/coreutils/src/
H A Ddd.c175 /* If nonzero, filter characters through the translation table. */
326 /* Translation table formed by applying successive transformations. */
930 parse_symbols (char const *str, struct symbol_value const *table, argument
940 for (entry = table;
1117 /* Fix up translation table. */
1856 /* Initialize translation table to identity translation. */
/haiku-fatelf/src/libs/termcap/
H A Dtexinfo.tex783 % @asis just yields its argument. Used with @table, for example.
1234 % Fonts for short table of contents.
1691 % Tables -- @table, @ftable, @vtable, @item(x), @kitem(x), @xitem(x).
1693 % default indentation of table text
1697 % margin between end of table item and start of table text.
1703 % Note @table, @vtable, and @vtable define @item, @itemx, etc., with
1776 \def\item{\errmessage{@item while not in a table}}
1777 \def\itemx{\errmessage{@itemx while not in a table}}
1778 \def\kitem{\errmessage{@kitem while not in a table}}
[all...]
/haiku-fatelf/src/bin/zic/
H A Dzic.c2400 byword(word, table)
2402 register const struct lookup * const table;
2407 if (word == NULL || table == NULL)
2412 for (lp = table; lp->l_word != NULL; ++lp)
2419 for (lp = table; lp->l_word != NULL; ++lp)

Completed in 233 milliseconds

<<11121314