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()
374       switch (tree->type.node_code)  in fold_unary()
545   if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)  in fold_binary()
602       switch (tree->type.node_code)  in fold_binary()
702   switch (tree->type.node_code)  in fold_name()
866 	      if (tree->type.node_code == SIZEOF)  in fold_name()
938 	  && tree->type.node_code == NAME  in is_dot()
962 	  && tree->type.node_code == NAME  in is_sym_value()
981 	  && tree->type.node_code == NE  in is_dot_ne_0()
993 	  && tree->type.node_code == '+'  in is_dot_plus_0()
1005       && tree->type.node_code == ALIGN_K)  in is_align_conditional()
1298       tree->type.node_code = INT;  in exp_value_fold()
1312   new_e->type.node_code = code;  in exp_binop()
1332   new_e->type.node_code = code;  in exp_trinop()
1351   new_e->unary.type.node_code = code;  in exp_unop()
1370   new_e->name.type.node_code = code;  in exp_nameop()
1388   n->assign.type.node_code = '=';  in exp_assop()
1430   n->assert_s.type.node_code = '!';  in exp_assert()
1465       exp_print_token (tree->type.node_code, true);  in exp_print_tree()
1476       switch (tree->type.node_code)  in exp_print_tree()
1488 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()
1498 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()
1506 	exp_print_token (tree->type.node_code, true);  in exp_print_tree()
1518       exp_print_token (tree->unary.type.node_code, false);  in exp_print_tree()
1534       if (tree->type.node_code == NAME)  in exp_print_tree()
1538 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()