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);
264 		mt->pardist = 1;
269 		mt->pardist = term_vspan(p, &su);
382 		p->tcol->offset = mt->offset;
431 		print_bvspace(p, n, mt->pardist);
454 		if (len < 0 && (size_t)(-len) > mt->offset)
455 			len = -mt->offset;
458 		mt->lmargin[mt->lmargincur] = len;
460 		len = mt->lmargin[mt->lmargincur];
462 	p->tcol->offset = mt->offset;
463 	p->tcol->rmargin = mt->offset + len;
489 		p->tcol->offset = mt->offset;
502 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
503 		print_bvspace(p, n, mt->pardist);
508 		p->tcol->offset = mt->offset;
525 		print_bvspace(p, n, mt->pardist);
543 		if (len < 0 && (size_t)(-len) > mt->offset)
544 			len = -mt->offset;
547 		mt->lmargin[mt->lmargincur] = len;
549 		len = mt->lmargin[mt->lmargincur];
553 		p->tcol->offset = mt->offset;
554 		p->tcol->rmargin = mt->offset + len;
556 			print_man_node(p, mt, n->child, meta);
559 		p->tcol->offset = mt->offset + len;
582 		p->tcol->offset = mt->offset;
599 			print_bvspace(p, n, mt->pardist);
618 		if (len < 0 && (size_t)(-len) > mt->offset)
619 			len = -mt->offset;
622 		mt->lmargin[mt->lmargincur] = len;
624 		len = mt->lmargin[mt->lmargincur];
628 		p->tcol->offset = mt->offset;
629 		p->tcol->rmargin = mt->offset + len;
637 			print_man_node(p, mt, nn, meta);
642 		p->tcol->offset = mt->offset + len;
664 		p->tcol->offset = mt->offset;
678 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
679 		mt->offset = term_len(p, p->defindent);
690 		for (i = 0; i < mt->pardist; i++)
696 		p->tcol->rmargin = mt->offset;
697 		p->trailspace = mt->offset;
701 		p->tcol->offset = mt->offset;
719 		mt->lmargin[mt->lmargincur] = term_len(p, 7);
720 		mt->offset = term_len(p, p->defindent);
731 		for (i = 0; i < mt->pardist; i++)
737 		p->tcol->rmargin = mt->offset;
738 		p->trailspace = mt->offset;
742 		p->tcol->offset = mt->offset;
788 		n->aux = mt->lmargin[mt->lmargincur];
791 	if (n->aux < 0 && (size_t)(-n->aux) > mt->offset)
792 		n->aux = -mt->offset;
796 	mt->offset += n->aux;
797 	p->tcol->offset = mt->offset;
800 	if (++mt->lmarginsz < MAXMARGINS)
801 		mt->lmargincur = mt->lmarginsz;
803 	mt->lmargin[mt->lmargincur] = term_len(p, 7);
820 	mt->offset -= n->parent->head->aux;
821 	p->tcol->offset = mt->offset;
822 	if (--mt->lmarginsz < MAXMARGINS)
823 		mt->lmargincur = mt->lmarginsz;
835 			print_bvspace(p, n, mt->pardist);
849 		p->tcol->offset = mt->offset;
850 		p->tcol->rmargin = mt->offset + len;
857 		mt->lmargin[mt->lmargincur] = len;
858 		p->tcol->offset = mt->offset + len;
880 		p->tcol->offset = mt->offset;
903 		print_man_node(p, mt, n->child->child, meta);
984 		c = (*act->pre)(p, mt, n, meta);
987 		print_man_nodelist(p, mt, n->child, meta);
990 		(*act->post)(p, mt, n, meta);
1009 		print_man_node(p, mt, n, meta);