<p dir="ltr">Ping?</p> <div class="gmail_extra"><br><div class="gmail_quote">Den 6 juni 2016 21:32 skrev "Nils Wallménius" <<a href="mailto:nils.wallmenius@gmail.com">nils.wallmenius@gmail.com</a>>:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Hi Alex,<div><br></div><div>Any response from the powerplay team?</div><div><br></div><div>If they are unresponsive, would you prefer to #IF 0 the code instead of deleting?</div><div><br></div><div>Regards</div><div>Nils</div></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Apr 25, 2016 at 10:08 PM, Alex Deucher <span dir="ltr"><<a href="mailto:alexdeucher@gmail.com" target="_blank">alexdeucher@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">On Sun, Apr 24, 2016 at 7:22 AM, Nils Wallménius<br> <<a href="mailto:nils.wallmenius@gmail.com" target="_blank">nils.wallmenius@gmail.com</a>> wrote:<br> > Signed-off-by: Nils Wallménius <<a href="mailto:nils.wallmenius@gmail.com" target="_blank">nils.wallmenius@gmail.com</a>><br> <br> Let me check with the powerplay team and make sure they are planning<br> to use these in the near future.<br> <br> Alex<br> <div><div><br> <br> > ---<br> > drivers/gpu/drm/amd/powerplay/hwmgr/ppevvmath.h | 59 +------------------------<br> > 1 file changed, 1 insertion(+), 58 deletions(-)<br> ><br> > diff --git a/drivers/gpu/drm/amd/powerplay/hwmgr/ppevvmath.h b/drivers/gpu/drm/amd/powerplay/hwmgr/ppevvmath.h<br> > index a9b40eb..8f50a03 100644<br> > --- a/drivers/gpu/drm/amd/powerplay/hwmgr/ppevvmath.h<br> > +++ b/drivers/gpu/drm/amd/powerplay/hwmgr/ppevvmath.h<br> > @@ -64,7 +64,6 @@ static fInt fGetSquare(fInt); /* Returns the square<br> > static fInt fSqrt(fInt); /* Returns the Square Root of a fInt number */<br> ><br> > static int uAbs(int); /* Returns the Absolute value of the Int */<br> > -static fInt fAbs(fInt); /* Returns the Absolute value of the fInt */<br> > static int uPow(int base, int exponent); /* Returns base^exponent an INT */<br> ><br> > static void SolveQuadracticEqn(fInt, fInt, fInt, fInt[]); /* Returns the 2 roots via the array */<br> > @@ -85,21 +84,12 @@ static fInt fDecodeLeakageID (uint32_t leakageID_fuse, fInt ln_max_div_min, fInt<br> > * -------------------------------------------------------------------------------------<br> > * Some of the following functions take two INTs as their input - This is unsafe for a variety of reasons.<br> > */<br> > -static fInt Add (int, int); /* Add two INTs and return Sum as FINT */<br> > -static fInt Multiply (int, int); /* Multiply two INTs and return Product as FINT */<br> > -static fInt Divide (int, int); /* You get the idea... */<br> > +static fInt Divide (int, int); /* Divide two INTs and return result as FINT */<br> > static fInt fNegate(fInt);<br> ><br> > static int uGetScaledDecimal (fInt); /* Internal function */<br> > static int GetReal (fInt A); /* Internal function */<br> ><br> > -/* Future Additions and Incomplete Functions<br> > - * -------------------------------------------------------------------------------------<br> > - */<br> > -static int GetRoundedValue(fInt); /* Incomplete function - Useful only when Precision is lacking */<br> > - /* Let us say we have 2.126 but can only handle 2 decimal points. We could */<br> > - /* either chop of 6 and keep 2.12 or use this function to get 2.13, which is more accurate */<br> > -<br> > /* -------------------------------------------------------------------------------------<br> > * TROUBLESHOOTING INFORMATION<br> > * -------------------------------------------------------------------------------------<br> > @@ -498,51 +488,12 @@ static void SolveQuadracticEqn(fInt A, fInt B, fInt C, fInt Roots[])<br> > * -----------------------------------------------------------------------------<br> > */<br> ><br> > -/* Addition using two normal ints - Temporary - Use only for testing purposes?. */<br> > -static fInt Add (int X, int Y)<br> > -{<br> > - fInt A, B, Sum;<br> > -<br> > - A.full = (X << SHIFT_AMOUNT);<br> > - B.full = (Y << SHIFT_AMOUNT);<br> > -<br> > - Sum.full = A.full + B.full;<br> > -<br> > - return Sum;<br> > -}<br> > -<br> > /* Conversion Functions */<br> > static int GetReal (fInt A)<br> > {<br> > return (A.full >> SHIFT_AMOUNT);<br> > }<br> ><br> > -/* Temporarily Disabled */<br> > -static int GetRoundedValue(fInt A) /*For now, round the 3rd decimal place */<br> > -{<br> > - /* ROUNDING TEMPORARLY DISABLED<br> > - int temp = A.full;<br> > - int decimal_cutoff, decimal_mask = 0x000001FF;<br> > - decimal_cutoff = temp & decimal_mask;<br> > - if (decimal_cutoff > 0x147) {<br> > - temp += 673;<br> > - }*/<br> > -<br> > - return ConvertBackToInteger(A)/10000; /*Temporary - in case this was used somewhere else */<br> > -}<br> > -<br> > -static fInt Multiply (int X, int Y)<br> > -{<br> > - fInt A, B, Product;<br> > -<br> > - A.full = X << SHIFT_AMOUNT;<br> > - B.full = Y << SHIFT_AMOUNT;<br> > -<br> > - Product = fMultiply(A, B);<br> > -<br> > - return Product;<br> > -}<br> > -<br> > static fInt Divide (int X, int Y)<br> > {<br> > fInt A, B, Quotient;<br> > @@ -578,14 +529,6 @@ static int uPow(int base, int power)<br> > return (base)*uPow(base, power - 1);<br> > }<br> ><br> > -static fInt fAbs(fInt A)<br> > -{<br> > - if (A.partial.real < 0)<br> > - return (fMultiply(A, ConvertToFraction(-1)));<br> > - else<br> > - return A;<br> > -}<br> > -<br> > static int uAbs(int X)<br> > {<br> > if (X < 0)<br> > --<br> > 2.8.0.rc3<br> ><br> </div></div>> _______________________________________________<br> > dri-devel mailing list<br> > <a href="mailto:dri-devel@lists.freedesktop.org" target="_blank">dri-devel@lists.freedesktop.org</a><br> > <a href="https://lists.freedesktop.org/mailman/listinfo/dri-devel" rel="noreferrer" target="_blank">https://lists.freedesktop.org/mailman/listinfo/dri-devel</a><br> </blockquote></div><br></div> </blockquote></div></div>