database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-09-02 04:21:28 +03:00
Code Activity

From: Dan McGuirk <mcguirk@indirect.com>

Browse Source 
Subject: [HACKERS] linux/alpha patches

These patches lay the groundwork for a Linux/Alpha port.  The port doesn't
actually work unless you tweak the linker to put all the pointers in the
first 32 bits of the address space, but it's at least a start.  It
implements the test-and-set instruction in Alpha assembly, and also fixes
a lot of pointer-to-integer conversions, which is probably good anyway.
This commit is contained in:
Marc G. Fournier
1997-03-12 21:13:19 +00:00
parent b66569e41f
commit 5dde558ce6
13 changed files with 123 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/include/nodes/pg_list.h
View File

@@ -6,7 +6,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: pg_list.h,v 1.3 1996/11/04 07:18:19 scrappy Exp $
* $Id: pg_list.h,v 1.4 1997/03/12 21:11:23 scrappy Exp $
*
*-------------------------------------------------------------------------
*/
@@ -44,7 +44,10 @@ typedef struct Value {
*/
typedef struct List {
NodeTag type;
void *elem;
union {
void *ptr_value;
int int_value;
} elem;
struct List *next;
} List;
@@ -54,10 +57,15 @@ typedef struct List {
* accessor macros
* ----------------
*/
#define lfirst(l) ((l)->elem)
/* anything that doesn't end in 'i' is assumed to be referring to the */
/* pointer version of the list (where it makes a difference) */
#define lfirst(l) ((l)->elem.ptr_value)
#define lnext(l) ((l)->next)
#define lsecond(l) (lfirst(lnext(l)))
#define lfirsti(l) ((l)->elem.int_value)
/*
* foreach -
* a convenience macro which loops through the list
@@ -85,13 +93,13 @@ extern void freeList(List *list);
extern void *nth(int n, List *l);
extern void set_nth(List *l, int n, void *elem);
/* hack for now */
#define lconsi(i,l) lcons((void*)(int)i,l)
#define lfirsti(l) ((int)lfirst(l))
#define lappendi(l,i) lappend(l,(void*)i)
List *lconsi(int datum, List *list);
List *lappendi(List *list, int datum);
extern bool intMember(int, List *);
extern List *intAppend(List *list1, List *list2);
extern int nthi(int n, List *l);
extern List *nreverse(List *);
extern List *set_difference(List *, List *);
extern List *set_differencei(List *, List *);

4
src/include/storage/ipc.h
View File

@@ -6,7 +6,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: ipc.h,v 1.15 1997/03/03 23:34:27 scrappy Exp $
* $Id: ipc.h,v 1.16 1997/03/12 21:12:27 scrappy Exp $
*
* NOTES
* This file is very architecture-specific. This stuff should actually
@@ -32,7 +32,7 @@ extern void S_LOCK(slock_t *lock);
extern void S_UNLOCK(slock_t *lock);
extern void S_INIT_LOCK(slock_t *lock);
#if defined(alpha) || \
#if (defined(alpha) && !defined(linuxalpha)) || \
defined(hpux) || \
defined(irix5) || \
defined(nextstep)

9
src/include/utils/memutils.h
View File

@@ -15,7 +15,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: memutils.h,v 1.5 1997/03/04 05:32:26 scrappy Exp $
* $Id: memutils.h,v 1.6 1997/03/12 21:13:19 scrappy Exp $
*
* NOTES
* some of the information in this file will be moved to
@@ -67,7 +67,12 @@ s...)
*/
#if defined(sun) && ! defined(sparc)
#define LONGALIGN(LEN) SHORTALIGN(LEN)
#elif defined (alpha)
#elif defined (alpha) || defined(linuxalpha)
/* even though "long alignment" should really be on 8-byte boundaries
* for linuxalpha, we want the strictest alignment to be on 4-byte (int)
* boundaries, because otherwise things break when they try to use the
* FormData_pg_* structures. --djm 12/12/96
*/
#define LONGALIGN(LEN)\
(((long)(LEN) + (sizeof (int) - 1)) & ~(sizeof (int) -1))
#else