[SandboxVec][DAG] Fix MemDGNode chain maintenance when move destination is non-mem (#124227)

This patch fixes a bug in the maintenance of the MemDGNode chain of the
DAG. Whenever we move a memory i

[SandboxVec][DAG] Fix MemDGNode chain maintenance when move destination is non-mem (#124227)

This patch fixes a bug in the maintenance of the MemDGNode chain of the
DAG. Whenever we move a memory instruction, the DAG gets notified about
the move and maintains the chain of memory nodes. The bug was that if
the destination of the move was not a memory instruction, then the
memory node's next node would end up pointing to itself.

show more ...

[SandboxVec][DAG] Register move instr callback (#120146)

This patch implements the move instruction notifier for the DAG.
Whenever an instruction moves the notifier will maintain the DAG.

[SandboxVec][DAG] Update MemDGNode chain upon instr deletion (#118921)

[SandboxVec][DAG] Update MemDGNode chain upon instr creation (#116896)

The DAG maintains a chain of MemDGNodes that links together all the
nodes that may touch memroy.
Whenever a new instruction g

[SandboxVec][DAG] Update MemDGNode chain upon instr creation (#116896)

The DAG maintains a chain of MemDGNodes that links together all the
nodes that may touch memroy.
Whenever a new instruction gets created we need to make sure that this
chain gets updated. If the new instruction touches memory then its
corresponding MemDGNode should be inserted into the chain.

show more ...

[SandboxVec][DAG] Register callback for erase instr (#116742)

This patch adds the callback registration logic in the DAG's constructor
and the corresponding deregistration logic in the destructor.

[SandboxVec][DAG] Register callback for erase instr (#116742)

This patch adds the callback registration logic in the DAG's constructor
and the corresponding deregistration logic in the destructor. It also
implements the code that makes sure that SchedBundle and DGNodes can be
safely destroyed in any order.

show more ...

[SandboxVec][DAG] Cleanup: Move callback registration from Scheduler to DAG (#116455)

This is a refactoring patch that moves the callback registration for
getting notified about new instructions fr

[SandboxVec][DAG] Cleanup: Move callback registration from Scheduler to DAG (#116455)

This is a refactoring patch that moves the callback registration for
getting notified about new instructions from the scheduler to the DAG.
This makes sense from a design and testing point of view:
- the DAG should not rely on the scheduler for getting notified
- the notifiers don't need to be public
- it's easier to test the notifiers directly from within the DAG unit
tests

show more ...

[SandboxVec][Scheduler] Boilerplate and initial implementation. (#112449)

This patch implements a ready-list-based scheduler that operates on
DependencyGraph.
It is used by the sandbox vectorizer

[SandboxVec][Scheduler] Boilerplate and initial implementation. (#112449)

This patch implements a ready-list-based scheduler that operates on
DependencyGraph.
It is used by the sandbox vectorizer to test the legality of vectorizing
a group of instrs.

SchedBundle is a helper container, containing all DGNodes that
correspond to the instructions that we are attempting to schedule with
trySchedule(Instrs).

show more ...

[SandboxVec][DAG] Implement UnscheduledSuccs (#112255)

This patch implements the UnscheduledSuccs counter in DGNode. It counts
the number of unscheduled successors and is used by the scheduler to

[SandboxVec][DAG] Implement UnscheduledSuccs (#112255)

This patch implements the UnscheduledSuccs counter in DGNode. It counts
the number of unscheduled successors and is used by the scheduler to
determine when a node is ready.

show more ...

[SandboxVec][DAG] Extend DAG (#111908)

This patch implements growing the DAG towards the top or bottom. This
does the necessary dependency checks and adds new mem dependencies.

[SandboxVec][DAG] Refactoring: Outline code that looks for mem nodes (#111750)

[SandboxVec][DAG] Refactoring: Move MemPreds from DGNode to MemDGNode (#111897)

[SandboxVec][DAG] Implement PredIterator (#111604)

This patch implements an iterator for iterating over both use-def and
mem dependencies of MemDGNodes.

[SandboxVec][DAG] Build actual dependencies (#111094)

This patch implements actual dependencies checking using BatchAA. This
adds memory dep edges between MemDGNodes.

[SandboxVec][DAG][NFC] Move functions from Utils to DependencyGraph (#111031)

This patch moves:
- Utils::isStackSaveOrRestoreIntrinsic()
- Utils::isMemIntrinsic()
- Utils::isMemDepCandidate()

[SandboxVec][DAG][NFC] Move functions from Utils to DependencyGraph (#111031)

This patch moves:
- Utils::isStackSaveOrRestoreIntrinsic()
- Utils::isMemIntrinsic()
- Utils::isMemDepCandidate()

to DGNode because they no longer require LLVM IR access and are used
only by the DAG.

show more ...

[SandboxVec][DAG] MemDGNode for memory-dependency candidate nodes (#109684)

This patch implements the MemDGNode class for DAG nodes that are
candidates
for memory dependencies. These nodes form a

[SandboxVec][DAG] MemDGNode for memory-dependency candidate nodes (#109684)

This patch implements the MemDGNode class for DAG nodes that are
candidates
for memory dependencies. These nodes form a chain that is accessible by
`getPrevNode()` and `getNextNode()`.

It also implements a builder class that creates MemDGNode intervals from
Instructions.

show more ...

[SandboxIR][NFC] Move Function class to a separate file (#110526)

Reapply "[SandboxIR][NFC] Delete SandboxIR.h (#110309)"

This reverts commit 8dfeb4ef5d60a5c764f0ce249cc4ec69e012ff93.

Revert "[SandboxIR][NFC] Delete SandboxIR.h (#110309)"

This reverts commit ca47f48a5c9e81ef8b5c4a5b1fbc473ea5d5497c.

[SandboxIR][NFC] Delete SandboxIR.h (#110309)

[SandboxVec][DAG] Implement DGNode::isMem() (#109504)

DGNode::isMem() returns true if the node is a memory dependency
candidate.

[SandboxVec][DAG] Implement extend(ArrayRef) (#109493)

This builds the DAG from an ArrayRef of Instructions.

[SandboxVec][DAG] Boilerplate (#108862)

This patch adds a very basic implementation of the Dependency Graph to
be used by the vectorizer.