Lines Matching refs:search
911 struct scnhead search;
945 search.name = elf_strptr (fileinfo->elf, fileinfo->shstrndx, shdr->sh_name);
946 search.type = shdr->sh_type;
947 search.flags = shdr->sh_flags;
948 search.entsize = shdr->sh_entsize;
949 search.grp_signature = grpscn != NULL ? grpscn->symbols->name : NULL;
950 search.kind = scn_normal;
951 hval = elf_hash (search.name);
954 queued = ld_section_tab_find (&ld_state.section_tab, hval, &search);
990 queued->name = search.name;
1353 struct symbol search;
1354 search.name = elf_strptr (fileinfo->elf, symstridx, sym->st_name);
1355 unsigned long int hval = elf_hash (search.name);
1362 && strcmp (search.name, "_DYNAMIC") == 0)
1364 && strcmp (search.name, "_GLOBAL_OFFSET_TABLE_") == 0))
1372 hval, &search);
1379 newp->name = search.name;
1746 struct symbol search = { .name = syms[cnt].as_name };
1748 syms[cnt].as_hash, &search);
2036 position in the search path again to look for another file if
3034 /* Search for the group with this index. */
3144 struct id_list search;
3162 search
3169 search.id = str;
3174 elf_hash (search.id), &search);
3284 heuristic. Depending on the optimization level the search is
3358 positive search and the average length of a negative search.
3403 struct symbol search = { .name = ld_state.entry };
3407 elf_hash (ld_state.entry), &search);
