TRex::_nodes field

exp->_nodes[r].left = exp->_nodes[first].type;

arg_rex.c:521

exp->_nodes[r].right = t;

arg_rex.c:523

exp->_nodes[chain].next = r;

arg_rex.c:524

exp->_nodes[chain].next = c;

arg_rex.c:530

exp->_nodes[chain].next = c;

arg_rex.c:540

exp->_nodes[ret].left = exp->_nodes[ret].next;

arg_rex.c:545

exp->_nodes[ret].next = -1;

arg_rex.c:546

exp->_nodes[expr].left = newn;

arg_rex.c:577

exp->_nodes[nnode].left = ret;

arg_rex.c:649

exp->_nodes[nnode].right = ((p0) << 16) | p1;

arg_rex.c:650

exp->_nodes[ret].next = nnode;

arg_rex.c:657

exp->_nodes[ret].next = e;

arg_rex.c:671

trex_list()

exp->_nodes[temp].left = ret;

arg_rex.c:679

trex_list()

exp->_nodes[temp].right = tright;

arg_rex.c:681

trex_list()

} while ((node->next != -1) && ((node = &exp->_nodes[node->next]) != NULL));

arg_rex.c:752

trex_matchclass()

greedystop = &exp->_nodes[node->next];

arg_rex.c:766

if ((s = trex_matchnode(exp, &exp->_nodes[node->left], s, greedystop)) == NULL)

arg_rex.c:773

gnext = &exp->_nodes[greedystop->next];

arg_rex.c:783

gnext = &exp->_nodes[next->next];

arg_rex.c:785

TRexNode* temp = &exp->_nodes[node->left];

arg_rex.c:813

temp = &exp->_nodes[temp->next];

arg_rex.c:816

temp = &exp->_nodes[node->right];

arg_rex.c:821

temp = &exp->_nodes[temp->next];

arg_rex.c:824

TRexNode* n = &exp->_nodes[node->left];

arg_rex.c:833

subnext = &exp->_nodes[n->next];

arg_rex.c:845

} while ((n->next != -1) && ((n = &exp->_nodes[n->next]) != NULL));

arg_rex.c:856

if (trex_matchclass(exp, &exp->_nodes[node->left], *str) ? (type == OP_CLASS ? TRex_True : TRex_False)

arg_rex.c:882