Lines Matching refs:symbols
64 * and the names created for indirect symbols). If this is for indirect symbols
77 * indirect symbols are placed in first in the archive in the order the symbol
186 * symbols with an indirect symbol for the symbol name with an underbar and
333 /* process the list of symbols and create the data structures */
345 /* translate the symbols in the input file */
379 * process the symbols listed in list_filename. This enters each symbol as an
382 * be used to put these symbols in.
434 * Translate the objects in the input file by changing the external symbols
435 * that match indirect symbols in the symbol hash table to the symbol that the
531 * Make the objects for the indirect symbols in the -n flag is
592 * translate the one object's symbols which match the symbols for which indirect
593 * symbols are to be created.
606 struct nlist *symbols, *nlistp;
629 symbols = (struct nlist *)(object->object_addr + object->st->symoff);
632 swap_nlist(symbols, nsyms, host_byte_sex);
636 object->output_symbols = symbols;
652 nlistp = symbols;
710 memcpy(new_symbols, symbols, nsyms * sizeof(struct nlist));
727 symbols = new_symbols;
728 object->output_symbols = symbols;
815 struct nlist *symbols;
846 symbols = (struct nlist *)(object->object_addr + object->st->symoff);
868 swap_nlist(symbols, nsyms, host_byte_sex);
885 * with the names of the symbols listed in the indr file renamed and
887 * Look to make sure no symbols exist that would colide with the
889 * the symbols can be renamed.
898 if(symbols[i].n_un.n_strx != 0){
899 if((uint32_t)symbols[i].n_un.n_strx > strsize){
905 if((symbols[i].n_type & N_TYPE) == N_INDR){
906 if(symbols[i].n_value != 0){
907 if(symbols[i].n_value > strsize){
914 if((symbols[i].n_type & N_EXT) == 0){ /* local symbol */
915 if(symbols[i].n_un.n_strx != 0)
916 new_strsize += strlen(strings + symbols[i].n_un.n_strx) + 1;
922 if(symbols[i].n_un.n_strx != 0){
923 sp = lookup_symbol(strings + symbols[i].n_un.n_strx);
936 len = strlen(strings + symbols[i].n_un.n_strx) + 1;
938 if((symbols[i].n_type & N_TYPE) == N_INDR)
939 len += strlen(strings + symbols[i].n_value) + 1;
943 if(((symbols[i].n_type & N_TYPE) == N_UNDF &&
944 symbols[i].n_value == 0) ||
945 (symbols[i].n_type & N_TYPE) == N_PBUD)
1028 * local symbols (sorted by module)
1029 * external defined symbols (sorted by module)
1030 * undefined symbols (sorted by name)
1038 for(i = 0; i < nsyms; i++){ /* loop for local symbols */
1039 if((symbols[i].n_type & N_EXT) == 0){
1040 new_symbols[inew_syms] = symbols[i];
1041 if(symbols[i].n_un.n_strx != 0){
1042 strcpy(q, strings + symbols[i].n_un.n_strx);
1050 for(i = 0; i < nsyms; i++){ /* loop for external defined symbols */
1051 if((symbols[i].n_type & N_EXT) == N_EXT &&
1052 ((symbols[i].n_type & N_TYPE) != N_UNDF &&
1053 (symbols[i].n_type & N_TYPE) != N_PBUD)){
1054 new_symbols[inew_syms] = symbols[i];
1056 if(symbols[i].n_un.n_strx != 0){
1057 sp = lookup_symbol(strings + symbols[i].n_un.n_strx);
1061 strcpy(p, strings + symbols[i].n_un.n_strx);
1065 if((symbols[i].n_type & N_TYPE) == N_INDR){
1066 if(symbols[i].n_value != 0){
1067 strcpy(p, strings + symbols[i].n_value);
1077 for(i = 0; i < indr_list.used; i++){ /* loop for new defined symbols*/
1092 * To get the undefined symbols in order sorted by name they are first
1099 for(i = 0; i < indr_list.used; i++){ /* loop for new undef symbols */
1113 for(i = 0; i < nsyms; i++){ /* loop for undefined symbols */
1114 if((symbols[i].n_type & N_EXT) == N_EXT &&
1115 ((symbols[i].n_type & N_TYPE) == N_UNDF ||
1116 (symbols[i].n_type & N_TYPE) == N_PBUD)){
1117 undef_map[inew_undefsyms].symbol = symbols[i];
1118 if(symbols[i].n_un.n_strx != 0){
1119 sp = lookup_symbol(strings + symbols[i].n_un.n_strx);
1123 strcpy(p, strings + symbols[i].n_un.n_strx);
1133 /* Sort the undefined symbols by name */
1137 /* Copy the symbols now in sorted order into new_symbols */
1140 /* update the map for these symbols */
1201 * Then create entries for the indr symbols.