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 with or without
15 * modification are permitted provided that: (1) source distributions retain
16 * this entire copyright notice and comment, and (2) distributions including
17 * binaries display the following acknowledgement: ``This product includes
18 * software developed by the University of California, Berkeley and its
19 * contributors'' in the documentation or other materials provided with the
20 * distribution and in all advertising materials mentioning features or use
21 * of this software. Neither the name of the University nor the names of
22 * its contributors may be used to endorse or promote products derived from
23 * this software without 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 /* $Header: /home/daffy/u0/vern/flex/RCS/misc.c,v 2.47 95/04/28 11:39:39 vern Exp $ */
34 void action_define( defname, value )
40 if ( (int) strlen( defname ) > MAXLINE / 2 )
42 format_pinpoint_message( _( "name \"%s\" ridiculously long" ),
47 sprintf( 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( *str ) )
113 /* all_upper - true if a string is all upper-case */
120 if ( ! isascii( (Char) *str ) || ! isupper( *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) sprintf( 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) sprintf( 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 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 sprintf( directive, line_fmt, linenum, filename );
418 if ( output_file == stdout )
419 /* Account for the line directive itself. */
422 sprintf( directive, line_fmt, out_linenum, filename );
425 /* If output_file is nil then we should put the directive in
426 * the accumulated actions.
430 fputs( directive, output_file );
433 add_action( directive );
437 /* mark_defs1 - mark the current position in the action array as
438 * representing where the user's section 1 definitions end
439 * and the prolog begins
444 action_array[action_index++] = '\0';
445 action_offset = prolog_offset = action_index;
446 action_array[action_index] = '\0';
450 /* mark_prolog - mark the current position in the action array as
451 * representing the end of the action prolog
455 action_array[action_index++] = '\0';
456 action_offset = action_index;
457 action_array[action_index] = '\0';
461 /* mk2data - generate a data statement for a two-dimensional array
463 * Generates a data statement initializing the current 2-D array to "value".
465 void mk2data( value )
468 if ( datapos >= NUMDATAITEMS )
483 out_dec( "%5d", value );
487 /* mkdata - generate a data statement
489 * Generates a data statement initializing the current array element to
495 if ( datapos >= NUMDATAITEMS )
509 out_dec( "%5d", value );
513 /* myctoi - return the integer represented by a string of digits */
520 (void) sscanf( array, "%d", &val );
526 /* myesc - return character corresponding to escape sequence */
535 case 'b': return '\b';
536 case 'f': return '\f';
537 case 'n': return '\n';
538 case 'r': return '\r';
539 case 't': return '\t';
542 case 'a': return '\a';
543 case 'v': return '\v';
545 case 'a': return '\007';
546 case 'v': return '\013';
560 while ( isascii( array[sptr] ) &&
561 isdigit( array[sptr] ) )
562 /* Don't increment inside loop control
563 * because if isdigit() is a macro it might
564 * expand into multiple increments ...
571 esc_char = otoi( array + 1 );
582 while ( isascii( array[sptr] ) &&
583 isxdigit( (char) array[sptr] ) )
584 /* Don't increment inside loop control
585 * because if isdigit() is a macro it might
586 * expand into multiple increments ...
593 esc_char = htoi( array + 2 );
606 /* otoi - convert an octal digit string to an integer value */
613 (void) sscanf( (char *) str, "%o", &result );
618 /* out - various flavors of outputing a (possibly formatted) string for the
619 * generated scanner, keeping track of the line count.
625 fputs( str, stdout );
626 out_line_count( str );
629 void out_dec( fmt, n )
634 out_line_count( fmt );
637 void out_dec2( fmt, n1, n2 )
641 printf( fmt, n1, n2 );
642 out_line_count( fmt );
645 void out_hex( fmt, x )
650 out_line_count( fmt );
653 void out_line_count( str )
658 for ( i = 0; str[i]; ++i )
659 if ( str[i] == '\n' )
663 void out_str( fmt, str )
664 const char fmt[], str[];
667 out_line_count( fmt );
668 out_line_count( str );
671 void out_str3( fmt, s1, s2, s3 )
672 const char fmt[], s1[], s2[], s3[];
674 printf( fmt, s1, s2, s3 );
675 out_line_count( fmt );
676 out_line_count( s1 );
677 out_line_count( s2 );
678 out_line_count( s3 );
681 void out_str_dec( fmt, str, n )
682 const char fmt[], str[];
685 printf( fmt, str, n );
686 out_line_count( fmt );
687 out_line_count( str );
703 out_line_count( str );
708 /* readable_form - return the the human-readable form of a character
710 * The returned string is in static storage.
713 char *readable_form( c )
716 static char rform[10];
718 if ( (c >= 0 && c < 32) || c >= 127 )
722 case '\b': return "\\b";
723 case '\f': return "\\f";
724 case '\n': return "\\n";
725 case '\r': return "\\r";
726 case '\t': return "\\t";
729 case '\a': return "\\a";
730 case '\v': return "\\v";
734 (void) sprintf( rform, "\\%.3o",
753 /* reallocate_array - increase the size of a dynamic array */
755 void *reallocate_array( array, size, element_size )
760 register void *new_array;
761 size_t num_bytes = element_size * size;
763 new_array = flex_realloc( array, num_bytes );
765 flexfatal( _( "attempt to increase array size failed" ) );
771 /* skelout - write out one section of the skeleton file
774 * Copies skelfile or skel array to stdout until a line beginning with
775 * "%%" or EOF is found.
779 char buf_storage[MAXLINE];
780 char *buf = buf_storage;
783 /* Loop pulling lines either from the skelfile, if we're using
784 * one, or from the skel[] array.
787 (fgets( buf, MAXLINE, skelfile ) != NULL) :
788 ((buf = (char *) skel[skel_ind++]) != 0) )
789 { /* copy from skel array */
798 do_copy = C_plus_plus;
802 do_copy = ! C_plus_plus;
811 _( "bad line in skeleton file" ) );
818 /* Skeleton file reads include final
819 * newline, skel[] array does not.
829 /* transition_struct_out - output a yy_trans_info structure
831 * outputs the yy_trans_info structure with the two elements, element_v and
832 * element_n. Formats the output with spaces and carriage returns.
835 void transition_struct_out( element_v, element_n )
836 int element_v, element_n;
838 out_dec2( " {%4d,%4d },", element_v, element_n );
840 datapos += TRANS_STRUCT_PRINT_LENGTH;
842 if ( datapos >= 79 - TRANS_STRUCT_PRINT_LENGTH )
846 if ( ++dataline % 10 == 0 )
854 /* The following is only needed when building flex's parser using certain
855 * broken versions of bison.
857 void *yy_flex_xmalloc( size )
860 void *result = flex_alloc( (size_t) size );
864 _( "memory allocation failed in yy_flex_xmalloc()" ) );
870 /* zero_out - set a region of memory to 0
872 * Sets region_ptr[0] through region_ptr[size_in_bytes - 1] to zero.
875 void zero_out( region_ptr, size_in_bytes )
877 size_t size_in_bytes;
879 register char *rp, *rp_end;
882 rp_end = region_ptr + size_in_bytes;
884 while ( rp < rp_end )