libvips/libvips/iofuncs/util.c

1932 lines
38 KiB
C
Raw Normal View History

2009-08-16 17:00:08 +02:00
/* Some basic util functions.
*/
/*
Copyright (C) 1991-2003 The National Gallery
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
2009-08-16 17:00:08 +02:00
This library is distributed in the hope that it will be useful,
2009-08-16 17:00:08 +02:00
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
2009-08-16 17:00:08 +02:00
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
2009-08-16 17:00:08 +02:00
*/
/*
These files are distributed with VIPS - http://www.vips.ecs.soton.ac.uk
*/
/*
2010-01-08 17:58:44 +01:00
#define DEBUG
2010-01-15 15:22:11 +01:00
*/
2009-08-16 17:00:08 +02:00
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif /*HAVE_CONFIG_H*/
#include <vips/intl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif /*HAVE_UNISTD_H*/
#include <fcntl.h>
#ifdef OS_WIN32
#include <windows.h>
#endif /*OS_WIN32*/
#include <vips/vips.h>
#include <vips/debug.h>
2016-08-17 15:37:15 +02:00
#include <vips/internal.h>
/* Temp buffer for snprintf() layer on old systems.
*/
#define MAX_BUF (100000)
2009-08-16 17:00:08 +02:00
/* Try to make an O_BINARY ... sometimes need the leading '_'.
*/
#ifdef BINARY_OPEN
#ifndef O_BINARY
#ifdef _O_BINARY
#define O_BINARY _O_BINARY
#endif /*_O_BINARY*/
#endif /*!O_BINARY*/
#endif /*BINARY_OPEN*/
/* If we have O_BINARY, add it to a mode flags set.
*/
#ifdef O_BINARY
#define BINARYIZE(M) ((M) | O_BINARY)
#else /*!O_BINARY*/
#define BINARYIZE(M) (M)
#endif /*O_BINARY*/
/* Open mode for image write ... on some systems, have to set BINARY too.
*/
#define MODE_WRITE BINARYIZE (O_WRONLY | O_CREAT | O_TRUNC)
/* Mode for read/write. This is if we might later want to mmaprw () the file.
*/
#define MODE_READWRITE BINARYIZE (O_RDWR)
/* Mode for read only. This is the fallback if READWRITE fails.
*/
#define MODE_READONLY BINARYIZE (O_RDONLY)
2009-08-16 17:00:08 +02:00
/* Test two lists for eqality.
*/
gboolean
vips_slist_equal( GSList *l1, GSList *l2 )
2009-08-16 17:00:08 +02:00
{
while( l1 && l2 ) {
if( l1->data != l2->data )
return( FALSE );
l1 = l1->next;
l2 = l2->next;
}
if( l1 || l2 )
return( FALSE );
return( TRUE );
}
/* Map over an slist. _copy() the list in case the callback changes it.
*/
void *
vips_slist_map2( GSList *list, VipsSListMap2Fn fn, void *a, void *b )
2009-08-16 17:00:08 +02:00
{
GSList *copy;
GSList *i;
void *result;
copy = g_slist_copy( list );
result = NULL;
for( i = copy; i && !(result = fn( i->data, a, b )); i = i->next )
;
g_slist_free( copy );
return( result );
}
/* Map backwards. We _reverse() rather than recurse and unwind to save stack.
*/
2009-08-16 17:00:08 +02:00
void *
vips_slist_map2_rev( GSList *list, VipsSListMap2Fn fn, void *a, void *b )
2009-08-16 17:00:08 +02:00
{
GSList *copy;
GSList *i;
void *result;
copy = g_slist_copy( list );
copy = g_slist_reverse( copy );
2009-08-16 17:00:08 +02:00
result = NULL;
for( i = copy; i && !(result = fn( i->data, a, b )); i = i->next )
2009-08-16 17:00:08 +02:00
;
g_slist_free( copy );
return( result );
}
void *
vips_slist_map4( GSList *list,
VipsSListMap4Fn fn, void *a, void *b, void *c, void *d )
2009-08-16 17:00:08 +02:00
{
GSList *copy;
GSList *i;
void *result;
copy = g_slist_copy( list );
result = NULL;
for( i = copy;
i && !(result = fn( i->data, a, b, c, d )); i = i->next )
2009-08-16 17:00:08 +02:00
;
g_slist_free( copy );
return( result );
}
void *
vips_slist_fold2( GSList *list, void *start,
VipsSListFold2Fn fn, void *a, void *b )
2009-08-16 17:00:08 +02:00
{
void *c;
GSList *this, *next;
for( c = start, this = list; this; this = next ) {
next = this->next;
if( !(c = fn( this->data, c, a, b )) )
return( NULL );
}
return( c );
}
/* Remove all occurences of an item from a list.
*/
GSList *
vips_slist_filter( GSList *list, VipsSListMap2Fn fn, void *a, void *b )
2009-08-16 17:00:08 +02:00
{
GSList *tmp;
GSList *prev;
prev = NULL;
tmp = list;
while( tmp ) {
if( fn( tmp->data, a, b ) ) {
GSList *next = tmp->next;
if( prev )
prev->next = next;
if( list == tmp )
list = next;
tmp->next = NULL;
g_slist_free( tmp );
tmp = next;
}
else {
prev = tmp;
tmp = tmp->next;
}
}
return( list );
}
static void
vips_slist_free_all_cb( void * thing, void * dummy )
{
vips_free( thing );
}
/* Free a g_slist of things which need vips_free()ing.
*/
void
vips_slist_free_all( GSList *list )
{
g_slist_foreach( list, vips_slist_free_all_cb, NULL );
g_slist_free( list );
}
void *
vips_map_equal( void *a, void *b )
{
if( a == b )
return( a );
return( NULL );
}
2009-08-16 17:00:08 +02:00
typedef struct {
void *a;
void *b;
VipsSListMap2Fn fn;
2009-08-16 17:00:08 +02:00
void *result;
} Pair;
static gboolean
vips_hash_table_predicate( const char *key, void *value, Pair *pair )
2009-08-16 17:00:08 +02:00
{
2012-06-20 23:10:10 +02:00
return( (pair->result = pair->fn( value, pair->a, pair->b )) != NULL );
2009-08-16 17:00:08 +02:00
}
/* Like slist map, but for a hash table.
*/
void *
vips_hash_table_map( GHashTable *hash, VipsSListMap2Fn fn, void *a, void *b )
2009-08-16 17:00:08 +02:00
{
Pair pair;
pair.a = a;
pair.b = b;
pair.fn = fn;
pair.result = NULL;
g_hash_table_find( hash, (GHRFunc) vips_hash_table_predicate, &pair );
2009-08-16 17:00:08 +02:00
return( pair.result );
}
/* Like strncpy(), but always NULL-terminate, and don't pad with NULLs.
* If @n is 100 and @src is more than 99 characters, 99 are copied and the
* final byte of @dest is set to '\0'.
2009-08-16 17:00:08 +02:00
*/
char *
vips_strncpy( char *dest, const char *src, int n )
2009-08-16 17:00:08 +02:00
{
int i;
g_assert( n > 0 );
2009-08-16 17:00:08 +02:00
for( i = 0; i < n - 1; i++ )
if( !(dest[i] = src[i]) )
break;
dest[i] = '\0';
return( dest );
}
/* Find the rightmost occurrence of needle in haystack.
*/
char *
vips_strrstr( const char *haystack, const char *needle )
2009-08-16 17:00:08 +02:00
{
int haystack_len = strlen( haystack );
int needle_len = strlen( needle );
int i;
for( i = haystack_len - needle_len; i >= 0; i-- )
if( strncmp( needle, haystack + i, needle_len ) == 0 )
return( (char *) haystack + i );
return( NULL );
}
/* Test for string b ends string a.
*/
gboolean
vips_ispostfix( const char *a, const char *b )
2009-08-16 17:00:08 +02:00
{
int m = strlen( a );
int n = strlen( b );
if( n > m )
return( FALSE );
return( strcmp( a + m - n, b ) == 0 );
}
2016-08-01 15:57:33 +02:00
/* Case-insensitive test for string b ends string a. ASCII strings only.
*/
gboolean
vips_iscasepostfix( const char *a, const char *b )
{
int m = strlen( a );
int n = strlen( b );
if( n > m )
return( FALSE );
return( strcasecmp( a + m - n, b ) == 0 );
}
2016-02-16 10:56:14 +01:00
/* Test for string a starts string b. a is a known-good string, b may be
* random data.
2009-08-16 17:00:08 +02:00
*/
gboolean
vips_isprefix( const char *a, const char *b )
2009-08-16 17:00:08 +02:00
{
int i;
2016-02-16 10:56:14 +01:00
for( i = 0; a[i] && b[i]; i++ )
2009-08-16 17:00:08 +02:00
if( a[i] != b[i] )
return( FALSE );
2016-02-16 10:56:14 +01:00
/* If there's stuff left in a but b has finished, we must have a
* mismatch.
*/
if( a[i] && !b[i] )
return( FALSE );
2009-08-16 17:00:08 +02:00
return( TRUE );
}
/* Like strtok(). Give a string and a list of break characters. Then:
* - skip initial break characters
* - EOS? return NULL
* - skip a series of non-break characters
* - write a '\0' over the next break character and return a pointer to the
* char after that
*
* The idea is that this can be used in loops as the iterator. Example:
*
* char *p = " 1 2 3 "; // mutable
* char *q;
* int i;
* int v[...];
*
* for( i = 0; (q = vips_break_token( p, " " )); i++, p = q )
2009-08-16 17:00:08 +02:00
* v[i] = atoi( p );
*
* will set
* v[0] = 1;
* v[1] = 2;
* v[2] = 3;
*
* or with just one pointer, provided your atoi() is OK with trailing chars
* and you know there is at least one item there
*
* char *p = " 1 2 3 "; // mutable
* int i;
* int v[...];
*
* for( i = 0; p; p = vips_break_token( p, " " ) )
2009-08-16 17:00:08 +02:00
* v[i] = atoi( p );
*/
char *
vips_break_token( char *str, const char *brk )
2009-08-16 17:00:08 +02:00
{
char *p;
/* Is the string empty? If yes, return NULL immediately.
*/
if( !str || !*str )
return( NULL );
/* Skip initial break characters.
*/
p = str + strspn( str, brk );
/* No item?
*/
if( !*p )
return( NULL );
/* We have a token ... search for the first break character after the
* token.
*/
p += strcspn( p, brk );
/* Is there string left?
*/
if( *p ) {
/* Write in an end-of-string mark and return the start of the
* next token.
*/
*p++ = '\0';
p += strspn( p, brk );
}
return( p );
}
/* Wrapper over (v)snprintf() ... missing on old systems.
*/
int
vips_vsnprintf( char *str, size_t size, const char *format, va_list ap )
2009-08-16 17:00:08 +02:00
{
#ifdef HAVE_VSNPRINTF
return( vsnprintf( str, size, format, ap ) );
#else /*HAVE_VSNPRINTF*/
/* Bleurg!
*/
int n;
static char buf[MAX_BUF];
/* We can't return an error code, we may already have trashed the
* stack. We must stop immediately.
*/
2009-08-16 17:00:08 +02:00
if( size > MAX_BUF )
vips_error_exit( "panic: buffer overflow "
2009-08-16 17:00:08 +02:00
"(request to write %d bytes to buffer of %d bytes)",
size, MAX_BUF );
n = vsprintf( buf, format, ap );
if( n > MAX_BUF )
vips_error_exit( "panic: buffer overflow "
2009-08-16 17:00:08 +02:00
"(%d bytes written to buffer of %d bytes)",
n, MAX_BUF );
vips_strncpy( str, buf, size );
2009-08-16 17:00:08 +02:00
return( n );
#endif /*HAVE_VSNPRINTF*/
}
int
vips_snprintf( char *str, size_t size, const char *format, ... )
2009-08-16 17:00:08 +02:00
{
va_list ap;
int n;
va_start( ap, format );
n = vips_vsnprintf( str, size, format, ap );
2009-08-16 17:00:08 +02:00
va_end( ap );
return( n );
}
2014-05-06 23:01:20 +02:00
/* Does a filename have one of a set of suffixes. Ignore case and any trailing
* options.
2009-08-16 17:00:08 +02:00
*/
2014-05-06 23:01:20 +02:00
int
vips_filename_suffix_match( const char *path, const char *suffixes[] )
2009-08-16 17:00:08 +02:00
{
2014-05-06 23:01:20 +02:00
char *basename;
char *q;
int result;
2016-08-01 15:57:33 +02:00
const char **p;
2009-08-16 17:00:08 +02:00
2016-08-01 15:57:33 +02:00
/* Drop any directory components.
2009-08-16 17:00:08 +02:00
*/
2014-05-06 23:01:20 +02:00
basename = g_path_get_basename( path );
2009-08-16 17:00:08 +02:00
2016-08-01 15:57:33 +02:00
/* Zap any trailing [] options.
2009-08-16 17:00:08 +02:00
*/
2014-05-06 23:01:20 +02:00
if( (q = (char *) vips__find_rightmost_brackets( basename )) )
*q = '\0';
2009-08-16 17:00:08 +02:00
2014-05-06 23:01:20 +02:00
result = 0;
2016-08-01 15:57:33 +02:00
for( p = suffixes; *p; p++ )
if( vips_iscasepostfix( basename, *p ) ) {
2014-05-06 23:01:20 +02:00
result = 1;
break;
2014-05-06 23:01:20 +02:00
}
2014-05-06 23:01:20 +02:00
g_free( basename );
2009-08-16 17:00:08 +02:00
2014-05-06 23:01:20 +02:00
return( result );
2009-08-16 17:00:08 +02:00
}
/* Get file length ... 64-bitally. -1 for error.
*/
gint64
vips_file_length( int fd )
2009-08-16 17:00:08 +02:00
{
#ifdef OS_WIN32
struct _stati64 st;
if( _fstati64( fd, &st ) == -1 ) {
#else /*!OS_WIN32*/
struct stat st;
if( fstat( fd, &st ) == -1 ) {
#endif /*OS_WIN32*/
vips_error_system( errno, "vips_file_length",
2009-08-16 17:00:08 +02:00
"%s", _( "unable to get file stats" ) );
return( -1 );
}
return( st.st_size );
}
/* Wrap write() up
*/
int
vips__write( int fd, const void *buf, size_t count )
2009-08-16 17:00:08 +02:00
{
do {
size_t nwritten = write( fd, buf, count );
if( nwritten == (size_t) -1 ) {
vips_error_system( errno, "vips__write",
2009-08-16 17:00:08 +02:00
"%s", _( "write failed" ) );
return( -1 );
}
buf = (void *) ((char *) buf + nwritten);
count -= nwritten;
} while( count > 0 );
return( 0 );
}
2016-08-17 15:37:15 +02:00
/* open() with a utf8 filename, setting errno.
2010-03-09 12:50:49 +01:00
*/
2016-08-16 19:33:48 +02:00
int
vips__open( const char *filename, int flags, ... )
2010-03-09 12:50:49 +01:00
{
2016-08-16 19:33:48 +02:00
int fd;
mode_t mode;
va_list ap;
2010-03-09 12:50:49 +01:00
2016-08-16 19:33:48 +02:00
va_start( ap, flags );
mode = va_arg( ap, int );
va_end( ap );
2010-03-09 12:50:49 +01:00
2016-08-16 19:33:48 +02:00
#ifdef OS_WIN32
{
2016-08-16 19:33:48 +02:00
wchar_t *path16;
if( !(path16 = (wchar_t *)
2016-08-17 15:37:15 +02:00
g_utf8_to_utf16( filename, -1, NULL, NULL, NULL )) ) {
errno = EACCES;
2016-08-16 19:33:48 +02:00
return( -1 );
}
fd = _wopen( path16, flags, mode );
g_free( path16 );
}
2016-08-16 19:33:48 +02:00
#else /*!OS_WIN32*/
fd = open( filename, flags, mode );
#endif
return( fd );
2010-03-09 12:50:49 +01:00
}
2016-08-17 15:37:15 +02:00
int
vips__open_read( const char *filename )
{
return( vips__open( filename, MODE_READONLY ) );
}
/* fopen() with utf8 filename and mode, setting errno.
2016-08-16 17:22:38 +02:00
*/
2016-08-16 19:33:48 +02:00
FILE *
2016-08-16 17:22:38 +02:00
vips__fopen( const char *filename, const char *mode )
{
FILE *fp;
#ifdef OS_WIN32
wchar_t *path16, *mode16;
if( !(path16 = (wchar_t *)
2016-08-17 15:37:15 +02:00
g_utf8_to_utf16( filename, -1, NULL, NULL, NULL )) ) {
errno = EACCES;
2016-08-16 17:22:38 +02:00
return( NULL );
}
if( !(mode16 = (wchar_t *)
2016-08-17 15:37:15 +02:00
g_utf8_to_utf16( mode, -1, NULL, NULL, NULL )) ) {
2016-08-16 17:22:38 +02:00
g_free( path16 );
2016-08-17 15:37:15 +02:00
errno = EACCES;
2016-08-16 17:22:38 +02:00
return( NULL );
}
fp = _wfopen( path16, mode16 );
g_free( path16 );
g_free( mode16 );
#else /*!OS_WIN32*/
fp = fopen( filename, mode );
#endif
return( fp );
}
2016-08-16 19:33:48 +02:00
/* Does a filename contain a directory separator?
*/
static gboolean
filename_hasdir( const char *filename )
{
char *dirname;
gboolean hasdir;
dirname = g_path_get_dirname( filename );
hasdir = (strcmp( dirname, "." ) != 0);
g_free( dirname );
return( hasdir );
}
2010-03-09 12:50:49 +01:00
/* Open a file. We take an optional fallback dir as well and will try opening
* there if opening directly fails.
*
* This is used for things like finding ICC profiles. We try to open the file
* directly first, and if that fails and the filename does not contain a
* directory separator, we try looking in the fallback dir.
*/
2009-08-16 17:00:08 +02:00
FILE *
vips__file_open_read( const char *filename, const char *fallback_dir,
gboolean text_mode )
2009-08-16 17:00:08 +02:00
{
char *mode;
2009-08-16 17:00:08 +02:00
FILE *fp;
#ifdef BINARY_OPEN
if( text_mode )
mode = "r";
else
mode = "rb";
#else /*BINARY_OPEN*/
mode = "r";
2009-08-16 17:00:08 +02:00
#endif /*BINARY_OPEN*/
2016-08-16 17:22:38 +02:00
if( (fp = vips__fopen( filename, mode )) )
2010-03-09 12:50:49 +01:00
return( fp );
if( fallback_dir &&
!filename_hasdir( filename ) ) {
2010-03-09 12:50:49 +01:00
char *path;
path = g_build_filename( fallback_dir, filename, NULL );
2016-08-16 17:22:38 +02:00
fp = vips__fopen( path, mode );
2010-03-09 12:50:49 +01:00
g_free( path );
if( fp )
return( fp );
2009-08-16 17:00:08 +02:00
}
vips_error_system( errno, "vips__file_open_read",
2010-03-09 12:50:49 +01:00
_( "unable to open file \"%s\" for reading" ), filename );
return( NULL );
2009-08-16 17:00:08 +02:00
}
FILE *
vips__file_open_write( const char *filename, gboolean text_mode )
2009-08-16 17:00:08 +02:00
{
char *mode;
2009-08-16 17:00:08 +02:00
FILE *fp;
#ifdef BINARY_OPEN
if( text_mode )
mode = "w";
else
mode = "wb";
2009-08-16 17:00:08 +02:00
#else /*BINARY_OPEN*/
mode = "w";
2009-08-16 17:00:08 +02:00
#endif /*BINARY_OPEN*/
2016-08-16 17:22:38 +02:00
if( !(fp = vips__fopen( filename, mode )) ) {
vips_error_system( errno, "vips__file_open_write",
2009-08-16 17:00:08 +02:00
_( "unable to open file \"%s\" for writing" ),
filename );
return( NULL );
}
return( fp );
}
/* Load up a file as a string.
*/
char *
vips__file_read( FILE *fp, const char *filename, size_t *length_out )
{
2014-04-22 14:19:21 +02:00
gint64 len;
size_t read;
char *str;
2014-04-22 14:19:21 +02:00
len = vips_file_length( fileno( fp ) );
if( len > 1024 * 1024 * 1024 ) {
/* Over a gb? Seems crazy!
*/
vips_error( "vips__file_read",
_( "\"%s\" too long" ), filename );
return( NULL );
}
if( len == -1 ) {
int size;
/* Can't get length: read in chunks and realloc() to end of
* file.
*/
str = NULL;
len = 0;
size = 0;
do {
2013-05-01 19:46:15 +02:00
char *str2;
size += 1024;
2013-05-01 19:46:15 +02:00
if( !(str2 = realloc( str, size )) ) {
free( str );
vips_error( "vips__file_read",
"%s", _( "out of memory" ) );
return( NULL );
}
2013-05-01 19:46:15 +02:00
str = str2;
/* -1 to allow space for an extra NULL we add later.
*/
read = fread( str + len, sizeof( char ),
(size - len - 1) / sizeof( char ),
fp );
len += read;
} while( !feof( fp ) );
#ifdef DEBUG
printf( "read %ld bytes from unseekable stream\n", len );
#endif /*DEBUG*/
}
else {
/* Allocate memory and fill.
*/
if( !(str = vips_malloc( NULL, len + 1 )) )
return( NULL );
rewind( fp );
read = fread( str, sizeof( char ), (size_t) len, fp );
if( read != (size_t) len ) {
vips_free( str );
vips_error( "vips__file_read",
_( "error reading from file \"%s\"" ),
filename );
return( NULL );
}
}
str[len] = '\0';
if( length_out )
*length_out = len;
return( str );
}
2010-03-09 12:50:49 +01:00
/* Load from a filename as a string. Used for things like reading in ICC
* profiles, ie. binary objects.
2009-08-16 17:00:08 +02:00
*/
char *
vips__file_read_name( const char *filename, const char *fallback_dir,
size_t *length_out )
2009-08-16 17:00:08 +02:00
{
FILE *fp;
char *buffer;
if( !(fp = vips__file_open_read( filename, fallback_dir, FALSE )) )
2009-08-16 17:00:08 +02:00
return( NULL );
if( !(buffer = vips__file_read( fp, filename, length_out )) ) {
2009-08-16 17:00:08 +02:00
fclose( fp );
return( NULL );
}
fclose( fp );
return( buffer );
}
/* Like fwrite(), but returns non-zero on error and sets error message.
*/
int
vips__file_write( void *data, size_t size, size_t nmemb, FILE *stream )
{
size_t n;
if( !data )
return( 0 );
if( (n = fwrite( data, size, nmemb, stream )) != nmemb ) {
vips_error_system( errno, "vips__file_write",
_( "write error (%zd out of %zd blocks written)" ),
n, nmemb );
return( -1 );
}
return( 0 );
}
/* Read a few bytes from the start of a file. For sniffing file types.
* Filename may contain a mode.
*/
int
vips__get_bytes( const char *filename, unsigned char buf[], int len )
{
char name[FILENAME_MAX];
char mode[FILENAME_MAX];
int fd;
/* Split off the mode part.
*/
im_filename_split( filename, name, mode );
/* File may not even exist (for tmp images for example!)
* so no hasty messages. And the file might be truncated, so no error
* on read either.
*/
2016-08-17 15:37:15 +02:00
if( (fd = vips__open_read( name )) == -1 )
return( 0 );
if( read( fd, buf, len ) != len ) {
close( fd );
return( 0 );
}
close( fd );
return( 1 );
}
/* We try to support stupid DOS files too. These have \r\n (13, 10) as line
* separators. Strategy: an fgetc() that swaps \r\n for \n.
*
* On Windows, stdio will automatically swap \r\n for \n, but on Linux we have
* to do this by hand.
*/
int
vips__fgetc( FILE *fp )
{
int ch;
ch = fgetc( fp );
if( ch == '\r' ) {
ch = fgetc( fp );
if( ch != '\n' ) {
ungetc( ch, fp );
ch = '\r';
}
}
return( ch );
}
2009-08-16 17:00:08 +02:00
/* Alloc/free a GValue.
*/
static GValue *
vips__gvalue_new( GType type )
2009-08-16 17:00:08 +02:00
{
GValue *value;
value = g_new0( GValue, 1 );
g_value_init( value, type );
return( value );
}
static GValue *
vips__gvalue_copy( GValue *value )
2009-08-16 17:00:08 +02:00
{
GValue *value_copy;
value_copy = vips__gvalue_new( G_VALUE_TYPE( value ) );
2009-08-16 17:00:08 +02:00
g_value_copy( value, value_copy );
return( value_copy );
}
static void
vips__gvalue_free( GValue *value )
2009-08-16 17:00:08 +02:00
{
g_value_unset( value );
g_free( value );
}
GValue *
vips__gvalue_ref_string_new( const char *text )
2009-08-16 17:00:08 +02:00
{
GValue *value;
value = vips__gvalue_new( VIPS_TYPE_REF_STRING );
vips_value_set_ref_string( value, text );
2009-08-16 17:00:08 +02:00
return( value );
}
/* Free a GSList of GValue.
*/
void
vips__gslist_gvalue_free( GSList *list )
2009-08-16 17:00:08 +02:00
{
g_slist_foreach( list, (GFunc) vips__gvalue_free, NULL );
2009-08-16 17:00:08 +02:00
g_slist_free( list );
}
/* Copy a GSList of GValue.
*/
GSList *
vips__gslist_gvalue_copy( const GSList *list )
2009-08-16 17:00:08 +02:00
{
GSList *copy;
const GSList *p;
copy = NULL;
for( p = list; p; p = p->next )
copy = g_slist_prepend( copy,
vips__gvalue_copy( (GValue *) p->data ) );
2009-08-16 17:00:08 +02:00
copy = g_slist_reverse( copy );
return( copy );
}
/* Merge two GSList of GValue ... append to a all elements in b which are not
* in a. Return the new value of a. Works for any vips refcounted type
* (string, blob, etc.).
*/
GSList *
vips__gslist_gvalue_merge( GSList *a, const GSList *b )
2009-08-16 17:00:08 +02:00
{
const GSList *i, *j;
GSList *tail;
tail = NULL;
for( i = b; i; i = i->next ) {
GValue *value = (GValue *) i->data;
g_assert( G_VALUE_TYPE( value ) == VIPS_TYPE_REF_STRING );
2009-08-16 17:00:08 +02:00
for( j = a; j; j = j->next ) {
GValue *value2 = (GValue *) j->data;
g_assert( G_VALUE_TYPE( value2 ) ==
VIPS_TYPE_REF_STRING );
2009-08-16 17:00:08 +02:00
/* Just do a pointer compare ... good enough 99.9% of
* the time.
*/
if( vips_value_get_ref_string( value, NULL ) ==
vips_value_get_ref_string( value2, NULL ) )
2009-08-16 17:00:08 +02:00
break;
}
if( !j )
tail = g_slist_prepend( tail,
vips__gvalue_copy( value ) );
2009-08-16 17:00:08 +02:00
}
a = g_slist_concat( a, g_slist_reverse( tail ) );
return( a );
}
/* Make a char* from GSList of GValue. Each GValue should be a ref_string.
* free the result. Empty list -> "", not NULL. Join strings with '\n'.
*/
char *
vips__gslist_gvalue_get( const GSList *list )
2009-08-16 17:00:08 +02:00
{
const GSList *p;
size_t length;
char *all;
char *q;
/* Need to estimate length first.
*/
length = 0;
for( p = list; p; p = p->next ) {
GValue *value = (GValue *) p->data;
size_t l2;
2009-08-16 17:00:08 +02:00
g_assert( G_VALUE_TYPE( value ) == VIPS_TYPE_REF_STRING );
2009-08-16 17:00:08 +02:00
/* +1 for the newline we will add for each item.
*/
(void) vips_value_get_ref_string( value, &l2 );
length += l2 + 1;
2009-08-16 17:00:08 +02:00
}
if( length == 0 )
return( NULL );
/* More than 10MB of history? Madness!
*/
g_assert( length < 10 * 1024 * 1024 );
2009-08-16 17:00:08 +02:00
/* +1 for '\0'.
*/
if( !(all = vips_malloc( NULL, length + 1 )) )
2009-08-16 17:00:08 +02:00
return( NULL );
q = all;
for( p = list; p; p = p->next ) {
GValue *value = (GValue *) p->data;
size_t l2;
2009-08-16 17:00:08 +02:00
strcpy( q, vips_value_get_ref_string( value, &l2 ) );
q += l2;
2009-08-16 17:00:08 +02:00
strcpy( q, "\n" );
q += 1;
}
g_assert( (size_t) (q - all) == length );
return( all );
}
/* Need our own seek(), since lseek() on win32 can't do long files.
*/
int
vips__seek( int fd, gint64 pos )
2009-08-16 17:00:08 +02:00
{
#ifdef OS_WIN32
{
HANDLE hFile = (HANDLE) _get_osfhandle( fd );
LARGE_INTEGER p;
p.QuadPart = pos;
if( !SetFilePointerEx( hFile, p, NULL, FILE_BEGIN ) ) {
vips_error_system( GetLastError(), "vips__seek",
2009-08-16 17:00:08 +02:00
"%s", _( "unable to seek" ) );
return( -1 );
}
}
#else /*!OS_WIN32*/
if( lseek( fd, pos, SEEK_SET ) == (off_t) -1 ) {
vips_error( "vips__seek", "%s", _( "unable to seek" ) );
2009-08-16 17:00:08 +02:00
return( -1 );
}
#endif /*OS_WIN32*/
return( 0 );
}
/* Need our own ftruncate(), since ftruncate() on win32 can't do long files.
DANGER ... this moves the file pointer to the end of file on win32,
but not on *nix; don't make any assumptions about the file pointer
position after calling this
*/
int
vips__ftruncate( int fd, gint64 pos )
2009-08-16 17:00:08 +02:00
{
#ifdef OS_WIN32
{
HANDLE hFile = (HANDLE) _get_osfhandle( fd );
LARGE_INTEGER p;
p.QuadPart = pos;
if( vips__seek( fd, pos ) )
2009-08-16 17:00:08 +02:00
return( -1 );
if( !SetEndOfFile( hFile ) ) {
vips_error_system( GetLastError(), "vips__ftruncate",
2009-08-16 17:00:08 +02:00
"%s", _( "unable to truncate" ) );
return( -1 );
}
}
#else /*!OS_WIN32*/
if( ftruncate( fd, pos ) ) {
vips_error_system( errno, "vips__ftruncate",
2009-08-16 17:00:08 +02:00
"%s", _( "unable to truncate" ) );
return( -1 );
}
#endif /*OS_WIN32*/
return( 0 );
}
/* Test for file exists.
2009-08-16 17:00:08 +02:00
*/
int
vips_existsf( const char *name, ... )
2009-08-16 17:00:08 +02:00
{
va_list ap;
char *path;
int result;
2009-08-16 17:00:08 +02:00
va_start( ap, name );
path = g_strdup_vprintf( name, ap );
va_end( ap );
2009-08-16 17:00:08 +02:00
2016-08-16 19:33:48 +02:00
result = g_access( path, R_OK );
2009-08-16 17:00:08 +02:00
g_free( path );
return( !result );
2009-08-16 17:00:08 +02:00
}
#ifdef OS_WIN32
2016-03-26 12:09:46 +01:00
#ifndef popen
#define popen(b,m) _popen(b,m)
2016-03-26 12:09:46 +01:00
#endif
#ifndef pclose
#define pclose(f) _pclose(f)
2016-03-26 12:09:46 +01:00
#endif
#endif /*OS_WIN32*/
/* Do popen(), with printf-style args.
2009-08-16 17:00:08 +02:00
*/
FILE *
vips_popenf( const char *fmt, const char *mode, ... )
2009-08-16 17:00:08 +02:00
{
va_list args;
char buf[VIPS_PATH_MAX];
FILE *fp;
2009-08-16 17:00:08 +02:00
va_start( args, mode );
(void) vips_vsnprintf( buf, VIPS_PATH_MAX, fmt, args );
va_end( args );
#ifdef DEBUG
printf( "vips_popenf: running: %s\n", buf );
#endif /*DEBUG*/
if( !(fp = popen( buf, mode )) ) {
vips_error( "popenf", "%s", strerror( errno ) );
return( NULL );
2009-08-16 17:00:08 +02:00
}
return( fp );
2009-08-16 17:00:08 +02:00
}
2012-03-21 15:56:01 +01:00
/* Make a directory.
*/
int
vips_mkdirf( const char *name, ... )
{
va_list ap;
char *path;
2012-03-21 15:56:01 +01:00
va_start( ap, name );
path = g_strdup_vprintf( name, ap );
2012-03-21 15:56:01 +01:00
va_end( ap );
if( g_mkdir( path, 0755 ) ) {
2012-03-21 15:56:01 +01:00
vips_error( "mkdirf",
_( "unable to create directory \"%s\", %s" ),
path, strerror( errno ) );
g_free( path );
2012-03-21 15:56:01 +01:00
return( -1 );
}
g_free( path );
2012-03-21 15:56:01 +01:00
return( 0 );
}
/* Remove a directory.
*/
int
vips_rmdirf( const char *name, ... )
{
va_list ap;
char *path;
va_start( ap, name );
path = g_strdup_vprintf( name, ap );
va_end( ap );
if( g_rmdir( path ) ) {
vips_error( "rmdir",
_( "unable to remove directory \"%s\", %s" ),
path, strerror( errno ) );
g_free( path );
return( -1 );
}
g_free( path );
return( 0 );
}
/* Rename a file.
*/
int
vips_rename( const char *old_name, const char *new_name )
{
if( g_rename( old_name, new_name ) ) {
vips_error( "rename",
_( "unable to rename file \"%s\" as \"%s\", %s" ),
old_name, new_name, strerror( errno ) );
return( -1 );
}
return( 0 );
}
/* Chop off any trailing whitespace.
*/
void
vips__chomp( char *str )
{
char *p;
for( p = str + strlen( str ); p > str && isspace( p[-1] ); p-- )
p[-1] = '\0';
}
/* Break a command-line argument into tokens separated by whitespace.
*
* Strings can't be adjacent, so "hello world" (without quotes) is a single
* string. Strings are written (with \" escaped) into @string. If the string
* is larger than @size, it is silently null-terminated and truncated.
*
* Return NULL for end of tokens.
2009-08-16 17:00:08 +02:00
*/
const char *
vips__token_get( const char *p, VipsToken *token, char *string, int size )
{
const char *q;
int ch;
int n;
int i;
2009-08-16 17:00:08 +02:00
/* Parse this token with p.
*/
if( !p )
return( NULL );
/* Skip initial whitespace.
*/
p += strspn( p, " \t\n\r" );
if( !p[0] )
return( NULL );
switch( (ch = p[0]) ) {
case '[':
*token = VIPS_TOKEN_LEFT;
p += 1;
break;
case ']':
*token = VIPS_TOKEN_RIGHT;
p += 1;
break;
case '=':
*token = VIPS_TOKEN_EQUALS;
p += 1;
break;
case ',':
*token = VIPS_TOKEN_COMMA;
p += 1;
break;
case '"':
case '\'':
/* Parse a quoted string. Copy up to ", interpret any \",
* error if no closing ".
*/
*token = VIPS_TOKEN_STRING;
do {
/* Number of characters until the next quote
* character or end of string.
*/
if( (q = strchr( p + 1, ch )) )
n = q - p + 1;
else
n = strlen( p + 1 );
/* How much can we copy to the buffer?
*/
i = VIPS_MIN( n, size );
vips_strncpy( string, p + 1, i );
2009-08-16 17:00:08 +02:00
/* We might have stopped at an escaped quote. If the
* string was not truncated, swap the preceding
* backslash for a quote.
2009-08-16 17:00:08 +02:00
*/
if( p[n + 1] == ch && p[n] == '\\' && i == n )
string[i - 1] = ch;
2009-08-16 17:00:08 +02:00
string += i;
size -= i;
2009-08-16 17:00:08 +02:00
p += n + 1;
} while( p[0] && p[-1] == '\\' );
p += 1;
break;
default:
/* It's an unquoted string: read up to the next non-string
* character. We don't allow two strings next to each other,
* so the next break must be brackets, equals, comma.
2009-08-16 17:00:08 +02:00
*/
*token = VIPS_TOKEN_STRING;
q = p + strcspn( p, "[]=," );
i = VIPS_MIN( q - p, size );
vips_strncpy( string, p, i + 1 );
p = q;
2009-08-16 17:00:08 +02:00
/* We remove leading whitespace, so we trim trailing
* whitespace from unquoted strings too. Only if the string
* hasn't been truncated.
2009-08-16 17:00:08 +02:00
*/
if( i != size )
while( i > 0 && isspace( string[i - 1] ) ) {
string[i - 1] = '\0';
i--;
}
2009-08-16 17:00:08 +02:00
break;
}
return( p );
}
/* We expect a token.
*/
const char *
vips__token_must( const char *p, VipsToken *token,
char *string, int size )
{
if( !(p = vips__token_get( p, token, string, size )) ) {
vips_error( "get_token",
"%s", _( "unexpected end of string" ) );
2009-08-16 17:00:08 +02:00
return( NULL );
}
return( p );
}
/* We expect a certain token.
*/
const char *
vips__token_need( const char *p, VipsToken need_token,
char *string, int size )
{
VipsToken token;
if( !(p = vips__token_must( p, &token, string, size )) )
return( NULL );
if( token != need_token ) {
vips_error( "get_token", _( "expected %s, saw %s" ),
vips_enum_nick( VIPS_TYPE_TOKEN, need_token ),
vips_enum_nick( VIPS_TYPE_TOKEN, token ) );
return( NULL );
}
return( p );
}
/* Fetch a token. If it's a string token terminated by a '[', fetch up to the
* matching ']' as well, for example ".jpg[Q=90]".
*
* Return NULL for end of tokens.
*/
const char *
vips__token_segment( const char *p, VipsToken *token,
char *string, int size )
{
const char *q;
if( !(q = vips__token_must( p, token, string, size )) )
return( NULL );
/* If we stopped on [, read up to the matching ].
*/
if( *token == VIPS_TOKEN_STRING &&
q[0] == '[' ) {
VipsToken sub_token;
char sub_string[VIPS_PATH_MAX];
int depth;
int i;
depth = 0;
do {
if( !(q = vips__token_must( q, &sub_token,
sub_string, VIPS_PATH_MAX )) )
return( NULL );
switch( sub_token ) {
case VIPS_TOKEN_LEFT:
depth += 1;
break;
case VIPS_TOKEN_RIGHT:
depth -= 1;
break;
default:
break;
}
} while( !(sub_token == VIPS_TOKEN_RIGHT && depth == 0) );
i = VIPS_MIN( q - p, size );
vips_strncpy( string, p, i + 1 );
}
return( q );
}
/* We expect a certain segment.
*/
const char *
vips__token_segment_need( const char *p, VipsToken need_token,
char *string, int size )
{
VipsToken token;
if( !(p = vips__token_segment( p, &token, string, size )) )
return( NULL );
2009-08-16 17:00:08 +02:00
if( token != need_token ) {
vips_error( "get_token", _( "expected %s, saw %s" ),
2012-01-27 18:14:59 +01:00
vips_enum_nick( VIPS_TYPE_TOKEN, need_token ),
vips_enum_nick( VIPS_TYPE_TOKEN, token ) );
2009-08-16 17:00:08 +02:00
return( NULL );
}
return( p );
}
2009-10-12 17:27:18 +02:00
/* Maximum number of tokens we allow in a filename. Surely this will be
* plenty.
*/
#define MAX_TOKENS (1000)
/* Find the start of the right-most pair of brackets in the string.
*
* A string can be of the form:
*
* "hello world! (no really).tif[fred=12]"
*
* we need to be able to find the fred=12 at the end.
*
* We lex the whole string noting the position of each token, then, if the
* final token is a right-bracket, search left for the matching left-bracket.
*
* This can get confused if the lefts are hidden inside another token :-( But
* a fixing that would require us to write a separate right-to-left lexer,
* argh.
*/
const char *
vips__find_rightmost_brackets( const char *p )
{
const char *start[MAX_TOKENS + 1];
VipsToken tokens[MAX_TOKENS];
char str[VIPS_PATH_MAX];
int n, i;
int nest;
start[0] = p;
for( n = 0;
n < MAX_TOKENS &&
(p = vips__token_get( start[n], &tokens[n],
str, VIPS_PATH_MAX ));
n++, start[n] = p )
;
/* Too many tokens?
*/
if( n == MAX_TOKENS )
return( NULL );
/* No rightmost close bracket?
*/
if( n == 0 ||
tokens[n - 1] != VIPS_TOKEN_RIGHT )
return( NULL );
nest = 0;
for( i = n - 1; i >= 0; i-- ) {
if( tokens[i] == VIPS_TOKEN_RIGHT )
nest += 1;
else if( tokens[i] == VIPS_TOKEN_LEFT )
nest -= 1;
if( nest == 0 )
break;
}
/* No matching left bracket?
*/
if( nest != 0 )
return( NULL );
/* This should be the matching left.
*/
return( start[i] );
}
/* Split a vips8-style filename + options.
*
2014-06-07 17:47:53 +02:00
* filename and option_string must be VIPS_PATH_MAX in length.
*/
void
vips__filename_split8( const char *name, char *filename, char *option_string )
{
char *p;
vips_strncpy( filename, name, VIPS_PATH_MAX );
if( (p = (char *) vips__find_rightmost_brackets( filename )) ) {
vips_strncpy( option_string, p, VIPS_PATH_MAX );
*p = '\0';
}
else
vips_strncpy( option_string, "", VIPS_PATH_MAX );
}
2009-10-12 17:27:18 +02:00
/* True if an int is a power of two ... 1, 2, 4, 8, 16, 32, etc. Do with just
* integer arithmetic for portability. A previous Nicos version using doubles
* and log/log failed on x86 with rounding problems. Return 0 for not
* power of two, otherwise return the position of the set bit (numbering with
* bit 1 as the lsb).
*/
int
vips_ispoweroftwo( int p )
2009-10-12 17:27:18 +02:00
{
int i, n;
/* Count set bits. Could use a LUT, I guess.
*/
for( i = 0, n = 0; p; i++, p >>= 1 )
if( p & 1 )
n++;
/* Should be just one set bit.
*/
if( n == 1 )
/* Return position of bit.
*/
return( i );
else
return( 0 );
}
/* Test this processor for endianness. True for SPARC order.
*/
int
vips_amiMSBfirst( void )
2009-10-12 17:27:18 +02:00
{
int test;
unsigned char *p = (unsigned char *) &test;
test = 0;
p[0] = 255;
if( test == 255 )
return( 0 );
else
return( 1 );
}
2010-07-29 12:18:44 +02:00
/* Return the tmp dir. On Windows, GetTempPath() will also check the values of
* TMP, TEMP and USERPROFILE.
*/
static const char *
vips__temp_dir( void )
2010-07-29 12:18:44 +02:00
{
const char *tmpd;
if( !(tmpd = g_getenv( "TMPDIR" )) ) {
#ifdef OS_WIN32
static gboolean done = FALSE;
static char buf[256];
if( !done ) {
if( !GetTempPath( 256, buf ) )
strcpy( buf, "C:\\temp" );
}
tmpd = buf;
#else /*!OS_WIN32*/
tmpd = "/tmp";
#endif /*!OS_WIN32*/
}
return( tmpd );
}
2010-01-08 17:58:44 +01:00
/* Make a temporary file name. The format parameter is something like "%s.jpg"
* and will be expanded to something like "/tmp/vips-12-34587.jpg".
*
* You need to free the result. A real file will also be created, though we
* delete it for you.
2009-10-16 10:33:17 +02:00
*/
2010-01-08 17:58:44 +01:00
char *
vips__temp_name( const char *format )
2009-10-16 10:33:17 +02:00
{
2010-01-08 17:58:44 +01:00
static int serial = 1;
char file[FILENAME_MAX];
char file2[FILENAME_MAX];
2009-10-16 10:33:17 +02:00
char *name;
int fd;
vips_snprintf( file, FILENAME_MAX, "vips-%d-XXXXXX", serial++ );
vips_snprintf( file2, FILENAME_MAX, format, file );
name = g_build_filename( vips__temp_dir(), file2, NULL );
2009-10-16 10:33:17 +02:00
if( (fd = g_mkstemp( name )) == -1 ) {
vips_error( "tempfile",
2010-01-08 17:58:44 +01:00
_( "unable to make temporary file %s" ), name );
2009-10-16 10:33:17 +02:00
g_free( name );
return( NULL );
}
close( fd );
2010-01-08 17:58:44 +01:00
g_unlink( name );
return( name );
}
/* Strip off any of a set of old suffixes (eg. [".v", ".jpg"]), add a single
* new suffix (eg. ".tif").
*/
void
vips__change_suffix( const char *name, char *out, int mx,
const char *new, const char **olds, int nolds )
{
char *p;
int i;
int len;
/* Copy start string.
*/
vips_strncpy( out, name, mx );
/* Drop all matching suffixes.
*/
while( (p = strrchr( out, '.' )) ) {
/* Found suffix - test against list of alternatives. Ignore
* case.
*/
for( i = 0; i < nolds; i++ )
if( g_ascii_strcasecmp( p, olds[i] ) == 0 ) {
*p = '\0';
break;
}
/* Found match? If not, break from loop.
*/
if( *p )
break;
}
/* Add new suffix.
*/
len = strlen( out );
vips_strncpy( out + len, new, mx - len );
}
typedef struct {
const char unit;
int multiplier;
} Unit;
2011-12-11 23:01:39 +01:00
guint64
vips__parse_size( const char *size_string )
{
static Unit units[] = {
{ 'k', 1024 },
{ 'm', 1024 * 1024 },
{ 'g', 1024 * 1024 * 1024 }
};
2011-12-11 23:01:39 +01:00
guint64 size;
int n;
2013-05-01 19:46:15 +02:00
int i;
char *unit;
/* An easy way to alloc a buffer large enough.
*/
unit = g_strdup( size_string );
n = sscanf( size_string, "%d %s", &i, unit );
size = i;
if( n > 1 ) {
2013-05-01 19:46:15 +02:00
int j;
for( j = 0; j < VIPS_NUMBER( units ); j++ )
if( tolower( unit[0] ) == units[j].unit ) {
size *= units[j].multiplier;
break;
}
}
g_free( unit );
2013-07-15 11:49:49 +02:00
VIPS_DEBUG_MSG( "parse_size: parsed \"%s\" as %" G_GUINT64_FORMAT "\n",
size_string, size );
return( size );
}
2012-01-27 18:14:59 +01:00
/* Look up the const char * for an enum value.
*/
const char *
vips_enum_string( GType enm, int v )
{
GEnumValue *value;
if( !(value = g_enum_get_value( g_type_class_ref( enm ), v )) )
return( "(null)" );
return( value->value_name );
}
const char *
vips_enum_nick( GType enm, int v )
{
GEnumValue *value;
if( !(value = g_enum_get_value( g_type_class_ref( enm ), v )) )
return( "(null)" );
return( value->value_nick );
}
int
vips_enum_from_nick( const char *domain, GType type, const char *nick )
{
GTypeClass *class;
GEnumClass *genum;
GEnumValue *enum_value;
int i;
char str[1000];
VipsBuf buf = VIPS_BUF_STATIC( str );
if( !(class = g_type_class_ref( type )) ) {
vips_error( domain, "%s", _( "no such enum type" ) );
return( -1 );
}
genum = G_ENUM_CLASS( class );
if( (enum_value = g_enum_get_value_by_name( genum, nick )) )
return( enum_value->value );
if( (enum_value = g_enum_get_value_by_nick( genum, nick )) )
return( enum_value->value );
/* -1 since we always have a "last" member.
*/
for( i = 0; i < genum->n_values - 1; i++ ) {
if( i > 0 )
vips_buf_appends( &buf, ", " );
vips_buf_appends( &buf, genum->values[i].value_nick );
}
vips_error( domain, _( "enum '%s' has no member '%s', "
"should be one of: %s" ),
g_type_name( type ), nick, vips_buf_all( &buf ) );
return( -1 );
}
int
vips_flags_from_nick( const char *domain, GType type, const char *nick )
{
GTypeClass *class;
GFlagsClass *gflags;
GFlagsValue *flags_value;
int i;
char str[1000];
VipsBuf buf = VIPS_BUF_STATIC( str );
if( !(class = g_type_class_ref( type )) ) {
vips_error( domain, "%s", _( "no such flag type" ) );
return( -1 );
}
gflags = G_FLAGS_CLASS( class );
if( (flags_value = g_flags_get_value_by_name( gflags, nick )) )
return( flags_value->value );
if( (flags_value = g_flags_get_value_by_nick( gflags, nick )) )
return( flags_value->value );
for( i = 0; i < gflags->n_values; i++ ) {
if( i > 0 )
vips_buf_appends( &buf, ", " );
vips_buf_appends( &buf, gflags->values[i].value_nick );
}
vips_error( domain, _( "flags '%s' has no member '%s', "
"should be one of: %s" ),
g_type_name( type ), nick, vips_buf_all( &buf ) );
return( -1 );
}
2016-11-01 11:14:12 +01:00
/* Scan @buf for the first "%ns" (eg. "%12s") and substitute the
* lowest-numbered one for @sub. @buf is @len bytes in size.
*
* If there are no %ns, use the first %s.
*/
int
vips__substitute( char *buf, size_t len, char *sub )
{
size_t buflen = strlen( buf );
size_t sublen = strlen( sub );
int lowest_n;
char *sub_start;
char *p;
char *sub_end;
size_t before_len, marker_len, after_len, final_len;
g_assert( buflen < len );
lowest_n = -1;
sub_start = NULL;
sub_end = NULL;
for( p = buf; (p = strchr( p, '%' )); p++ )
if( isdigit( p[1] ) ) {
char *q;
for( q = p + 1; isdigit( *q ); q++ )
;
if( q[0] == 's' ) {
int n;
n = atoi( p + 1 );
if( lowest_n == -1 ||
n < lowest_n ) {
lowest_n = n;
sub_start = p;
sub_end = q + 1;
}
}
}
if( !sub_start )
for( p = buf; (p = strchr( p, '%' )); p++ )
if( p[1] == 's' ) {
sub_start = p;
sub_end = p + 2;
break;
}
if( !sub_start )
return( -1 );
before_len = sub_start - buf;
marker_len = sub_end - sub_start;
after_len = buflen - (before_len + marker_len);
final_len = before_len + sublen + after_len + 1;
if( final_len > len )
return( -1 );
memmove( buf + before_len + sublen, buf + before_len + marker_len,
after_len + 1 );
memmove( buf + before_len, sub, sublen );
return( 0 );
}
/* Absoluteize a path. Free the result with g_free().
*/
char *
vips_realpath( const char *path )
{
char *real;
#ifdef HAVE_REALPATH
{
char *real2;
if( !(real = realpath( path, NULL )) ) {
vips_error_system( errno, "vips_realpath",
"%s", _( "unable to form filename" ) );
return( NULL );
}
/* We must return a path that can be freed with g_free().
*/
real2 = g_strdup( real );
free( real );
real = real2;
}
#else /*!HAVE_REALPATH*/
{
if( !g_path_is_absolute( path ) ) {
char *cwd;
cwd = g_get_current_dir();
2016-03-29 11:13:09 +02:00
real = g_build_filename( cwd, path, NULL );
g_free( cwd );
}
else
real = g_strdup( path );
2016-03-26 12:09:46 +01:00
}
#endif
return( real );
}
/* A very simple random number generator. See:
* http://isthe.com/chongo/tech/comp/fnv/#FNV-source
*/
guint32
vips__random( guint32 seed )
{
return( 1103515245u * seed + 12345 );
}
guint32
vips__random_add( guint32 seed, int value )
{
seed = ((2166136261u ^ seed) * 16777619u) ^ value;
return( vips__random( seed ) );
}