int.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  1. /** BEGIN COPYRIGHT BLOCK
  2. * This Program is free software; you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation; version 2 of the License.
  5. *
  6. * This Program is distributed in the hope that it will be useful, but WITHOUT
  7. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  8. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  9. *
  10. * You should have received a copy of the GNU General Public License along with
  11. * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
  12. * Place, Suite 330, Boston, MA 02111-1307 USA.
  13. *
  14. * In addition, as a special exception, Red Hat, Inc. gives You the additional
  15. * right to link the code of this Program with code not covered under the GNU
  16. * General Public License ("Non-GPL Code") and to distribute linked combinations
  17. * including the two, subject to the limitations in this paragraph. Non-GPL Code
  18. * permitted under this exception must only link to the code of this Program
  19. * through those well defined interfaces identified in the file named EXCEPTION
  20. * found in the source code files (the "Approved Interfaces"). The files of
  21. * Non-GPL Code may instantiate templates or use macros or inline functions from
  22. * the Approved Interfaces without causing the resulting work to be covered by
  23. * the GNU General Public License. Only Red Hat, Inc. may make changes or
  24. * additions to the list of Approved Interfaces. You must obey the GNU General
  25. * Public License in all respects for all of the Program code and other code used
  26. * in conjunction with the Program except the Non-GPL Code covered by this
  27. * exception. If you modify this file, you may extend this exception to your
  28. * version of the file, but you are not obligated to do so. If you do not wish to
  29. * provide this exception without modification, you must delete this exception
  30. * statement from your version and license this file solely under the GPL without
  31. * exception.
  32. *
  33. *
  34. * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
  35. * Copyright (C) 2005 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /* int.c - integer syntax routines */
  42. #include <stdio.h>
  43. #include <string.h>
  44. #include <sys/types.h>
  45. #include "syntax.h"
  46. static int int_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
  47. Slapi_Value **bvals, int ftype, Slapi_Value **retVal );
  48. static int int_values2keys( Slapi_PBlock *pb, Slapi_Value **val,
  49. Slapi_Value ***ivals, int ftype );
  50. static int int_assertion2keys( Slapi_PBlock *pb, Slapi_Value *val,
  51. Slapi_Value ***ivals, int ftype );
  52. static int int_compare(struct berval *v1, struct berval *v2);
  53. static int int_validate(struct berval *val);
  54. /* the first name is the official one from RFC 2252 */
  55. static char *names[] = { "INTEGER", "int", INTEGER_SYNTAX_OID, 0 };
  56. #define INTEGERMATCH_OID "2.5.13.14"
  57. #define INTEGERORDERINGMATCH_OID "2.5.13.15"
  58. static Slapi_PluginDesc pdesc = { "int-syntax", PLUGIN_MAGIC_VENDOR_STR,
  59. PRODUCTTEXT, "integer attribute syntax plugin" };
  60. static Slapi_MatchingRuleEntry
  61. integerMatch = { INTEGERMATCH_OID, NULL /* no alias? */,
  62. "integerMatch", "The rule evaluates to TRUE if and only if the attribute value and the assertion value are the same integer value.",
  63. INTEGER_SYNTAX_OID, 0 /* not obsolete */ };
  64. static Slapi_MatchingRuleEntry
  65. integerOrderingMatch = { INTEGERORDERINGMATCH_OID, NULL /* no alias? */,
  66. "integerOrderingMatch", "The rule evaluates to TRUE if and only if the integer value of the attribute value is less than the integer value of the assertion value.",
  67. INTEGER_SYNTAX_OID, 0 /* not obsolete */ };
  68. int
  69. int_init( Slapi_PBlock *pb )
  70. {
  71. int rc, flags;
  72. LDAPDebug( LDAP_DEBUG_PLUGIN, "=> int_init\n", 0, 0, 0 );
  73. rc = slapi_pblock_set( pb, SLAPI_PLUGIN_VERSION,
  74. (void *) SLAPI_PLUGIN_VERSION_01 );
  75. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_DESCRIPTION,
  76. (void *)&pdesc );
  77. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_AVA,
  78. (void *) int_filter_ava );
  79. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALUES2KEYS,
  80. (void *) int_values2keys );
  81. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_AVA,
  82. (void *) int_assertion2keys );
  83. flags = SLAPI_PLUGIN_SYNTAX_FLAG_ORDERING;
  84. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FLAGS,
  85. (void *) &flags );
  86. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_NAMES,
  87. (void *) names );
  88. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_OID,
  89. (void *) INTEGER_SYNTAX_OID );
  90. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_COMPARE,
  91. (void *) int_compare );
  92. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALIDATE,
  93. (void *) int_validate );
  94. /* also register this plugin for matching rules */
  95. rc |= slapi_matchingrule_register(&integerMatch);
  96. rc |= slapi_matchingrule_register(&integerOrderingMatch);
  97. LDAPDebug( LDAP_DEBUG_PLUGIN, "<= int_init %d\n", rc, 0, 0 );
  98. return( rc );
  99. }
  100. static int
  101. int_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
  102. Slapi_Value **bvals, int ftype, Slapi_Value **retVal )
  103. {
  104. return( string_filter_ava( bvfilter, bvals, SYNTAX_INT | SYNTAX_CES,
  105. ftype, retVal ) );
  106. }
  107. static int
  108. int_values2keys( Slapi_PBlock *pb, Slapi_Value **vals, Slapi_Value ***ivals, int ftype )
  109. {
  110. return( string_values2keys( pb, vals, ivals, SYNTAX_INT | SYNTAX_CES,
  111. ftype ) );
  112. }
  113. static int
  114. int_assertion2keys( Slapi_PBlock *pb, Slapi_Value *val, Slapi_Value ***ivals, int ftype )
  115. {
  116. return(string_assertion2keys_ava( pb, val, ivals,
  117. SYNTAX_INT | SYNTAX_CES, ftype ));
  118. }
  119. static int int_compare(
  120. struct berval *v1,
  121. struct berval *v2
  122. )
  123. {
  124. return value_cmp(v1, v2, SYNTAX_INT|SYNTAX_CES, 3 /* Normalise both values */);
  125. }
  126. /* return 0 if valid, non-0 if invalid */
  127. static int int_validate(
  128. struct berval *val
  129. )
  130. {
  131. int rc = 0; /* assume the value is valid */
  132. char *p = NULL;
  133. char *end = NULL;
  134. /* Per RFC4517:
  135. *
  136. * Integer = (HYPHEN LDIGIT *DIGIT) / number
  137. * number = DIGIT / (LDIGIT 1*DIGIT)
  138. */
  139. if ((val != NULL) && (val->bv_len > 0)) {
  140. p = val->bv_val;
  141. end = &(val->bv_val[val->bv_len - 1]);
  142. /* If the first character is HYPHEN, we need
  143. * to make sure the next char is a LDIGIT. */
  144. if (*p == '-') {
  145. p++;
  146. if ((p > end) || !IS_LDIGIT(*p)) {
  147. rc = 1;
  148. goto exit;
  149. }
  150. p++;
  151. } else if (*p == '0') {
  152. /* 0 is allowed by itself, but not as
  153. * a leading 0 before other digits */
  154. if (p != end) {
  155. rc = 1;
  156. }
  157. /* We're done here */
  158. goto exit;
  159. }
  160. /* Now we can simply allow the rest to be DIGIT */
  161. for (; p <= end; p++) {
  162. if (!isdigit(*p)) {
  163. rc = 1;
  164. goto exit;
  165. }
  166. }
  167. } else {
  168. rc = 1;
  169. }
  170. exit:
  171. return(rc);
  172. }