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
|
/* vim:t ts=4 sw=2 sts=2 et cin: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef PendingTransactionQueue_h_
#define PendingTransactionQueue_h_
#include "nsClassHashtable.h"
#include "nsHttpTransaction.h"
#include "PendingTransactionInfo.h"
namespace mozilla {
namespace net {
class PendingTransactionQueue {
public:
PendingTransactionQueue() = default;
void ReschedTransaction(nsHttpTransaction* aTrans);
nsTArray<RefPtr<PendingTransactionInfo>>* GetTransactionPendingQHelper(
nsAHttpTransaction* trans);
void InsertTransactionSorted(
nsTArray<RefPtr<PendingTransactionInfo>>& pendingQ,
PendingTransactionInfo* pendingTransInfo,
bool aInsertAsFirstForTheSamePriority = false);
// Add a transaction information into the pending queue in
// |mPendingTransactionTable| according to the transaction's
// top level outer content window id.
void InsertTransaction(PendingTransactionInfo* pendingTransInfo,
bool aInsertAsFirstForTheSamePriority = false);
void AppendPendingUrgentStartQ(
nsTArray<RefPtr<PendingTransactionInfo>>& result);
// Append transactions to the |result| whose window id
// is equal to |windowId|.
// NOTE: maxCount == 0 will get all transactions in the queue.
void AppendPendingQForFocusedWindow(
uint64_t windowId, nsTArray<RefPtr<PendingTransactionInfo>>& result,
uint32_t maxCount = 0);
// Append transactions whose window id isn't equal to |windowId|.
// NOTE: windowId == 0 will get all transactions for both
// focused and non-focused windows.
void AppendPendingQForNonFocusedWindows(
uint64_t windowId, nsTArray<RefPtr<PendingTransactionInfo>>& result,
uint32_t maxCount = 0);
// Return the count of pending transactions for all window ids.
size_t PendingQueueLength() const;
size_t PendingQueueLengthForWindow(uint64_t windowId) const;
// Return true if there are any pending transactions (optimized version of
// PendingQueueLength() == 0). Returns early as soon as a non-empty queue is
// found.
bool PendingQueueIsEmpty() const;
// Remove the empty pendingQ in |mPendingTransactionTable|.
void RemoveEmptyPendingQ();
void PrintDiagnostics(nsCString& log);
size_t UrgentStartQueueLength();
// Return true if the urgent start queue is empty (optimized version of
// UrgentStartQueueLength() == 0).
bool UrgentStartQueueIsEmpty() const;
void PrintPendingQ();
void Compact();
void CancelAllTransactions(nsresult reason);
~PendingTransactionQueue() = default;
private:
void InsertTransactionNormal(PendingTransactionInfo* info,
bool aInsertAsFirstForTheSamePriority = false);
nsTArray<RefPtr<PendingTransactionInfo>>
mUrgentStartQ; // the urgent start transaction queue
// This table provides a mapping from top level outer content window id
// to a queue of pending transaction information.
// The transaction's order in pending queue is decided by whether it's a
// blocking transaction and its priority.
// Note that the window id could be 0 if the http request
// is initialized without a window.
nsClassHashtable<nsUint64HashKey, nsTArray<RefPtr<PendingTransactionInfo>>>
mPendingTransactionTable;
};
} // namespace net
} // namespace mozilla
#endif // !PendingTransactionQueue_h_
|
