Re: Predict recursive calls as unlikely

2016-06-25 Thread Jan Hubicka
> Jan Hubicka writes: > > > Hi, > > this is first of two patches for getting more realistic predictions of > > recursive functions. It is clear that in order for recursion to finish, the > > sum of frequencies of recursive calls should not exceed sum of frequencies > > of > > the function entry

Re: Predict recursive calls as unlikely

2016-06-25 Thread Andi Kleen
Jan Hubicka writes: > Hi, > this is first of two patches for getting more realistic predictions of > recursive functions. It is clear that in order for recursion to finish, the > sum of frequencies of recursive calls should not exceed sum of frequencies of > the function entry block. This globa

Predict recursive calls as unlikely

2016-06-25 Thread Jan Hubicka
Hi, this is first of two patches for getting more realistic predictions of recursive functions. It is clear that in order for recursion to finish, the sum of frequencies of recursive calls should not exceed sum of frequencies of the function entry block. This global condition is however bit hard