Lines Matching refs:search
968 struct scnhead search;
1002 search.name = elf_strptr (fileinfo->elf, fileinfo->shstrndx, shdr->sh_name);
1003 search.type = shdr->sh_type;
1004 search.flags = shdr->sh_flags;
1005 search.entsize = shdr->sh_entsize;
1006 search.grp_signature = grpscn != NULL ? grpscn->symbols->name : NULL;
1007 search.kind = scn_normal;
1008 hval = elf_hash (search.name);
1011 queued = ld_section_tab_find (&ld_state.section_tab, hval, &search);
1077 queued->name = search.name;
1519 struct symbol search;
1520 search.name = elf_strptr (fileinfo->elf, symstridx, sym->st_name);
1521 unsigned long int hval = elf_hash (search.name);
1528 && strcmp (search.name, "_DYNAMIC") == 0)
1530 && strcmp (search.name, "_GLOBAL_OFFSET_TABLE_") == 0))
1538 hval, &search);
1545 newp->name = search.name;
1918 struct symbol search = { .name = syms[cnt].as_name };
1920 syms[cnt].as_hash, &search);
2233 position in the search path again to look for another file if
3250 /* Search for the group with this index. */
3360 struct id_list search;
3378 search.id = strndupa (str, version - str);
3385 search.id = str;
3390 elf_hash (search.id), &search);
3500 heuristic. Depending on the optimization level the search is
3575 positive search and the average length of a negative search.
3631 struct symbol search = { .name = ld_state.entry };
3635 elf_hash (ld_state.entry), &search);
5394 struct symbol search;
5395 search.name = elf_strptr (file->elf, file->symstridx,
5399 elf_hash (search.name), &search);
