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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/* $OpenBSD: divsfm.c,v 1.4 2001/03/29 03:58:17 mickey Exp $ */
/*
* Copyright 1996 1995 by Open Software Foundation, Inc.
* All Rights Reserved
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appears in all copies and
* that both the copyright notice and this permission notice appear in
* supporting documentation.
*
* OSF DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL OSF BE LIABLE FOR ANY SPECIAL, INDIRECT, OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
* LOSS OF USE, DATA OR PROFITS, WHETHER IN ACTION OF CONTRACT,
* NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
/*
* pmk1.1
*/
/*
* (c) Copyright 1986 HEWLETT-PACKARD COMPANY
*
* To anyone who acknowledges that this file is provided "AS IS"
* without any express or implied warranty:
* permission to use, copy, modify, and distribute this file
* for any purpose is hereby granted without fee, provided that
* the above copyright notice and this notice appears in all
* copies, and that the name of Hewlett-Packard Company not be
* used in advertising or publicity pertaining to distribution
* of the software without specific, written prior permission.
* Hewlett-Packard Company makes no representations about the
* suitability of this software for any purpose.
*/
#include "md.h"
void
divsfm(opnd1,opnd2,result)
int opnd1, opnd2;
struct mdsfu_register *result;
{
register int sign, op1_sign;
/* check divisor for zero */
if (opnd2 == 0) {
overflow = TRUE;
return;
}
/* get sign of result */
sign = opnd1 ^ opnd2;
/* get absolute value of operands */
if (opnd1 < 0) {
opnd1 = -opnd1;
op1_sign = TRUE;
}
else op1_sign = FALSE;
if (opnd2 < 0) opnd2 = -opnd2;
/*
* check for overflow
*
* if abs(opnd1) < 0, then opnd1 = -2**31
* and abs(opnd1) >= abs(opnd2) always
*/
if (opnd1 >= opnd2 || opnd1 < 0) {
/* check for opnd2 = -2**31 */
if (opnd2 < 0 && opnd1 != opnd2) {
result_hi = 0; /* remainder = 0 */
result_lo = opnd1 << 1;
}
else {
overflow = TRUE;
return;
}
}
else {
/* do the divide */
divu(opnd1,0,opnd2,result);
/* return positive residue */
if (op1_sign && result_hi) {
result_hi = opnd2 - result_hi;
result_lo++;
}
}
/* check for overflow */
if (result_lo < 0) {
overflow = TRUE;
return;
}
overflow = FALSE;
/* return appropriately signed result */
if (sign<0) result_lo = -result_lo;
return;
}
|
