Date: Mon, 28 May 2018 17:47:09 -0300 From: Adhemerval Zanella <adhemerval.zanella@linaro.org> To: sgk@troutmask.apl.washington.edu Cc: Konstantin Belousov <kib@freebsd.org>, freebsd-hackers@freebsd.org, emaste@freebsd.org Subject: Re: Code with apache-2 on /usr/src Message-ID: <72101038-9e89-3f23-ab67-1c97b2a89803@linaro.org> In-Reply-To: <20180528202117.GA77184@troutmask.apl.washington.edu> References: <b38baac0-f326-5d46-5afe-0981af61538f@linaro.org> <20180528190444.GE3789@kib.kiev.ua> <f9f10762-651d-d2f2-c46f-6960b9a69705@linaro.org> <20180528193506.GA76705@troutmask.apl.washington.edu> <1c09023e-9bf5-d23a-dedc-1c4f4706bbde@linaro.org> <20180528202117.GA77184@troutmask.apl.washington.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On 28/05/2018 17:21, Steve Kargl wrote: > On Mon, May 28, 2018 at 04:47:21PM -0300, Adhemerval Zanella wrote: >> >> >> On 28/05/2018 16:35, Steve Kargl wrote: >>> >>> The above URL seems to contain only single precision code, >>> e.g., sinf(x). What benefit does this code have over the >>> current implementations of these functions? Doesn't ARM >>> support at least a double precision type? >> >> Yes, the github repository only contains single precision implementation and >> at the moment my idea is to contribute with expf, powf, logf, expf2, and >> log2f. All these implementation are faster than current FreeBSD ones (I >> plan to dig into with more details in patch proposal). >> >>> Why have an >>> algorithms for single precision that differ from the >>> algorithms at higher precision? >>> >> >> Are you asking why use an implementation for single precision and another >> for double and/or long double (if the case) or why to use a different >> mathematical method for each one? > > Your question don't make any sense to me. My question means that > if you only have ARM-specific single precision routines, then the > underlying algorithms for those SP routines will by definition be > different than the double and long double precision routines. One > can do for example 'diff -u s_sinf.c s_sin.c' while debugging. > The difference that one sees are usually restricted to different > numerical literal constants and the number of terms in polynomial > approximations. > Sorry if I was not clear, I did not fully get your question. Also for avoid further misconceptions, this new implementation is *not* ARM-specific, but rather a different one which is faster than current for FreeBSD (in fact faster on x86 as well). And is having a different algorithm for single and double prevision a blocker for a future patch proposal?
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?72101038-9e89-3f23-ab67-1c97b2a89803>