204   new_e->type.node_code = INT;  in exp_intop()
217   new_e->type.node_code = INT;  in exp_bigintop()
232   new_e->type.node_code = REL;  in exp_relop()
375       switch (tree->type.node_code)  in fold_unary()
546   if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)  in fold_binary()
603       switch (tree->type.node_code)  in fold_binary()
721   switch (tree->type.node_code)  in fold_name()
885 	      if (tree->type.node_code == SIZEOF)  in fold_name()
957 	  && tree->type.node_code == NAME  in is_dot()
981 	  && tree->type.node_code == NAME  in is_sym_value()
1000 	  && tree->type.node_code == NE  in is_dot_ne_0()
1012 	  && tree->type.node_code == '+'  in is_dot_plus_0()
1024       && tree->type.node_code == ALIGN_K)  in is_align_conditional()
1320       tree->type.node_code = INT;  in exp_value_fold()
1334   new_e->type.node_code = code;  in exp_binop()
1354   new_e->type.node_code = code;  in exp_trinop()
1373   new_e->unary.type.node_code = code;  in exp_unop()
1392   new_e->name.type.node_code = code;  in exp_nameop()
1410   n->assign.type.node_code = '=';  in exp_assop()
1452   n->assert_s.type.node_code = '!';  in exp_assert()
1487       exp_print_token (tree->type.node_code, true);  in exp_print_tree()
1498       switch (tree->type.node_code)  in exp_print_tree()
1510 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()
1520 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()
1528 	exp_print_token (tree->type.node_code, true);  in exp_print_tree()
1540       exp_print_token (tree->unary.type.node_code, false);  in exp_print_tree()
1556       if (tree->type.node_code == NAME)  in exp_print_tree()
1560 	  exp_print_token (tree->type.node_code, false);  in exp_print_tree()