Lines Matching full:mt

52 			  struct mtermp *mt, \
136 	{ pre_UR, post_UR, 0 }, /* MT */
153 	struct mtermp		 mt;
163 	memset(&mt, 0, sizeof(mt));
164 	mt.lmargin[mt.lmargincur] = term_len(p, 7);
165 	mt.offset = term_len(p, p->defindent);
166 	mt.pardist = 1;
185 			print_man_nodelist(p, &mt, n, man);
191 			print_man_nodelist(p, &mt, n, man);
266 		mt->pardist = 1;
271 		mt->pardist = term_vspan(p, &su);
384 		p->tcol->offset = mt->offset;
434 		print_bvspace(p, n, mt->pardist);
457 		if (len < 0 && (size_t)(-len) > mt->offset)
458 			len = -mt->offset;
461 		mt->lmargin[mt->lmargincur] = len;
463 		len = mt->lmargin[mt->lmargincur];
465 	p->tcol->offset = mt->offset;
466 	p->tcol->rmargin = mt->offset + len;
492 		p->tcol->offset = mt->offset;
505 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
506 		print_bvspace(p, n, mt->pardist);
511 		p->tcol->offset = mt->offset;
528 		print_bvspace(p, n, mt->pardist);
546 		if (len < 0 && (size_t)(-len) > mt->offset)
547 			len = -mt->offset;
550 		mt->lmargin[mt->lmargincur] = len;
552 		len = mt->lmargin[mt->lmargincur];
556 		p->tcol->offset = mt->offset;
557 		p->tcol->rmargin = mt->offset + len;
559 			print_man_node(p, mt, n->child, meta);
562 		p->tcol->offset = mt->offset + len;
585 		p->tcol->offset = mt->offset;
602 			print_bvspace(p, n, mt->pardist);
621 		if (len < 0 && (size_t)(-len) > mt->offset)
622 			len = -mt->offset;
625 		mt->lmargin[mt->lmargincur] = len;
627 		len = mt->lmargin[mt->lmargincur];
631 		p->tcol->offset = mt->offset;
632 		p->tcol->rmargin = mt->offset + len;
640 			print_man_node(p, mt, nn, meta);
645 		p->tcol->offset = mt->offset + len;
667 		p->tcol->offset = mt->offset;
681 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
682 		mt->offset = term_len(p, p->defindent);
693 		for (i = 0; i < mt->pardist; i++)
700 		p->tcol->rmargin = mt->offset;
701 		p->trailspace = mt->offset / term_len(p, 1);
705 		p->tcol->offset = mt->offset;
723 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
724 		mt->offset = term_len(p, p->defindent);
735 		for (i = 0; i < mt->pardist; i++)
742 		p->tcol->rmargin = mt->offset;
743 		p->trailspace = mt->offset / term_len(p, 1);
747 		p->tcol->offset = mt->offset;
795 		n->aux = mt->lmargin[mt->lmargincur];
798 	if (n->aux < 0 && (size_t)(-n->aux) > mt->offset)
799 		n->aux = -mt->offset;
803 	mt->offset += n->aux;
804 	p->tcol->offset = mt->offset;
807 	if (++mt->lmarginsz < MAXMARGINS)
808 		mt->lmargincur = mt->lmarginsz;
810 	mt->lmargin[mt->lmargincur] = term_len(p, 7);
827 	mt->offset -= n->parent->head->aux;
828 	p->tcol->offset = mt->offset;
829 	if (--mt->lmarginsz < MAXMARGINS)
830 		mt->lmargincur = mt->lmarginsz;
842 			print_bvspace(p, n, mt->pardist);
858 		p->tcol->offset = mt->offset;
859 		p->tcol->rmargin = mt->offset + len;
866 		mt->lmargin[mt->lmargincur] = len;
867 		p->tcol->offset = mt->offset + len;
889 		p->tcol->offset = mt->offset;
912 		print_man_node(p, mt, n->child->child, meta);
993 		c = (*act->pre)(p, mt, n, meta);
996 		print_man_nodelist(p, mt, n->child, meta);
999 		(*act->post)(p, mt, n, meta);
1018 		print_man_node(p, mt, n, meta);