1226031Sstas/* 2226031Sstas * Copyright (c) 2004 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#ifdef HAVE_CONFIG_H 35226031Sstas#include <config.h> 36226031Sstas#endif 37226031Sstas#include "windlocl.h" 38226031Sstas 39226031Sstas#include <stdlib.h> 40226031Sstas 41226031Sstas#include "map_table.h" 42226031Sstas 43226031Sstasstatic int 44226031Sstastranslation_cmp(const void *key, const void *data) 45226031Sstas{ 46226031Sstas const struct translation *t1 = (const struct translation *)key; 47226031Sstas const struct translation *t2 = (const struct translation *)data; 48226031Sstas 49226031Sstas return t1->key - t2->key; 50226031Sstas} 51226031Sstas 52226031Sstasint 53226031Sstas_wind_stringprep_map(const uint32_t *in, size_t in_len, 54226031Sstas uint32_t *out, size_t *out_len, 55226031Sstas wind_profile_flags flags) 56226031Sstas{ 57226031Sstas unsigned i; 58226031Sstas unsigned o = 0; 59226031Sstas 60226031Sstas for (i = 0; i < in_len; ++i) { 61226031Sstas struct translation ts = {in[i]}; 62226031Sstas const struct translation *s; 63226031Sstas 64226031Sstas s = (const struct translation *) 65226031Sstas bsearch(&ts, _wind_map_table, _wind_map_table_size, 66226031Sstas sizeof(_wind_map_table[0]), 67226031Sstas translation_cmp); 68226031Sstas if (s != NULL && (s->flags & flags)) { 69226031Sstas unsigned j; 70226031Sstas 71226031Sstas for (j = 0; j < s->val_len; ++j) { 72226031Sstas if (o >= *out_len) 73226031Sstas return WIND_ERR_OVERRUN; 74226031Sstas out[o++] = _wind_map_table_val[s->val_offset + j]; 75226031Sstas } 76226031Sstas } else { 77226031Sstas if (o >= *out_len) 78226031Sstas return WIND_ERR_OVERRUN; 79226031Sstas out[o++] = in[i]; 80226031Sstas 81226031Sstas } 82226031Sstas } 83226031Sstas *out_len = o; 84226031Sstas return 0; 85226031Sstas} 86