2009-05-27 15:15:59 +05:30
|
|
|
/*****************************************************************************
|
|
|
|
|
2016-08-12 11:17:45 +03:00
|
|
|
Copyright (c) 2006, 2013, Oracle and/or its affiliates. All Rights Reserved.
|
2009-05-27 15:15:59 +05:30
|
|
|
|
|
|
|
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
|
|
|
|
Foundation; version 2 of the License.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
|
|
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License along with
|
2012-08-01 17:27:34 +03:00
|
|
|
this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA
|
2009-05-27 15:15:59 +05:30
|
|
|
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
/*******************************************************************//**
|
|
|
|
@file include/ut0list.ic
|
|
|
|
A double-linked list
|
|
|
|
|
|
|
|
Created 4/26/2006 Osku Salerma
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
/****************************************************************//**
|
|
|
|
Get the first node in the list.
|
2016-08-12 11:17:45 +03:00
|
|
|
@return first node, or NULL */
|
2009-05-27 15:15:59 +05:30
|
|
|
UNIV_INLINE
|
|
|
|
ib_list_node_t*
|
|
|
|
ib_list_get_first(
|
|
|
|
/*==============*/
|
|
|
|
ib_list_t* list) /*!< in: list */
|
|
|
|
{
|
|
|
|
return(list->first);
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************//**
|
|
|
|
Get the last node in the list.
|
2016-08-12 11:17:45 +03:00
|
|
|
@return last node, or NULL */
|
2009-05-27 15:15:59 +05:30
|
|
|
UNIV_INLINE
|
|
|
|
ib_list_node_t*
|
|
|
|
ib_list_get_last(
|
|
|
|
/*=============*/
|
|
|
|
ib_list_t* list) /*!< in: list */
|
|
|
|
{
|
|
|
|
return(list->last);
|
|
|
|
}
|
2012-08-01 17:27:34 +03:00
|
|
|
|
|
|
|
/********************************************************************
|
|
|
|
Check if list is empty. */
|
|
|
|
UNIV_INLINE
|
|
|
|
ibool
|
|
|
|
ib_list_is_empty(
|
|
|
|
/*=============*/
|
|
|
|
/* out: TRUE if empty else FALSE */
|
|
|
|
const ib_list_t* list) /* in: list */
|
|
|
|
{
|
|
|
|
return(!(list->first || list->last));
|
|
|
|
}
|
2014-02-28 08:53:09 +02:00
|
|
|
|
|
|
|
/********************************************************************
|
|
|
|
Get number of items on list.
|
|
|
|
@return number of items on list */
|
|
|
|
UNIV_INLINE
|
|
|
|
ulint
|
|
|
|
ib_list_len(
|
|
|
|
/*========*/
|
|
|
|
const ib_list_t* list) /*<! in: list */
|
|
|
|
{
|
|
|
|
ulint len = 0;
|
|
|
|
ib_list_node_t* node = list->first;
|
|
|
|
|
|
|
|
while(node) {
|
|
|
|
len++;
|
|
|
|
node = node->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (len);
|
|
|
|
}
|