2013-04-11 02:10:10 -06:00
|
|
|
/*
|
|
|
|
* This file is part of the COMROGUE Operating System for Raspberry Pi
|
|
|
|
*
|
|
|
|
* Copyright (c) 2013, Eric J. Bowersox / Erbosoft Enterprises
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This program is free for commercial and non-commercial use as long as the following conditions are
|
|
|
|
* adhered to.
|
|
|
|
*
|
|
|
|
* Copyright in this file remains Eric J. Bowersox and/or Erbosoft, and as such any copyright notices
|
|
|
|
* in the code are not to be removed.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without modification, are permitted
|
|
|
|
* provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright notice, this list of conditions and
|
|
|
|
* the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and
|
|
|
|
* the following disclaimer in the documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
|
|
|
|
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
|
|
|
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
|
|
|
|
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* "Raspberry Pi" is a trademark of the Raspberry Pi Foundation.
|
|
|
|
*/
|
|
|
|
#include <comrogue/types.h>
|
|
|
|
#include <comrogue/intlib.h>
|
|
|
|
#include "quad.h"
|
|
|
|
|
|
|
|
/*---------------------------
|
|
|
|
* Integer library functions
|
|
|
|
*---------------------------
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Flags used internally to IntLDiv. */
|
|
|
|
#define FLIP_QUOTIENT 0x00000001
|
|
|
|
#define FLIP_REMAINDER 0x00000002
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Divides two 64-bit integers and returns a quotient and a remainder in a structure.
|
|
|
|
*
|
|
|
|
* Parameters:
|
|
|
|
* - pResult = Pointer to an LDIV structure to contain the quotient and remainder.
|
|
|
|
* - num = The numerator (dividend) for the division.
|
|
|
|
* - demom = The demoninator (divisor) for the division.
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* Standard SUCCEEDED/FAILED HRESULT.
|
|
|
|
*/
|
2013-05-02 22:31:00 -06:00
|
|
|
HRESULT IntLDiv(PLDIV pResult, INT64 num, INT64 denom)
|
2013-04-11 02:10:10 -06:00
|
|
|
{
|
|
|
|
UINT32 mode = 0;
|
|
|
|
if (denom == 0)
|
|
|
|
{
|
|
|
|
pResult->quot = pResult->rem = 0;
|
|
|
|
return E_INVALIDARG;
|
|
|
|
}
|
|
|
|
if (denom < 0)
|
|
|
|
{
|
|
|
|
mode ^= FLIP_QUOTIENT;
|
|
|
|
denom = -denom;
|
|
|
|
}
|
|
|
|
if (num < 0)
|
|
|
|
{
|
|
|
|
mode ^= (FLIP_QUOTIENT|FLIP_REMAINDER);
|
|
|
|
num = -num;
|
|
|
|
}
|
|
|
|
pResult->quot = __qdivrem(num, denom, (PUINT64)(&(pResult->rem)));
|
|
|
|
if (mode & FLIP_QUOTIENT)
|
|
|
|
pResult->quot = -(pResult->quot);
|
|
|
|
if (mode & FLIP_REMAINDER)
|
|
|
|
pResult->rem = -(pResult->rem);
|
|
|
|
return S_OK;
|
|
|
|
}
|
2013-06-09 19:50:14 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Returns the index of the first bit set in the specified mask, where the least-significant bit is considered
|
|
|
|
* bit #1.
|
|
|
|
*
|
|
|
|
* Parameters:
|
|
|
|
* - nMask = The mask to be tested.
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* - 0 = If nMask is 0.
|
|
|
|
* - Other = Index of the first set bit in nMask.
|
|
|
|
*/
|
|
|
|
INT32 IntFirstSet(INT32 nMask)
|
|
|
|
{
|
|
|
|
register INT32 nBit; /* bit index to return */
|
|
|
|
if (nMask)
|
|
|
|
{
|
|
|
|
for (nBit = 1; !(nMask & 1); nBit++)
|
|
|
|
nMask = ((UINT32)nMask) >> 1;
|
|
|
|
return nBit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return 0; /* corner case */
|
|
|
|
}
|