<div dir="ltr"><div dir="auto">Ping!</div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Tue, Jul 21, 2020, 7:42 PM Madhur Amilkanthwar via Phabricator <<a href="mailto:reviews@reviews.llvm.org" target="_blank">reviews@reviews.llvm.org</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">madhur13490 marked an inline comment as done.<br>
madhur13490 added inline comments.<br>
<br>
<br>
================<br>
Comment at: llvm/utils/TableGen/GlobalISelEmitter.cpp:3575<br>
+ HasPredicateCode = true;<br>
+ InsnMatcher.addPredicate<GenericInstructionPredicateMatcher>(Predicate);<br>
+ }<br>
----------------<br>
dsanders wrote:<br>
> dsanders wrote:<br>
> > madhur13490 wrote:<br>
> > > madhur13490 wrote:<br>
> > > > dsanders wrote:<br>
> > > > > dsanders wrote:<br>
> > > > > > madhur13490 wrote:<br>
> > > > > > > arsenm wrote:<br>
> > > > > > > > I think this should remain as the last predicate type added to the matcher, after everything else here. The ordering does matter (see D82331)<br>
> > > > > > > Well, then we have to remove all "continue" statements. Are we fine with it? I always thought that we'll use custom predicates for things which are *not* covered in other checks. I am fine with keeping it at the end, just looking for consequences. <br>
> > > > > > I'd be inclined to factor the builtins out into a function instead so they can return and then you resume at the code to check+add for custom predicates<br>
> > > > > Also, just to confirm I agree it should be added after the builtins. Otherwise your C++ can't assume anything covered by the builtins.<br>
> > > > Is it just for "assumption" or it would affect the functionality if custom predicates are added later? <br>
> > > Sure, I am up for refactoring, but can you please explain a bit more, how would you that refactoring look? I was more inclined to rewriting the loop which iterates over PredicateCalls and add matcher. One of the many ways in which we can refactor the loop is like <br>
> > > <br>
> > > ```<br>
> > > if (isAtomic())<br>
> > > if (isLoad())<br>
> > > add all matchers<br>
> > > ...<br>
> > > ``` <br>
> > > but this may change the order in which matchers are added (which brings me back to the question - is the order important?). I can further outline this in a static function.<br>
> > > But this is a bit of design question.<br>
> > > <br>
> > > So, I'd like to see what you're imagining in a form of pseudo code :)<br>
> > Suppose the builtin checks it's a i32 non-extending load and the custom predicate wants to check the address generation. If the custom predicate is first then it needs to check the following pseudo-code:<br>
> > ``` isLoad() && isNonExtending() && isMMO32bit() && checkAddrGen(...)```<br>
> > whereas if the builtin is first then the first three components are tested by the builtin first so the custom predicate is:<br>
> > ```checkAddrGen(...)```<br>
> > Sure, I am up for refactoring, but can you please explain a bit more, how would you that refactoring look?<br>
> <br>
> What I had in mind was:<br>
> * Extract lines 3572 to 3707 of the original code into a function, passing parameters by value or by reference as appropriate<br>
> * Replace all the `continue`s with `return`<br>
> Then after those predicates are added it will resume execution from line 3709 and do the custom predicates<br>
> <br>
> > which brings me back to the question - is the order important?<br>
> <br>
> In general, the order predicates are tested does matter. For example, testing an MMO property (e.g. the MemoryVT) without knowing that an MMO is there will lead to a crash. Specific pairs might be reorderable but unless there's a strong need to change the current order and re-verify the new order works for all targets, I'd preserve it.<br>
With your suggested way, we'd be extracting few statements of loop in the function but for rest of the loop body, we'll still have to run the loop in caller i.e. current function. So, we'd be running the loop twice which seems time consuming to me. Line 3707 belongs to this loop. The loop I am referring to is ` for (const TreePredicateCall &Call : Src->getPredicateCalls()) {` at line 3604 in the original code. <br>
<br>
Are you sure about this?<br>
<br>
I was thinking of just refactoring the loop something like <br>
<br>
```<br>
for (const TreePredicateCall &Call : Src->getPredicateCalls()) { <br>
addBuiltinPredicate(); // new function<br>
if (Predicate.hasGISelPredicateCode()) {<br>
InsnMatcher.addPredicate<GenericInstructionPredicateMatcher>(Predicate);<br>
continue;<br>
}}<br>
<br>
```<br>
<br>
<br>
Repository:<br>
rG LLVM Github Monorepo<br>
<br>
CHANGES SINCE LAST ACTION<br>
<a href="https://reviews.llvm.org/D83034/new/" rel="noreferrer noreferrer" target="_blank">https://reviews.llvm.org/D83034/new/</a><br>
<br>
<a href="https://reviews.llvm.org/D83034" rel="noreferrer noreferrer" target="_blank">https://reviews.llvm.org/D83034</a><br>
<br>
<br>
<br>
</blockquote></div>