> -----Original Message----- > From: gcc-ow...@gcc.gnu.org [mailto:gcc-ow...@gcc.gnu.org] On > Behalf Of Andrew Pinski > Sent: 14 January 2010 17:08 > To: Paulo J. Matos > Cc: gcc@gcc.gnu.org > Subject: Re: Sibcall on recursive functions > > > Because it is not really sibcalled but rather turned into a loop > via > tail recursion. This is almost always profitable and never changes > how many times the stack gets restored (unless there is an alloca > in > the function which is checked for inside the optimization). >
Can you please tell me which pass performs this optimization? > Thanks, > Andrew Pinski > > > To report this email as spam click > https://www.mailcontrol.com/sr/wQw0zmjPoHdJTZGyOCrrhg== > tiLNkw7o1Ucyk7zCaZ!cAQ67dzg1qS30Zw0Y5ZKUUtXYzJog3g== . Member of the CSR plc group of companies. CSR plc registered in England and Wales, registered number 4187346, registered office Churchill House, Cambridge Business Park, Cowley Road, Cambridge, CB4 0WZ, United Kingdom
