SafeMathMock.sol 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  1. // SPDX-License-Identifier: MIT
  2. pragma solidity ^0.7.0;
  3. import "../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(uint256 a, uint256 b, string memory errorMessage) public pure returns (uint256) {
  37. return SafeMath.sub(a, b, errorMessage);
  38. }
  39. function divWithMessage(uint256 a, uint256 b, string memory errorMessage) public pure returns (uint256) {
  40. return SafeMath.div(a, b, errorMessage);
  41. }
  42. function modWithMessage(uint256 a, uint256 b, string memory errorMessage) public pure returns (uint256) {
  43. return SafeMath.mod(a, b, errorMessage);
  44. }
  45. function addMemoryCheck() public pure returns (uint256 mem) {
  46. uint256 length = 32;
  47. // solhint-disable-next-line no-inline-assembly
  48. assembly { mem := mload(0x40) }
  49. for (uint256 i = 0; i < length; ++i) { SafeMath.add(1, 1); }
  50. // solhint-disable-next-line no-inline-assembly
  51. assembly { mem := sub(mload(0x40), mem) }
  52. }
  53. function subMemoryCheck() public pure returns (uint256 mem) {
  54. uint256 length = 32;
  55. // solhint-disable-next-line no-inline-assembly
  56. assembly { mem := mload(0x40) }
  57. for (uint256 i = 0; i < length; ++i) { SafeMath.sub(1, 1); }
  58. // solhint-disable-next-line no-inline-assembly
  59. assembly { mem := sub(mload(0x40), mem) }
  60. }
  61. function mulMemoryCheck() public pure returns (uint256 mem) {
  62. uint256 length = 32;
  63. // solhint-disable-next-line no-inline-assembly
  64. assembly { mem := mload(0x40) }
  65. for (uint256 i = 0; i < length; ++i) { SafeMath.mul(1, 1); }
  66. // solhint-disable-next-line no-inline-assembly
  67. assembly { mem := sub(mload(0x40), mem) }
  68. }
  69. function divMemoryCheck() public pure returns (uint256 mem) {
  70. uint256 length = 32;
  71. // solhint-disable-next-line no-inline-assembly
  72. assembly { mem := mload(0x40) }
  73. for (uint256 i = 0; i < length; ++i) { SafeMath.div(1, 1); }
  74. // solhint-disable-next-line no-inline-assembly
  75. assembly { mem := sub(mload(0x40), mem) }
  76. }
  77. function modMemoryCheck() public pure returns (uint256 mem) {
  78. uint256 length = 32;
  79. // solhint-disable-next-line no-inline-assembly
  80. assembly { mem := mload(0x40) }
  81. for (uint256 i = 0; i < length; ++i) { SafeMath.mod(1, 1); }
  82. // solhint-disable-next-line no-inline-assembly
  83. assembly { mem := sub(mload(0x40), mem) }
  84. }
  85. }