lin
2025-08-01 633231e833e21d5b8b1c00cb15aedb62b3b78e8f
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
//
// Copyright (C) 2009 The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
 
#include "update_engine/payload_generator/graph_utils.h"
 
#include <utility>
#include <vector>
 
#include <gtest/gtest.h>
 
#include "update_engine/payload_consumer/payload_constants.h"
#include "update_engine/payload_generator/extent_ranges.h"
#include "update_engine/payload_generator/extent_utils.h"
 
using std::make_pair;
using std::vector;
 
namespace chromeos_update_engine {
 
class GraphUtilsTest : public ::testing::Test {};
 
TEST(GraphUtilsTest, SimpleTest) {
  Graph graph(2);
 
  graph[0].out_edges.insert(make_pair(1, EdgeProperties()));
 
  vector<Extent>& extents = graph[0].out_edges[1].extents;
 
  EXPECT_EQ(0U, extents.size());
  AppendBlockToExtents(&extents, 0);
  EXPECT_EQ(1U, extents.size());
  AppendBlockToExtents(&extents, 1);
  AppendBlockToExtents(&extents, 2);
  EXPECT_EQ(1U, extents.size());
  AppendBlockToExtents(&extents, 4);
 
  EXPECT_EQ(2U, extents.size());
  EXPECT_EQ(0U, extents[0].start_block());
  EXPECT_EQ(3U, extents[0].num_blocks());
  EXPECT_EQ(4U, extents[1].start_block());
  EXPECT_EQ(1U, extents[1].num_blocks());
 
  EXPECT_EQ(4U, graph_utils::EdgeWeight(graph, make_pair(0, 1)));
}
 
TEST(GraphUtilsTest, DepsTest) {
  Graph graph(3);
 
  graph_utils::AddReadBeforeDep(&graph[0], 1, 3);
  EXPECT_EQ(1U, graph[0].out_edges.size());
  {
    Extent& extent = graph[0].out_edges[1].extents[0];
    EXPECT_EQ(3U, extent.start_block());
    EXPECT_EQ(1U, extent.num_blocks());
  }
  graph_utils::AddReadBeforeDep(&graph[0], 1, 4);
  EXPECT_EQ(1U, graph[0].out_edges.size());
  {
    Extent& extent = graph[0].out_edges[1].extents[0];
    EXPECT_EQ(3U, extent.start_block());
    EXPECT_EQ(2U, extent.num_blocks());
  }
  graph_utils::AddReadBeforeDepExtents(
      &graph[2], 1, vector<Extent>(1, ExtentForRange(5, 2)));
  EXPECT_EQ(1U, graph[2].out_edges.size());
  {
    Extent& extent = graph[2].out_edges[1].extents[0];
    EXPECT_EQ(5U, extent.start_block());
    EXPECT_EQ(2U, extent.num_blocks());
  }
  // Change most recent edge from read-before to write-before
  graph[2].out_edges[1].write_extents.swap(graph[2].out_edges[1].extents);
  graph_utils::DropWriteBeforeDeps(&graph[2].out_edges);
  EXPECT_EQ(0U, graph[2].out_edges.size());
 
  EXPECT_EQ(1U, graph[0].out_edges.size());
  graph_utils::DropIncomingEdgesTo(&graph, 1);
  EXPECT_EQ(0U, graph[0].out_edges.size());
}
 
}  // namespace chromeos_update_engine