debian/cdesktop
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

lib/tt/mini_isam: remove register keyword

Browse Source
This commit is contained in:
Jon Trulson
2018-06-27 22:26:18 -06:00
parent 44f999c1de
commit d0dd809b74
43 changed files with 163 additions and 163 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
cde/lib/tt/mini_isam/isdlink.c
View File

@@ -43,8 +43,8 @@
#include "isam_impl.h"
/* _isdln_base_insert () - Insert element into list (at the front) -----------*/
void _isdln_base_insert (register char *base, register struct dlink *l,
register struct dlink *e)
void _isdln_base_insert (char *base, struct dlink *l,
struct dlink *e)
{
e->dln_forward = l->dln_forward;
l->dln_forward = (char *)e - base;
@@ -54,8 +54,8 @@ void _isdln_base_insert (register char *base, register struct dlink *l,
}
/* _isdln_base_append () - Append element to list (at the end) -------------*/
void _isdln_base_append (register char *base, register struct dlink *l,
register struct dlink *e)
void _isdln_base_append (char *base, struct dlink *l,
struct dlink *e)
{
e->dln_backward = l->dln_backward;
l->dln_backward = (char *)e - base;
@@ -65,14 +65,14 @@ void _isdln_base_append (register char *base, register struct dlink *l,
}
/* _isdln_base_remove () - Remove element from list -------------------------*/
void _isdln_base_remove (register char *base, register struct dlink *e)
void _isdln_base_remove (char *base, struct dlink *e)
{
((struct dlink *)(base + e->dln_backward))->dln_forward = e->dln_forward;
((struct dlink *)(base + e->dln_forward))->dln_backward = e->dln_backward;
}
/* _isdln_base_first () - Return first element of the list -------------------*/
struct dlink * _isdln_base_first(register char *base, register struct dlink *l)
struct dlink * _isdln_base_first(char *base, struct dlink *l)
{
struct dlink *val = (struct dlink *)(base + l->dln_forward);
@@ -86,25 +86,25 @@ struct dlink * _isdln_base_first(register char *base, register struct dlink *l)
}
/* _isdln_base_next () - Return next element in the list --------------------*/
struct dlink * _isdln_base_next(register char *base, register struct dlink *l)
struct dlink * _isdln_base_next(char *base, struct dlink *l)
{
return (((struct dlink *)(base + l->dln_forward)));
}
/* _isdln_base_prev () - Return previous element in the list ----------------*/
struct dlink * _isdln_base_prev(register char *base, register struct dlink *l)
struct dlink * _isdln_base_prev(char *base, struct dlink *l)
{
return (((struct dlink *)(base + l->dln_backward)));
}
/* _isdln_base_makeempty () - Make head of empty list -----------------------*/
void _isdln_base_makeempty(register char *base, register struct dlink *l)
void _isdln_base_makeempty(char *base, struct dlink *l)
{
l->dln_forward = l->dln_backward = (char *)l - base;
}
/* _isdln_base_isempty () - Test if list is empty---------------------------*/
int _isdln_base_isempty(register char *base, register struct dlink *l)
int _isdln_base_isempty(char *base, struct dlink *l)
{
return (l->dln_forward == (char *)l - base &&
l->dln_backward == (char *)l - base);