38     list.append(pp);  in append()
40     for (int i = 0; i < q->list.len; i++) {  in append()
41       list.append(q->list.p[i]);  in append()
42       q->list.p[i] = 0;  in append()
44     q->list.len = 0;  in append()
49 list_box::list_box(box *pp) : list(pp), sty(-1)  in list_box()
54     list.p[0] = q->list.p[0];  in list_box()
55     for (int i = 1; i < q->list.len; i++) {  in list_box()
56       list.append(q->list.p[i]);  in list_box()
57       q->list.p[i] = 0;  in list_box()
59     q->list.len = 0;  in list_box()
95   for (i = 0; i < list.len; i++) {  in compute_metrics()
96     int t = list.p[i]->spacing_type;   in compute_metrics()
101 	  || (prevt = list.p[i-1]->spacing_type) == BINARY_TYPE  in compute_metrics()
106 	list.p[i]->spacing_type = ORDINARY_TYPE;  in compute_metrics()
111 	     && i > 0 && list.p[i-1]->spacing_type == BINARY_TYPE)  in compute_metrics()
112       list.p[i-1]->spacing_type = ORDINARY_TYPE;  in compute_metrics()
114   for (i = 0; i < list.len; i++) {  in compute_metrics()
116     if (i - 1 >= 0 && list.p[i - 1]->right_is_italic())  in compute_metrics()
118     if (i + 1 < list.len && list.p[i + 1]->left_is_italic())  in compute_metrics()
121       list.p[i]->hint(flags);  in compute_metrics()
125   for (i = 1; i < list.len; i++)  in compute_metrics()
126     total_spacing += compute_spacing(is_script, list.p[i-1]->spacing_type,  in compute_metrics()
127 				     list.p[i]->spacing_type);  in compute_metrics()
129   for (i = 0; i < list.len; i++)  in compute_metrics()
130     if (!list.p[i]->is_simple()) {  in compute_metrics()
131       int r = list.p[i]->compute_metrics(style);  in compute_metrics()
143   for (i = 0; i < list.len; i++)  in compute_metrics()
144     if (!list.p[i]->is_simple())  in compute_metrics()
145       printf("+\\n[" WIDTH_FORMAT "]", list.p[i]->uid);  in compute_metrics()
148   for (i = 0; i < list.len; i++)  in compute_metrics()
149     if (!list.p[i]->is_simple())  in compute_metrics()
150       printf(">?\\n[" HEIGHT_FORMAT "]", list.p[i]->uid);  in compute_metrics()
153   for (i = 0; i < list.len; i++)  in compute_metrics()
154     if (!list.p[i]->is_simple())  in compute_metrics()
155       printf(">?\\n[" DEPTH_FORMAT "]", list.p[i]->uid);  in compute_metrics()
158   for (i = 0; i < list.len && !have_simple; i++)  in compute_metrics()
159     have_simple = list.p[i]->is_simple();  in compute_metrics()
162     for (i = 0; i < list.len; i++)  in compute_metrics()
163       if (list.p[i]->is_simple())  in compute_metrics()
164 	list.p[i]->output();  in compute_metrics()
178   for (i = 1; i < n + 1 && i < list.len; i++)  in compute_sublist_width()
179     total_spacing += compute_spacing(is_script, list.p[i-1]->spacing_type,  in compute_sublist_width()
180 				     list.p[i]->spacing_type);  in compute_sublist_width()
183     if (!list.p[i]->is_simple())  in compute_sublist_width()
184       printf("+\\n[" WIDTH_FORMAT "]", list.p[i]->uid);  in compute_sublist_width()
187     have_simple = list.p[i]->is_simple();  in compute_sublist_width()
191       if (list.p[i]->is_simple())  in compute_sublist_width()
192 	list.p[i]->output();  in compute_sublist_width()
202   if (list.p[list.len-1]->is_simple())  in compute_subscript_kern()
203     list.p[list.len-1]->compute_metrics(sty);  in compute_subscript_kern()
204   list.p[list.len-1]->compute_subscript_kern();  in compute_subscript_kern()
206 	 uid, list.p[list.len-1]->uid);  in compute_subscript_kern()
211   for (int i = 0; i < list.len; i++) {  in output()
214 			      list.p[i-1]->spacing_type,  in output()
215 			      list.p[i]->spacing_type);  in output()
219     list.p[i]->output();  in output()
225   for (int i = 0; i < list.len; i++)  in handle_char_type()
226     list.p[i]->handle_char_type(st, ft);  in handle_char_type()
231   list.list_debug_print(" ");  in debug_print()
236   list.list_check_tabs(level);  in check_tabs()