mirror of
https://github.com/MariaDB/server.git
synced 2025-02-02 03:51:50 +01:00
e49dee377b
This patch was created by running the following commands:
for i in */*[ch]; do doxygenify.pl $i; done
perl -i -pe 's#\*{3} \*/$#****/#' */*[ch]
where doxygenify.pl is
https://svn.innodb.com/svn/misc/trunk/tools/doxygenify.pl r510
Verified the consistency as follows:
(0) not too many /* in: */ or /* out: */ comments left in the code:
grep -l '/\*\s*\(in\|out\)[,:/]' */*[ch]
(1) no difference when ignoring blank lines, after stripping all
C90-style /* comments */, including multi-line ones, before and after
applying this patch:
perl -i -e 'undef $/;while(<ARGV>){s#/\*(.*?)\*/##gs;print}' */*[ch]
diff -I'^\s*$' --exclude .svn -ru TREE1 TREE2
(2) after stripping @return comments and !<, generated a diff and omitted
the hunks where /* out: */ function return comments were removed:
perl -i -e'undef $/;while(<ARGV>){s#!<##g;s#\n\@return\t.*?\*/# \*/#gs;print}'\
*/*[ch]
svn diff|
perl -e 'undef $/;$_=<>;s#\n-\s*/\* out[:,]([^\n]*?)(\n-[^\n]*?)*\*/##gs;print'
Some unintended changes were left. These will be removed in a
subsequent patch.
54 lines
1.8 KiB
C
54 lines
1.8 KiB
C
/*****************************************************************************
|
|
|
|
Copyright (c) 1994, 2009, Innobase Oy. 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
|
|
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
|
|
this program; if not, write to the Free Software Foundation, Inc., 59 Temple
|
|
Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*****************************************************************************/
|
|
|
|
/*******************************************************************
|
|
Byte utilities
|
|
|
|
Created 5/11/1994 Heikki Tuuri
|
|
********************************************************************/
|
|
|
|
#include "ut0byte.h"
|
|
|
|
#ifdef UNIV_NONINL
|
|
#include "ut0byte.ic"
|
|
#endif
|
|
|
|
/* Zero value for a dulint */
|
|
UNIV_INTERN const dulint ut_dulint_zero = {0, 0};
|
|
|
|
/* Maximum value for a dulint */
|
|
UNIV_INTERN const dulint ut_dulint_max = {0xFFFFFFFFUL, 0xFFFFFFFFUL};
|
|
|
|
#ifdef notdefined /* unused code */
|
|
#include "ut0sort.h"
|
|
|
|
/****************************************************************
|
|
Sort function for dulint arrays. */
|
|
UNIV_INTERN
|
|
void
|
|
ut_dulint_sort(
|
|
/*===========*/
|
|
dulint* arr, /*!< in/out: array to be sorted */
|
|
dulint* aux_arr,/*!< in/out: auxiliary array (same size as arr) */
|
|
ulint low, /*!< in: low bound of sort interval, inclusive */
|
|
ulint high) /*!< in: high bound of sort interval, noninclusive */
|
|
{
|
|
UT_SORT_FUNCTION_BODY(ut_dulint_sort, arr, aux_arr, low, high,
|
|
ut_dulint_cmp);
|
|
}
|
|
#endif /* notdefined */
|