FORM
4.1
|
#include <structs.h>
Data Fields | |
int | parent |
int | left |
int | right |
int | value |
int | blnce |
int | usage |
The subexpressions in the compiler are kept track of in a (balanced) tree to reduce the need for subexpressions and hence save much space in large rhs expressions (like when we have xxxxxxx occurrences of objects like f(x+1,x+1) in which each x+1 becomes a subexpression. The struct that controls this tree is COMPTREE.
int parent |
Index of parent
Definition at line 282 of file structs.h.
Referenced by IniFbuffer(), and InitRecovery().
int left |
Left child (if not -1)
Definition at line 283 of file structs.h.
Referenced by IniFbuffer(), and InitRecovery().
int right |
Right child (if not -1)
Definition at line 284 of file structs.h.
Referenced by IniFbuffer(), and InitRecovery().
int value |
The object to be sorted and searched
Definition at line 285 of file structs.h.
Referenced by IniFbuffer(), and InitRecovery().
int blnce |
Balance factor
Definition at line 286 of file structs.h.
Referenced by IniFbuffer(), and InitRecovery().
int usage |
Number of uses in some types of trees
Definition at line 287 of file structs.h.
Referenced by CleanupArgCache(), and IniFbuffer().