commit f5402004c4a6871ecbd8bb4cf300d0e20155e867
author Robert Phillips <robertphillips@google.com> Tue Aug 07 15:16:54 2018 -0400
committer Skia Commit-Bot <skia-commit-bot@chromium.org> Wed Aug 08 11:43:43 2018 +0000
tree 91aff0481a40f8bb3894d62f2fde989eafa9f18d
parent 4856f5fa596d37d32b313e8d598a1b72024f9afe

First version of incremental topological sort

In order to solve both the VRAM budget for explicit resource allocation and DDL incremental flush problems we will need to always have the opLists be sorted.

This will also help partial flushes.

Change-Id: I3ac2baf622415925ab5c403b7800f3fc49e59838
Reviewed-on: https://skia-review.googlesource.com/144000
Commit-Queue: Robert Phillips <robertphillips@google.com>
Reviewed-by: Greg Daniel <egdaniel@google.com>

gn/tests.gni

diff --git a/gn/tests.gni b/gn/tests.gni
index 7f3b0f5..86674fc 100644
--- a/gn/tests.gni
+++ b/gn/tests.gni
@@ -120,6 +120,7 @@
   "$_tests/ImageNewShaderTest.cpp",
   "$_tests/ImageTest.cpp",
   "$_tests/IndexedPngOverflowTest.cpp",
+  "$_tests/IncrTopoSortTest.cpp",
   "$_tests/InfRectTest.cpp",
   "$_tests/InsetConvexPolyTest.cpp",
   "$_tests/InterpolatorTest.cpp",