Reported by me in https://github.com/davidgiven/ack/issues/60 This doesn't change DIV. Right now a DIV b does floor division and a MOD b has the sign of b. This is the same as Lua, Python, Ruby, Tcl; but is different from other Modula-2 implementations.
		
			
				
	
	
		
			70 lines
		
	
	
	
		
			1,015 B
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			70 lines
		
	
	
	
		
			1,015 B
		
	
	
	
		
			C
		
	
	
	
	
	
| /*
 | |
|   (c) copyright 1988 by the Vrije Universiteit, Amsterdam, The Netherlands.
 | |
|   See the copyright notice in the ACK home directory, in the file "Copyright".
 | |
| */
 | |
| 
 | |
| /*
 | |
|   Module:	implementation of DIV and MOD
 | |
|   Author:	Ceriel J.H. Jacobs
 | |
|   Version:	$Id$
 | |
|   Reason:	We cannot use DVI and RMI, because DVI rounds towards 0
 | |
| 		and Modula-2 requires truncation
 | |
| */
 | |
| 
 | |
| #include <em_abs.h>
 | |
| 
 | |
| int
 | |
| dvi(j,i)
 | |
| 	int j,i;
 | |
| {
 | |
| 	if (j == 0) TRP(EIDIVZ);
 | |
| 	if ((i < 0) != (j < 0)) {
 | |
| 		if (i < 0) i = -i;
 | |
| 		else j = -j;
 | |
| 		return -((i+j-1)/j);
 | |
| 	}
 | |
| 	else return i/j;
 | |
| }
 | |
| 
 | |
| long
 | |
| dvil(j,i)
 | |
| 	long j,i;
 | |
| {
 | |
| 	if (j == 0) TRP(EIDIVZ);
 | |
| 	if ((i < 0) != (j < 0)) {
 | |
| 		if (i < 0) i = -i;
 | |
| 		else j = -j;
 | |
| 		return -((i+j-1)/j);
 | |
| 	}
 | |
| 	else return i/j;
 | |
| }
 | |
| 
 | |
| int
 | |
| rmi(j,i)
 | |
| 	int j,i;
 | |
| {
 | |
| 	int m;
 | |
| 
 | |
| 	if (j == 0) TRP(EIDIVZ);
 | |
| 	if (i == 0) return 0;
 | |
| 
 | |
| 	m = i % j;
 | |
| 	if (m != 0 && (i < 0) != (j < 0))
 | |
| 		m += j;
 | |
| 	return m;
 | |
| }
 | |
| 
 | |
| long
 | |
| rmil(j,i)
 | |
| 	long j,i;
 | |
| {
 | |
| 	long m;
 | |
| 
 | |
| 	if (j == 0) TRP(EIDIVZ);
 | |
| 	if (i == 0) return 0L;
 | |
| 
 | |
| 	m = i % j;
 | |
| 	if (m != 0 && (i < 0) != (j < 0))
 | |
| 		m += j;
 | |
| 	return m;
 | |
| }
 |