test2DMatrixMultiplication.js 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. //-------------------------------------------------------------------------------------------------------
  2. // Copyright (C) Microsoft. All rights reserved.
  3. // Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
  4. //-------------------------------------------------------------------------------------------------------
  5. function asmModule(stdlib, imports, buffer) {
  6. "use asm";
  7. var log = stdlib.Math.log;
  8. var toF = stdlib.Math.fround;
  9. var imul = stdlib.Math.imul;
  10. var i4 = stdlib.SIMD.Int32x4;
  11. var i4store = i4.store;
  12. var i4load = i4.load
  13. var i4swizzle = i4.swizzle;
  14. var i4check = i4.check;
  15. var i4add = i4.add;
  16. var i4sub = i4.sub;
  17. var i4lessThan = i4.lessThan;
  18. var i4splat = i4.splat;
  19. var f4 = stdlib.SIMD.Float32x4;
  20. var f4equal = f4.equal;
  21. var f4lessThan = f4.lessThan;
  22. var f4splat = f4.splat;
  23. var f4store = f4.store;
  24. var f4load = f4.load;
  25. var f4check = f4.check;
  26. var f4abs = f4.abs;
  27. var f4add = f4.add;
  28. var f4sub = f4.sub;
  29. var Float32Heap = new stdlib.Float32Array(buffer);
  30. var Int32Heap = new stdlib.Int32Array(buffer);
  31. var BLOCK_SIZE = 4;
  32. function matrixMultiplication(aIndex, bIndex, cIndex) {
  33. aIndex = aIndex|0;
  34. bIndex = bIndex|0;
  35. cIndex = cIndex|0;
  36. var i = 0, j = 0, dim1 = 0, dim2 = 0, intersectionNum = 0, matrixSize = 0;
  37. var newPiece = i4(0, 0, 0, 0), cPiece = i4(0, 0, 0, 0);
  38. //array dimensions don't match
  39. if((Int32Heap[aIndex + 1 << 2 >> 2]|0) != (Int32Heap[bIndex << 2 >> 2]|0)) {
  40. return -1;
  41. }
  42. dim1 = Int32Heap[aIndex << 2 >> 2]|0;
  43. dim2 = Int32Heap[bIndex + 1 << 2 >> 2]|0;
  44. intersectionNum = Int32Heap[bIndex << 2 >> 2]|0;
  45. matrixSize = imul(dim1, dim2);
  46. Int32Heap[cIndex << 2 >> 2] = dim1;
  47. Int32Heap[cIndex + 1 << 2 >> 2] = dim2;
  48. while((i|0) < (matrixSize|0)) {
  49. cPiece = i4(0, 0, 0, 0);
  50. j = 0;
  51. while( (j|0) < (intersectionNum|0)) {
  52. newPiece = i4((getIntersectionPiece(aIndex, bIndex, dim2, i, 0, j)|0),
  53. (getIntersectionPiece(aIndex, bIndex, dim2, i, 1, j)|0),
  54. (getIntersectionPiece(aIndex, bIndex, dim2, i, 2, j)|0),
  55. (getIntersectionPiece(aIndex, bIndex, dim2, i, 3, j)|0));
  56. cPiece = i4add(cPiece, newPiece);
  57. j = (j + 1)|0;
  58. }
  59. i4store(Int32Heap, cIndex + 2 + i << 2 >> 2, cPiece);
  60. i = (i + BLOCK_SIZE)|0;
  61. }
  62. return 0;
  63. }
  64. function getIntersectionPiece(aIndex, bIndex, dim2, resultBlock, resultIndex, intersectionNum) {
  65. aIndex = aIndex|0;
  66. bIndex = bIndex|0;
  67. dim2 = dim2|0;
  68. resultBlock = resultBlock|0;
  69. resultIndex = resultIndex|0;
  70. intersectionNum = intersectionNum|0;
  71. var aElem = 0, bElem = 0, cElem = 0;
  72. aElem = (getElement(aIndex, ((resultBlock|0) / (dim2|0))|0, intersectionNum))|0;
  73. bElem = (getElement(bIndex, intersectionNum, (resultBlock + resultIndex)|0))|0;
  74. return (aElem * bElem)|0;
  75. }
  76. function getElement(start, row, column) {
  77. start = start|0;
  78. row = row|0;
  79. column = column|0;
  80. var dim1 = 0, dim2 = 0;
  81. dim2 = Int32Heap[start << 2 >> 2]|0;
  82. dim1 = Int32Heap[start + 1 << 2 >> 2]|0;
  83. return (Int32Heap[(start + 2 + imul(row, dim1) + column) << 2 >> 2])|0;
  84. }
  85. function new2DMatrix(startIndex, dim1, dim2) {
  86. startIndex = startIndex|0;
  87. dim1 = dim1|0;
  88. dim2 = dim2|0;
  89. var i = 0, matrixSize = 0;
  90. matrixSize = imul(dim1, dim2);
  91. Int32Heap[startIndex << 2 >> 2] = dim1;
  92. Int32Heap[startIndex + 1 << 2 >> 2] = dim2;
  93. for(i = 0; (i|0) < ((matrixSize - BLOCK_SIZE)|0); i = (i + BLOCK_SIZE)|0) {
  94. i4store(Int32Heap, startIndex + 2 + i << 2 >> 2, i4((i+1), (i+2), (i+3), (i+4)));
  95. }
  96. for(; (i|0) < (matrixSize|0); i = (i + 1)|0) {
  97. Int32Heap[(startIndex + 2 + i) << 2 >> 2] = (i+1)|0;
  98. }
  99. return (startIndex + 2 + i)|0;
  100. }
  101. return {new2DMatrix: new2DMatrix,
  102. matrixMultiplication:matrixMultiplication};
  103. }
  104. function print2DMatrix(buffer, start) {
  105. var IntHeap32 = new Int32Array(buffer);
  106. var FloatHeap32 = new Float32Array(buffer);
  107. var f4;
  108. var dim1 = IntHeap32[start];
  109. var dim2 = IntHeap32[start+1];
  110. print(dim1 + " by " + dim2 + " matrix");
  111. for (var i = 0; i < Math.imul(dim1, dim2); i += 4) {
  112. i4 = SIMD.Int32x4.load(IntHeap32, i + start + 2);
  113. print(i4.toString());
  114. }
  115. }
  116. var buffer = new ArrayBuffer(16 * 1024 * 1024);
  117. var m = asmModule(this, null, buffer);
  118. print("2D Matrix Multiplication");
  119. m.new2DMatrix(0, 4, 8);
  120. m.new2DMatrix(200, 8, 12);
  121. m.new2DMatrix(400, 4, 4);
  122. m.new2DMatrix(600, 4, 4);
  123. m.matrixMultiplication(0, 200, 800);
  124. m.matrixMultiplication(400, 600, 1000);
  125. print2DMatrix(buffer, 800);
  126. print2DMatrix(buffer, 1000);