QingShan Zhang 48664955df [Scheduling] Implement a new way to cluster loads/stores ... Before calling target hook to determine if two loads/stores are clusterable, we put them into different groups to avoid fake cluster due to dependency. For now, we are putting the loads/stores into the same group if they have the same predecessor. We assume that, if two loads/stores have the same predecessor, it is likely that, they didn't have dependency for each other. However, one SUnit might have several predecessors and for now, we just pick up the first predecessor that has non-data/non-artificial dependency, which is too arbitrary. And we are struggling to fix it. So, I am proposing some better implementation. 1. Collect all the loads/stores that has memory info first to reduce the complexity. 2. Sort these loads/stores so that we can stop the seeking as early as possible. 3. For each load/store, seeking for the first non-dependency instruction with the sorted order, and check if they can cluster or not. Reviewed By: Jay Foad Differential Revision: https://reviews.llvm.org/D85517		2020-08-26 12:33:59 +00:00
..
llvm	[Scheduling] Implement a new way to cluster loads/stores	2020-08-26 12:33:59 +00:00
llvm-c	[DebugInfo][flang]Added support for representing Fortran assumed length strings	2020-08-22 10:13:40 +05:30