]>
git.ipfire.org Git - thirdparty/systemd.git/blob - src/shared/format-table.c
1 /* SPDX-License-Identifier: LGPL-2.1+ */
5 #include "alloc-util.h"
8 #include "format-table.h"
11 #include "parse-util.h"
12 #include "string-util.h"
13 #include "terminal-util.h"
14 #include "time-util.h"
18 #define DEFAULT_WEIGHT 100
21 A few notes on implementation details:
23 - TableCell is a 'fake' structure, it's just used as data type to pass references to specific cell positions in the
24 table. It can be easily converted to an index number and back.
26 - TableData is where the actual data is stored: it encapsulates the data and formatting for a specific cell. It's
27 'pseudo-immutable' and ref-counted. When a cell's data's formatting is to be changed, we duplicate the object if the
28 ref-counting is larger than 1. Note that TableData and its ref-counting is mostly not visible to the outside. The
29 outside only sees Table and TableCell.
31 - The Table object stores a simple one-dimensional array of references to TableData objects, one row after the
34 - There's no special concept of a "row" or "column" in the table, and no special concept of the "header" row. It's all
35 derived from the cell index: we know how many cells are to be stored in a row, and can determine the rest from
36 that. The first row is always the header row. If header display is turned off we simply skip outputting the first
37 row. Also, when sorting rows we always leave the first row where it is, as the header shouldn't move.
39 - Note because there's no row and no column object some properties that might be appropriate as row/column properties
40 are exposed as cell properties instead. For example, the "weight" of a column (which is used to determine where to
41 add/remove space preferable when expanding/compressing tables horizontally) is actually made the "weight" of a
42 cell. Given that we usually need it per-column though we will calculate the average across every cell of the column
45 - To make things easy, when cells are added without any explicit configured formatting, then we'll copy the formatting
46 from the same cell in the previous cell. This is particularly useful for the "weight" of the cell (see above), as
47 this means setting the weight of the cells of the header row will nicely propagate to all cells in the other rows.
50 typedef struct TableData
{
54 size_t minimum_width
; /* minimum width for the column */
55 size_t maximum_width
; /* maximum width for the column */
56 unsigned weight
; /* the horizontal weight for this column, in case the table is expanded/compressed */
57 unsigned ellipsize_percent
; /* 0 … 100, where to place the ellipsis when compression is needed */
58 unsigned align_percent
; /* 0 … 100, where to pad with spaces when expanding is needed. 0: left-aligned, 100: right-aligned */
60 const char * color
; /* ANSI color string to use for this cell. When written to terminal should not move cursor. Will automatically be reset after the cell */
61 char * formatted
; /* A cached textual representation of the cell data, before ellipsation/alignment */
64 uint8_t data
[ 0 ]; /* data is generic array */
71 /* … add more here as we start supporting more cell data types … */
75 static size_t TABLE_CELL_TO_INDEX ( TableCell
* cell
) {
80 i
= PTR_TO_SIZE ( cell
);
86 static TableCell
* TABLE_INDEX_TO_CELL ( size_t index
) {
87 assert ( index
!= ( size_t ) - 1 );
88 return SIZE_TO_PTR ( index
+ 1 );
95 bool header
; /* Whether to show the header row? */
96 size_t width
; /* If != (size_t) -1 the width to format this table in */
101 size_t * display_map
; /* List of columns to show (by their index). It's fine if columns are listed multiple times or not at all */
102 size_t n_display_map
;
104 size_t * sort_map
; /* The columns to order rows by, in order of preference. */
108 Table
* table_new_raw ( size_t n_columns
) {
109 _cleanup_ ( table_unrefp
) Table
* t
= NULL
;
111 assert ( n_columns
> 0 );
117 * t
= ( struct Table
) {
118 . n_columns
= n_columns
,
120 . width
= ( size_t ) - 1 ,
126 Table
* table_new_internal ( const char * first_header
, ...) {
127 _cleanup_ ( table_unrefp
) Table
* t
= NULL
;
128 size_t n_columns
= 1 ;
132 assert ( first_header
);
134 va_start ( ap
, first_header
);
138 h
= va_arg ( ap
, const char *);
146 t
= table_new_raw ( n_columns
);
150 r
= table_add_cell ( t
, NULL
, TABLE_STRING
, first_header
);
154 va_start ( ap
, first_header
);
158 h
= va_arg ( ap
, const char *);
162 r
= table_add_cell ( t
, NULL
, TABLE_STRING
, h
);
170 assert ( t
-> n_columns
== t
-> n_cells
);
174 static TableData
* table_data_free ( TableData
* d
) {
181 DEFINE_PRIVATE_TRIVIAL_REF_UNREF_FUNC ( TableData
, table_data
, table_data_free
);
182 DEFINE_TRIVIAL_CLEANUP_FUNC ( TableData
*, table_data_unref
);
184 Table
* table_unref ( Table
* t
) {
190 for ( i
= 0 ; i
< t
-> n_cells
; i
++)
191 table_data_unref ( t
-> data
[ i
]);
194 free ( t
-> display_map
);
200 static size_t table_data_size ( TableDataType type
, const void * data
) {
208 return strlen ( data
) + 1 ;
213 case TABLE_TIMESTAMP
:
215 return sizeof ( usec_t
);
218 return sizeof ( uint64_t );
221 return sizeof ( uint32_t );
224 assert_not_reached ( "Uh? Unexpected cell type" );
228 static bool table_data_matches (
232 size_t minimum_width
,
233 size_t maximum_width
,
235 unsigned align_percent
,
236 unsigned ellipsize_percent
) {
244 if ( d
-> minimum_width
!= minimum_width
)
247 if ( d
-> maximum_width
!= maximum_width
)
250 if ( d
-> weight
!= weight
)
253 if ( d
-> align_percent
!= align_percent
)
256 if ( d
-> ellipsize_percent
!= ellipsize_percent
)
259 k
= table_data_size ( type
, data
);
260 l
= table_data_size ( d
-> type
, d
-> data
);
265 return memcmp ( data
, d
-> data
, l
) == 0 ;
268 static TableData
* table_data_new (
271 size_t minimum_width
,
272 size_t maximum_width
,
274 unsigned align_percent
,
275 unsigned ellipsize_percent
) {
280 data_size
= table_data_size ( type
, data
);
282 d
= malloc0 ( offsetof ( TableData
, data
) + data_size
);
288 d
-> minimum_width
= minimum_width
;
289 d
-> maximum_width
= maximum_width
;
291 d
-> align_percent
= align_percent
;
292 d
-> ellipsize_percent
= ellipsize_percent
;
293 memcpy_safe ( d
-> data
, data
, data_size
);
298 int table_add_cell_full (
300 TableCell
** ret_cell
,
303 size_t minimum_width
,
304 size_t maximum_width
,
306 unsigned align_percent
,
307 unsigned ellipsize_percent
) {
309 _cleanup_ ( table_data_unrefp
) TableData
* d
= NULL
;
314 assert ( type
< _TABLE_DATA_TYPE_MAX
);
316 /* Determine the cell adjacent to the current one, but one row up */
317 if ( t
-> n_cells
>= t
-> n_columns
)
318 assert_se ( p
= t
-> data
[ t
-> n_cells
- t
-> n_columns
]);
322 /* If formatting parameters are left unspecified, copy from the previous row */
323 if ( minimum_width
== ( size_t ) - 1 )
324 minimum_width
= p
? p
-> minimum_width
: 1 ;
326 if ( weight
== ( unsigned ) - 1 )
327 weight
= p
? p
-> weight
: DEFAULT_WEIGHT
;
329 if ( align_percent
== ( unsigned ) - 1 )
330 align_percent
= p
? p
-> align_percent
: 0 ;
332 if ( ellipsize_percent
== ( unsigned ) - 1 )
333 ellipsize_percent
= p
? p
-> ellipsize_percent
: 100 ;
335 assert ( align_percent
<= 100 );
336 assert ( ellipsize_percent
<= 100 );
338 /* Small optimization: Pretty often adjacent cells in two subsequent lines have the same data and
339 * formatting. Let's see if we can reuse the cell data and ref it once more. */
341 if ( p
&& table_data_matches ( p
, type
, data
, minimum_width
, maximum_width
, weight
, align_percent
, ellipsize_percent
))
342 d
= table_data_ref ( p
);
344 d
= table_data_new ( type
, data
, minimum_width
, maximum_width
, weight
, align_percent
, ellipsize_percent
);
349 if (! GREEDY_REALLOC ( t
-> data
, t
-> n_allocated
, MAX ( t
-> n_cells
+ 1 , t
-> n_columns
)))
353 * ret_cell
= TABLE_INDEX_TO_CELL ( t
-> n_cells
);
355 t
-> data
[ t
-> n_cells
++] = TAKE_PTR ( d
);
360 int table_dup_cell ( Table
* t
, TableCell
* cell
) {
365 /* Add the data of the specified cell a second time as a new cell to the end. */
367 i
= TABLE_CELL_TO_INDEX ( cell
);
371 if (! GREEDY_REALLOC ( t
-> data
, t
-> n_allocated
, MAX ( t
-> n_cells
+ 1 , t
-> n_columns
)))
374 t
-> data
[ t
-> n_cells
++] = table_data_ref ( t
-> data
[ i
]);
378 static int table_dedup_cell ( Table
* t
, TableCell
* cell
) {
384 /* Helper call that ensures the specified cell's data object has a ref count of 1, which we can use before
385 * changing a cell's formatting without effecting every other cell's formatting that shares the same data */
387 i
= TABLE_CELL_TO_INDEX ( cell
);
391 assert_se ( od
= t
-> data
[ i
]);
395 assert ( od
-> n_ref
> 1 );
397 nd
= table_data_new ( od
-> type
, od
-> data
, od
-> minimum_width
, od
-> maximum_width
, od
-> weight
, od
-> align_percent
, od
-> ellipsize_percent
);
401 table_data_unref ( od
);
404 assert ( nd
-> n_ref
== 1 );
409 static TableData
* table_get_data ( Table
* t
, TableCell
* cell
) {
415 /* Get the data object of the specified cell, or NULL if it doesn't exist */
417 i
= TABLE_CELL_TO_INDEX ( cell
);
422 assert ( t
-> data
[ i
]-> n_ref
> 0 );
427 int table_set_minimum_width ( Table
* t
, TableCell
* cell
, size_t minimum_width
) {
433 if ( minimum_width
== ( size_t ) - 1 )
436 r
= table_dedup_cell ( t
, cell
);
440 table_get_data ( t
, cell
)-> minimum_width
= minimum_width
;
444 int table_set_maximum_width ( Table
* t
, TableCell
* cell
, size_t maximum_width
) {
450 r
= table_dedup_cell ( t
, cell
);
454 table_get_data ( t
, cell
)-> maximum_width
= maximum_width
;
458 int table_set_weight ( Table
* t
, TableCell
* cell
, unsigned weight
) {
464 if ( weight
== ( unsigned ) - 1 )
465 weight
= DEFAULT_WEIGHT
;
467 r
= table_dedup_cell ( t
, cell
);
471 table_get_data ( t
, cell
)-> weight
= weight
;
475 int table_set_align_percent ( Table
* t
, TableCell
* cell
, unsigned percent
) {
481 if ( percent
== ( unsigned ) - 1 )
484 assert ( percent
<= 100 );
486 r
= table_dedup_cell ( t
, cell
);
490 table_get_data ( t
, cell
)-> align_percent
= percent
;
494 int table_set_ellipsize_percent ( Table
* t
, TableCell
* cell
, unsigned percent
) {
500 if ( percent
== ( unsigned ) - 1 )
503 assert ( percent
<= 100 );
505 r
= table_dedup_cell ( t
, cell
);
509 table_get_data ( t
, cell
)-> ellipsize_percent
= percent
;
513 int table_set_color ( Table
* t
, TableCell
* cell
, const char * color
) {
519 r
= table_dedup_cell ( t
, cell
);
523 table_get_data ( t
, cell
)-> color
= empty_to_null ( color
);
527 int table_add_many_internal ( Table
* t
, TableDataType first_type
, ...) {
533 assert ( first_type
>= 0 );
534 assert ( first_type
< _TABLE_DATA_TYPE_MAX
);
538 va_start ( ap
, first_type
);
555 data
= va_arg ( ap
, const char *);
559 buffer
. b
= va_arg ( ap
, int );
563 case TABLE_TIMESTAMP
:
565 buffer
. usec
= va_arg ( ap
, usec_t
);
570 buffer
. size
= va_arg ( ap
, uint64_t );
575 buffer
. uint32
= va_arg ( ap
, uint32_t );
576 data
= & buffer
. uint32
;
579 case _TABLE_DATA_TYPE_MAX
:
580 /* Used as end marker */
585 assert_not_reached ( "Uh? Unexpected data type." );
588 r
= table_add_cell ( t
, NULL
, type
, data
);
594 type
= va_arg ( ap
, TableDataType
);
598 void table_set_header ( Table
* t
, bool b
) {
604 void table_set_width ( Table
* t
, size_t width
) {
610 int table_set_display ( Table
* t
, size_t first_column
, ...) {
611 size_t allocated
, column
;
616 allocated
= t
-> n_display_map
;
617 column
= first_column
;
619 va_start ( ap
, first_column
);
621 assert ( column
< t
-> n_columns
);
623 if (! GREEDY_REALLOC ( t
-> display_map
, allocated
, MAX ( t
-> n_columns
, t
-> n_display_map
+ 1 ))) {
628 t
-> display_map
[ t
-> n_display_map
++] = column
;
630 column
= va_arg ( ap
, size_t );
631 if ( column
== ( size_t ) - 1 )
640 int table_set_sort ( Table
* t
, size_t first_column
, ...) {
641 size_t allocated
, column
;
646 allocated
= t
-> n_sort_map
;
647 column
= first_column
;
649 va_start ( ap
, first_column
);
651 assert ( column
< t
-> n_columns
);
653 if (! GREEDY_REALLOC ( t
-> sort_map
, allocated
, MAX ( t
-> n_columns
, t
-> n_sort_map
+ 1 ))) {
658 t
-> sort_map
[ t
-> n_sort_map
++] = column
;
660 column
= va_arg ( ap
, size_t );
661 if ( column
== ( size_t ) - 1 )
669 static int cell_data_compare ( TableData
* a
, size_t index_a
, TableData
* b
, size_t index_b
) {
673 if ( a
-> type
== b
-> type
) {
675 /* We only define ordering for cells of the same data type. If cells with different data types are
676 * compared we follow the order the cells were originally added in */
681 return strcmp ( a
-> string
, b
-> string
);
684 if (! a
-> boolean
&& b
-> boolean
)
686 if ( a
-> boolean
&& ! b
-> boolean
)
690 case TABLE_TIMESTAMP
:
691 return CMP ( a
-> timestamp
, b
-> timestamp
);
694 return CMP ( a
-> timespan
, b
-> timespan
);
697 return CMP ( a
-> size
, b
-> size
);
700 return CMP ( a
-> uint32
, b
-> uint32
);
707 /* Generic fallback using the orginal order in which the cells where added. */
708 return CMP ( index_a
, index_b
);
711 static int table_data_compare ( const size_t * a
, const size_t * b
, Table
* t
) {
718 /* Make sure the header stays at the beginning */
719 if (* a
< t
-> n_columns
&& * b
< t
-> n_columns
)
721 if (* a
< t
-> n_columns
)
723 if (* b
< t
-> n_columns
)
726 /* Order other lines by the sorting map */
727 for ( i
= 0 ; i
< t
-> n_sort_map
; i
++) {
730 d
= t
-> data
[* a
+ t
-> sort_map
[ i
]];
731 dd
= t
-> data
[* b
+ t
-> sort_map
[ i
]];
733 r
= cell_data_compare ( d
, * a
, dd
, * b
);
738 /* Order identical lines by the order there were originally added in */
742 static const char * table_data_format ( TableData
* d
) {
756 return yes_no ( d
-> boolean
);
758 case TABLE_TIMESTAMP
: {
759 _cleanup_free_
char * p
;
761 p
= new ( char , FORMAT_TIMESTAMP_MAX
);
765 if (! format_timestamp ( p
, FORMAT_TIMESTAMP_MAX
, d
-> timestamp
))
768 d
-> formatted
= TAKE_PTR ( p
);
772 case TABLE_TIMESPAN
: {
773 _cleanup_free_
char * p
;
775 p
= new ( char , FORMAT_TIMESPAN_MAX
);
779 if (! format_timespan ( p
, FORMAT_TIMESPAN_MAX
, d
-> timestamp
, 0 ))
782 d
-> formatted
= TAKE_PTR ( p
);
787 _cleanup_free_
char * p
;
789 p
= new ( char , FORMAT_BYTES_MAX
);
793 if (! format_bytes ( p
, FORMAT_BYTES_MAX
, d
-> size
))
796 d
-> formatted
= TAKE_PTR ( p
);
801 _cleanup_free_
char * p
;
803 p
= new ( char , DECIMAL_STR_WIDTH ( d
-> uint32
) + 1 );
807 sprintf ( p
, "%" PRIu32
, d
-> uint32
);
808 d
-> formatted
= TAKE_PTR ( p
);
813 assert_not_reached ( "Unexpected type?" );
819 static int table_data_requested_width ( TableData
* d
, size_t * ret
) {
823 t
= table_data_format ( d
);
827 l
= utf8_console_width ( t
);
828 if ( l
== ( size_t ) - 1 )
831 if ( d
-> maximum_width
!= ( size_t ) - 1 && l
> d
-> maximum_width
)
832 l
= d
-> maximum_width
;
834 if ( l
< d
-> minimum_width
)
835 l
= d
-> minimum_width
;
841 static char * align_string_mem ( const char * str
, size_t new_length
, unsigned percent
) {
842 size_t w
= 0 , space
, lspace
, old_length
;
847 /* As with ellipsize_mem(), 'old_length' is a byte size while 'new_length' is a width in character cells */
850 assert ( percent
<= 100 );
852 old_length
= strlen ( str
);
854 /* Determine current width on screen */
856 while ( p
< str
+ old_length
) {
859 if ( utf8_encoded_to_unichar ( p
, & c
) < 0 ) {
860 p
++, w
++; /* count invalid chars as 1 */
864 p
= utf8_next_char ( p
);
865 w
+= unichar_iswide ( c
) ? 2 : 1 ;
868 /* Already wider than the target, if so, don't do anything */
870 return strndup ( str
, old_length
);
872 /* How much spaces shall we add? An how much on the left side? */
873 space
= new_length
- w
;
874 lspace
= space
* percent
/ 100U ;
876 ret
= new ( char , space
+ old_length
+ 1 );
880 for ( i
= 0 ; i
< lspace
; i
++)
882 memcpy ( ret
+ lspace
, str
, old_length
);
883 for ( i
= lspace
+ old_length
; i
< space
+ old_length
; i
++)
886 ret
[ space
+ old_length
] = 0 ;
890 int table_print ( Table
* t
, FILE * f
) {
891 size_t n_rows
, * minimum_width
, * maximum_width
, display_columns
, * requested_width
,
892 i
, j
, table_minimum_width
, table_maximum_width
, table_requested_width
, table_effective_width
,
894 _cleanup_free_
size_t * sorted
= NULL
;
895 uint64_t * column_weight
, weight_sum
;
903 /* Ensure we have no incomplete rows */
904 assert ( t
-> n_cells
% t
-> n_columns
== 0 );
906 n_rows
= t
-> n_cells
/ t
-> n_columns
;
907 assert ( n_rows
> 0 ); /* at least the header row must be complete */
910 /* If sorting is requested, let's calculate an index table we use to lookup the actual index to display with. */
912 sorted
= new ( size_t , n_rows
);
916 for ( i
= 0 ; i
< n_rows
; i
++)
917 sorted
[ i
] = i
* t
-> n_columns
;
919 typesafe_qsort_r ( sorted
, n_rows
, table_data_compare
, t
);
923 display_columns
= t
-> n_display_map
;
925 display_columns
= t
-> n_columns
;
927 assert ( display_columns
> 0 );
929 minimum_width
= newa ( size_t , display_columns
);
930 maximum_width
= newa ( size_t , display_columns
);
931 requested_width
= newa ( size_t , display_columns
);
932 width
= newa ( size_t , display_columns
);
933 column_weight
= newa0 ( uint64_t , display_columns
);
935 for ( j
= 0 ; j
< display_columns
; j
++) {
936 minimum_width
[ j
] = 1 ;
937 maximum_width
[ j
] = ( size_t ) - 1 ;
938 requested_width
[ j
] = ( size_t ) - 1 ;
941 /* First pass: determine column sizes */
942 for ( i
= t
-> header
? 0 : 1 ; i
< n_rows
; i
++) {
945 /* Note that we don't care about ordering at this time, as we just want to determine column sizes,
946 * hence we don't care for sorted[] during the first pass. */
947 row
= t
-> data
+ i
* t
-> n_columns
;
949 for ( j
= 0 ; j
< display_columns
; j
++) {
953 assert_se ( d
= row
[ t
-> display_map
? t
-> display_map
[ j
] : j
]);
955 r
= table_data_requested_width ( d
, & req
);
959 /* Determine the biggest width that any cell in this column would like to have */
960 if ( requested_width
[ j
] == ( size_t ) - 1 ||
961 requested_width
[ j
] < req
)
962 requested_width
[ j
] = req
;
964 /* Determine the minimum width any cell in this column needs */
965 if ( minimum_width
[ j
] < d
-> minimum_width
)
966 minimum_width
[ j
] = d
-> minimum_width
;
968 /* Determine the maximum width any cell in this column needs */
969 if ( d
-> maximum_width
!= ( size_t ) - 1 &&
970 ( maximum_width
[ j
] == ( size_t ) - 1 ||
971 maximum_width
[ j
] > d
-> maximum_width
))
972 maximum_width
[ j
] = d
-> maximum_width
;
974 /* Determine the full columns weight */
975 column_weight
[ j
] += d
-> weight
;
979 /* One space between each column */
980 table_requested_width
= table_minimum_width
= table_maximum_width
= display_columns
- 1 ;
982 /* Calculate the total weight for all columns, plus the minimum, maximum and requested width for the table. */
984 for ( j
= 0 ; j
< display_columns
; j
++) {
985 weight_sum
+= column_weight
[ j
];
987 table_minimum_width
+= minimum_width
[ j
];
989 if ( maximum_width
[ j
] == ( size_t ) - 1 )
990 table_maximum_width
= ( size_t ) - 1 ;
992 table_maximum_width
+= maximum_width
[ j
];
994 table_requested_width
+= requested_width
[ j
];
997 /* Calculate effective table width */
998 if ( t
-> width
== ( size_t ) - 1 )
999 table_effective_width
= pager_have () ? table_requested_width
: MIN ( table_requested_width
, columns ());
1001 table_effective_width
= t
-> width
;
1003 if ( table_maximum_width
!= ( size_t ) - 1 && table_effective_width
> table_maximum_width
)
1004 table_effective_width
= table_maximum_width
;
1006 if ( table_effective_width
< table_minimum_width
)
1007 table_effective_width
= table_minimum_width
;
1009 if ( table_effective_width
>= table_requested_width
) {
1012 /* We have extra room, let's distribute it among columns according to their weights. We first provide
1013 * each column with what it asked for and the distribute the rest. */
1015 extra
= table_effective_width
- table_requested_width
;
1017 for ( j
= 0 ; j
< display_columns
; j
++) {
1020 if ( weight_sum
== 0 )
1021 width
[ j
] = requested_width
[ j
] + extra
/ ( display_columns
- j
); /* Avoid division by zero */
1023 width
[ j
] = requested_width
[ j
] + ( extra
* column_weight
[ j
]) / weight_sum
;
1025 if ( maximum_width
[ j
] != ( size_t ) - 1 && width
[ j
] > maximum_width
[ j
])
1026 width
[ j
] = maximum_width
[ j
];
1028 if ( width
[ j
] < minimum_width
[ j
])
1029 width
[ j
] = minimum_width
[ j
];
1031 assert ( width
[ j
] >= requested_width
[ j
]);
1032 delta
= width
[ j
] - requested_width
[ j
];
1034 /* Subtract what we just added from the rest */
1040 assert ( weight_sum
>= column_weight
[ j
]);
1041 weight_sum
-= column_weight
[ j
];
1045 /* We need to compress the table, columns can't get what they asked for. We first provide each column
1046 * with the minimum they need, and then distribute anything left. */
1047 bool finalize
= false ;
1050 extra
= table_effective_width
- table_minimum_width
;
1052 for ( j
= 0 ; j
< display_columns
; j
++)
1053 width
[ j
] = ( size_t ) - 1 ;
1056 bool restart
= false ;
1058 for ( j
= 0 ; j
< display_columns
; j
++) {
1061 /* Did this column already get something assigned? If so, let's skip to the next */
1062 if ( width
[ j
] != ( size_t ) - 1 )
1065 if ( weight_sum
== 0 )
1066 w
= minimum_width
[ j
] + extra
/ ( display_columns
- j
); /* avoid division by zero */
1068 w
= minimum_width
[ j
] + ( extra
* column_weight
[ j
]) / weight_sum
;
1070 if ( w
>= requested_width
[ j
]) {
1071 /* Never give more than requested. If we hit a column like this, there's more
1072 * space to allocate to other columns which means we need to restart the
1073 * iteration. However, if we hit a column like this, let's assign it the space
1074 * it wanted for good early.*/
1076 w
= requested_width
[ j
];
1079 } else if (! finalize
)
1084 assert ( w
>= minimum_width
[ j
]);
1085 delta
= w
- minimum_width
[ j
];
1087 assert ( delta
<= extra
);
1090 assert ( weight_sum
>= column_weight
[ j
]);
1091 weight_sum
-= column_weight
[ j
];
1093 if ( restart
&& ! finalize
)
1105 /* Second pass: show output */
1106 for ( i
= t
-> header
? 0 : 1 ; i
< n_rows
; i
++) {
1110 row
= t
-> data
+ sorted
[ i
];
1112 row
= t
-> data
+ i
* t
-> n_columns
;
1114 for ( j
= 0 ; j
< display_columns
; j
++) {
1115 _cleanup_free_
char * buffer
= NULL
;
1120 assert_se ( d
= row
[ t
-> display_map
? t
-> display_map
[ j
] : j
]);
1122 field
= table_data_format ( d
);
1126 l
= utf8_console_width ( field
);
1128 /* Field is wider than allocated space. Let's ellipsize */
1130 buffer
= ellipsize ( field
, width
[ j
], d
-> ellipsize_percent
);
1136 } else if ( l
< width
[ j
]) {
1137 /* Field is shorter than allocated space. Let's align with spaces */
1139 buffer
= align_string_mem ( field
, width
[ j
], d
-> align_percent
);
1147 fputc ( ' ' , f
); /* column separator */
1155 fputs ( ansi_normal (), f
);
1161 return fflush_and_check ( f
);
1164 int table_format ( Table
* t
, char ** ret
) {
1165 _cleanup_fclose_
FILE * f
= NULL
;
1170 f
= open_memstream (& buf
, & sz
);
1174 ( void ) __fsetlocking ( f
, FSETLOCKING_BYCALLER
);
1176 r
= table_print ( t
, f
);
1187 size_t table_get_rows ( Table
* t
) {
1191 assert ( t
-> n_columns
> 0 );
1192 return t
-> n_cells
/ t
-> n_columns
;
1195 size_t table_get_columns ( Table
* t
) {
1199 assert ( t
-> n_columns
> 0 );
1200 return t
-> n_columns
;