ExpressionStack.hpp
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 ExpressionStack.hpp */
40 /* */
41 /* Primitive Expression Stack Class Definitions */
42 /* */
43 /******************************************************************************/
44 
45 #ifndef Included_RexxExpressionStack
46 #define Included_RexxExpressionStack
47 
48 #include "ArrayClass.hpp"
49 
50 class ProtectedObject;
51 class RexxActivity;
52 
54  public:
55 
56  inline void *operator new(size_t size, void *ptr) { return ptr;};
57  RexxExpressionStack(RexxObject **frames, size_t items) { stack = frames; size = items; top = stack; } // empty stack of size items
59  void live(size_t);
60  void liveGeneral(int reason);
61  void flatten(RexxEnvelope *);
62  void migrate(RexxActivity *);
63 
64  inline void setFrame(RexxObject **frames, size_t items) { stack = frames; size = items; top = stack; *top = OREF_NULL; }
65 
66  inline void send(RexxString *message, RexxObject *scope, size_t count, size_t namedCount, ProtectedObject &result) {
67  (*(this->top - count - (2 * namedCount)))->messageSend(message, (RexxObject **)(this->top - count - (2 * namedCount) + 1), count, namedCount, scope, result); };
68  inline void send(RexxString *message, size_t count, size_t namedCount, ProtectedObject &result) {
69  (*(this->top - count - (2 * namedCount)))->messageSend(message, (RexxObject **)(this->top -count - (2 * namedCount) + 1), count, namedCount, result); };
70  inline void push(RexxObject *value) { *(++this->top) = value; };
71  inline RexxObject * pop() { return *(this->top--); };
72  inline RexxObject * fastPop() { return *(this->top--); };
73  inline RexxArray * argumentArray(size_t count) { return (new (count, (RexxObject **)(this->top - (count - 1))) RexxArray); };
74  inline RexxObject **arguments(size_t count) { return (RexxObject **)(this->top - (count - 1)); };
75  inline void replace(size_t offset, RexxObject *value) { *(this->top - offset) = value; };
76  inline size_t getSize() {return this->size;};
77  inline RexxObject * getTop() {return *(this->top);};
78  inline void operatorResult(RexxObject *value) { *(--this->top) = value; };
79  inline void prefixResult(RexxObject *value) { *(this->top) = value; };
80  inline void popn(size_t c) {this->top -= c;};
81  inline void clear() {this->top = this->stack;};
82  inline RexxObject * peek(size_t v) {return *(this->top - v);};
83  inline RexxObject **pointer(size_t v) {return (this->top - v); };
84  inline size_t location() {return this->top - this->stack;};
85  inline void setTop(size_t v) {this->top = this->stack + v;};
86  inline void toss() { this->top--; };
87  inline RexxObject **getFrame() { return stack; }
88 
89 protected:
90 
91  size_t size; /* size of the expstack */
92  RexxObject **top; /* current expstack top location */
93  RexxObject **stack; /* actual stack values */
94 };
95 #endif
#define OREF_NULL
Definition: RexxCore.h:60
RexxExpressionStack(RexxObject **frames, size_t items)
RexxObject ** pointer(size_t v)
void send(RexxString *message, size_t count, size_t namedCount, ProtectedObject &result)
void setFrame(RexxObject **frames, size_t items)
void push(RexxObject *value)
void setTop(size_t v)
void flatten(RexxEnvelope *)
RexxObject * getTop()
void operatorResult(RexxObject *value)
RexxArray * argumentArray(size_t count)
RexxObject ** getFrame()
void prefixResult(RexxObject *value)
RexxObject * fastPop()
void liveGeneral(int reason)
void replace(size_t offset, RexxObject *value)
void migrate(RexxActivity *)
RexxObject ** arguments(size_t count)
void send(RexxString *message, RexxObject *scope, size_t count, size_t namedCount, ProtectedObject &result)
RexxObject * peek(size_t v)