openldap/servers/slapd/oidm.c

184 lines
4.2 KiB
C
Raw Normal View History

2003-11-27 09:17:14 +08:00
/* oidm.c - object identifier macro routines */
/* $OpenLDAP$ */
2003-11-27 09:17:14 +08:00
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
2005-01-02 04:49:32 +08:00
* Copyright 1998-2005 The OpenLDAP Foundation.
2003-11-27 09:17:14 +08:00
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/ctype.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "slap.h"
2005-03-02 02:05:23 +08:00
#include "lutil.h"
static LDAP_SLIST_HEAD(OidMacroList, slap_oid_macro) om_list
= LDAP_SLIST_HEAD_INITIALIZER(om_list);
/* Replace an OID Macro invocation with its full numeric OID.
* If the macro is used with "macroname:suffix" append ".suffix"
* to the expansion.
*/
char *
oidm_find(char *oid)
{
OidMacro *om;
/* OID macros must start alpha */
if ( OID_LEADCHAR( *oid ) ) {
return oid;
}
LDAP_SLIST_FOREACH( om, &om_list, som_next ) {
2005-03-02 02:05:23 +08:00
BerVarray names = om->som_names;
if( names == NULL ) {
continue;
}
2005-03-02 02:05:23 +08:00
for( ; !BER_BVISNULL( names ) ; names++ ) {
int pos = dscompare(names->bv_val, oid, ':');
if( pos ) {
int suflen = strlen(oid + pos);
char *tmp = SLAP_MALLOC( om->som_oid.bv_len
+ suflen + 1);
if( tmp == NULL ) {
Debug( LDAP_DEBUG_ANY,
"oidm_find: SLAP_MALLOC failed", 0, 0, 0 );
return NULL;
}
strcpy(tmp, om->som_oid.bv_val);
if( suflen ) {
suflen = om->som_oid.bv_len;
tmp[suflen++] = '.';
strcpy(tmp+suflen, oid+pos+1);
}
return tmp;
}
}
}
return NULL;
}
void
oidm_destroy()
{
2003-03-01 11:37:16 +08:00
OidMacro *om;
while( !LDAP_SLIST_EMPTY( &om_list )) {
om = LDAP_SLIST_FIRST( &om_list );
2003-03-28 18:24:16 +08:00
LDAP_SLIST_REMOVE_HEAD( &om_list, som_next );
2005-03-02 02:05:23 +08:00
ber_bvarray_free(om->som_names);
ber_bvarray_free(om->som_subs);
free(om->som_oid.bv_val);
free(om);
}
}
int
parse_oidm(
const char *fname,
int lineno,
int argc,
2003-02-26 15:39:30 +08:00
char **argv )
{
char *oid;
OidMacro *om;
2005-03-02 02:05:23 +08:00
struct berval bv;
if (argc != 3) {
fprintf( stderr, "%s: line %d: too many arguments\n",
fname, lineno );
usage: fprintf( stderr, "\tObjectIdentifier <name> <oid>\n");
return 1;
}
oid = oidm_find( argv[1] );
if( oid != NULL ) {
fprintf( stderr,
"%s: line %d: "
"ObjectIdentifier \"%s\" previously defined \"%s\"",
fname, lineno, argv[1], oid );
return 1;
}
om = (OidMacro *) SLAP_MALLOC( sizeof(OidMacro) );
if( om == NULL ) {
Debug( LDAP_DEBUG_ANY, "parse_oidm: SLAP_MALLOC failed", 0, 0, 0 );
return 1;
}
2003-02-26 15:39:30 +08:00
LDAP_SLIST_NEXT( om, som_next ) = NULL;
om->som_names = NULL;
2005-03-02 02:05:23 +08:00
om->som_subs = NULL;
ber_str2bv( argv[1], 0, 1, &bv );
ber_bvarray_add( &om->som_names, &bv );
ber_str2bv( argv[2], 0, 1, &bv );
ber_bvarray_add( &om->som_subs, &bv );
om->som_oid.bv_val = oidm_find( argv[2] );
if (!om->som_oid.bv_val) {
fprintf( stderr, "%s: line %d: OID %s not recognized\n",
fname, lineno, argv[2] );
goto usage;
}
if (om->som_oid.bv_val == argv[2]) {
om->som_oid.bv_val = ch_strdup( argv[2] );
}
om->som_oid.bv_len = strlen( om->som_oid.bv_val );
LDAP_SLIST_INSERT_HEAD( &om_list, om, som_next );
return 0;
}
2005-03-02 02:05:23 +08:00
void oidm_unparse( BerVarray *res )
{
OidMacro *om;
int i, j, num;
struct berval bv, *bva = NULL, idx;
char ibuf[32], *ptr;
/* count the result size */
i = 0;
LDAP_SLIST_FOREACH( om, &om_list, som_next ) {
for ( j=0; !BER_BVISNULL(&om->som_names[j]); j++ );
i += j;
}
num = i;
bva = ch_malloc( (num+1) * sizeof(struct berval) );
BER_BVZERO( bva+num );
idx.bv_val = ibuf;
LDAP_SLIST_FOREACH( om, &om_list, som_next ) {
for ( j=0; !BER_BVISNULL(&om->som_names[j]); j++ );
for ( i=num-j, j=0; i<num; i++,j++ ) {
idx.bv_len = sprintf(idx.bv_val, "{%d}", i );
bva[i].bv_len = idx.bv_len + om->som_names[j].bv_len +
om->som_subs[j].bv_len + 1;
bva[i].bv_val = ch_malloc( bva[i].bv_len + 1 );
ptr = lutil_strcopy( bva[i].bv_val, ibuf );
ptr = lutil_strcopy( ptr, om->som_names[j].bv_val );
*ptr++ = ' ';
ptr = lutil_strcopy( ptr, om->som_subs[j].bv_val );
}
num -= j;
}
*res = bva;
}