mirror of
https://github.com/postgres/postgres.git
synced 2025-07-02 09:02:37 +03:00
Renaming cleanup, no pgindent yet.
This commit is contained in:
@ -9,7 +9,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.10 1998/06/15 19:28:23 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/dllist.c,v 1.11 1998/09/01 03:22:35 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -64,7 +64,7 @@ DLFreeElem(Dlelem *e)
|
||||
Dlelem *
|
||||
DLGetHead(Dllist *l)
|
||||
{
|
||||
return (l ? l->dll_head : 0);
|
||||
return l ? l->dll_head : 0;
|
||||
}
|
||||
|
||||
/* get the value stored in the first element */
|
||||
@ -74,7 +74,7 @@ DLGetHeadVal(Dllist *l)
|
||||
{
|
||||
Dlelem *e = DLGetHead(l);
|
||||
|
||||
return (e ? e->dle_val : 0);
|
||||
return e ? e->dle_val : 0;
|
||||
}
|
||||
|
||||
#endif
|
||||
@ -82,7 +82,7 @@ DLGetHeadVal(Dllist *l)
|
||||
Dlelem *
|
||||
DLGetTail(Dllist *l)
|
||||
{
|
||||
return (l ? l->dll_tail : 0);
|
||||
return l ? l->dll_tail : 0;
|
||||
}
|
||||
|
||||
/* get the value stored in the first element */
|
||||
@ -92,7 +92,7 @@ DLGetTailVal(Dllist *l)
|
||||
{
|
||||
Dlelem *e = DLGetTail(l);
|
||||
|
||||
return (e ? e->dle_val : 0);
|
||||
return e ? e->dle_val : 0;
|
||||
}
|
||||
|
||||
#endif
|
||||
@ -100,13 +100,13 @@ DLGetTailVal(Dllist *l)
|
||||
Dlelem *
|
||||
DLGetPred(Dlelem *e) /* get predecessor */
|
||||
{
|
||||
return (e ? e->dle_prev : 0);
|
||||
return e ? e->dle_prev : 0;
|
||||
}
|
||||
|
||||
Dlelem *
|
||||
DLGetSucc(Dlelem *e) /* get successor */
|
||||
{
|
||||
return (e ? e->dle_next : 0);
|
||||
return e ? e->dle_next : 0;
|
||||
}
|
||||
|
||||
void
|
||||
|
@ -7,7 +7,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/fstack.c,v 1.8 1998/06/15 19:28:24 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/fstack.c,v 1.9 1998/09/01 03:22:37 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -62,12 +62,12 @@ FixedStackPop(FixedStack stack)
|
||||
AssertArg(FixedStackIsValid(stack));
|
||||
|
||||
if (!PointerIsValid(stack->top))
|
||||
return (NULL);
|
||||
return NULL;
|
||||
|
||||
pointer = FixedStackGetItemBase(stack, stack->top);
|
||||
stack->top = stack->top->next;
|
||||
|
||||
return (pointer);
|
||||
return pointer;
|
||||
}
|
||||
|
||||
void
|
||||
@ -108,9 +108,9 @@ FixedStackContains(FixedStack stack, Pointer pointer)
|
||||
for (next = stack->top; FixedItemIsValid(next); next = next->next)
|
||||
{
|
||||
if (next == item)
|
||||
return (true);
|
||||
return true;
|
||||
}
|
||||
return (false);
|
||||
return false;
|
||||
}
|
||||
|
||||
#endif
|
||||
@ -121,9 +121,9 @@ FixedStackGetTop(FixedStack stack)
|
||||
AssertArg(FixedStackIsValid(stack));
|
||||
|
||||
if (!PointerIsValid(stack->top))
|
||||
return (NULL);
|
||||
return NULL;
|
||||
|
||||
return (FixedStackGetItemBase(stack, stack->top));
|
||||
return FixedStackGetItemBase(stack, stack->top);
|
||||
}
|
||||
|
||||
Pointer
|
||||
@ -138,7 +138,7 @@ FixedStackGetNext(FixedStack stack, Pointer pointer)
|
||||
item = FixedStackGetItem(stack, pointer)->next;
|
||||
|
||||
if (!PointerIsValid(item))
|
||||
return (NULL);
|
||||
return NULL;
|
||||
|
||||
return (FixedStackGetItemBase(stack, item));
|
||||
return FixedStackGetItemBase(stack, item);
|
||||
}
|
||||
|
@ -6,7 +6,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.8 1998/02/26 04:31:39 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/Attic/lispsort.c,v 1.9 1998/09/01 03:22:38 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -42,7 +42,7 @@ lisp_qsort(List *the_list, /* the list to be sorted */
|
||||
/* find size of list */
|
||||
num = length(the_list);
|
||||
if (num < 2)
|
||||
return (copyObject(the_list));
|
||||
return copyObject(the_list);
|
||||
|
||||
/* copy elements of the list into an array */
|
||||
nodearray = (List **) palloc(num * sizeof(List *));
|
||||
@ -58,7 +58,7 @@ lisp_qsort(List *the_list, /* the list to be sorted */
|
||||
for (i = num - 1; i >= 0; i--)
|
||||
output = lcons(nodearray[i], output);
|
||||
|
||||
return (output);
|
||||
return output;
|
||||
}
|
||||
|
||||
#endif
|
||||
|
@ -9,7 +9,7 @@
|
||||
*
|
||||
*
|
||||
* IDENTIFICATION
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/stringinfo.c,v 1.10 1998/06/15 19:28:24 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/backend/lib/stringinfo.c,v 1.11 1998/09/01 03:22:39 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -54,7 +54,7 @@ makeStringInfo()
|
||||
*/
|
||||
res->data[0] = '\0';
|
||||
|
||||
return (res);
|
||||
return res;
|
||||
}
|
||||
|
||||
/*---------------------------------------------------------------------
|
||||
|
Reference in New Issue
Block a user