coerce output of integer modulus, since x%0 is NaN, which is not an integer

1 files changed, 1 insertions, 1 deletions

diff --git a/src/parseTools.js b/src/parseTools.js
index 3949491e..687faaa8 100644
--- a/src/parseTools.js
+++ b/src/parseTools.js
@@ -2204,7 +2204,7 @@ function processMathop(item) {
     case 'sub': return handleOverflow(getFastValue(idents[0], '-', idents[1], item.type), bits);
     case 'sdiv': case 'udiv': return makeRounding(getFastValue(idents[0], '/', idents[1], item.type), bits, op[0] === 's');
     case 'mul': return getFastValue(idents[0], '*', idents[1], item.type); // overflow handling is already done in getFastValue for '*'
-    case 'urem': case 'srem': return getFastValue(idents[0], '%', idents[1], item.type);
+    case 'urem': case 'srem': return makeRounding(getFastValue(idents[0], '%', idents[1], item.type), bits, op[0] === 's');
     case 'or': {
       if (bits > 32) {
         assert(bits === 64, 'Too many bits for or: ' + bits);