/** BEGIN COPYRIGHT BLOCK * This Program is free software; you can redistribute it and/or modify it under * the terms of the GNU General Public License as published by the Free Software * Foundation; version 2 of the License. * * This Program is distributed in the hope that it will be useful, 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. * * In addition, as a special exception, Red Hat, Inc. gives You the additional * right to link the code of this Program with code not covered under the GNU * General Public License ("Non-GPL Code") and to distribute linked combinations * including the two, subject to the limitations in this paragraph. Non-GPL Code * permitted under this exception must only link to the code of this Program * through those well defined interfaces identified in the file named EXCEPTION * found in the source code files (the "Approved Interfaces"). The files of * Non-GPL Code may instantiate templates or use macros or inline functions from * the Approved Interfaces without causing the resulting work to be covered by * the GNU General Public License. Only Red Hat, Inc. may make changes or * additions to the list of Approved Interfaces. You must obey the GNU General * Public License in all respects for all of the Program code and other code used * in conjunction with the Program except the Non-GPL Code covered by this * exception. If you modify this file, you may extend this exception to your * version of the file, but you are not obligated to do so. If you do not wish to * provide this exception without modification, you must delete this exception * statement from your version and license this file solely under the GPL without * exception. * * * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission. * Copyright (C) 2005 Red Hat, Inc. * All rights reserved. * END COPYRIGHT BLOCK **/ #ifdef HAVE_CONFIG_H # include #endif /* * Copyright (c) 1995 Regents of the University of Michigan. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that this notice is preserved and that due credit is given * to the University of Michigan at Ann Arbor. The name of the University * may not be used to endorse or promote products derived from this * software without specific prior written permission. This software * is provided ``as is'' without express or implied warranty. */ #include #include #include #include #ifndef _WIN32 #include #endif #include "slap.h" #include "fe.h" #if defined( SLAPD_MONITOR_DN ) int monitor_info(Slapi_PBlock *pb, Slapi_Entry* e, Slapi_Entry* entryAfter, int *returncode, char *returntext, void *arg) { char buf[BUFSIZ]; struct berval val; struct berval *vals[2]; time_t curtime = current_time(); struct tm utm; Slapi_Backend *be; char *cookie; vals[0] = &val; vals[1] = NULL; /* "version" value */ val.bv_val = slapd_get_version_value(); val.bv_len = strlen( val.bv_val ); attrlist_replace( &e->e_attrs, "version", vals ); slapi_ch_free( (void **) &val.bv_val ); val.bv_len = PR_snprintf( buf, sizeof(buf), "%d", g_get_active_threadcnt() ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "threads", vals ); connection_table_as_entry(the_connection_table, e); val.bv_len = PR_snprintf( buf, sizeof(buf), "%" NSPRIu64, slapi_counter_get_value(ops_initiated) ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "opsinitiated", vals ); val.bv_len = PR_snprintf( buf, sizeof(buf), "%" NSPRIu64, slapi_counter_get_value(ops_completed) ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "opscompleted", vals ); val.bv_len = PR_snprintf ( buf, sizeof(buf), "%" NSPRIu64, g_get_num_entries_sent() ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "entriessent", vals ); val.bv_len = PR_snprintf ( buf, sizeof(buf), "%" NSPRIu64, g_get_num_bytes_sent() ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "bytessent", vals ); #ifdef _WIN32 { struct tm *pt; pt = gmtime( &curtime ); memcpy(&utm, pt, sizeof(struct tm) ); } #else gmtime_r( &curtime, &utm ); #endif strftime( buf, sizeof(buf), "%Y%m%d%H%M%SZ", &utm ); val.bv_val = buf; val.bv_len = strlen( buf ); attrlist_replace( &e->e_attrs, "currenttime", vals ); #ifdef _WIN32 { struct tm *pt; pt = gmtime( &starttime ); memcpy(&utm, pt, sizeof(struct tm) ); } #else gmtime_r( &starttime, &utm ); #endif strftime( buf, sizeof(buf), "%Y%m%d%H%M%SZ", &utm ); val.bv_val = buf; val.bv_len = strlen( buf ); attrlist_replace( &e->e_attrs, "starttime", vals ); val.bv_len = PR_snprintf( buf, sizeof(buf), "%d", be_nbackends_public() ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "nbackends", vals ); #ifdef THREAD_SUNOS5_LWP val.bv_len = PR_snprintf( buf, sizeof(buf), "%d", thr_getconcurrency() ); val.bv_val = buf; attrlist_replace( &e->e_attrs, "concurrency", vals ); #endif /*Loop through the backends, and stuff the monitordns into the entry we're sending back*/ attrlist_delete( &e->e_attrs, "backendmonitordn"); cookie = NULL; be = slapi_get_first_backend(&cookie); while (be) { if ( !be->be_private ) { Slapi_DN dn; slapi_sdn_init(&dn); be_getmonitordn(be,&dn); val.bv_val = (char*)slapi_sdn_get_dn(&dn); val.bv_len = strlen( val.bv_val ); attrlist_merge( &e->e_attrs, "backendmonitordn", vals ); slapi_sdn_done(&dn); } be = slapi_get_next_backend(cookie); } slapi_ch_free((void **)&cookie); *returncode= LDAP_SUCCESS; return SLAPI_DSE_CALLBACK_OK; } #endif /* SLAPD_MONITOR_DN */ /* * Return a malloc'd version value. * Used for the monitor entry's 'version' attribute. * Used for the root DSE's 'vendorVersion' attribute. */ char * slapd_get_version_value( void ) { char *versionstring, *buildnum, *vs; versionstring = config_get_versionstring(); buildnum = config_get_buildnum(); vs = slapi_ch_smprintf("%s B%s", versionstring, buildnum ); slapi_ch_free( (void **) &buildnum); slapi_ch_free( (void **) &versionstring); return vs; }