/* * Copyright (c) 2004 Kungliga Tekniska H�gskolan * (Royal Institute of Technology, Stockholm, Sweden). * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * 3. Neither the name of the Institute nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "windlocl.h" #include <stdlib.h> #include "map_table.h" RCSID("$Id: map.c 22556 2008-02-01 16:38:46Z lha $"); static int translation_cmp(const void *key, const void *data) { const struct translation *t1 = (const struct translation *)key; const struct translation *t2 = (const struct translation *)data; return t1->key - t2->key; } int _wind_stringprep_map(const uint32_t *in, size_t in_len, uint32_t *out, size_t *out_len, wind_profile_flags flags) { unsigned i; unsigned o = 0; for (i = 0; i < in_len; ++i) { struct translation ts = {in[i]}; const struct translation *s; s = (const struct translation *) bsearch(&ts, _wind_map_table, _wind_map_table_size, sizeof(_wind_map_table[0]), translation_cmp); if (s != NULL && (s->flags & flags)) { unsigned j; for (j = 0; j < s->val_len; ++j) { if (o >= *out_len) return WIND_ERR_OVERRUN; out[o++] = _wind_map_table_val[s->val_offset + j]; } } else { if (o >= *out_len) return WIND_ERR_OVERRUN; out[o++] = in[i]; } } *out_len = o; return 0; }