RexxInternalStack.cpp
Go to the documentation of this file.
1 /*----------------------------------------------------------------------------*/
2 /* */
3 /* Copyright (c) 1995, 2004 IBM Corporation. All rights reserved. */
4 /* Copyright (c) 2005-2009 Rexx Language Association. All rights reserved. */
5 /* */
6 /* This program and the accompanying materials are made available under */
7 /* the terms of the Common Public License v1.0 which accompanies this */
8 /* distribution. A copy is also available at the following address: */
9 /* http://www.oorexx.org/license.html */
10 /* */
11 /* Redistribution and use in source and binary forms, with or */
12 /* without modification, are permitted provided that the following */
13 /* conditions are met: */
14 /* */
15 /* Redistributions of source code must retain the above copyright */
16 /* notice, this list of conditions and the following disclaimer. */
17 /* Redistributions in binary form must reproduce the above copyright */
18 /* notice, this list of conditions and the following disclaimer in */
19 /* the documentation and/or other materials provided with the distribution. */
20 /* */
21 /* Neither the name of Rexx Language Association nor the names */
22 /* of its contributors may be used to endorse or promote products */
23 /* derived from this software without specific prior written permission. */
24 /* */
25 /* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS */
26 /* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT */
27 /* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS */
28 /* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT */
29 /* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, */
30 /* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED */
31 /* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, */
32 /* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY */
33 /* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING */
34 /* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS */
35 /* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
36 /* */
37 /*----------------------------------------------------------------------------*/
38 /******************************************************************************/
39 /* REXX Kernel RexxInternalStack.c */
40 /* */
41 /* Primitive Internal Use Stack Class */
42 /* */
43 /******************************************************************************/
44 #include <stdlib.h>
45 #include "RexxCore.h"
46 #include "StringClass.hpp"
47 #include "RexxInternalStack.hpp"
48 
49 void RexxInternalStack::live(size_t liveMark)
50 /******************************************************************************/
51 /* Function: Normal garbage collection live marking */
52 /******************************************************************************/
53 {
54  RexxObject **entry; /* marked stack entry */
55 
56  /* loop through the stack entries */
57  for (entry = this->stack; entry <= this->top; entry++)
58  {
59  memory_mark(*entry); /* marking each one */
60  }
61 }
62 
64 /******************************************************************************/
65 /* Function: Generalized object marking */
66 /******************************************************************************/
67 {
68  RexxObject **entry; /* marked stack entry */
69 
70  /* loop through the stack entries */
71  for (entry = this->stack; entry <= this->top; entry++)
72  {
73  memory_mark_general(*entry); /* marking each one */
74  }
75 }
76 
78 /******************************************************************************/
79 /* Function: Flatten an object */
80 /******************************************************************************/
81 {
83 
84  size_t i; /* pointer for scanning stack entries*/
85  size_t count; /* number of elements */
86 
87  count = this->top - this->stack; /* get the total count */
88  /* loop through the stack entries */
89  for (i = 0; i < count; i++)
90  {
91  flatten_reference(newThis->stack[i], envelope);
92  }
94 }
95 
97  size_t stackSize) /* stack size */
98 /******************************************************************************/
99 /* Function: Create a new expression stack */
100 /******************************************************************************/
101 {
102  RexxInternalStack* newObj; /* newly create stack */
103 
104  /* Get new object */
105  newObj = (RexxInternalStack *)new_object(sizeof(RexxInternalStack) + (stackSize * sizeof(RexxObject *)), T_InternalStack);
106  newObj->size = stackSize; /* set the size */
107  newObj->top = newObj->stack; /* set the top element */
108  /* set marker for "end of object" to */
109  /* protect against stack overflow */
110  newObj->stack[0] = OREF_NULL; /* clear out the first element */
111  return newObj; /* return the new stack item */
112 }
113 
@ T_InternalStack
#define OREF_NULL
Definition: RexxCore.h:60
#define memory_mark(oref)
Definition: RexxMemory.hpp:445
RexxObject * new_object(size_t s)
Definition: RexxMemory.hpp:431
#define flatten_reference(oref, envel)
Definition: RexxMemory.hpp:493
#define memory_mark_general(oref)
Definition: RexxMemory.hpp:446
#define cleanUpFlatten
Definition: RexxMemory.hpp:479
#define setUpFlatten(type)
Definition: RexxMemory.hpp:473
void flatten(RexxEnvelope *)
static RexxInternalStack * newInstance(size_t s)
RexxObject * stack[1]
void liveGeneral(int reason)