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
95
96
|
// Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CC_METRICS_FRAME_SORTER_H_
#define CC_METRICS_FRAME_SORTER_H_
#include <stddef.h>
#include <map>
#include <optional>
#include <vector>
#include "base/containers/circular_deque.h"
#include "base/containers/flat_set.h"
#include "base/functional/callback.h"
#include "base/observer_list.h"
#include "base/observer_list_types.h"
#include "cc/cc_export.h"
#include "components/viz/common/frame_sinks/begin_frame_args.h"
namespace cc {
struct FrameInfo;
// FrameSorterObserver class notifies registered
// observers when frames are flushed by the FrameSorter.
class FrameSorterObserver : public base::CheckedObserver {
public:
virtual void AddSortedFrame(const viz::BeginFrameArgs&, const FrameInfo&) = 0;
};
// This class is used to process the frames in order of initiation.
// So regardless of which order frames are terminated, the frames
// sorter will be called on the frames in the order of initiation
// (e.g. frame_time of that frame).
class CC_EXPORT FrameSorter {
public:
class FrameState {
public:
void OnBegin();
void OnAck(bool frame_is_dropped);
void OnReset();
bool IsComplete() const; // Checks if all acks are received.
bool is_dropped() const { return is_dropped_; }
bool should_ignore() const { return should_ignore_; }
private:
uint16_t on_begin_counter = 0; // Counts the number of AddNewFrame calls.
uint16_t ack_counter = 0; // Counts the number of acks received.
bool is_dropped_ = false; // Flags if any of the acks were dropped.
bool should_ignore_ = false; // Flags if there was a reset prior to acks.
};
FrameSorter();
void AddObserver(FrameSorterObserver* frame_sorter_observer);
void RemoveObserver(FrameSorterObserver* frame_sorter_observer);
~FrameSorter();
FrameSorter(const FrameSorter&) = delete;
FrameSorter& operator=(const FrameSorter&) = delete;
// The frames must be added in the correct order.
void AddNewFrame(const viz::BeginFrameArgs& args);
// The results can be added in any order. However, the frame must have been
// added by an earlier call to |AddNewFrame()|.
void AddFrameResult(const viz::BeginFrameArgs& args,
const FrameInfo& frame_info);
// Check if a frame has been previously reported as dropped.
bool IsAlreadyReportedDropped(const viz::BeginFrameId& id) const;
void Reset();
private:
void FlushFrames();
const uint64_t kPendingFramesMaxSize = 300u;
// The callback to run for each flushed frame.
base::ObserverList<FrameSorterObserver> observers_;
// Frames which are started.
base::circular_deque<viz::BeginFrameArgs> pending_frames_;
// State of each frame in terms of ack expectation.
std::map<viz::BeginFrameId, FrameState> frame_states_;
std::map<viz::BeginFrameId, FrameInfo> frame_infos_;
std::optional<uint64_t> current_source_id_;
};
} // namespace cc
#endif // CC_METRICS_FRAME_SORTER_H_
|
