| 1 | #!/usr/local/bin/python
|
|---|
| 2 | # -*- coding: iso-8859-1 -*-
|
|---|
| 3 |
|
|---|
| 4 | # $Id$
|
|---|
| 5 |
|
|---|
| 6 | # Copyright (c) 2008 Kungliga Tekniska Högskolan
|
|---|
| 7 | # (Royal Institute of Technology, Stockholm, Sweden).
|
|---|
| 8 | # All rights reserved.
|
|---|
| 9 | #
|
|---|
| 10 | # Redistribution and use in source and binary forms, with or without
|
|---|
| 11 | # modification, are permitted provided that the following conditions
|
|---|
| 12 | # are met:
|
|---|
| 13 | #
|
|---|
| 14 | # 1. Redistributions of source code must retain the above copyright
|
|---|
| 15 | # notice, this list of conditions and the following disclaimer.
|
|---|
| 16 | #
|
|---|
| 17 | # 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 18 | # notice, this list of conditions and the following disclaimer in the
|
|---|
| 19 | # documentation and/or other materials provided with the distribution.
|
|---|
| 20 | #
|
|---|
| 21 | # 3. Neither the name of the Institute nor the names of its contributors
|
|---|
| 22 | # may be used to endorse or promote products derived from this software
|
|---|
| 23 | # without specific prior written permission.
|
|---|
| 24 | #
|
|---|
| 25 | # THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 26 | # ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 27 | # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 28 | # ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|---|
| 29 | # FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 30 | # DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 31 | # OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 32 | # HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 33 | # LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 34 | # OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 35 | # SUCH DAMAGE.
|
|---|
| 36 |
|
|---|
| 37 | import re
|
|---|
| 38 | import string
|
|---|
| 39 |
|
|---|
| 40 | def _merge_table(res, source):
|
|---|
| 41 | for table in source.keys():
|
|---|
| 42 | res[table] = res.get(table, []) + source.get(table, [])
|
|---|
| 43 |
|
|---|
| 44 | name_error = ['C.1.2', 'C.2.2', 'C.3', 'C.4', 'C.5', 'C.6', 'C.7', 'C.8', 'C.9']
|
|---|
| 45 | ldap_error = ['A.1', 'C.3', 'C.4', 'C.5', 'C.8', 'rfc4518-error' ]
|
|---|
| 46 | sasl_error = ['C.1.2', 'C.2.1', 'C.2.2', 'C.3', 'C.4', 'C.5', 'C.6', 'C.7', 'C.8', 'C.9']
|
|---|
| 47 |
|
|---|
| 48 | name_map = ['B.1', 'B.2']
|
|---|
| 49 | ldap_map = ['rfc4518-map']
|
|---|
| 50 | ldap_case_map = ['rfc4518-map', 'B.2']
|
|---|
| 51 | sasl_map = ['C.1.2', 'B.1']
|
|---|
| 52 |
|
|---|
| 53 | def symbols(tabledict, tables):
|
|---|
| 54 | """return CPP symbols to use for this symbols"""
|
|---|
| 55 | list = []
|
|---|
| 56 | for x in tables:
|
|---|
| 57 | list = list + tabledict.get(x, [])
|
|---|
| 58 | if len(list) == 0:
|
|---|
| 59 | return ""
|
|---|
| 60 | return "|".join(map(lambda x: "WIND_PROFILE_%s" % (string.upper(x)), list))
|
|---|
| 61 |
|
|---|
| 62 | def get_errorlist():
|
|---|
| 63 | d = dict()
|
|---|
| 64 | _merge_table(d, dict(map(lambda x: [x, ['name']], name_error)))
|
|---|
| 65 | _merge_table(d, dict(map(lambda x: [x, ['ldap']], ldap_error)))
|
|---|
| 66 | _merge_table(d, dict(map(lambda x: [x, ['sasl']], sasl_error)))
|
|---|
| 67 | return d
|
|---|
| 68 |
|
|---|
| 69 | def get_maplist():
|
|---|
| 70 | d = dict()
|
|---|
| 71 | _merge_table(d, dict(map(lambda x: [x, ['name']], name_map)))
|
|---|
| 72 | _merge_table(d, dict(map(lambda x: [x, ['ldap']], ldap_map)))
|
|---|
| 73 | _merge_table(d, dict(map(lambda x: [x, ['ldap_case']], ldap_case_map)))
|
|---|
| 74 | _merge_table(d, dict(map(lambda x: [x, ['sasl']], sasl_map)))
|
|---|
| 75 | return d
|
|---|
| 76 |
|
|---|
| 77 | def sort_merge_trans(trans):
|
|---|
| 78 | trans.sort()
|
|---|
| 79 | ret = []
|
|---|
| 80 | last = 0
|
|---|
| 81 | for x in trans:
|
|---|
| 82 | if last:
|
|---|
| 83 | if last[0] == x[0]:
|
|---|
| 84 | last = (last[0], last[1], last[2], last[3] + x[3])
|
|---|
| 85 | else:
|
|---|
| 86 | ret.append(last)
|
|---|
| 87 | last = x
|
|---|
| 88 | else:
|
|---|
| 89 | last = x
|
|---|
| 90 | if last:
|
|---|
| 91 | ret.append(last)
|
|---|
| 92 | return ret
|
|---|