329 #  define SEPARATOR(i, last, width) \  argument
330       ((i) == (last)? "\n};\n\n" :    \
331        ((i) % (width) == (width)-1 ? ",\n" : ", "))
336     int i;  in gen_trees_header()  local
343     for (i = 0; i < L_CODES+2; i++) {  in gen_trees_header()
344         fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,  in gen_trees_header()
345                 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));  in gen_trees_header()
349     for (i = 0; i < D_CODES; i++) {  in gen_trees_header()
350         fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,  in gen_trees_header()
351                 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));  in gen_trees_header()
355     for (i = 0; i < DIST_CODE_LEN; i++) {  in gen_trees_header()
356         fprintf(header, "%2u%s", _dist_code[i],  in gen_trees_header()
357                 SEPARATOR(i, DIST_CODE_LEN-1, 20));  in gen_trees_header()
362     for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {  in gen_trees_header()
363         fprintf(header, "%2u%s", _length_code[i],  in gen_trees_header()
364                 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));  in gen_trees_header()
368     for (i = 0; i < LENGTH_CODES; i++) {  in gen_trees_header()
369         fprintf(header, "%1u%s", base_length[i],  in gen_trees_header()
370                 SEPARATOR(i, LENGTH_CODES-1, 20));  in gen_trees_header()
374     for (i = 0; i < D_CODES; i++) {  in gen_trees_header()
375         fprintf(header, "%5u%s", base_dist[i],  in gen_trees_header()
376                 SEPARATOR(i, D_CODES-1, 10));  in gen_trees_header()