File: trusted_bidding_signals_kvv1_requester.cc

package info (click to toggle)
chromium 139.0.7258.127-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 6,122,156 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (173 lines) | stat: -rw-r--r-- 6,441 bytes parent folder | download | duplicates (5)
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
// Copyright 2025 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/interest_group/trusted_bidding_signals_kvv1_requester.h"

#include <stdint.h>

#include <memory>
#include <optional>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#include "base/memory/ptr_util.h"
#include "base/memory/raw_ptr.h"
#include "content/services/auction_worklet/public/cpp/auction_downloader.h"
#include "content/services/auction_worklet/public/cpp/trusted_signals_url_builder.h"
#include "content/services/auction_worklet/public/mojom/auction_network_events_handler.mojom-forward.h"
#include "content/services/auction_worklet/public/mojom/in_progress_auction_download.mojom.h"
#include "services/network/public/mojom/url_loader_factory.mojom-forward.h"
#include "url/gurl.h"
#include "url/origin.h"

namespace content {

namespace {

TrustedBiddingSignalsKVV1Requester::BatchedRequest IssueRequests(
    network::mojom::URLLoaderFactory& url_loader_factory,
    auction_worklet::TrustedBiddingSignalsUrlBuilder& url_builder,
    auction_worklet::mojom::AuctionNetworkEventsHandler& network_events_handler,
    std::vector<TrustedBiddingSignalsKVV1Requester::Request*> merged_requests) {
  auction_worklet::mojom::InProgressAuctionDownloadPtr download =
      auction_worklet::AuctionDownloader::StartDownload(
          url_loader_factory, url_builder.ComposeURL(),
          auction_worklet::AuctionDownloader::MimeType::kJson,
          network_events_handler);
  std::vector<size_t> ids;
  for (const TrustedBiddingSignalsKVV1Requester::Request* request :
       merged_requests) {
    ids.push_back(request->request_id());
  }
  merged_requests.clear();
  url_builder.Reset();
  return TrustedBiddingSignalsKVV1Requester::BatchedRequest(
      std::move(ids), std::move(download));
}

}  // namespace

TrustedBiddingSignalsKVV1Requester::Request::Request(
    const std::string& interest_group_name,
    std::set<std::string> keys,
    int32_t max_trusted_bidding_signals_url_length,
    TrustedBiddingSignalsKVV1Requester* requester,
    size_t request_id)
    : interest_group_name_(interest_group_name),
      keys_(std::move(keys)),
      max_trusted_bidding_signals_url_length_(
          max_trusted_bidding_signals_url_length == 0
              ? std::numeric_limits<int>::max()
              : max_trusted_bidding_signals_url_length),
      requester_(requester),
      request_id_(request_id) {
  DCHECK(requester);
  DCHECK(max_trusted_bidding_signals_url_length_ > 0);
}

TrustedBiddingSignalsKVV1Requester::Request::~Request() {
  if (requester_) {
    requester_->OnRequestDestroyed(this);
  }
}

TrustedBiddingSignalsKVV1Requester::BatchedRequest::BatchedRequest(
    std::vector<size_t> request_ids,
    auction_worklet::mojom::InProgressAuctionDownloadPtr download)
    : request_ids(std::move(request_ids)), download(std::move(download)) {}

TrustedBiddingSignalsKVV1Requester::BatchedRequest::~BatchedRequest() = default;

TrustedBiddingSignalsKVV1Requester::BatchedRequest::BatchedRequest(
    BatchedRequest&& other) = default;

TrustedBiddingSignalsKVV1Requester::TrustedBiddingSignalsKVV1Requester() =
    default;

TrustedBiddingSignalsKVV1Requester::~TrustedBiddingSignalsKVV1Requester() {
  CHECK(queued_requests_.empty());
}

std::unique_ptr<TrustedBiddingSignalsKVV1Requester::Request>
TrustedBiddingSignalsKVV1Requester::RequestBiddingSignals(
    const std::string& interest_group_name,
    const std::optional<std::vector<std::string>>& keys,
    int32_t max_trusted_bidding_signals_url_length) {
  auto request = base::WrapUnique(new Request(
      interest_group_name,
      keys ? std::set<std::string>(keys->begin(), keys->end())
           : std::set<std::string>(),
      max_trusted_bidding_signals_url_length, this, next_request_id_));
  queued_requests_.insert(request.get());
  ++next_request_id_;
  return request;
}

std::vector<TrustedBiddingSignalsKVV1Requester::BatchedRequest>
TrustedBiddingSignalsKVV1Requester::StartBatchedRequest(
    network::mojom::URLLoaderFactory& url_loader_factory,
    auction_worklet::mojom::AuctionNetworkEventsHandler& network_events_handler,
    std::string top_level_host,
    GURL trusted_signals_url,
    std::optional<uint16_t> experiment_group_id,
    std::string trusted_bidding_signals_slot_size_param) {
  if (queued_requests_.empty()) {
    return {};
  }

  std::vector<BatchedRequest> output;

  std::vector<Request*> merged_requests;
  auction_worklet::TrustedBiddingSignalsUrlBuilder url_builder(
      std::move(top_level_host), std::move(trusted_signals_url),
      std::move(experiment_group_id),
      std::move(trusted_bidding_signals_slot_size_param));
  for (auto& request : queued_requests_) {
    if (!TryToAddRequest(url_builder, merged_requests, request)) {
      output.emplace_back(IssueRequests(url_loader_factory, url_builder,
                                        network_events_handler,
                                        std::move(merged_requests)));
      merged_requests.clear();
      TryToAddRequest(url_builder, merged_requests, request);
    }
    // We're about to clear the `request` from `queued_requests_` so we no
    // longer need to keep track of the `requester_`.
    request->requester_ = nullptr;
  }
  output.emplace_back(IssueRequests(url_loader_factory, url_builder,
                                    network_events_handler,
                                    std::move(merged_requests)));
  queued_requests_.clear();
  return output;
}

bool TrustedBiddingSignalsKVV1Requester::CompareRequest::operator()(
    const Request* r1,
    const Request* r2) const {
  return std::tie(r1->interest_group_name_, r1) <
         std::tie(r2->interest_group_name_, r2);
}

// static
bool TrustedBiddingSignalsKVV1Requester::TryToAddRequest(
    auction_worklet::TrustedBiddingSignalsUrlBuilder& bidding_url_builder,
    std::vector<Request*>& merged_requests,
    Request* request) {
  bool success = bidding_url_builder.TryToAddRequest(
      request->interest_group_name_, request->keys_,
      request->max_trusted_bidding_signals_url_length_);
  if (success) {
    merged_requests.push_back(request);
  }
  return success;
}

void TrustedBiddingSignalsKVV1Requester::OnRequestDestroyed(Request* request) {
  bool erased = queued_requests_.erase(request);
  DCHECK(erased);
}

}  // namespace content