Lines Matching defs:symbols
181 void symbols__fixup_duplicate(struct rb_root_cached *symbols)
189 nd = rb_first_cached(symbols);
204 rb_erase_cached(&next->rb_node, symbols);
209 rb_erase_cached(&curr->rb_node, symbols);
215 /* Update zero-sized symbols using the address of the next symbol */
216 void symbols__fixup_end(struct rb_root_cached *symbols, bool is_kallsyms)
218 struct rb_node *nd, *prevnd = rb_first_cached(symbols);
238 * In kallsyms, it determines module symbols using '[' character
274 * We still haven't the actual symbols, so guess the
317 void symbols__delete(struct rb_root_cached *symbols)
320 struct rb_node *next = rb_first_cached(symbols);
325 rb_erase_cached(&pos->rb_node, symbols);
330 void __symbols__insert(struct rb_root_cached *symbols,
333 struct rb_node **p = &symbols->rb_root.rb_node;
361 rb_insert_color_cached(&sym->rb_node, symbols, leftmost);
364 void symbols__insert(struct rb_root_cached *symbols, struct symbol *sym)
366 __symbols__insert(symbols, sym, false);
369 static struct symbol *symbols__find(struct rb_root_cached *symbols, u64 ip)
373 if (symbols == NULL)
376 n = symbols->rb_root.rb_node;
392 static struct symbol *symbols__first(struct rb_root_cached *symbols)
394 struct rb_node *n = rb_first_cached(symbols);
402 static struct symbol *symbols__last(struct rb_root_cached *symbols)
404 struct rb_node *n = rb_last(&symbols->rb_root);
422 static void symbols__insert_by_name(struct rb_root_cached *symbols, struct symbol *sym)
424 struct rb_node **p = &symbols->rb_root.rb_node;
442 rb_insert_color_cached(&symn->rb_node, symbols, leftmost);
445 static void symbols__sort_by_name(struct rb_root_cached *symbols,
452 symbols__insert_by_name(symbols, pos);
473 static struct symbol *symbols__find_by_name(struct rb_root_cached *symbols,
480 if (symbols == NULL)
483 n = symbols->rb_root.rb_node;
525 __symbols__insert(&dso->symbols, sym, dso->kernel);
537 rb_erase_cached(&sym->rb_node, &dso->symbols);
546 dso->last_find_result.symbol = symbols__find(&dso->symbols, addr);
554 return symbols__first(&dso->symbols);
559 return symbols__last(&dso->symbols);
591 return symbols__sort_by_name(&dso->symbol_names, &dso->symbols);
671 * These are symbols in the kernel image, so make sure that
717 struct rb_root_cached *root = &dso->symbols;
723 * module symbols are not sorted so we add all
724 * symbols, setting length to 0, and rely on
731 * We will pass the symbols to the filter later, in
754 struct rb_root_cached old_root = dso->symbols;
755 struct rb_root_cached *root = &dso->symbols;
787 symbols__insert(&curr_map->dso->symbols, pos);
798 * Split the symbols into maps, making sure there are no overlaps, i.e. the
809 struct rb_root_cached *root = &dso->symbols;
839 * We assume all symbols of a module are
842 * symbols are in its kmap. Mark it as
870 * These symbols are not needed anymore since the
872 * symbols instead. Avoid having to deal with
875 * symbols at this point.
925 symbols__insert(&curr_map->dso->symbols, pos);
1402 * If one of the corresponding symbols is there, assume the
1476 symbols__fixup_end(&dso->symbols, true);
1477 symbols__fixup_duplicate(&dso->symbols);
1538 symbols__insert(&dso->symbols, sym);
1583 asymbol **symbols, *sym;
1629 symbols = malloc(symbols_size);
1630 if (!symbols)
1633 symbols_count = bfd_canonicalize_symtab(abfd, symbols);
1637 qsort(symbols, symbols_count, sizeof(asymbol *), bfd_symbols__cmpvalue);
1643 sym = symbols[i];
1649 bfd_asymbol_section(symbols[i + 1]) == section &&
1650 bfd2elf_binding(symbols[i + 1]) < 0)
1654 bfd_asymbol_section(symbols[i + 1]) == section)
1655 len = symbols[i + 1]->value - sym->value;
1665 symbols__insert(&dso->symbols, symbol);
1671 symbols__fixup_end(&dso->symbols, false);
1672 symbols__fixup_duplicate(&dso->symbols);
1677 free(symbols);
2069 pr_debug("Using %s for symbols\n", symfs_vmlinux);
2253 pr_debug("Using %s for symbols\n", kallsyms_filename);
2296 pr_debug("Using %s for symbols\n", kallsyms_filename);
2499 * A path to symbols of "/" is identical to ""