Lines Matching defs:symbols
1 /* Combine stripped files with separate symbols and debug information.
357 /* The binutils linker leaves gratuitous section symbols in .symtab
621 /* The original file probably had section symbols for all of its
623 possible, add in section symbols for the added sections. */
650 /* Copy the existing section symbols. */
667 /* Add in the new section symbols. */
685 /* Now copy the rest of the existing symbols. */
706 /* This has the side effect of updating STT_SECTION symbols' values,
842 /* Collect input symbols into our internal form. */
908 /* Compare symbols with a consistent ordering,
923 /* Compare symbols for output order after slots have been assigned. */
931 /* Sort discarded symbols last. */
935 /* Local symbols must come first. */
940 /* binutils always puts section symbols first. */
948 /* binutils always puts section symbols in section index order. */
951 error_exit (0, "section symbols in unexpected order");
957 error_exit (0, "found two identical symbols");
1563 so that collect_symbols can update symbols' st_shndx fields. */
1821 /* First collect all the symbols from both tables. */
1824 struct symbol *symbols = xmalloc (total_syms * sizeof (struct symbol));
1832 symbols, symndx_map, NULL);
1838 &symbols[stripped_nsym - 1],
1841 /* Next, sort our array of all symbols. */
1842 qsort (symbols, total_syms, sizeof symbols[0], compare_symbols);
1844 /* Now we can weed out the duplicates. Assign remaining symbols
1847 for (struct symbol *s = symbols; s < &symbols[total_syms]; ++s)
1860 while (n + 1 < &symbols[total_syms] && !compare_symbols (s, n + 1))
1876 qsort (symbols, total_syms, sizeof symbols[0], compare_symbols_output);
1879 /* The discarded symbols are now at the end of the table. */
1880 assert (symbols[nsym].name == NULL);
1887 assert (symbols[i].name != NULL);
1888 assert (*symbols[i].map != 0);
1889 *symbols[i].map = 1 + i;
1890 symbols[i].strent = dwelf_strtab_add (symstrtab, symbols[i].name);
1893 /* Scan the discarded symbols too, just to update their slots
1897 assert (symbols[i].name == NULL);
1898 if (symbols[i].duplicate == NULL)
1899 assert (*symbols[i].map == STN_UNDEF);
1902 assert (*symbols[i].duplicate != STN_UNDEF);
1903 *symbols[i].map = *symbols[i].duplicate;
1972 struct symbol *s = &symbols[i];
1982 /* Keep track of the number of leading local symbols. */
2014 free (symbols);
2562 Combine stripped files with separate symbols and debug information.\n\