# @nozero
# All strings will have a non-zero offset in the strtab.
#
-# A string is defined by beginning a line with an & character, which must
-# be immediately followed by a C identifier. A nonempty sequence of
-# whitespace (with at most one newline) separates the identifier from the
-# beginning of the string itself. This whitespace is never included in the
-# output.
+# A string is defined by beginning a line with one or two & characters, which
+# must be immediately followed by a C identifier. Two & characters indicates
+# a string that should not be translated, as described below. A nonempty
+# sequence of whitespace (with at most one newline) separates the identifier
+# from the beginning of the string itself. This whitespace is never included
+# in the output.
#
# The string is then interpreted as follows:
#
# and each identifier in the input is declared as an emumeration constant
# whose value is the offset of the associated string within strtab.
#
+# Normally, the generated source code wraps strings using the identity macro
+# N_(x), which has no effect on the resulting data structures but enables tools
+# such as xgettext to extract translatable strings from the source code. An
+# identifier preceded by two ampersands (&&) suppresses this output to allow
+# a single string table to also contain both translateable strings as well as
+# ones that should not be translated.
+#
# The object-like macro STRTAB_MAX_OFFSET is defined and expands to the
# greatest string offset, suitable for use in #if preprocessing directives.
#
next
}
-$0 ~ /^[&]/ {
+sub(/^[&]/, "") {
if (ident) {
finish_string_input(strings, ident, collected)
vars[num_vars++] = ident
}
- sub(/^[&]/, "", $1)
+ current_l10n = !sub(/^[&]/, "", $1);
startline = NR
ident = $1
print "#endif"
print "\nstatic const char strtab[] ="
- if (!opts["zero"])
- print "\t\"\\0\"";
-
for (i = 0; i < count; i++) {
s = sorted_strings[i]
gsub(/\\\\/, "\2", s)
if ((n = index(strtab "\1", s "\1")) > 0) {
- offsets[sorted_strings[i]] = real_length(substr(strtab, 1, n-1))
- print "\tSTR_L10N_(N_(\"" sorted_strings[i] "\"))"
+ offsets[sorted_strings[i]] = real_length(substr(strtab, 1, n-1));
+ if (!(sorted_strings[i] in nol10n))
+ print "\tSTR_L10N_(N_(\"" sorted_strings[i] "\"))";
} else if (strtab) {
strtab = strtab "\1" s
offsets[sorted_strings[i]] = strtab_len + 1
}
}
- gsub(/\2/, "\\\\", strtab)
- gsub(/\1/, "\")\"\\0\"\n\tN_(\"", strtab)
- print "\tN_(\"" strtab "\")"
- print "\t\"\";"
+ gsub(/\2/, "\\\\", strtab);
+ n = split(strtab, split_strtab, "\1");
+ for (i = 1; i <= n; i++) {
+ printf("\t%4s ", i > !!opts["zero"] ? "\"\\0\"" : "");
+
+ if (split_strtab[i] in nol10n) {
+ print "\"" split_strtab[i] "\"";
+ } else {
+ print "N_(\"" split_strtab[i] "\")";
+ }
+ }
+ print "\t\"\";";
print "enum {"
for (i = 0; i < num_vars; i++) {
gsub(/\1/, "\\\\", tmpval)
strings[ident] = tmpval
+ if (!current_l10n) {
+ nol10n[tmpval] = 1;
+ }
}
function real_length(s, t)