Sandra Loosemore <sandra@codesourcery.com> writes:
I haven't yet changed the low-level representation of CALL_EXPRs to
actually have a variable number of operands. My plan is to continue
to use struct tree_exp, and instead of stuffing a TREE_LIST of
arguments in operand 1, put an INT_CST node there that holds the
number of arguments following the fixed operands in the node. It's a
little icky, but the storage overhead should be negligible (since
integer constants are shared) and it avoids having to special-case
CALL_EXPRs every place where compound expressions are being
manipulated.
I assume this is a temporary maneuver, and that with the new
representation the first operand will be an int, not an INT_CST node.