Archipelago » qemu

------------------------------------------------------------------------------

NOTE:

Some code of the Twin package was modified for DOSEMU by the DOSEMU-team.

The original is 'Copyright 1997 Willows Software, Inc.' and generously

was put under the GNU Library General Public License.

( for more information see http://www.willows.com/ )

We make use of section 3 of the GNU Library General Public License

('...opt to apply the terms of the ordinary GNU General Public License...'),

because the resulting product is an integrated part of DOSEMU and

can not be considered to be a 'library' in the terms of Library License.

Therefore, the below GNU LIBRARY GENERAL PUBLIC LICENSE applies only to the

_unchanged_ Twin package from Willows. For the DOSEMU-changed parts the normal

GNU GENERAL PUBLIC LICENSE applies. This GPL (file COPYING) can be found in

the root directory of the DOSEMU distribution.

The act of transformation to GPL was indicated to the maintainer of the Twin

package (Rob Penrose <rob@Canopy.Com>) and he acknowledge agreement.

Nov. 1 1997, The DOSEMU team.

------------------------------------------------------------------------------

		  GNU LIBRARY GENERAL PUBLIC LICENSE

		       Version 2, June 1991

 Copyright (C) 1991 Free Software Foundation, Inc.

                    675 Mass Ave, Cambridge, MA 02139, USA

 Everyone is permitted to copy and distribute verbatim copies

 of this license document, but changing it is not allowed.

[This is the first released version of the library GPL.  It is

 numbered 2 because it goes with version 2 of the ordinary GPL.]

			    Preamble

  The licenses for most software are designed to take away your

freedom to share and change it.  By contrast, the GNU General Public

Licenses are intended to guarantee your freedom to share and change

free software--to make sure the software is free for all its users.

  This license, the Library General Public License, applies to some

specially designated Free Software Foundation software, and to any

other libraries whose authors decide to use it.  You can use it for

your libraries, too.

  When we speak of free software, we are referring to freedom, not

price.  Our General Public Licenses are designed to make sure that you

have the freedom to distribute copies of free software (and charge for

this service if you wish), that you receive source code or can get it

if you want it, that you can change the software or use pieces of it

in new free programs; and that you know you can do these things.

  To protect your rights, we need to make restrictions that forbid

anyone to deny you these rights or to ask you to surrender the rights.

These restrictions translate to certain responsibilities for you if

you distribute copies of the library, or if you modify it.

  For example, if you distribute copies of the library, whether gratis

or for a fee, you must give the recipients all the rights that we gave

you.  You must make sure that they, too, receive or can get the source

code.  If you link a program with the library, you must provide

complete object files to the recipients so that they can relink them

with the library, after making changes to the library and recompiling

it.  And you must show them these terms so they know their rights.

  Our method of protecting your rights has two steps: (1) copyright

the library, and (2) offer you this license which gives you legal

permission to copy, distribute and/or modify the library.

  Also, for each distributor's protection, we want to make certain

that everyone understands that there is no warranty for this free

library.  If the library is modified by someone else and passed on, we

want its recipients to know that what they have is not the original

version, so that any problems introduced by others will not reflect on

the original authors' reputations.

  Finally, any free program is threatened constantly by software

patents.  We wish to avoid the danger that companies distributing free

software will individually obtain patent licenses, thus in effect

transforming the program into proprietary software.  To prevent this,

we have made it clear that any patent must be licensed for everyone's

free use or not licensed at all.

  Most GNU software, including some libraries, is covered by the ordinary

GNU General Public License, which was designed for utility programs.  This

license, the GNU Library General Public License, applies to certain

designated libraries.  This license is quite different from the ordinary

one; be sure to read it in full, and don't assume that anything in it is

the same as in the ordinary license.

  The reason we have a separate public license for some libraries is that

they blur the distinction we usually make between modifying or adding to a

program and simply using it.  Linking a program with a library, without

changing the library, is in some sense simply using the library, and is

analogous to running a utility program or application program.  However, in

a textual and legal sense, the linked executable is a combined work, a

derivative of the original library, and the ordinary General Public License

treats it as such.

  Because of this blurred distinction, using the ordinary General

Public License for libraries did not effectively promote software

sharing, because most developers did not use the libraries.  We

concluded that weaker conditions might promote sharing better.

  However, unrestricted linking of non-free programs would deprive the

users of those programs of all benefit from the free status of the

libraries themselves.  This Library General Public License is intended to

permit developers of non-free programs to use free libraries, while

preserving your freedom as a user of such programs to change the free

libraries that are incorporated in them.  (We have not seen how to achieve

this as regards changes in header files, but we have achieved it as regards

changes in the actual functions of the Library.)  The hope is that this

will lead to faster development of free libraries.

  The precise terms and conditions for copying, distribution and

modification follow.  Pay close attention to the difference between a

"work based on the library" and a "work that uses the library".  The

former contains code derived from the library, while the latter only

works together with the library.

  Note that it is possible for a library to be covered by the ordinary

General Public License rather than by this special one.

		  GNU LIBRARY GENERAL PUBLIC LICENSE

   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

  0. This License Agreement applies to any software library which

contains a notice placed by the copyright holder or other authorized

party saying it may be distributed under the terms of this Library

General Public License (also called "this License").  Each licensee is

addressed as "you".

  A "library" means a collection of software functions and/or data

prepared so as to be conveniently linked with application programs

(which use some of those functions and data) to form executables.

  The "Library", below, refers to any such software library or work

which has been distributed under these terms.  A "work based on the

Library" means either the Library or any derivative work under

copyright law: that is to say, a work containing the Library or a

portion of it, either verbatim or with modifications and/or translated

straightforwardly into another language.  (Hereinafter, translation is

included without limitation in the term "modification".)

  "Source code" for a work means the preferred form of the work for

making modifications to it.  For a library, complete source code means

all the source code for all modules it contains, plus any associated

interface definition files, plus the scripts used to control compilation

and installation of the library.

  Activities other than copying, distribution and modification are not

covered by this License; they are outside its scope.  The act of

running a program using the Library is not restricted, and output from

such a program is covered only if its contents constitute a work based

on the Library (independent of the use of the Library in a tool for

writing it).  Whether that is true depends on what the Library does

and what the program that uses the Library does.

  1. You may copy and distribute verbatim copies of the Library's

complete source code as you receive it, in any medium, provided that

you conspicuously and appropriately publish on each copy an

appropriate copyright notice and disclaimer of warranty; keep intact

all the notices that refer to this License and to the absence of any

warranty; and distribute a copy of this License along with the

Library.

  You may charge a fee for the physical act of transferring a copy,

and you may at your option offer warranty protection in exchange for a

fee.

  2. You may modify your copy or copies of the Library or any portion

of it, thus forming a work based on the Library, and copy and

distribute such modifications or work under the terms of Section 1

above, provided that you also meet all of these conditions:

    a) The modified work must itself be a software library.

    b) You must cause the files modified to carry prominent notices

    stating that you changed the files and the date of any change.

    c) You must cause the whole of the work to be licensed at no

    charge to all third parties under the terms of this License.

    d) If a facility in the modified Library refers to a function or a

    table of data to be supplied by an application program that uses

    the facility, other than as an argument passed when the facility

    is invoked, then you must make a good faith effort to ensure that,

    in the event an application does not supply such function or

    table, the facility still operates, and performs whatever part of

    its purpose remains meaningful.

    (For example, a function in a library to compute square roots has

    a purpose that is entirely well-defined independent of the

    application.  Therefore, Subsection 2d requires that any

    application-supplied function or table used by this function must

    be optional: if the application does not supply it, the square

    root function must still compute square roots.)

These requirements apply to the modified work as a whole.  If

identifiable sections of that work are not derived from the Library,

and can be reasonably considered independent and separate works in

themselves, then this License, and its terms, do not apply to those

sections when you distribute them as separate works.  But when you

distribute the same sections as part of a whole which is a work based

on the Library, the distribution of the whole must be on the terms of

this License, whose permissions for other licensees extend to the

entire whole, and thus to each and every part regardless of who wrote

it.

Thus, it is not the intent of this section to claim rights or contest

your rights to work written entirely by you; rather, the intent is to

exercise the right to control the distribution of derivative or

collective works based on the Library.

In addition, mere aggregation of another work not based on the Library

with the Library (or with a work based on the Library) on a volume of

a storage or distribution medium does not bring the other work under

the scope of this License.

  3. You may opt to apply the terms of the ordinary GNU General Public

License instead of this License to a given copy of the Library.  To do

this, you must alter all the notices that refer to this License, so

that they refer to the ordinary GNU General Public License, version 2,

instead of to this License.  (If a newer version than version 2 of the

ordinary GNU General Public License has appeared, then you can specify

that version instead if you wish.)  Do not make any other change in

these notices.

  Once this change is made in a given copy, it is irreversible for

that copy, so the ordinary GNU General Public License applies to all

subsequent copies and derivative works made from that copy.

  This option is useful when you wish to copy part of the code of

the Library into a program that is not a library.

  4. You may copy and distribute the Library (or a portion or

derivative of it, under Section 2) in object code or executable form

under the terms of Sections 1 and 2 above provided that you accompany

it with the complete corresponding machine-readable source code, which

must be distributed under the terms of Sections 1 and 2 above on a

medium customarily used for software interchange.

  If distribution of object code is made by offering access to copy

from a designated place, then offering equivalent access to copy the

source code from the same place satisfies the requirement to

distribute the source code, even though third parties are not

compelled to copy the source along with the object code.

  5. A program that contains no derivative of any portion of the

Library, but is designed to work with the Library by being compiled or

linked with it, is called a "work that uses the Library".  Such a

work, in isolation, is not a derivative work of the Library, and

therefore falls outside the scope of this License.

  However, linking a "work that uses the Library" with the Library

creates an executable that is a derivative of the Library (because it

contains portions of the Library), rather than a "work that uses the

library".  The executable is therefore covered by this License.

Section 6 states terms for distribution of such executables.

  When a "work that uses the Library" uses material from a header file

that is part of the Library, the object code for the work may be a

derivative work of the Library even though the source code is not.

Whether this is true is especially significant if the work can be

linked without the Library, or if the work is itself a library.  The

threshold for this to be true is not precisely defined by law.

  If such an object file uses only numerical parameters, data

structure layouts and accessors, and small macros and small inline

functions (ten lines or less in length), then the use of the object

file is unrestricted, regardless of whether it is legally a derivative

work.  (Executables containing this object code plus portions of the

Library will still fall under Section 6.)

  Otherwise, if the work is a derivative of the Library, you may

distribute the object code for the work under the terms of Section 6.

Any executables containing that work also fall under Section 6,

whether or not they are linked directly with the Library itself.

  6. As an exception to the Sections above, you may also compile or

link a "work that uses the Library" with the Library to produce a

work containing portions of the Library, and distribute that work

under terms of your choice, provided that the terms permit

modification of the work for the customer's own use and reverse

engineering for debugging such modifications.

  You must give prominent notice with each copy of the work that the

Library is used in it and that the Library and its use are covered by

this License.  You must supply a copy of this License.  If the work

during execution displays copyright notices, you must include the

copyright notice for the Library among them, as well as a reference

directing the user to the copy of this License.  Also, you must do one

of these things:

    a) Accompany the work with the complete corresponding

    machine-readable source code for the Library including whatever

    changes were used in the work (which must be distributed under

    Sections 1 and 2 above); and, if the work is an executable linked

    with the Library, with the complete machine-readable "work that

    uses the Library", as object code and/or source code, so that the

    user can modify the Library and then relink to produce a modified

    executable containing the modified Library.  (It is understood

    that the user who changes the contents of definitions files in the

    Library will not necessarily be able to recompile the application

    to use the modified definitions.)

    b) Accompany the work with a written offer, valid for at

    least three years, to give the same user the materials

    specified in Subsection 6a, above, for a charge no more

    than the cost of performing this distribution.

    c) If distribution of the work is made by offering access to copy

    from a designated place, offer equivalent access to copy the above

    specified materials from the same place.

    d) Verify that the user has already received a copy of these

    materials or that you have already sent this user a copy.

  For an executable, the required form of the "work that uses the

Library" must include any data and utility programs needed for

reproducing the executable from it.  However, as a special exception,

the source code distributed need not include anything that is normally

distributed (in either source or binary form) with the major

components (compiler, kernel, and so on) of the operating system on

which the executable runs, unless that component itself accompanies

the executable.

  It may happen that this requirement contradicts the license

restrictions of other proprietary libraries that do not normally

accompany the operating system.  Such a contradiction means you cannot

use both them and the Library together in an executable that you

distribute.

  7. You may place library facilities that are a work based on the

Library side-by-side in a single library together with other library

facilities not covered by this License, and distribute such a combined

library, provided that the separate distribution of the work based on

the Library and of the other library facilities is otherwise

permitted, and provided that you do these two things:

    a) Accompany the combined library with a copy of the same work

    based on the Library, uncombined with any other library

    facilities.  This must be distributed under the terms of the

    Sections above.

    b) Give prominent notice with the combined library of the fact

    that part of it is a work based on the Library, and explaining

    where to find the accompanying uncombined form of the same work.

  8. You may not copy, modify, sublicense, link with, or distribute

the Library except as expressly provided under this License.  Any

attempt otherwise to copy, modify, sublicense, link with, or

distribute the Library is void, and will automatically terminate your

rights under this License.  However, parties who have received copies,

or rights, from you under this License will not have their licenses

terminated so long as such parties remain in full compliance.

  9. You are not required to accept this License, since you have not

signed it.  However, nothing else grants you permission to modify or

distribute the Library or its derivative works.  These actions are

prohibited by law if you do not accept this License.  Therefore, by

modifying or distributing the Library (or any work based on the

Library), you indicate your acceptance of this License to do so, and

all its terms and conditions for copying, distributing or modifying

the Library or works based on it.

  10. Each time you redistribute the Library (or any work based on the

Library), the recipient automatically receives a license from the

original licensor to copy, distribute, link with or modify the Library

subject to these terms and conditions.  You may not impose any further

restrictions on the recipients' exercise of the rights granted herein.

You are not responsible for enforcing compliance by third parties to

this License.

  11. If, as a consequence of a court judgment or allegation of patent

infringement or for any other reason (not limited to patent issues),

conditions are imposed on you (whether by court order, agreement or

otherwise) that contradict the conditions of this License, they do not

excuse you from the conditions of this License.  If you cannot

distribute so as to satisfy simultaneously your obligations under this

License and any other pertinent obligations, then as a consequence you

may not distribute the Library at all.  For example, if a patent

license would not permit royalty-free redistribution of the Library by

all those who receive copies directly or indirectly through you, then

the only way you could satisfy both it and this License would be to

refrain entirely from distribution of the Library.

If any portion of this section is held invalid or unenforceable under any

particular circumstance, the balance of the section is intended to apply,

and the section as a whole is intended to apply in other circumstances.

It is not the purpose of this section to induce you to infringe any

patents or other property right claims or to contest validity of any

such claims; this section has the sole purpose of protecting the

integrity of the free software distribution system which is

implemented by public license practices.  Many people have made

generous contributions to the wide range of software distributed

through that system in reliance on consistent application of that

system; it is up to the author/donor to decide if he or she is willing

to distribute software through any other system and a licensee cannot

impose that choice.

This section is intended to make thoroughly clear what is believed to

be a consequence of the rest of this License.

  12. If the distribution and/or use of the Library is restricted in

certain countries either by patents or by copyrighted interfaces, the

original copyright holder who places the Library under this License may add

an explicit geographical distribution limitation excluding those countries,

so that distribution is permitted only in or among countries not thus

excluded.  In such case, this License incorporates the limitation as if

written in the body of this License.

  13. The Free Software Foundation may publish revised and/or new

versions of the Library General Public License from time to time.

Such new versions will be similar in spirit to the present version,

but may differ in detail to address new problems or concerns.

Each version is given a distinguishing version number.  If the Library

specifies a version number of this License which applies to it and

"any later version", you have the option of following the terms and

conditions either of that version or of any later version published by

the Free Software Foundation.  If the Library does not specify a

license version number, you may choose any version ever published by

the Free Software Foundation.

  14. If you wish to incorporate parts of the Library into other free

programs whose distribution conditions are incompatible with these,

write to the author to ask for permission.  For software which is

copyrighted by the Free Software Foundation, write to the Free

Software Foundation; we sometimes make exceptions for this.  Our

decision will be guided by the two goals of preserving the free status

of all derivatives of our free software and of promoting the sharing

and reuse of software generally.

			    NO WARRANTY

  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO

WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.

EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR

OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY

KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE

IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE

LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME

THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.

  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN

WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY

AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU

FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR

CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE

LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING

RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A

FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF

SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH

DAMAGES.

		     END OF TERMS AND CONDITIONS

     Appendix: How to Apply These Terms to Your New Libraries

  If you develop a new library, and you want it to be of the greatest

possible use to the public, we recommend making it free software that

everyone can redistribute and change.  You can do so by permitting

redistribution under these terms (or, alternatively, under the terms of the

ordinary General Public License).

  To apply these terms, attach the following notices to the library.  It is

safest to attach them to the start of each source file to most effectively

convey the exclusion of warranty; and each file should have at least the

"copyright" line and a pointer to where the full notice is found.

    <one line to give the library's name and a brief idea of what it does.>

    Copyright (C) <year>  <name of author>

    This library is free software; you can redistribute it and/or

    modify it under the terms of the GNU Library General Public

    License as published by the Free Software Foundation; either

    version 2 of the License, or (at your option) any later version.

    This library 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

    Library General Public License for more details.

    You should have received a copy of the GNU Library General Public

    License along with this library; if not, write to the Free

    Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

Also add information on how to contact you by electronic and paper mail.

You should also get your employer (if you work as a programmer) or your

school, if any, to sign a "copyright disclaimer" for the library, if

necessary.  Here is a sample; alter the names:

  Yoyodyne, Inc., hereby disclaims all copyright interest in the

  library `Frob' (a library for tweaking knobs) written by James Random Hacker.

  <signature of Ty Coon>, 1 April 1990

  Ty Coon, President of Vice

That's all there is to it!

CFLAGS=-Wall -O2 -g

LDFLAGS=-g

DEFINES=-D_GNU_SOURCE -DGEMU -DDOSEMU #-DNO_TRACE_MSGS

OBJS= i386/fp87.o i386/interp_main.o i386/interp_modrm.o i386/interp_16_32.o \

      i386/interp_32_16.o i386/interp_32_32.o i386/emu-utils.o \

      i386/dis8086.o i386/emu-ldt.o

OBJS+= elfload.o main.o thunk.o syscall.o

SRCS = $(OBJS:.o=.c)

all: gemu

gemu: $(OBJS)

	$(CC) -Wl,-T,i386.ld $(LDFLAGS) -o $@ $(OBJS)

depend: $(SRCS)

	$(CC) -MM $(CFLAGS) $^ 1>.depend

%.o: %.c

	$(CC) $(CFLAGS) $(DEFINES) -c -o $@ $<

clean:

	rm -f *.o *~ i386/*.o i386/*~ gemu hello test1 test2 TAGS

hello: hello.c

	$(CC) -nostdlib $(CFLAGS) -static $(LDFLAGS) -o $@ $<

test1: test1.c

	$(CC) $(CFLAGS) -static $(LDFLAGS) -o $@ $<

test2: test2.c

	$(CC) $(CFLAGS) -static $(LDFLAGS) -o $@ $<

ifneq ($(wildcard .depend),)

include .depend

endif

- swap all elf paramters

- fix printf for doubles (fp87.c bug ?)

/*

 * ELF register definitions..

 */

#include <inttypes.h>

typedef uint32_t  elf_greg_t;

#define ELF_NGREG (sizeof (struct pt_regs) / sizeof(elf_greg_t))

typedef elf_greg_t elf_gregset_t[ELF_NGREG];

typedef struct user_i387_struct elf_fpregset_t;

/*

 * This is used to ensure we don't load something for the wrong architecture.

 */

#define elf_check_arch(x) ( ((x) == EM_386) || ((x) == EM_486) )

/*

 * These are used to set parameters in the core dumps.

 */

#define ELF_CLASS	ELFCLASS32

#define ELF_DATA	ELFDATA2LSB;

#define ELF_ARCH	EM_386

	/* SVR4/i386 ABI (pages 3-31, 3-32) says that when the program

	   starts %edx contains a pointer to a function which might be

	   registered using `atexit'.  This provides a mean for the

	   dynamic linker to call DT_FINI functions for shared libraries

	   that have been loaded before the code runs.

	   A value of 0 tells we have no such handler.  */

#define ELF_PLAT_INIT(_r)	_r->edx = 0

#define USE_ELF_CORE_DUMP

#define ELF_EXEC_PAGESIZE	4096

typedef uint32_t	 Elf32_Addr;

typedef uint16_t Elf32_Half;

typedef uint32_t Elf32_Off;

typedef int32_t  Elf32_Sword;

typedef uint32_t Elf32_Word;

/* These constants are for the segment types stored in the image headers */

#define PT_NULL    0

#define PT_LOAD    1

#define PT_DYNAMIC 2

#define PT_INTERP  3

#define PT_NOTE    4

#define PT_SHLIB   5

#define PT_PHDR    6

#define PT_LOPROC  0x70000000

#define PT_HIPROC  0x7fffffff

/* These constants define the different elf file types */

#define ET_NONE   0

#define ET_REL    1

#define ET_EXEC   2

#define ET_DYN    3

#define ET_CORE   4

#define ET_LOPROC 5

#define ET_HIPROC 6

/* These constants define the various ELF target machines */

#define EM_NONE  0

#define EM_M32   1

#define EM_SPARC 2

#define EM_386   3

#define EM_68K   4

#define EM_88K   5

#define EM_486   6   /* Perhaps disused */

#define EM_860   7

#define EM_MIPS		8	/* MIPS R3000 (officially, big-endian only) */

#define EM_MIPS_RS4_BE 10	/* MIPS R4000 big-endian */

#define EM_SPARC64     11	/* SPARC v9 (not official) 64-bit */

#define EM_PARISC      15	/* HPPA */

#define EM_SPARC32PLUS 18	/* Sun's "v8plus" */

#define EM_PPC	       20	/* PowerPC */

/*

 * This is an interim value that we will use until the committee comes

 * up with a final number.

 */

#define EM_ALPHA	0x9026

/* This is the info that is needed to parse the dynamic section of the file */

#define DT_NULL		0

#define DT_NEEDED	1

#define DT_PLTRELSZ	2

#define DT_PLTGOT	3

#define DT_HASH		4

#define DT_STRTAB	5

#define DT_SYMTAB	6

#define DT_RELA		7

#define DT_RELASZ	8

#define DT_RELAENT	9

#define DT_STRSZ	10

#define DT_SYMENT	11

#define DT_INIT		12

#define DT_FINI		13

#define DT_SONAME	14

#define DT_RPATH 	15

#define DT_SYMBOLIC	16

#define DT_REL	        17

#define DT_RELSZ	18

#define DT_RELENT	19

#define DT_PLTREL	20

#define DT_DEBUG	21

#define DT_TEXTREL	22

#define DT_JMPREL	23

#define DT_LOPROC	0x70000000

#define DT_HIPROC	0x7fffffff

/* This info is needed when parsing the symbol table */

#define STB_LOCAL  0

#define STB_GLOBAL 1

#define STB_WEAK   2

#define STT_NOTYPE  0

#define STT_OBJECT  1

#define STT_FUNC    2

#define STT_SECTION 3

#define STT_FILE    4

#define ELF32_ST_BIND(x) ((x) >> 4)

#define ELF32_ST_TYPE(x) (((unsigned int) x) & 0xf)

/* Symbolic values for the entries in the auxiliary table

   put on the initial stack */

#define AT_NULL   0	/* end of vector */

#define AT_IGNORE 1	/* entry should be ignored */

#define AT_EXECFD 2	/* file descriptor of program */

#define AT_PHDR   3	/* program headers for program */

#define AT_PHENT  4	/* size of program header entry */

#define AT_PHNUM  5	/* number of program headers */

#define AT_PAGESZ 6	/* system page size */

#define AT_BASE   7	/* base address of interpreter */

#define AT_FLAGS  8	/* flags */

#define AT_ENTRY  9	/* entry point of program */

#define AT_NOTELF 10	/* program is not ELF */

#define AT_UID    11	/* real uid */

#define AT_EUID   12	/* effective uid */

#define AT_GID    13	/* real gid */

#define AT_EGID   14	/* effective gid */

typedef struct dynamic{

  Elf32_Sword d_tag;

  union{

    Elf32_Sword	d_val;

    Elf32_Addr	d_ptr;

  } d_un;

} Elf32_Dyn;

typedef struct {

  unsigned long long d_tag;		/* entry tag value */

  union {

    unsigned long long d_val;

    unsigned long long d_ptr;

  } d_un;

} Elf64_Dyn;

/* The following are used with relocations */

#define ELF32_R_SYM(x) ((x) >> 8)

#define ELF32_R_TYPE(x) ((x) & 0xff)

#define R_386_NONE	0

#define R_386_32	1

#define R_386_PC32	2

#define R_386_GOT32	3

#define R_386_PLT32	4

#define R_386_COPY	5

#define R_386_GLOB_DAT	6

#define R_386_JMP_SLOT	7

#define R_386_RELATIVE	8

#define R_386_GOTOFF	9

#define R_386_GOTPC	10

#define R_386_NUM	11

typedef struct elf32_rel {

  Elf32_Addr	r_offset;

  Elf32_Word	r_info;

} Elf32_Rel;

typedef struct elf64_rel {

  unsigned long long r_offset;	/* Location at which to apply the action */

  unsigned long long r_info;	/* index and type of relocation */

} Elf64_Rel;

typedef struct elf32_rela{

  Elf32_Addr	r_offset;

  Elf32_Word	r_info;

  Elf32_Sword	r_addend;

} Elf32_Rela;

typedef struct elf64_rela {

  unsigned long long r_offset;	/* Location at which to apply the action */

  unsigned long long r_info;	/* index and type of relocation */

  unsigned long long r_addend;	/* Constant addend used to compute value */

} Elf64_Rela;

typedef struct elf32_sym{

  Elf32_Word	st_name;

  Elf32_Addr	st_value;

  Elf32_Word	st_size;

  unsigned char	st_info;

  unsigned char	st_other;

  Elf32_Half	st_shndx;

} Elf32_Sym;

typedef struct elf64_sym {

  unsigned int	st_name;		/* Symbol name, index in string tbl */

  unsigned char	st_info;		/* Type and binding attributes */

  unsigned char	st_other;		/* No defined meaning, 0 */

  unsigned short st_shndx;		/* Associated section index */

  unsigned long long st_value;		/* Value of the symbol */

  unsigned long long st_size;		/* Associated symbol size */

} Elf64_Sym;

#define EI_NIDENT	16

typedef struct elf32_hdr{

  unsigned char	e_ident[EI_NIDENT];

  Elf32_Half	e_type;

  Elf32_Half	e_machine;

  Elf32_Word	e_version;

  Elf32_Addr	e_entry;  /* Entry point */

  Elf32_Off	e_phoff;

  Elf32_Off	e_shoff;

  Elf32_Word	e_flags;

  Elf32_Half	e_ehsize;

  Elf32_Half	e_phentsize;

  Elf32_Half	e_phnum;

  Elf32_Half	e_shentsize;

  Elf32_Half	e_shnum;

  Elf32_Half	e_shstrndx;

} Elf32_Ehdr;

typedef struct elf64_hdr {

  unsigned char	e_ident[16];		/* ELF "magic number" */

  short int e_type;

  short unsigned int e_machine;

  int   e_version;

  unsigned long long e_entry;		/* Entry point virtual address */

  unsigned long long e_phoff;		/* Program header table file offset */

  unsigned long long e_shoff;		/* Section header table file offset */

  int   e_flags;

  short int e_ehsize;

  short int e_phentsize;

  short int e_phnum;

  short int e_shentsize;

  short int e_shnum;

  short int e_shstrndx;

} Elf64_Ehdr;

/* These constants define the permissions on sections in the program

   header, p_flags. */

#define PF_R		0x4

#define PF_W		0x2

#define PF_X		0x1

typedef struct elf32_phdr{

  Elf32_Word	p_type;

  Elf32_Off	p_offset;

  Elf32_Addr	p_vaddr;

  Elf32_Addr	p_paddr;

  Elf32_Word	p_filesz;

  Elf32_Word	p_memsz;

  Elf32_Word	p_flags;

  Elf32_Word	p_align;

} Elf32_Phdr;

typedef struct elf64_phdr {

  int p_type;

  int p_flags;

  unsigned long long p_offset;		/* Segment file offset */

  unsigned long long p_vaddr;		/* Segment virtual address */

  unsigned long long p_paddr;		/* Segment physical address */

  unsigned long long p_filesz;		/* Segment size in file */

  unsigned long long p_memsz;		/* Segment size in memory */

  unsigned long long p_align;		/* Segment alignment, file & memory */

} Elf64_Phdr;

/* sh_type */

#define SHT_NULL	0

#define SHT_PROGBITS	1

#define SHT_SYMTAB	2

#define SHT_STRTAB	3

#define SHT_RELA	4

#define SHT_HASH	5

#define SHT_DYNAMIC	6

#define SHT_NOTE	7

#define SHT_NOBITS	8

#define SHT_REL		9

#define SHT_SHLIB	10

#define SHT_DYNSYM	11

#define SHT_NUM		12

#define SHT_LOPROC	0x70000000

#define SHT_HIPROC	0x7fffffff

#define SHT_LOUSER	0x80000000

#define SHT_HIUSER	0xffffffff

/* sh_flags */

#define SHF_WRITE	0x1

#define SHF_ALLOC	0x2

#define SHF_EXECINSTR	0x4

#define SHF_MASKPROC	0xf0000000

/* special section indexes */

#define SHN_UNDEF	0

#define SHN_LORESERVE	0xff00

#define SHN_LOPROC	0xff00

#define SHN_HIPROC	0xff1f

#define SHN_ABS		0xfff1

#define SHN_COMMON	0xfff2

#define SHN_HIRESERVE	0xffff

typedef struct {

  Elf32_Word	sh_name;

  Elf32_Word	sh_type;

  Elf32_Word	sh_flags;

  Elf32_Addr	sh_addr;

  Elf32_Off	sh_offset;

  Elf32_Word	sh_size;

  Elf32_Word	sh_link;

  Elf32_Word	sh_info;

  Elf32_Word	sh_addralign;

  Elf32_Word	sh_entsize;

} Elf32_Shdr;

typedef struct elf64_shdr {

  unsigned int	sh_name;		/* Section name, index in string tbl */

  unsigned int	sh_type;		/* Type of section */

  unsigned long long sh_flags;		/* Miscellaneous section attributes */

  unsigned long long sh_addr;		/* Section virtual addr at execution */

  unsigned long long sh_offset;		/* Section file offset */

  unsigned long long sh_size;		/* Size of section in bytes */

  unsigned int	sh_link;		/* Index of another section */

  unsigned int	sh_info;		/* Additional section information */

  unsigned long long sh_addralign;	/* Section alignment */

  unsigned long long sh_entsize;	/* Entry size if section holds table */

} Elf64_Shdr;

#define	EI_MAG0		0		/* e_ident[] indexes */

#define	EI_MAG1		1

#define	EI_MAG2		2

#define	EI_MAG3		3

#define	EI_CLASS	4

#define	EI_DATA		5

#define	EI_VERSION	6

#define	EI_PAD		7

#define	ELFMAG0		0x7f		/* EI_MAG */

#define	ELFMAG1		'E'

#define	ELFMAG2		'L'

#define	ELFMAG3		'F'

#define	ELFMAG		"\177ELF"

#define	SELFMAG		4

#define	ELFCLASSNONE	0		/* EI_CLASS */

#define	ELFCLASS32	1

#define	ELFCLASS64	2

#define	ELFCLASSNUM	3

#define ELFDATANONE	0		/* e_ident[EI_DATA] */

#define ELFDATA2LSB	1

#define ELFDATA2MSB	2

#define EV_NONE		0		/* e_version, EI_VERSION */

#define EV_CURRENT	1

#define EV_NUM		2

/* Notes used in ET_CORE */

#define NT_PRSTATUS	1

#define NT_PRFPREG	2

#define NT_PRPSINFO	3

#define NT_TASKSTRUCT	4

/* Note header in a PT_NOTE section */

typedef struct elf32_note {

  Elf32_Word	n_namesz;	/* Name size */

  Elf32_Word	n_descsz;	/* Content size */

  Elf32_Word	n_type;		/* Content type */

} Elf32_Nhdr;

/* Note header in a PT_NOTE section */

/*

 * For now we use the 32 bit version of the structure until we figure

 * out whether we need anything better.  Note - on the Alpha, "unsigned int"

 * is only 32 bits.

 */

typedef struct elf64_note {

  unsigned int	n_namesz;	/* Name size */

  unsigned int	n_descsz;	/* Content size */

  unsigned int	n_type;		/* Content type */

} Elf64_Nhdr;

#define ELF_START_MMAP 0x80000000

#if ELF_CLASS == ELFCLASS32

extern Elf32_Dyn _DYNAMIC [];

#define elfhdr		elf32_hdr

#define elf_phdr	elf32_phdr

#define elf_note	elf32_note

#else

extern Elf64_Dyn _DYNAMIC [];

#define elfhdr		elf64_hdr

#define elf_phdr	elf64_phdr

#define elf_note	elf64_note

#endif

/* ld script to make i386 Linux kernel

 * Written by Martin Mares <mj@atrey.karlin.mff.cuni.cz>;

 */

OUTPUT_FORMAT("elf32-i386", "elf32-i386", "elf32-i386")

OUTPUT_ARCH(i386)

SEARCH_DIR(/lib); SEARCH_DIR(/usr/lib); SEARCH_DIR(/usr/local/lib); SEARCH_DIR(/usr/alpha-unknown-linux-gnu/lib);

ENTRY(_start)

SECTIONS

{

  /* Read-only sections, merged into text segment: */

  . = 0x60000000 + SIZEOF_HEADERS;

  .interp     : { *(.interp) 	}

  .hash          : { *(.hash)		}

  .dynsym        : { *(.dynsym)		}

  .dynstr        : { *(.dynstr)		}

  .gnu.version   : { *(.gnu.version)	}

  .gnu.version_d   : { *(.gnu.version_d)	}

  .gnu.version_r   : { *(.gnu.version_r)	}

  .rel.text      :

    { *(.rel.text) *(.rel.gnu.linkonce.t*) }

  .rela.text     :

    { *(.rela.text) *(.rela.gnu.linkonce.t*) }

  .rel.data      :

    { *(.rel.data) *(.rel.gnu.linkonce.d*) }

  .rela.data     :

    { *(.rela.data) *(.rela.gnu.linkonce.d*) }

  .rel.rodata    :

    { *(.rel.rodata) *(.rel.gnu.linkonce.r*) }

  .rela.rodata   :

    { *(.rela.rodata) *(.rela.gnu.linkonce.r*) }

  .rel.got       : { *(.rel.got)		}

  .rela.got      : { *(.rela.got)		}

  .rel.ctors     : { *(.rel.ctors)	}

  .rela.ctors    : { *(.rela.ctors)	}

  .rel.dtors     : { *(.rel.dtors)	}

  .rela.dtors    : { *(.rela.dtors)	}

  .rel.init      : { *(.rel.init)	}

  .rela.init     : { *(.rela.init)	}

  .rel.fini      : { *(.rel.fini)	}

  .rela.fini     : { *(.rela.fini)	}

  .rel.bss       : { *(.rel.bss)		}

  .rela.bss      : { *(.rela.bss)		}

  .rel.plt       : { *(.rel.plt)		}

  .rela.plt      : { *(.rela.plt)		}

  .init          : { *(.init)	} =0x47ff041f

  .text      :

  {

    *(.text)

    /* .gnu.warning sections are handled specially by elf32.em.  */

    *(.gnu.warning)

    *(.gnu.linkonce.t*)

  } =0x47ff041f

  _etext = .;

  PROVIDE (etext = .);

  .fini      : { *(.fini)    } =0x47ff041f

  .rodata    : { *(.rodata) *(.gnu.linkonce.r*) }

  .rodata1   : { *(.rodata1) }

  .reginfo : { *(.reginfo) }

  /* Adjust the address for the data segment.  We want to adjust up to

     the same address within the page on the next page up.  */

  . = ALIGN(0x100000) + (. & (0x100000 - 1));

  .data    :

  {

    *(.data)

    *(.gnu.linkonce.d*)

    CONSTRUCTORS

  }

  .data1   : { *(.data1) }

  .ctors         :

  {

    *(.ctors)

  }

  .dtors         :

  {

    *(.dtors)

  }

  .plt      : { *(.plt)	}

  .got           : { *(.got.plt) *(.got) }

  .dynamic       : { *(.dynamic) }

  /* We want the small data sections together, so single-instruction offsets

     can access them all, and initialized data all before uninitialized, so

     we can shorten the on-disk segment size.  */

  .sdata     : { *(.sdata) }

  _edata  =  .;

  PROVIDE (edata = .);

  __bss_start = .;

  .sbss      : { *(.sbss) *(.scommon) }

  .bss       :

  {

   *(.dynbss)

   *(.bss)

   *(COMMON)

  }

  _end = . ;

  PROVIDE (end = .);

  /* Stabs debugging sections.  */

  .stab 0 : { *(.stab) }

  .stabstr 0 : { *(.stabstr) }

  .stab.excl 0 : { *(.stab.excl) }

  .stab.exclstr 0 : { *(.stab.exclstr) }

  .stab.index 0 : { *(.stab.index) }

  .stab.indexstr 0 : { *(.stab.indexstr) }

  .comment 0 : { *(.comment) }

  /* DWARF debug sections.

     Symbols in the DWARF debugging sections are relative to the beginning

     of the section so we begin them at 0.  */

  /* DWARF 1 */

  .debug          0 : { *(.debug) }

  .line           0 : { *(.line) }

  /* GNU DWARF 1 extensions */

  .debug_srcinfo  0 : { *(.debug_srcinfo) }

  .debug_sfnames  0 : { *(.debug_sfnames) }

  /* DWARF 1.1 and DWARF 2 */

  .debug_aranges  0 : { *(.debug_aranges) }

  .debug_pubnames 0 : { *(.debug_pubnames) }

  /* DWARF 2 */

  .debug_info     0 : { *(.debug_info) }

  .debug_abbrev   0 : { *(.debug_abbrev) }

  .debug_line     0 : { *(.debug_line) }

  .debug_frame    0 : { *(.debug_frame) }

  .debug_str      0 : { *(.debug_str) }

  .debug_loc      0 : { *(.debug_loc) }

  .debug_macinfo  0 : { *(.debug_macinfo) }

  /* SGI/MIPS DWARF 2 extensions */

  .debug_weaknames 0 : { *(.debug_weaknames) }

  .debug_funcnames 0 : { *(.debug_funcnames) }

  .debug_typenames 0 : { *(.debug_typenames) }

  .debug_varnames  0 : { *(.debug_varnames) }

  /* These must appear regardless of  .  */

}

/* This is the Linux kernel elf-loading code, ported into user space */

#include <stdio.h>

#include <sys/types.h>

#include <fcntl.h>

#include <sys/stat.h>

#include <errno.h>

#include <unistd.h>

#include <sys/mman.h>

#include <stdlib.h>

#include <string.h>

#include "gemu.h"

#include "linux_bin.h"

#include "elf.h"

#include "segment.h"

/* Necessary parameters */

#define	ALPHA_PAGE_SIZE 4096

#define	X86_PAGE_SIZE 4096

#define ALPHA_PAGE_MASK (~(ALPHA_PAGE_SIZE-1))

#define X86_PAGE_MASK (~(X86_PAGE_SIZE-1))

#define ALPHA_PAGE_ALIGN(addr) ((((addr)+ALPHA_PAGE_SIZE)-1)&ALPHA_PAGE_MASK)

#define X86_PAGE_ALIGN(addr) ((((addr)+X86_PAGE_SIZE)-1)&X86_PAGE_MASK)

#define NGROUPS 32

#define X86_ELF_EXEC_PAGESIZE X86_PAGE_SIZE

#define X86_ELF_PAGESTART(_v) ((_v) & ~(unsigned long)(X86_ELF_EXEC_PAGESIZE-1))

#define X86_ELF_PAGEOFFSET(_v) ((_v) & (X86_ELF_EXEC_PAGESIZE-1))

#define ALPHA_ELF_PAGESTART(_v) ((_v) & ~(unsigned long)(ALPHA_PAGE_SIZE-1))

#define ALPHA_ELF_PAGEOFFSET(_v) ((_v) & (ALPHA_PAGE_SIZE-1))

#define INTERPRETER_NONE 0

#define INTERPRETER_AOUT 1

#define INTERPRETER_ELF 2

#define DLINFO_ITEMS 12

/* Where we find X86 libraries... */

//#define X86_DEFAULT_LIB_DIR	"/usr/x86/"

#define X86_DEFAULT_LIB_DIR	"/"

//extern void * mmap4k();

#define mmap4k(a, b, c, d, e, f) mmap((void *)(a), b, c, d, e, f)

extern unsigned long x86_stack_size;

static int load_aout_interp(void * exptr, int interp_fd);

#ifdef BSWAP_NEEDED

static void bswap_ehdr(Elf32_Ehdr *ehdr)

{

    bswap16s(&ehdr->e_type);			/* Object file type */

    bswap16s(&ehdr->e_machine);		/* Architecture */

    bswap32s(&ehdr->e_version);		/* Object file version */

    bswap32s(&ehdr->e_entry);		/* Entry point virtual address */

    bswap32s(&ehdr->e_phoff);		/* Program header table file offset */

    bswap32s(&ehdr->e_shoff);		/* Section header table file offset */

    bswap32s(&ehdr->e_flags);		/* Processor-specific flags */

    bswap16s(&ehdr->e_ehsize);		/* ELF header size in bytes */

    bswap16s(&ehdr->e_phentsize);		/* Program header table entry size */

    bswap16s(&ehdr->e_phnum);		/* Program header table entry count */

    bswap16s(&ehdr->e_shentsize);		/* Section header table entry size */

    bswap16s(&ehdr->e_shnum);		/* Section header table entry count */

    bswap16s(&ehdr->e_shstrndx);		/* Section header string table index */

}

static void bswap_phdr(Elf32_Phdr *phdr)

{

    bswap32s(&phdr->p_type);			/* Segment type */

    bswap32s(&phdr->p_offset);		/* Segment file offset */

    bswap32s(&phdr->p_vaddr);		/* Segment virtual address */

    bswap32s(&phdr->p_paddr);		/* Segment physical address */

    bswap32s(&phdr->p_filesz);		/* Segment size in file */

    bswap32s(&phdr->p_memsz);		/* Segment size in memory */

    bswap32s(&phdr->p_flags);		/* Segment flags */

    bswap32s(&phdr->p_align);		/* Segment alignment */

}

#endif

static void * get_free_page(void)

{

    void *	retval;

    /* User-space version of kernel get_free_page.  Returns a page-aligned

     * page-sized chunk of memory.

     */

    retval = mmap4k(0, ALPHA_PAGE_SIZE, PROT_READ|PROT_WRITE, 

			MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);

    if((long)retval == -1) {

	perror("get_free_page");

	exit(-1);

    }

    else {

	return(retval);

    }

}

static void free_page(void * pageaddr)

{

    (void)munmap(pageaddr, ALPHA_PAGE_SIZE);

}

/*

 * 'copy_string()' copies argument/envelope strings from user

 * memory to free pages in kernel mem. These are in a format ready

 * to be put directly into the top of new user memory.

 *

 */

static unsigned long copy_strings(int argc,char ** argv,unsigned long *page,

                unsigned long p)

{

    char *tmp, *tmp1, *pag = NULL;

    int len, offset = 0;

    if (!p) {

	return 0;       /* bullet-proofing */

    }

    while (argc-- > 0) {

	if (!(tmp1 = tmp = get_user(argv+argc))) {

	    fprintf(stderr, "VFS: argc is wrong");

	    exit(-1);

	}

	while (get_user(tmp++));

	len = tmp - tmp1;

	if (p < len) {  /* this shouldn't happen - 128kB */

		return 0;

	}

	while (len) {

	    --p; --tmp; --len;

	    if (--offset < 0) {

		offset = p % X86_PAGE_SIZE;

		if (!(pag = (char *) page[p/X86_PAGE_SIZE]) &&

		    !(pag = (char *) page[p/X86_PAGE_SIZE] =

		      (unsigned long *) get_free_page())) {

			return 0;

		}

	    }

	    if (len == 0 || offset == 0) {

	        *(pag + offset) = get_user(tmp);

	    }

	    else {

	      int bytes_to_copy = (len > offset) ? offset : len;

	      tmp -= bytes_to_copy;

	      p -= bytes_to_copy;

	      offset -= bytes_to_copy;

	      len -= bytes_to_copy;

	      memcpy_fromfs(pag + offset, tmp, bytes_to_copy + 1);

	    }

	}

    }

    return p;

}

static int in_group_p(gid_t g)

{

    /* return TRUE if we're in the specified group, FALSE otherwise */

    int		ngroup;

    int		i;

    gid_t	grouplist[NGROUPS];

    ngroup = getgroups(NGROUPS, grouplist);

    for(i = 0; i < ngroup; i++) {

	if(grouplist[i] == g) {

	    return 1;

	}

    }

    return 0;

}

static int count(char ** vec)

{

    int		i;

    for(i = 0; *vec; i++) {

        vec++;

    }

    return(i);

}

static int prepare_binprm(struct linux_binprm *bprm)

{

    struct stat		st;

    int mode;

    int retval, id_change;

    if(fstat(bprm->fd, &st) < 0) {

	return(-errno);

    }

    mode = st.st_mode;

    if(!S_ISREG(mode)) {	/* Must be regular file */

	return(-EACCES);

    }

    if(!(mode & 0111)) {	/* Must have at least one execute bit set */

	return(-EACCES);

    }

    bprm->e_uid = geteuid();

    bprm->e_gid = getegid();

    id_change = 0;

    /* Set-uid? */

    if(mode & S_ISUID) {

    	bprm->e_uid = st.st_uid;

	if(bprm->e_uid != geteuid()) {

	    id_change = 1;

	}

    }

    /* Set-gid? */

    /*

     * If setgid is set but no group execute bit then this

     * is a candidate for mandatory locking, not a setgid

     * executable.

     */

    if ((mode & (S_ISGID | S_IXGRP)) == (S_ISGID | S_IXGRP)) {

	bprm->e_gid = st.st_gid;

	if (!in_group_p(bprm->e_gid)) {

		id_change = 1;

	}

    }

    memset(bprm->buf, 0, sizeof(bprm->buf));

    retval = lseek(bprm->fd, 0L, SEEK_SET);

    if(retval >= 0) {

        retval = read(bprm->fd, bprm->buf, 128);

    }

    if(retval < 0) {

	perror("prepare_binprm");

	exit(-1);

	/* return(-errno); */

    }

    else {

	return(retval);

    }

}

unsigned long setup_arg_pages(unsigned long p, struct linux_binprm * bprm,

						struct image_info * info)

{

    unsigned long stack_base;

    int i;

    extern unsigned long stktop;

    stack_base = X86_STACK_TOP - MAX_ARG_PAGES*X86_PAGE_SIZE;

    p += stack_base;

    if (bprm->loader) {

	bprm->loader += stack_base;

    }

    bprm->exec += stack_base;

    /* Create enough stack to hold everything.  If we don't use

     * it for args, we'll use it for something else...

     */

    if(x86_stack_size >  MAX_ARG_PAGES*X86_PAGE_SIZE) {

        if((long)mmap4k((void *)(X86_STACK_TOP-x86_stack_size), x86_stack_size + X86_PAGE_SIZE,

    		     PROT_READ | PROT_WRITE,

		     MAP_GROWSDOWN | MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS, -1, 0) == -1) {

	    perror("stk mmap");

	    exit(-1);

	}

    }

    else {

        if((long)mmap4k((void *)stack_base, (MAX_ARG_PAGES+1)*X86_PAGE_SIZE,

    		     PROT_READ | PROT_WRITE,

		     MAP_GROWSDOWN | MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS, -1, 0) == -1) {

	    perror("stk mmap");

	    exit(-1);

	}

    }

    stktop = stack_base;

    for (i = 0 ; i < MAX_ARG_PAGES ; i++) {

	if (bprm->page[i]) {

	    info->rss++;

	    memcpy((void *)stack_base, (void *)bprm->page[i], X86_PAGE_SIZE);

	    free_page((void *)bprm->page[i]);

	}

	stack_base += X86_PAGE_SIZE;

    }

    return p;

}

static void set_brk(unsigned long start, unsigned long end)

{

	/* page-align the start and end addresses... */

        start = ALPHA_PAGE_ALIGN(start);

        end = ALPHA_PAGE_ALIGN(end);

        if (end <= start)

                return;

        if((long)mmap4k(start, end - start,

                PROT_READ | PROT_WRITE | PROT_EXEC,

                MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS, -1, 0) == -1) {

	    perror("cannot mmap brk");

	    exit(-1);

	}

}

/* We need to explicitly zero any fractional pages

   after the data section (i.e. bss).  This would

   contain the junk from the file that should not

   be in memory */

static void padzero(unsigned long elf_bss)

{

        unsigned long nbyte;

        char * fpnt;

        nbyte = elf_bss & (ALPHA_PAGE_SIZE-1);	/* was X86_PAGE_SIZE - JRP */

        if (nbyte) {

	    nbyte = ALPHA_PAGE_SIZE - nbyte;

	    fpnt = (char *) elf_bss;

	    do {

		*fpnt++ = 0;

	    } while (--nbyte);

        }

}

static unsigned int * create_elf_tables(char *p, int argc, int envc,

                                  struct elfhdr * exec,

                                  unsigned long load_addr,

                                  unsigned long interp_load_addr, int ibcs,

				  struct image_info *info)

{

        unsigned int *argv, *envp, *dlinfo;

        unsigned int *sp;

	char **alpha_envp;

        /*

         * Force 16 byte alignment here for generality.

         */

        sp = (unsigned int *) (~15UL & (unsigned long) p);

        sp -= exec ? DLINFO_ITEMS*2 : 2;

        dlinfo = sp;

        sp -= envc+1;

        envp = sp;

        sp -= argc+1;

        argv = sp;

        if (!ibcs) {

                put_user(envp,--sp);

                put_user(argv,--sp);

        }

	alpha_envp = (char **)malloc((envc+1) * sizeof(char *));