Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
illuna-minetest
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Illuna-Minetest
illuna-minetest
Commits
2f0107f4
Commit
2f0107f4
authored
10 years ago
by
Loïc Blot
Browse files
Options
Downloads
Patches
Plain Diff
MutexedQueue inherits must use std::deque instead of std::list
parent
94b39509
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/util/container.h
+25
-44
25 additions, 44 deletions
src/util/container.h
src/util/thread.h
+3
-3
3 additions, 3 deletions
src/util/thread.h
with
28 additions
and
47 deletions
src/util/container.h
+
25
−
44
View file @
2f0107f4
...
...
@@ -200,12 +200,12 @@ class MutexedQueue
bool
empty
()
{
JMutexAutoLock
lock
(
m_mutex
);
return
(
m_
size
.
GetValu
e
()
==
0
);
return
(
m_
queue
.
siz
e
()
==
0
);
}
void
push_back
(
T
t
)
{
JMutexAutoLock
lock
(
m_mutex
);
m_
list
.
push_back
(
t
);
m_
queue
.
push_back
(
t
);
m_size
.
Post
();
}
...
...
@@ -214,34 +214,28 @@ class MutexedQueue
*/
T
pop_frontNoEx
(
u32
wait_time_max_ms
)
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
begin
=
m_list
.
begin
();
T
t
=
*
begin
;
m_list
.
erase
(
begin
);
T
t
=
m_queue
.
front
();
m_queue
.
pop_front
();
return
t
;
}
else
{
else
{
return
T
();
}
}
T
pop_front
(
u32
wait_time_max_ms
)
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
begin
=
m_list
.
begin
();
T
t
=
*
begin
;
m_list
.
erase
(
begin
);
T
t
=
m_queue
.
front
();
m_queue
.
pop_front
();
return
t
;
}
else
{
else
{
throw
ItemNotFoundException
(
"MutexedQueue: queue is empty"
);
}
}
...
...
@@ -252,26 +246,21 @@ class MutexedQueue
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
begin
=
m_list
.
begin
();
T
t
=
*
begin
;
m_list
.
erase
(
begin
);
T
t
=
m_queue
.
front
();
m_queue
.
pop_front
();
return
t
;
}
T
pop_back
(
u32
wait_time_max_ms
=
0
)
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
last
=
m_list
.
end
();
last
--
;
T
t
=
*
last
;
m_list
.
erase
(
last
);
T
t
=
m_queue
.
back
();
m_queue
.
pop_back
();
return
t
;
}
else
{
else
{
throw
ItemNotFoundException
(
"MutexedQueue: queue is empty"
);
}
}
...
...
@@ -281,18 +270,14 @@ class MutexedQueue
*/
T
pop_backNoEx
(
u32
wait_time_max_ms
=
0
)
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
if
(
m_size
.
Wait
(
wait_time_max_ms
))
{
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
last
=
m_list
.
end
();
last
--
;
T
t
=
*
last
;
m_list
.
erase
(
last
);
T
t
=
m_queue
.
back
();
m_queue
.
pop_back
();
return
t
;
}
else
{
else
{
return
T
();
}
}
...
...
@@ -303,10 +288,8 @@ class MutexedQueue
JMutexAutoLock
lock
(
m_mutex
);
typename
std
::
list
<
T
>::
iterator
last
=
m_list
.
end
();
last
--
;
T
t
=
*
last
;
m_list
.
erase
(
last
);
T
t
=
m_queue
.
back
();
m_queue
.
pop_back
();
return
t
;
}
...
...
@@ -316,15 +299,13 @@ class MutexedQueue
return
m_mutex
;
}
// NEVER EVER modify the >>list<< you got by using this function!
// You may only modify it's content
std
::
list
<
T
>
&
getList
()
std
::
deque
<
T
>
&
getQueue
()
{
return
m_
list
;
return
m_
queue
;
}
std
::
deque
<
T
>
m_queue
;
JMutex
m_mutex
;
std
::
list
<
T
>
m_list
;
JSemaphore
m_size
;
};
...
...
This diff is collapsed.
Click to expand it.
src/util/thread.h
+
3
−
3
View file @
2f0107f4
...
...
@@ -130,9 +130,9 @@ class RequestQueue
/*
If the caller is already on the list, only update CallerData
*/
for
(
typename
std
::
list
<
GetRequest
<
Key
,
T
,
Caller
,
CallerData
>
>::
iterator
i
=
m_queue
.
get
List
().
begin
();
i
!=
m_queue
.
get
List
().
end
();
++
i
)
for
(
typename
std
::
deque
<
GetRequest
<
Key
,
T
,
Caller
,
CallerData
>
>::
iterator
i
=
m_queue
.
get
Queue
().
begin
();
i
!=
m_queue
.
get
Queue
().
end
();
++
i
)
{
GetRequest
<
Key
,
T
,
Caller
,
CallerData
>
&
request
=
*
i
;
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment