1 /* $NetBSD: ldap.c,v 1.2 2017/01/28 21:31:50 christos Exp $ */ 2 3 /* 4 * Copyright (c) 2008 Kungliga Tekniska Högskolan 5 * (Royal Institute of Technology, Stockholm, Sweden). 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * 3. Neither the name of the Institute nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include "windlocl.h" 37 #include <assert.h> 38 39 static int 40 put_char(uint32_t *out, size_t *o, uint32_t c, size_t out_len) 41 { 42 if (*o >= out_len) 43 return 1; 44 out[*o] = c; 45 (*o)++; 46 return 0; 47 } 48 49 int 50 _wind_ldap_case_exact_attribute(const uint32_t *tmp, 51 size_t olen, 52 uint32_t *out, 53 size_t *out_len) 54 { 55 size_t o = 0, i = 0; 56 57 if (olen == 0) { 58 *out_len = 0; 59 return 0; 60 } 61 62 if (put_char(out, &o, 0x20, *out_len)) 63 return WIND_ERR_OVERRUN; 64 while(i < olen && tmp[i] == 0x20) /* skip initial spaces */ 65 i++; 66 67 while (i < olen) { 68 if (tmp[i] == 0x20) { 69 if (put_char(out, &o, 0x20, *out_len) || 70 put_char(out, &o, 0x20, *out_len)) 71 return WIND_ERR_OVERRUN; 72 while(i < olen && tmp[i] == 0x20) /* skip middle spaces */ 73 i++; 74 } else { 75 if (put_char(out, &o, tmp[i++], *out_len)) 76 return WIND_ERR_OVERRUN; 77 } 78 } 79 assert(o > 0); 80 81 /* only one spaces at the end */ 82 if (o == 1 && out[0] == 0x20) 83 o = 0; 84 else if (out[o - 1] == 0x20) { 85 if (out[o - 2] == 0x20) 86 o--; 87 } else 88 put_char(out, &o, 0x20, *out_len); 89 90 *out_len = o; 91 92 return 0; 93 } 94