chore: import upstream snapshot with attribution

2026-07-13 12:47:05 +08:00
commit 4f3b7da785
7394 changed files with 2005594 additions and 0 deletions
@@ -0,0 +1,90 @@
+/*
+ *  ******************************************************************************
+ *  *
+ *  *
+ *  * This program and the accompanying materials are made available under the
+ *  * terms of the Apache License, Version 2.0 which is available at
+ *  * https://www.apache.org/licenses/LICENSE-2.0.
+ *  *
+ *  * See the NOTICE file distributed with this work for additional
+ *  * information regarding copyright ownership.
+ *  * Unless required by applicable law or agreed to in writing, software
+ *  * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+ *  * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+ *  * License for the specific language governing permissions and limitations
+ *  * under the License.
+ *  *
+ *  * SPDX-License-Identifier: Apache-2.0
+ *  *****************************************************************************
+ */
+
+//
+// Created by GS <sgazeos@gmail.com> at 01/14/2020
+//
+
+#include <system/op_boilerplate.h>
+#if NOT_EXCLUDED(OP_triangual_solve)
+
+#include <ops/declarable/CustomOperations.h>
+#include <ops/declarable/helpers/triangular_solve.h>
+namespace sd {
+namespace ops {
+CUSTOM_OP_IMPL(triangular_solve, 2, 1, false, 0, 0) {
+  auto a = INPUT_VARIABLE(0);
+  auto b = INPUT_VARIABLE(1);
+  auto z = OUTPUT_VARIABLE(0);
+  bool isLower = true;
+  bool useAdjoint = false;
+
+  if (block.numB() > 0) {
+    if (block.numB() > 1) {
+      isLower = B_ARG(0);
+      useAdjoint = B_ARG(1);
+    } else {
+      isLower = B_ARG(0);
+    }
+  }
+
+  REQUIRE_TRUE(a->rankOf() >= 2, 0,
+               "triangular_solve: The rank of input left tensor should not be less than 2, but %i is given",
+               a->rankOf());
+  REQUIRE_TRUE(b->rankOf() >= 2, 0,
+               "triangular_solve: The rank of input right tensor should not be less than 2, but %i is given",
+               b->rankOf());
+
+  REQUIRE_TRUE(a->sizeAt(-1) == a->sizeAt(-2), 0,
+               "triangular_solve: The last two dimensions should be equal, but %i and %i are given", a->sizeAt(-1),
+               a->sizeAt(-2));
+  REQUIRE_TRUE(a->sizeAt(-1) == b->sizeAt(-2), 0,
+               "triangular_solve: The last dimmension of left part should be equal to prelast of right part, but %i "
+               "and %i are given",
+               a->sizeAt(-1), b->sizeAt(-2));
+  auto input = a;
+  if (useAdjoint) {
+    auto adjointA = a->ulike();
+    helpers::adjointMatrix(block.launchContext(), a, isLower, adjointA);
+    input = new NDArray(adjointA);
+    isLower = !isLower;
+  };
+
+  auto res = helpers::triangularSolveFunctor(block.launchContext(), input, b, isLower, false, z);
+  if (input != a) delete input;
+
+  return Status::OK;
+}
+
+DECLARE_SHAPE_FN(triangular_solve) {
+  auto in0 = inputShape->at(1);
+  auto in1 = inputShape->at(1);
+  auto luShape = ShapeBuilders::copyShapeInfoAndType(in1, in0, true, block.workspace());
+
+  return SHAPELIST(CONSTANT(luShape));
+}
+
+DECLARE_TYPES(triangular_solve) {
+  getOpDescriptor()->setAllowedInputTypes({ALL_FLOATS})->setAllowedOutputTypes({ALL_FLOATS})->setSameMode(false);
+}
+}  // namespace ops
+}  // namespace sd
+
+#endif