snmp_mipSecViolationEntry.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 1999-2003 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
*
* This file contains the SNMP routines used to retrieve
* the Mobility Agent's Security Violation Information.
*/
#include <string.h>
#include <stdlib.h>
#include <impl.h>
#include <snmp.h>
#include "snmp_stub.h"
#include "agent.h"
/*
* This table stores all of the Security Violations
*/
/*
* Function: get_mipSecViolationEntry
*
* Arguments: search_type - The type of search (first, next, exact)
* mipSecViolationEntry_data - Pointer to a pointer which
* will contain the Security Violation entry
* upon successful completion.
* index - Pointer to the current index
*
* Description: This function will allocate the memory required for
* the Security Violation entry, and will find the
* appropriate Security Violation based on the index
* provided. If the search type is set to FIRST_ENTRY,
* we will return the first Security Assocication in the
* Hash Table, otherwise the index is used.
*
* The Security Violation entry is then setup with the
* values found in the entry from the hash table and
* returned to the caller.
*
* Note, the caller is responsible for either freeing the
* memory, or calling free_mipSecViolationEntry()
*
* Returns: int, 0 if successful
*/
extern int
{
int i;
int j;
int return_code = SNMP_ERR_NOERROR;
char buffer[258];
/*
* Allocate some memory to handle the request.
*/
sizeof (MipSecViolationEntry_t));
if (mipSecViolationEntry_data == NULL) {
return (SNMP_ERR_GENERR);
}
/*
* In the case, the search_type is FIRST_ENTRY or NEXT_ENTRY
* this function should modify the index argument to the
* appropriate value
*/
switch (search_type) {
case FIRST_ENTRY:
/*
* We are looking for the first entry in the list.
*/
break;
case NEXT_ENTRY:
/*
* Increment the index value.
*/
break;
case EXACT_ENTRY:
/*
* We don't need to play around with the
* index for this search type.
*/
break;
default:
goto the_end;
}
/*
* Now search for the entry... the problem here is that
* the Security Association Information spans three different
* tables, so we need to look through each one.
*/
if (mipSecViolationHash.buckets[i]) {
/*
* Lock the bucket
*/
/*
* Lock the node
*/
(void) rw_rdlock(
break;
}
j++;
}
/*
* Unlock the bucket
*/
}
}
if (mipSecViolationEntry == NULL) {
goto the_end;
}
/*
* Return the address of the offender.
*/
goto the_end;
}
/*
* And now we return the number of security violations
* for this entry.
*/
/*
* And now we return the SPI used.
*/
/*
* And now we return time of the last violation.
*/
integer =
/*
* And now we return the low order bits of the Identifier used.
*/
integer =
/*
* And now we return the high order bits of the Identifier used.
*/
integer =
/*
* And finally, the reason for the violation.
*/
integer =
if (mipSecViolationEntry != NULL) {
/*
* Unlock the node
*/
}
if (return_code != SNMP_ERR_NOERROR) {
}
return (return_code);
}
/*
* Function: free_mipSecViolationEntry
*
* Arguments: mipSecViolationEntry - Pointer to a previously
* allocated SNMP Security Violation
* entry
*
* Description: This function is called to free a previously
* allocated SNMP Security Violation entry.
*
* Returns:
*/
void
{
if (mipSecViolationEntry) {
string =
}
}
}