Home
last modified time | relevance | path

Searched refs:Queue (Results 76 – 100 of 15422) sorted by relevance

12345678910>>...617

/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/lldb/source/Target/
H A DQueue.cpp18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
65 uint32_t Queue::GetNumPendingWorkItems() const { in GetNumPendingWorkItems()
73 addr_t Queue::GetLibdispatchQueueAddress() const { in GetLibdispatchQueueAddress()
[all …]
/dports/devel/adabooch/bc-20160321/src/
H A Dbc-indefinite_unmanaged_containers-queues.adb29 procedure Clear (Q : in out Queue) is
34 procedure Append (Q : in out Queue; Elem : Item) is
39 procedure Pop (Q : in out Queue) is
49 function Length (Q : Queue) return Natural is
54 function Is_Empty (Q : Queue) return Boolean is
59 function Front (Q : Queue) return Item is
97 function Null_Container return Queue is
98 Empty_Container : Queue;
105 Q : Queue'Class
121 Q : Queue'Class
[all …]
H A Dbc-containers-queues-unmanaged.ads31 type Queue is new Abstract_Queue with private; type
35 function Null_Container return Queue;
37 procedure Clear (Q : in out Queue);
40 procedure Append (Q : in out Queue; Elem : Item);
44 procedure Pop (Q : in out Queue);
47 procedure Remove (Q : in out Queue; From : Positive);
50 function Length (Q : in Queue) return Natural;
53 function Is_Empty (Q : in Queue) return Boolean;
56 function Front (Q : in Queue) return Item;
63 function "=" (Left, Right : in Queue) return Boolean;
[all …]
H A Dbc-containers-queues-ordered-unmanaged.ads30 type Queue is new Abstract_Ordered_Queue with private; type
34 function Null_Container return Queue;
36 procedure Clear (Q : in out Queue);
39 procedure Append (Q : in out Queue; Elem : Item);
42 procedure Pop (Q : in out Queue);
45 procedure Remove (Q : in out Queue; From : Positive);
48 function Length (Q : in Queue) return Natural;
51 function Is_Empty (Q : in Queue) return Boolean;
54 function Front (Q : in Queue) return Item;
61 function "=" (Left, Right : in Queue) return Boolean;
[all …]
H A Dbc-indefinite_unmanaged_containers-queues.ads32 type Queue is new Container with private; type
36 function Null_Container return Queue;
38 procedure Clear (Q : in out Queue);
41 procedure Append (Q : in out Queue; Elem : Item);
45 procedure Pop (Q : in out Queue);
48 procedure Remove (Q : in out Queue; From : Positive);
51 function Length (Q : in Queue) return Natural;
54 function Is_Empty (Q : in Queue) return Boolean;
57 function Front (Q : in Queue) return Item;
62 procedure Process_Front (Q : in out Queue'Class);
[all …]
H A Dbc-containers-queues-unbounded.ads33 type Queue is new Abstract_Queue with private; type
37 function Null_Container return Queue;
39 procedure Clear (Q : in out Queue);
42 procedure Append (Q : in out Queue; Elem : Item);
46 procedure Pop (Q : in out Queue);
49 procedure Remove (Q : in out Queue; From : Positive);
52 function Length (Q : in Queue) return Natural;
55 function Is_Empty (Q : in Queue) return Boolean;
58 function Front (Q : in Queue) return Item;
65 function "=" (Left, Right : in Queue) return Boolean;
[all …]
/dports/emulators/qemu42/qemu-4.2.1/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/emulators/qemu-utils/qemu-4.2.1/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/edk2/EmulatorPkg/Win/Host/
H A DWinGopInput.c44 Queue->Front = 0; in GopPrivateCreateQ()
45 Queue->Rear = 0; in GopPrivateCreateQ()
64 Queue->Front = 0; in GopPrivateDestroyQ()
65 Queue->Rear = 0; in GopPrivateDestroyQ()
90 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) { in GopPrivateAddQ()
95 CopyMem (&Queue->Q[Queue->Rear], KeyData, sizeof (EFI_KEY_DATA)); in GopPrivateAddQ()
96 Queue->Rear = (Queue->Rear + 1) % MAX_Q; in GopPrivateAddQ()
122 if (Queue->Front == Queue->Rear) { in GopPrivateDeleteQ()
127 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA)); in GopPrivateDeleteQ()
128 Queue->Front = (Queue->Front + 1) % MAX_Q; in GopPrivateDeleteQ()
[all …]
/dports/science/simlib/simlib/src/
H A Dqueue.cc29 Queue::Queue() in Queue() function in simlib3::Queue
34 Queue::Queue(const char *name) in Queue() function in simlib3::Queue
43 Queue::~Queue() { in ~Queue()
50 void Queue::Insert(Entity *ent) in Insert()
56 Queue::iterator p = begin(); in Insert()
60 Queue::iterator p = end(); in Insert()
62 Queue::iterator q = p; in Insert()
82 void Queue::InsLast(Entity *ent) in InsLast()
113 Entity *Queue::GetFirst() in GetFirst()
123 Entity *Queue::GetLast() in GetLast()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon03467ce40111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon2d94abf10111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon03e791b90111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anondb3639630111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon6627f5c60111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon7c0bfec40111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anone884c1b90111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {} in DestructNotifier() argument
19 ~DestructNotifier() { Queue.push_back(Key); } in ~DestructNotifier()
21 std::vector<int> &Queue; member in __anon7b5482770111::DestructNotifier
27 std::vector<int> Queue; in TEST() local
30 auto *One = new DestructNotifier(Queue, 1); in TEST()
31 auto *Two = new DestructNotifier(Queue, 2); in TEST()
35 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
39 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
44 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
53 ASSERT_THAT(Queue, testing::IsEmpty()); in TEST()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/lldb/unittests/Utility/
H A DSharedClusterTest.cpp18 DestructNotifier(std::vector<int> &Queue, int Key) : Queue(Queue), Key(Key) {}
19 ~DestructNotifier() { Queue.push_back(Key); }
21 std::vector<int> &Queue;
27 std::vector<int> Queue;
30 auto *One = new DestructNotifier(Queue, 1);
31 auto *Two = new DestructNotifier(Queue, 2);
35 ASSERT_THAT(Queue, testing::IsEmpty());
39 ASSERT_THAT(Queue, testing::IsEmpty());
44 ASSERT_THAT(Queue, testing::IsEmpty());
53 ASSERT_THAT(Queue, testing::IsEmpty());
[all …]

12345678910>>...617