1997-11-18 14:06:00 +00:00
|
|
|
|
/* strgutil.c - miscellaneous utilities
|
1998-02-24 18:50:46 +00:00
|
|
|
|
* Copyright (C) 1998 Free Software Foundation, Inc.
|
1997-11-18 14:06:00 +00:00
|
|
|
|
*
|
1998-02-24 18:50:46 +00:00
|
|
|
|
* This file is part of GNUPG.
|
1997-11-18 14:06:00 +00:00
|
|
|
|
*
|
1998-02-24 18:50:46 +00:00
|
|
|
|
* GNUPG is free software; you can redistribute it and/or modify
|
1997-11-18 14:06:00 +00:00
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
|
* (at your option) any later version.
|
|
|
|
|
*
|
1998-02-24 18:50:46 +00:00
|
|
|
|
* GNUPG is distributed in the hope that it will be useful,
|
1997-11-18 14:06:00 +00:00
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
#include <stdlib.h>
|
1998-02-03 12:09:20 +00:00
|
|
|
|
#include <string.h>
|
1997-11-18 14:06:00 +00:00
|
|
|
|
#include <ctype.h>
|
|
|
|
|
#include "types.h"
|
|
|
|
|
#include "util.h"
|
|
|
|
|
#include "memory.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
free_strlist( STRLIST sl )
|
|
|
|
|
{
|
|
|
|
|
STRLIST sl2;
|
|
|
|
|
|
|
|
|
|
for(; sl; sl = sl2 ) {
|
|
|
|
|
sl2 = sl->next;
|
|
|
|
|
m_free(sl);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-13 19:04:23 +00:00
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
add_to_strlist( STRLIST *list, const char *string )
|
|
|
|
|
{
|
|
|
|
|
STRLIST sl;
|
|
|
|
|
|
|
|
|
|
sl = m_alloc( sizeof *sl + strlen(string));
|
|
|
|
|
strcpy(sl->d, string);
|
|
|
|
|
sl->next = *list;
|
|
|
|
|
*list = sl;
|
|
|
|
|
}
|
|
|
|
|
|
1998-02-11 23:22:09 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
STRLIST
|
|
|
|
|
strlist_prev( STRLIST head, STRLIST node )
|
|
|
|
|
{
|
|
|
|
|
STRLIST n;
|
|
|
|
|
|
|
|
|
|
for(n=NULL; head && head != node; head = head->next )
|
|
|
|
|
n = head;
|
|
|
|
|
return n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
STRLIST
|
|
|
|
|
strlist_last( STRLIST node )
|
|
|
|
|
{
|
|
|
|
|
if( node )
|
|
|
|
|
for( ; node->next ; node = node->next )
|
|
|
|
|
;
|
|
|
|
|
return node;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
1998-04-30 14:06:01 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
memicmp( const char *a, const char *b, size_t n )
|
|
|
|
|
{
|
|
|
|
|
for( ; n; n--, a++, b++ )
|
|
|
|
|
if( *a != *b && toupper(*(const byte*)a) != toupper(*(const byte*)b) )
|
|
|
|
|
return *(const byte *)a - *(const byte*)b;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
1997-11-18 14:06:00 +00:00
|
|
|
|
/****************
|
|
|
|
|
* look for the substring SUB in buffer and return a pointer to that
|
|
|
|
|
* substring in BUF or NULL if not found.
|
1998-04-14 17:51:16 +00:00
|
|
|
|
* Comparison is case-insensitive.
|
1997-11-18 14:06:00 +00:00
|
|
|
|
*/
|
1998-03-19 15:27:29 +00:00
|
|
|
|
const char *
|
|
|
|
|
memistr( const char *buf, size_t buflen, const char *sub )
|
1997-11-18 14:06:00 +00:00
|
|
|
|
{
|
|
|
|
|
const byte *t, *s ;
|
|
|
|
|
size_t n;
|
|
|
|
|
|
|
|
|
|
for( t=buf, n=buflen, s=sub ; n ; t++, n-- )
|
|
|
|
|
if( toupper(*t) == toupper(*s) ) {
|
1998-03-19 15:27:29 +00:00
|
|
|
|
for( buf=t++, buflen = n--, s++;
|
1997-11-18 14:06:00 +00:00
|
|
|
|
n && toupper(*t) == toupper(*s); t++, s++, n-- )
|
|
|
|
|
;
|
|
|
|
|
if( !*s )
|
|
|
|
|
return buf;
|
|
|
|
|
t = buf; n = buflen; s = sub ;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL ;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-26 22:09:01 +00:00
|
|
|
|
/****************
|
|
|
|
|
* Wie strncpy(), aber es werden maximal n-1 zeichen kopiert und ein
|
|
|
|
|
* '\0' angeh<EFBFBD>ngt. Ist n = 0, so geschieht nichts, ist Destination
|
|
|
|
|
* gleich NULL, so wird via m_alloc Speicher besorgt, ist dann nicht
|
|
|
|
|
* gen<EFBFBD>gend Speicher vorhanden, so bricht die funktion ab.
|
|
|
|
|
*/
|
|
|
|
|
char *
|
|
|
|
|
mem2str( char *dest , const void *src , size_t n )
|
|
|
|
|
{
|
|
|
|
|
char *d;
|
|
|
|
|
const char *s;
|
|
|
|
|
|
|
|
|
|
if( n ) {
|
|
|
|
|
if( !dest )
|
|
|
|
|
dest = m_alloc( n ) ;
|
|
|
|
|
d = dest;
|
|
|
|
|
s = src ;
|
|
|
|
|
for(n--; n && *s; n-- )
|
|
|
|
|
*d++ = *s++;
|
|
|
|
|
*d = '\0' ;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return dest ;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-05 19:13:15 +00:00
|
|
|
|
|
1998-01-07 20:47:46 +00:00
|
|
|
|
/****************
|
|
|
|
|
* remove leading and trailing white spaces
|
|
|
|
|
*/
|
|
|
|
|
char *
|
|
|
|
|
trim_spaces( char *str )
|
|
|
|
|
{
|
|
|
|
|
char *string, *p, *mark;
|
|
|
|
|
|
|
|
|
|
string = str;
|
|
|
|
|
/* find first non space character */
|
|
|
|
|
for( p=string; *p && isspace( *(byte*)p ) ; p++ )
|
|
|
|
|
;
|
|
|
|
|
/* move characters */
|
|
|
|
|
for( (mark = NULL); (*string = *p); string++, p++ )
|
|
|
|
|
if( isspace( *(byte*)p ) ) {
|
|
|
|
|
if( !mark )
|
|
|
|
|
mark = string ;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
mark = NULL ;
|
|
|
|
|
if( mark )
|
|
|
|
|
*mark = '\0' ; /* remove trailing spaces */
|
|
|
|
|
|
|
|
|
|
return str ;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
string_count_chr( const char *string, int c )
|
|
|
|
|
{
|
|
|
|
|
int count;
|
|
|
|
|
for(count=0; *string; string++ )
|
|
|
|
|
if( *string == c )
|
|
|
|
|
count++;
|
|
|
|
|
return count;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-05 19:13:15 +00:00
|
|
|
|
/*********************************************
|
|
|
|
|
********** missing string functions *********
|
|
|
|
|
*********************************************/
|
|
|
|
|
|
|
|
|
|
#ifndef HAVE_STPCPY
|
|
|
|
|
char *
|
|
|
|
|
stpcpy(char *a,const char *b)
|
|
|
|
|
{
|
|
|
|
|
while( *b )
|
|
|
|
|
*a++ = *b++;
|
|
|
|
|
*a = 0;
|
|
|
|
|
|
|
|
|
|
return (char*)a;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
1998-01-07 20:47:46 +00:00
|
|
|
|
#ifndef HAVE_STRLWR
|
|
|
|
|
char *
|
|
|
|
|
strlwr(char *s)
|
|
|
|
|
{
|
|
|
|
|
char *p;
|
|
|
|
|
for(p=s; *p; p++ )
|
|
|
|
|
*p = tolower(*p);
|
|
|
|
|
return s;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|