ldmud-3.2.9/doc/
ldmud-3.2.9/doc/efun/
ldmud-3.2.9/mud/
ldmud-3.2.9/mud/heaven7/
ldmud-3.2.9/mud/heaven7/lib/
ldmud-3.2.9/mud/lp-245/
ldmud-3.2.9/mud/lp-245/banish/
ldmud-3.2.9/mud/lp-245/doc/
ldmud-3.2.9/mud/lp-245/doc/examples/
ldmud-3.2.9/mud/lp-245/doc/sefun/
ldmud-3.2.9/mud/lp-245/log/
ldmud-3.2.9/mud/lp-245/obj/Go/
ldmud-3.2.9/mud/lp-245/players/lars/
ldmud-3.2.9/mud/lp-245/room/death/
ldmud-3.2.9/mud/lp-245/room/maze1/
ldmud-3.2.9/mud/lp-245/room/sub/
ldmud-3.2.9/mud/lp-245/secure/
ldmud-3.2.9/mud/morgengrauen/
ldmud-3.2.9/mud/morgengrauen/lib/
ldmud-3.2.9/mud/sticklib/
ldmud-3.2.9/mud/sticklib/src/
ldmud-3.2.9/mudlib/uni-crasher/
ldmud-3.2.9/pkg/
ldmud-3.2.9/pkg/debugger/
ldmud-3.2.9/pkg/diff/
ldmud-3.2.9/pkg/misc/
ldmud-3.2.9/src/autoconf/
ldmud-3.2.9/src/bugs/
ldmud-3.2.9/src/bugs/MudCompress/
ldmud-3.2.9/src/bugs/b-020916-files/
ldmud-3.2.9/src/bugs/doomdark/
ldmud-3.2.9/src/bugs/ferrycode/ferry/
ldmud-3.2.9/src/bugs/ferrycode/obj/
ldmud-3.2.9/src/bugs/psql/
ldmud-3.2.9/src/done/
ldmud-3.2.9/src/done/order_alist/
ldmud-3.2.9/src/done/order_alist/obj/
ldmud-3.2.9/src/done/order_alist/room/
ldmud-3.2.9/src/gcc/
ldmud-3.2.9/src/gcc/2.7.0/
ldmud-3.2.9/src/gcc/2.7.1/
ldmud-3.2.9/src/hosts/
ldmud-3.2.9/src/hosts/GnuWin32/
ldmud-3.2.9/src/hosts/amiga/NetIncl/
ldmud-3.2.9/src/hosts/amiga/NetIncl/netinet/
ldmud-3.2.9/src/hosts/amiga/NetIncl/sys/
ldmud-3.2.9/src/hosts/i386/
ldmud-3.2.9/src/hosts/msdos/byacc/
ldmud-3.2.9/src/hosts/msdos/doc/
ldmud-3.2.9/src/hosts/os2/
ldmud-3.2.9/src/hosts/win32/
ldmud-3.2.9/src/util/
ldmud-3.2.9/src/util/erq/
ldmud-3.2.9/src/util/indent/hosts/next/
ldmud-3.2.9/src/util/xerq/
ldmud-3.2.9/src/util/xerq/lpc/
ldmud-3.2.9/src/util/xerq/lpc/www/
 - Use the "Don't stop the Bibop" allocator with GC, in conjuntion with
   C++.

 - NOn-shared strings should be refcounted in order to implement
   copy-on-write. At the moment, the strings are copied with every
   assignment of svalue :-( See MudOS.

 - A temporary malloc (scratchpad) to reduce fragementation and
   number of free()s. See MudOS.

 - It is tempting to put flags into bitfields (like the flags describing
   lfuns), but that has two disadvantages:
     + Depending on the compiler, the code can be really bad. Some compiler
       are smart enough to use AND and OR, others shift like mad.
     + Flagwords with variant fields can't be implemented reliably.
       Imagine a structure like this:
         struct flags { union {
           struct var1 { int common_flags : 2; int special_flags : 3; } v1;
           struct var2 { int common_flags : 2; int offset : 3; } v2;
         }}
       While the idea is that common_flags determine which variant this
       flagword is, the standard does not guarantee that the two common_flags
       fields are put into the same bits of the whole structure.
       And as this is the only way to get variant packed bitfields without
       any unwanted alignment, the whole idea dies at this point.

   Hmm, if the flags are defined as unsigned char, the generated code is good.
   We just have to add a runtime test to see if the layout is ok.
   Test the following on PPC:

struct {
  unsigned char flag1 : 1;
  unsigned char flag2 : 1;
} flags;

void foo (void) {
  extern int i;

  if (flags.flag2)
    i = 1;
}

   x86-gcc produces:

	.file	"xxx.c"
/ GNU C version egcs-2.90.27 980315 (egcs-1.0.2 release) (i386-cygwin32) compiled by GNU C version egcs-2.90.27 980315 (egcs-1.0.2 release).
/ options passed:
/ options enabled:  -fpeephole -ffunction-cse -fkeep-static-consts
/ -fpcc-struct-return -fsjlj-exceptions -fcommon -fverbose-asm -fgnu-linker
/ -fargument-alias -m80387 -mhard-float -mno-soft-float -mieee-fp
/ -mfp-ret-in-387 -mschedule-prologue -mstack-arg-probe -mcpu=i386
/ -march=pentium

gcc2_compiled.:
___gnu_compiled_c:
.text
	.align 4
.globl _foo
_foo:
	pushl %ebp
	movl %esp,%ebp
	movb _flags,%al
	andb $2,%al
	testb %al,%al
	je L2
	movl $1,_i
L2:
L1:
	leave
	ret
.comm _flags,4