003 File Manager
Current Path:
/usr/src/crypto/heimdal/lib/wind
usr
/
src
/
crypto
/
heimdal
/
lib
/
wind
/
π
..
π
ChangeLog
(3.32 KB)
π
CompositionExclusions-3.2.0.txt
(7.28 KB)
π
DerivedNormalizationProps.txt
(193.66 KB)
π
Makefile.am
(3.2 KB)
π
Makefile.in
(43.33 KB)
π
NTMakefile
(4.54 KB)
π
NormalizationCorrections.txt
(1.78 KB)
π
NormalizationTest.txt
(1.96 MB)
π
UnicodeData.py
(2.12 KB)
π
UnicodeData.txt
(876.37 KB)
π
bidi.c
(2.81 KB)
π
bidi_table.c
(6.65 KB)
π
bidi_table.h
(421 B)
π
combining.c
(2.27 KB)
π
combining_table.c
(8.13 KB)
π
combining_table.h
(374 B)
π
doxygen.c
(1.87 KB)
π
errorlist.c
(2.55 KB)
π
errorlist_table.c
(7.68 KB)
π
errorlist_table.h
(390 B)
π
gen-bidi.py
(3.18 KB)
π
gen-combining.py
(2.99 KB)
π
gen-errorlist.py
(3.53 KB)
π
gen-map.py
(4.24 KB)
π
gen-normalize.py
(5.62 KB)
π
gen-punycode-examples.py
(3.67 KB)
π
generate.py
(3.1 KB)
π
idn-lookup.c
(4.05 KB)
π
ldap.c
(2.68 KB)
π
libwind-exports.def
(491 B)
π
map.c
(2.68 KB)
π
map_table.c
(146.7 KB)
π
map_table.h
(437 B)
π
normalize.c
(7.31 KB)
π
normalize_table.c
(511.89 KB)
π
normalize_table.h
(713 B)
π
punycode.c
(4.44 KB)
π
punycode_examples.c
(4.5 KB)
π
punycode_examples.h
(457 B)
π
rfc3454.py
(2.24 KB)
π
rfc3454.txt
(135.43 KB)
π
rfc3490.txt
(50.73 KB)
π
rfc3491.txt
(10.07 KB)
π
rfc3492.txt
(65.86 KB)
π
rfc4013.txt
(12.75 KB)
π
rfc4518.py
(5.47 KB)
π
rfc4518.txt
(27.51 KB)
π
stringprep.c
(4.02 KB)
π
stringprep.py
(3.37 KB)
π
test-bidi.c
(2.57 KB)
π
test-ldap.c
(3.58 KB)
π
test-map.c
(2.83 KB)
π
test-normalize.c
(4.54 KB)
π
test-prohibited.c
(3.64 KB)
π
test-punycode.c
(2.74 KB)
π
test-rw.c
(3.97 KB)
π
test-utf8.c
(4.63 KB)
π
utf8.c
(12.46 KB)
π
util.py
(1.93 KB)
π
version-script.map
(547 B)
π
wind.h
(3.09 KB)
π
wind_err.et
(695 B)
π
windlocl.h
(2.34 KB)
Editing: map.c
/* * 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" 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; }
Upload File
Create Folder