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
|
// Copyright 2019 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/sms/sms_queue.h"
#include "base/functional/callback.h"
#include "base/metrics/histogram_macros.h"
#include "base/observer_list.h"
namespace content {
SmsQueue::SmsQueue() = default;
SmsQueue::~SmsQueue() = default;
void SmsQueue::Push(const OriginList& origin_list, Subscriber* subscriber) {
// We expect that in most cases there should be only one pending origin and in
// rare cases there may be a few more (<10).
// As of 2023.12.05, there is at most 1 pending origin at 99 PCT.
subscribers_[origin_list].AddObserver(subscriber);
}
SmsQueue::Subscriber* SmsQueue::Pop(const OriginList& origin_list) {
auto it = subscribers_.find(origin_list);
if (it == subscribers_.end())
return nullptr;
base::ObserverList<Subscriber>& subscribers = it->second;
Subscriber& subscriber = *(subscribers.begin());
Remove(origin_list, &subscriber);
return &subscriber;
}
void SmsQueue::Remove(const OriginList& origin_list, Subscriber* subscriber) {
auto it = subscribers_.find(origin_list);
if (it == subscribers_.end())
return;
base::ObserverList<Subscriber>& queue = it->second;
queue.RemoveObserver(subscriber);
if (queue.begin() == queue.end())
subscribers_.erase(it);
}
bool SmsQueue::HasSubscribers() {
return !subscribers_.empty();
}
bool SmsQueue::HasSubscriber(const OriginList& origin_list,
const Subscriber* subscriber) {
return (subscribers_.find(origin_list) != subscribers_.end()) &&
subscribers_[origin_list].HasObserver(subscriber);
}
// Currently we cannot extract the origin information upon failure because it's
// not visible to the service. If we have a single origin in the queue we simply
// assume failure belongs to that origin. This assumption should hold for vast
// majority of cases given that a single pending origin is the most likely
// scenario (confirmed by UMA histogram). However if there is more than one
// origin waiting we do not pass up the error to avoid over-counting failures.
// Similar to the success case, we only notify the first subscriber with that
// origin.
bool SmsQueue::NotifyFailure(FailureType failure_type) {
// TODO(crbug.com/40153007): We should improve the infrastructure to be able
// to handle failed requests when there are multiple pending origins
// simultaneously.
if (subscribers_.size() != 1)
return false;
const OriginList& implied_origin = subscribers_.begin()->first;
Subscriber* subscriber = Pop(implied_origin);
subscriber->OnFailure(failure_type);
return true;
}
} // namespace content
|
