UpperInstruction.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 Translator */
40 /* */
41 /* Primitive Upper Parse Class */
42 /* */
43 /******************************************************************************/
44 #include <stdlib.h>
45 #include "RexxCore.h"
46 #include "QueueClass.hpp"
47 #include "RexxActivation.hpp"
48 #include "UpperInstruction.hpp"
50 #include "StackClass.hpp"
51 #include "RexxActivity.hpp"
52 #include "BufferClass.hpp"
53 
55  size_t varCount, /* number of variables to process */
56  RexxQueue *variable_list) /* list of variables to upper */
57 /******************************************************************************/
58 /* Complete initialization of an UPPER instruction */
59 /******************************************************************************/
60 {
61  /* get the variable size */
62  variableCount = varCount; /* save the variable count */
63  while (varCount > 0) /* loop through the variable list */
64  {
65  /* copying each variable */
66  OrefSet(this, this->variables[--varCount], (RexxVariableBase *)variable_list->pop());
67  }
68 }
69 
70 void RexxInstructionUpper::live(size_t liveMark)
71 /******************************************************************************/
72 /* Function: Normal garbage collection live marking */
73 /******************************************************************************/
74 {
75  size_t i; /* loop counter */
76  size_t count; /* argument count */
77 
78  memory_mark(this->nextInstruction); /* must be first one marked */
79  for (i = 0, count = variableCount; i < count; i++)
80  {
81  memory_mark(this->variables[i]);
82  }
83 }
84 
86 /******************************************************************************/
87 /* Function: Generalized object marking */
88 /******************************************************************************/
89 {
90  size_t i; /* loop counter */
91  size_t count; /* argument count */
92 
93  /* must be first one marked */
95  for (i = 0, count = variableCount; i < count; i++)
96  {
98  }
99 }
100 
102 /******************************************************************************/
103 /* Function: Flatten an object */
104 /******************************************************************************/
105 {
106  size_t i; /* loop counter */
107  size_t count; /* argument count */
108 
110 
111  flatten_reference(newThis->nextInstruction, envelope);
112  for (i = 0, count = variableCount; i < count; i++)
113  {
114  flatten_reference(newThis->variables[i], envelope);
115  }
116 
118 }
119 
121  RexxActivation *context, /* current activation context */
122  RexxExpressionStack *stack) /* evaluation stack */
123 /******************************************************************************/
124 /* Function: Execute a REXX UPPER instruction */
125 /**********************************************************************************/
126 {
127  size_t size; /* size of guard variables list */
128  size_t i; /* loop counter */
129 
130  context->traceInstruction(this); /* trace if necessary */
131  /* get the array size */
132  size = variableCount; /* get the variable list size */
133 
134  for (i = 0; i < size; i++) /* loop through the variable list */
135  {
136  /* have the variable upper itself */
137  variables[i]->upper(context);
138  }
139  context->pauseInstruction(); /* do debug pause if necessary */
140 }
141 
#define OrefSet(o, r, v)
Definition: RexxCore.h:94
#define memory_mark(oref)
Definition: RexxMemory.hpp:445
#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 traceInstruction(RexxInstruction *v)
RexxInstruction * nextInstruction
void execute(RexxActivation *, RexxExpressionStack *)
RexxInstructionUpper(size_t, RexxQueue *)
void flatten(RexxEnvelope *)
RexxVariableBase * variables[1]
void liveGeneral(int reason)
RexxObject * pop()
Definition: QueueClass.hpp:80
virtual void upper(RexxActivation *)