eqn
static void eqn(void);
eqn();
eqn();
| left eqn right { paren($1, $2, $3); }
list : eqn { lp[ct++] = $1; }
| list ABOVE eqn { lp[ct++] = $3; }
pbox : '{' eqn '}' { $$ = $2; }
stuff : eqn { putout($1); }
eqn : box
| eqn box { eqnbox($1, $2, 0); }
| eqn lineupbox { eqnbox($1, $2, 1); }
int eqn(int, char *[]);
return (eqn(argc, argv));
parent = ep->node->eqn;
print_eqn(h, n->eqn);
term_eqn(p, n->eqn);
print_eqn(h, n->eqn);
term_eqn(p, n->eqn);
eqn_box_free(n->eqn);
struct eqn_node *eqn; /* active equation parser */
if (len > 80 && r->tbl == NULL && r->eqn == NULL &&
(r->eqn == NULL || r->eqn_inline)) {
if (r->eqn != NULL && strncmp(buf->buf + ppos, ".EN", 3)) {
eqn_read(r->eqn, buf->buf + ppos);
if (r->eqn != NULL) {
r->eqn->node->line, r->eqn->node->pos, "EQ");
eqn_parse(r->eqn);
r->eqn = NULL;
cp2 = strchr(cp1, r->eqn == NULL ?
if (r->eqn == NULL)
if (r->eqn == NULL) {
if (r->eqn != NULL)
r->eqn_inline = r->eqn == NULL;
n->eqn = eqn_box_new();
assert(r->eqn == NULL);
r->eqn = r->last_eqn;
r->eqn->node = n;
if (r->eqn != NULL) {
eqn_parse(r->eqn);
r->eqn = NULL;
r->last_eqn = r->eqn = NULL;
struct eqn_box *eqn; /* EQN */
if (n->eqn)
print_box(n->eqn->first, indent + 4);
if (n->eqn)
print_box(n->eqn->first, indent + 4);
uint32_t eqn :6;
tavor_eq_doorbell(tavor_state_t *state, uint32_t eq_cmd, uint32_t eqn,
((uint64_t)eqn << TAVOR_EQDB_EQN_SHIFT) | eq_param;
void hermon_eq_doorbell(hermon_state_t *state, uint32_t eq_cmd, uint32_t eqn,
void tavor_eq_doorbell(tavor_state_t *state, uint32_t eq_cmd, uint32_t eqn,
uint32_t eqn :6;