목록전체 글 (142)

Why should I know this?

[TODO] ConstantRange

1. 정의 2. 주요 기능 3. 활용 예제 1. ConstantRange 는 ConstantRange.h 에 선언되어 있다. /// This class represents a range of values. 생성자 셋 ConstantRange::ConstantRange(uint32_t BitWidth, bool Full) : Lower(Full ? APInt::getMaxValue(BitWidth) : APInt::getMinValue(BitWidth)), Upper(Lower) {} ConstantRange::ConstantRange(APInt V) : Lower(std::move(V)), Upper(Lower + 1) {} ConstantRange::ConstantRange(APInt L, APInt ..
LLVM-STUDY/TODO 2023. 12. 12. 04:33
[TODO] DomConditionCache

1. 기능 설명 2. 내부 함수 설명 3. 활용 설명 https://github.com/ParkHanbum/llvm-project/commit/d77067d08a3f56dc2d0e6c95bd2852c943df743a [ValueTracking] Add dominating condition support in computeKnownBits(… · ParkHanbum/llvm-project@d77067d …) (#73662) This adds support for using dominating conditions in computeKnownBits() when called from InstCombine. The implementation uses a DomConditionCache, which stores ..
LLVM-STUDY 2023. 12. 11. 18:55
SubclassOptionalData

LLVM 에는 최적화를 위한 부가 데이터가 있다. value.h protected: /// Hold subclass data that can be dropped. /// /// This member is similar to SubclassData, however it is for holding /// information which may be used to aid optimization, but which may be /// cleared to zero without affecting conservative interpretation. unsigned char SubclassOptionalData : 7; SubClassOptionalData or disjoint disjoint는 or 최적화를 위한 ..
LLVM-STUDY 2023. 12. 11. 04:20
computeKnownBits & KnownBits 관련 예제

computeKnownBits https://llvm.org/doxygen/ValueTracking_8cpp.html#a903bd19e9d31beff55b22fe86111639e Determine which bits of V are known to be either zero or one and return them. void computeKnownBits (const Value *V, KnownBits &Known, const DataLayout &DL, unsigned Depth=0, AssumptionCache *AC=nullptr, const Instruction *CxtI=nullptr, const DominatorTree *DT=nullptr, bool UseInstrInfo=true) Dete..
LLVM-STUDY 2023. 12. 5. 00:25
[TODO] GVN

* 다른 이슈 스터디 차원에서 먼저 일부 GVN 로직을 다룹니다.;*** IR Dump After MergedLoadStoreMotionPass on test1 ***; Function Attrs: mustprogress nofree norecurse nosync nounwind readnone uwtable willreturndefine dso_local zeroext i1 @test1(i1 noundef zeroext %a, i1 noundef zeroext %b) local_unnamed_addr #0 {entry: %or5 = or i1 %a, %b br i1 %or5, label %cond.true, label %cond.falsecond.true: ..
LLVM-STUDY/PASS 2023. 11. 24. 23:51
Simplification Comparison for (a | b) ? (a ^ b) : (a & b) etc. (Clang13 vs Clang trunk

이번에 살펴볼 이슈는 이겁니다. https://github.com/llvm/llvm-project/issues/71792 Simplification Comparison for `(a | b) ? (a ^ b) : (a & b)` etc. (Clang13 vs Clang trunk) · Issue #71792 · llvm/llvm-project Consider the following six functions. https://godbolt.org/z/cTsd43jhh bool test1(bool a, bool b) { return (a | b) ? (a ^ b) : (a & b); } bool test2(bool a, bool b) { return (a | b) ? (a & b) : (a ^... gith..
LLVM-STUDY/PATCH 2023. 11. 12. 06:23
Prev 1 ··· 3 4 5 6 7 8 9 ··· 24 Next