2005-09-20 13:26:39 +00:00
/** \file common.c
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
Various functions , mostly string utilities , that are used by most
parts of fish .
*/
2005-10-05 09:58:00 +00:00
# include "config.h"
2006-02-28 13:17:16 +00:00
2006-07-28 12:50:57 +00:00
# include <unistd.h>
2006-08-01 00:35:56 +00:00
# ifdef HAVE_STROPTS_H
2006-07-28 12:50:57 +00:00
# include <stropts.h>
# endif
2006-07-30 20:26:59 +00:00
# ifdef HAVE_SIGINFO_H
# include <siginfo.h>
# endif
2005-09-20 13:26:39 +00:00
# include <stdlib.h>
# include <termios.h>
# include <wchar.h>
# include <string.h>
# include <stdio.h>
# include <dirent.h>
# include <sys/types.h>
2006-08-09 22:53:38 +00:00
# ifdef HAVE_SYS_TERMIOS_H
# include <sys/termios.h>
# endif
# ifdef HAVE_SYS_IOCTL_H
2005-11-28 14:42:02 +00:00
# include <sys/ioctl.h>
2006-08-09 22:53:38 +00:00
# endif
2005-09-20 13:26:39 +00:00
# include <sys/stat.h>
# include <unistd.h>
# include <wctype.h>
# include <errno.h>
# include <limits.h>
2011-12-27 03:18:46 +00:00
# include <stdarg.h>
2005-09-20 13:26:39 +00:00
# include <locale.h>
2005-09-20 23:42:00 +00:00
# include <time.h>
2005-09-28 01:43:09 +00:00
# include <sys/time.h>
# include <fcntl.h>
2011-12-27 03:18:46 +00:00
# include <algorithm>
2005-09-20 13:26:39 +00:00
2007-01-20 02:36:49 +00:00
# ifdef HAVE_EXECINFO_H
# include <execinfo.h>
# endif
2005-10-01 19:18:52 +00:00
2005-09-20 13:26:39 +00:00
# if HAVE_NCURSES_H
# include <ncurses.h>
# else
# include <curses.h>
# endif
# if HAVE_TERMIO_H
# include <termio.h>
# endif
2006-01-19 12:22:07 +00:00
# if HAVE_TERM_H
2005-09-20 13:26:39 +00:00
# include <term.h>
2006-01-19 12:22:07 +00:00
# elif HAVE_NCURSES_TERM_H
# include <ncurses/term.h>
# endif
2005-09-20 13:26:39 +00:00
2006-02-28 13:17:16 +00:00
# include "fallback.h"
2005-09-20 13:26:39 +00:00
# include "util.h"
2006-02-28 13:17:16 +00:00
2005-09-20 13:26:39 +00:00
# include "wutil.h"
# include "common.h"
# include "expand.h"
# include "proc.h"
# include "wildcard.h"
# include "parser.h"
2012-01-16 16:56:47 +00:00
# include "complete.h"
2005-09-20 13:26:39 +00:00
2011-12-27 03:18:46 +00:00
# include "util.cpp"
# include "fallback.cpp"
2006-06-13 13:43:28 +00:00
2012-03-02 08:27:40 +00:00
2005-09-28 01:43:09 +00:00
2011-12-27 03:18:46 +00:00
struct termios shell_modes ;
2005-09-20 13:26:39 +00:00
2012-05-14 03:19:02 +00:00
// Note we foolishly assume that pthread_t is just a primitive. But it might be a struct.
2012-01-05 21:58:48 +00:00
static pthread_t main_thread_id = 0 ;
2012-05-14 03:19:02 +00:00
static bool thread_assertions_configured_for_testing = false ;
2012-01-05 21:58:48 +00:00
2005-09-20 13:26:39 +00:00
wchar_t ellipsis_char ;
char * profile = 0 ;
2011-12-27 03:18:46 +00:00
const wchar_t * program_name ;
2005-09-20 13:26:39 +00:00
2005-09-24 19:31:17 +00:00
int debug_level = 1 ;
2005-10-14 11:40:33 +00:00
/**
This struct should be continually updated by signals as the term resizes , and as such always contain the correct current size .
*/
static struct winsize termsize ;
2007-01-20 02:36:49 +00:00
2011-12-27 03:18:46 +00:00
void show_stackframe ( )
2007-01-20 02:36:49 +00:00
{
void * trace [ 32 ] ;
char * * messages = ( char * * ) NULL ;
int i , trace_size = 0 ;
trace_size = backtrace ( trace , 32 ) ;
messages = backtrace_symbols ( trace , trace_size ) ;
if ( messages )
{
debug ( 0 , L " Backtrace: " ) ;
for ( i = 0 ; i < trace_size ; i + + )
{
fwprintf ( stderr , L " %s \n " , messages [ i ] ) ;
}
free ( messages ) ;
}
}
2012-02-01 02:06:20 +00:00
wcstring_list_t completions_to_wcstring_list ( const std : : vector < completion_t > & list )
2012-01-16 16:56:47 +00:00
{
2012-02-01 02:06:20 +00:00
wcstring_list_t strings ;
strings . reserve ( list . size ( ) ) ;
2012-03-01 22:56:34 +00:00
for ( std : : vector < completion_t > : : const_iterator iter = list . begin ( ) ; iter ! = list . end ( ) ; + + iter ) {
2012-02-01 02:06:20 +00:00
strings . push_back ( iter - > completion ) ;
}
return strings ;
2012-01-16 16:56:47 +00:00
}
2005-09-20 13:26:39 +00:00
int fgetws2 ( wchar_t * * b , int * len , FILE * f )
{
int i = 0 ;
wint_t c ;
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
wchar_t * buff = * b ;
while ( 1 )
{
/* Reallocate the buffer if necessary */
if ( i + 1 > = * len )
{
int new_len = maxi ( 128 , ( * len ) * 2 ) ;
2011-12-27 03:18:46 +00:00
buff = ( wchar_t * ) realloc ( buff , sizeof ( wchar_t ) * new_len ) ;
2005-09-20 13:26:39 +00:00
if ( buff = = 0 )
{
2006-07-03 10:39:57 +00:00
DIE_MEM ( ) ;
2005-09-20 13:26:39 +00:00
}
else
{
* len = new_len ;
* b = buff ;
2011-12-27 03:18:46 +00:00
}
2005-09-20 13:26:39 +00:00
}
2011-12-27 03:18:46 +00:00
errno = 0 ;
2005-09-20 13:26:39 +00:00
c = getwc ( f ) ;
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
if ( errno = = EILSEQ )
{
continue ;
}
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
//fwprintf( stderr, L"b\n" );
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
switch ( c )
{
2011-12-27 03:18:46 +00:00
/* End of line */
2005-09-20 13:26:39 +00:00
case WEOF :
case L ' \n ' :
case L ' \0 ' :
buff [ i ] = L ' \0 ' ;
2011-12-27 03:18:46 +00:00
return i ;
2005-09-20 13:26:39 +00:00
/* Ignore carriage returns */
case L ' \r ' :
break ;
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
default :
buff [ i + + ] = c ;
break ;
2011-12-27 03:18:46 +00:00
}
2005-09-20 13:26:39 +00:00
}
}
2011-12-27 03:18:46 +00:00
static bool string_sort_predicate ( const wcstring & d1 , const wcstring & d2 )
{
return wcsfilecmp ( d1 . c_str ( ) , d2 . c_str ( ) ) < 0 ;
}
void sort_strings ( std : : vector < wcstring > & strings )
{
std : : sort ( strings . begin ( ) , strings . end ( ) , string_sort_predicate ) ;
}
2012-01-16 16:56:47 +00:00
void sort_completions ( std : : vector < completion_t > & completions )
{
std : : sort ( completions . begin ( ) , completions . end ( ) ) ;
}
2005-09-20 13:26:39 +00:00
wchar_t * str2wcs ( const char * in )
{
2006-01-28 02:03:29 +00:00
wchar_t * out ;
2006-02-08 14:58:47 +00:00
size_t len = strlen ( in ) ;
2011-12-27 03:18:46 +00:00
out = ( wchar_t * ) malloc ( sizeof ( wchar_t ) * ( len + 1 ) ) ;
2006-02-22 15:41:52 +00:00
if ( ! out )
{
2006-07-03 10:39:57 +00:00
DIE_MEM ( ) ;
2006-02-22 15:41:52 +00:00
}
2006-02-08 14:58:47 +00:00
return str2wcs_internal ( in , out ) ;
}
2011-12-27 03:18:46 +00:00
wcstring str2wcstring ( const char * in )
{
wchar_t * tmp = str2wcs ( in ) ;
wcstring result = tmp ;
free ( tmp ) ;
return result ;
}
2012-02-18 17:58:54 +00:00
wcstring str2wcstring ( const std : : string & in )
{
wchar_t * tmp = str2wcs ( in . c_str ( ) ) ;
wcstring result = tmp ;
free ( tmp ) ;
return result ;
}
2006-02-08 14:58:47 +00:00
wchar_t * str2wcs_internal ( const char * in , wchar_t * out )
{
2006-01-28 02:03:29 +00:00
size_t res = 0 ;
int in_pos = 0 ;
int out_pos = 0 ;
mbstate_t state ;
2006-06-21 10:07:46 +00:00
size_t len ;
CHECK ( in , 0 ) ;
CHECK ( out , 0 ) ;
2011-12-27 03:18:46 +00:00
2006-06-21 10:07:46 +00:00
len = strlen ( in ) ;
2006-01-28 02:03:29 +00:00
memset ( & state , 0 , sizeof ( state ) ) ;
2007-09-23 21:00:07 +00:00
2006-01-28 02:03:29 +00:00
while ( in [ in_pos ] )
2005-09-20 13:26:39 +00:00
{
2006-01-28 02:03:29 +00:00
res = mbrtowc ( & out [ out_pos ] , & in [ in_pos ] , len - in_pos , & state ) ;
2007-10-02 10:09:37 +00:00
if ( ( ( out [ out_pos ] > = ENCODE_DIRECT_BASE ) & &
( out [ out_pos ] < ENCODE_DIRECT_BASE + 256 ) ) | |
( out [ out_pos ] = = INTERNAL_SEPARATOR ) )
2007-09-23 21:00:07 +00:00
{
out [ out_pos ] = ENCODE_DIRECT_BASE + ( unsigned char ) in [ in_pos ] ;
in_pos + + ;
memset ( & state , 0 , sizeof ( state ) ) ;
out_pos + + ;
}
else
2005-09-20 13:26:39 +00:00
{
2011-12-27 03:18:46 +00:00
2007-09-23 21:00:07 +00:00
switch ( res )
{
case ( size_t ) ( - 2 ) :
case ( size_t ) ( - 1 ) :
2006-06-15 10:36:46 +00:00
{
out [ out_pos ] = ENCODE_DIRECT_BASE + ( unsigned char ) in [ in_pos ] ;
in_pos + + ;
memset ( & state , 0 , sizeof ( state ) ) ;
break ;
}
2011-12-27 03:18:46 +00:00
2007-09-23 21:00:07 +00:00
case 0 :
{
return out ;
}
2011-12-27 03:18:46 +00:00
2007-09-23 21:00:07 +00:00
default :
{
in_pos + = res ;
break ;
}
2006-01-28 02:03:29 +00:00
}
2007-09-23 21:00:07 +00:00
out_pos + + ;
2005-09-20 13:26:39 +00:00
}
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
}
out [ out_pos ] = 0 ;
2011-12-27 03:18:46 +00:00
return out ;
2005-09-20 13:26:39 +00:00
}
char * wcs2str ( const wchar_t * in )
{
2012-03-09 07:21:07 +00:00
if ( ! in )
return NULL ;
char * out ;
size_t desired_size = MAX_UTF8_BYTES * wcslen ( in ) + 1 ;
char local_buff [ 512 ] ;
if ( desired_size < = sizeof local_buff / sizeof * local_buff ) {
// convert into local buff, then use strdup() so we don't waste malloc'd space
char * result = wcs2str_internal ( in , local_buff ) ;
if ( result ) {
// It converted into the local buffer, so copy it
result = strdup ( result ) ;
if ( ! result ) {
DIE_MEM ( ) ;
}
}
return result ;
} else {
// here we fall into the bad case of allocating a buffer probably much larger than necessary
out = ( char * ) malloc ( MAX_UTF8_BYTES * wcslen ( in ) + 1 ) ;
if ( ! out ) {
DIE_MEM ( ) ;
}
return wcs2str_internal ( in , out ) ;
}
2005-09-20 13:26:39 +00:00
2006-02-08 14:58:47 +00:00
return wcs2str_internal ( in , out ) ;
}
2011-12-27 03:18:46 +00:00
std : : string wcs2string ( const wcstring & input )
{
char * tmp = wcs2str ( input . c_str ( ) ) ;
std : : string result = tmp ;
free ( tmp ) ;
return result ;
}
2006-02-08 14:58:47 +00:00
char * wcs2str_internal ( const wchar_t * in , char * out )
{
size_t res = 0 ;
int in_pos = 0 ;
int out_pos = 0 ;
mbstate_t state ;
2006-06-21 10:07:46 +00:00
CHECK ( in , 0 ) ;
CHECK ( out , 0 ) ;
2011-12-27 03:18:46 +00:00
2006-02-08 14:58:47 +00:00
memset ( & state , 0 , sizeof ( state ) ) ;
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
while ( in [ in_pos ] )
{
2006-09-03 23:47:51 +00:00
if ( in [ in_pos ] = = INTERNAL_SEPARATOR )
{
}
else if ( ( in [ in_pos ] > = ENCODE_DIRECT_BASE ) & &
2007-09-23 21:00:07 +00:00
( in [ in_pos ] < ENCODE_DIRECT_BASE + 256 ) )
2006-01-28 02:03:29 +00:00
{
out [ out_pos + + ] = in [ in_pos ] - ENCODE_DIRECT_BASE ;
}
else
{
res = wcrtomb ( & out [ out_pos ] , in [ in_pos ] , & state ) ;
2011-12-27 03:18:46 +00:00
2006-03-02 11:31:42 +00:00
if ( res = = ( size_t ) ( - 1 ) )
2006-01-28 02:03:29 +00:00
{
2006-09-03 23:47:51 +00:00
debug ( 1 , L " Wide character %d has no narrow representation " , in [ in_pos ] ) ;
2006-03-02 11:31:42 +00:00
memset ( & state , 0 , sizeof ( state ) ) ;
}
else
{
out_pos + = res ;
2006-01-28 02:03:29 +00:00
}
}
in_pos + + ;
}
out [ out_pos ] = 0 ;
2011-12-27 03:18:46 +00:00
return out ;
2005-09-20 13:26:39 +00:00
}
2012-01-30 06:06:58 +00:00
char * * wcsv2strv ( const wchar_t * const * in )
2005-09-20 13:26:39 +00:00
{
int count = 0 ;
int i ;
while ( in [ count ] ! = 0 )
count + + ;
2011-12-27 03:18:46 +00:00
char * * res = ( char * * ) malloc ( sizeof ( char * ) * ( count + 1 ) ) ;
2005-09-20 13:26:39 +00:00
if ( res = = 0 )
{
2011-12-27 03:18:46 +00:00
DIE_MEM ( ) ;
2005-09-20 13:26:39 +00:00
}
for ( i = 0 ; i < count ; i + + )
{
res [ i ] = wcs2str ( in [ i ] ) ;
}
res [ count ] = 0 ;
return res ;
}
2011-12-27 03:18:46 +00:00
wcstring format_string ( const wchar_t * format , . . . )
{
va_list va ;
va_start ( va , format ) ;
2012-02-10 02:43:36 +00:00
wcstring result = vformat_string ( format , va ) ;
va_end ( va ) ;
return result ;
}
wcstring vformat_string ( const wchar_t * format , va_list va_orig )
2012-03-04 03:12:06 +00:00
{
const int saved_err = errno ;
/*
As far as I know , there is no way to check if a
vswprintf - call failed because of a badly formated string
option or because the supplied destination string was to
small . In GLIBC , errno seems to be set to EINVAL either way .
Because of this , on failiure we try to
increase the buffer size until the free space is
larger than max_size , at which point it will
conclude that the error was probably due to a badly
formated string option , and return an error . Make
sure to null terminate string before that , though .
*/
const size_t max_size = ( 128 * 1024 * 1024 ) ;
wchar_t static_buff [ 256 ] ;
size_t size = 0 ;
wchar_t * buff = NULL ;
int status = - 1 ;
while ( status < 0 ) {
/* Reallocate if necessary */
if ( size = = 0 ) {
buff = static_buff ;
size = sizeof static_buff ;
} else {
size * = 2 ;
if ( size > = max_size ) {
buff [ 0 ] = ' \0 ' ;
break ;
}
buff = ( wchar_t * ) realloc ( ( buff = = static_buff ? NULL : buff ) , size ) ;
if ( buff = = NULL ) {
DIE_MEM ( ) ;
}
}
/* Try printing */
va_list va ;
va_copy ( va , va_orig ) ;
status = vswprintf ( buff , size / sizeof ( wchar_t ) , format , va ) ;
va_end ( va ) ;
}
wcstring result = wcstring ( buff ) ;
if ( buff ! = static_buff )
free ( buff ) ;
errno = saved_err ;
2011-12-27 03:18:46 +00:00
return result ;
}
2012-02-22 18:51:06 +00:00
void append_format ( wcstring & str , const wchar_t * format , . . . )
{
2012-03-03 23:28:16 +00:00
/* Preserve errno across this call since it likes to stomp on it */
int err = errno ;
2012-02-22 18:51:06 +00:00
va_list va ;
va_start ( va , format ) ;
str . append ( vformat_string ( format , va ) ) ;
va_end ( va ) ;
2012-03-03 23:28:16 +00:00
errno = err ;
2012-02-22 18:51:06 +00:00
}
2012-02-10 02:43:36 +00:00
2006-10-19 15:39:50 +00:00
wchar_t * wcsvarname ( const wchar_t * str )
2005-09-20 13:26:39 +00:00
{
while ( * str )
{
if ( ( ! iswalnum ( * str ) ) & & ( * str ! = L ' _ ' ) )
{
2006-10-19 15:39:50 +00:00
return ( wchar_t * ) str ;
2005-09-20 13:26:39 +00:00
}
str + + ;
}
2006-04-21 14:29:39 +00:00
return 0 ;
2005-09-20 13:26:39 +00:00
}
2012-01-05 21:58:48 +00:00
const wchar_t * wcsfuncname ( const wchar_t * str )
2006-10-19 15:47:47 +00:00
{
return wcschr ( str , L ' / ' ) ;
}
2006-06-01 23:04:38 +00:00
int wcsvarchr ( wchar_t chr )
{
2012-05-09 09:55:36 +00:00
return iswalnum ( chr ) | | chr = = L ' _ ' ;
2006-06-01 23:04:38 +00:00
}
2005-09-20 13:26:39 +00:00
2011-12-27 03:18:46 +00:00
/**
2005-09-20 13:26:39 +00:00
The glibc version of wcswidth seems to hang on some strings . fish uses this replacement .
*/
int my_wcswidth ( const wchar_t * c )
{
int res = 0 ;
while ( * c )
{
int w = wcwidth ( * c + + ) ;
if ( w < 0 )
w = 1 ;
if ( w > 2 )
w = 1 ;
2011-12-27 03:18:46 +00:00
res + = w ;
2005-09-20 13:26:39 +00:00
}
return res ;
}
2006-06-14 13:22:40 +00:00
wchar_t * quote_end ( const wchar_t * pos )
2005-09-20 13:26:39 +00:00
{
2006-02-12 16:13:31 +00:00
wchar_t c = * pos ;
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
while ( 1 )
{
pos + + ;
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
if ( ! * pos )
return 0 ;
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
if ( * pos = = L ' \\ ' )
{
pos + + ;
2006-06-15 00:59:31 +00:00
if ( ! * pos )
return 0 ;
2006-02-12 16:13:31 +00:00
}
else
{
if ( * pos = = c )
{
2006-06-14 13:22:40 +00:00
return ( wchar_t * ) pos ;
2006-02-12 16:13:31 +00:00
}
}
}
return 0 ;
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
}
2005-09-20 13:26:39 +00:00
2011-12-27 03:18:46 +00:00
2012-02-01 05:06:52 +00:00
wcstring wsetlocale ( int category , const wchar_t * locale )
2005-09-20 13:26:39 +00:00
{
2006-01-08 23:00:49 +00:00
2012-02-28 15:50:09 +00:00
char * lang = NULL ;
if ( locale & & wcscmp ( locale , L " " ) ) {
lang = wcs2str ( locale ) ;
}
2006-01-08 23:00:49 +00:00
char * res = setlocale ( category , lang ) ;
2005-09-20 13:26:39 +00:00
free ( lang ) ;
2006-01-08 23:00:49 +00:00
2005-09-20 13:26:39 +00:00
/*
Use ellipsis if on known unicode system , otherwise use $
*/
2011-12-27 03:18:46 +00:00
char * ctype = setlocale ( LC_CTYPE , NULL ) ;
ellipsis_char = ( strstr ( ctype , " .UTF " ) | | strstr ( ctype , " .utf " ) ) ? L ' \ x2026 ' : L ' $ ' ;
2006-01-08 23:00:49 +00:00
if ( ! res )
2012-02-01 05:06:52 +00:00
return wcstring ( ) ;
else
return format_string ( L " %s " , res ) ;
2005-09-20 13:26:39 +00:00
}
2012-01-30 17:46:33 +00:00
bool contains_internal ( const wchar_t * a , . . . )
2005-09-20 13:26:39 +00:00
{
2012-01-30 17:46:33 +00:00
const wchar_t * arg ;
2005-09-20 13:26:39 +00:00
va_list va ;
int res = 0 ;
2006-05-02 16:28:30 +00:00
2006-06-21 00:48:36 +00:00
CHECK ( a , 0 ) ;
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
va_start ( va , a ) ;
2012-01-30 17:46:33 +00:00
while ( ( arg = va_arg ( va , const wchar_t * ) ) ! = 0 )
2005-09-20 13:26:39 +00:00
{
if ( wcscmp ( a , arg ) = = 0 )
{
res = 1 ;
break ;
}
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
}
va_end ( va ) ;
2012-01-30 17:46:33 +00:00
return res ;
}
/* wcstring variant of contains_internal. The first parameter is a wcstring, the rest are const wchar_t* */
__sentinel bool contains_internal ( const wcstring & needle , . . . )
{
const wchar_t * arg ;
va_list va ;
int res = 0 ;
va_start ( va , needle ) ;
while ( ( arg = va_arg ( va , const wchar_t * ) ) ! = 0 )
{
if ( needle = = arg )
{
res = 1 ;
break ;
}
}
va_end ( va ) ;
return res ;
2005-09-20 13:26:39 +00:00
}
int read_blocked ( int fd , void * buf , size_t count )
{
2011-12-27 03:18:46 +00:00
int res ;
sigset_t chldset , oldset ;
2005-09-20 13:26:39 +00:00
sigemptyset ( & chldset ) ;
sigaddset ( & chldset , SIGCHLD ) ;
sigprocmask ( SIG_BLOCK , & chldset , & oldset ) ;
res = read ( fd , buf , count ) ;
sigprocmask ( SIG_SETMASK , & oldset , 0 ) ;
2011-12-27 03:18:46 +00:00
return res ;
2005-09-20 13:26:39 +00:00
}
2012-01-14 11:41:50 +00:00
ssize_t write_loop ( int fd , const char * buff , size_t count )
2009-02-22 20:28:52 +00:00
{
2012-02-29 19:27:14 +00:00
ssize_t out = 0 ;
2012-01-14 11:41:50 +00:00
size_t out_cum = 0 ;
2011-12-27 03:18:46 +00:00
while ( 1 )
2009-02-22 20:28:52 +00:00
{
2011-12-27 03:18:46 +00:00
out = write ( fd ,
2009-02-22 20:28:52 +00:00
& buff [ out_cum ] ,
count - out_cum ) ;
2012-01-14 11:41:50 +00:00
if ( out < 0 )
2009-02-22 20:28:52 +00:00
{
2012-02-29 19:27:14 +00:00
if ( errno ! = EAGAIN & & errno ! = EINTR )
2009-02-22 20:28:52 +00:00
{
return - 1 ;
}
2012-02-29 19:27:14 +00:00
}
else
2009-02-22 20:28:52 +00:00
{
2012-01-14 11:41:50 +00:00
out_cum + = ( size_t ) out ;
2009-02-22 20:28:52 +00:00
}
2011-12-27 03:18:46 +00:00
if ( out_cum > = count )
2009-02-22 20:28:52 +00:00
{
break ;
}
2011-12-27 03:18:46 +00:00
}
2009-02-22 20:28:52 +00:00
return out_cum ;
}
2012-03-01 01:55:28 +00:00
ssize_t read_loop ( int fd , void * buff , size_t count )
{
ssize_t result ;
do {
result = read ( fd , buff , count ) ;
} while ( result < 0 & & ( errno = = EAGAIN | | errno = = EINTR ) ) ;
return result ;
}
2006-01-04 12:51:02 +00:00
void debug ( int level , const wchar_t * msg , . . . )
2005-09-20 13:26:39 +00:00
{
va_list va ;
2006-12-14 10:01:31 +00:00
2012-02-22 18:51:06 +00:00
wcstring sb ;
2006-12-14 10:01:31 +00:00
int errno_old = errno ;
2011-12-27 03:18:46 +00:00
2005-09-24 19:31:17 +00:00
if ( level > debug_level )
2005-09-20 13:26:39 +00:00
return ;
2006-12-14 10:01:31 +00:00
CHECK ( msg , ) ;
2011-12-27 03:18:46 +00:00
2012-02-23 17:40:51 +00:00
sb = format_string ( L " %ls: " , program_name ) ;
va_start ( va , msg ) ;
sb . append ( vformat_string ( msg , va ) ) ;
va_end ( va ) ;
2006-05-31 15:40:28 +00:00
2012-02-22 18:51:06 +00:00
wcstring sb2 ;
write_screen ( sb , sb2 ) ;
fwprintf ( stderr , L " %ls " , sb2 . c_str ( ) ) ;
2006-05-31 15:40:28 +00:00
2012-02-22 18:51:06 +00:00
errno = errno_old ;
}
2006-01-15 11:58:05 +00:00
2012-03-09 07:21:07 +00:00
void debug_safe ( int level , const char * msg , const char * param1 , const char * param2 , const char * param3 , const char * param4 , const char * param5 , const char * param6 , const char * param7 , const char * param8 , const char * param9 , const char * param10 , const char * param11 , const char * param12 )
2012-02-29 19:27:14 +00:00
{
2012-03-09 07:21:07 +00:00
const char * const params [ ] = { param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 } ;
2012-02-29 19:27:14 +00:00
if ( ! msg )
return ;
/* Can't call printf, that may allocate memory Just call write() over and over. */
if ( level > debug_level )
return ;
int errno_old = errno ;
size_t param_idx = 0 ;
const char * cursor = msg ;
while ( * cursor ! = ' \0 ' ) {
const char * end = strchr ( cursor , ' % ' ) ;
if ( end = = NULL )
end = cursor + strlen ( cursor ) ;
write ( STDERR_FILENO , cursor , end - cursor ) ;
if ( end [ 0 ] = = ' % ' & & end [ 1 ] = = ' s ' ) {
/* Handle a format string */
2012-03-09 07:21:07 +00:00
assert ( param_idx < sizeof params / sizeof * params ) ;
const char * format = params [ param_idx + + ] ;
2012-02-29 19:27:14 +00:00
if ( ! format )
format = " (null) " ;
write ( STDERR_FILENO , format , strlen ( format ) ) ;
cursor = end + 2 ;
} else if ( end [ 0 ] = = ' \0 ' ) {
/* Must be at the end of the string */
cursor = end ;
} else {
/* Some other format specifier, just skip it */
cursor = end + 1 ;
}
}
// We always append a newline
write ( STDERR_FILENO , " \n " , 1 ) ;
errno = errno_old ;
}
2012-03-03 23:20:30 +00:00
void format_long_safe ( char buff [ 128 ] , long val ) {
2012-02-29 19:27:14 +00:00
if ( val = = 0 ) {
strcpy ( buff , " 0 " ) ;
} else {
/* Generate the string in reverse */
size_t idx = 0 ;
bool negative = ( val < 0 ) ;
2012-03-03 23:20:30 +00:00
/* Note that we can't just negate val if it's negative, because it may be the most negative value. We do rely on round-towards-zero division though. */
2012-02-29 19:27:14 +00:00
2012-03-03 23:20:30 +00:00
while ( val ! = 0 ) {
long rem = val % 10 ;
buff [ idx + + ] = ' 0 ' + ( rem < 0 ? - rem : rem ) ;
2012-02-29 19:27:14 +00:00
val / = 10 ;
}
if ( negative )
buff [ idx + + ] = ' - ' ;
2012-03-01 01:55:28 +00:00
buff [ idx ] = 0 ;
2012-02-29 19:27:14 +00:00
size_t left = 0 , right = idx - 1 ;
while ( left < right ) {
char tmp = buff [ left ] ;
buff [ left + + ] = buff [ right ] ;
buff [ right - - ] = tmp ;
}
}
}
2012-03-03 23:20:30 +00:00
void format_long_safe ( wchar_t buff [ 128 ] , long val ) {
if ( val = = 0 ) {
wcscpy ( buff , L " 0 " ) ;
} else {
/* Generate the string in reverse */
size_t idx = 0 ;
bool negative = ( val < 0 ) ;
while ( val > 0 ) {
long rem = val % 10 ;
/* Here we're assuming that wide character digits are contiguous - is that a correct assumption? */
buff [ idx + + ] = L ' 0 ' + ( rem < 0 ? - rem : rem ) ;
val / = 10 ;
}
if ( negative )
buff [ idx + + ] = L ' - ' ;
buff [ idx ] = 0 ;
size_t left = 0 , right = idx - 1 ;
while ( left < right ) {
wchar_t tmp = buff [ left ] ;
buff [ left + + ] = buff [ right ] ;
buff [ right - - ] = tmp ;
}
}
}
2012-02-22 18:51:06 +00:00
void write_screen ( const wcstring & msg , wcstring & buff )
{
const wchar_t * start , * pos ;
int line_width = 0 ;
int tok_width = 0 ;
int screen_width = common_get_width ( ) ;
if ( screen_width )
{
start = pos = msg . c_str ( ) ;
while ( 1 )
{
int overflow = 0 ;
tok_width = 0 ;
2006-01-15 11:58:05 +00:00
2012-02-22 18:51:06 +00:00
/*
Tokenize on whitespace , and also calculate the width of the token
*/
while ( * pos & & ( ! wcschr ( L " \n \r \t " , * pos ) ) )
{
/*
Check is token is wider than one line .
If so we mark it as an overflow and break the token .
*/
if ( ( tok_width + wcwidth ( * pos ) ) > ( screen_width - 1 ) )
{
overflow = 1 ;
break ;
}
tok_width + = wcwidth ( * pos ) ;
pos + + ;
}
2006-12-14 10:01:31 +00:00
2012-02-22 18:51:06 +00:00
/*
If token is zero character long , we don ' t do anything
*/
if ( pos = = start )
{
start = pos = pos + 1 ;
}
else if ( overflow )
{
/*
In case of overflow , we print a newline , except if we already are at position 0
*/
wchar_t * token = wcsndup ( start , pos - start ) ;
if ( line_width ! = 0 )
buff . push_back ( L ' \n ' ) ;
buff . append ( format_string ( L " %ls- \n " , token ) ) ;
free ( token ) ;
line_width = 0 ;
}
else
{
/*
Print the token
*/
wchar_t * token = wcsndup ( start , pos - start ) ;
if ( ( line_width + ( line_width ! = 0 ? 1 : 0 ) + tok_width ) > screen_width )
{
buff . push_back ( L ' \n ' ) ;
line_width = 0 ;
}
buff . append ( format_string ( L " %ls%ls " , line_width ? L " " : L " " , token ) ) ;
free ( token ) ;
line_width + = ( line_width ! = 0 ? 1 : 0 ) + tok_width ;
}
/*
Break on end of string
*/
if ( ! * pos )
{
break ;
}
start = pos ;
}
}
else
{
buff . append ( msg ) ;
}
buff . push_back ( L ' \n ' ) ;
2006-01-15 11:58:05 +00:00
}
2008-01-13 16:47:47 +00:00
/**
Perform string escaping of a strinng by only quoting it . Assumes
the string has already been checked for characters that can not be
escaped this way .
*/
2007-09-22 19:08:38 +00:00
static wchar_t * escape_simple ( const wchar_t * in )
2005-09-20 13:26:39 +00:00
{
2007-09-22 19:08:38 +00:00
wchar_t * out ;
size_t len = wcslen ( in ) ;
2011-12-27 03:18:46 +00:00
out = ( wchar_t * ) malloc ( sizeof ( wchar_t ) * ( len + 3 ) ) ;
2007-09-22 19:08:38 +00:00
if ( ! out )
DIE_MEM ( ) ;
2011-12-27 03:18:46 +00:00
2007-09-22 19:08:38 +00:00
out [ 0 ] = L ' \' ' ;
wcscpy ( & out [ 1 ] , in ) ;
out [ len + 1 ] = L ' \' ' ;
out [ len + 2 ] = 0 ;
return out ;
}
2011-12-27 03:18:46 +00:00
wchar_t * escape ( const wchar_t * in_orig ,
2007-10-06 10:51:31 +00:00
int flags )
2007-09-22 19:08:38 +00:00
{
const wchar_t * in = in_orig ;
2011-12-27 03:18:46 +00:00
2007-10-06 10:51:31 +00:00
int escape_all = flags & ESCAPE_ALL ;
int no_quoted = flags & ESCAPE_NO_QUOTED ;
2011-12-27 03:18:46 +00:00
2006-06-08 23:52:12 +00:00
wchar_t * out ;
wchar_t * pos ;
2007-09-22 19:08:38 +00:00
int need_escape = 0 ;
int need_complex_escape = 0 ;
2006-06-08 23:52:12 +00:00
if ( ! in )
{
debug ( 0 , L " %s called with null input " , __func__ ) ;
2007-01-21 15:03:41 +00:00
FATAL_EXIT ( ) ;
2006-06-08 23:52:12 +00:00
}
2007-09-25 16:19:59 +00:00
2007-10-06 10:51:31 +00:00
if ( ! no_quoted & & ( wcslen ( in ) = = 0 ) )
2007-09-25 16:19:59 +00:00
{
out = wcsdup ( L " '' " ) ;
if ( ! out )
DIE_MEM ( ) ;
return out ;
}
2011-12-27 03:18:46 +00:00
out = ( wchar_t * ) malloc ( sizeof ( wchar_t ) * ( wcslen ( in ) * 4 + 1 ) ) ;
2006-06-08 23:52:12 +00:00
pos = out ;
2011-12-27 03:18:46 +00:00
2005-10-07 10:36:51 +00:00
if ( ! out )
2006-07-03 10:39:57 +00:00
DIE_MEM ( ) ;
2011-12-27 03:18:46 +00:00
2005-10-07 10:36:51 +00:00
while ( * in ! = 0 )
2005-09-20 13:26:39 +00:00
{
2006-01-28 02:03:29 +00:00
if ( ( * in > = ENCODE_DIRECT_BASE ) & &
( * in < ENCODE_DIRECT_BASE + 256 ) )
{
int val = * in - ENCODE_DIRECT_BASE ;
int tmp ;
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
* ( pos + + ) = L ' \\ ' ;
* ( pos + + ) = L ' X ' ;
2011-12-27 03:18:46 +00:00
tmp = val / 16 ;
2006-01-28 02:03:29 +00:00
* pos + + = tmp > 9 ? L ' a ' + ( tmp - 10 ) : L ' 0 ' + tmp ;
2011-12-27 03:18:46 +00:00
tmp = val % 16 ;
2006-01-28 02:03:29 +00:00
* pos + + = tmp > 9 ? L ' a ' + ( tmp - 10 ) : L ' 0 ' + tmp ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
}
else
{
2011-12-27 03:18:46 +00:00
2006-06-15 10:36:46 +00:00
switch ( * in )
{
case L ' \t ' :
* ( pos + + ) = L ' \\ ' ;
2011-12-27 03:18:46 +00:00
* ( pos + + ) = L ' t ' ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2006-06-15 10:36:46 +00:00
break ;
2011-12-27 03:18:46 +00:00
2006-06-15 10:36:46 +00:00
case L ' \n ' :
* ( pos + + ) = L ' \\ ' ;
2011-12-27 03:18:46 +00:00
* ( pos + + ) = L ' n ' ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2006-06-15 10:36:46 +00:00
break ;
2011-12-27 03:18:46 +00:00
2006-06-15 10:37:06 +00:00
case L ' \b ' :
* ( pos + + ) = L ' \\ ' ;
2011-12-27 03:18:46 +00:00
* ( pos + + ) = L ' b ' ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2006-06-15 10:37:06 +00:00
break ;
2011-12-27 03:18:46 +00:00
2006-06-15 10:37:06 +00:00
case L ' \r ' :
* ( pos + + ) = L ' \\ ' ;
2011-12-27 03:18:46 +00:00
* ( pos + + ) = L ' r ' ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2006-06-15 10:37:06 +00:00
break ;
2011-12-27 03:18:46 +00:00
2007-09-25 16:19:16 +00:00
case L ' \x1b ' :
* ( pos + + ) = L ' \\ ' ;
2011-12-27 03:18:46 +00:00
* ( pos + + ) = L ' e ' ;
2007-09-25 16:19:16 +00:00
need_escape = need_complex_escape = 1 ;
break ;
2011-12-27 03:18:46 +00:00
2007-09-25 16:19:16 +00:00
2006-06-15 10:37:06 +00:00
case L ' \\ ' :
2007-09-23 14:55:55 +00:00
case L ' \' ' :
2007-09-22 19:08:38 +00:00
{
need_escape = need_complex_escape = 1 ;
if ( escape_all )
* pos + + = L ' \\ ' ;
* pos + + = * in ;
break ;
}
2006-06-15 10:37:06 +00:00
case L ' & ' :
case L ' $ ' :
case L ' ' :
case L ' # ' :
case L ' ^ ' :
case L ' < ' :
case L ' > ' :
case L ' ( ' :
case L ' ) ' :
case L ' [ ' :
case L ' ] ' :
case L ' { ' :
case L ' } ' :
case L ' ? ' :
case L ' * ' :
case L ' | ' :
case L ' ; ' :
case L ' " ' :
case L ' % ' :
case L ' ~ ' :
2005-10-07 10:36:51 +00:00
{
2007-09-22 19:08:38 +00:00
need_escape = 1 ;
2006-06-15 10:37:06 +00:00
if ( escape_all )
* pos + + = L ' \\ ' ;
2005-10-07 10:36:51 +00:00
* pos + + = * in ;
2006-06-15 10:37:06 +00:00
break ;
}
2011-12-27 03:18:46 +00:00
2006-06-15 10:37:06 +00:00
default :
{
if ( * in < 32 )
{
2007-09-25 16:19:16 +00:00
if ( * in < 27 & & * in > 0 )
{
* ( pos + + ) = L ' \\ ' ;
* ( pos + + ) = L ' c ' ;
* ( pos + + ) = L ' a ' + * in - 1 ;
2011-12-27 03:18:46 +00:00
2007-09-25 16:19:16 +00:00
need_escape = need_complex_escape = 1 ;
break ;
2011-12-27 03:18:46 +00:00
2007-09-25 16:19:16 +00:00
}
2011-12-27 03:18:46 +00:00
2007-09-25 16:19:16 +00:00
2006-06-15 10:37:06 +00:00
int tmp = ( * in ) % 16 ;
* pos + + = L ' \\ ' ;
* pos + + = L ' x ' ;
* pos + + = ( ( * in > 15 ) ? L ' 1 ' : L ' 0 ' ) ;
* pos + + = tmp > 9 ? L ' a ' + ( tmp - 10 ) : L ' 0 ' + tmp ;
2007-09-22 19:08:38 +00:00
need_escape = need_complex_escape = 1 ;
2006-06-15 10:37:06 +00:00
}
else
{
* pos + + = * in ;
}
break ;
}
}
2006-01-28 02:03:29 +00:00
}
2011-12-27 03:18:46 +00:00
2005-10-07 10:36:51 +00:00
in + + ;
2005-09-20 13:26:39 +00:00
}
2005-10-07 10:36:51 +00:00
* pos = 0 ;
2007-09-22 19:08:38 +00:00
/*
Use quoted escaping if possible , since most people find it
2011-12-27 03:18:46 +00:00
easier to read .
2007-09-22 19:08:38 +00:00
*/
2007-10-06 10:51:31 +00:00
if ( ! no_quoted & & need_escape & & ! need_complex_escape & & escape_all )
2007-09-22 19:08:38 +00:00
{
free ( out ) ;
out = escape_simple ( in_orig ) ;
}
2011-12-27 03:18:46 +00:00
2005-09-20 13:26:39 +00:00
return out ;
}
2011-12-27 03:18:46 +00:00
wcstring escape_string ( const wcstring & in , int escape_all ) {
wchar_t * tmp = escape ( in . c_str ( ) , escape_all ) ;
wcstring result ( tmp ) ;
free ( tmp ) ;
return result ;
}
2005-09-20 13:26:39 +00:00
2007-01-18 16:02:46 +00:00
wchar_t * unescape ( const wchar_t * orig , int flags )
2005-09-20 13:26:39 +00:00
{
2011-12-27 03:18:46 +00:00
int mode = 0 ;
2006-06-08 23:52:12 +00:00
int in_pos , out_pos , len ;
2005-09-20 13:26:39 +00:00
int c ;
int bracket_count = 0 ;
2011-12-27 03:18:46 +00:00
wchar_t prev = 0 ;
2006-06-08 23:52:12 +00:00
wchar_t * in ;
2007-01-18 16:02:46 +00:00
int unescape_special = flags & UNESCAPE_SPECIAL ;
int allow_incomplete = flags & UNESCAPE_INCOMPLETE ;
2011-12-27 03:18:46 +00:00
2006-06-21 00:48:36 +00:00
CHECK ( orig , 0 ) ;
2011-12-27 03:18:46 +00:00
2006-06-08 23:52:12 +00:00
len = wcslen ( orig ) ;
in = wcsdup ( orig ) ;
2005-10-07 10:36:51 +00:00
if ( ! in )
2006-07-03 10:39:57 +00:00
DIE_MEM ( ) ;
2011-12-27 03:18:46 +00:00
for ( in_pos = 0 , out_pos = 0 ;
in_pos < len ;
2005-11-02 16:49:13 +00:00
( prev = ( out_pos > = 0 ) ? in [ out_pos ] : 0 ) , out_pos + + , in_pos + + )
2005-09-20 13:26:39 +00:00
{
c = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
switch ( mode )
2005-09-20 13:26:39 +00:00
{
2005-11-02 16:49:13 +00:00
/*
Mode 0 means unquoted string
*/
case 0 :
{
if ( c = = L ' \\ ' )
2005-09-20 13:26:39 +00:00
{
2005-11-02 16:49:13 +00:00
switch ( in [ + + in_pos ] )
2005-09-20 13:26:39 +00:00
{
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
A null character after a backslash is an
error , return null
*/
2005-11-02 16:49:13 +00:00
case L ' \0 ' :
{
2007-01-26 17:14:13 +00:00
if ( ! allow_incomplete )
{
free ( in ) ;
return 0 ;
}
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
Numeric escape sequences . No prefix means
octal escape , otherwise hexadecimal .
*/
2011-12-27 03:18:46 +00:00
2006-02-24 12:18:29 +00:00
case L ' 0 ' :
case L ' 1 ' :
case L ' 2 ' :
case L ' 3 ' :
case L ' 4 ' :
case L ' 5 ' :
case L ' 6 ' :
case L ' 7 ' :
2006-09-03 23:00:06 +00:00
case L ' u ' :
case L ' U ' :
case L ' x ' :
case L ' X ' :
2005-11-02 16:49:13 +00:00
{
int i ;
2006-02-24 12:18:29 +00:00
long long res = 0 ;
2005-11-02 16:49:13 +00:00
int chars = 2 ;
int base = 16 ;
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
int byte = 0 ;
2006-05-14 13:25:10 +00:00
wchar_t max_val = ASCII_MAX ;
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
switch ( in [ in_pos ] )
{
case L ' u ' :
{
chars = 4 ;
2006-05-14 13:25:10 +00:00
max_val = UCS2_MAX ;
2005-11-02 16:49:13 +00:00
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' U ' :
{
chars = 8 ;
2006-02-24 12:18:29 +00:00
max_val = WCHAR_MAX ;
2005-11-02 16:49:13 +00:00
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' x ' :
{
break ;
}
2011-12-27 03:18:46 +00:00
2006-01-28 02:03:29 +00:00
case L ' X ' :
{
byte = 1 ;
2006-05-14 13:25:10 +00:00
max_val = BYTE_MAX ;
2006-01-28 02:03:29 +00:00
break ;
}
2011-12-27 03:18:46 +00:00
2006-02-24 12:18:29 +00:00
default :
2005-11-02 16:49:13 +00:00
{
base = 8 ;
chars = 3 ;
2006-02-24 12:18:29 +00:00
in_pos - - ;
2005-11-02 16:49:13 +00:00
break ;
2011-12-27 03:18:46 +00:00
}
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
for ( i = 0 ; i < chars ; i + + )
{
int d = convert_digit ( in [ + + in_pos ] , base ) ;
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
if ( d < 0 )
{
in_pos - - ;
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
res = ( res * base ) | d ;
}
2006-02-24 12:18:29 +00:00
2006-05-09 16:55:01 +00:00
if ( ( res < = max_val ) )
2006-02-24 12:18:29 +00:00
{
in [ out_pos ] = ( byte ? ENCODE_DIRECT_BASE : 0 ) + res ;
}
else
2011-12-27 03:18:46 +00:00
{
free ( in ) ;
2006-02-24 12:18:29 +00:00
return 0 ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
break ;
}
2005-09-20 13:26:39 +00:00
2006-09-03 23:00:06 +00:00
/*
\ a means bell ( alert )
*/
case L ' a ' :
{
in [ out_pos ] = L ' \a ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
\ b means backspace
*/
case L ' b ' :
{
in [ out_pos ] = L ' \b ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
\ cX means control sequence X
*/
case L ' c ' :
{
in_pos + + ;
if ( in [ in_pos ] > = L ' a ' & &
in [ in_pos ] < = ( L ' a ' + 32 ) )
{
in [ out_pos ] = in [ in_pos ] - L ' a ' + 1 ;
}
else if ( in [ in_pos ] > = L ' A ' & &
in [ in_pos ] < = ( L ' A ' + 32 ) )
{
in [ out_pos ] = in [ in_pos ] - L ' A ' + 1 ;
}
else
{
2011-12-27 03:18:46 +00:00
free ( in ) ;
2006-09-03 23:00:06 +00:00
return 0 ;
}
break ;
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
2007-08-22 07:52:39 +00:00
\ x1b means escape
2006-09-03 23:00:06 +00:00
*/
2007-09-08 19:18:55 +00:00
case L ' e ' :
2006-09-03 23:00:06 +00:00
{
in [ out_pos ] = L ' \x1b ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
\ f means form feed
*/
case L ' f ' :
{
in [ out_pos ] = L ' \f ' ;
break ;
}
/*
\ n means newline
*/
case L ' n ' :
{
in [ out_pos ] = L ' \n ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
\ r means carriage return
*/
case L ' r ' :
{
in [ out_pos ] = L ' \r ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-09-03 23:00:06 +00:00
/*
\ t means tab
*/
case L ' t ' :
{
in [ out_pos ] = L ' \t ' ;
break ;
}
/*
2007-09-08 19:18:55 +00:00
\ v means vertical tab
2006-09-03 23:00:06 +00:00
*/
case L ' v ' :
{
in [ out_pos ] = L ' \v ' ;
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
default :
2005-09-20 13:26:39 +00:00
{
2006-10-09 15:19:13 +00:00
if ( unescape_special )
2011-12-27 03:18:46 +00:00
in [ out_pos + + ] = INTERNAL_SEPARATOR ;
2005-11-02 16:49:13 +00:00
in [ out_pos ] = in [ in_pos ] ;
break ;
2005-09-20 13:26:39 +00:00
}
}
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
else
2005-11-02 16:49:13 +00:00
{
2006-09-03 23:00:06 +00:00
switch ( in [ in_pos ] )
{
2005-11-02 16:49:13 +00:00
case L ' ~ ' :
{
if ( unescape_special & & ( in_pos = = 0 ) )
{
in [ out_pos ] = HOME_DIRECTORY ;
}
else
{
in [ out_pos ] = L ' ~ ' ;
}
break ;
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
case L ' % ' :
{
if ( unescape_special & & ( in_pos = = 0 ) )
{
in [ out_pos ] = PROCESS_EXPAND ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
break ;
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
case L ' * ' :
{
if ( unescape_special )
{
if ( out_pos > 0 & & in [ out_pos - 1 ] = = ANY_STRING )
{
out_pos - - ;
in [ out_pos ] = ANY_STRING_RECURSIVE ;
}
else
in [ out_pos ] = ANY_STRING ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
break ;
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
case L ' ? ' :
{
if ( unescape_special )
{
in [ out_pos ] = ANY_CHAR ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
break ;
2005-11-02 16:49:13 +00:00
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
case L ' $ ' :
{
if ( unescape_special )
{
in [ out_pos ] = VARIABLE_EXPAND ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
break ;
2005-11-02 16:49:13 +00:00
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
case L ' { ' :
{
if ( unescape_special )
{
bracket_count + + ;
in [ out_pos ] = BRACKET_BEGIN ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
break ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' } ' :
{
if ( unescape_special )
{
bracket_count - - ;
in [ out_pos ] = BRACKET_END ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
break ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' , ' :
{
if ( unescape_special & & bracket_count & & prev ! = BRACKET_SEP )
{
in [ out_pos ] = BRACKET_SEP ;
}
else
{
2011-12-27 03:18:46 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
break ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' \' ' :
{
mode = 1 ;
2006-10-09 15:19:13 +00:00
if ( unescape_special )
2011-12-27 03:18:46 +00:00
in [ out_pos ] = INTERNAL_SEPARATOR ;
2007-01-18 16:02:46 +00:00
else
2011-12-27 03:18:46 +00:00
out_pos - - ;
break ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case L ' \" ' :
{
mode = 2 ;
2006-10-09 15:19:13 +00:00
if ( unescape_special )
2011-12-27 03:18:46 +00:00
in [ out_pos ] = INTERNAL_SEPARATOR ;
2007-01-18 16:02:46 +00:00
else
2011-12-27 03:18:46 +00:00
out_pos - - ;
2005-11-02 16:49:13 +00:00
break ;
}
2005-09-20 13:26:39 +00:00
2005-11-02 16:49:13 +00:00
default :
{
in [ out_pos ] = in [ in_pos ] ;
break ;
}
}
2011-12-27 03:18:46 +00:00
}
2005-11-02 16:49:13 +00:00
break ;
}
/*
Mode 1 means single quoted string , i . e ' foo '
*/
case 1 :
{
2006-02-12 16:13:31 +00:00
if ( c = = L ' \\ ' )
{
switch ( in [ + + in_pos ] )
{
2006-03-06 01:50:12 +00:00
case ' \\ ' :
2006-02-12 16:13:31 +00:00
case L ' \' ' :
2006-10-09 01:22:48 +00:00
case L ' \n ' :
2006-02-12 16:13:31 +00:00
{
in [ out_pos ] = in [ in_pos ] ;
break ;
}
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
case 0 :
{
2007-01-26 17:14:13 +00:00
if ( ! allow_incomplete )
{
free ( in ) ;
return 0 ;
}
else
2012-03-13 00:09:17 +00:00
{
//We may ever escape a NULL character, but still appending a \ in case I am wrong.
in [ out_pos ] = L ' \\ ' ;
}
2006-02-12 16:13:31 +00:00
}
2012-03-13 00:09:17 +00:00
break ;
2006-02-12 16:13:31 +00:00
default :
{
in [ out_pos + + ] = L ' \\ ' ;
in [ out_pos ] = in [ in_pos ] ;
}
}
2011-12-27 03:18:46 +00:00
2006-02-12 16:13:31 +00:00
}
2005-11-02 16:49:13 +00:00
if ( c = = L ' \' ' )
{
2006-10-09 15:19:13 +00:00
if ( unescape_special )
2011-12-27 03:18:46 +00:00
in [ out_pos ] = INTERNAL_SEPARATOR ;
2007-01-18 16:02:46 +00:00
else
2011-12-27 03:18:46 +00:00
out_pos - - ;
2005-11-02 16:49:13 +00:00
mode = 0 ;
2005-09-20 13:26:39 +00:00
}
2005-11-02 16:49:13 +00:00
else
{
2005-09-20 13:26:39 +00:00
in [ out_pos ] = in [ in_pos ] ;
2005-11-02 16:49:13 +00:00
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
break ;
2005-09-20 13:26:39 +00:00
}
2005-11-02 16:49:13 +00:00
/*
Mode 2 means double quoted string , i . e . " foo "
*/
case 2 :
{
switch ( c )
{
case ' " ' :
{
mode = 0 ;
2006-10-09 15:19:13 +00:00
if ( unescape_special )
2011-12-27 03:18:46 +00:00
in [ out_pos ] = INTERNAL_SEPARATOR ;
2007-01-18 16:02:46 +00:00
else
2011-12-27 03:18:46 +00:00
out_pos - - ;
2005-11-02 16:49:13 +00:00
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case ' \\ ' :
{
switch ( in [ + + in_pos ] )
{
case L ' \0 ' :
{
2007-01-26 17:14:13 +00:00
if ( ! allow_incomplete )
{
free ( in ) ;
return 0 ;
}
else
2012-03-13 00:09:17 +00:00
{
//We probably don't need it since NULL character is always appended before ending this function.
in [ out_pos ] = in [ in_pos ] ;
}
2005-11-02 16:49:13 +00:00
}
2012-03-13 00:09:17 +00:00
break ;
2006-03-06 01:50:12 +00:00
case ' \\ ' :
2005-11-02 16:49:13 +00:00
case L ' $ ' :
2006-02-12 16:13:31 +00:00
case ' " ' :
2006-10-09 01:22:48 +00:00
case ' \n ' :
2005-11-02 16:49:13 +00:00
{
in [ out_pos ] = in [ in_pos ] ;
break ;
}
2006-02-12 16:13:31 +00:00
2005-11-02 16:49:13 +00:00
default :
{
in [ out_pos + + ] = L ' \\ ' ;
in [ out_pos ] = in [ in_pos ] ;
break ;
}
}
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
case ' $ ' :
{
if ( unescape_special )
{
in [ out_pos ] = VARIABLE_EXPAND_SINGLE ;
}
else
{
in [ out_pos ] = in [ in_pos ] ;
}
break ;
}
2011-12-27 03:18:46 +00:00
2005-11-02 16:49:13 +00:00
default :
{
in [ out_pos ] = in [ in_pos ] ;
break ;
}
2011-12-27 03:18:46 +00:00
}
2005-11-02 16:49:13 +00:00
break ;
}
}
2005-09-20 13:26:39 +00:00
}
2007-01-18 16:02:46 +00:00
if ( ! allow_incomplete & & mode )
{
free ( in ) ;
return 0 ;
}
2007-01-18 16:27:00 +00:00
2005-09-20 13:26:39 +00:00
in [ out_pos ] = L ' \0 ' ;
2011-12-27 03:18:46 +00:00
return in ;
}
2012-01-02 21:40:03 +00:00
bool unescape_string ( wcstring & str , int escape_special )
2011-12-27 03:18:46 +00:00
{
2012-01-02 21:40:03 +00:00
bool success = false ;
2011-12-27 03:18:46 +00:00
wchar_t * result = unescape ( str . c_str ( ) , escape_special ) ;
2012-02-15 19:33:41 +00:00
if ( result ) {
2012-01-02 21:40:03 +00:00
str . replace ( str . begin ( ) , str . end ( ) , result ) ;
free ( result ) ;
success = true ;
}
return success ;
2005-09-20 13:26:39 +00:00
}
2005-10-01 19:18:52 +00:00
2005-10-14 11:40:33 +00:00
void common_handle_winch ( int signal )
{
2006-07-30 20:55:44 +00:00
# ifdef HAVE_WINSIZE
2005-10-14 11:40:33 +00:00
if ( ioctl ( 1 , TIOCGWINSZ , & termsize ) ! = 0 )
{
return ;
}
2006-07-30 20:55:44 +00:00
# else
termsize . ws_col = 80 ;
2006-08-01 00:46:48 +00:00
termsize . ws_row = 24 ;
2006-07-30 20:55:44 +00:00
# endif
2005-10-14 11:40:33 +00:00
}
int common_get_width ( )
{
return termsize . ws_col ;
}
int common_get_height ( )
{
return termsize . ws_row ;
}
2012-02-10 09:37:30 +00:00
void tokenize_variable_array ( const wcstring & val , std : : vector < wcstring > & out )
2011-12-27 07:13:05 +00:00
{
size_t pos = 0 , end = val . size ( ) ;
while ( pos < end ) {
size_t next_pos = val . find ( ARRAY_SEP , pos ) ;
2012-01-31 05:33:15 +00:00
if ( next_pos = = wcstring : : npos ) break ;
2011-12-27 07:13:05 +00:00
out . push_back ( val . substr ( pos , next_pos - pos ) ) ;
pos = next_pos + 1 ; //skip the separator
}
2012-01-31 05:33:15 +00:00
out . push_back ( val . substr ( pos , end - pos ) ) ;
2011-12-27 07:13:05 +00:00
}
2012-05-09 09:33:42 +00:00
bool string_prefixes_string ( const wchar_t * proposed_prefix , const wcstring & value )
{
size_t prefix_size = wcslen ( proposed_prefix ) ;
return prefix_size < = value . size ( ) & & value . compare ( 0 , prefix_size , proposed_prefix ) = = 0 ;
}
2012-02-27 04:11:34 +00:00
bool string_prefixes_string ( const wcstring & proposed_prefix , const wcstring & value )
{
2012-02-01 00:50:03 +00:00
size_t prefix_size = proposed_prefix . size ( ) ;
return prefix_size < = value . size ( ) & & value . compare ( 0 , prefix_size , proposed_prefix ) = = 0 ;
}
2006-05-29 11:13:42 +00:00
2012-03-02 01:31:45 +00:00
bool string_prefixes_string_case_insensitive ( const wcstring & proposed_prefix , const wcstring & value ) {
size_t prefix_size = proposed_prefix . size ( ) ;
return prefix_size < = value . size ( ) & & wcsncasecmp ( proposed_prefix . c_str ( ) , value . c_str ( ) , prefix_size ) = = 0 ;
}
2012-05-14 03:49:14 +00:00
bool string_suffixes_string ( const wcstring & proposed_suffix , const wcstring & value ) {
size_t suffix_size = proposed_suffix . size ( ) ;
return suffix_size < = value . size ( ) & & value . compare ( value . size ( ) - suffix_size , suffix_size , proposed_suffix ) = = 0 ;
}
bool string_suffixes_string ( const wchar_t * proposed_suffix , const wcstring & value ) {
size_t suffix_size = wcslen ( proposed_suffix ) ;
return suffix_size < = value . size ( ) & & value . compare ( value . size ( ) - suffix_size , suffix_size , proposed_suffix ) = = 0 ;
}
2012-02-27 04:11:34 +00:00
bool list_contains_string ( const wcstring_list_t & list , const wcstring & str )
{
return std : : find ( list . begin ( ) , list . end ( ) , str ) ! = list . end ( ) ;
}
2012-02-18 17:11:22 +00:00
int create_directory ( const wcstring & d )
2006-10-19 11:50:23 +00:00
{
int ok = 0 ;
struct stat buf ;
int stat_res = 0 ;
2011-12-27 03:18:46 +00:00
2006-10-19 11:50:23 +00:00
while ( ( stat_res = wstat ( d , & buf ) ) ! = 0 )
{
if ( errno ! = EAGAIN )
break ;
}
2011-12-27 03:18:46 +00:00
2006-10-19 11:50:23 +00:00
if ( stat_res = = 0 )
{
if ( S_ISDIR ( buf . st_mode ) )
{
ok = 1 ;
}
}
else
{
if ( errno = = ENOENT )
{
2011-12-27 03:18:46 +00:00
wcstring dir = wdirname ( d ) ;
2012-02-18 17:11:22 +00:00
if ( ! create_directory ( dir ) )
2006-10-19 11:50:23 +00:00
{
if ( ! wmkdir ( d , 0700 ) )
{
ok = 1 ;
}
}
}
}
2011-12-27 03:18:46 +00:00
2006-10-19 11:50:23 +00:00
return ok ? 0 : - 1 ;
}
2012-02-19 02:54:36 +00:00
__attribute__ ( ( noinline ) )
2006-11-17 14:58:25 +00:00
void bugreport ( )
{
debug ( 1 ,
2012-02-19 02:54:36 +00:00
_ ( L " This is a bug. Break on bugreport to debug. "
2007-09-23 21:07:30 +00:00
L " If you can reproduce it, please send a bug report to %s. " ) ,
2006-11-17 14:58:25 +00:00
PACKAGE_BUGREPORT ) ;
}
2012-02-09 18:14:06 +00:00
wcstring format_size ( long long sz )
{
wcstring result ;
2012-02-29 19:27:14 +00:00
const wchar_t * sz_name [ ] = {
2012-02-09 18:14:06 +00:00
L " kB " , L " MB " , L " GB " , L " TB " , L " PB " , L " EB " , L " ZB " , L " YB " , 0
2012-02-29 19:27:14 +00:00
} ;
2012-02-09 18:14:06 +00:00
if ( sz < 0 )
{
result . append ( L " unknown " ) ;
}
else if ( sz < 1 )
{
result . append ( _ ( L " empty " ) ) ;
}
else if ( sz < 1024 )
{
result . append ( format_string ( L " %lldB " , sz ) ) ;
}
else
{
int i ;
for ( i = 0 ; sz_name [ i ] ; i + + )
{
if ( sz < ( 1024 * 1024 ) | | ! sz_name [ i + 1 ] )
{
int isz = sz / 1024 ;
if ( isz > 9 )
result . append ( format_string ( L " %d%ls " , isz , sz_name [ i ] ) ) ;
else
result . append ( format_string ( L " %.1f%ls " , ( double ) sz / 1024 , sz_name [ i ] ) ) ;
break ;
}
sz / = 1024 ;
}
}
return result ;
2007-10-15 09:51:08 +00:00
}
2009-02-02 22:46:45 +00:00
2012-02-29 19:27:14 +00:00
/* Crappy function to extract the most significant digit of an unsigned long long value */
static char extract_most_significant_digit ( unsigned long long * xp ) {
unsigned long long place_value = 1 ;
unsigned long long x = * xp ;
while ( x > = 10 ) {
x / = 10 ;
place_value * = 10 ;
}
* xp - = ( place_value * x ) ;
return x + ' 0 ' ;
}
void append_ull ( char * buff , unsigned long long val , size_t * inout_idx , size_t max_len ) {
size_t idx = * inout_idx ;
while ( val > 0 & & idx < max_len )
buff [ idx + + ] = extract_most_significant_digit ( & val ) ;
* inout_idx = idx ;
}
void append_str ( char * buff , const char * str , size_t * inout_idx , size_t max_len ) {
size_t idx = * inout_idx ;
while ( * str & & idx < max_len )
buff [ idx + + ] = * str + + ;
* inout_idx = idx ;
}
void format_size_safe ( char buff [ 128 ] , unsigned long long sz ) {
const size_t buff_size = 128 ;
const size_t max_len = buff_size - 1 ; //need to leave room for a null terminator
bzero ( buff , buff_size ) ;
size_t idx = 0 ;
const char * const sz_name [ ] = {
" kB " , " MB " , " GB " , " TB " , " PB " , " EB " , " ZB " , " YB " , NULL
} ;
if ( sz < 1 )
{
strncpy ( buff , " empty " , buff_size ) ;
}
else if ( sz < 1024 )
{
append_ull ( buff , sz , & idx , max_len ) ;
append_str ( buff , " B " , & idx , max_len ) ;
}
else
{
for ( size_t i = 0 ; sz_name [ i ] ; i + + )
{
if ( sz < ( 1024 * 1024 ) | | ! sz_name [ i + 1 ] )
{
unsigned long long isz = sz / 1024 ;
if ( isz > 9 )
{
append_ull ( buff , isz , & idx , max_len ) ;
}
else
{
if ( isz = = 0 )
{
append_str ( buff , " 0 " , & idx , max_len ) ;
}
else
{
append_ull ( buff , isz , & idx , max_len ) ;
}
// Maybe append a single fraction digit
unsigned long long remainder = sz % 1024 ;
if ( remainder > 0 )
{
char tmp [ 3 ] = { ' . ' , extract_most_significant_digit ( & remainder ) , 0 } ;
append_str ( buff , tmp , & idx , max_len ) ;
}
}
append_str ( buff , sz_name [ i ] , & idx , max_len ) ;
break ;
}
sz / = 1024 ;
}
}
}
2009-02-02 22:46:45 +00:00
double timef ( )
{
int time_res ;
struct timeval tv ;
2011-12-27 03:18:46 +00:00
2009-02-02 22:46:45 +00:00
time_res = gettimeofday ( & tv , 0 ) ;
2011-12-27 03:18:46 +00:00
if ( time_res )
2009-02-02 22:46:45 +00:00
{
2009-02-22 20:28:52 +00:00
/*
Fixme : What on earth is the correct parameter value for NaN ?
The man pages and the standard helpfully state that this
parameter is implementation defined . Gcc gives a warning if
a null pointer is used . But not even all mighty Google gives
a hint to what value should actually be returned .
*/
return nan ( " " ) ;
2009-02-02 22:46:45 +00:00
}
2011-12-27 03:18:46 +00:00
2009-02-02 22:46:45 +00:00
return ( double ) tv . tv_sec + 0.000001 * tv . tv_usec ;
}
2011-12-27 03:18:46 +00:00
2012-02-28 23:11:46 +00:00
void exit_without_destructors ( int code ) {
_exit ( code ) ;
}
2012-02-29 19:27:14 +00:00
/* Helper function to convert from a null_terminated_array_t<wchar_t> to a null_terminated_array_t<char_t> */
null_terminated_array_t < char > convert_wide_array_to_narrow ( const null_terminated_array_t < wchar_t > & wide_arr ) {
const wchar_t * const * arr = wide_arr . get ( ) ;
if ( ! arr )
return null_terminated_array_t < char > ( ) ;
std : : vector < std : : string > list ;
for ( size_t i = 0 ; arr [ i ] ; i + + ) {
list . push_back ( wcs2string ( arr [ i ] ) ) ;
}
return null_terminated_array_t < char > ( list ) ;
}
2011-12-27 03:18:46 +00:00
void append_path_component ( wcstring & path , const wcstring & component )
{
2012-05-09 09:33:42 +00:00
if ( path . empty ( ) | | component . empty ( ) ) {
path . append ( component ) ;
} else {
size_t path_len = path . size ( ) ;
bool path_slash = path . at ( path_len - 1 ) = = L ' / ' ;
bool comp_slash = component . at ( 0 ) = = L ' / ' ;
if ( ! path_slash & & ! comp_slash ) {
// Need a slash
path . push_back ( L ' / ' ) ;
} else if ( path_slash & & comp_slash ) {
// Too many slashes
path . erase ( path_len - 1 , 1 ) ;
}
2011-12-27 03:18:46 +00:00
path . append ( component ) ;
}
}
extern " C " {
2012-04-22 03:08:08 +00:00
__attribute__ ( ( noinline ) ) void debug_thread_error ( void ) { while ( 1 ) sleep ( 9999999 ) ; }
2011-12-27 03:18:46 +00:00
}
2012-01-05 21:58:48 +00:00
void set_main_thread ( ) {
main_thread_id = pthread_self ( ) ;
}
2012-05-14 03:19:02 +00:00
void configure_thread_assertions_for_testing ( void ) {
thread_assertions_configured_for_testing = true ;
}
2012-02-28 02:43:24 +00:00
/* Notice when we've forked */
2012-03-06 22:34:18 +00:00
static pid_t initial_pid ;
2012-03-06 23:12:37 +00:00
2012-02-28 02:43:24 +00:00
bool is_forked_child ( void ) {
2012-03-06 22:34:18 +00:00
bool is_child_of_fork = ( getpid ( ) ! = initial_pid ) ;
2012-02-29 19:27:14 +00:00
if ( is_child_of_fork ) {
printf ( " Uh-oh: %d \n " , getpid ( ) ) ;
while ( 1 ) sleep ( 10000 ) ;
}
2012-02-28 02:43:24 +00:00
return is_child_of_fork ;
}
void setup_fork_guards ( void ) {
2012-03-06 22:34:18 +00:00
/* Notice when we fork by stashing our pid. This seems simpler than pthread_atfork(). */
initial_pid = getpid ( ) ;
2012-02-28 02:43:24 +00:00
}
2012-03-19 18:52:18 +00:00
bool is_main_thread ( ) {
2012-01-05 21:58:48 +00:00
assert ( main_thread_id ! = 0 ) ;
return main_thread_id = = pthread_self ( ) ;
}
2011-12-27 03:18:46 +00:00
void assert_is_main_thread ( const char * who )
{
2012-05-14 03:19:02 +00:00
if ( ! is_main_thread ( ) & & ! thread_assertions_configured_for_testing ) {
2011-12-27 03:18:46 +00:00
fprintf ( stderr , " Warning: %s called off of main thread. Break on debug_thread_error to debug. \n " , who ) ;
debug_thread_error ( ) ;
2012-02-28 02:43:24 +00:00
}
}
void assert_is_not_forked_child ( const char * who )
{
if ( is_forked_child ( ) ) {
fprintf ( stderr , " Warning: %s called in a forked child. Break on debug_thread_error to debug. \n " , who ) ;
debug_thread_error ( ) ;
2011-12-27 03:18:46 +00:00
}
}
void assert_is_background_thread ( const char * who )
{
2012-05-14 03:19:02 +00:00
if ( is_main_thread ( ) & & ! thread_assertions_configured_for_testing ) {
2011-12-27 03:18:46 +00:00
fprintf ( stderr , " Warning: %s called on the main thread (may block!). Break on debug_thread_error to debug. \n " , who ) ;
debug_thread_error ( ) ;
2012-02-24 20:13:35 +00:00
}
}
2012-04-22 03:08:08 +00:00
void assert_is_locked ( void * vmutex , const char * who , const char * caller )
2012-02-24 20:13:35 +00:00
{
pthread_mutex_t * mutex = static_cast < pthread_mutex_t * > ( vmutex ) ;
if ( 0 = = pthread_mutex_trylock ( mutex ) ) {
2012-04-22 03:08:08 +00:00
fprintf ( stderr , " Warning: %s is not locked when it should be in '%s'. Break on debug_thread_error to debug. \n " , who , caller ) ;
2012-02-24 20:13:35 +00:00
debug_thread_error ( ) ;
pthread_mutex_unlock ( mutex ) ;
}
2011-12-27 03:18:46 +00:00
}
2012-02-28 02:43:24 +00:00
void scoped_lock : : lock ( void ) {
assert ( ! locked ) ;
assert ( ! is_forked_child ( ) ) ;
VOMIT_ON_FAILURE ( pthread_mutex_lock ( lock_obj ) ) ;
locked = true ;
}
void scoped_lock : : unlock ( void ) {
assert ( locked ) ;
assert ( ! is_forked_child ( ) ) ;
VOMIT_ON_FAILURE ( pthread_mutex_unlock ( lock_obj ) ) ;
locked = false ;
}
scoped_lock : : scoped_lock ( pthread_mutex_t & mutex ) : lock_obj ( & mutex ) , locked ( false ) {
this - > lock ( ) ;
}
scoped_lock : : ~ scoped_lock ( ) {
if ( locked ) this - > unlock ( ) ;
}