[PATCH] D154695: [Coroutines] Add an O(n) algorithm for computing the cross suspend point information.

[witstorm via Phabricator via llvm-commits]

witstorm95 added a comment.

@ChuanqiXu Thanks for your comments. I will improve it.

> IIUC, for.cond.Kills[Entry] should be true since there is a path from Entry to for.cond without repeating Entry, right?

The definition about Kill is,

  //   Kills: a bit vector which contains a set of indices of blocks that can                                                                                                                                                                     
  //          reach block 'i' but there is a path crossing a suspend point                                                                                                                                                                       
  //          not repeating 'i' (path to 'i' without cycles containing 'i'). 
  }

So  for.cond.Kills[Entry]  means whether exists a path from Entry to for.cond crossing a suspend point not repeating for.cond.


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D154695/new/

https://reviews.llvm.org/D154695