|
| 1 | +#ifndef TMVA_SOFIE_ROPERATOR_NONZERO |
| 2 | +#define TMVA_SOFIE_ROPERATOR_NONZERO |
| 3 | + |
| 4 | +#include "TMVA/SOFIE_common.hxx" |
| 5 | +#include "TMVA/ROperator.hxx" |
| 6 | +#include "TMVA/RModel.hxx" |
| 7 | + |
| 8 | +#include <sstream> |
| 9 | + |
| 10 | +namespace TMVA{ |
| 11 | +namespace Experimental{ |
| 12 | +namespace SOFIE{ |
| 13 | + |
| 14 | +template<class T> |
| 15 | +class ROperator_NonZero final : public ROperator |
| 16 | +{ |
| 17 | + |
| 18 | +private: |
| 19 | + |
| 20 | + std::string fNX; |
| 21 | + std::string fNY; |
| 22 | + std::vector<Dim> fShapeX; |
| 23 | + std::vector<Dim> fShapeY; |
| 24 | + |
| 25 | +public: |
| 26 | + ROperator_NonZero(){} |
| 27 | + ROperator_NonZero(std::string nameX, std::string nameY): |
| 28 | + fNX(UTILITY::Clean_name(nameX)), fNY(UTILITY::Clean_name(nameY)){ |
| 29 | + fInputTensorNames = { fNX }; |
| 30 | + fOutputTensorNames = { fNY }; |
| 31 | + } |
| 32 | + |
| 33 | + |
| 34 | + |
| 35 | + void Initialize(RModel& model) override { |
| 36 | + if (model.CheckIfTensorAlreadyExist(fNX) == false){ //input must be a graph input, or already initialized intermediate tensor |
| 37 | + throw std::runtime_error("TMVA SOFIE NonZero Op Input Tensor " + fNX + " is not found in model"); |
| 38 | + } |
| 39 | + |
| 40 | + |
| 41 | + // case input is constant |
| 42 | + if (model.IsConstantTensor(fNX)) { |
| 43 | + // compute output directly |
| 44 | + T * data = static_cast<T*>(model.GetInitializedTensorData(fNX).get()); |
| 45 | + // shape is fully known |
| 46 | + auto shapeX = model.GetTensorShape(fNX); |
| 47 | + std::vector<size_t> shapeY(2); |
| 48 | + shapeY[0] = shapeX.size(); |
| 49 | + auto length = ConvertShapeToLength(shapeX); |
| 50 | + auto strides = UTILITY::ComputeStrideFromShape(shapeX); |
| 51 | + std::vector<std::vector<int64_t>> nonzero_indices; |
| 52 | + for (size_t i = 0; i < length; i++) { |
| 53 | + if (data[i] != 0) { |
| 54 | + // get indices |
| 55 | + size_t flat_index = i; |
| 56 | + std::vector<int64_t> indices(shapeX.size()); |
| 57 | + for (size_t j = 0; j < shapeX.size(); ++j) { |
| 58 | + indices[j] = flat_index / strides[j]; |
| 59 | + flat_index %= strides[j]; |
| 60 | + } |
| 61 | + nonzero_indices.emplace_back(indices); |
| 62 | + } |
| 63 | + } |
| 64 | + shapeY[1] = nonzero_indices.size(); |
| 65 | + std::vector<int64_t> dataY(shapeY[0]* shapeY[1]); |
| 66 | + size_t k = 0; |
| 67 | + for (size_t i = 0; i < shapeY[0]; i++) { |
| 68 | + for (size_t j = 0; j < shapeY[1]; j++) { |
| 69 | + dataY[k] = nonzero_indices[j][i]; |
| 70 | + k++; |
| 71 | + } |
| 72 | + } |
| 73 | + if (dataY.empty()) { |
| 74 | + // no zero elements found |
| 75 | + dataY.resize(1); |
| 76 | + shapeY.clear(); // use an empty shape |
| 77 | + } |
| 78 | + |
| 79 | + model.AddConstantTensor(fNY, shapeY, dataY); |
| 80 | + if (model.Verbose()) { |
| 81 | + std::cout << "NonZero : " << fNX << " -> " << fNY << " " << ConvertShapeToString(shapeY) |
| 82 | + << " : " << ConvertValuesToString(dataY) << std::endl; |
| 83 | + } |
| 84 | + fIsOutputConstant = true; |
| 85 | + |
| 86 | + } else { |
| 87 | + |
| 88 | + fShapeX = model.GetDimTensorShape(fNX); |
| 89 | + |
| 90 | + // output shape(-1) depends on number of elements of non zero values |
| 91 | + // first dim is rank of input |
| 92 | + fShapeY.resize(2); |
| 93 | + fShapeY[0] = fShapeX.size(); |
| 94 | + |
| 95 | + // identify as -1 since we will declare maximum as size of input |
| 96 | + fShapeY[1] = Dim{std::string("v_NonZero_") + fNX, static_cast<size_t>(-1)}; |
| 97 | + |
| 98 | + model.AddIntermediateTensor(fNY, ETensorType::INT64, fShapeY); |
| 99 | + if (model.Verbose()) { |
| 100 | + std::cout << "NonZero : " << fNX << " -> " << fNY << " " << ConvertShapeToString(fShapeY) << std::endl; |
| 101 | + } |
| 102 | + } |
| 103 | + } |
| 104 | + std::string GenerateSessionMembersCode(std::string /*opName*/) override { |
| 105 | + if (fIsOutputConstant) return ""; |
| 106 | + // define output value used as max non zero with max size = input shape * N |
| 107 | + auto inputLength = ConvertDimShapeToLength(fShapeX); |
| 108 | + std::stringstream out; |
| 109 | + out << SP << "size_t v_NonZero_" << fNX << " = " << inputLength << ";\n"; |
| 110 | + return out.str(); |
| 111 | + } |
| 112 | + |
| 113 | + |
| 114 | + std::string Generate(std::string opName) override { |
| 115 | + if (fIsOutputConstant) { |
| 116 | + return ""; |
| 117 | + } |
| 118 | + opName = "op_" + opName; |
| 119 | + if (fShapeX.empty()) { |
| 120 | + throw std::runtime_error("TMVA SOFIE Operator NonZero called to Generate without being initialized first"); |
| 121 | + } |
| 122 | + std::stringstream out; |
| 123 | + auto inputLength = ConvertDimShapeToLength(fShapeX); |
| 124 | + auto maxStrideY = inputLength; |
| 125 | + size_t dims = fShapeX.size(); |
| 126 | + out << "\n//------ NonZero\n"; |
| 127 | + |
| 128 | + std::string vnonzero = "v_NonZero_" + fNX; |
| 129 | + |
| 130 | + // loop on input indices |
| 131 | + out << "size_t offset_" << opName << " = 0;\n"; |
| 132 | + out << vnonzero << " = 0;\n"; |
| 133 | + for (size_t j = 0; j < dims; j++) { |
| 134 | + std::string index = "i_" + std::to_string(j); |
| 135 | + for (size_t k = 0; k <= j; k++) out << SP; |
| 136 | + out << "for (size_t " << index << " = 0; " << index << " < " << fShapeX[j] << "; " << index << "++) {\n"; |
| 137 | + } |
| 138 | + for (size_t k = 0; k <= dims; k++) out << SP; |
| 139 | + out << "if (tensor_" << fNX << "[offset_" << opName << "]) {\n"; |
| 140 | + for (size_t k = 0; k <= dims+1; k++) out << SP; |
| 141 | + out << vnonzero << "++;\n"; |
| 142 | + for (size_t j = 0; j < dims; j++) { |
| 143 | + for (size_t k = 0; k <= dims+1; k++) out << SP; |
| 144 | + out << "tensor_" << fNY << "[" << maxStrideY << " * " << j << " + " << vnonzero << "] = i_" << j << ";\n"; |
| 145 | + } |
| 146 | + for (size_t k = 0; k <= dims; k++) out << SP; |
| 147 | + out << "}\n"; |
| 148 | + //end loops |
| 149 | + for (size_t j = dims; j > 0; j--) { |
| 150 | + for (size_t k = 0; k <j; k++) out << SP; |
| 151 | + out << "}\n"; |
| 152 | + } |
| 153 | + // now we need to rearrange the vector if nonzero is less than length of input |
| 154 | + out << SP << "if (" << vnonzero << " < " << inputLength << "){\n"; |
| 155 | + for (size_t j = 1; j < dims; j++) { |
| 156 | + out << SP << SP << "std::copy(tensor_" << fNY; |
| 157 | + if (j>0) out << " + " << maxStrideY; |
| 158 | + if (j>1) out << " * " << j; |
| 159 | + out << ", tensor_" << fNY; |
| 160 | + if (j>0) out << " + " << maxStrideY; |
| 161 | + if (j>1) out << " * " << j; |
| 162 | + out << " + " << vnonzero << ", tensor_" << fNY; |
| 163 | + if (j>0) out << " + " << vnonzero; |
| 164 | + if (j>1) out << "* " << j; |
| 165 | + out << ");\n"; |
| 166 | + } |
| 167 | + out << SP << "}\n"; |
| 168 | + |
| 169 | + return out.str(); |
| 170 | + } |
| 171 | + |
| 172 | +}; |
| 173 | + |
| 174 | +}//SOFIE |
| 175 | +}//Experimental |
| 176 | +}//TMVA |
| 177 | + |
| 178 | + |
| 179 | +#endif //TMVA_SOFIE_ROPERATOR_NonZero |
0 commit comments