203   new_e->type.node_code = INT;  in exp_intop()
216   new_e->type.node_code = INT;  in exp_bigintop()
231   new_e->type.node_code = REL;  in exp_relop()
371       switch (tree->type.node_code)  in fold_unary()
536   if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)  in fold_binary()
593       switch (tree->type.node_code)  in fold_binary()
693   switch (tree->type.node_code)  in fold_name()
856 	      if (tree->type.node_code == SIZEOF)  in fold_name()
920 	  && tree->type.node_code == NAME  in is_dot()
944 	  && tree->type.node_code == NAME  in is_sym_value()
963 	  && tree->type.node_code == NE  in is_dot_ne_0()
975 	  && tree->type.node_code == '+'  in is_dot_plus_0()
987       && tree->type.node_code == ALIGN_K)  in is_align_conditional()
1273       tree->type.node_code = INT;  in exp_value_fold()
1287   new_e->type.node_code = code;  in exp_binop()
1307   new_e->type.node_code = code;  in exp_trinop()
1326   new_e->unary.type.node_code = code;  in exp_unop()
1345   new_e->name.type.node_code = code;  in exp_nameop()
1363   n->assign.type.node_code = '=';  in exp_assop()
1405   n->assert_s.type.node_code = '!';  in exp_assert()
1440       exp_print_token (tree->type.node_code, TRUE);  in exp_print_tree()
1451       switch (tree->type.node_code)  in exp_print_tree()
1463 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()
1473 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()
1481 	exp_print_token (tree->type.node_code, TRUE);  in exp_print_tree()
1493       exp_print_token (tree->unary.type.node_code, FALSE);  in exp_print_tree()
1509       if (tree->type.node_code == NAME)  in exp_print_tree()
1513 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()