search for: lfloor

On Mon, 8 Nov 2010 15:42:33 -0800 (PST) Samuel Crow <samuraileumas at yahoo.com> wrote: > http://www.phoronix.com/scan.php?page=article&item=llvm_gcc_dragonegg28&num=1 > as of version 2.8, LLVM is generating slower code than the newer GCCs > but generates the code more quickly. > I would be more concerned about the 'unable to compile', or 'compiled code not

http://www.phoronix.com/scan.php?page=article&item=llvm_gcc_dragonegg28&num=1 as of version 2.8, LLVM is generating slower code than the newer GCCs but generates the code more quickly.

...filed bugs. I analysed the dragonegg compile failures. The graphicsmagick, imagemagick, lame and x264 failures were all failures to link, due undefined references to builtin_lfoor and/or builtin_lceil. Recent gcc turns calls to floor/ceil followed by a cast to long or long long into a call to an lfloor/lceil builtin. These were not being recognised by dragonegg, so were just being passed on as is, resulting in the link failures. I just added support for these builtins and now all of the above programs compile on x86-64 linux. All of the remaining failures (crafty, libgcrypt11 and openssl) were...

...} \eqn{\frac{j - m}{n} \le p < \frac{j - m + 1}{n}}{(j - m) / n <= p < (j - m + 1) / n}, \eqn{ } \eqn{x_{j}}{x[j]} is the \eqn{j}th order statistic, \eqn{n} is the sample size, and \eqn{m} is a constant determined by the sample quantile type. Here \eqn{\gamma}{gamma} depends on \eqn{j = \lfloor np + m\rfloor}{j = floor(np + m),} and \eqn{g = np + m - j.} For the continuous sample quantile types (4 through 9), the sample quantiles can be obtained by linear interpolation between the \eqn{k}th order statistic and \eqn{p(k)}: \deqn{p(k) = \frac{k - \alpha} {n - \alpha - \beta + 1}}{p(k) = (k...