summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorGravatar bunnei2021-11-21 02:30:16 -0800
committerGravatar bunnei2021-12-06 16:39:17 -0800
commit2c49a65d2be9cc18bf6e72bb09ad4ce6a8e7588f (patch)
tree0955148fdde511dbb63783a1c4db2ad92f1f8cb9 /src
parenthle: kernel: Cleanup to match coding style. (diff)
downloadyuzu-2c49a65d2be9cc18bf6e72bb09ad4ce6a8e7588f.tar.gz
yuzu-2c49a65d2be9cc18bf6e72bb09ad4ce6a8e7588f.tar.xz
yuzu-2c49a65d2be9cc18bf6e72bb09ad4ce6a8e7588f.zip
hle: kernel: KSynchronizationObject: Fix variable shadowing.
Diffstat (limited to 'src')
-rw-r--r--src/core/hle/kernel/k_synchronization_object.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/core/hle/kernel/k_synchronization_object.h b/src/core/hle/kernel/k_synchronization_object.h
index 789ff4780..ec235437b 100644
--- a/src/core/hle/kernel/k_synchronization_object.h
+++ b/src/core/hle/kernel/k_synchronization_object.h
@@ -35,18 +35,18 @@ public:
35 35
36 [[nodiscard]] std::vector<KThread*> GetWaitingThreadsForDebugging() const; 36 [[nodiscard]] std::vector<KThread*> GetWaitingThreadsForDebugging() const;
37 37
38 void LinkNode(ThreadListNode* node) { 38 void LinkNode(ThreadListNode* node_) {
39 // Link the node to the list. 39 // Link the node to the list.
40 if (thread_list_tail == nullptr) { 40 if (thread_list_tail == nullptr) {
41 thread_list_head = node; 41 thread_list_head = node_;
42 } else { 42 } else {
43 thread_list_tail->next = node; 43 thread_list_tail->next = node_;
44 } 44 }
45 45
46 thread_list_tail = node; 46 thread_list_tail = node_;
47 } 47 }
48 48
49 void UnlinkNode(ThreadListNode* node) { 49 void UnlinkNode(ThreadListNode* node_) {
50 // Unlink the node from the list. 50 // Unlink the node from the list.
51 ThreadListNode* prev_ptr = 51 ThreadListNode* prev_ptr =
52 reinterpret_cast<ThreadListNode*>(std::addressof(thread_list_head)); 52 reinterpret_cast<ThreadListNode*>(std::addressof(thread_list_head));
@@ -58,13 +58,13 @@ public:
58 prev_ptr = prev_ptr->next; 58 prev_ptr = prev_ptr->next;
59 tail_prev = prev_val; 59 tail_prev = prev_val;
60 prev_val = prev_ptr; 60 prev_val = prev_ptr;
61 } while (prev_ptr != node); 61 } while (prev_ptr != node_);
62 62
63 if (thread_list_tail == node) { 63 if (thread_list_tail == node_) {
64 thread_list_tail = tail_prev; 64 thread_list_tail = tail_prev;
65 } 65 }
66 66
67 prev->next = node->next; 67 prev->next = node_->next;
68 } 68 }
69 69
70protected: 70protected: