1226031Sstas/* 2226031Sstas * Copyright (c) 2008 Kungliga Tekniska H��gskolan 3226031Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4226031Sstas * All rights reserved. 5226031Sstas * 6226031Sstas * Redistribution and use in source and binary forms, with or without 7226031Sstas * modification, are permitted provided that the following conditions 8226031Sstas * are met: 9226031Sstas * 10226031Sstas * 1. Redistributions of source code must retain the above copyright 11226031Sstas * notice, this list of conditions and the following disclaimer. 12226031Sstas * 13226031Sstas * 2. Redistributions in binary form must reproduce the above copyright 14226031Sstas * notice, this list of conditions and the following disclaimer in the 15226031Sstas * documentation and/or other materials provided with the distribution. 16226031Sstas * 17226031Sstas * 3. Neither the name of the Institute nor the names of its contributors 18226031Sstas * may be used to endorse or promote products derived from this software 19226031Sstas * without specific prior written permission. 20226031Sstas * 21226031Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22226031Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23226031Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24226031Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25226031Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26226031Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27226031Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28226031Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29226031Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30226031Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31226031Sstas * SUCH DAMAGE. 32226031Sstas */ 33226031Sstas 34226031Sstas#include "windlocl.h" 35226031Sstas#include <assert.h> 36226031Sstas 37226031Sstasstatic int 38226031Sstasput_char(uint32_t *out, size_t *o, uint32_t c, size_t out_len) 39226031Sstas{ 40226031Sstas if (*o >= out_len) 41226031Sstas return 1; 42226031Sstas out[*o] = c; 43226031Sstas (*o)++; 44226031Sstas return 0; 45226031Sstas} 46226031Sstas 47226031Sstasint 48226031Sstas_wind_ldap_case_exact_attribute(const uint32_t *tmp, 49226031Sstas size_t olen, 50226031Sstas uint32_t *out, 51226031Sstas size_t *out_len) 52226031Sstas{ 53226031Sstas size_t o = 0, i = 0; 54226031Sstas 55226031Sstas if (olen == 0) { 56226031Sstas *out_len = 0; 57226031Sstas return 0; 58226031Sstas } 59226031Sstas 60226031Sstas if (put_char(out, &o, 0x20, *out_len)) 61226031Sstas return WIND_ERR_OVERRUN; 62226031Sstas while(i < olen && tmp[i] == 0x20) /* skip initial spaces */ 63226031Sstas i++; 64226031Sstas 65226031Sstas while (i < olen) { 66226031Sstas if (tmp[i] == 0x20) { 67226031Sstas if (put_char(out, &o, 0x20, *out_len) || 68226031Sstas put_char(out, &o, 0x20, *out_len)) 69226031Sstas return WIND_ERR_OVERRUN; 70226031Sstas while(i < olen && tmp[i] == 0x20) /* skip middle spaces */ 71226031Sstas i++; 72226031Sstas } else { 73226031Sstas if (put_char(out, &o, tmp[i++], *out_len)) 74226031Sstas return WIND_ERR_OVERRUN; 75226031Sstas } 76226031Sstas } 77226031Sstas assert(o > 0); 78226031Sstas 79226031Sstas /* only one spaces at the end */ 80226031Sstas if (o == 1 && out[0] == 0x20) 81226031Sstas o = 0; 82226031Sstas else if (out[o - 1] == 0x20) { 83226031Sstas if (out[o - 2] == 0x20) 84226031Sstas o--; 85226031Sstas } else 86226031Sstas put_char(out, &o, 0x20, *out_len); 87226031Sstas 88226031Sstas *out_len = o; 89226031Sstas 90226031Sstas return 0; 91226031Sstas} 92