Lines Matching refs:search
960 struct scnhead search;
994 search.name = elf_strptr (fileinfo->elf, fileinfo->shstrndx, shdr->sh_name);
995 search.type = shdr->sh_type;
996 search.flags = shdr->sh_flags;
997 search.entsize = shdr->sh_entsize;
998 search.grp_signature = grpscn != NULL ? grpscn->symbols->name : NULL;
999 search.kind = scn_normal;
1000 hval = elf_hash (search.name);
1003 queued = ld_section_tab_find (&ld_state.section_tab, hval, &search);
1069 queued->name = search.name;
1511 struct symbol search;
1512 search.name = elf_strptr (fileinfo->elf, symstridx, sym->st_name);
1513 unsigned long int hval = elf_hash (search.name);
1520 && strcmp (search.name, "_DYNAMIC") == 0)
1522 && strcmp (search.name, "_GLOBAL_OFFSET_TABLE_") == 0))
1530 hval, &search);
1537 newp->name = search.name;
1910 struct symbol search = { .name = syms[cnt].as_name };
1912 syms[cnt].as_hash, &search);
2225 position in the search path again to look for another file if
3242 /* Search for the group with this index. */
3352 struct id_list search;
3370 search.id = strndupa (str, version - str);
3377 search.id = str;
3382 elf_hash (search.id), &search);
3492 heuristic. Depending on the optimization level the search is
3567 positive search and the average length of a negative search.
3623 struct symbol search = { .name = ld_state.entry };
3627 elf_hash (ld_state.entry), &search);
5386 struct symbol search;
5387 search.name = elf_strptr (file->elf, file->symstridx,
5391 elf_hash (search.name), &search);
