Lines Matching defs:search
970 struct scnhead search;
1004 search.name = elf_strptr (fileinfo->elf, fileinfo->shstrndx, shdr->sh_name);
1005 search.type = shdr->sh_type;
1006 search.flags = shdr->sh_flags;
1007 search.entsize = shdr->sh_entsize;
1008 search.grp_signature = grpscn != NULL ? grpscn->symbols->name : NULL;
1009 search.kind = scn_normal;
1010 hval = elf_hash (search.name);
1013 queued = ld_section_tab_find (&ld_state.section_tab, hval, &search);
1079 queued->name = search.name;
1521 struct symbol search;
1522 search.name = elf_strptr (fileinfo->elf, symstridx, sym->st_name);
1523 unsigned long int hval = elf_hash (search.name);
1530 && strcmp (search.name, "_DYNAMIC") == 0)
1532 && strcmp (search.name, "_GLOBAL_OFFSET_TABLE_") == 0))
1540 hval, &search);
1547 newp->name = search.name;
1920 struct symbol search = { .name = syms[cnt].as_name };
1922 syms[cnt].as_hash, &search);
2235 position in the search path again to look for another file if
3252 /* Search for the group with this index. */
3362 struct id_list search;
3380 search.id = strndupa (str, version - str);
3387 search.id = str;
3392 elf_hash (search.id), &search);
3502 heuristic. Depending on the optimization level the search is
3577 positive search and the average length of a negative search.
3633 struct symbol search = { .name = ld_state.entry };
3637 elf_hash (ld_state.entry), &search);
5396 struct symbol search;
5397 search.name = elf_strptr (file->elf, file->symstridx,
5401 elf_hash (search.name), &search);
