ec9763539f
Note, this is going to be messy.. 2.3 was vendor-branch imported, while 2.6 was done as a delta. Sigh. I'm importing this on a vendor branch so that it will be easier to deal with next time.. (cvs-1.6 wants rcs-5.7, and rcs-5.7 suggests diffutils-2.7)
41 lines
1.2 KiB
C
41 lines
1.2 KiB
C
/* Buffer primitives for comparison operations.
|
|
Copyright (C) 1993 Free Software Foundation, Inc.
|
|
|
|
This program 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 program 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 program; if not, write to the Free Software
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
#include "system.h"
|
|
#include "cmpbuf.h"
|
|
|
|
/* Least common multiple of two buffer sizes A and B. */
|
|
|
|
size_t
|
|
buffer_lcm (a, b)
|
|
size_t a, b;
|
|
{
|
|
size_t m, n, r;
|
|
|
|
/* Yield reasonable values if buffer sizes are zero. */
|
|
if (!a)
|
|
return b ? b : 8 * 1024;
|
|
if (!b)
|
|
return a;
|
|
|
|
/* n = gcd (a, b) */
|
|
for (m = a, n = b; (r = m % n) != 0; m = n, n = r)
|
|
continue;
|
|
|
|
return a/n * b;
|
|
}
|