SafeMathMock.sol 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. // SPDX-License-Identifier: MIT
  2. pragma solidity ^0.8.0;
  3. import "../utils/math/SafeMath.sol";
  4. contract SafeMathMock {
  5. function tryAdd(uint256 a, uint256 b) public pure returns (bool flag, uint256 value) {
  6. return SafeMath.tryAdd(a, b);
  7. }
  8. function trySub(uint256 a, uint256 b) public pure returns (bool flag, uint256 value) {
  9. return SafeMath.trySub(a, b);
  10. }
  11. function tryMul(uint256 a, uint256 b) public pure returns (bool flag, uint256 value) {
  12. return SafeMath.tryMul(a, b);
  13. }
  14. function tryDiv(uint256 a, uint256 b) public pure returns (bool flag, uint256 value) {
  15. return SafeMath.tryDiv(a, b);
  16. }
  17. function tryMod(uint256 a, uint256 b) public pure returns (bool flag, uint256 value) {
  18. return SafeMath.tryMod(a, b);
  19. }
  20. // using the do* naming convention to avoid warnings due to clashing opcode names
  21. function doAdd(uint256 a, uint256 b) public pure returns (uint256) {
  22. return SafeMath.add(a, b);
  23. }
  24. function doSub(uint256 a, uint256 b) public pure returns (uint256) {
  25. return SafeMath.sub(a, b);
  26. }
  27. function doMul(uint256 a, uint256 b) public pure returns (uint256) {
  28. return SafeMath.mul(a, b);
  29. }
  30. function doDiv(uint256 a, uint256 b) public pure returns (uint256) {
  31. return SafeMath.div(a, b);
  32. }
  33. function doMod(uint256 a, uint256 b) public pure returns (uint256) {
  34. return SafeMath.mod(a, b);
  35. }
  36. function subWithMessage(
  37. uint256 a,
  38. uint256 b,
  39. string memory errorMessage
  40. ) public pure returns (uint256) {
  41. return SafeMath.sub(a, b, errorMessage);
  42. }
  43. function divWithMessage(
  44. uint256 a,
  45. uint256 b,
  46. string memory errorMessage
  47. ) public pure returns (uint256) {
  48. return SafeMath.div(a, b, errorMessage);
  49. }
  50. function modWithMessage(
  51. uint256 a,
  52. uint256 b,
  53. string memory errorMessage
  54. ) public pure returns (uint256) {
  55. return SafeMath.mod(a, b, errorMessage);
  56. }
  57. function addMemoryCheck() public pure returns (uint256 mem) {
  58. uint256 length = 32;
  59. assembly {
  60. mem := mload(0x40)
  61. }
  62. for (uint256 i = 0; i < length; ++i) {
  63. SafeMath.add(1, 1);
  64. }
  65. assembly {
  66. mem := sub(mload(0x40), mem)
  67. }
  68. }
  69. function subMemoryCheck() public pure returns (uint256 mem) {
  70. uint256 length = 32;
  71. assembly {
  72. mem := mload(0x40)
  73. }
  74. for (uint256 i = 0; i < length; ++i) {
  75. SafeMath.sub(1, 1);
  76. }
  77. assembly {
  78. mem := sub(mload(0x40), mem)
  79. }
  80. }
  81. function mulMemoryCheck() public pure returns (uint256 mem) {
  82. uint256 length = 32;
  83. assembly {
  84. mem := mload(0x40)
  85. }
  86. for (uint256 i = 0; i < length; ++i) {
  87. SafeMath.mul(1, 1);
  88. }
  89. assembly {
  90. mem := sub(mload(0x40), mem)
  91. }
  92. }
  93. function divMemoryCheck() public pure returns (uint256 mem) {
  94. uint256 length = 32;
  95. assembly {
  96. mem := mload(0x40)
  97. }
  98. for (uint256 i = 0; i < length; ++i) {
  99. SafeMath.div(1, 1);
  100. }
  101. assembly {
  102. mem := sub(mload(0x40), mem)
  103. }
  104. }
  105. function modMemoryCheck() public pure returns (uint256 mem) {
  106. uint256 length = 32;
  107. assembly {
  108. mem := mload(0x40)
  109. }
  110. for (uint256 i = 0; i < length; ++i) {
  111. SafeMath.mod(1, 1);
  112. }
  113. assembly {
  114. mem := sub(mload(0x40), mem)
  115. }
  116. }
  117. }