1 /* misc - miscellaneous flex routines */
4 * Copyright (c) 1990 The Regents of the University of California.
7 * This code is derived from software contributed to Berkeley by
10 * The United States Government has rights in this work pursuant
11 * to contract no. DE-AC03-76SF00098 between the United States
12 * Department of Energy and the University of California.
14 * Redistribution and use in source and binary forms are permitted provided
15 * that: (1) source distributions retain this entire copyright notice and
16 * comment, and (2) distributions including binaries display the following
17 * acknowledgement: ``This product includes software developed by the
18 * University of California, Berkeley and its contributors'' in the
19 * documentation or other materials provided with the distribution and in
20 * all advertising materials mentioning features or use of this software.
21 * Neither the name of the University nor the names of its contributors may
22 * be used to endorse or promote products derived from this software without
23 * specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
25 * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
29 /* $NetBSD: misc.c,v 1.12 2003/07/14 11:36:49 itojun Exp $ */
34 void action_define( defname
, value
)
40 if ( (int) strlen( defname
) > MAXLINE
/ 2 )
42 format_pinpoint_message( _( "name \"%s\" ridiculously long" ),
47 snprintf(buf
, sizeof(buf
), "#define %s %d\n", defname
, value
);
52 void add_action( new_text
)
55 int len
= strlen( new_text
);
57 while ( len
+ action_index
>= action_size
- 10 /* slop */ )
59 int new_size
= action_size
* 2;
62 /* Increase just a little, to try to avoid overflow
65 action_size
+= action_size
/ 8;
67 action_size
= new_size
;
70 reallocate_character_array( action_array
, action_size
);
73 strcpy(&action_array
[action_index
], new_text
);
79 /* allocate_array - allocate memory for an integer array of the given size */
81 void *allocate_array( size
, element_size
)
86 size_t num_bytes
= element_size
* size
;
88 mem
= flex_alloc( num_bytes
);
91 _( "memory allocation failed in allocate_array()" ) );
97 /* all_lower - true if a string is all lower-case */
104 if ( ! isascii( (Char
) *str
) || ! islower( (Char
)*str
) )
113 /* all_upper - true if a string is all upper-case */
120 if ( ! isascii( (Char
) *str
) || ! isupper( (Char
)*str
) )
129 /* bubble - bubble sort an integer array in increasing order
133 * void bubble( v, n );
136 * sorts the first n elements of array v and replaces them in
140 * v - the array to be sorted
141 * n - the number of elements of 'v' to be sorted
147 register int i
, j
, k
;
149 for ( i
= n
; i
> 1; --i
)
150 for ( j
= 1; j
< i
; ++j
)
151 if ( v
[j
] > v
[j
+ 1] ) /* compare */
153 k
= v
[j
]; /* exchange */
160 /* check_char - checks a character to make sure it's within the range
161 * we're expecting. If not, generates fatal error message
169 lerrsf( _( "bad character '%s' detected in check_char()" ),
170 readable_form( c
) );
174 _( "scanner requires -8 flag to use the character %s" ),
175 readable_form( c
) );
180 /* clower - replace upper-case letter to lower-case */
185 return (Char
) ((isascii( c
) && isupper( c
)) ? tolower( c
) : c
);
189 /* copy_string - returns a dynamically allocated copy of a string */
191 char *copy_string( str
)
192 register const char *str
;
194 register const char *c1
;
200 for ( c1
= str
; *c1
; ++c1
)
203 size
= (c1
- str
+ 1) * sizeof( char );
204 copy
= (char *) flex_alloc( size
);
207 flexfatal( _( "dynamic memory failure in copy_string()" ) );
209 for ( c2
= copy
; (*c2
++ = *str
++) != 0; )
216 /* copy_unsigned_string -
217 * returns a dynamically allocated copy of a (potentially) unsigned string
220 Char
*copy_unsigned_string( str
)
227 for ( c
= str
; *c
; ++c
)
230 copy
= allocate_Character_array( c
- str
+ 1 );
232 for ( c
= copy
; (*c
++ = *str
++) != 0; )
239 /* cshell - shell sort a character array in increasing order
244 * int n, special_case_0;
245 * cshell( v, n, special_case_0 );
248 * Does a shell sort of the first n elements of array v.
249 * If special_case_0 is true, then any element equal to 0
250 * is instead assumed to have infinite weight.
253 * v - array to be sorted
254 * n - number of elements of v to be sorted
257 void cshell( v
, n
, special_case_0
)
259 int n
, special_case_0
;
264 for ( gap
= n
/ 2; gap
> 0; gap
= gap
/ 2 )
265 for ( i
= gap
; i
< n
; ++i
)
266 for ( j
= i
- gap
; j
>= 0; j
= j
- gap
)
270 if ( special_case_0
)
275 else if ( v
[j
] != 0 && v
[j
] <= v
[jg
] )
279 else if ( v
[j
] <= v
[jg
] )
289 /* dataend - finish up a block of data declarations */
296 /* add terminator for initialization; { for vi */
304 /* dataflush - flush generated data statements */
310 if ( ++dataline
>= NUMDATALINES
)
312 /* Put out a blank line so that the table is grouped into
313 * large blocks that enable the user to find elements easily.
319 /* Reset the number of characters written on the current line. */
324 /* flexerror - report an error message and terminate */
326 void flexerror( msg
)
329 fprintf( stderr
, "%s: %s\n", program_name
, msg
);
334 /* flexfatal - report a fatal error message and terminate */
336 void flexfatal( msg
)
339 fprintf( stderr
, _( "%s: fatal internal error, %s\n" ),
345 /* htoi - convert a hexadecimal digit string to an integer value */
352 (void) sscanf( (char *) str
, "%x", &result
);
358 /* lerrif - report an error message formatted with one integer argument */
360 void lerrif( msg
, arg
)
364 char errmsg
[MAXLINE
];
365 (void) snprintf(errmsg
, sizeof(errmsg
), msg
, arg
);
370 /* lerrsf - report an error message formatted with one string argument */
372 void lerrsf( msg
, arg
)
373 const char msg
[], arg
[];
375 char errmsg
[MAXLINE
];
377 (void) snprintf(errmsg
, sizeof(errmsg
), msg
, arg
);
382 /* line_directive_out - spit out a "#line" statement */
384 void line_directive_out( output_file
, do_infile
)
388 char directive
[MAXLINE
], filename
[MAXLINE
];
390 static const char line_fmt
[] = "#line %d \"%s\"\n";
392 if ( ! gen_line_dirs
)
395 if ( (do_infile
&& ! infilename
) || (! do_infile
&& ! outfilename
) )
396 /* don't know the filename to use, skip */
399 s1
= do_infile
? infilename
: outfilename
;
401 s3
= &filename
[sizeof( filename
) - 2];
403 while ( s2
< s3
&& *s1
)
415 snprintf(directive
, sizeof(directive
), line_fmt
, linenum
,
419 if ( output_file
== stdout
)
420 /* Account for the line directive itself. */
423 snprintf(directive
, sizeof(directive
), line_fmt
, out_linenum
,
427 /* If output_file is nil then we should put the directive in
428 * the accumulated actions.
432 fputs( directive
, output_file
);
435 add_action( directive
);
439 /* mark_defs1 - mark the current position in the action array as
440 * representing where the user's section 1 definitions end
441 * and the prolog begins
446 action_array
[action_index
++] = '\0';
447 action_offset
= prolog_offset
= action_index
;
448 action_array
[action_index
] = '\0';
452 /* mark_prolog - mark the current position in the action array as
453 * representing the end of the action prolog
457 action_array
[action_index
++] = '\0';
458 action_offset
= action_index
;
459 action_array
[action_index
] = '\0';
463 /* mk2data - generate a data statement for a two-dimensional array
465 * Generates a data statement initializing the current 2-D array to "value".
467 void mk2data( value
)
470 if ( datapos
>= NUMDATAITEMS
)
485 out_dec( "%5d", value
);
489 /* mkdata - generate a data statement
491 * Generates a data statement initializing the current array element to
497 if ( datapos
>= NUMDATAITEMS
)
511 out_dec( "%5d", value
);
515 /* myctoi - return the integer represented by a string of digits */
522 (void) sscanf( array
, "%d", &val
);
528 /* myesc - return character corresponding to escape sequence */
537 case 'b': return '\b';
538 case 'f': return '\f';
539 case 'n': return '\n';
540 case 'r': return '\r';
541 case 't': return '\t';
544 case 'a': return '\a';
545 case 'v': return '\v';
547 case 'a': return '\007';
548 case 'v': return '\013';
562 while ( isascii( array
[sptr
] ) &&
563 isdigit( array
[sptr
] ) )
564 /* Don't increment inside loop control
565 * because if isdigit() is a macro it might
566 * expand into multiple increments ...
573 esc_char
= otoi( array
+ 1 );
584 while ( isascii( array
[sptr
] ) &&
585 isxdigit( (Char
) array
[sptr
] ) )
586 /* Don't increment inside loop control
587 * because if isdigit() is a macro it might
588 * expand into multiple increments ...
595 esc_char
= htoi( array
+ 2 );
608 /* otoi - convert an octal digit string to an integer value */
615 (void) sscanf( (char *) str
, "%o", &result
);
620 /* out - various flavors of outputing a (possibly formatted) string for the
621 * generated scanner, keeping track of the line count.
627 fputs( str
, stdout
);
628 out_line_count( str
);
631 void out_dec( fmt
, n
)
636 out_line_count( fmt
);
639 void out_dec2( fmt
, n1
, n2
)
643 printf( fmt
, n1
, n2
);
644 out_line_count( fmt
);
647 void out_hex( fmt
, x
)
652 out_line_count( fmt
);
655 void out_line_count( str
)
660 for ( i
= 0; str
[i
]; ++i
)
661 if ( str
[i
] == '\n' )
665 void out_str( fmt
, str
)
666 const char fmt
[], str
[];
669 out_line_count( fmt
);
670 out_line_count( str
);
673 void out_str3( fmt
, s1
, s2
, s3
)
674 const char fmt
[], s1
[], s2
[], s3
[];
676 printf( fmt
, s1
, s2
, s3
);
677 out_line_count( fmt
);
678 out_line_count( s1
);
679 out_line_count( s2
);
680 out_line_count( s3
);
683 void out_str_dec( fmt
, str
, n
)
684 const char fmt
[], str
[];
687 printf( fmt
, str
, n
);
688 out_line_count( fmt
);
689 out_line_count( str
);
705 out_line_count( str
);
710 /* readable_form - return the human-readable form of a character
712 * The returned string is in static storage.
715 char *readable_form( c
)
718 static char rform
[10];
720 if ( (c
>= 0 && c
< 32) || c
>= 127 )
724 case '\b': return "\\b";
725 case '\f': return "\\f";
726 case '\n': return "\\n";
727 case '\r': return "\\r";
728 case '\t': return "\\t";
731 case '\a': return "\\a";
732 case '\v': return "\\v";
736 (void) snprintf(rform
, sizeof(rform
), "\\%.3o",
755 /* reallocate_array - increase the size of a dynamic array */
757 void *reallocate_array( array
, size
, element_size
)
762 register void *new_array
;
763 size_t num_bytes
= element_size
* size
;
765 new_array
= flex_realloc( array
, num_bytes
);
767 flexfatal( _( "attempt to increase array size failed" ) );
773 /* skelout - write out one section of the skeleton file
776 * Copies skelfile or skel array to stdout until a line beginning with
777 * "%%" or EOF is found.
781 char buf_storage
[MAXLINE
];
782 char *buf
= buf_storage
;
785 /* Loop pulling lines either from the skelfile, if we're using
786 * one, or from the skel[] array.
789 (fgets( buf
, MAXLINE
, skelfile
) != NULL
) :
790 ((buf
= (char *) skel
[skel_ind
++]) != 0) )
791 { /* copy from skel array */
800 do_copy
= C_plus_plus
;
804 do_copy
= ! C_plus_plus
;
813 _( "bad line in skeleton file" ) );
820 /* Skeleton file reads include final
821 * newline, skel[] array does not.
831 /* transition_struct_out - output a yy_trans_info structure
833 * outputs the yy_trans_info structure with the two elements, element_v and
834 * element_n. Formats the output with spaces and carriage returns.
837 void transition_struct_out( element_v
, element_n
)
838 int element_v
, element_n
;
840 out_dec2( " {%4d,%4d },", element_v
, element_n
);
842 datapos
+= TRANS_STRUCT_PRINT_LENGTH
;
844 if ( datapos
>= 79 - TRANS_STRUCT_PRINT_LENGTH
)
848 if ( ++dataline
% 10 == 0 )
856 /* The following is only needed when building flex's parser using certain
857 * broken versions of bison.
859 void *yy_flex_xmalloc( size
)
862 void *result
= flex_alloc( (size_t) size
);
866 _( "memory allocation failed in yy_flex_xmalloc()" ) );
872 /* zero_out - set a region of memory to 0
874 * Sets region_ptr[0] through region_ptr[size_in_bytes - 1] to zero.
877 void zero_out( region_ptr
, size_in_bytes
)
879 size_t size_in_bytes
;
881 register char *rp
, *rp_end
;
884 rp_end
= region_ptr
+ size_in_bytes
;
886 while ( rp
< rp_end
)