1067       if (tree->assign.dst[0] == '.' && tree->assign.dst[1] == 0)  in exp_fold_tree_1()
1076 	      exp_fold_tree_1 (tree->assign.src);  in exp_fold_tree_1()
1093 		       && (is_value (tree->assign.src, 0)  in exp_fold_tree_1()
1094 			   || is_sym_value (tree->assign.src, 0)  in exp_fold_tree_1()
1095 			   || is_dot_plus_0 (tree->assign.src)  in exp_fold_tree_1()
1096 			   || is_align_conditional (tree->assign.src))))  in exp_fold_tree_1()
1145 	      h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,  in exp_fold_tree_1()
1162 	  expld.assign_name = tree->assign.dst;  in exp_fold_tree_1()
1164 	  exp_fold_tree_1 (tree->assign.src);  in exp_fold_tree_1()
1183 		  h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,  in exp_fold_tree_1()
1187 			   tree->assign.dst);  in exp_fold_tree_1()
1206 		  if (!update_definedness (tree->assign.dst, h)  in exp_fold_tree_1()
1233 		      h->linker_def = ! tree->assign.type.lineno;  in exp_fold_tree_1()
1236 		      if (tree->assign.hidden)  in exp_fold_tree_1()
1387   n = stat_alloc (sizeof (n->assign));  in exp_assop()
1388   n->assign.type.node_code = '=';  in exp_assop()
1389   n->assign.type.filename = src->type.filename;  in exp_assop()
1390   n->assign.type.lineno = src->type.lineno;  in exp_assop()
1391   n->assign.type.node_class = class;  in exp_assop()
1392   n->assign.src = src;  in exp_assop()
1393   n->assign.dst = dst;  in exp_assop()
1394   n->assign.hidden = hidden;  in exp_assop()
1464       fputs (tree->assign.dst, config.map_file);  in exp_print_tree()
1466       exp_print_tree (tree->assign.src);  in exp_print_tree()
1470       fprintf (config.map_file, "PROVIDE (%s = ", tree->assign.dst);  in exp_print_tree()
1471       exp_print_tree (tree->assign.src);  in exp_print_tree()