1998-06-09 15:14:06 +00:00
|
|
|
/* dynload.c - load cipher extensions
|
2001-04-29 14:08:29 +00:00
|
|
|
* Copyright (C) 1998, 1999, 2001 Free Software Foundation, Inc.
|
1998-06-09 15:14:06 +00:00
|
|
|
*
|
1998-12-23 12:41:40 +00:00
|
|
|
* This file is part of GnuPG.
|
1998-06-09 15:14:06 +00:00
|
|
|
*
|
1998-12-23 12:41:40 +00:00
|
|
|
* GnuPG is free software; you can redistribute it and/or modify
|
1998-06-09 15:14:06 +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-12-23 12:41:40 +00:00
|
|
|
* GnuPG is distributed in the hope that it will be useful,
|
1998-06-09 15:14:06 +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 <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1998-06-11 07:16:50 +00:00
|
|
|
#include <string.h>
|
1998-07-09 13:37:17 +00:00
|
|
|
#include <unistd.h>
|
1998-06-16 15:13:28 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
|
|
|
#include <dlfcn.h>
|
1998-10-16 16:00:17 +00:00
|
|
|
#elif defined(HAVE_DLD_DLD_LINK)
|
|
|
|
#include <dld.h>
|
1999-06-26 10:23:06 +00:00
|
|
|
#elif defined(HAVE_DL_SHL_LOAD)
|
|
|
|
#include <dl.h>
|
|
|
|
#include <errno.h>
|
1998-06-16 15:13:28 +00:00
|
|
|
#endif
|
2001-01-04 14:11:55 +00:00
|
|
|
#ifdef __MINGW32__
|
|
|
|
#include <windows.h>
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
#include "util.h"
|
|
|
|
#include "cipher.h"
|
1998-06-09 15:14:06 +00:00
|
|
|
#include "dynload.h"
|
|
|
|
|
1999-03-08 19:50:18 +00:00
|
|
|
#ifdef WITH_SYMBOL_UNDERSCORE
|
1998-12-12 17:44:34 +00:00
|
|
|
#define SYMBOL_VERSION "_gnupgext_version"
|
|
|
|
#define SYMBOL_ENUM "_gnupgext_enum_func"
|
|
|
|
#else
|
|
|
|
#define SYMBOL_VERSION "gnupgext_version"
|
|
|
|
#define SYMBOL_ENUM "gnupgext_enum_func"
|
|
|
|
#endif
|
|
|
|
|
1998-09-14 15:49:56 +00:00
|
|
|
|
|
|
|
#ifndef RTLD_NOW
|
|
|
|
#define RTLD_NOW 1
|
|
|
|
#endif
|
|
|
|
|
1999-06-26 10:23:06 +00:00
|
|
|
#ifdef HAVE_DL_SHL_LOAD /* HPUX has shl_load instead of dlopen */
|
|
|
|
#define HAVE_DL_DLOPEN
|
|
|
|
#define dlopen(PATHNAME,MODE) \
|
|
|
|
((void *) shl_load(PATHNAME, DYNAMIC_PATH | \
|
|
|
|
(((MODE) & RTLD_NOW) ? BIND_IMMEDIATE : BIND_DEFERRED), 0L))
|
|
|
|
#define dlclose(HANDLE) shl_unload((shl_t) (HANDLE))
|
|
|
|
#define dlerror() (errno == 0 ? NULL : strerror(errno))
|
|
|
|
|
|
|
|
static void *
|
|
|
|
dlsym(void *handle, char *name)
|
|
|
|
{
|
|
|
|
void *addr;
|
|
|
|
if (shl_findsym((shl_t *)&handle,name,(short)TYPE_UNDEFINED,&addr) != 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
#endif /*HAVE_DL_SHL_LOAD*/
|
|
|
|
|
2000-12-28 15:49:42 +00:00
|
|
|
#ifdef __MINGW32__
|
2001-04-17 16:20:32 +00:00
|
|
|
#define HAVE_DL_DLOPEN
|
|
|
|
#define USE_DYNAMIC_LINKING
|
2000-12-28 15:49:42 +00:00
|
|
|
|
2001-04-17 16:20:32 +00:00
|
|
|
static int last_error = 0;
|
|
|
|
|
|
|
|
void*
|
|
|
|
dlopen(const char *pathname, int mode)
|
2000-12-28 15:49:42 +00:00
|
|
|
{
|
2001-04-17 16:20:32 +00:00
|
|
|
void *h = LoadLibrary( pathname );
|
|
|
|
if (!h) {
|
|
|
|
log_error( "LoadLibrary failed ec=%d\n", (int)GetLastError() );
|
|
|
|
last_error = 1;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return h;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
dlclose( void *handle )
|
|
|
|
{
|
|
|
|
last_error = 0;
|
|
|
|
return FreeLibrary( handle );
|
|
|
|
}
|
|
|
|
|
|
|
|
char*
|
|
|
|
dlerror(void)
|
|
|
|
{
|
|
|
|
static char dlerrstr[10];
|
|
|
|
if (last_error) {
|
|
|
|
sprintf(dlerrstr, "%d", (int)GetLastError() );
|
|
|
|
return dlerrstr;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void*
|
|
|
|
dlsym( void *handle, const char *name )
|
|
|
|
{
|
|
|
|
void *h = GetProcAddress( handle, name );
|
|
|
|
if (!h) {
|
|
|
|
log_error( "GetProcAddress failed ec=%d\n", (int)GetLastError() );
|
|
|
|
last_error = 1;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return h;
|
2000-12-28 15:49:42 +00:00
|
|
|
}
|
|
|
|
#endif /*__MINGW32__*/
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-06-26 10:23:06 +00:00
|
|
|
|
|
|
|
|
1998-06-11 07:16:50 +00:00
|
|
|
typedef struct ext_list {
|
|
|
|
struct ext_list *next;
|
1998-11-25 11:52:41 +00:00
|
|
|
int internal;
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-06-11 07:16:50 +00:00
|
|
|
void *handle; /* handle from dlopen() */
|
1998-10-16 16:00:17 +00:00
|
|
|
#else
|
|
|
|
int handle; /* if the function has been loaded, this is true */
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
int failed; /* already tried but failed */
|
|
|
|
void * (*enumfunc)(int, int*, int*, int*);
|
1998-06-25 10:19:08 +00:00
|
|
|
char *hintstr; /* pointer into name */
|
1998-06-11 07:16:50 +00:00
|
|
|
char name[1];
|
|
|
|
} *EXTLIST;
|
|
|
|
|
|
|
|
static EXTLIST extensions;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
EXTLIST r;
|
|
|
|
int seq1;
|
|
|
|
int seq2;
|
|
|
|
void *sym;
|
1999-02-10 16:22:40 +00:00
|
|
|
int reqalgo;
|
1998-06-11 07:16:50 +00:00
|
|
|
} ENUMCONTEXT;
|
|
|
|
|
1998-10-16 16:00:17 +00:00
|
|
|
|
|
|
|
#ifdef HAVE_DLD_DLD_LINK
|
|
|
|
static char *mainpgm_path;
|
|
|
|
static int did_dld_init;
|
|
|
|
static int dld_available;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
1998-06-11 07:16:50 +00:00
|
|
|
/****************
|
|
|
|
* Register an extension module. The last registered module will
|
1998-06-25 10:19:08 +00:00
|
|
|
* be loaded first. A name may have a list of classes
|
|
|
|
* appended; e.g:
|
|
|
|
* mymodule.so(1:17,3:20,3:109)
|
|
|
|
* means that this module provides digest algorithm 17 and public key
|
|
|
|
* algorithms 20 and 109. This is only a hint but if it is there the
|
|
|
|
* loader may decide to only load a module which claims to have a
|
|
|
|
* requested algorithm.
|
1998-10-16 16:00:17 +00:00
|
|
|
*
|
|
|
|
* mainpgm is the path to the program which wants to load a module
|
|
|
|
* it is only used in some environments.
|
1998-06-11 07:16:50 +00:00
|
|
|
*/
|
|
|
|
void
|
1998-10-16 16:00:17 +00:00
|
|
|
register_cipher_extension( const char *mainpgm, const char *fname )
|
1998-06-11 07:16:50 +00:00
|
|
|
{
|
1998-11-25 11:52:41 +00:00
|
|
|
EXTLIST r, el, intex;
|
1998-06-25 10:19:08 +00:00
|
|
|
char *p, *pe;
|
1998-06-11 07:16:50 +00:00
|
|
|
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DLD_DLD_LINK
|
|
|
|
if( !mainpgm_path && mainpgm && *mainpgm )
|
|
|
|
mainpgm_path = m_strdup(mainpgm);
|
|
|
|
#endif
|
2001-08-20 11:53:05 +00:00
|
|
|
if( *fname != DIRSEP_C ) { /* do tilde expansion etc */
|
1999-02-16 13:16:33 +00:00
|
|
|
char *tmp;
|
1998-06-11 07:16:50 +00:00
|
|
|
|
2001-08-20 11:53:05 +00:00
|
|
|
if( strchr(fname, DIRSEP_C) )
|
1999-02-16 13:16:33 +00:00
|
|
|
tmp = make_filename(fname, NULL);
|
1998-06-11 07:16:50 +00:00
|
|
|
else
|
1999-02-16 13:16:33 +00:00
|
|
|
tmp = make_filename(GNUPG_LIBDIR, fname, NULL);
|
|
|
|
el = m_alloc_clear( sizeof *el + strlen(tmp) );
|
|
|
|
strcpy(el->name, tmp );
|
|
|
|
m_free(tmp);
|
1998-06-11 07:16:50 +00:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
el = m_alloc_clear( sizeof *el + strlen(fname) );
|
|
|
|
strcpy(el->name, fname );
|
|
|
|
}
|
1998-06-25 10:19:08 +00:00
|
|
|
/* check whether we have a class hint */
|
|
|
|
if( (p=strchr(el->name,'(')) && (pe=strchr(p+1,')')) && !pe[1] ) {
|
|
|
|
*p = *pe = 0;
|
|
|
|
el->hintstr = p+1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
el->hintstr = NULL;
|
|
|
|
|
1998-06-11 07:16:50 +00:00
|
|
|
/* check that it is not already registered */
|
1998-11-25 11:52:41 +00:00
|
|
|
intex = NULL;
|
|
|
|
for(r = extensions; r; r = r->next ) {
|
|
|
|
if( !compare_filenames(r->name, el->name) ) {
|
1998-12-29 13:47:31 +00:00
|
|
|
log_info("extension `%s' already registered\n", el->name );
|
1998-11-25 11:52:41 +00:00
|
|
|
m_free(el);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
else if( r->internal )
|
|
|
|
intex = r;
|
|
|
|
}
|
|
|
|
/* and register */
|
|
|
|
/* we put them after the internal extension modules */
|
|
|
|
/* this is so that the external modules do not get loaded */
|
|
|
|
/* as soon as the internal modules are requested */
|
|
|
|
if( intex ) {
|
|
|
|
el->next = intex->next;
|
|
|
|
intex->next = el;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
el->next = extensions;
|
|
|
|
extensions = el;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
register_internal_cipher_extension(
|
|
|
|
const char *module_id,
|
|
|
|
void * (*enumfunc)(int, int*, int*, int*)
|
|
|
|
)
|
|
|
|
{
|
|
|
|
EXTLIST r, el;
|
|
|
|
|
|
|
|
el = m_alloc_clear( sizeof *el + strlen(module_id) );
|
|
|
|
strcpy(el->name, module_id );
|
|
|
|
el->internal = 1;
|
|
|
|
|
|
|
|
/* check that it is not already registered */
|
|
|
|
for(r = extensions; r; r = r->next ) {
|
1998-06-11 07:16:50 +00:00
|
|
|
if( !compare_filenames(r->name, el->name) ) {
|
1998-12-29 13:47:31 +00:00
|
|
|
log_info("extension `%s' already registered\n", el->name );
|
1998-06-11 07:16:50 +00:00
|
|
|
m_free(el);
|
|
|
|
return;
|
|
|
|
}
|
1998-11-25 11:52:41 +00:00
|
|
|
}
|
1998-06-11 07:16:50 +00:00
|
|
|
/* and register */
|
1998-11-25 11:52:41 +00:00
|
|
|
el->enumfunc = enumfunc;
|
1999-05-22 20:54:54 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-11-25 11:52:41 +00:00
|
|
|
el->handle = (void*)1;
|
1999-05-17 20:03:24 +00:00
|
|
|
#else
|
|
|
|
el->handle = 1;
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
el->next = extensions;
|
|
|
|
extensions = el;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
load_extension( EXTLIST el )
|
|
|
|
{
|
1998-06-16 15:13:28 +00:00
|
|
|
#ifdef USE_DYNAMIC_LINKING
|
1998-06-11 07:16:50 +00:00
|
|
|
char **name;
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-06-11 07:16:50 +00:00
|
|
|
const char *err;
|
|
|
|
int seq = 0;
|
|
|
|
int class, vers;
|
1998-10-16 16:00:17 +00:00
|
|
|
void *sym;
|
|
|
|
#else
|
|
|
|
unsigned long addr;
|
|
|
|
int rc;
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
|
2001-04-17 16:20:32 +00:00
|
|
|
#ifndef __MINGW32__
|
1998-07-09 13:37:17 +00:00
|
|
|
/* make sure we are not setuid */
|
|
|
|
if( getuid() != geteuid() )
|
|
|
|
log_bug("trying to load an extension while still setuid\n");
|
2001-04-17 16:20:32 +00:00
|
|
|
#endif
|
1998-06-25 10:19:08 +00:00
|
|
|
|
1998-07-09 13:37:17 +00:00
|
|
|
/* now that we are not setuid anymore, we can safely load modules */
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-06-13 17:00:02 +00:00
|
|
|
el->handle = dlopen(el->name, RTLD_NOW);
|
1998-06-11 07:16:50 +00:00
|
|
|
if( !el->handle ) {
|
|
|
|
log_error("%s: error loading extension: %s\n", el->name, dlerror() );
|
|
|
|
goto failure;
|
|
|
|
}
|
1998-12-12 17:44:34 +00:00
|
|
|
name = (char**)dlsym(el->handle, SYMBOL_VERSION);
|
1998-06-11 07:16:50 +00:00
|
|
|
if( (err=dlerror()) ) {
|
|
|
|
log_error("%s: not a gnupg extension: %s\n", el->name, err );
|
|
|
|
goto failure;
|
|
|
|
}
|
1998-10-16 16:00:17 +00:00
|
|
|
#else /* have dld */
|
|
|
|
if( !did_dld_init ) {
|
|
|
|
did_dld_init = 1;
|
|
|
|
if( !mainpgm_path )
|
|
|
|
log_error("DLD is not correctly initialized\n");
|
|
|
|
else {
|
|
|
|
rc = dld_init( dld_find_executable(mainpgm_path) );
|
|
|
|
if( rc )
|
|
|
|
log_error("DLD init failed: %s\n", dld_strerror(rc) );
|
|
|
|
else
|
|
|
|
dld_available = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if( !dld_available ) {
|
|
|
|
log_error("%s: DLD not available\n", el->name );
|
|
|
|
goto failure;
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = dld_link( el->name );
|
|
|
|
if( rc ) {
|
|
|
|
log_error("%s: error loading extension: %s\n",
|
|
|
|
el->name, dld_strerror(rc) );
|
|
|
|
goto failure;
|
|
|
|
}
|
1998-12-12 17:44:34 +00:00
|
|
|
addr = dld_get_symbol(SYMBOL_VERSION);
|
1998-10-16 16:00:17 +00:00
|
|
|
if( !addr ) {
|
|
|
|
log_error("%s: not a gnupg extension: %s\n",
|
|
|
|
el->name, dld_strerror(dld_errno) );
|
|
|
|
goto failure;
|
|
|
|
}
|
|
|
|
name = (char**)addr;
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
|
1998-12-10 19:20:47 +00:00
|
|
|
if( g10_opt_verbose > 1 )
|
1998-06-25 10:19:08 +00:00
|
|
|
log_info("%s: %s%s%s%s\n", el->name, *name,
|
|
|
|
el->hintstr? " (":"",
|
|
|
|
el->hintstr? el->hintstr:"",
|
|
|
|
el->hintstr? ")":"");
|
1998-06-11 07:16:50 +00:00
|
|
|
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-12-12 17:44:34 +00:00
|
|
|
sym = dlsym(el->handle, SYMBOL_ENUM);
|
1998-06-11 07:16:50 +00:00
|
|
|
if( (err=dlerror()) ) {
|
|
|
|
log_error("%s: invalid gnupg extension: %s\n", el->name, err );
|
|
|
|
goto failure;
|
|
|
|
}
|
|
|
|
el->enumfunc = (void *(*)(int,int*,int*,int*))sym;
|
1998-10-16 16:00:17 +00:00
|
|
|
#else /* dld */
|
1998-12-12 17:44:34 +00:00
|
|
|
addr = dld_get_func(SYMBOL_ENUM);
|
1998-10-16 16:00:17 +00:00
|
|
|
if( !addr ) {
|
|
|
|
log_error("%s: invalid gnupg extension: %s\n",
|
|
|
|
el->name, dld_strerror(dld_errno) );
|
|
|
|
goto failure;
|
|
|
|
}
|
1998-12-12 17:44:34 +00:00
|
|
|
rc = dld_function_executable_p(SYMBOL_ENUM);
|
1998-10-16 16:00:17 +00:00
|
|
|
if( rc ) {
|
|
|
|
log_error("%s: extension function is not executable: %s\n",
|
|
|
|
el->name, dld_strerror(rc) );
|
|
|
|
goto failure;
|
|
|
|
}
|
|
|
|
el->enumfunc = (void *(*)(int,int*,int*,int*))addr;
|
|
|
|
el->handle = 1; /* mark as usable */
|
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-12-10 19:20:47 +00:00
|
|
|
if( g10_opt_verbose > 2 ) {
|
1998-06-13 17:00:02 +00:00
|
|
|
/* list the contents of the module */
|
|
|
|
while( (sym = (*el->enumfunc)(0, &seq, &class, &vers)) ) {
|
|
|
|
if( vers != 1 ) {
|
|
|
|
log_info("%s: ignoring func with version %d\n",el->name,vers);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
switch( class ) {
|
|
|
|
case 11:
|
|
|
|
case 21:
|
|
|
|
case 31:
|
|
|
|
log_info("%s: provides %s algorithm %d\n", el->name,
|
|
|
|
class == 11? "md" :
|
|
|
|
class == 21? "cipher" : "pubkey",
|
|
|
|
*(int*)sym);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/*log_debug("%s: skipping class %d\n", el->name, class);*/
|
|
|
|
break;
|
|
|
|
}
|
1998-06-11 07:16:50 +00:00
|
|
|
}
|
|
|
|
}
|
1998-10-16 16:00:17 +00:00
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
failure:
|
1998-10-16 16:00:17 +00:00
|
|
|
#ifdef HAVE_DL_DLOPEN
|
1998-06-11 07:16:50 +00:00
|
|
|
if( el->handle ) {
|
|
|
|
dlclose(el->handle);
|
|
|
|
el->handle = NULL;
|
|
|
|
}
|
1998-10-16 16:00:17 +00:00
|
|
|
#endif
|
1998-06-11 07:16:50 +00:00
|
|
|
el->failed = 1;
|
1998-06-16 15:13:28 +00:00
|
|
|
#endif /*USE_DYNAMIC_LINKING*/
|
1998-06-11 07:16:50 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifdef __riscos__
|
|
|
|
typedef
|
|
|
|
const char *(*DIGESTS_CAST)(int, size_t*,byte**, int*, int*,
|
|
|
|
void (**)(void*),
|
|
|
|
void (**)(void*,byte*,size_t),
|
|
|
|
void (**)(void*),byte *(**)(void*));
|
|
|
|
#endif /* __riscos__ */
|
1998-06-11 07:16:50 +00:00
|
|
|
|
1998-06-16 15:13:28 +00:00
|
|
|
int
|
|
|
|
enum_gnupgext_digests( void **enum_context,
|
|
|
|
int *algo,
|
|
|
|
const char *(**r_get_info)( int, size_t*,byte**, int*, int*,
|
|
|
|
void (**)(void*),
|
|
|
|
void (**)(void*,byte*,size_t),
|
|
|
|
void (**)(void*),byte *(**)(void*)) )
|
|
|
|
{
|
|
|
|
EXTLIST r;
|
|
|
|
ENUMCONTEXT *ctx;
|
|
|
|
|
|
|
|
if( !*enum_context ) { /* init context */
|
|
|
|
ctx = m_alloc_clear( sizeof( *ctx ) );
|
|
|
|
ctx->r = extensions;
|
1999-02-10 16:22:40 +00:00
|
|
|
ctx->reqalgo = *algo;
|
1998-06-16 15:13:28 +00:00
|
|
|
*enum_context = ctx;
|
|
|
|
}
|
|
|
|
else if( !algo ) { /* release the context */
|
|
|
|
m_free(*enum_context);
|
|
|
|
*enum_context = NULL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ctx = *enum_context;
|
|
|
|
|
|
|
|
for( r = ctx->r; r; r = r->next ) {
|
|
|
|
int class, vers;
|
|
|
|
|
|
|
|
if( r->failed )
|
|
|
|
continue;
|
|
|
|
if( !r->handle && load_extension(r) )
|
|
|
|
continue;
|
|
|
|
/* get a digest info function */
|
|
|
|
if( ctx->sym )
|
|
|
|
goto inner_loop;
|
|
|
|
while( (ctx->sym = (*r->enumfunc)(10, &ctx->seq1, &class, &vers)) ) {
|
|
|
|
void *sym;
|
|
|
|
/* must check class because enumfunc may be wrong coded */
|
|
|
|
if( vers != 1 || class != 10 )
|
|
|
|
continue;
|
|
|
|
inner_loop:
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifndef __riscos__
|
1998-06-16 15:13:28 +00:00
|
|
|
*r_get_info = ctx->sym;
|
2001-08-20 11:53:05 +00:00
|
|
|
#else /* __riscos__ */
|
|
|
|
*r_get_info = (DIGESTS_CAST) ctx->sym;
|
|
|
|
#endif /* __riscos__ */
|
1998-06-16 15:13:28 +00:00
|
|
|
while( (sym = (*r->enumfunc)(11, &ctx->seq2, &class, &vers)) ) {
|
|
|
|
if( vers != 1 || class != 11 )
|
|
|
|
continue;
|
|
|
|
*algo = *(int*)sym;
|
|
|
|
ctx->r = r;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
ctx->seq2 = 0;
|
|
|
|
}
|
|
|
|
ctx->seq1 = 0;
|
|
|
|
}
|
|
|
|
ctx->r = r;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifdef __riscos__
|
|
|
|
typedef
|
|
|
|
const char *(*CIPHERS_CAST)(int, size_t*, size_t*, size_t*,
|
|
|
|
int (**)( void *, byte *, unsigned),
|
|
|
|
void (**)( void *, byte *, byte *),
|
|
|
|
void (**)( void *, byte *, byte *));
|
|
|
|
#endif /* __riscos__ */
|
|
|
|
|
1998-06-11 07:16:50 +00:00
|
|
|
const char *
|
|
|
|
enum_gnupgext_ciphers( void **enum_context, int *algo,
|
|
|
|
size_t *keylen, size_t *blocksize, size_t *contextsize,
|
1999-02-16 13:16:33 +00:00
|
|
|
int (**setkeyf)( void *c, byte *key, unsigned keylen ),
|
|
|
|
void (**encryptf)( void *c, byte *outbuf, byte *inbuf ),
|
|
|
|
void (**decryptf)( void *c, byte *outbuf, byte *inbuf )
|
1998-06-11 07:16:50 +00:00
|
|
|
)
|
|
|
|
{
|
|
|
|
EXTLIST r;
|
|
|
|
ENUMCONTEXT *ctx;
|
|
|
|
const char * (*finfo)(int, size_t*, size_t*, size_t*,
|
1998-09-14 15:49:56 +00:00
|
|
|
int (**)( void *, byte *, unsigned),
|
1998-06-11 07:16:50 +00:00
|
|
|
void (**)( void *, byte *, byte *),
|
|
|
|
void (**)( void *, byte *, byte *));
|
|
|
|
|
|
|
|
if( !*enum_context ) { /* init context */
|
|
|
|
ctx = m_alloc_clear( sizeof( *ctx ) );
|
|
|
|
ctx->r = extensions;
|
|
|
|
*enum_context = ctx;
|
|
|
|
}
|
|
|
|
else if( !algo ) { /* release the context */
|
|
|
|
m_free(*enum_context);
|
|
|
|
*enum_context = NULL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ctx = *enum_context;
|
|
|
|
|
|
|
|
for( r = ctx->r; r; r = r->next ) {
|
|
|
|
int class, vers;
|
1998-06-09 15:14:06 +00:00
|
|
|
|
1998-06-11 07:16:50 +00:00
|
|
|
if( r->failed )
|
|
|
|
continue;
|
|
|
|
if( !r->handle && load_extension(r) )
|
|
|
|
continue;
|
|
|
|
/* get a cipher info function */
|
|
|
|
if( ctx->sym )
|
|
|
|
goto inner_loop;
|
|
|
|
while( (ctx->sym = (*r->enumfunc)(20, &ctx->seq1, &class, &vers)) ) {
|
|
|
|
void *sym;
|
|
|
|
/* must check class because enumfunc may be wrong coded */
|
|
|
|
if( vers != 1 || class != 20 )
|
|
|
|
continue;
|
|
|
|
inner_loop:
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifndef __riscos__
|
1998-06-11 07:16:50 +00:00
|
|
|
finfo = ctx->sym;
|
2001-08-20 11:53:05 +00:00
|
|
|
#else /* __riscos__ */
|
|
|
|
finfo = (CIPHERS_CAST) ctx->sym;
|
|
|
|
#endif /* __riscos__ */
|
1998-06-11 07:16:50 +00:00
|
|
|
while( (sym = (*r->enumfunc)(21, &ctx->seq2, &class, &vers)) ) {
|
|
|
|
const char *algname;
|
|
|
|
if( vers != 1 || class != 21 )
|
|
|
|
continue;
|
|
|
|
*algo = *(int*)sym;
|
|
|
|
algname = (*finfo)( *algo, keylen, blocksize, contextsize,
|
1999-02-16 13:16:33 +00:00
|
|
|
setkeyf, encryptf, decryptf );
|
1998-06-13 17:00:02 +00:00
|
|
|
if( algname ) {
|
|
|
|
ctx->r = r;
|
|
|
|
return algname;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ctx->seq2 = 0;
|
|
|
|
}
|
|
|
|
ctx->seq1 = 0;
|
|
|
|
}
|
|
|
|
ctx->r = r;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifdef __riscos__
|
|
|
|
typedef
|
|
|
|
const char *(*PUBKEYS_CAST)(int, int *, int *, int *, int *, int *,
|
|
|
|
int (**)(int, unsigned, MPI *, MPI **),
|
|
|
|
int (**)(int, MPI *),
|
|
|
|
int (**)(int, MPI *, MPI , MPI *),
|
|
|
|
int (**)(int, MPI *, MPI *, MPI *),
|
|
|
|
int (**)(int, MPI *, MPI , MPI *),
|
|
|
|
int (**)(int, MPI , MPI *, MPI *,
|
|
|
|
int (*)(void*,MPI), void *),
|
|
|
|
unsigned (**)( int , MPI *));
|
|
|
|
#endif /* __riscos__ */
|
|
|
|
|
1998-06-13 17:00:02 +00:00
|
|
|
const char *
|
|
|
|
enum_gnupgext_pubkeys( void **enum_context, int *algo,
|
1999-02-16 13:16:33 +00:00
|
|
|
int *npkey, int *nskey, int *nenc, int *nsig, int *use,
|
1998-06-13 17:00:02 +00:00
|
|
|
int (**generate)( int algo, unsigned nbits, MPI *skey, MPI **retfactors ),
|
|
|
|
int (**check_secret_key)( int algo, MPI *skey ),
|
1999-02-16 13:16:33 +00:00
|
|
|
int (**encryptf)( int algo, MPI *resarr, MPI data, MPI *pkey ),
|
|
|
|
int (**decryptf)( int algo, MPI *result, MPI *data, MPI *skey ),
|
1998-06-13 17:00:02 +00:00
|
|
|
int (**sign)( int algo, MPI *resarr, MPI data, MPI *skey ),
|
1998-06-15 15:41:04 +00:00
|
|
|
int (**verify)( int algo, MPI hash, MPI *data, MPI *pkey,
|
|
|
|
int (*cmp)(void *, MPI), void *opaquev ),
|
1998-06-13 17:00:02 +00:00
|
|
|
unsigned (**get_nbits)( int algo, MPI *pkey ) )
|
|
|
|
{
|
|
|
|
EXTLIST r;
|
|
|
|
ENUMCONTEXT *ctx;
|
|
|
|
const char * (*finfo)( int, int *, int *, int *, int *, int *,
|
|
|
|
int (**)( int, unsigned, MPI *, MPI **),
|
|
|
|
int (**)( int, MPI * ),
|
|
|
|
int (**)( int, MPI *, MPI , MPI * ),
|
|
|
|
int (**)( int, MPI *, MPI *, MPI * ),
|
|
|
|
int (**)( int, MPI *, MPI , MPI * ),
|
1998-06-15 15:41:04 +00:00
|
|
|
int (**)( int, MPI , MPI *, MPI *,
|
|
|
|
int (*)(void*,MPI), void *),
|
1998-06-13 17:00:02 +00:00
|
|
|
unsigned (**)( int , MPI * ) );
|
|
|
|
|
|
|
|
if( !*enum_context ) { /* init context */
|
|
|
|
ctx = m_alloc_clear( sizeof( *ctx ) );
|
|
|
|
ctx->r = extensions;
|
|
|
|
*enum_context = ctx;
|
|
|
|
}
|
|
|
|
else if( !algo ) { /* release the context */
|
|
|
|
m_free(*enum_context);
|
|
|
|
*enum_context = NULL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ctx = *enum_context;
|
|
|
|
|
|
|
|
for( r = ctx->r; r; r = r->next ) {
|
|
|
|
int class, vers;
|
|
|
|
|
|
|
|
if( r->failed )
|
|
|
|
continue;
|
|
|
|
if( !r->handle && load_extension(r) )
|
|
|
|
continue;
|
|
|
|
/* get a pubkey info function */
|
|
|
|
if( ctx->sym )
|
|
|
|
goto inner_loop;
|
|
|
|
while( (ctx->sym = (*r->enumfunc)(30, &ctx->seq1, &class, &vers)) ) {
|
|
|
|
void *sym;
|
|
|
|
if( vers != 1 || class != 30 )
|
|
|
|
continue;
|
|
|
|
inner_loop:
|
2001-08-20 11:53:05 +00:00
|
|
|
#ifndef __riscos__
|
1998-06-13 17:00:02 +00:00
|
|
|
finfo = ctx->sym;
|
2001-08-20 11:53:05 +00:00
|
|
|
#else /* __riscos__ */
|
|
|
|
finfo = (PUBKEYS_CAST) ctx->sym;
|
|
|
|
#endif /* __riscos__ */
|
1998-06-13 17:00:02 +00:00
|
|
|
while( (sym = (*r->enumfunc)(31, &ctx->seq2, &class, &vers)) ) {
|
|
|
|
const char *algname;
|
|
|
|
if( vers != 1 || class != 31 )
|
|
|
|
continue;
|
|
|
|
*algo = *(int*)sym;
|
1999-02-16 13:16:33 +00:00
|
|
|
algname = (*finfo)( *algo, npkey, nskey, nenc, nsig, use,
|
|
|
|
generate, check_secret_key, encryptf,
|
|
|
|
decryptf, sign, verify, get_nbits );
|
1998-06-11 07:16:50 +00:00
|
|
|
if( algname ) {
|
|
|
|
ctx->r = r;
|
|
|
|
return algname;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ctx->seq2 = 0;
|
|
|
|
}
|
|
|
|
ctx->seq1 = 0;
|
|
|
|
}
|
|
|
|
ctx->r = r;
|
|
|
|
return NULL;
|
|
|
|
}
|
1998-06-09 15:14:06 +00:00
|
|
|
|
1998-11-25 11:52:41 +00:00
|
|
|
|
|
|
|
int (*
|
1998-12-14 20:22:42 +00:00
|
|
|
dynload_getfnc_gather_random())(void (*)(const void*, size_t, int), int,
|
|
|
|
size_t, int)
|
1998-11-25 11:52:41 +00:00
|
|
|
{
|
|
|
|
EXTLIST r;
|
|
|
|
void *sym;
|
|
|
|
|
|
|
|
for( r = extensions; r; r = r->next ) {
|
|
|
|
int seq, class, vers;
|
|
|
|
|
|
|
|
if( r->failed )
|
|
|
|
continue;
|
|
|
|
if( !r->handle && load_extension(r) )
|
|
|
|
continue;
|
|
|
|
seq = 0;
|
|
|
|
while( (sym = (*r->enumfunc)(40, &seq, &class, &vers)) ) {
|
|
|
|
if( vers != 1 || class != 40 )
|
|
|
|
continue;
|
1998-12-14 20:22:42 +00:00
|
|
|
return (int (*)(void (*)(const void*, size_t, int), int,
|
|
|
|
size_t, int))sym;
|
1998-11-25 11:52:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void (*
|
1998-12-14 20:22:42 +00:00
|
|
|
dynload_getfnc_fast_random_poll())( void (*)(const void*, size_t, int), int)
|
1998-11-25 11:52:41 +00:00
|
|
|
{
|
|
|
|
EXTLIST r;
|
|
|
|
void *sym;
|
|
|
|
|
|
|
|
for( r = extensions; r; r = r->next ) {
|
|
|
|
int seq, class, vers;
|
|
|
|
|
|
|
|
if( r->failed )
|
|
|
|
continue;
|
|
|
|
if( !r->handle && load_extension(r) )
|
|
|
|
continue;
|
|
|
|
seq = 0;
|
|
|
|
while( (sym = (*r->enumfunc)(41, &seq, &class, &vers)) ) {
|
|
|
|
if( vers != 1 || class != 41 )
|
|
|
|
continue;
|
1998-12-14 20:22:42 +00:00
|
|
|
return (void (*)( void (*)(const void*, size_t, int), int))sym;
|
1998-11-25 11:52:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|