tree Struct Reference

#include <structs.h>

Data Fields
int	parent
int	left
int	right
int	value
int	blnce
int	usage

Detailed Description

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.

Definition at line 293 of file structs.h.

Field Documentation

parent

int parent

Index of parent

Definition at line 294 of file structs.h.

Referenced by IniFbuffer().

left

int left

Left child (if not -1)

Definition at line 295 of file structs.h.

Referenced by IniFbuffer().

right

int right

Right child (if not -1)

Definition at line 296 of file structs.h.

Referenced by IniFbuffer().

value

int value

The object to be sorted and searched

Definition at line 297 of file structs.h.

Referenced by IniFbuffer().

blnce

int blnce

Balance factor

Definition at line 298 of file structs.h.

Referenced by IniFbuffer().

usage

int usage

Number of uses in some types of trees

Definition at line 299 of file structs.h.

Referenced by CleanupArgCache(), and IniFbuffer().

---

The documentation for this struct was generated from the following file:

• structs.h