Show Table of Contents
Chapter 32. Functions for Handling Matching Rules
This chapter contains reference information on matching rule routines.
Table 32.1. Matching Rule Routines
| Function | Description |
|---|---|
| slapi_berval_cmp() | Compares two berval structures to determine if they are equal. |
| slapi_matchingrule_free() | Frees the specified matching rule structure (and, optionally, its members) from memory. |
| slapi_matchingrule_get() | Gets information about a matching rule. |
| slapi_matchingrule_is_ordering() | Determines if a matching rule is a valid ordering matching rule for the given syntax. |
| slapi_matchingrule_new() | Allocates memory for a new Slapi_MatchingRuleEntry structure. |
| slapi_matchingrule_register() | Registers the specified matching rule with the server. |
| slapi_matchingrule_set() | Sets information about the matching rule. |
| slapi_matchingrule_unregister() | Placeholder for future function. Currently, this function does nothing. |
| slapi_mr_filter_index() | Calls the indexer function associated with an extensible match filter. |
| slapi_mr_indexer_create() | Calls the indexer factory function for the plug-in responsible for a specified matching rule. |
32.1. slapi_berval_cmp()
Compares two berval structures to determine if they are equal.
Syntax
#include "slapi-plugin.h" int slapi_berval_cmp (const struct berval *L, const struct berval *R);
Parameters
This function takes the following parameters:
|
l
| Pointer to the first berval structure that you want to compare. |
|
R
| Pointer to the second structure that you want to compare. |
Returns
This function returns one of the following values:
- A negative value if L is less than R.
0if L is equal to R.- A positive value if L is greater than R.

Where did the comment section go?
Red Hat's documentation publication system recently went through an upgrade to enable speedier, more mobile-friendly content. We decided to re-evaluate our commenting platform to ensure that it meets your expectations and serves as an optimal feedback mechanism. During this redesign, we invite your input on providing feedback on Red Hat documentation via the discussion platform.