Lines Matching defs:mt

50 			  struct mtermp *mt, \
145 struct mtermp mt;
152 memset(&mt, 0, sizeof(struct mtermp));
153 mt.lmargin[mt.lmargincur] = term_len(p, p->defindent);
154 mt.offset = term_len(p, p->defindent);
155 mt.pardist = 1;
164 print_man_nodelist(p, &mt,
178 print_man_nodelist(p, &mt, n, &man->meta);
241 mt->fl |= MANT_LITERAL;
243 mt->fl &= ~MANT_LITERAL;
268 mt->pardist = 1;
273 mt->pardist = term_vspan(p, &su);
313 savelit = MANT_LITERAL & mt->fl;
314 mt->fl &= ~MANT_LITERAL;
319 mt->fl |= MANT_LITERAL;
407 p->offset = mt->offset;
498 print_bvspace(p, n, mt->pardist);
506 if ( ! (MANT_LITERAL & mt->fl)) {
516 if (len < 0 && (size_t)(-len) > mt->offset)
517 len = -mt->offset;
520 mt->lmargin[mt->lmargincur] = len;
522 len = mt->lmargin[mt->lmargincur];
524 p->offset = mt->offset;
525 p->rmargin = mt->offset + len;
549 p->offset = mt->offset;
563 mt->lmargin[mt->lmargincur] = term_len(p, p->defindent);
564 print_bvspace(p, n, mt->pardist);
567 p->offset = mt->offset;
590 print_bvspace(p, n, mt->pardist);
601 if (len < 0 && (size_t)(-len) > mt->offset)
602 len = -mt->offset;
605 mt->lmargin[mt->lmargincur] = len;
607 len = mt->lmargin[mt->lmargincur];
611 p->offset = mt->offset;
612 p->rmargin = mt->offset + len;
614 savelit = MANT_LITERAL & mt->fl;
615 mt->fl &= ~MANT_LITERAL;
618 print_man_node(p, mt, n->child, meta);
621 mt->fl |= MANT_LITERAL;
625 p->offset = mt->offset + len;
648 p->offset = mt->offset;
671 print_bvspace(p, n, mt->pardist);
683 if (len < 0 && (size_t)(-len) > mt->offset)
684 len = -mt->offset;
687 mt->lmargin[mt->lmargincur] = len;
689 len = mt->lmargin[mt->lmargincur];
693 p->offset = mt->offset;
694 p->rmargin = mt->offset + len;
696 savelit = MANT_LITERAL & mt->fl;
697 mt->fl &= ~MANT_LITERAL;
705 print_man_node(p, mt, nn, meta);
710 mt->fl |= MANT_LITERAL;
713 p->offset = mt->offset + len;
735 p->offset = mt->offset;
749 mt->fl &= ~MANT_LITERAL;
750 mt->lmargin[mt->lmargincur] = term_len(p, p->defindent);
751 mt->offset = term_len(p, p->defindent);
765 for (i = 0; i < mt->pardist; i++)
771 p->rmargin = mt->offset;
772 p->trailspace = mt->offset;
776 p->offset = mt->offset;
811 mt->fl &= ~MANT_LITERAL;
812 mt->lmargin[mt->lmargincur] = term_len(p, p->defindent);
813 mt->offset = term_len(p, p->defindent);
826 for (i = 0; i < mt->pardist; i++)
832 p->rmargin = mt->offset;
833 p->trailspace = mt->offset;
837 p->offset = mt->offset;
883 n->aux = mt->lmargin[mt->lmargincur];
886 if (n->aux < 0 && (size_t)(-n->aux) > mt->offset)
887 n->aux = -mt->offset;
891 mt->offset += n->aux;
892 p->offset = mt->offset;
895 if (++mt->lmarginsz < MAXMARGINS)
896 mt->lmargincur = mt->lmarginsz;
898 mt->lmargin[mt->lmargincur] = term_len(p, p->defindent);
916 mt->offset -= n->parent->head->aux;
917 p->offset = mt->offset;
919 if (--mt->lmarginsz < MAXMARGINS)
920 mt->lmargincur = mt->lmarginsz;
941 print_man_node(p, mt, n->child->child, meta);
990 c = (*termacts[n->tok].pre)(p, mt, n, meta);
993 print_man_nodelist(p, mt, n->child, meta);
996 (*termacts[n->tok].post)(p, mt, n, meta);
1008 if (mt->fl & MANT_LITERAL &&
1036 print_man_node(p, mt, n, meta);