https://github.com/llvm/llvm-project/blob/92d822245b0f034133fb958c1a067330236f9dea/mlir/lib/Dialect/Linalg/Transforms/ElementwiseOpFusion.cpp#L1005-L1066



llvm-project/mlir/lib/Dialect/Linalg/Transforms/ElementwiseOpFusion.cpp at 92d822245b0f034133fb958c1a067330236f9dea · llvm/llvm-projectThe LLVM Project is a collection of modular and reusable compiler and toolchain technologies. - llvm/llvm-projectgithub.com


DFS/BFS 비슷한 컨셉으로 서치해서 인덱스 재배열하는 로직



https://github.com/llvm/llvm-project/pull/126338/files



[mlir][math] `powf(a, b)` drop support when a < 0 by ita9naiwa · Pull Request #126338 · llvm/llvm-projectRelated: #124402 change inefficient implementation of powf(a, b) to handle a < 0 case thus drop a < 0 case support However, some special cases are being used such as: a < 0 and b = 0...github.com


이건 내가 만든 PR에서 넣었다가 뺀 건데


a ^ b를 b번 곱셈 안하고 log(b)번 곱셈하는 알고리즘을 구현했었음


머 이외에도 많은데 회사 일 제외하고 최근 내가 한 오픈소스 중에서  기억나는건 이 두 개