ProcedureInstruction.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 Procedure Parse Class */
42 /* */
43 /******************************************************************************/
44 #include <stdlib.h>
45 #include "RexxCore.h"
46 #include "QueueClass.hpp"
47 #include "RexxActivation.hpp"
48 #include "ProcedureInstruction.hpp"
50 
52  size_t varCount, /* number of variables */
53  RexxQueue *variable_list) /* supplied variable list */
54 /******************************************************************************/
55 /* Function: Complete initialization of a PROCEDURE instruction object */
56 /******************************************************************************/
57 {
58  /* get the variable size */
59  variableCount = varCount;
60  while (varCount > 0) /* loop through the variable list */
61  {
62  /* copying each variable */
63  OrefSet(this, this->variables[--varCount], (RexxVariableBase *)variable_list->pop());
64  }
65 }
66 
67 void RexxInstructionProcedure::live(size_t liveMark)
68 /******************************************************************************/
69 /* Function: Normal garbage collection live marking */
70 /******************************************************************************/
71 {
72  size_t i; /* loop counter */
73  size_t count; /* argument count */
74 
75  memory_mark(this->nextInstruction); /* must be first one marked */
76  for (i = 0, count = variableCount; i < count; i++)
77  {
78  memory_mark(this->variables[i]);
79  }
80 }
81 
82 
84 /******************************************************************************/
85 /* Function: Generalized object marking */
86 /******************************************************************************/
87 {
88  size_t i; /* loop counter */
89  size_t count; /* argument count */
90 
91  /* must be first one marked */
93  for (i = 0, count = variableCount; i < count; i++)
94  {
96  }
97 }
98 
100 /******************************************************************************/
101 /* Function: Flatten an object */
102 /******************************************************************************/
103 {
104  size_t i; /* loop counter */
105  size_t count; /* argument count */
106 
108 
109  flatten_reference(newThis->nextInstruction, envelope);
110  for (i = 0, count = variableCount; i < count; i++)
111  {
112  flatten_reference(newThis->variables[i], envelope);
113  }
114 
116 }
117 
119  RexxActivation *context, /* current activation context */
120  RexxExpressionStack *stack) /* evaluation stack */
121 /******************************************************************************/
122 /* Function: Execute a REXX PROCEDURE instruction */
123 /******************************************************************************/
124 {
125  context->traceInstruction(this); /* trace if necessary */
126  /* have the context expose these */
128  context->pauseInstruction(); /* do debug pause if necessary */
129 }
130 
#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 procedureExpose(RexxVariableBase **variables, size_t count)
void traceInstruction(RexxInstruction *v)
RexxInstruction * nextInstruction
void flatten(RexxEnvelope *)
RexxVariableBase * variables[1]
void execute(RexxActivation *, RexxExpressionStack *)
RexxInstructionProcedure(size_t, RexxQueue *)
RexxObject * pop()
Definition: QueueClass.hpp:80