summaryrefslogtreecommitdiff
path: root/storage/innobase/include/ut0list.h
diff options
context:
space:
mode:
Diffstat (limited to 'storage/innobase/include/ut0list.h')
-rw-r--r--storage/innobase/include/ut0list.h23
1 files changed, 8 insertions, 15 deletions
diff --git a/storage/innobase/include/ut0list.h b/storage/innobase/include/ut0list.h
index 796a272db59..3b91384bbff 100644
--- a/storage/innobase/include/ut0list.h
+++ b/storage/innobase/include/ut0list.h
@@ -1,6 +1,6 @@
/*****************************************************************************
-Copyright (c) 2006, 2009, Oracle and/or its affiliates. All Rights Reserved.
+Copyright (c) 2006, 2014, Oracle and/or its affiliates. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software
@@ -54,8 +54,7 @@ struct ib_list_node_t;
/****************************************************************//**
Create a new list using mem_alloc. Lists created with this function must be
freed with ib_list_free.
-@return list */
-UNIV_INTERN
+@return list */
ib_list_t*
ib_list_create(void);
/*=================*/
@@ -64,8 +63,7 @@ ib_list_create(void);
/****************************************************************//**
Create a new list using the given heap. ib_list_free MUST NOT BE CALLED for
lists created with this function.
-@return list */
-UNIV_INTERN
+@return list */
ib_list_t*
ib_list_create_heap(
/*================*/
@@ -73,7 +71,6 @@ ib_list_create_heap(
/****************************************************************//**
Free a list. */
-UNIV_INTERN
void
ib_list_free(
/*=========*/
@@ -81,8 +78,7 @@ ib_list_free(
/****************************************************************//**
Add the data to the start of the list.
-@return new list node */
-UNIV_INTERN
+@return new list node */
ib_list_node_t*
ib_list_add_first(
/*==============*/
@@ -92,8 +88,7 @@ ib_list_add_first(
/****************************************************************//**
Add the data to the end of the list.
-@return new list node */
-UNIV_INTERN
+@return new list node */
ib_list_node_t*
ib_list_add_last(
/*=============*/
@@ -103,8 +98,7 @@ ib_list_add_last(
/****************************************************************//**
Add the data after the indicated node.
-@return new list node */
-UNIV_INTERN
+@return new list node */
ib_list_node_t*
ib_list_add_after(
/*==============*/
@@ -116,7 +110,6 @@ ib_list_add_after(
/****************************************************************//**
Remove the node from the list. */
-UNIV_INTERN
void
ib_list_remove(
/*===========*/
@@ -125,7 +118,7 @@ ib_list_remove(
/****************************************************************//**
Get the first node in the list.
-@return first node, or NULL */
+@return first node, or NULL */
UNIV_INLINE
ib_list_node_t*
ib_list_get_first(
@@ -134,7 +127,7 @@ ib_list_get_first(
/****************************************************************//**
Get the last node in the list.
-@return last node, or NULL */
+@return last node, or NULL */
UNIV_INLINE
ib_list_node_t*
ib_list_get_last(