| /src/external/gpl3/gdb/dist/bfd/ |
| plugin.h | 36 const struct ld_plugin_symbol *syms; member in struct:plugin_data_struct
|
| /src/external/gpl3/gdb.old/dist/bfd/ |
| plugin.h | 36 const struct ld_plugin_symbol *syms; member in struct:plugin_data_struct
|
| /src/external/gpl3/binutils.old/dist/bfd/ |
| plugin.h | 36 const struct ld_plugin_symbol *syms; member in struct:plugin_data_struct
|
| binary.c | 152 asymbol *syms; local
156 syms = (asymbol *) bfd_alloc (abfd, amt);
157 if (syms == NULL)
161 syms[0].the_bfd = abfd;
162 syms[0].name = mangle_name (abfd, "start");
163 syms[0].value = 0;
164 syms[0].flags = BSF_GLOBAL;
165 syms[0].section = sec;
166 syms[0].udata.p = NULL;
169 syms[1].the_bfd = abfd
[all...] |
| dwarf1.c | 38 asymbol** syms; member in struct:dwarf1_debug
310 stash->syms);
531 stash->syms = symbols;
|
| /src/games/dab/ |
| box.cc | 48 const int BOX::syms[BOX::last] = member in class:BOX
114 _b.data(_centery + edges[e].y, _centerx + edges[e].x) = syms[e];
|
| box.h | 83 static const int syms[BOX::last]; member in class:BOX
|
| /src/tests/lib/libexecinfo/ |
| t_backtrace_sandbox.c | 42 char **syms; local
50 syms = backtrace_symbols_fmt(addr, frames, "%n");
51 ATF_REQUIRE(strcmp(syms[0], "atfu_backtrace_sandbox_body") == 0);
66 syms = backtrace_symbols_fmt(addr, frames, "%n");
67 if (strcmp(syms[0], "atfu_backtrace_sandbox_body") != 0)
|
| /src/usr.sbin/tprof/ |
| ksyms.c | 46 static struct sym **syms = NULL; variable in typeref:struct:sym
129 syms = erealloc(syms, sizeof(*syms) * nsyms);
130 syms[nsyms - 1] = sym;
134 qsort(syms, nsyms, sizeof(*syms), compare_value);
137 return syms;
150 * try to find the smallest i for which syms[i]->value <= value.
151 * syms[] is ordered by syms[]->value in the descending order
[all...] |
| /src/external/gpl3/binutils/dist/gprof/ |
| sym_ids.c | 62 Sym_Table syms[NUM_TABLES]; variable
76 /* This is the table in which we keep all the syms that match
283 /* Convert symbol ids into Syms, so we can deal with them more easily. */
293 extend_match (&id->left, sym, &syms[id->which_table], false);
301 for (tab = syms; tab < &syms[NUM_TABLES]; ++tab)
318 /* Make a second pass through symtab, creating syms as necessary. */
324 extend_match (&id->left, sym, &syms[id->which_table], true);
360 for (tab = &syms[0]; tab < &syms[NUM_TABLES]; ++tab
[all...] |
| /src/external/gpl3/binutils/dist/opcodes/ |
| mmix-dis.c | 99 asymbol **syms = malloc (symsize); local
102 if (syms == NULL)
108 nsyms = bfd_canonicalize_symtab (abfd, syms);
113 for (i = 0; i < nsyms && syms[i] != NULL; i++)
115 if (syms[i]->section == reg_section
116 && syms[i]->value < MAX_REG_NAME_LEN
117 && minfop->reg_name[syms[i]->value] == NULL)
118 minfop->reg_name[syms[i]->value] = syms[i]->name;
120 free (syms);
[all...] |
| /src/external/gpl3/binutils.old/dist/gprof/ |
| sym_ids.c | 62 Sym_Table syms[NUM_TABLES]; variable
76 /* This is the table in which we keep all the syms that match
283 /* Convert symbol ids into Syms, so we can deal with them more easily. */
293 extend_match (&id->left, sym, &syms[id->which_table], false);
301 for (tab = syms; tab < &syms[NUM_TABLES]; ++tab)
318 /* Make a second pass through symtab, creating syms as necessary. */
324 extend_match (&id->left, sym, &syms[id->which_table], true);
360 for (tab = &syms[0]; tab < &syms[NUM_TABLES]; ++tab
[all...] |
| /src/external/gpl3/binutils.old/dist/opcodes/ |
| mmix-dis.c | 99 asymbol **syms = malloc (symsize); local
102 if (syms == NULL)
108 nsyms = bfd_canonicalize_symtab (abfd, syms);
113 for (i = 0; i < nsyms && syms[i] != NULL; i++)
115 if (syms[i]->section == reg_section
116 && syms[i]->value < MAX_REG_NAME_LEN
117 && minfop->reg_name[syms[i]->value] == NULL)
118 minfop->reg_name[syms[i]->value] = syms[i]->name;
120 free (syms);
[all...] |
| /src/external/gpl3/gcc.old/dist/lto-plugin/ |
| lto-symtab.c | 40 struct ld_plugin_symbol *syms; member in struct:file_handle
46 /* Write NSYMS symbols from file HANDLE in SYMS. */
49 get_symbols (const void *handle, int nsyms, struct ld_plugin_symbol *syms)
56 syms[i] = h->syms[i];
89 /* For a file identified by HANDLE, add NSYMS symbols from SYMS. */
93 const struct ld_plugin_symbol *syms)
98 h->syms = calloc (nsyms, sizeof (struct ld_plugin_symbol));
99 assert (h->syms);
103 h->syms[i] = syms[i]
232 struct ld_plugin_symbol *syms = handle->syms; local
262 struct ld_plugin_symbol *syms = handle->syms; local
304 struct ld_plugin_symbol *syms = handle->syms; local
[all...] |
| /src/external/gpl3/gdb/dist/opcodes/ |
| mmix-dis.c | 99 asymbol **syms = malloc (symsize); local
102 if (syms == NULL)
108 nsyms = bfd_canonicalize_symtab (abfd, syms);
113 for (i = 0; i < nsyms && syms[i] != NULL; i++)
115 if (syms[i]->section == reg_section
116 && syms[i]->value < MAX_REG_NAME_LEN
117 && minfop->reg_name[syms[i]->value] == NULL)
118 minfop->reg_name[syms[i]->value] = syms[i]->name;
120 free (syms);
[all...] |
| /src/external/gpl3/gdb.old/dist/opcodes/ |
| mmix-dis.c | 99 asymbol **syms = malloc (symsize); local
102 if (syms == NULL)
108 nsyms = bfd_canonicalize_symtab (abfd, syms);
113 for (i = 0; i < nsyms && syms[i] != NULL; i++)
115 if (syms[i]->section == reg_section
116 && syms[i]->value < MAX_REG_NAME_LEN
117 && minfop->reg_name[syms[i]->value] == NULL)
118 minfop->reg_name[syms[i]->value] = syms[i]->name;
120 free (syms);
[all...] |
| /src/common/dist/zlib/examples/ |
| enough.c | 125 syms: number of symbols remaining to code
131 syms: 3..totsym (totsym == total symbols to code)
132 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6)
135 syms == 2 is not saved since that immediately leads to a single code. left
138 ends at syms-1 since left == syms immediately results in a single code.
143 one (syms) being outermost, and the last one (len) being innermost. We build
144 the array with length max-1 lists for the len index, with syms-3 of those
156 to the num[] array as described above for the (syms, left, len) triplet
506 int syms = 286; local
[all...] |
| /src/external/bsd/wpa/dist/src/utils/ |
| trace.c | 31 static asymbol **syms = NULL; variable
103 if (syms)
121 syms = malloc(storage);
122 if (syms == NULL) {
128 symcount = bfd_canonicalize_dynamic_symtab(abfd, syms);
130 symcount = bfd_canonicalize_symtab(abfd, syms);
134 free(syms);
135 syms = NULL;
181 data->found = bfd_find_nearest_line(abfd, section, syms,
269 if (!syms) {
[all...] |
| /src/external/gpl3/binutils/dist/bfd/ |
| binary.c | 161 asymbol *syms; local
165 syms = (asymbol *) bfd_alloc (abfd, amt);
166 if (syms == NULL)
170 syms[0].the_bfd = abfd;
171 syms[0].name = mangle_name (abfd, "start");
172 syms[0].value = 0;
173 syms[0].flags = BSF_GLOBAL;
174 syms[0].section = sec;
175 syms[0].udata.p = NULL;
178 syms[1].the_bfd = abfd
[all...] |
| dwarf1.c | 38 asymbol** syms; member in struct:dwarf1_debug
310 stash->syms);
531 stash->syms = symbols;
|
| /src/external/gpl3/binutils/dist/binutils/ |
| addr2line.c | 56 static asymbol **syms; /* Symbol table. */ variable
140 syms = (asymbol **) xmalloc (storage);
142 symcount = bfd_canonicalize_dynamic_symtab (abfd, syms);
144 symcount = bfd_canonicalize_symtab (abfd, syms);
154 free (syms);
155 syms = xmalloc (storage);
156 symcount = bfd_canonicalize_dynamic_symtab (abfd, syms);
163 free (syms);
164 syms = NULL;
203 found = bfd_find_nearest_line_discriminator (abfd, section, syms, pc - vma
[all...] |
| rdcoff.c | 51 asymbol **syms; member in struct:coff_symbols
350 sym = symbols->syms[symbols->symno];
464 sym = symbols->syms[symbols->symno];
621 parse_coff (bfd *abfd, asymbol **syms, long symcount, void *dhandle)
634 symbols.syms = syms;
658 sym = syms[symbols.symno];
|
| /src/external/gpl3/binutils/dist/zlib/examples/ |
| enough.c | 125 syms: number of symbols remaining to code
131 syms: 3..totsym (totsym == total symbols to code)
132 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6)
135 syms == 2 is not saved since that immediately leads to a single code. left
138 ends at syms-1 since left == syms immediately results in a single code.
143 one (syms) being outermost, and the last one (len) being innermost. We build
144 the array with length max-1 lists for the len index, with syms-3 of those
156 to the num[] array as described above for the (syms, left, len) triplet
506 int syms = 286; local
[all...] |
| /src/external/gpl3/binutils.old/dist/binutils/ |
| addr2line.c | 56 static asymbol **syms; /* Symbol table. */ variable
140 syms = (asymbol **) xmalloc (storage);
142 symcount = bfd_canonicalize_dynamic_symtab (abfd, syms);
144 symcount = bfd_canonicalize_symtab (abfd, syms);
154 free (syms);
155 syms = xmalloc (storage);
156 symcount = bfd_canonicalize_dynamic_symtab (abfd, syms);
163 free (syms);
164 syms = NULL;
203 found = bfd_find_nearest_line_discriminator (abfd, section, syms, pc - vma
[all...] |
| rdcoff.c | 51 asymbol **syms; member in struct:coff_symbols
350 sym = symbols->syms[symbols->symno];
464 sym = symbols->syms[symbols->symno];
621 parse_coff (bfd *abfd, asymbol **syms, long symcount, void *dhandle)
634 symbols.syms = syms;
658 sym = syms[symbols.symno];
|
