@@ -191,7 +191,7 @@ class ParseAssumeAndOvercompute : public IRMutatorWithAnalyzer {
191191 }
192192
193193 PrimExpr VisitExpr_ (const BufferLoadNode* op) override {
194- if (map_buffer_assumption.find (op->buffer ) != map_buffer_assumption.end ()){
194+ if (map_buffer_assumption.find (op->buffer ) != map_buffer_assumption.end ()) {
195195 PrimExpr buf_value;
196196 /* If the cuurent context where the buffer load is present is same as
197197 the context of the buffer assumption then, return the buffer value present in the assumption.
@@ -354,14 +354,16 @@ Pass UseAssumeToReduceBranches() {
354354 auto * n = f.CopyOnWrite ();
355355 arith::Analyzer analyzer;
356356
357- // The pass runs & eliminates pad branch with overcompute only if, the primfunc has op_pattern defined and is an elementwise op.
358- // AnnotateTIROpPattern pass will help to set the op_pattern in the op attributes of the primfunc.
357+ // The pass runs & eliminates pad branch with overcompute only if,
358+ // the primfunc has op_pattern defined and is an elementwise op.
359+ // AnnotateTIROpPattern pass will set op_pattern in op attributes of the primfunc.
359360 if (n->attrs .GetAttr <Integer>(" op_pattern" ).defined ()) {
360361 Optional<Integer> opt_pattern = f->GetAttr <Integer>(" op_pattern" );
361362 if (opt_pattern.defined ()) {
362- relay::OpPatternKind pattern = static_cast <relay::OpPatternKind>(Downcast<IntImm>(opt_pattern)->value );
363+ relay::OpPatternKind pattern;
364+ pattern = static_cast <relay::OpPatternKind>(Downcast<IntImm>(opt_pattern)->value );
363365
364- if (pattern == relay::OpPatternKind::kElemWise or
366+ if (pattern == relay::OpPatternKind::kElemWise ||
365367 pattern == relay::OpPatternKind::kBroadcast ) {
366368 // If the primfunc contains assume statement then, run the mutator pass.
367369 AssumeChecker assume_checker;
0 commit comments