205   new_e->type.node_code = INT;  in exp_intop()
218   new_e->type.node_code = INT;  in exp_bigintop()
233   new_e->type.node_code = REL;  in exp_relop()
351       switch (tree->type.node_code)  in fold_unary()
430   if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)  in fold_binary()
484       switch (tree->type.node_code)  in fold_binary()
664   switch (tree->type.node_code)  in fold_name()
836 	      if (tree->type.node_code == SIZEOF)  in fold_name()
903 	  && tree->type.node_code == NAME  in is_dot()
927 	  && tree->type.node_code == NAME  in is_sym_value()
946 	  && tree->type.node_code == NE  in is_dot_ne_0()
958 	  && tree->type.node_code == '+'  in is_dot_plus_0()
970       && tree->type.node_code == ALIGN_K)  in is_align_conditional()
1259   value.type.node_code = code;  in exp_binop()
1279   value.type.node_code = code;  in exp_trinop()
1300   value.unary.type.node_code = code;  in exp_unop()
1319   value.name.type.node_code = code;  in exp_nameop()
1345   n->assign.type.node_code = '=';  in exp_assop()
1388   n->assert_s.type.node_code = '!';  in exp_assert()
1423       exp_print_token (tree->type.node_code, TRUE);  in exp_print_tree()
1434       switch (tree->type.node_code)  in exp_print_tree()
1446 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()
1456 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()
1464 	exp_print_token (tree->type.node_code, TRUE);  in exp_print_tree()
1476       exp_print_token (tree->unary.type.node_code, FALSE);  in exp_print_tree()
1492       if (tree->type.node_code == NAME)  in exp_print_tree()
1496 	  exp_print_token (tree->type.node_code, FALSE);  in exp_print_tree()