summaryrefslogtreecommitdiff
path: root/src/backend/lib/ilist.c
diff options
context:
space:
mode:
authorPeter Eisentraut <peter@eisentraut.org>2023-01-12 08:00:51 +0100
committerPeter Eisentraut <peter@eisentraut.org>2023-01-12 08:00:51 +0100
commitc8ad4d8166aabd6ed5124e7e432166637d0fe646 (patch)
treebdcd821b33d4d8a904f302cb28379823eb7589ae /src/backend/lib/ilist.c
parent881fa869c6b0c4e2f310d1c145141dd9d6f53774 (diff)
Constify the arguments of ilist.c/h functions
Const qualifiers ensure that we don't do something stupid in the function implementation. Additionally they clarify the interface. As an example: void slist_delete(slist_head *head, const slist_node *node) Here one can instantly tell that node->next is not going to be set to NULL. Finally, const qualifiers potentially allow the compiler to do more optimizations. This being said, no benchmarking was done for this patch. The functions that return non-const pointers like slist_next_node(), dclist_next_node() etc. are not affected by the patch intentionally. Author: Aleksander Alekseev Reviewed-by: Andres Freund Discussion: https://postgr.es/m/CAJ7c6TM2%3D08mNKD9aJg8vEY9hd%2BG4L7%2BNvh30UiNT3kShgRgNg%40mail.gmail.com
Diffstat (limited to 'src/backend/lib/ilist.c')
-rw-r--r--src/backend/lib/ilist.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/backend/lib/ilist.c b/src/backend/lib/ilist.c
index 8ea38095cd8..f06febd6985 100644
--- a/src/backend/lib/ilist.c
+++ b/src/backend/lib/ilist.c
@@ -28,7 +28,7 @@
* Caution: this is O(n); consider using slist_delete_current() instead.
*/
void
-slist_delete(slist_head *head, slist_node *node)
+slist_delete(slist_head *head, const slist_node *node)
{
slist_node *last = &head->head;
slist_node *cur;
@@ -57,7 +57,7 @@ slist_delete(slist_head *head, slist_node *node)
* Validate that 'node' is a member of 'head'
*/
void
-dlist_member_check(dlist_head *head, dlist_node *node)
+dlist_member_check(const dlist_head *head, const dlist_node *node)
{
dlist_iter iter;
@@ -73,7 +73,7 @@ dlist_member_check(dlist_head *head, dlist_node *node)
* Verify integrity of a doubly linked list
*/
void
-dlist_check(dlist_head *head)
+dlist_check(const dlist_head *head)
{
dlist_node *cur;
@@ -110,7 +110,7 @@ dlist_check(dlist_head *head)
* Verify integrity of a singly linked list
*/
void
-slist_check(slist_head *head)
+slist_check(const slist_head *head)
{
slist_node *cur;