LayerSorter 69 cc/trees/layer_sorter.cc LayerSorter::LayerSorter() LayerSorter 72 cc/trees/layer_sorter.cc LayerSorter::~LayerSorter() {} LayerSorter 85 cc/trees/layer_sorter.cc LayerSorter::ABCompareResult LayerSorter::CheckOverlap(LayerShape* a, LayerSorter 264 cc/trees/layer_sorter.cc void LayerSorter::CreateGraphNodes(LayerImplList::iterator first, LayerSorter 301 cc/trees/layer_sorter.cc void LayerSorter::CreateGraphEdges() { LayerSorter 349 cc/trees/layer_sorter.cc void LayerSorter::RemoveEdgeFromList(GraphEdge* edge, LayerSorter 378 cc/trees/layer_sorter.cc void LayerSorter::Sort(LayerImplList::iterator first, LayerSorter 77 cc/trees/layer_sorter.h class CC_EXPORT LayerSorter { LayerSorter 79 cc/trees/layer_sorter.h LayerSorter(); LayerSorter 80 cc/trees/layer_sorter.h ~LayerSorter(); LayerSorter 110 cc/trees/layer_sorter.h DISALLOW_COPY_AND_ASSIGN(LayerSorter); LayerSorter 25 cc/trees/layer_sorter_unittest.cc LayerSorter::ABCompareResult overlap_result; LayerSorter 39 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&front, &back, z_threshold, &weight); LayerSorter 40 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::BBeforeA, overlap_result); LayerSorter 44 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&back, &front, z_threshold, &weight); LayerSorter 45 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::ABeforeB, overlap_result); LayerSorter 53 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&front, &back_right, z_threshold, &weight); LayerSorter 54 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::None, overlap_result); LayerSorter 58 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&front, &front, z_threshold, &weight); LayerSorter 63 cc/trees/layer_sorter_unittest.cc LayerSorter::ABCompareResult overlap_result; LayerSorter 82 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&front_face, &left_face, z_threshold, &weight); LayerSorter 83 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::BBeforeA, overlap_result); LayerSorter 87 cc/trees/layer_sorter_unittest.cc LayerSorter::ABCompareResult overlap_result; LayerSorter 106 cc/trees/layer_sorter_unittest.cc overlap_result = LayerSorter::CheckOverlap(&front_face, LayerSorter 110 cc/trees/layer_sorter_unittest.cc EXPECT_NE(LayerSorter::None, overlap_result); LayerSorter 115 cc/trees/layer_sorter_unittest.cc LayerSorter::ABCompareResult overlap_result; LayerSorter 147 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&layer_a, &layer_c, z_threshold, &weight); LayerSorter 148 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::ABeforeB, overlap_result); LayerSorter 150 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&layer_c, &layer_b, z_threshold, &weight); LayerSorter 151 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::ABeforeB, overlap_result); LayerSorter 153 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&layer_a, &layer_b, z_threshold, &weight); LayerSorter 154 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::None, overlap_result); LayerSorter 158 cc/trees/layer_sorter_unittest.cc LayerSorter::ABCompareResult overlap_result; LayerSorter 194 cc/trees/layer_sorter_unittest.cc LayerSorter::CheckOverlap(&layer_a, &layer_b, z_threshold, &weight); LayerSorter 195 cc/trees/layer_sorter_unittest.cc EXPECT_EQ(LayerSorter::ABeforeB, overlap_result); LayerSorter 267 cc/trees/layer_sorter_unittest.cc LayerSorter layer_sorter; LayerSorter 319 cc/trees/layer_sorter_unittest.cc LayerSorter layer_sorter; LayerSorter 37 cc/trees/layer_tree_host_common.cc LayerSorter* layer_sorter) { LayerSorter 1127 cc/trees/layer_tree_host_common.cc LayerSorter* layer_sorter; LayerSorter 2192 cc/trees/layer_tree_host_common.cc LayerSorter layer_sorter;