1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
/* ---------------------------------------------------------------------------
_moduint.c - 16 bit modulus routines for pic14 devices
Copyright (C) 2005, Raphael Neider <rneider AT web.de>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this library; see the file COPYING. If not, write to the
Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA.
As a special exception, if you link this library with other files,
some of which are compiled with SDCC, to produce an executable,
this library does not by itself cause the resulting executable to
be covered by the GNU General Public License. This exception does
not however invalidate any other reasons why the executable file
might be covered by the GNU General Public License.
-------------------------------------------------------------------------*/
unsigned int
_moduint (unsigned int a, unsigned int b)
{
unsigned char count = 1;
/* prevent endless loop (division by zero exception?!?) */
if (!b) return (unsigned int)-1;
/* it would suffice to make b >= a, but that test is
* more complex and will fail if a has its MSB set */
while (!(b & (1UL << (8*sizeof(unsigned int)-1)))) {
b <<= 1;
++count;
} // while
/* now subtract all the powers of two (of b) that "fit" into a */
while (count) {
if (a >= b) {
a -= b;
} // if
b >>= 1;
--count;
} // while
return a;
}
|
