cvs commit: parrot chartype.c datatypes.c disassemble.c dod.c encoding.c global (fwd)

FYI- I just re-indented a bunch of code, using the tools/dev/run_indent.p=
l =

script.

--Josh


------- Forwarded Message

Date:    02 Nov 2002 14:57:48 +0000
From:    josh@cvs.perl.org
To:      cvs-public-parrot@perl.org
Subject: cvs commit: parrot chartype.c datatypes.c disassemble.c dod.c en=
coding
	  .c global_setup.c hash.c jit.c key.c method_util.c misc.c packdump.c =

	  packout.c pdb.c pdump.c pmc.c pxs.c register.c res_lea.c resources.c =

	  runops_cores.c rx.c rxstacks.c spf_render.c spf_vtable.c stacks.c str
	  ing.c sub.c warnings.c

cvsuser     02/11/02 06:57:48

  Modified:    .        chartype.c datatypes.c disassemble.c dod.c
                        encoding.c global_setup.c hash.c jit.c key.c
                        method_util.c misc.c packdump.c packout.c pdb.c
                        pdump.c pmc.c pxs.c register.c res_lea.c
                        resources.c runops_cores.c rx.c rxstacks.c
                        spf_render.c spf_vtable.c stacks.c string.c sub.c=

                        warnings.c
  Log:
  large-scale reindenting (run_indent.pl)
  =

  Revision  Changes    Path
  1.8       +2 -2      parrot/chartype.c
  =

  Index: chartype.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/chartype.c,v
  retrieving revision 1.7
  retrieving revision 1.8
  diff -u -w -r1.7 -r1.8
  --- chartype.c	18 Jul 2002 04:29:39 -0000	1.7
  +++ chartype.c	2 Nov 2002 14:57:47 -0000	1.8
  @@ -1,7 +1,7 @@
   /* chartype.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: chartype.c,v 1.7 2002/07/18 04:29:39 mongo Exp $
  + *     $Id: chartype.c,v 1.8 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     This defines the string character type subsystem
    *  Data Structure and Algorithms:
  =

  =

  =

  1.3       +7 -7      parrot/datatypes.c
  =

  Index: datatypes.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/datatypes.c,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -w -r1.2 -r1.3
  --- datatypes.c	28 Oct 2002 13:58:36 -0000	1.2
  +++ datatypes.c	2 Nov 2002 14:57:47 -0000	1.3
  @@ -3,7 +3,7 @@
    *  Copyright: (c) 2002 Leopold Toetsch <lt@toetsch.at>
    *  License:  Artistic/GPL, see README and LICENSES for details
    *  CVS Info
  - *     $Id: datatypes.c,v 1.2 2002/10/28 13:58:36 leo Exp $
  + *     $Id: datatypes.c,v 1.3 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Parrot and native data types functions.
    */
  =

  =

  =

  1.4       +2 -2      parrot/disassemble.c
  =

  Index: disassemble.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/disassemble.c,v
  retrieving revision 1.3
  retrieving revision 1.4
  diff -u -w -r1.3 -r1.4
  --- disassemble.c	17 Aug 2002 01:11:08 -0000	1.3
  +++ disassemble.c	2 Nov 2002 14:57:47 -0000	1.4
  @@ -2,7 +2,7 @@
    * disassemble.c
    *
    * CVS Info
  - *    $Id: disassemble.c,v 1.3 2002/08/17 01:11:08 sfink Exp $
  + *    $Id: disassemble.c,v 1.4 2002/11/02 14:57:47 josh Exp $
    * Overview:
    *    Parrot disassembler
    * History:
  =

  =

  =

  1.26      +69 -72    parrot/dod.c
  =

  Index: dod.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/dod.c,v
  retrieving revision 1.25
  retrieving revision 1.26
  diff -u -w -r1.25 -r1.26
  --- dod.c	28 Oct 2002 13:58:04 -0000	1.25
  +++ dod.c	2 Nov 2002 14:57:47 -0000	1.26
  @@ -1,7 +1,7 @@
   /* dod.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: dod.c,v 1.25 2002/10/28 13:58:04 leo Exp $
  + *     $Id: dod.c,v 1.26 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Handles dead object destruction of the various headers
    *  Data Structure and Algorithms:
  @@ -224,7 +224,8 @@
        * assumption, but it'll do for now */
       for (i =3D 0; i < NUM_REGISTERS; i++) {
           Buffer* reg =3D (Buffer *) interpreter->ctx.string_reg.registe=
rs[i];
  -        if (reg) buffer_lives(interpreter, reg);
  +        if (reg)
  +            buffer_lives(interpreter, reg);
       }
   =

       /* The interpreter has a few strings of its own */
  @@ -243,7 +244,8 @@
           for (j =3D 0; j < cur_chunk->used; j++) {
               for (i =3D 0; i < NUM_REGISTERS; i++) {
                   Buffer* reg =3D (Buffer *) cur_chunk->SReg[j].register=
s[i];
  -                if (reg) buffer_lives(interpreter, reg);
  +                if (reg)
  +                    buffer_lives(interpreter, reg);
               }
           }
       }
  @@ -287,8 +289,7 @@
   =

       /* Run through all the buffer header pools and mark */
       for (cur_arena =3D interpreter->arena_base->pmc_pool->last_Arena;
  -         NULL !=3D cur_arena;
  -         cur_arena =3D cur_arena->prev) {
  +         NULL !=3D cur_arena; cur_arena =3D cur_arena->prev) {
           PMC *pmc_array =3D cur_arena->start_objects;
           for (i =3D 0; i < cur_arena->used; i++) {
               /* If it's not live or on the free list, put it on the fre=
e list
=2E
  @@ -298,9 +299,9 @@
               if (!(pmc_array[i].flags & (PMC_live_FLAG | PMC_on_free_li=
st_FLA
G |
                                          PMC_constant_FLAG))) {
                   add_free_pmc(interpreter,
  -                                interpreter->arena_base->pmc_pool,
  -                                &pmc_array[i]);
  -            } else if(!(pmc_array[i].flags & PMC_on_free_list_FLAG)) {=

  +                             interpreter->arena_base->pmc_pool, &pmc_a=
rray[i
]);
  +            }
  +            else if (!(pmc_array[i].flags & PMC_on_free_list_FLAG)) {
                   total_used++;
                   pmc_array[i].flags &=3D ~PMC_live_FLAG;
                   pmc_array[i].next_for_GC =3D NULL;
  @@ -327,8 +328,7 @@
   #ifdef LEA_DEBUG
       /* check/clear tail, e.g. on changes in string.c or res.c */
       for (cur_arena =3D pool->last_Arena;
  -            NULL !=3D cur_arena;
  -            cur_arena =3D cur_arena->prev) {
  +         NULL !=3D cur_arena; cur_arena =3D cur_arena->prev) {
           b =3D cur_arena->start_objects;
           for (i =3D 0; i < cur_arena->used; i++) {
               if ((b->flags & BUFFER_COW_FLAG) && b->bufstart &&
  @@ -343,8 +343,7 @@
   #endif
   =

       for (cur_arena =3D pool->last_Arena;
  -            NULL !=3D cur_arena;
  -            cur_arena =3D cur_arena->prev) {
  +         NULL !=3D cur_arena; cur_arena =3D cur_arena->prev) {
           b =3D cur_arena->start_objects;
           for (i =3D 0; i < cur_arena->used; i++) {
               if ((b->flags & BUFFER_COW_FLAG) &&
  @@ -381,8 +380,7 @@
   #endif /* GC_IS_MALLOC */
       /* Run through all the buffer header pools and mark */
       for (cur_arena =3D pool->last_Arena;
  -         NULL !=3D cur_arena;
  -         cur_arena =3D cur_arena->prev) {
  +         NULL !=3D cur_arena; cur_arena =3D cur_arena->prev) {
           Buffer *b =3D cur_arena->start_objects;
           for (i =3D 0; i < cur_arena->used; i++) {
   #ifdef GC_IS_MALLOC
  @@ -397,15 +395,12 @@
                * on_free_list and live, because of our conservative stac=
k-walk
                * collection. We must be wary of this case. */
               if (!(b->flags & ( BUFFER_on_free_list_FLAG
  -                             | BUFFER_constant_FLAG
  -                             | BUFFER_live_FLAG )))
  -            {
  +                              | BUFFER_constant_FLAG | BUFFER_live_FLA=
G))) {
   #ifndef GC_IS_MALLOC
                   if (pool->mem_pool) {
                       if (!(b->flags & BUFFER_COW_FLAG)) {
                           ((struct Memory_Pool *)
  -                            pool->mem_pool)->guaranteed_reclaimable +=3D=

  -                                b->buflen;
  +                         pool->mem_pool)->guaranteed_reclaimable +=3D =
b->bufle
n;
                       }
                       ((struct Memory_Pool *)
                           pool->mem_pool)->possibly_reclaimable +=3D b->=
buflen;
  @@ -422,7 +417,8 @@
                   else
   #endif /* GC_IS_MALLOC */
                   add_free_buffer(interpreter, pool, b);
  -            } else if (!(b->flags & BUFFER_on_free_list_FLAG)) {
  +            }
  +            else if (!(b->flags & BUFFER_on_free_list_FLAG)) {
                   total_used++;
               }
   #ifdef GC_IS_MALLOC
  @@ -443,7 +439,8 @@
   =

   /* Find a mask covering the longest common bit-prefix of val1 and val2=
 */
   static size_t
  -find_common_mask(size_t val1, size_t val2){
  +find_common_mask(size_t val1, size_t val2)
  +{
       int i;
       int bound =3D sizeof(size_t) * 8;
   =

  @@ -474,7 +471,8 @@
       size_t pmc_max =3D get_max_pmc_address(interpreter);
   =

       size_t mask =3D find_common_mask(buffer_min < pmc_min ? buffer_min=
: pmc_mi
n,
  -                buffer_max > pmc_max ? buffer_max : pmc_max);
  +                                   buffer_max >
  +                                   pmc_max ? buffer_max : pmc_max);
   =

       /* Get the expected prefix */
       prefix =3D mask & buffer_min;
  @@ -496,15 +494,14 @@
                * a live pmc/buffer, and could very well have its bufstar=
t/vtab
le
                * destroyed due to the linked list of free headers... */
               if (pmc_min <=3D ptr && ptr < pmc_max &&
  -                is_pmc_ptr(interpreter,(void *)ptr))
  -            {
  +                is_pmc_ptr(interpreter, (void *)ptr)) {
                   /* ...so ensure that mark_used checks PMC_on_free_list=
_FLAG
                    * before adding it to the next_for_GC list, to have
                    * vtable->mark() called. */
                   last =3D mark_used((PMC *)ptr, last);
  -            } else if (buffer_min <=3D ptr && ptr < buffer_max &&
  -                is_buffer_ptr(interpreter,(void *)ptr))
  -            {
  +            }
  +            else if (buffer_min <=3D ptr && ptr < buffer_max &&
  +                     is_buffer_ptr(interpreter, (void *)ptr)) {
                   /* ...and since buffer_lives doesn't care about bufsta=
rt,
                    * it doesn't really matter if it sets a flag */
                   buffer_lives(interpreter, (Buffer *)ptr);
  =

  =

  =

  1.7       +4 -4      parrot/encoding.c
  =

  Index: encoding.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/encoding.c,v
  retrieving revision 1.6
  retrieving revision 1.7
  diff -u -w -r1.6 -r1.7
  --- encoding.c	3 Apr 2002 14:49:05 -0000	1.6
  +++ encoding.c	2 Nov 2002 14:57:47 -0000	1.7
  @@ -1,7 +1,7 @@
   /* encoding.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: encoding.c,v 1.6 2002/04/03 14:49:05 josh Exp $
  + *     $Id: encoding.c,v 1.7 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     This defines the string encoding subsystem
    *  Data Structure and Algorithms:
  =

  =

  =

  1.39      +2 -2      parrot/global_setup.c
  =

  Index: global_setup.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/global_setup.c,v
  retrieving revision 1.38
  retrieving revision 1.39
  diff -u -w -r1.38 -r1.39
  --- global_setup.c	2 Nov 2002 02:06:16 -0000	1.38
  +++ global_setup.c	2 Nov 2002 14:57:47 -0000	1.39
  @@ -1,7 +1,7 @@
   /* global_setup.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: global_setup.c,v 1.38 2002/11/02 02:06:16 josh Exp $
  + *     $Id: global_setup.c,v 1.39 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *      Performs all the global setting up of things. This includes th=
e
    *      (very few) global variables that Parrot totes around
  =

  =

  =

  1.30      +57 -51    parrot/hash.c
  =

  Index: hash.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/hash.c,v
  retrieving revision 1.29
  retrieving revision 1.30
  diff -u -w -r1.29 -r1.30
  --- hash.c	2 Nov 2002 06:03:17 -0000	1.29
  +++ hash.c	2 Nov 2002 14:57:47 -0000	1.30
  @@ -1,7 +1,7 @@
   /* hash.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: hash.c,v 1.29 2002/11/02 06:03:17 josh Exp $
  + *     $Id: hash.c,v 1.30 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *  Data Structure and Algorithms:
    *     A hashtable contains an array of bucket indexes. Buckets
  @@ -61,18 +61,22 @@
   /* Is there a way to portably add inlining hints anymore? */
   #define FIXME_INLINE
   =

  -static FIXME_INLINE HASHBUCKET* getBucket(HASH* hash, BucketIndex idx)=

  +static FIXME_INLINE HASHBUCKET *
  +getBucket(HASH *hash, BucketIndex idx)
   {
  -    if (idx =3D=3D NULLBucketIndex) return NULL;
  +    if (idx =3D=3D NULLBucketIndex)
  +        return NULL;
       return &((HASHBUCKET*) hash->bucket_pool->bufstart)[idx];
   }
   =

  -static FIXME_INLINE BucketIndex lookupBucketIndex(HASH* hash, HashInde=
x slot
)
  +static FIXME_INLINE BucketIndex
  +lookupBucketIndex(HASH *hash, HashIndex slot)
   {
       return ((BucketIndex*) hash->buffer.bufstart)[slot];
   }
   =

  -static FIXME_INLINE HASHBUCKET* lookupBucket(HASH* hash, HashIndex slo=
t)
  +static FIXME_INLINE HASHBUCKET *
  +lookupBucket(HASH *hash, HashIndex slot)
   {
       return getBucket(hash, lookupBucketIndex(hash, slot));
   }
  @@ -105,22 +109,25 @@
   {
       HashIndex i;
       PIO_fprintf(interpreter, PIO_STDERR(interpreter),
  -            "Hashtable[%vd/%vd]\n",
  -            hash->entries, hash->max_chain + 1);
  +                "Hashtable[%vd/%vd]\n", hash->entries, hash->max_chain=
 + 1);
   =

       /* Iterate one past the end of the hashtable, so we can use the
        * last value as a special case for dumping out the free bucket
        * list. */
       for (i =3D 0; i <=3D hash->max_chain + 1; i++) {
           HASHBUCKET* bucket;
  -        if (i > hash->max_chain) bucket =3D getBucket(hash, hash->free=
_list);
  -        else bucket =3D lookupBucket(hash, i);
  -        if (bucket =3D=3D NULL) continue;
  +        if (i > hash->max_chain)
  +            bucket =3D getBucket(hash, hash->free_list);
  +        else
  +            bucket =3D lookupBucket(hash, i);
  +        if (bucket =3D=3D NULL)
  +            continue;
           PIO_eprintf(interpreter, "  Bucket %vd: ", i);
           while (bucket) {
               PIO_eprintf(interpreter, "type(%d)", bucket->value.type);
               bucket =3D getBucket(hash, bucket->next);
  -            if (bucket) PIO_eprintf(interpreter, " -> ");
  +            if (bucket)
  +                PIO_eprintf(interpreter, " -> ");
           }
           PIO_eprintf(interpreter, "\n");
       }
  @@ -206,8 +213,7 @@
   =

       /* NULL out new space in table */
       memset((HashIndex *) hash->buffer.bufstart + old_size,
  -           NULLBucketIndex,
  -           (new_size - old_size) * sizeof(BucketIndex));
  +           NULLBucketIndex, (new_size - old_size) * sizeof(BucketIndex=
));
   =

       /* Warning: for efficiency, we cache the table in a local
        * variable. If any possibly gc-triggering code is added to the
  @@ -355,7 +361,8 @@
   hash_get(Interp *interpreter, HASH *hash, STRING *key)
   {
       HASHBUCKET* bucket =3D hash_lookup(interpreter, hash, key);
  -    if (bucket =3D=3D NULL) return NULL; /* Not found */
  +    if (bucket =3D=3D NULL)
  +        return NULL;            /* Not found */
       return &bucket->value;
   }
   =

  @@ -407,9 +414,7 @@
       slot =3D hashval & hash->max_chain;
   =

       for (bucket =3D lookupBucket(hash, slot);
  -         bucket !=3D NULL;
  -         bucket =3D getBucket(hash, bucket->next))
  -    {
  +         bucket !=3D NULL; bucket =3D getBucket(hash, bucket->next)) {=

           if (string_compare(interpreter, key, bucket->key) =3D=3D 0) {
               /* FIXME: If string_compare triggers a collection, both
                * bucket and prev will end up pointing to junk memory.
  @@ -456,8 +461,9 @@
   =

               case enum_hash_pmc:
                   valtmp.type =3D enum_hash_pmc;
  -                valtmp.val.pmc_val =3D b->value.val.pmc_val->vtable->c=
lone(
  -                    interp, b->value.val.pmc_val);
  +                valtmp.val.pmc_val =3D
  +                    b->value.val.pmc_val->vtable->clone(interp,
  +                                                        b->value.val.p=
mc_val
);
                   /* b is no longer valid (due to GC) */
                   b =3D getBucket(hash, bi);
                   break;
  =

  =

  =

  1.35      +123 -126  parrot/jit.c
  =

  Index: jit.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/jit.c,v
  retrieving revision 1.34
  retrieving revision 1.35
  diff -u -w -r1.34 -r1.35
  --- jit.c	2 Nov 2002 06:03:17 -0000	1.34
  +++ jit.c	2 Nov 2002 14:57:47 -0000	1.35
  @@ -1,7 +1,7 @@
   /*
    * jit.c
    *
  - * $Id: jit.c,v 1.34 2002/11/02 06:03:17 josh Exp $
  + * $Id: jit.c,v 1.35 2002/11/02 14:57:47 josh Exp $
    */
   =

   #include <parrot/parrot.h>
  @@ -76,11 +76,11 @@
            */
   =

           /* Predereference the opcode information table for this opcode=

  -           early since it's going to be used many times */
  +         * early since it's going to be used many times */
           op_info =3D &interpreter->op_info_table[*cur_op];
   =

           /* if op_info->jump is not 0 this opcode may jump,
  -           so mark this opcode as a branch source */
  +         * so mark this opcode as a branch source */
           if (op_info->jump)
               branch[cur_op - code_start] =3D JIT_BRANCH_SOURCE;
           /* If it's not a constant, no joy*/
  @@ -133,7 +133,7 @@
       cur_op =3D code_start;
       while (cur_section) { =

           /* Predereference the opcode information for this opcode
  -           early since it's going to be used many times */
  +         * early since it's going to be used many times */
           op_info =3D &interpreter->op_info_table[*cur_op];
   =

           /* Calculate the next pc */
  @@ -143,13 +143,13 @@
           cur_section->op_count++;
   =

           /* If the opcode is jitted and calls a C function or it's not =
jitted
  -           at all, we will not count it. */
  +         * at all, we will not count it. */
           if (!op_jit[*cur_op].extcall) {
               cur_section->jit_op_count++;
               /* For each argument that has the opcode increment the usa=
ge cou
nt,
  -               right now, we are only ckecking integer registers.
  -               We move from the end since we need to check if the firs=
t opco
de
  -               using the register will read or write it. */
  +             * right now, we are only ckecking integer registers.
  +             * We move from the end since we need to check if the firs=
t opco
de
  +             * using the register will read or write it. */
               for (argn =3D op_info->arg_count - 1; argn > 0; argn--) {
                   if (op_info->types[argn] =3D=3D PARROT_ARG_I) {
                       if ((!cur_section->int_reg_count[*(cur_op + argn)]=
++) &&
  @@ -173,25 +173,24 @@
   #endif
               }
               /* If we are here means the current section is jitted, so =
if the
  -               next opcode is not end the section. */
  +             * next opcode is not end the section. */
               if (next_op < code_end && op_jit[*next_op].extcall)
                   goto END_SECTION;
           }
           else
               /* The current section is not jitted, end it if the next o=
pcode =

  -               is. */
  +             * is. */
               if (next_op < code_end && !op_jit[*next_op].extcall)
                   goto END_SECTION;
   =

           /* The section ends when the current opcode is a branch source=
,
  -           in other words if the opcode jumps, or if the next opcode i=
s
  -           a branch target, allocate a new section only if it's not th=
e
  -           last opcode */
  +         * in other words if the opcode jumps, or if the next opcode i=
s
  +         * a branch target, allocate a new section only if it's not th=
e
  +         * last opcode */
           if ((branch[cur_op - code_start] =3D=3D JIT_BRANCH_SOURCE)
               || (next_op < code_end &&
                   (branch[next_op - code_start] =3D=3D JIT_BRANCH_TARGET=
))
  -            || (next_op >=3D code_end))
  -        {
  +            || (next_op >=3D code_end)) {
   END_SECTION:
               /* Set the type, depending on whether the current
                * instruction is external or jitted. */
  @@ -240,7 +239,7 @@
       }
   =

       /* This is where we start deciding which Parrot registers get
  -       mapped to a hardware one in each different section. */
  +     * mapped to a hardware one in each different section. */
   =

       /* Start from the first section */
       cur_section =3D optimizer->sections;
  @@ -255,15 +254,15 @@
               cur_section->float_registers_used =3D 1;
   #endif
           /* Sort the registers by the usage,
  -           Start from the register number 1 since we compare it with t=
he    =

  -           previous one */
  +         * Start from the register number 1 since we compare it with t=
he    =

  +         * previous one */
           for (i =3D 1; i < NUM_REGISTERS; i++) {
               /* If the register is not used continue to the next one */=

               if (!cur_section->int_reg_count[i] && =

                   !cur_section->float_reg_count[i])
                       continue;
               /* Count the number of hardware registers that is going to=
 be
  -               used in this section */
  +             * used in this section */
               if (cur_section->int_registers_used < INT_REGISTERS_TO_MAP=
)
                   cur_section->int_registers_used++;
   #if FLOAT_REGISTERS_TO_MAP
  @@ -274,12 +273,12 @@
               /* Any register before this one */
               for (j =3D 0; j < i; j++) {
                   /* If the usage of this register is greater than the u=
sage
  -                   of the register in the j'th position of the list */=

  +                 * of the register in the j'th position of the list */=

                   if (cur_section->int_reg_count[i] > =

                       cur_section->int_reg_count[cur_section->int_reg_us=
age[j]
])
                   {
                       /* Move all the registers from the j'th position t=
o
  -                       the next one */
  +                     * the next one */
                       for (k =3D i; k > j; k--)
                           cur_section->int_reg_usage[k] =3D =

                               cur_section->int_reg_usage[k - 1];
  @@ -291,10 +290,10 @@
                   }
   #if FLOAT_REGISTERS_TO_MAP
                   if (cur_section->float_reg_count[i] > =

  -                 cur_section->float_reg_count[cur_section->float_reg_u=
sage[j
]])
  -                {
  +                    cur_section->float_reg_count[cur_section->
  +                                                 float_reg_usage[j]]) =
{
                       /* Move all the registers from the j'th position t=
o
  -                       the next one */
  +                     * the next one */
                       for (k =3D i; k > j; k--)
                           cur_section->float_reg_usage[k] =3D =

                               cur_section->float_reg_usage[k - 1];
  @@ -308,11 +307,11 @@
               }
           }
           /* Set the branch target of this section, that is the section =
where
  -           the program execution continues, if it ends in a branch sou=
rce we
  -           use the branch target and not the next section. */
  +         * the program execution continues, if it ends in a branch sou=
rce we
  +         * use the branch target and not the next section. */
           if (optimizer->branch_list[cur_section->end - code_start]) {
               /* If the branch target is to a section before the current=
 one
  -               move from the start, otherwise from the current section=
 */
  +             * move from the start, otherwise from the current section=
 */
               if (optimizer->branch_list[cur_section->end - code_start] =
<
                   cur_section->begin) =

                       t_section =3D optimizer->sections;
  @@ -322,8 +321,7 @@
               while (t_section) {
                   /* If we find the section attach it to the current one=
=2E */
                   if (t_section->begin =3D=3D =

  -                    optimizer->branch_list[cur_section->end - code_sta=
rt])
  -                {
  +                    optimizer->branch_list[cur_section->end - code_sta=
rt]) {
                       cur_section->branch_target =3D t_section;
                       break;
                   }
  @@ -345,10 +343,8 @@
                       /* If the argument is in most used list */
                       for (i =3D 0; i < INT_REGISTERS_TO_MAP; i++)
                           if (cur_op[op_arg] =3D=3D =

  -                            (opcode_t)cur_section->int_reg_usage[i])
  -                        {
  -                            map[cur_op + op_arg - code_start] =3D
  -                                intval_map[i];
  +                            (opcode_t)cur_section->int_reg_usage[i]) {=

  +                            map[cur_op + op_arg - code_start] =3D intv=
al_map[i
];
                               cur_section->maps++;
                               break;
                           }
  @@ -359,8 +355,7 @@
                       /* If the argument is in most used list */
                       for (i =3D 0; i < FLOAT_REGISTERS_TO_MAP; i++)
                           if (cur_op[op_arg] =3D=3D =

  -                            (opcode_t)cur_section->float_reg_usage[i])=

  -                        {
  +                            (opcode_t)cur_section->float_reg_usage[i])=
 {
                               map[cur_op + op_arg - code_start] =3D
                                   floatval_map[i];
                               cur_section->maps++;
  @@ -456,8 +451,11 @@
   =

       /* Byte code size in opcode_t's */
       jit_info.arena.map_size =3D (code_end - code_start) + 1;
  -    jit_info.arena.op_map =3D (Parrot_jit_opmap_t *)mem_sys_allocate(
  -        jit_info.arena.map_size * sizeof(*(jit_info.arena.op_map)) );
  +    jit_info.arena.op_map =3D
  +        (Parrot_jit_opmap_t *)mem_sys_allocate(jit_info.arena.map_size=
 *
  +                                               sizeof(*
  +                                                      (jit_info.arena.=

  +                                                       op_map)));
       =

       /* This memory MUST be zeroed for conversion of offsets to pointer=
s to =

        * work later
  @@ -502,14 +500,13 @@
           jit_info.cur_op =3D jit_info.optimizer->cur_section->begin;
   =

           /* The first opcode of each section doesn't have a previous on=
e sinc
e
  -           it's imposible to be sure which was it */
  +         * it's imposible to be sure which was it */
           jit_info.prev_op =3D NULL;
   =

           while (jit_info.cur_op <=3D jit_info.optimizer->cur_section->e=
nd) {
               /* Grow the arena early */ =

               if (jit_info.arena.size < =

  -                (jit_info.arena.op_map[jit_info.op_i].offset + 100))
  -            {
  +                (jit_info.arena.op_map[jit_info.op_i].offset + 100)) {=

   #if REQUIRES_CONSTANT_POOL
                   Parrot_jit_extend_arena(&jit_info);
   #else
  @@ -525,9 +522,9 @@
               cur_opcode_byte =3D *jit_info.cur_op;
   =

               /* Need to save the registers if there is a branch and is =
not to
  -               the same section, I admit I don't like this, and it sho=
uld be
  -               really checking if the target section has the same regi=
sters
  -               mapped too. */
  +             * the same section, I admit I don't like this, and it sho=
uld be
  +             * really checking if the target section has the same regi=
sters
  +             * mapped too. */
               if ((jit_info.optimizer->map_branch[jit_info.cur_op - code=
_start
]
                   =3D=3D JIT_BRANCH_SOURCE) &&
                       (jit_info.optimizer->cur_section->branch_target !=3D=

  =

  =

  =

  1.33      +12 -12    parrot/key.c
  =

  Index: key.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/key.c,v
  retrieving revision 1.32
  retrieving revision 1.33
  diff -u -w -r1.32 -r1.33
  --- key.c	21 Oct 2002 08:46:59 -0000	1.32
  +++ key.c	2 Nov 2002 14:57:47 -0000	1.33
  @@ -1,7 +1,7 @@
   /* key.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: key.c,v 1.32 2002/10/21 08:46:59 sfink Exp $
  + *     $Id: key.c,v 1.33 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     The base vtable calling functions.
    *  Data Structure and Algorithms:
  =

  =

  =

  1.7       +31 -30    parrot/method_util.c
  =

  Index: method_util.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/method_util.c,v
  retrieving revision 1.6
  retrieving revision 1.7
  diff -u -w -r1.6 -r1.7
  --- method_util.c	21 Oct 2002 08:46:59 -0000	1.6
  +++ method_util.c	2 Nov 2002 14:57:47 -0000	1.7
  @@ -1,7 +1,7 @@
   /* method_util.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: method_util.c,v 1.6 2002/10/21 08:46:59 sfink Exp $
  + *     $Id: method_util.c,v 1.7 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Utility functions to handle Parrot calling conventions, lookup
    *     methods, etc.
  @@ -79,8 +79,7 @@
   Parrot_push_proto(struct Parrot_Interp * interp,
                     INTVAL intc, INTVAL * intv,
                     INTVAL numc, FLOATVAL * numv,
  -                  INTVAL strc, STRING ** strv,
  -                  INTVAL pmcc, PMC ** pmcv)
  +                  INTVAL strc, STRING **strv, INTVAL pmcc, PMC **pmcv)=

   {
       int npush;                  /* overflow params */
       interp->ctx.int_reg.registers[0] =3D 1; /* with proto */
  @@ -126,12 +125,12 @@
    * Lookup a method in a method stash.
    */
   PMC *
  -Parrot_find_method(struct Parrot_Interp * interp, struct Stash * stash=
,
  -                   PMC * key)
  +Parrot_find_method(struct Parrot_Interp *interp, struct Stash *stash, =
PMC *k
ey)
   {
       while (stash) {
  -        PMC * meth =3D stash->stash_hash->vtable
  -            ->get_pmc_keyed(interp, stash->stash_hash, key);
  +        PMC *meth =3D
  +            stash->stash_hash->vtable->get_pmc_keyed(interp, stash->st=
ash_ha
sh,
  +                                                     key);
           if (meth)
               return meth;
           stash =3D stash->parent_stash;
  @@ -150,7 +149,8 @@
       size_t i;
   =

       for ( ; cur_stack; cur_stack =3D cur_stack->prev) {
  -        if (cur_stack->buffer =3D=3D NULL) continue;
  +        if (cur_stack->buffer =3D=3D NULL)
  +            continue;
   =

           buffer_lives(interpreter, cur_stack->buffer);
           entry =3D (Stack_Entry_t *)(cur_stack->buffer->bufstart);
  @@ -159,7 +159,8 @@
                   entry[i].entry.pmc_val) {
                   end_of_used_list =3D mark_used(entry[i].entry.pmc_val,=

                                                end_of_used_list);
  -            } else if (STACK_ENTRY_STRING =3D=3D entry[i].entry_type &=
&
  +            }
  +            else if (STACK_ENTRY_STRING =3D=3D entry[i].entry_type &&
                          entry[i].entry.string_val) {
                   buffer_lives(interpreter, (Buffer *)entry[i].entry.str=
ing_va
l);
               }
  =

  =

  =

  1.28      +2 -2      parrot/misc.c
  =

  Index: misc.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/misc.c,v
  retrieving revision 1.27
  retrieving revision 1.28
  diff -u -w -r1.27 -r1.28
  --- misc.c	15 Oct 2002 18:39:19 -0000	1.27
  +++ misc.c	2 Nov 2002 14:57:47 -0000	1.28
  @@ -1,7 +1,7 @@
   /* misc.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: misc.c,v 1.27 2002/10/15 18:39:19 leo Exp $
  + *     $Id: misc.c,v 1.28 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Miscellaneous functions, mainly the Parrot_sprintf family
    *  Data Structure and Algorithms:
  =

  =

  =

  1.6       +9 -9      parrot/packdump.c
  =

  Index: packdump.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/packdump.c,v
  retrieving revision 1.5
  retrieving revision 1.6
  diff -u -w -r1.5 -r1.6
  --- packdump.c	29 Oct 2002 13:43:03 -0000	1.5
  +++ packdump.c	2 Nov 2002 14:57:47 -0000	1.6
  @@ -7,7 +7,7 @@
   ** This program is free software. It is subject to the same
   ** license as Parrot itself.
   **
  -** $Id: packdump.c,v 1.5 2002/10/29 13:43:03 leo Exp $
  +** $Id: packdump.c,v 1.6 2002/11/02 14:57:47 josh Exp $
   */
   =

   #include "parrot/parrot.h"
  =

  =

  =

  1.15      +58 -57    parrot/packout.c
  =

  Index: packout.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/packout.c,v
  retrieving revision 1.14
  retrieving revision 1.15
  diff -u -w -r1.14 -r1.15
  --- packout.c	2 Nov 2002 02:27:28 -0000	1.14
  +++ packout.c	2 Nov 2002 14:57:47 -0000	1.15
  @@ -7,7 +7,7 @@
   ** This program is free software. It is subject to the same
   ** license as Parrot itself.
   **
  -** $Id: packout.c,v 1.14 2002/11/02 02:27:28 josh Exp $
  +** $Id: packout.c,v 1.15 2002/11/02 14:57:47 josh Exp $
   ** History:
   **  Rework by Melvin; new bytecode format, make bytecode portable.
   **   (Do endian conversion and wordsize transforms on the fly.)
  @@ -216,7 +216,8 @@
    * key constant is in constant table,
    * so we search for it @=A7$&
    */
  -static int find_in_const(PMC *key, int type)
  +static int
  +find_in_const(PMC *key, int type)
   {
       int i;
       for (i =3D 0 ; i < ct->const_count; i++)
  @@ -230,6 +231,7 @@
       exit(1);
       return 0;
   }
  +
   /***************************************
   Pack a PackFile Constant into a contiguous region of memory. NOTE: The=
 memor
y
   block had better have at least the amount of memory indicated by
  @@ -285,8 +287,7 @@
           padded_size =3D self->string->bufused;
   =

           if (padded_size % sizeof(opcode_t)) {
  -                padded_size +=3D sizeof(opcode_t) -
  -                    (padded_size % sizeof(opcode_t));
  +            padded_size +=3D sizeof(opcode_t) - (padded_size % sizeof(=
opcode_t
));
           }
   =

           /* Include space for flags, encoding, type, and size fields.  =
*/
  =

  =

  =

  1.6       +3 -3      parrot/pdb.c
  =

  Index: pdb.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/pdb.c,v
  retrieving revision 1.5
  retrieving revision 1.6
  diff -u -w -r1.5 -r1.6
  --- pdb.c	26 Aug 2002 14:15:45 -0000	1.5
  +++ pdb.c	2 Nov 2002 14:57:47 -0000	1.6
  @@ -2,7 +2,7 @@
    * pdb.c
    *
    * CVS Info
  - *    $Id: pdb.c,v 1.5 2002/08/26 14:15:45 grunblatt Exp $
  + *    $Id: pdb.c,v 1.6 2002/11/02 14:57:47 josh Exp $
    * Overview:
    *    The Parrot debugger
    * History:
  =

  =

  =

  1.16      +3 -4      parrot/pdump.c
  =

  Index: pdump.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/pdump.c,v
  retrieving revision 1.15
  retrieving revision 1.16
  diff -u -w -r1.15 -r1.16
  --- pdump.c	2 Nov 2002 03:36:13 -0000	1.15
  +++ pdump.c	2 Nov 2002 14:57:47 -0000	1.16
  @@ -1,7 +1,7 @@
   /* pdump.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: pdump.c,v 1.15 2002/11/02 03:36:13 josh Exp $
  + *     $Id: pdump.c,v 1.16 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     A program to dump pack files to human readable form.
    *  Data Structure and Algorithms:
  @@ -13,8 +13,7 @@
   #include "parrot/packfile.h"
   #include "parrot/interpreter.h"
   =

  -void PackFile_dump (struct Parrot_Interp *interpreter,
  -                    struct PackFile *pf);
  +void PackFile_dump(struct Parrot_Interp *interpreter, struct PackFile =
*pf);
   =

   int
   main(int argc, char **argv)
  =

  =

  =

  1.20      +2 -2      parrot/pmc.c
  =

  Index: pmc.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/pmc.c,v
  retrieving revision 1.19
  retrieving revision 1.20
  diff -u -w -r1.19 -r1.20
  --- pmc.c	19 Oct 2002 16:05:36 -0000	1.19
  +++ pmc.c	2 Nov 2002 14:57:47 -0000	1.20
  @@ -1,7 +1,7 @@
   /* pmc.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: pmc.c,v 1.19 2002/10/19 16:05:36 leo Exp $
  + *     $Id: pmc.c,v 1.20 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     The base vtable calling functions.
    *  Data Structure and Algorithms:
  =

  =

  =

  1.6       +40 -25    parrot/pxs.c
  =

  Index: pxs.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/pxs.c,v
  retrieving revision 1.5
  retrieving revision 1.6
  diff -u -w -r1.5 -r1.6
  --- pxs.c	14 Sep 2002 13:51:34 -0000	1.5
  +++ pxs.c	2 Nov 2002 14:57:47 -0000	1.6
  @@ -7,76 +7,91 @@
   #include "parrot/pxs.h"
   =

   int
  -PXS_initargs(Parrot_Interp_t interp) {
  +PXS_initargs(Parrot_Interp_t interp)
  +{
       INTVAL numargs;
       stack_pop(interp, &interp->user_stack, &numargs, STACK_ENTRY_INT);=

       return numargs;
   }
   =

   void
  -PXS_reti(Parrot_Interp_t interp, INTVAL i) {
  +PXS_reti(Parrot_Interp_t interp, INTVAL i)
  +{
       stack_push(interp, &interp->user_stack, &i, STACK_ENTRY_INT,
                  STACK_CLEANUP_NULL);
   }
   =

   void =

  -PXS_retn(Parrot_Interp_t interp, FLOATVAL f) {
  +PXS_retn(Parrot_Interp_t interp, FLOATVAL f)
  +{
       stack_push(interp, &interp->user_stack, &f, STACK_ENTRY_FLOAT,
                  STACK_CLEANUP_NULL);
   }
   =

   void
  -PXS_rets(Parrot_Interp_t interp, STRING * s) {
  +PXS_rets(Parrot_Interp_t interp, STRING *s)
  +{
       stack_push(interp, &interp->user_stack, s, STACK_ENTRY_STRING,
                  STACK_CLEANUP_NULL);
   }
   =

   void
  -PXS_retp(Parrot_Interp_t interp, PMC * p) {
  +PXS_retp(Parrot_Interp_t interp, PMC *p)
  +{
       stack_push(interp, &interp->user_stack, p, STACK_ENTRY_PMC, =

                  STACK_CLEANUP_NULL);
   }
   =

   INTVAL
  -PXS_shifti(Parrot_Interp_t interp) {
  +PXS_shifti(Parrot_Interp_t interp)
  +{
       INTVAL i;
       stack_pop(interp, &interp->user_stack, &i, STACK_ENTRY_INT);
       return i;
   }
   =

   FLOATVAL
  -PXS_shiftn(Parrot_Interp_t interp) {
  +PXS_shiftn(Parrot_Interp_t interp)
  +{
       FLOATVAL f;
       stack_pop(interp, &interp->user_stack, &f, STACK_ENTRY_FLOAT);
       return f;
   }
   =

   STRING *
  -PXS_shifts(Parrot_Interp_t interp) {
  +PXS_shifts(Parrot_Interp_t interp)
  +{
       STRING * s;
       stack_pop(interp, &interp->user_stack, &s, STACK_ENTRY_STRING);
       return s;
   }
   =

  -char * PXS_shiftcs(Parrot_Interp_t interp) {
  +char *
  +PXS_shiftcs(Parrot_Interp_t interp)
  +{
       STRING * s;
       stack_pop(interp, &interp->user_stack, &s, STACK_ENTRY_STRING);
       return string_to_cstring(interp, s);
   } =

   =

   PMC *
  -PXS_shiftp(Parrot_Interp_t interp) {
  +PXS_shiftp(Parrot_Interp_t interp)
  +{
       PMC * p;
       stack_pop(interp, &interp->user_stack, &p, STACK_ENTRY_PMC);
       return p;
   }
   =

  -INTVAL PXS_findop(Parrot_Interp_t interp, const char * opname) {
  +INTVAL
  +PXS_findop(Parrot_Interp_t interp, const char *opname)
  +{
       int op =3D interp->op_lib->op_code(opname, 1);
       return op;
   }
   =

  -PMC * PXS_pointer(Parrot_Interp_t interp, void * object) {
  +PMC *
  +PXS_pointer(Parrot_Interp_t interp, void *object)
  +{
       PMC * p =3D new_pmc_header(interp);
       p->data =3D object;
       p->vtable =3D YOU_LOSE_VTABLE;
  =

  =

  =

  1.24      +11 -8     parrot/register.c
  =

  Index: register.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/register.c,v
  retrieving revision 1.23
  retrieving revision 1.24
  diff -u -w -r1.23 -r1.24
  --- register.c	4 Jul 2002 20:39:44 -0000	1.23
  +++ register.c	2 Nov 2002 14:57:47 -0000	1.24
  @@ -1,7 +1,7 @@
   /* register.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: register.c,v 1.23 2002/07/04 20:39:44 mrjoltcola Exp $
  + *     $Id: register.c,v 1.24 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Register handling routines
    *  Data Structure and Algorithms:
  @@ -21,7 +21,8 @@
       /* Do we have any space in the current savestack? If so, memcpy
        * down */
       if (interpreter->ctx.int_reg_top->free) {
  -        memcpy(&interpreter->ctx.int_reg_top->IReg[interpreter->ctx.in=
t_reg_
top->used],
  +        memcpy(&interpreter->ctx.int_reg_top->
  +               IReg[interpreter->ctx.int_reg_top->used],
                  &interpreter->ctx.int_reg, sizeof(struct IReg));
           interpreter->ctx.int_reg_top->free--;
           interpreter->ctx.int_reg_top->used++;
  @@ -176,7 +177,8 @@
       /* Do we have any space in the current savestack? If so, memcpy
        * down */
       if (interpreter->ctx.num_reg_top->free) {
  -        memcpy(&interpreter->ctx.num_reg_top->NReg[interpreter->ctx.nu=
m_reg_
top->used],
  +        memcpy(&interpreter->ctx.num_reg_top->
  +               NReg[interpreter->ctx.num_reg_top->used],
                  &interpreter->ctx.num_reg, sizeof(struct NReg));
           interpreter->ctx.num_reg_top->free--;
           interpreter->ctx.num_reg_top->used++;
  @@ -253,7 +255,8 @@
       /* Do we have any space in the current savestack? If so, memcpy
        * down */
       if (interpreter->ctx.pmc_reg_top->free) {
  -        memcpy(&interpreter->ctx.pmc_reg_top->PReg[interpreter->ctx.pm=
c_reg_
top->used],
  +        memcpy(&interpreter->ctx.pmc_reg_top->
  +               PReg[interpreter->ctx.pmc_reg_top->used],
                  &interpreter->ctx.pmc_reg, sizeof(struct PReg));
           interpreter->ctx.pmc_reg_top->free--;
           interpreter->ctx.pmc_reg_top->used++;
  =

  =

  =

  1.3       +5 -5      parrot/res_lea.c
  =

  Index: res_lea.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/res_lea.c,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -w -r1.2 -r1.3
  =

  =

  =

  1.96      +69 -72    parrot/resources.c
  =

  Index: resources.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/resources.c,v
  retrieving revision 1.95
  retrieving revision 1.96
  diff -u -w -r1.95 -r1.96
  --- resources.c	2 Nov 2002 03:03:15 -0000	1.95
  +++ resources.c	2 Nov 2002 14:57:47 -0000	1.96
  @@ -1,7 +1,7 @@
   /* resources.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: resources.c,v 1.95 2002/11/02 03:03:15 josh Exp $
  + *     $Id: resources.c,v 1.96 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Allocate and deallocate tracked resources
    *  Data Structure and Algorithms:
  @@ -118,8 +118,7 @@
                   > (size_t)(pool->total_allocated * pool->reclaim_facto=
r)
                    /* don't bother reclaiming if it won't even be enough=
 */
                    && (pool->guaranteed_reclaimable > size)
  -                 )
  -            {
  +                ) {
                   (*pool->compact)(interpreter, pool);
               }
               else {
  @@ -152,15 +151,13 @@
   buffer_movable(UINTVAL flags)
   {
       UINTVAL mask =3D BUFFER_on_free_list_FLAG
  -                 | BUFFER_constant_FLAG
  -                 | BUFFER_immobile_FLAG
  -                 | BUFFER_external_FLAG;
  +        | BUFFER_constant_FLAG | BUFFER_immobile_FLAG | BUFFER_externa=
l_FLAG
;
       return !(flags & mask);
   }
   =

   /* Compact the buffer pool */
  -static void compact_pool(struct Parrot_Interp *interpreter,
  -                         struct Memory_Pool *pool)
  +static void
  +compact_pool(struct Parrot_Interp *interpreter, struct Memory_Pool *po=
ol)
   {
       UINTVAL total_size;
       struct Memory_Block *new_block;        /* A pointer to our working=
 block
 */
  @@ -207,24 +204,27 @@
   =

       /* Run through all the Buffer header pools and copy */
       for (j =3D -2; j < (INTVAL) interpreter->arena_base->num_sized; j+=
+) {
  -        if (j =3D=3D -2) header_pool =3D interpreter->arena_base->buff=
er_header_po
ol;
  -        else if (j =3D=3D -1) header_pool =3D
  -            interpreter->arena_base->string_header_pool;
  -        else header_pool =3D interpreter->arena_base->sized_header_poo=
ls[j];
  -        if (header_pool =3D=3D NULL) continue;
  +        if (j =3D=3D -2)
  +            header_pool =3D interpreter->arena_base->buffer_header_poo=
l;
  +        else if (j =3D=3D -1)
  +            header_pool =3D interpreter->arena_base->string_header_poo=
l;
  +        else
  +            header_pool =3D interpreter->arena_base->sized_header_pool=
s[j];
  +        if (header_pool =3D=3D NULL)
  +            continue;
   =

           object_size =3D header_pool->object_size;
   =

           for (cur_buffer_arena =3D header_pool->last_Arena;
                NULL !=3D cur_buffer_arena;
  -             cur_buffer_arena =3D cur_buffer_arena->prev)
  -        {
  +             cur_buffer_arena =3D cur_buffer_arena->prev) {
               Buffer *b =3D cur_buffer_arena->start_objects;
               UINTVAL i;
               for (i =3D 0; i < cur_buffer_arena->used; i++) {
                   if (b->bufstart && buffer_movable(b->flags)) {
                       struct Buffer_Tail *tail =3D
  -                        (struct Buffer_Tail *)((char *)b->bufstart +b-=
>bufle
n);
  +                        (struct Buffer_Tail *)((char *)b->bufstart +
  +                                               b->buflen);
                       ptrdiff_t offset =3D 0;
                       /* we can't perform the math all the time,
                        * because strstart might be in unallocated memory=
 */
  @@ -234,8 +234,7 @@
                       }
                       /* buffer has already been moved; just change the =
header
 */
                       if (b->flags & BUFFER_COW_FLAG
  -                        && tail->flags & TAIL_moved_FLAG)
  -                    {
  +                        && tail->flags & TAIL_moved_FLAG) {
                           /* Find out who else references our data */
                           Buffer* hdr =3D *(Buffer**)(b->bufstart);
                           /* Make sure they know that we own it too */
  @@ -250,8 +249,7 @@
                                   offset;
                           }
                       }
  -                    else if (!(b->flags & BUFFER_external_FLAG))
  -                    {
  +                    else if (!(b->flags & BUFFER_external_FLAG)) {
                           struct Buffer_Tail *new_tail =3D
                               (struct Buffer_Tail *)((char *)cur_spot +
                                   b->buflen);
  @@ -292,9 +290,7 @@
        * that data will get duplicated during this collection run. */
       for (j =3D 0;
            j < (INTVAL)( interpreter->arena_base->extra_buffer_headers.b=
uflen =

/
  -            sizeof(Buffer*) );
  -         j++
  -        ) {
  +                      sizeof(Buffer *)); j++) {
           Buffer** buffers =3D
               interpreter->arena_base->extra_buffer_headers.bufstart;
           Buffer* b =3D buffers[j];
  @@ -345,7 +341,7 @@
               /* Note that we don't have it any more */
               interpreter->memory_allocated -=3D cur_block->size;
               /* We know the pool body and pool header are a single chun=
k, so
  -               this is enough to get rid of 'em both */
  +             * this is enough to get rid of 'em both */
               mem_sys_free(cur_block);
               cur_block =3D next_block;
           }
  @@ -394,7 +390,8 @@
       interpreter->arena_base->memory_pool->possibly_reclaimable +=3D
           buffer->buflen;
       mem =3D mem_allocate(interpreter, &alloc_size,
  -            interpreter->arena_base->memory_pool, BUFFER_ALIGNMENT-1);=

  +                       interpreter->arena_base->memory_pool,
  +                       BUFFER_ALIGNMENT - 1);
   =

       if (!mem) {
           return NULL;
  @@ -456,7 +453,9 @@
       ((Buffer *)buffer)->buflen =3D 0;
       ((Buffer *)buffer)->bufstart =3D NULL;
       ((Buffer *)buffer)->bufstart =3D mem_allocate(interpreter, &req_si=
ze,
  -        interpreter->arena_base->memory_pool, BUFFER_ALIGNMENT-1);
  +                                                interpreter->arena_bas=
e->
  +                                                memory_pool,
  +                                                BUFFER_ALIGNMENT - 1);=

       ((Buffer *)buffer)->buflen =3D size;
       return buffer;
   }
  @@ -520,10 +519,8 @@
        */
   =

       interpreter->arena_base->memory_pool =3D
  -        new_memory_pool(32768,
  -                        &compact_pool);
  -    alloc_new_block(interpreter, 32768,
  -                    interpreter->arena_base->memory_pool);
  +        new_memory_pool(32768, &compact_pool);
  +    alloc_new_block(interpreter, 32768, interpreter->arena_base->memor=
y_pool
);
   =

       /* Constant strings - not compacted */
       interpreter->arena_base->constant_string_pool =3D
  =

  =

  =

  1.25      +7 -6      parrot/runops_cores.c
  =

  Index: runops_cores.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/runops_cores.c,v
  retrieving revision 1.24
  retrieving revision 1.25
  diff -u -w -r1.24 -r1.25
  --- runops_cores.c	2 Nov 2002 02:27:28 -0000	1.24
  +++ runops_cores.c	2 Nov 2002 14:57:47 -0000	1.25
  @@ -1,7 +1,7 @@
   /* runops_cores.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: runops_cores.c,v 1.24 2002/11/02 02:27:28 josh Exp $
  + *     $Id: runops_cores.c,v 1.25 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     The switchable runops cores.
    *  Data Structure and Algorithms:
  @@ -52,7 +52,8 @@
       pc =3D cg_core(pc, interpreter);
       return pc;
   #else
  -    PIO_eprintf(interpreter, "Computed goto unavailable in this config=
uratio
n.\n");
  +    PIO_eprintf(interpreter,
  +                "Computed goto unavailable in this configuration.\n");=

       exit(1);
       return NULL;
   #endif
  =

  =

  =

  1.20      +2 -2      parrot/rx.c
  =

  Index: rx.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/rx.c,v
  retrieving revision 1.19
  retrieving revision 1.20
  diff -u -w -r1.19 -r1.20
  --- rx.c	9 Oct 2002 04:26:49 -0000	1.19
  +++ rx.c	2 Nov 2002 14:57:47 -0000	1.20
  @@ -1,7 +1,7 @@
   /* rx.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: rx.c,v 1.19 2002/10/09 04:26:49 sfink Exp $
  + *     $Id: rx.c,v 1.20 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Supporting file for the regular expression engine
    *  Data Structure and Algorithms:
  =

  =

  =

  1.9       +6 -4      parrot/rxstacks.c
  =

  Index: rxstacks.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/rxstacks.c,v
  retrieving revision 1.8
  retrieving revision 1.9
  diff -u -w -r1.8 -r1.9
  --- rxstacks.c	22 Aug 2002 20:08:24 -0000	1.8
  +++ rxstacks.c	2 Nov 2002 14:57:47 -0000	1.9
  @@ -1,7 +1,7 @@
   /* rxstacks.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: rxstacks.c,v 1.8 2002/08/22 20:08:24 dan Exp $
  + *     $Id: rxstacks.c,v 1.9 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Regex stack handling routines for Parrot
    *  Data Structure and Algorithms:
  @@ -102,7 +102,8 @@
   }
   =

   =

  -void intstack_free (struct Parrot_Interp *interpreter, IntStack stack)=

  +void
  +intstack_free(struct Parrot_Interp *interpreter, IntStack stack)
   {
       IntStack chunk, temp;
   =

  @@ -113,6 +114,7 @@
   =

       mem_sys_free(stack);
   }   =

  +
   /*
    * Local variables:
    * c-indentation-style: bsd
  =

  =

  =

  1.8       +18 -16    parrot/spf_render.c
  =

  Index: spf_render.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/spf_render.c,v
  retrieving revision 1.7
  retrieving revision 1.8
  diff -u -w -r1.7 -r1.8
  --- spf_render.c	2 Nov 2002 02:06:16 -0000	1.7
  +++ spf_render.c	2 Nov 2002 14:57:47 -0000	1.8
  @@ -1,7 +1,7 @@
   /* spf_render.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: spf_render.c,v 1.7 2002/11/02 02:06:16 josh Exp $
  + *     $Id: spf_render.c,v 1.8 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Implements the main function that drives the Parrot_sprintf
    *     family and its utility functions.
  @@ -507,7 +507,8 @@
                               break;
   =

                           case 'x':
  -                            theuint =3D obj->getuint(interpreter, info=
=2Etype, o
bj);
  +                            theuint =3D
  +                                obj->getuint(interpreter, info.type, o=
bj);
                               uint_to_str(interpreter, ts, tc, theuint, =
16);
   =

                               handle_flags(interpreter, &info, ts, 1, "0=
x");
  @@ -591,7 +592,8 @@
                                   UINTVAL i;
                                   for(i=3D0; i < strlen(tc); i++) {
                                       if(tolower(tc[i]) =3D=3D 'e' &&
  -                                        (tc[i+1] =3D=3D '+' || tc[i+1]=
 =3D=3D '-')) =

{
  +                                        (tc[i + 1] =3D=3D '+'
  +                                         || tc[i + 1] =3D=3D '-')) {
                                           tc[i+2]=3D'\0';
                                           strcat(tc, &(tc[i+3]));
                                       }
  =

  =

  =

  1.6       +107 -101  parrot/spf_vtable.c
  =

  Index: spf_vtable.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/spf_vtable.c,v
  retrieving revision 1.5
  retrieving revision 1.6
  diff -u -w -r1.5 -r1.6
  --- spf_vtable.c	25 Oct 2002 15:09:51 -0000	1.5
  +++ spf_vtable.c	2 Nov 2002 14:57:47 -0000	1.6
  @@ -1,7 +1,7 @@
   /* spf_vtable.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: spf_vtable.c,v 1.5 2002/10/25 15:09:51 leo Exp $
  + *     $Id: spf_vtable.c,v 1.6 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Implements the two families of functions Parrot_sprintf
    *     may use to retrieve arguments.
  @@ -195,12 +195,14 @@
   {
       STRING *s;
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -            ((PMC *) obj->data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
               &(obj->index));
       obj->index++;
       s =3D tmp->vtable->get_string(interpreter, tmp);
       /* XXX string_copy like below? + adjusting bufused */
  -    return string_make(interpreter, s->strstart, 1, 0, BUFFER_external=
_FLAG,
 0);
  +    return string_make(interpreter, s->strstart, 1, 0, BUFFER_external=
_FLAG,
  +                       0);
   }
   =

   static HUGEINTVAL
  @@ -208,7 +210,8 @@
   {
       HUGEINTVAL ret;
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -                                                              ((PMC *)=
 obj->
data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
                                                                 &(obj->i=
ndex))
;
       obj->index++;
       ret =3D (HUGEINTVAL) (tmp->vtable->get_integer(interpreter, tmp));=

  @@ -234,7 +237,8 @@
   {
       UHUGEINTVAL ret;
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -                                                              ((PMC *)=
 obj->
data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
                                                                 &(obj->i=
ndex))
;
       obj->index++;
       ret =3D (UHUGEINTVAL) (tmp->vtable->get_integer(interpreter, tmp))=
;
  @@ -260,7 +264,8 @@
   {
       HUGEFLOATVAL ret;
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -                                                              ((PMC *)=
 obj->
data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
                                                                 &(obj->i=
ndex))
;
       obj->index++;
       ret =3D (HUGEFLOATVAL) (tmp->vtable->get_number(interpreter, tmp))=
;
  @@ -280,12 +285,12 @@
   }
   =

   static STRING *
  -getstring_pmc(struct Parrot_Interp *interpreter,
  -              INTVAL size, SPRINTF_OBJ * obj)
  +getstring_pmc(struct Parrot_Interp *interpreter, INTVAL size, SPRINTF_=
OBJ *o
bj)
   {
       STRING *s;
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -            ((PMC *) obj->data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
               &(obj->index));
       obj->index++;
       s =3D  (STRING *)(tmp->vtable->get_string(interpreter, tmp));
  @@ -296,7 +301,8 @@
   getptr_pmc(struct Parrot_Interp *interpreter, INTVAL size, SPRINTF_OBJ=
 * obj
)
   {
       PMC *tmp =3D ((PMC *) obj->data)->vtable->get_pmc_keyed_int(interp=
reter,
  -                                                              ((PMC *)=
 obj->
data),
  +                                                             ((PMC *)o=
bj->
  +                                                              data),
                                                                 &(obj->i=
ndex))
;
       obj->index++;
       /* XXX correct? */
  =

  =

  =

  1.46      +77 -78    parrot/stacks.c
  =

  Index: stacks.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/stacks.c,v
  retrieving revision 1.45
  retrieving revision 1.46
  diff -u -w -r1.45 -r1.46
  --- stacks.c	17 Aug 2002 01:11:08 -0000	1.45
  +++ stacks.c	2 Nov 2002 14:57:47 -0000	1.46
  @@ -1,7 +1,7 @@
   /* stacks.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: stacks.c,v 1.45 2002/08/17 01:11:08 sfink Exp $
  + *     $Id: stacks.c,v 1.46 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Stack handling routines for Parrot
    *  Data Structure and Algorithms:
  @@ -49,7 +49,8 @@
   }
   =

   void
  -stack_mark_cow(Stack_Chunk_t *stack) {
  +stack_mark_cow(Stack_Chunk_t *stack)
  +{
       Stack_Chunk_t * chunk =3D stack;
       chunk->flags |=3D STACK_CHUNK_COW_FLAG;
       for (chunk =3D chunk->prev; chunk; chunk =3D chunk->prev)
  @@ -74,7 +75,8 @@
    * references, fix this to do COW by chunk.
    */
   Stack_Chunk_t *
  -stack_copy(struct Parrot_Interp * interp, Stack_Chunk_t *old_top) {
  +stack_copy(struct Parrot_Interp *interp, Stack_Chunk_t *old_top)
  +{
       Stack_Chunk_t *old_chunk =3D old_top; =

       Stack_Chunk_t *new_chunk;
       Stack_Chunk_t *new_top =3D NULL;
  @@ -126,8 +128,7 @@
       /* For negative depths, look from the bottom of the stack up. */
       if (depth < 0) {
           /* FIXME: Non-circular stack makes this rare case slow */
  -        for(chunk =3D stack; chunk->prev; chunk =3D chunk->prev)
  -            ;
  +        for (chunk =3D stack; chunk->prev; chunk =3D chunk->prev);
           offset =3D (size_t)-depth;
           while (chunk !=3D NULL && offset >=3D chunk->used) {
               offset -=3D chunk->used;
  @@ -160,8 +161,7 @@
      is bubble down, so that the Nth element becomes the top most elemen=
t.
   */
   void
  -rotate_entries(Interp *interpreter, Stack_Chunk_t *stack, =

  -               Intval num_entries)
  +rotate_entries(Interp *interpreter, Stack_Chunk_t *stack, Intval num_e=
ntries
)
   {
       Stack_Entry_t temp;
       Intval i;
  @@ -258,8 +258,7 @@
       entry->entry_type =3D type;
       /* If we were passed a cleanup function, mark the flag entry
        * for this as needing cleanup */
  -    entry->flags =3D (cleanup ? STACK_ENTRY_CLEANUP_FLAG =

  -                            : NO_STACK_ENTRY_FLAGS);
  +    entry->flags =3D (cleanup ? STACK_ENTRY_CLEANUP_FLAG : NO_STACK_EN=
TRY_FLAG
S);
       /* Remember the cleanup function */
       entry->cleanup =3D cleanup;
       /* Store our thing */
  =

  =

  =

  1.104     +79 -75    parrot/string.c
  =

  Index: string.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/string.c,v
  retrieving revision 1.103
  retrieving revision 1.104
  diff -u -w -r1.103 -r1.104
  --- string.c	2 Nov 2002 06:03:17 -0000	1.103
  +++ string.c	2 Nov 2002 14:57:47 -0000	1.104
  @@ -1,7 +1,7 @@
   /* string.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: string.c,v 1.103 2002/11/02 06:03:17 josh Exp $
  + *     $Id: string.c,v 1.104 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     This is the api definitions for the string subsystem
    *  Data Structure and Algorithms:
  @@ -52,7 +52,8 @@
       }
   }
   =

  -static void copy_string_header(struct Parrot_Interp *interpreter,
  +static void
  +copy_string_header(struct Parrot_Interp *interpreter,
                                  String *dest, String *src)
   {
       UINTVAL version;
  @@ -88,7 +89,9 @@
   }
   =

   static void
  -make_COW_reference_from_header(struct Parrot_Interp *interpreter, STRI=
NG *s,
 STRING *d) {
  +make_COW_reference_from_header(struct Parrot_Interp *interpreter, STRI=
NG *s,
  +                               STRING *d)
  +{
       if (s->flags & BUFFER_constant_FLAG) {
           s->flags |=3D BUFFER_COW_FLAG|BUFFER_external_FLAG;
           copy_string_header(interpreter, d, s);
  @@ -131,15 +134,14 @@
       /* Is A real? */
       if (a !=3D NULL && a->strlen !=3D 0) {
           /* If the destination's constant, then just fall back to
  -           string_concat */
  +         * string_concat */
           if (a->flags & BUFFER_constant_FLAG) {
               return string_concat(interpreter, a, b, Uflags);
           }
           /* First, make sure B is the same type as A, transcoding
  -           if we need to */
  +         * if we need to */
           if (a->type !=3D b->type || a->encoding !=3D b->encoding) {
  -            b =3D string_transcode(interpreter, b, a->encoding, a->typ=
e,
  -                                 NULL);
  +            b =3D string_transcode(interpreter, b, a->encoding, a->typ=
e, NULL)
;
           }
           unmake_COW(interpreter, a);
           /* make sure A's big enough for both */
  @@ -162,14 +164,13 @@
                   return string_concat(interpreter, a, b, Uflags);
               }
               /* There's at least a string header for A. Make it a copy
  -               of B */
  +             * of B */
               if (a->buflen < b->bufused) {
                   a =3D string_grow(interpreter, a, b->bufused + EXTRA_S=
IZE);
               }
               a->flags =3D b->flags;
               a->flags &=3D ~(UINTVAL)(BUFFER_constant_FLAG
  -                                   |BUFFER_COW_FLAG
  -                                   |BUFFER_external_FLAG);
  +                                   | BUFFER_COW_FLAG | BUFFER_external=
_FLAG)
;
               a->bufused =3D b->bufused;
               a->strlen =3D b->strlen;
               a->encoding =3D b->encoding;
  @@ -206,9 +207,9 @@
       s =3D new_string_header(interpreter, flags);
       if (flags & BUFFER_external_FLAG) {
           /* The following cast discards the 'const'.  That raises
  -           a warning with gcc, but is ok since the caller indicated
  -           it was safe by setting BUFFER_external_FLAG.
  -           (The cast is necessary to pacify TenDRA's tcc.)
  +         * a warning with gcc, but is ok since the caller indicated
  +         * it was safe by setting BUFFER_external_FLAG.
  +         * (The cast is necessary to pacify TenDRA's tcc.)
           */
           s->bufstart =3D (void *) buffer;
           s->buflen =3D buflen;
  @@ -241,7 +242,8 @@
    * grow the string buffer by addlen bytes
    */
   STRING *
  -string_grow(struct Parrot_Interp * interpreter, STRING * s, INTVAL add=
len) {
  +string_grow(struct Parrot_Interp *interpreter, STRING *s, INTVAL addle=
n)
  +{
       unmake_COW(interpreter,s);
   =

       /* Don't check buflen, if we are here, we already checked. */
  @@ -281,12 +283,14 @@
       if (s->encoding->index =3D=3D enum_encoding_singlebyte) {
           /* This inlines the computations used for the case that the st=
rings =

is
            * in a singlebyte encoding.
  -         * This assumes that any singlebyte encoding uses is us-ascii,=
 which
 is wrong,
  -         * but consistent withthe result of calling s->encoding->decod=
e */
  +         * This assumes that any singlebyte encoding uses is us-ascii,=
 which
 =

  +         * is wrong, but consistent with the result of calling
  +         * s->encoding->decode */
           return *((unsigned char*) s->strstart + idx);
       }
       else {
  -        return s->encoding->decode(s->encoding->skip_forward(s->strsta=
rt, id
x));
  +        return s->encoding->decode(s->encoding->
  +                                   skip_forward(s->strstart, idx));
       }
   }
   =

  @@ -688,14 +692,13 @@
        */
       diff =3D (subend_off - substart_off) - rep->bufused;
   =

  -    if(diff >=3D 0
  -        || ((INTVAL)src->bufused - (INTVAL)src->buflen) <=3D diff) {
  +    if (diff >=3D 0 || ((INTVAL)src->bufused - (INTVAL)src->buflen) <=3D=
 diff) {
   =

           unmake_COW(interpreter, src);
   =

           if(diff !=3D 0) {
  -            mem_sys_memmove((char*)src->strstart + substart_off + rep-=
>bufus
ed,
  -                                (char*)src->strstart + subend_off,
  +            mem_sys_memmove((char *)src->strstart + substart_off +
  +                            rep->bufused, (char *)src->strstart + sube=
nd_off
,
                                   src->buflen - (subend_off - diff));
               src->bufused -=3D diff;
           }
  @@ -768,8 +771,7 @@
    * necessary
    */
   INTVAL
  -string_compare(struct Parrot_Interp *interpreter, STRING *s1,
  -               STRING *s2)
  +string_compare(struct Parrot_Interp *interpreter, STRING *s1, STRING *=
s2)
   {
       const char *s1start;
       const char *s1end;
  @@ -852,7 +854,8 @@
    * Set the contents of one string to the contents of another.
    */
   STRING *
  -string_set(struct Parrot_Interp *interpreter, STRING *dest, STRING *sr=
c) {
  +string_set(struct Parrot_Interp *interpreter, STRING *dest, STRING *sr=
c)
  +{
       if(dest) {
           make_COW_reference_from_header(interpreter, src, dest);
       }
  @@ -1002,7 +1005,8 @@
   }
   =

   STRING *
  -string_from_int(struct Parrot_Interp * interpreter, INTVAL i) {
  +string_from_int(struct Parrot_Interp *interpreter, INTVAL i)
  +{
       char buf[128];
       char *ptr =3D &buf[127];
       int neg =3D 0;
  @@ -1032,8 +1036,8 @@
   string_from_num(struct Parrot_Interp * interpreter, FLOATVAL f)
   {
       /* Too damn hard--hand it off to Parrot_sprintf, which'll probably=

  -       use the system sprintf anyway, but has gigantic buffers that ar=
e
  -       awfully hard to overflow. */
  +     * use the system sprintf anyway, but has gigantic buffers that ar=
e
  +     * awfully hard to overflow. */
       return Parrot_sprintf_c(interpreter, "%vg", f);
   }
   =

  =

  =

  =

  1.8       +11 -12    parrot/sub.c
  =

  Index: sub.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/sub.c,v
  retrieving revision 1.7
  retrieving revision 1.8
  diff -u -w -r1.7 -r1.8
  --- sub.c	22 Aug 2002 14:24:05 -0000	1.7
  +++ sub.c	2 Nov 2002 14:57:47 -0000	1.8
  @@ -1,7 +1,7 @@
   /*  sub.c
    *  Copyright: (When this is determined...it will go here)
    *  CVS Info
  - *     $Id: sub.c,v 1.7 2002/08/22 14:24:05 mrjoltcola Exp $
  + *     $Id: sub.c,v 1.8 2002/11/02 14:57:47 josh Exp $
    *  Overview:
    *     Sub-routines, co-routines and other fun stuff...
    *  Data Structure and Algorithms:
  @@ -72,4 +72,3 @@
    *
    * vim: expandtab shiftwidth=3D4:
   */
  -
  =

  =

  =

  1.14      +14 -18    parrot/warnings.c
  =

  Index: warnings.c
  =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  RCS file: /cvs/public/parrot/warnings.c,v
  retrieving revision 1.13
  retrieving revision 1.14
  diff -u -w -r1.13 -r1.14
  --- warnings.c	2 Nov 2002 06:03:17 -0000	1.13
  +++ warnings.c	2 Nov 2002 14:57:47 -0000	1.14
  @@ -13,8 +13,7 @@
       va_list args;
       va_start(args, message);
   =

  -    if (!(interpreter =3D=3D NULL || =

  -          PARROT_WARNINGS_test(interpreter, warnclass))) {
  +    if (!(interpreter =3D=3D NULL || PARROT_WARNINGS_test(interpreter,=
 warnclass
))) {
           return 2;
       }
   =

  @@ -28,12 +27,11 @@
   =

       if (PIO_eprintf(interpreter, "%S%S.\n",
               targ,
  -            interpreter ? Parrot_sprintf_c(
  -                interpreter, " at %S line %d", interpreter->current_fi=
le, =

  -                                               interpreter->current_li=
ne
  -            ) : NULL
  -        ) < 0)
  -    {
  +                    interpreter ? Parrot_sprintf_c(interpreter,
  +                                                   " at %S line %d",
  +                                                   interpreter->curren=
t_file
,
  +                                                   interpreter->
  +                                                   current_line) : NUL=
L) < 0
) {
           return -2;
       }
       else {
  @@ -50,8 +48,7 @@
       va_list args;
       va_start(args, message);
   =

  -    if (!(interpreter =3D=3D NULL || =

  -          PARROT_WARNINGS_test(interpreter, warnclass))) {
  +    if (!(interpreter =3D=3D NULL || PARROT_WARNINGS_test(interpreter,=
 warnclass
))) {
           return 2;
       }
   =

  @@ -64,12 +61,11 @@
   =

       if (PIO_eprintf(interpreter, "%S%S.\n",
               targ,
  -            interpreter ? Parrot_sprintf_c(
  -                interpreter, " at %S line %d", interpreter->current_fi=
le,
  -                                               interpreter->current_li=
ne
  -            ) : NULL
  -        ) < 0)
  -    {
  +                    interpreter ? Parrot_sprintf_c(interpreter,
  +                                                   " at %S line %d",
  +                                                   interpreter->curren=
t_file
,
  +                                                   interpreter->
  +                                                   current_line) : NUL=
L) < 0
) {
           return -2;
       }
       else {
  =

  =

  =


------- End of Forwarded Message



0
josh
11/2/2002 3:27:09 PM
perl.perl6.internals 7376 articles. 0 followers. Follow

1 Replies
1301 Views

Similar Articles

[PageSpeed] 16
Get it on Google Play
Get it on Apple App Store

Josh Wilmes wrote:

> FYI- I just re-indented a bunch of code, using the tools/dev/run_indent.pl 
> script.


I see really no need for quoting this stuff and plz next time wait, until 

real changes are committed - I did announce them.


> --Josh

Thanks,
leo

0
lt
11/2/2002 4:45:09 PM
Reply:

Similar Artilces:

C++ or C#
HI, I have still seen that many big companies are still using C++ as their primary language of choice instead of C#. Like IBM stilll prefers C++ over c#. Any reason ???HighOnCodingWanna get high! Well not everybody has the .net framework installed. C++ will work on any platform, c# will not yet because the framework has not been ported to all platforms yet (e.g. mac). Also you have to think of the expense of a large company to retrain ALL its coders to use the new framework. Not exactly practical in the short term David LeggDave Legg Considering that they have a huge c...

C or C++
What's the difference in using C or C++ for ultralite developments?. Novice user. Thank you The ONLY difference is YOUR preference. There is no speed difference between the two. If you are very used to C++ but not used to SQL, then the C++ API maybe a better choice. If you are familiar with SQL, the embedded SQL may make more sense. -- David Fishburn Sybase - iAnywhere Solutions Professional Services Please only post to the newsgroup EBFs and Whitepapers http://www.sybase.com/products/mobilewireless/anywhere/ "Lorenzo Mota" <lorenzomota@aol.com> wro...

About C and C++
Hello, I will resume it like this: On the criterias of "complexity" and "difficulty", the C and C++ programming languages are more complex and difficult than Object Pascal for example, so since they are more complex and difficult they are likely to create something like a darwinian filter who don't let the weaker humans among us humans to cross or to climb the social ladder, this is why i think that C and C++ do participate to social darwinism, this is why i say that C and C++ are bad. Thank you, Amine Moulay Ramdane. Amine Moulay Ramdane wrote: > He...

Landing c-c-breaking changes that remove c-c-only code from m-c
Thanks to the work that Anne has done on the Encoding Standard specification and the work that Masatoshi Kimura and I have done to progressively implement the specification in Firefox, we are now at a point where there's a whole bunch of internationalization-related dead code in Firefox. The code is still used by mailnews, though. I am not done preparing the removal patches yet, but with my current patch queue I can already get 149 KB off of Android ARMv7 optimized apk size and 138 KB off of Android ARMv7 optimized libxul size. (I'm not sure what sort of size wins are conside...

Landing c-c-breaking changes that remove c-c-only code from m-c
Thanks to the work that Anne has done on the Encoding Standard specification and the work that Masatoshi Kimura and I have done to progressively implement the specification in Firefox, we are now at a point where there's a whole bunch of internationalization-related dead code in Firefox. The code is still used by mailnews, though. I am not done preparing the removal patches yet, but with my current patch queue I can already get 149 KB off of Android ARMv7 optimized apk size and 138 KB off of Android ARMv7 optimized libxul size. (I'm not sure what sort of size wins are conside...

Instant C++ C# to C++ Converter
We've just released version 1.0 of the Instant C++ C# to C++ converter.  Instant C++ converts to either C++/CLI (2005) or Managed C++ (2003).Instant C++ converts C# projects, folders, files, and snippets. David Antonwww.tangiblesoftwaresolutions.comInstant C#: VB.NET to C# ConverterInstant VB: C# to VB.NET ConverterInstant C++: C# to C++ ConverterInstant J#: VB.NET to J# ConverterClear VB: Cleans up outdated VB.NET code David Antonhttp://www.tangiblesoftwaresolutions.comConvert VB to C#, C++, or JavaConvert C# to VB, C++, or JavaConvert C++ to C#, VB, or JavaConvert Java to C#, C++, or...

Coordinating landing on m-c and c-c
In Bug 778668 I'm making changes to the nsIAlertsService that impacts code in m-c and c-c. What's the best way coordinate these landings while not breaking c-c? My m-c patch will do m-i -> m-c -> c-c, but I have no idea which revision of m-c is picked up by c-c and when. Fabrice On 8/8/2012 3:34 PM, Fabrice Desré wrote: > What's the best way coordinate these landings while not breaking c-c? > My m-c patch will do m-i -> m-c -> c-c, but I have no idea which revision > of m-c is picked up by c-c and when. c-c (and try-c-c) always builds the...

[PATCH] z/OS: pp_sys.c, reg*.c, toke.c, utf8.c
--------------010205060008010605010505 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit Various bits and pieces either to do with EBCDIC or z/OS (#ifdef OEMVS) itself. Some proposed changes of regexec.c will have to be redone because (1) too many changes have happened in the meanwhile (2) I don't quite understand/approve of the proposed changes --------------010205060008010605010505 Content-Type: application/x-gzip; x-mac-type="0"; x-mac-creator="0"; name="zos-6.pat.gz" Content-Transfer-Encoding: base64 Content-Di...

Character encoding changes in m-c require c-c action
After the current ESR, there have been various changes to the character encoding converters that have been rendered obsolete by the Encoding Standard for the purposes of the Web and, by extension, Firefox and mozilla-central. (Note that changes to HZ-GB-2312 and GB2312 described below are on mozilla-inbound and have not merged to m-c yet. For the rest of the email, I'll pretend they've been merged already.) These changes require action in comm-central. Bugs are on file. Please see https://bugzilla.mozilla.org/showdependencytree.cgi?id=1054354&hide_resolved=1 .. For Ge...

Watcom C/C++
Dear All, Just wondering, will PB9 still able to communicate with watcom C/C++ compiled DLLs? TIA Cheers, James Yes. -- Chris Keating Sybase Adaptive Server Anywhere Professional Version 8 **************************************************************************** * Sign up today for your copy of the SQL Anywhere Studio 9 Developer Edition and try out the market-leading database for mobile, embedded and small to medium sized business environments for free! http://www.ianywhere.com/promos/deved/index.html ****************************************************...

watcom C/C++
Hi, is the Watcom C/C++ included in P++ Enterprise the full version (at least as far as WinNT/95 is concerned) or does it have missing components from the WC/C++ 11.0 compiler Regards Sanjay Minni Minisoft India ...

C Components Using Watcom C/C++ Compiler
This is a cryptographically signed message in MIME format. --------------ms2646818B6AC700D6597C3859 Content-Type: multipart/mixed; boundary="------------E0BFC7D7A6CA166C48EDA143" This is a multi-part message in MIME format. --------------E0BFC7D7A6CA166C48EDA143 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Does anyone have an example of C skeleton files and Watcom C/C++ make file to compile and load C components into Jaguar using the Watcom C/C++ compiler/Linker? --------------E0BFC7D7A6CA166C48EDA143 Content-Type: text/x-vcard; ch...

C/C++ typedefs
C++ automatically generates a typedef name when it sees struct Foo { .. } We have a few places that name the typedef with the same name as the tag (which I don't like as style anyway), and its causing problems when trying to compile a C++ extension lib with parrot headers. One example: interpreter.h struct Parrot_Interp; typedef struct Parrot_Interp *Parrot_Interp; This is fine for C but many people writing extensions won't be using C. -Melvin ...

c/c+ dll
Hi, I�m trying to do a c/c++ dll from Borland C++ and call it from PowerBuilder. But it doesn�t work, can anybody show me a simple example of a dll and how to call it form Powerbuilder. You can take a look at my MS example at my website http://members.cox.net/bdick. "Ra�l Ant�n del Ca�o" <ranton@unisoft-x.com> wrote in message news:jDWpNloTCHA.288@forums.sybase.com... > Hi, > > I�m trying to do a c/c++ dll from Borland C++ and call it from PowerBuilder. > But it doesn�t work, can anybody show me a simple example of a dll and how > to cal...

Web resources about - cvs commit: parrot chartype.c datatypes.c disassemble.c dod.c encoding.c global (fwd) - perl.perl6.internals

All sizes - iPod Disassemble - Photo 7 - Flickr - Photo Sharing!
Flickr is almost certainly the best online photo management and sharing application in the world. Show off your favorite photos and videos to ...

Chipworks Disassembles Apple's A8 SoC: GX6450, 4MB L3 Cache & More
One of the more enjoyable rituals with Apple’s annual iPhone launch is the decapping, deconstruction, and photographing of the processor die ...

iFixit disassembles the Xbox One and finds NAND, high repairability
No weird screws or glue make for easy repairs—and what's this 8GB of flash for?

How to disassemble the Apple Watch yourself in just 10 minutes
You're one of the few lucky people who has actually managed to get your hands on an Apple Watch — so naturally, it's time to dive in and take ...

The Quick, Easy, Dangerous Way to Get a Washing Machine to Disassemble Itself for Recycling
Australia-based machinist Ed Jones runs Ed Systems, a "Strange and somewhat crazy hobby shop that specializes in anything electrical, industrial, ...

iFixit disassembles new iPod Nano; criticizes solder, glue
Technology do-it-yourself repair part suppliers iFixit have completely disassembled the new seventh-generation iPod Nano. During the teardown, ...

Rifle Disassembles, Stores Entirely In Waterproof Stock
This is a new model of Henry Repeating Arms .22-caliber AR-7 that can be disassembled and stored in its waterproof buttstock . And speaking of ...

‘Moon Rabbit’ Fire Started When Attempt To Disassemble Went Wrong
The “moon rabbit” in Taiwan was set ablaze when workers attempted to disassemble it. It wasn’t a real bunny, but it was certainly really big. ...

iFixit disassembles the Mac Pro
If you thought the new year would bring an end to iFixit's disassembling tendencies, you might have stumbled into an alternate universe, friend. ...

Watch Emirates completely disassemble an Airbus A380 in 2 minutes
Airplanes, like cars, require regular maintenance checks; but they're usually done behind closed hangar doors. Emirates airline posted a time-lapse ...

Resources last updated: 1/11/2016 12:37:30 AM