366     space_total += n->nspaces();  in add_node()
459   if (p && p->nspaces() == 1 && p->width() == x  in space()
1707     space_total -= line->nspaces();  in newline()
1892     s -= n->nspaces();  in choose_breakpoint()
1915 		   ? (bp->nspaces > 0  in choose_breakpoint()
1917 			    + (bp->nspaces - 1)*hresolution)/bp->nspaces)  in choose_breakpoint()
2051 static void distribute_space(node *n, int nspaces, hunits desired_space,  in distribute_space()  argument
2057   if (!force_reverse && nspaces > 0 && spread_limit >= 0  in distribute_space()
2060     double Ems = (double)desired_space.to_units() / nspaces  in distribute_space()
2066     tem->spread_space(&nspaces, &desired_space);  in distribute_space()
2071   assert(desired_space.is_zero() && nspaces == 0);  in distribute_space()
2098       if (bp->nspaces != 0)  in possibly_break_line()
2112     distribute_space(pre, bp->nspaces, extra_space_width);  in possibly_break_line()
2133 	space_total += tem->nspaces();  in possibly_break_line()
2344     space_total -= line->nspaces();  in do_break()
2948       if (p->nspaces()) {  in start_field()