LibreOffice Module i18npool (master) 1
genindex_data.cxx
Go to the documentation of this file.
1/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2/*
3 * This file is part of the LibreOffice project.
4 *
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8 *
9 * This file incorporates work covered by the following license notice:
10 *
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
18 */
19
20
21#include <stdio.h>
22#include <string.h>
23#include <stdlib.h>
24#include <errno.h>
25#include <sal/main.h>
26#include <sal/types.h>
27#include <rtl/ustring.hxx>
28#include <rtl/ustrbuf.hxx>
29
30#define MAX_ADDRESS 0x30000
31#define MAX_INDEX MAX_ADDRESS/0x100
32
33/* Main Procedure */
34
36{
37 FILE *fp;
38
39 if (argc < 4) exit(-1);
40
41 fp = fopen(argv[1], "rb"); // open the source file for read;
42 if (fp == nullptr) {
43 fprintf(stderr, "Opening the rule source file %s for reading failed: %s\n", argv[1], strerror(errno));
44 exit(1);
45 }
46
47
48 sal_Int32 i, j, k;
49 sal_Int32 address[MAX_ADDRESS];
50 for (i=0; i<MAX_ADDRESS; i++) address[i]=-1;
51 OUString sep('|');
52 OUStringBuffer result(64*1024);
53 result.append(sep);
54 sal_Int32 max=0;
55
56 char str[1024];
57 while (fgets(str, 1024, fp)) {
58 // don't convert last new line character to Ostr.
59 sal_Int32 len = strlen(str) - 1;
60 // skip comment line
61 if (len == 0 || str[0] == '#')
62 continue;
63
64 // input file is in UTF-8 encoding
65 OUString Ostr(str, len, RTL_TEXTENCODING_UTF8);
66 len = Ostr.getLength();
67 if (len == 0)
68 continue; // skip empty line.
69
70 sal_Int32 nPos=0;
71 sal_uInt32 nChar = Ostr.iterateCodePoints(&nPos, 2);
72 if (nChar >= MAX_ADDRESS) {
73 printf("Code point 0x%lx exceeds MAX_ADDRESS 0x%x, Please increase MAX_ADDRESS", static_cast<long unsigned int>(nChar), MAX_ADDRESS);
74 exit(1);
75 }
76 OUString key=Ostr.subView(nPos)+sep;
77 sal_Int32 idx = result.indexOf(key);
78 if (key.getLength() > max) max=key.getLength();
79 if (idx >= 0) {
80 address[nChar]=idx;
81 } else {
82 address[nChar]=result.getLength();
83 result.append(key);
84 }
85 }
86 fclose(fp);
87
88 fp = fopen(argv[2], "wb");
89 if (fp == nullptr) {
90 fprintf(stderr, "Opening %s for writing failed: %s\n", argv[2], strerror(errno));
91 exit(1);
92 }
93
94 fprintf(fp, "/*\n");
95 fprintf(fp, " * Copyright(c) 1999 - 2006, Sun Microsystems, Inc.\n");
96 fprintf(fp, " * All Rights Reserved.\n");
97 fprintf(fp, " */\n\n");
98 fprintf(fp, "/* !!!The file is generated automatically. DO NOT edit the file manually!!! */\n\n");
99 fprintf(fp, "#include <sal/types.h>\n");
100 fprintf(fp, "\nextern \"C\" {\n");
101
102 sal_Int32 index[MAX_INDEX];
103 sal_Int32 max_index=0;
104 for (i=k=0; i<MAX_INDEX; i++) {
105 index[i] = 0xFFFF;
106 for (j=0; j<0x100; j++) {
107 if (address[i*0x100+j] >=0) {
108 max_index=i;
109 index[i]=0x100*k++;
110 break;
111 }
112 }
113 }
114
115 fprintf(fp, "\nstatic const sal_uInt16 idx1[] = {");
116 for (i = k = 0; i <= max_index; i++) {
117 if (k++ % 16 == 0) fprintf(fp, "\n\t");
118 fprintf(
119 fp, "0x%04lx, ", sal::static_int_cast< unsigned long >(index[i]));
120 }
121 fprintf(fp, "\n};\n\n");
122
123 sal_Int32 len=result.getLength();
124 fprintf(fp, "\nstatic const sal_uInt16 idx2[] = {");
125 for (i = k = 0; i <= max_index; i++) {
126 if (index[i] != 0xFFFF) {
127 for (j = 0; j<0x100; j++) {
128 if (k++ % 16 == 0) fprintf(fp, "\n\t");
129 sal_Int32 ad=address[i*0x100+j];
130 fprintf(
131 fp, "0x%04lx, ",
132 sal::static_int_cast< unsigned long >(
133 ad == -1 ? 0 : max == 2 ? result[ad] : ad));
134 }
135 fprintf(fp, "\n\t");
136 }
137 }
138 fprintf(fp, "\n};\n\n");
139
140 if (max == 2) {
141 fprintf(fp, "\nstatic const sal_uInt16 *idx3 = NULL;\n\n");
142 } else {
143 fprintf(fp, "\nstatic const sal_uInt16 idx3[] = {");
144 for (i = k = 0; i < len; i++) {
145 if (k++ % 16 == 0) fprintf(fp, "\n\t");
146 fprintf(fp, "0x%04x, ", (sep.toChar() == result[i]) ? 0 : result[i]);
147 }
148 fprintf(fp, "\n};\n\n");
149 }
150
151 fprintf(fp, "const sal_uInt16** get_%s(sal_Int16 &max_index)\n{\n\tstatic const sal_uInt16 *idx[]={idx1, idx2, idx3};\n\tmax_index=0x%x;\n\treturn idx;\n}\n\n", argv[3], static_cast<unsigned int>(max_index));
152 fprintf (fp, "}\n");
153
154 fclose(fp);
155 return 0;
156} // End of main
157
158/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
#define max(a, b)
#define MAX_ADDRESS
SAL_IMPLEMENT_MAIN_WITH_ARGS(argc, argv)
#define MAX_INDEX
const sal_uInt16 idx[]
sal_uInt16 nPos
int i
index
Any result