contrib/gcc/tree-tailcall.c

67    To do this, we maintain two accumulators (a_acc and m_acc) that indicate
68    when we reach the return x statement, we should return a_acc + x * m_acc
80       We rewrite this to a gimple equivalent of return m_acc * x + a_acc.
91       a_acc + (a + m * f(...)) * m_acc = (a_acc + a * m_acc) + (m * m_acc) * f(...).
93       I.e. we increase a_acc by a * m_acc, multiply m_acc by m and
122 static tree m_acc, a_acc;
551   tree a_acc_arg = a_acc, m_acc_arg = m_acc;
576 		     build2 (PLUS_EXPR, ret_type, a_acc, var));
577       var = make_ssa_name (SSA_NAME_VAR (a_acc), stmt);
593   if (a_acc)
596 	if (PHI_RESULT (phi) == a_acc)
656 		     build2 (PLUS_EXPR, ret_type, a_acc, var));
896   a_acc = m_acc = NULL_TREE;
926       if (act->add && !a_acc)
939 	  a_acc = PHI_RESULT (phi);
974   if (a_acc || m_acc)
983 	    adjust_return_value (e->src, m_acc, a_acc);