pax_global_header 0000666 0000000 0000000 00000000064 14767240365 0014530 g ustar 00root root 0000000 0000000 52 comment=e0e97997e1424cf2070c1cee01c66bee65d17b60
libidn-v1.43/ 0000775 0000000 0000000 00000000000 14767240365 0013106 5 ustar 00root root 0000000 0000000 libidn-v1.43/.gitattributes 0000664 0000000 0000000 00000000042 14767240365 0015775 0 ustar 00root root 0000000 0000000 .tarball-version-git export-subst
libidn-v1.43/.gitignore 0000664 0000000 0000000 00000011510 14767240365 0015074 0 ustar 00root root 0000000 0000000 !/gl/top/README-release.diff
*.gcda
*.gcno
*.lo
*.log
*.o
*.trs
*~
/.deps/
/.version
/ABOUT-NLS
/ChangeLog
/GNUmakefile
/INSTALL
/README-release
/aclocal.m4
/autogen.sh
/autom4te.cache/
/autopull.sh
/build-aux/
/config.h
/config.h.in
/config.log
/config.status
/configure
/contrib/doxygen/Doxyfile
/contrib/doxygen/doxygen_sqlite3.db
/contrib/doxygen/html/
/contrib/doxygen/latex/
/csharp/CombiningClass.cs
/csharp/Composition.cs
/csharp/CompositionExclusions.txt
/csharp/DecompositionKeys.cs
/csharp/DecompositionMappings.cs
/csharp/GenerateTables.exe
/csharp/Libidn.dll
/csharp/RFC3454.cs
/csharp/UnicodeData.txt
/csharp/rfc3454.txt
/csharpcomp.sh
/csharpexec.sh
/doc/Makefile.gdoc
/doc/coverage/
/doc/cyclo/cyclo-libidn.html
/doc/example.txt
/doc/example2.txt
/doc/example3.txt
/doc/example4.txt
/doc/example5.txt
/doc/gendocs_template
/doc/gendocs_template_min
/doc/idn-help.texi
/doc/idn.1
/doc/java/html/
/doc/java/stamp-html
/doc/libidn-components.eps
/doc/libidn-components.pdf
/doc/libidn-components.png
/doc/libidn.aux
/doc/libidn.cp
/doc/libidn.cps
/doc/libidn.dvi
/doc/libidn.fn
/doc/libidn.fns
/doc/libidn.html
/doc/libidn.info
/doc/libidn.ky
/doc/libidn.log
/doc/libidn.pdf
/doc/libidn.pg
/doc/libidn.ps
/doc/libidn.t2d/
/doc/libidn.t2p/
/doc/libidn.toc
/doc/libidn.tp
/doc/libidn.vr
/doc/libidn.vrs
/doc/man/
/doc/manual/
/doc/reference/gtkdoc-check.test
/doc/reference/html-build.stamp
/doc/reference/html.stamp
/doc/reference/html/
/doc/reference/libidn-decl-list.txt
/doc/reference/libidn-decl-list.txt.bak
/doc/reference/libidn-decl.txt
/doc/reference/libidn-decl.txt.bak
/doc/reference/libidn-overrides.txt
/doc/reference/libidn-sections.txt
/doc/reference/libidn-undeclared.txt
/doc/reference/libidn-undocumented.txt
/doc/reference/libidn-unused.txt
/doc/reference/libidn.actions
/doc/reference/libidn.args
/doc/reference/libidn.hierarchy
/doc/reference/libidn.interfaces
/doc/reference/libidn.pdf
/doc/reference/libidn.prerequisites
/doc/reference/libidn.signals
/doc/reference/libidn.types
/doc/reference/pdf-build.stamp
/doc/reference/pdf.stamp
/doc/reference/scan-build.stamp
/doc/reference/setup-build.stamp
/doc/reference/sgml-build.stamp
/doc/reference/sgml.stamp
/doc/reference/tmpl-build.stamp
/doc/reference/tmpl.stamp
/doc/reference/tmpl/
/doc/reference/version.xml
/doc/reference/xml/
/doc/stamp-vti
/doc/texi/
/doc/version.texi
/examples/.deps/
/examples/.libs/
/examples/example
/examples/example2
/examples/example3
/examples/example4
/examples/example5
/fuzz/.deps/
/fuzz/libidn_*_fuzzer
/fuzz/libidn_*_fuzzer.new/
/gl/
/gnulib/
/gtk-doc.make
/java/libidn-*.jar
/java/pom.xml
/java/src/main/java/gnu/inet/encoding/CombiningClass.class
/java/src/main/java/gnu/inet/encoding/Composition.class
/java/src/main/java/gnu/inet/encoding/DecompositionKeys.class
/java/src/main/java/gnu/inet/encoding/DecompositionMappings.class
/java/src/main/java/gnu/inet/encoding/IDNA.class
/java/src/main/java/gnu/inet/encoding/IDNAException.class
/java/src/main/java/gnu/inet/encoding/NFKC.class
/java/src/main/java/gnu/inet/encoding/Punycode.class
/java/src/main/java/gnu/inet/encoding/PunycodeException.class
/java/src/main/java/gnu/inet/encoding/RFC3454.class
/java/src/main/java/gnu/inet/encoding/RangeSet$1.class
/java/src/main/java/gnu/inet/encoding/RangeSet$Builder.class
/java/src/main/java/gnu/inet/encoding/RangeSet$Range.class
/java/src/main/java/gnu/inet/encoding/RangeSet$RangeContainsComparator.class
/java/src/main/java/gnu/inet/encoding/RangeSet.class
/java/src/main/java/gnu/inet/encoding/Stringprep.class
/java/src/main/java/gnu/inet/encoding/StringprepException.class
/java/src/main/java/gnu/inet/encoding/classnoinst.stamp
/java/src/util/java/GenerateNFKC.class
/java/src/util/java/GenerateRFC3454$Range.class
/java/src/util/java/GenerateRFC3454.class
/java/src/util/java/TestIDNA.class
/java/src/util/java/TestNFKC.class
/java/src/util/java/classnoinst.stamp
/java/target
/lib/.deps/
/lib/.libs/
/lib/gl/
/lib/gunibreak.h
/lib/gunicomp.h
/lib/gunidecomp.h
/lib/idn-int.h
/lib/libidn.la
/lib/libidn.pc
/lib/m4/
/lib/rfc3454.c
/lib/rfc3454.h
/lib/tlds.c
/libidn-*.tar.gz
/libidn-*.tar.gz.sig
/libtool
/maint.mk
/po/*.gmo
/po/*.po
/po/.gitignore
/po/.reference/
/po/LINGUAS
/po/Makevars
/po/POTFILES
/po/en@boldquot.insert-header
/po/en@quot.insert-header
/po/libidn.pot
/po/remove-potcdate.sed
/po/stamp-po
/pom.xml
/scan.tmp
/src/.deps/
/src/.libs/
/src/idn
/src/idn_cmd.c
/src/idn_cmd.h
/src/libidn_cmd.la
/stamp-h1
/tests/.deps/
/tests/libutils.a
/tests/tst_badutf8
/tests/tst_badutf8nfkc
/tests/tst_idna
/tests/tst_idna2
/tests/tst_idna3
/tests/tst_idna4
/tests/tst_nfkc
/tests/tst_pr29
/tests/tst_punycode
/tests/tst_strerror
/tests/tst_stringprep
/tests/tst_symbols
/tests/tst_tld
/tests/tst_toascii64oob
/tests/tst_toutf8
/tests/tst_utf8crash
/tests/tst_versions
/windows/libidn-*-win??.zip
/windows/libidn-*-win??.zip.sig
/windows/tmp32
/windows/tmp64
Makefile
Makefile.in
TAGS
doc/stamp-gdoc
libidn-v1.43/.gitlab-ci.yml 0000664 0000000 0000000 00000153461 14767240365 0015554 0 ustar 00root root 0000000 0000000 # Copyright (C) 2020-2025 Simon Josefsson
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
variables:
GIT_DEPTH: 100 # must include last release tag for git describe
GNULIB_URL: https://gitlab.com/libidn/gnulib-mirror.git
stages:
- build # B-* jobs build from git for "make dist"
- repro # R-* jobs do "make release" from git, S-* jobs build from *-src.tar.gz
- test # tarball test builds
default:
interruptible: true
artifacts:
expire_in: 2 weeks
when: always
paths:
- ./config.h
- ./**/*.log
- ./out/$CI_JOB_NAME_SLUG/**
.gnulib-fetch:
script:
- GNULIB_REVISION=$(. bootstrap.conf >&2; echo $GNULIB_REVISION)
- wget -nv https://gitlab.com/libidn/gnulib-mirror/-/archive/$GNULIB_REVISION/gnulib-mirror-$GNULIB_REVISION.tar.gz
- gzip -cd gnulib-mirror-$GNULIB_REVISION.tar.gz | tar xf -
- rm -fv gnulib-mirror-$GNULIB_REVISION.tar.gz
- export GNULIB_SRCDIR=$PWD/gnulib-mirror-$GNULIB_REVISION
.save-artifacts:
script:
- (! command -v git > /dev/null) || git status
- (! command -v git > /dev/null) || git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/{src,log}
- find . -name out -prune -o -name '*.log' -print | xargs mv --backup=numbered -v -t out/$CI_JOB_NAME_SLUG/log config.h
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/ || true
- mv -v *.tar.* out/$CI_JOB_NAME_SLUG/
Q-Debian-testing:
tags: [ saas-linux-medium-amd64 ]
image: debian:testing-slim
stage: build
before_script:
- cat /etc/os-release
- date | tee date.log
- set | tee set.log
- time apt-get update
- time apt-get install -y git wget make autoconf automake libtool autopoint gperf gengetopt indent codespell libidn-dev | tee pkgs.log | tail
script:
- env srcdir=tests tests/standalone.sh
- time apt-get remove -y --purge libidn-dev | tail
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- mkdir -pv q
- cd q
- time ../configure --disable-doc --enable-gcc-warnings=error
- time make -j$(nproc) syntax-check
- time make -j$(nproc) V=1
- time make -j$(nproc) check VERBOSE=t V=1
- make V=1 srcdist
- git status
- git diff --exit-code # nothing should change version controlled files
- env srcdir=../tests STANDALONE_CFLAGS="-I../lib -Ilib lib/.libs/libidn.a" ../tests/standalone.sh
- env srcdir=../tests STANDALONE_CFLAGS="-I../lib -Ilib -Wl,-rpath lib/.libs lib/.libs/libidn.so" ../tests/standalone.sh
- sha256sum *.tar.*
- mkdir -pv ../out/$CI_JOB_NAME_SLUG/{src,log}
- find config.h *.log tests/*.log -exec mv -v {} ../out/$CI_JOB_NAME_SLUG/log/ \;
- mv -v *-src.tar.* ../out/$CI_JOB_NAME_SLUG/src/
# https://docs.gitlab.com/ee/user/application_security/sast/
sast:
stage: build
variables:
SAST_EXCLUDED_PATHS: gnulib
include:
- template: Jobs/SAST.gitlab-ci.yml
# https://www.synopsys.com/blogs/software-security/integrating-coverity-scan-with-gitlab-ci/
Coverity:
rules:
- if: $CI_COMMIT_REF_PROTECTED == "true"
- when: manual
image: debian:testing-slim
stage: build
allow_failure: true
before_script:
- time apt-get update -y
- time apt-get install -y curl git wget make autoconf automake libtool autopoint gperf gengetopt codespell | tee pkgs.log | tail
script:
- test -n "$COVERITY_SCAN_TOKEN" && test -n "$COVERITY_SCAN_PROJECT_NAME"
- curl -o /tmp/cov-analysis-linux64.tgz https://scan.coverity.com/download/linux64
--form project=$COVERITY_SCAN_PROJECT_NAME --form token=$COVERITY_SCAN_TOKEN
- sha1sum /tmp/cov-analysis-linux64.tgz
- tar xfz /tmp/cov-analysis-linux64.tgz
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error --disable-doc CFLAGS="-g -Og"
- cov-analysis-linux64-*/bin/cov-build --dir cov-int make -j$(nproc) check
- tar cfz cov-int.tar.gz cov-int
- curl https://scan.coverity.com/builds?project=$COVERITY_SCAN_PROJECT_NAME
--form token=$COVERITY_SCAN_TOKEN --form email=$GITLAB_USER_EMAIL
--form file=@cov-int.tar.gz --form version="`git describe --tags`"
--form description="`git describe --tags` / $CI_COMMIT_TITLE / $CI_COMMIT_REF_NAME:$CI_PIPELINE_ID"
artifacts:
expire_in: 1 week
paths:
- cov-int/*.txt
.almarocky: &almarocky
stage: build
tags: [ saas-linux-medium-amd64 ]
variables:
PKGS: patch diffutils autoconf automake libtool gettext-devel git wget perl make gperf gengetopt graphviz texinfo help2man gtk-doc valgrind mono-core
before_script:
- cat /etc/os-release
- time dnf install -y epel-release
- time dnf --enablerepo=$(dnf repolist --all | grep crb > /dev/null && echo crb || echo powertools) install -y ${PKGS}
- cc --version
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- sed -i -e '/MAKEFLAGS) dvi/d' Makefile.in # AM_DISTCHECK_DVI_TARGET=
- time ./configure --enable-gcc-warnings=error
- time make syntax-check
- time make -j$(nproc) V=1 VERBOSE=t check
- time make -j$(nproc) V=1 VERBOSE=t distcheck
- !reference [.save-artifacts, script]
B-AlmaLinux8:
image: almalinux:8
extends: .almarocky
B-RockyLinux8:
image: rockylinux:8
extends: .almarocky
B-AlmaLinux9:
image: almalinux:9
extends: .almarocky
B-RockyLinux9:
image: rockylinux:9
extends: .almarocky
.pureosdebian: &pureosdebian
tags: [ saas-linux-medium-amd64 ]
stage: build
variables:
DEBIAN_FRONTEND: noninteractive
before_script:
- cat /etc/os-release
- time apt-get update -q
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -qqy --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless patch
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error --enable-valgrind-tests
- time make syntax-check
- time make -j$(nproc) V=1 VERBOSE=t check
- make -C doc compare-makefile
- time make -j$(nproc) V=1 VERBOSE=t distcheck AM_DISTCHECK_DVI_TARGET=
- !reference [.save-artifacts, script]
B-PureOS10:
image: pureos/byzantium:latest
extends: .pureosdebian
B-Debian11:
image: debian:11-slim
extends: .pureosdebian
B-Devuan5:
image: devuan/devuan:daedalus
extends: .pureosdebian
B-Debian12:
image: debian:12-slim
extends: .pureosdebian
B-Trisquel11:
rules:
- when: always # this job is used by merge request jobs tagged with 'needs' on this job
image: kpengboy/trisquel:11.0
tags: [ saas-linux-medium-amd64 ]
stage: build
variables:
DEBIAN_FRONTEND: noninteractive
before_script:
- cat /etc/os-release
- sed -i 's,http://archive.trisquel.info/trisquel,http://ftp.acc.umu.se/mirror/trisquel/packages,' /etc/apt/sources.list
- time apt-get update -q
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -y make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell libidn-dev
script:
- env srcdir=tests tests/standalone.sh
- time apt-get remove -y --purge libidn-dev | tail
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error --enable-valgrind-tests
- grep '^HAVE_DOTNET = $' Makefile > /dev/null
- grep '^HAVE_MONO = 1$' Makefile > /dev/null
- time make syntax-check
- time make -j$(nproc) V=1 VERBOSE=t check
- make -C doc compare-makefile
- time make -j$(nproc) V=1 VERBOSE=t distcheck AM_DISTCHECK_DVI_TARGET=
- env STANDALONE_CFLAGS="-Ilib lib/.libs/libidn.a" tests/standalone.sh
- env STANDALONE_CFLAGS="-Ilib -Wl,-rpath lib/.libs lib/.libs/libidn.so" tests/standalone.sh
- make dist
- !reference [.save-artifacts, script]
B-Ubuntu2204:
image: ubuntu:22.04
tags: [ saas-linux-medium-amd64 ]
stage: build
variables:
DEBIAN_FRONTEND: noninteractive
before_script:
- cat /etc/os-release
- sed -i 's,http://archive.trisquel.info/trisquel,http://ftp.acc.umu.se/mirror/trisquel/packages,' /etc/apt/sources.list
- time apt-get update -q
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -qqy --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools dblatex valgrind gengetopt graphviz dotnet8 gperf default-jdk-headless patch codespell datefudge libidn-dev
script:
- env srcdir=tests tests/standalone.sh
- time apt-get remove -y --purge libidn-dev | tail
- !reference [.gnulib-fetch, script]
- time datefudge "15 years" ./bootstrap --skip-po --no-git
- mkdir b
- cd b
- time datefudge "15 years" ../configure --enable-gcc-warnings=error --enable-valgrind-tests
- grep '^HAVE_DOTNET = 1$' Makefile > /dev/null
- grep '^HAVE_MONO = $' Makefile > /dev/null
- time datefudge "15 years" make syntax-check exclude_file_name_regexp--sc_copyright_check='version-etc.c|doc/libidn.texi'
- time datefudge "15 years" make -j$(nproc) V=1 VERBOSE=t check
- time datefudge "15 years" make -j$(nproc) V=1 VERBOSE=t distcheck AM_DISTCHECK_DVI_TARGET=
- time datefudge "15 years" make -C doc compare-makefile
- time make -j$(nproc) V=1 VERBOSE=t distcheck AM_DISTCHECK_DVI_TARGET=
- env srcdir=../tests STANDALONE_CFLAGS="-I../lib -Ilib lib/.libs/libidn.a" ../tests/standalone.sh
- env srcdir=../tests STANDALONE_CFLAGS="-I../lib -Ilib -Wl,-rpath lib/.libs lib/.libs/libidn.so" ../tests/standalone.sh
- make dist
- sha256sum *.tar.*
- mkdir -pv ../out/$CI_JOB_NAME_SLUG/{src,log}
- find config.h *.log tests/*.log -exec mv -v {} ../out/$CI_JOB_NAME_SLUG/log/ \;
- mv -v *-src.tar.* ../out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* ../out/$CI_JOB_NAME_SLUG/
B-Ubuntu2404-arm64:
image: ubuntu:24.04
tags: [ saas-linux-small-arm64 ]
stage: build
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -qqy --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz dotnet8 gperf default-jdk-headless patch codespell indent | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error
- grep '^HAVE_DOTNET = 1$' Makefile > /dev/null
- grep '^HAVE_MONO = $' Makefile > /dev/null
- time make -j$(nproc) syntax-check
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) distcheck AM_DISTCHECK_DVI_TARGET=
- !reference [.save-artifacts, script]
B-Ubuntu2404:
image: ubuntu:24.04
tags: [ saas-linux-medium-amd64 ]
stage: build
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -qqy --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz dotnet8 gperf default-jdk-headless patch codespell | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error --disable-silent-rules
- grep '^HAVE_DOTNET = 1$' Makefile > /dev/null
- grep '^HAVE_MONO = $' Makefile > /dev/null
- time make -j$(nproc) syntax-check
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) distcheck AM_DISTCHECK_DVI_TARGET=
- !reference [.save-artifacts, script]
B-Alpine-arm64:
image: alpine:latest
tags: [ saas-linux-small-arm64 ]
stage: build
before_script:
- cat /etc/os-release
- apk update
- apk add gcc make libc-dev git wget autoconf automake libtool gettext-dev gperf gengetopt patch coreutils
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --disable-doc --enable-gcc-warnings=error
- time make -j$(nproc) syntax-check
- time make -j$(nproc) V=1
- time make -j$(nproc) check V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
B-Alpine-mold:
image: alpine:latest
tags: [ saas-linux-small-arm64 ]
stage: build
before_script:
- cat /etc/os-release
- apk update
- apk add gcc make libc-dev git wget autoconf automake libtool gettext-dev gperf gengetopt patch coreutils mold
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --disable-doc --enable-gcc-warnings=error CC='cc -fuse-ld=mold'
- time make -j$(nproc) syntax-check
- time make -j$(nproc) V=1
- time make -j$(nproc) check V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
- (! grep -E 'mold. warning' build.log)
- grep 'mold ' lib/.libs/libidn.so
B-Debian9:
image: docker.io/debian/eol:stretch-slim
stage: build
before_script:
- printf "deb http://archive.debian.org/debian/ stretch main\ndeb http://archive.debian.org/debian/ stretch-backports main\ndeb http://archive.debian.org/debian-security/ stretch/updates main\n" > /etc/apt/sources.list # https://github.com/debuerreotype/docker-debian-eol-artifacts/issues/10
- time apt-get update -y
- time apt-get install -y make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) dist
- time make -j$(nproc) syntax-check
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/src out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* out/$CI_JOB_NAME_SLUG/
B-Debian-testing:
image: debian:testing-slim
stage: build
before_script:
- time apt-get update -qq
- time apt-get install -y -q make git wget autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) distcheck V=1 VERBOSE=t
- make -j$(nproc) install
- time apt-get install -y -qq man
- git clone --depth=1 https://salsa.debian.org/debian/libidn.git debian-libidn
- debian-libidn/debian/tests/idn
- debian-libidn/debian/tests/libidn
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/src out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* out/$CI_JOB_NAME_SLUG/
B-Fedora-latest:
image: fedora:latest
stage: build
before_script:
- cat /etc/os-release
- time dnf update -y
- time dnf install -y make git wget patch autoconf automake libtool gettext-devel glibc-gconv-extra cvs texinfo texinfo-tex texlive help2man gtk-doc gengetopt dblatex valgrind gperf java-latest-openjdk-devel mono-devel codespell graphviz | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) distcheck V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/src out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* out/$CI_JOB_NAME_SLUG/
B-Guix:
image: registry.gitlab.com/debdistutils/guix/container:extra
stage: build
before_script:
- cp -rL /gnu/store/*profile/etc/* /etc/
- echo 'root:x:0:0:root:/:/bin/sh' >> /etc/passwd
- groupadd --system guixbuild
- for i in $(seq -w 1 10); do useradd -g guixbuild -G guixbuild -d /var/empty -s $(command -v nologin) -c "Guix build user $i" --system guixbuilder$i; done
- export HOME=/
- env LANG=C.UTF-8 guix-daemon --build-users-group=guixbuild &
- guix archive --authorize < /share/guix/ci.guix.gnu.org.pub
- guix archive --authorize < /share/guix/bordeaux.guix.gnu.org.pub
- guix describe
- time guix install --verbosity=0 mono graphviz ghostscript
- GUIX_PROFILE="//.guix-profile"
- . "$GUIX_PROFILE/etc/profile"
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) syntax-check
- make texi-stamps-to-mtime-NEWS V=1 # align b-guix with r-guix on git tag's
- time make -j$(nproc) check V=1 VERBOSE=t
- time make V=1 dist
- !reference [.save-artifacts, script]
# https://docs.gitlab.com/ci/runners/hosted_runners/macos/
B-macOS14Xcode15:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_MACOS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
stage: build
image: macos-14-xcode-15
tags: [ saas-macos-medium-m1 ]
variables:
HOMEBREW_NO_AUTO_UPDATE: 1
HOMEBREW_NO_INSTALL_UPGRADE: 1
HOMEBREW_NO_INSTALL_CLEANUP: 1
HOMEBREW_NO_INSTALLED_DEPENDENTS_CHECK: 1
WERROR_CFLAGS: "-Wno-error=format-nonliteral -Wno-error=format-security"
before_script:
- brew install wget autoconf automake libtool gengetopt help2man texinfo graphviz coreutils
script:
- PATH="$HOMEBREW_PREFIX/opt/coreutils/libexec/gnubin:$PATH"; export PATH
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error
- make -j$(nproc) syntax-check
- make -j$(nproc) check -k V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
B-macOS15Xcode16:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_MACOS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
stage: build
image: macos-15-xcode-16
tags: [ saas-macos-large-m2pro ]
variables:
HOMEBREW_NO_AUTO_UPDATE: 1
HOMEBREW_NO_INSTALL_UPGRADE: 1
HOMEBREW_NO_INSTALL_CLEANUP: 1
HOMEBREW_NO_INSTALLED_DEPENDENTS_CHECK: 1
WERROR_CFLAGS: "-Wno-error=format-nonliteral -Wno-error=format-security"
before_script:
- brew install wget autoconf automake libtool gengetopt help2man texinfo graphviz coreutils
script:
- PATH="$HOMEBREW_PREFIX/opt/coreutils/libexec/gnubin:$PATH"; export PATH
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error
- make -j$(nproc) syntax-check
- make -j$(nproc) check -k V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
B-Ubuntu-rolling:
image: ubuntu:rolling
stage: build
before_script:
- cat /etc/os-release
- time apt-get update
- time apt-get install -y make git wget autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-java --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) distcheck V=1 VERBOSE=t
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/src out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* out/$CI_JOB_NAME_SLUG/
B-clang:
image: silkeh/clang:latest
stage: build
before_script:
- cat /etc/os-release
- clang --version
- time apt-get update -q
- time apt-get install -y -q --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs help2man gengetopt gperf
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error CC="clang -std=gnu2x" --disable-doc
- time make -k syntax-check
- time make V=1 VERBOSE=t check clean
- time ./configure --enable-gcc-warnings=error CC="clang -std=c23"
B-gcc:
image: gcc:latest
stage: build
before_script:
- cat /etc/os-release
- gcc --version
- time apt-get update -q
- time apt-get install -y -q --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs help2man valgrind gengetopt gperf
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error CC="gcc -std=gnu2x" --disable-doc
- time make -k syntax-check
- time make V=1 VERBOSE=t check clean
- time ./configure --enable-gcc-warnings CC="gcc -std=c23"
# https://docs.gitlab.com/ee/ci/runners/hosted_runners/windows.html
B-Windows-UCRT64:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_WINDOWS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ saas-windows-medium-amd64 ]
stage: build
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=format-nonliteral -Wno-error=format-security -Wno-error=suggest-attribute=format"
script: # https://www.msys2.org/docs/ci/#other-systems
- wget.exe -nv -O msys2.exe https://github.com/msys2/msys2-installer/releases/download/nightly-x86_64/msys2-base-x86_64-latest.sfx.exe
- ./msys2.exe -y -oC:\
- Remove-Item msys2.exe
- $env:CHERE_INVOKING = 'yes'
- $env:MSYSTEM = 'UCRT64' # https://www.msys2.org/docs/environments/
- C:\msys64\usr\bin\bash -lc ' '
- C:\msys64\usr\bin\bash -lc 'pacman --noconfirm -Syuu'
- |
C:\msys64\usr\bin\bash -lcx '
pacman --noconfirm -Syu git wget autoconf automake libtool make mingw-w64-ucrt-x86_64-gcc python gtk-doc help2man gengetopt gperf patch gettext-devel
# https://docs.github.com/en/get-started/getting-started-with-git/configuring-git-to-handle-line-endings
file configure.ac
git config --global core.autocrlf false
git config --global core.eol lf
git rm -rf --cached . | tail
git reset --hard HEAD
git status
git describe
GNULIB_REVISION=$(. bootstrap.conf >&2; echo $GNULIB_REVISION)
wget -nv https://gitlab.com/libidn/gnulib-mirror/-/archive/$GNULIB_REVISION/gnulib-mirror-$GNULIB_REVISION.tar.gz
tar xfa gnulib-mirror-$GNULIB_REVISION.tar.gz
rm -fv gnulib-mirror-$GNULIB_REVISION.tar.gz
export GNULIB_SRCDIR=gnulib-mirror-$GNULIB_REVISION
./bootstrap --skip-po --no-git
./configure --enable-gcc-warnings=error --disable-doc
git status
make -j$(nproc) V=1 -k check VERBOSE=t'
- C:\msys64\usr\bin\bash -lc 'grep PACKAGE_VERSION config.h | grep -v modified'
- C:\msys64\usr\bin\bash -lc 'grep ^PASS tests/tst_idna.log'
0-compare:
image: alpine:latest
stage: repro
needs: [ Q-Debian-testing, B-AlmaLinux8, B-AlmaLinux9, B-RockyLinux8, B-RockyLinux9, B-Trisquel11, B-Ubuntu2204, B-PureOS10, B-Debian11, B-Debian9, B-Debian12, B-Devuan5, B-Debian-testing, B-Guix, B-Fedora-latest, B-Ubuntu-rolling, B-Ubuntu2404-arm64, B-Ubuntu2404, R-Guix, R-Debian12, R-Ubuntu2404, S-Trisquel10, S-Ubuntu2004, T-Trisquel10, T-Ubuntu2004 ]
script:
- cd out
- sha256sum */*.tar.* */*/*.tar.* | sort | grep -- -src.tar.
- sha256sum */*.tar.* */*/*.tar.* | sort | grep -v -- -src.tar.
- sha256sum */*.tar.* */*/*.tar.* | sort | uniq -c -w64 | sort -rn
- sha256sum */*.tar.* */*/*.tar.* | grep -- -src.tar. | sort | uniq -c -w64 | grep -v '^ 1 '
- sha256sum */*.tar.* */*/*.tar.* | grep -v -- -src.tar. | sort | uniq -c -w64 | grep -v '^ 1 '
# Confirm modern git-archive tarball reproducibility
- cmp b-almalinux8/src/*.tar.gz b-almalinux9/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-debian-testing/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-debian12/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-devuan5/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-rockylinux8/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-rockylinux9/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-ubuntu-rolling/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz b-ubuntu2404-arm64/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz r-debian12/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz r-guix/src/*.tar.gz
- cmp b-almalinux8/src/*.tar.gz r-ubuntu2404/src/*v1.*.tar.gz
# Confirm old git-archive (export-subst but long git describe) tarball reproducibility
- cmp b-trisquel11/src/*.tar.gz b-ubuntu2204/src/*.tar.gz
# Confirm really old git-archive (no export-subst) tarball reproducibility
- cmp b-debian11/src/*.tar.gz b-debian9/src/*.tar.gz
- cmp b-debian11/src/*.tar.gz b-pureos10/src/*.tar.gz
# Confirm 'make dist' generated tarball reproducibility
- cmp b-almalinux8/*.tar.gz b-rockylinux8/*.tar.gz
- cmp b-almalinux9/*.tar.gz b-rockylinux9/*.tar.gz
- cmp b-devuan5/*.tar.gz b-debian12/*.tar.gz
- cmp b-guix/*.tar.gz r-guix/*.tar.gz
- cmp b-pureos10/*.tar.gz b-debian11/*.tar.gz
- cmp b-trisquel11/*.tar.gz b-ubuntu2204/*.tar.gz
- cmp b-ubuntu2404-arm64/*.tar.gz b-ubuntu2404/*.tar.gz
- cmp t-trisquel10/*.tar.gz t-ubuntu2004/*.tar.gz
# Confirm 'make dist' from git-archive tarball reproducibility
- cmp s-trisquel10/*.tar.gz s-ubuntu2004/*.tar.gz
artifacts:
expire_in: 2 weeks
when: always
paths:
- ./out/**
R-Guix:
tags: [ saas-linux-medium-amd64 ]
image: registry.gitlab.com/debdistutils/guix/container:extra
stage: repro
needs: []
before_script:
- cp -rL /gnu/store/*profile/etc/* /etc/
- echo 'root:x:0:0:root:/:/bin/sh' > /etc/passwd
- echo 'root:x:0:' > /etc/group
- groupadd --system guixbuild
- for i in $(seq -w 1 10); do useradd -g guixbuild -G guixbuild -d /var/empty -s $(command -v nologin) -c "Guix build user $i" --system guixbuilder$i; done
- export HOME=/
- env LANG=C.UTF-8 guix-daemon --build-users-group=guixbuild &
- guix archive --authorize < /share/guix/ci.guix.gnu.org.pub
- guix archive --authorize < /share/guix/bordeaux.guix.gnu.org.pub
- guix describe
- time guix install --verbosity=0 mono graphviz ghostscript
- GUIX_PROFILE="//.guix-profile"
- . "$GUIX_PROFILE/etc/profile"
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --no-git
- time ./configure
- time make V=1 syntax-check
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) dist V=1 VERBOSE=t
- git status
- git diff --exit-code
- gpg --batch --passphrase '' --quick-gen-key pipeline@example.org
- git checkout -B cibranch
- git config user.email "pipeline@example.org"
- git config user.name "Pipeline Builder"
- git config user.signingkey pipeline@example.org
- |
if test -z "$CI_COMMIT_TAG"; then
sed -i '3i * Noteworthy changes in release ?.? (????-??-??) [?]\n\n** WARNING This release was prepared automatically with no testing.\n' NEWS
sed -i -e 's,STRINGPREP_VERSION ".*",STRINGPREP_VERSION "97.23.42",' lib/stringprep.h
git commit -m "Warn about automatic release." NEWS lib/stringprep.h
relver='97.23.42'
reltyp='alpha'
else # maintainer ran release-commit
relver=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\1/p' | head -1)
reltyp=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\2/p' | head -1)
fi
- test "$relver" != "97.23.42" || make release-commit RELEASE="$relver $reltyp"
- make release RELEASE="$relver $reltyp" V=1 VERBOSE=t AM_DISTCHECK_DVI_TARGET=
- cat -n ~/announce-*
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/{src,rel,log}
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- test "$relver" != "97.23.42" || mv -v *97.23.42* out/$CI_JOB_NAME_SLUG/rel/
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* ~/announce-* out/$CI_JOB_NAME_SLUG/
R-Debian12:
tags: [ saas-linux-medium-amd64 ]
image: debian:12-slim
stage: repro
needs: []
before_script:
- cat /etc/os-release
- time apt-get update -q
- time apt-get install -y -q eatmydata
- time apt-get update
- time eatmydata apt-get install -y -q make git wget autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless wget
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error
- time make syntax-check
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) dist V=1 VERBOSE=t
- sha256sum *.tar.*
- git status
- git diff --exit-code
- time apt-get install -y -q --no-install-recommends gpg gpgv2 gpg-agent
- gpg --batch --passphrase '' --quick-gen-key pipeline@example.org
- git checkout -B cibranch
- git config user.email "pipeline@example.org"
- git config user.name "Pipeline Builder"
- git config user.signingkey pipeline@example.org
- |
if test -z "$CI_COMMIT_TAG"; then
sed -i '3i * Noteworthy changes in release ?.? (????-??-??) [?]\n\n** WARNING This release was prepared automatically with no testing.\n' NEWS
sed -i -e 's,STRINGPREP_VERSION ".*",STRINGPREP_VERSION "97.23.42",' lib/stringprep.h
git commit -m "Warn about automatic release." NEWS lib/stringprep.h
relver='97.23.42'
reltyp='alpha'
else # maintainer ran release-commit
relver=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\1/p' | head -1)
reltyp=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\2/p' | head -1)
fi
- test "$relver" != "97.23.42" || make release-commit RELEASE="$relver $reltyp"
- make release RELEASE="$relver $reltyp" V=1 VERBOSE=t
- cat -n ~/announce-*
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/{src,rel,log}
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- test "$relver" != "97.23.42" || mv -v *97.23.42* out/$CI_JOB_NAME_SLUG/rel/
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* ~/announce-* out/$CI_JOB_NAME_SLUG/
R-Ubuntu2404:
image: ubuntu:24.04
tags: [ saas-linux-medium-amd64 ]
stage: repro
needs: []
before_script:
- cat /etc/os-release
- time apt-get update -q
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -qqy --no-install-recommends make git wget autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz ghostscript dotnet8 gperf default-jdk-headless patch codespell indent
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings
- time make -j$(nproc) syntax-check
- time make -j$(nproc) check V=1 VERBOSE=t
- time make -j$(nproc) dist
- sha256sum *.tar.*
- git status
- git diff --exit-code # nothing should change version controlled files
- apt-get install -y -q gpg gpgv
- gpg --batch --passphrase '' --quick-gen-key pipeline@example.org
- git checkout $CI_COMMIT_BRANCH
- git config user.email "pipeline@example.org"
- git config user.name "Pipeline Builder"
- git config user.signingkey pipeline@example.org
- |
if test -z "$CI_COMMIT_TAG"; then
sed -i '3i * Noteworthy changes in release ?.? (????-??-??) [?]\n\n** WARNING This release was prepared automatically with no testing.\n' NEWS
sed -i -e 's,STRINGPREP_VERSION ".*",STRINGPREP_VERSION "97.23.42",' lib/stringprep.h
git commit -m "Warn about automatic release." NEWS lib/stringprep.h
relver='97.23.42'
reltyp='alpha'
else # maintainer ran release-commit
relver=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\1/p' | head -1)
reltyp=$(cat NEWS | sed -n -e 's/.*release \([0-9.]\+\) (....-..-..) \[\(.*\)\].*/\2/p' | head -1)
fi
- test "$relver" != "97.23.42" || make release-commit RELEASE="$relver $reltyp"
- make release RELEASE="$relver $reltyp" V=1 VERBOSE=t
- cat -n ~/announce-*
- git diff --exit-code # nothing should change version controlled files
- sha256sum *.tar.*
- mkdir -pv out/$CI_JOB_NAME_SLUG/{src,rel,log}
- find config.h *.log tests/*.log -exec mv -v {} out/$CI_JOB_NAME_SLUG/log \;
- test "$relver" != "97.23.42" || mv -v *97.23.42* out/$CI_JOB_NAME_SLUG/rel/
- mv -v *-src.tar.* out/$CI_JOB_NAME_SLUG/src/
- mv -v *.tar.* ~/announce-* out/$CI_JOB_NAME_SLUG/
T-Trisquel10:
tags: [ saas-linux-medium-amd64 ]
image: docker.io/kpengboy/trisquel:10.0
stage: repro
needs: [B-Guix]
before_script:
- cat /etc/os-release
- sed -i 's,http://archive.trisquel.info/trisquel,http://ftp.acc.umu.se/mirror/trisquel/packages,' /etc/apt/sources.list
- time apt-get update -q
- time apt-get install -q -y --no-install-recommends make git wget ca-certificates autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz ghostscript mono-mcs gperf default-jdk-headless codespell datefudge patch
script:
- mkdir -pv ../b
- cd ../b
- tar xfz ../libidn/out/b-guix/src/libidn-*.tar.gz
- cd $(tar tfa ../libidn/out/b-guix/src/libidn-*.tar.gz | head -n1)
- !reference [.gnulib-fetch, script]
- time datefudge "5 years" ./bootstrap --skip-po --no-git
- time datefudge "5 years" ./configure --enable-gcc-warnings=error
- grep '^HAVE_DOTNET = $' Makefile > /dev/null
- grep '^HAVE_MONO = 1$' Makefile > /dev/null
- time datefudge "5 years" make -j$(nproc) syntax-check exclude_file_name_regexp--sc_copyright_check='version-etc.c|doc/libidn.texi'
- time datefudge "5 years" make -j$(nproc) check V=1 VERBOSE=t
- time datefudge "5 years" make -j$(nproc) distcheck
- sha256sum *.tar.*
- mkdir -pv ../../libidn/out/$CI_JOB_NAME_SLUG/src ../../libidn/out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} ../out/$CI_JOB_NAME_SLUG/log \;
- mv -v *.tar.* ../../libidn/out/$CI_JOB_NAME_SLUG/
T-Ubuntu2004:
tags: [ saas-linux-medium-amd64 ]
image: ubuntu:20.04
stage: repro
needs: [B-Guix]
variables:
DEBIAN_FRONTEND: noninteractive
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -y --no-install-recommends make git wget ca-certificates autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz ghostscript mono-mcs gperf default-jdk-headless codespell datefudge patch | tee pkgs.log | tail
script:
- tar xfz out/b-guix/src/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/src/libidn-*.tar.gz | head -n1)
- !reference [.gnulib-fetch, script]
- time datefudge "5 years ago" ./bootstrap --skip-po --no-git
- time datefudge "5 years ago" ./configure --enable-gcc-warnings=error
- grep '^HAVE_DOTNET = $' Makefile > /dev/null
- grep '^HAVE_MONO = 1$' Makefile > /dev/null
- time datefudge "5 years ago" make -j$(nproc) syntax-check exclude_file_name_regexp--sc_copyright_check='version-etc.c|doc/libidn.texi'
- time datefudge "5 years ago" make -j$(nproc) check V=1 VERBOSE=t
- time datefudge "5 years ago" make -j$(nproc) distcheck V=1 VERBOSE=t
- sha256sum *.tar.*
- mkdir -pv ../out/$CI_JOB_NAME_SLUG/log
- find config.h *.log tests/*.log -exec mv -v {} ../out/$CI_JOB_NAME_SLUG/log \;
- mv -v *.tar.* ../out/$CI_JOB_NAME_SLUG/
S-Trisquel10:
tags: [ saas-linux-medium-amd64 ]
image: docker.io/kpengboy/trisquel:10.0
stage: repro
needs: [B-Guix]
before_script:
- cat /etc/os-release
- sed -i 's,http://archive.trisquel.info/trisquel,http://ftp.acc.umu.se/mirror/trisquel/packages,' /etc/apt/sources.list
- time apt-get update -y
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -y make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell
script:
- mkdir -pv ../b
- cd ../b
- tar xfz ../*/out/b-guix/src/*-*.tar.gz
- cd $(tar tfa ../*/out/b-guix/src/*-*.tar.gz | head -n1)
- !reference [.gnulib-fetch, script]
- time ./bootstrap --no-git
- time ./configure --enable-gcc-warnings=error
- grep '^VERSION = ' Makefile | grep -v UNKNOWN
- time make -j$(nproc) check V=1 VERBOSE=t
- src/idn --version | head -1 | grep -v UNKNOWN
- time make -j$(nproc) dist AM_DISTCHECK_DVI_TARGET=
- sha256sum *.tar.*
- mkdir -pv $CI_PROJECT_DIR/out/$CI_JOB_NAME_SLUG/{src,log}
- find config.h *.log tests/*.log -exec mv -v {} $CI_PROJECT_DIR/out/$CI_JOB_NAME_SLUG/log \;
- mv -v *.tar.* $CI_PROJECT_DIR/out/$CI_JOB_NAME_SLUG/
S-Ubuntu2004:
tags: [ saas-linux-medium-amd64 ]
image: ubuntu:20.04
stage: repro
needs: [B-Guix]
variables:
DEBIAN_FRONTEND: noninteractive
before_script:
- cat /etc/os-release
- sed -i 's,http://archive.trisquel.info/trisquel,http://ftp.acc.umu.se/mirror/trisquel/packages,' /etc/apt/sources.list
- time apt-get update -y
- time apt-get install -y -q eatmydata
- time eatmydata apt-get install -y make git wget autoconf automake libtool gettext autopoint cvs texinfo help2man gtk-doc-tools valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell
script:
- tar xfz out/b-guix/src/*-*.tar.gz
- cd $(tar tfa out/b-guix/src/*-*.tar.gz | head -n1)
- !reference [.gnulib-fetch, script]
- time ./bootstrap --no-git
- time ./configure --enable-gcc-warnings=error
- grep '^VERSION = ' Makefile | grep -v UNKNOWN
- time make -j$(nproc) check V=1 VERBOSE=t
- src/idn --version | head -1 | grep -v UNKNOWN
- time make -j$(nproc) dist AM_DISTCHECK_DVI_TARGET=
- sha256sum *.tar.*
- mkdir -pv ../out/$CI_JOB_NAME_SLUG/{src,log}
- find config.h *.log tests/*.log -exec mv -v {} ../out/$CI_JOB_NAME_SLUG/log \;
- mv -v *.tar.* ../out/$CI_JOB_NAME_SLUG/
AlmaLinux8:
image: almalinux:8
stage: test
needs: [B-Guix]
before_script:
- time dnf -y install make gcc diffutils valgrind | tee pkgs.log | tail
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
AlmaLinux10:
image: almalinux:10-kitten
stage: test
needs: [B-Guix]
before_script:
- dnf -y install make gcc diffutils valgrind gzip
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
AlmaLinux10-clang:
image: almalinux:10-kitten
stage: test
needs: [B-Guix]
before_script:
- dnf -y install make clang diffutils valgrind gzip
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure CC=clang --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
AlmaLinux10-arm64:
image: almalinux:10-kitten
tags: [ saas-linux-small-arm64 ]
stage: test
needs: [B-Guix]
before_script:
- dnf -y install make gcc diffutils valgrind gzip
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
AlmaLinux10-ppc64:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_PPC64_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ ppc64 ]
image: almalinux:10-kitten
stage: test
needs: [B-Guix]
before_script:
- dnf -y install make gcc diffutils valgrind gzip
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Alpine-mold:
image: alpine:latest
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- apk update
- apk add build-base mold
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=format-nonliteral"
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error CC='cc -fuse-ld=mold'
- make -j$(nproc) check V=1 VERBOSE=t 2>&1 | tee build.log
- (! grep -E 'mold. warning' build.log)
- grep 'mold ' lib/.libs/libidn.so
ArchLinux:
image: archlinux:latest
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- pacman -Syu --noconfirm make gcc diffutils
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- time ../configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Armcross:
image: debian:12-slim
stage: test
needs: [B-Guix]
before_script:
- time apt-get update -qq
- time apt-get install -y -qq make gcc-arm-linux-gnueabi qemu-user qemu-user-binfmt file binfmt-support | tee pkgs.log | tail
- update-binfmts --enable qemu-arm
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- ../configure --enable-gcc-warnings=error --host=arm-linux-gnueabi CFLAGS="-static --static"
- make -j$(nproc) V=1
- file src/idn
- LANG=C.UTF-8 qemu-arm src/idn --debug foo
- time make -k -j$(nproc) check V=1 VERBOSE=t
OracleLinux7:
image: oraclelinux:7
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- yum -y install make gcc diffutils valgrind
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Debian3:
image: debian/eol:woody
stage: test
needs: [B-Guix]
before_script:
- time apt-get update
- time apt-get install -y -qq make gcc libc-dev
script:
- tar xfz out/b-guix/libidn-*.tar.gz
- cd $(tar tfz out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings
- time make check V=1 VERBOSE=t
Debian3.1:
image: debian/eol:sarge
stage: test
needs: [B-Guix]
before_script:
- time apt-get update
- time apt-get install -y -qq make gcc libc-dev
script:
- tar xfz out/b-guix/libidn-*.tar.gz
- cd $(tar tfz out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make check V=1 VERBOSE=t
Debian4:
image: debian/eol:etch
stage: test
needs: [B-Guix]
before_script:
- time apt-get update
- time apt-get install -y -qq make gcc libc-dev
script:
- tar xfz out/b-guix/libidn-*.tar.gz
- cd $(tar tfz out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make check V=1 VERBOSE=t
Debian10:
image: debian:10-slim
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- time apt-get update
- time apt-get install -y -qq make gcc
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- time ../configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Debian12-ppc64:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_PPC64_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ ppc64 ]
image: debian:12
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- time apt-get update
- time apt-get install -y -qq make gcc
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- time ../configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Fedora-latest:
image: fedora:latest
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- dnf -y install make gcc diffutils valgrind
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Guix:
image: registry.gitlab.com/debdistutils/guix/container:latest
stage: test
needs: [B-Guix]
before_script:
- cp -rL /gnu/store/*profile/etc/* /etc/
- echo 'root:x:0:0:root:/:/bin/sh' >> /etc/passwd
- groupadd --system guixbuild
- for i in $(seq -w 1 10); do useradd -g guixbuild -G guixbuild -d /var/empty -s $(command -v nologin) -c "Guix build user $i" --system guixbuilder$i; done
- export HOME=/
- env LANG=C.UTF-8 guix-daemon --build-users-group=guixbuild &
- guix archive --authorize < /share/guix/ci.guix.gnu.org.pub
- guix archive --authorize < /share/guix/bordeaux.guix.gnu.org.pub
- guix describe
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Mingw32:
image: debian:12-slim
stage: test
needs: [B-Guix]
before_script:
- dpkg --add-architecture i386
- time apt-get update -qq
- time apt-get install -y -qq make mingw-w64 wine wine32 libwine libwine:i386 binfmt-support wine-binfmt
- update-binfmts --enable wine
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=format-nonliteral -Wno-error=format-security -Wno-error=suggest-attribute=format"
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- time ../configure --enable-gcc-warnings=error --host=i686-w64-mingw32 CC='i686-w64-mingw32-gcc -static-libgcc'
- time make -k -j$(nproc) check V=1 VERBOSE=t
Mingw64:
image: debian:12-slim
stage: test
needs: [B-Guix]
before_script:
- time apt-get update -qq
- time apt-get install -y -qq make mingw-w64 wine wine64 binfmt-support wine-binfmt
- update-binfmts --enable wine
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=format-nonliteral -Wno-error=format-security -Wno-error=suggest-attribute=format"
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- mkdir b
- cd b
- time ../configure --enable-gcc-warnings=error --host=x86_64-w64-mingw32
- time make -k -j$(nproc) check V=1 VERBOSE=t
OpenBSD:
tags: [ "openbsd" ]
allow_failure: true
needs: [B-Guix]
stage: test
before_script:
- uname -a
- sysctl hw
script:
- tar xfz out/b-guix/libidn-*.tar.gz
- cd $(tar tfz out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make check V=1 VERBOSE=t
RockyLinux9-ppc64:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_PPC64_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ ppc64 ]
image: rockylinux:9
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- dnf -y install make gcc valgrind
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Ubuntu12.04:
image: ubuntu:12.04
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- perl -pi -e 's/archive.ubuntu.com/old-releases.ubuntu.com/g' /etc/apt/sources.list
- time apt-get update -q
- time apt-get install -y -qq make gcc valgrind
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Ubuntu14.04:
image: ubuntu:14.04
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -y -qq make gcc valgrind
script:
- mkdir -pv ../p
- cd ../p
- tar xfa ../libidn/out/b-guix/libidn-*.tar.gz
- cd $(tar tfa ../libidn/out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --disable-tld --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
Ubuntu-rolling:
image: ubuntu:rolling
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -y -qq git make gcc valgrind gtk-doc-tools texinfo texlive texlive-plain-generic graphviz
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- make -j$(nproc) distcheck
Ubuntu-rolling-arm64:
image: ubuntu:rolling
tags: [ saas-linux-small-arm64 ]
stage: test
needs: [B-Guix]
before_script:
- cat /etc/os-release
- time apt-get update -qq
- time apt-get install -y -qq git make gcc valgrind gtk-doc-tools texinfo
script:
- tar xfa out/b-guix/libidn-*.tar.gz
- cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
- time ./configure --enable-gcc-warnings=error
- time make -j$(nproc) check V=1 VERBOSE=t
- (! make -j$(nproc) distcheck)
- make -j$(nproc) distcheck AM_DISTCHECK_DVI_TARGET=
Windows-MSYS:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_WINDOWS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ saas-windows-medium-amd64 ]
stage: test
needs: [B-Guix]
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=attributes -Wno-error=format-nonliteral -Wno-error=format-security"
script: # https://www.msys2.org/docs/ci/#other-systems
- wget.exe -nv -O msys2.exe https://github.com/msys2/msys2-installer/releases/download/nightly-x86_64/msys2-base-x86_64-latest.sfx.exe
- ./msys2.exe -y -oC:\
- Remove-Item msys2.exe
- $env:CHERE_INVOKING = 'yes'
- $env:MSYSTEM = 'MSYS' # https://www.msys2.org/docs/environments/
- C:\msys64\usr\bin\bash -lc ' '
- C:\msys64\usr\bin\bash -lc 'pacman --noconfirm -Syuu'
- |
C:\msys64\usr\bin\bash -lcx '
pacman --noconfirm -Syu make gcc
tar xfa out/b-guix/libidn-*.tar.gz
cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
./configure --enable-gcc-warnings=error --disable-doc
make -j$(nproc) V=1 -k check VERBOSE=t'
- C:\msys64\usr\bin\bash -lc 'grep ^PASS libidn-*/tests/tst_idna.log'
Windows-MINGW64:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_WINDOWS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
tags: [ saas-windows-medium-amd64 ]
stage: test
needs: [B-Guix]
variables:
WERROR_CFLAGS: "-Wno-error=unused-value -Wno-error=format-nonliteral -Wno-error=format-security -Wno-error=suggest-attribute=format"
script: # https://www.msys2.org/docs/ci/#other-systems
- wget.exe -nv -O msys2.exe https://github.com/msys2/msys2-installer/releases/download/nightly-x86_64/msys2-base-x86_64-latest.sfx.exe
- ./msys2.exe -y -oC:\
- Remove-Item msys2.exe
- $env:CHERE_INVOKING = 'yes'
- $env:MSYSTEM = 'MINGW64' # https://www.msys2.org/docs/environments/
- C:\msys64\usr\bin\bash -lc ' '
- C:\msys64\usr\bin\bash -lc 'pacman --noconfirm -Syuu'
- |
C:\msys64\usr\bin\bash -lcx '
pacman --noconfirm -Syu make mingw-w64-x86_64-gcc
tar xfa out/b-guix/libidn-*.tar.gz
cd $(tar tfa out/b-guix/libidn-*.tar.gz | head -n1)
./configure --enable-gcc-warnings=error --disable-doc
make -j$(nproc) V=1 -k check VERBOSE=t'
- C:\msys64\usr\bin\bash -lc 'grep ^PASS libidn-*/tests/tst_idna.log'
macOS13Xcode14:
rules:
- if: $CI_PIPELINE_SOURCE == "merge_request_event"
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
- if: $LIBIDN_CI_RUN_MACOS_JOBS
- if: $LIBIDN_CI_MANUAL_JOBS
when: manual
image: macos-13-xcode-14
tags: [ saas-macos-medium-m1 ]
stage: test
needs: [B-Guix]
variables:
WERROR_CFLAGS: "-Wno-error=format-nonliteral -Wno-error=format-security"
script:
- gzip -cd out/b-guix/libidn-*.tar.gz | tar xf -
- cd $(gzip -cd out/b-guix/libidn-*.tar.gz | tar tf - | head -n1)
- mkdir b
- cd b
- ../configure --enable-gcc-warnings=error
- make -j$(nproc) syntax-check
- make -j$(nproc) V=1 check -k VERBOSE=t
.pages:
image: debian:testing-slim
stage: build
before_script:
- time apt-get update -qq
- time apt-get install -y -q make git wget autoconf automake libtool gettext autopoint cvs texinfo texlive texlive-plain-generic texlive-extra-utils help2man gtk-doc-tools dblatex valgrind gengetopt graphviz mono-mcs gperf default-jdk-headless codespell | tee pkgs.log | tail
script:
- !reference [.gnulib-fetch, script]
- time ./bootstrap --skip-po --no-git
- time ./configure --enable-gcc-warnings=error --enable-java --enable-gtk-doc --enable-gtk-doc-pdf
- time make V=1
- mkdir -p public
- rm -rf public/reference
- mv doc/reference/html public/reference
- make web-manual
- test -f doc/manual/libidn.pdf
- rm -rf public/manual
- mv -v doc/manual public/manual
artifacts:
when: on_success
paths:
- public
pages:
extends: .pages
rules:
- if: $CI_COMMIT_BRANCH == $CI_DEFAULT_BRANCH
pages-test:
extends: .pages
rules:
- if: $CI_COMMIT_BRANCH != $CI_DEFAULT_BRANCH
libidn-v1.43/.prev-version 0000664 0000000 0000000 00000000005 14767240365 0015541 0 ustar 00root root 0000000 0000000 1.42
libidn-v1.43/.tarball-version-git 0000664 0000000 0000000 00000000006 14767240365 0016770 0 ustar 00root root 0000000 0000000 v1.43
libidn-v1.43/AUTHORS 0000664 0000000 0000000 00000001720 14767240365 0014156 0 ustar 00root root 0000000 0000000 Libidn AUTHORS -- Information about the authors.
Copyright (C) 2002-2025 Simon Josefsson
See the end for copying conditions.
Simon Josefsson
Designed and implemented libidn.
Thomas Jacob
Contributed TLD support.
Oliver Hitz
Contributed Java implementation.
Stefan Larsson
Optimized Java implementation. Added Maven support.
Alexander Gnauck
Contributed C# port.
Adam Strzelecki
Contributed Windows Visual Studio project files.
Tim Ruehsen
Added fuzzing and OSS-Fuzz integration.
Fixed bugs and performance issues found by fuzzing.
Modernized GTK-Doc build.
Fixed build issues.
----------------------------------------------------------------------
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/CONTRIBUTING.md 0000664 0000000 0000000 00000007507 14767240365 0015350 0 ustar 00root root 0000000 0000000 # Contributing to Libidn
This file contains instructions for developers and advanced users.
## Obtaining sources
Download the version controlled sources:
```
$ git clone https://git.savannah.gnu.org/git/libidn.git
$ cd libidn
```
## Dependencies
If you wish to build the project from version controlled sources,
rebuild all generated files (e.g., run autoreconf), or modify some
source code files, you will need to have additional tools installed
beyond those mentioned in [DEPENDENCIES.md](DEPENDENCIES.md). None of
the following tools are necessary if you build Libidn in the usual way
(i.e., ./configure && make).
- Make
- C compiler
- Automake
- Autoconf
- Libtool
- Gettext
- Texinfo
- Gperf
- help2man
- Gengetopt
- Tar
- Gzip
- Texlive & epsf (for PDF manual)
- GTK-DOC (for API manual)
- Git
- Perl
- Valgrind (optional)
- OpenJDK (for java port)
- Mono mcs (for C# port)
- dot (to generate doc/libidn-components.*)
- Ghostscript (to edit PDF timestamps)
The software is typically distributed with your operating system, and
the instructions for installing them differ. Here are some hints:
APT/DPKG-based distributions:
```
apt-get install make git autoconf automake libtool gettext autopoint cvs
apt-get install texinfo texlive texlive-plain-generic texlive-extra-utils
apt-get install help2man gtk-doc-tools dblatex valgrind gengetopt
apt-get install graphviz ghostscript mono-mcs gperf default-jdk-headless
```
DNF/RPM-based distributions:
```
dnf install -y make git autoconf automake libtool gettext-devel cvs
dnf install -y texinfo texinfo-tex texlive
dnf install -y help2man gtk-doc gengetopt dblatex valgrind
dnf install -y gperf java-latest-openjdk-devel
```
On macOS with Xcode and Homebrew:
```
brew install autoconf automake libtool gengetopt help2man texinfo graphviz
```
To download the version controlled sources:
```
git clone https://git.savannah.gnu.org/git/libidn.git
cd libidn
```
The next step is to import gnulib files, run autoreconf etc:
```
./bootstrap
```
If you have a local checkout of gnulib and wants to avoid download
another copy, you may want to use:
```
./bootstrap --gnulib-refdir=../gnulib
```
Then configure the project as you would normally, for example:
```
./configure --enable-java --enable-gtk-doc-pdf
```
Then build the project:
```
make
make check
```
To prepare releases you need some additional tools:
- Mingw (to produce Windows binaries)
- Wine (to self-check Windows binaries)
- Lcov (to produce coverage HTML pages)
- Zip (to pack Windows binaries)
- Clang (to produce clang analysis)
- Doxygen (to produce doxygen manual)
- pmccabe (to produce cyclomatic code complexity report)
- ncftpput (to upload source tarballs)
APT/DPKG-based distributions:
```
apt-get install mingw-w64 wine binfmt-support lcov zip
apt-get install clang doxygen pmccabe ncftp
```
See README-release on how to make a release.
Happy hacking!
----------------------------------------------------------------------
Copyright (C) 2009-2025 Simon Josefsson
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/COPYING 0000664 0000000 0000000 00000104516 14767240365 0014150 0 ustar 00root root 0000000 0000000 GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
.
libidn-v1.43/COPYING.LESSERv2 0000664 0000000 0000000 00000063642 14767240365 0015420 0 ustar 00root root 0000000 0000000 GNU LESSER GENERAL PUBLIC LICENSE
Version 2.1, February 1999
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use,
not price. Our General Public Licenses are designed to make sure that
you have the freedom to distribute copies of free software (and charge
for this service if you wish); that you receive source code or can get
it if you want it; that you can change the software and use pieces of
it in new free programs; and that you are informed that you can do
these things.
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights. These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you. You must make sure that they, too, receive or can get the source
code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and
modification follow. Pay close attention to the difference between a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".
A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.
The "Library", below, refers to any such software library or work
which has been distributed under these terms. A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is
included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for
making modifications to it. For a library, complete source code means
all the source code for all modules it contains, plus any associated
interface definition files, plus the scripts used to control compilation
and installation of the library.
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it). Whether that is true depends on what the Library does
and what the program that uses the Library does.
1. You may copy and distribute verbatim copies of the Library's
complete source code as you receive it, in any medium, provided that
you conspicuously and appropriately publish on each copy an
appropriate copyright notice and disclaimer of warranty; keep intact
all the notices that refer to this License and to the absence of any
warranty; and distribute a copy of this License along with the
Library.
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
2. You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) The modified work must itself be a software library.
b) You must cause the files modified to carry prominent notices
stating that you changed the files and the date of any change.
c) You must cause the whole of the work to be licensed at no
charge to all third parties under the terms of this License.
d) If a facility in the modified Library refers to a function or a
table of data to be supplied by an application program that uses
the facility, other than as an argument passed when the facility
is invoked, then you must make a good faith effort to ensure that,
in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of
its purpose remains meaningful.
(For example, a function in a library to compute square roots has
a purpose that is entirely well-defined independent of the
application. Therefore, Subsection 2d requires that any
application-supplied function or table used by this function must
be optional: if the application does not supply it, the square
root function must still compute square roots.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Library,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Library, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote
it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Library.
In addition, mere aggregation of another work not based on the Library
with the Library (or with a work based on the Library) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library. To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.
4. You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you accompany
it with the complete corresponding machine-readable source code, which
must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.
If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.
5. A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library". Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.
However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library". The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library. The
threshold for this to be true is not precisely defined by law.
If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the
Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
6. As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License. You must supply a copy of this License. If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one
of these things:
a) Accompany the work with the complete corresponding
machine-readable source code for the Library including whatever
changes were used in the work (which must be distributed under
Sections 1 and 2 above); and, if the work is an executable linked
with the Library, with the complete machine-readable "work that
uses the Library", as object code and/or source code, so that the
user can modify the Library and then relink to produce a modified
executable containing the modified Library. (It is understood
that the user who changes the contents of definitions files in the
Library will not necessarily be able to recompile the application
to use the modified definitions.)
b) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (1) uses at run time a
copy of the library already present on the user's computer system,
rather than copying library functions into the executable, and (2)
will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is
interface-compatible with the version that the work was made with.
c) Accompany the work with a written offer, valid for at
least three years, to give the same user the materials
specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.
d) If distribution of the work is made by offering access to copy
from a designated place, offer equivalent access to copy the above
specified materials from the same place.
e) Verify that the user has already received a copy of these
materials or that you have already sent this user a copy.
For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it. However, as a special exception,
the materials to be distributed need not include anything that is
normally distributed (in either source or binary form) with the major
components (compiler, kernel, and so on) of the operating system on
which the executable runs, unless that component itself accompanies
the executable.
It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
library, provided that the separate distribution of the work based on
the Library and of the other library facilities is otherwise
permitted, and provided that you do these two things:
a) Accompany the combined library with a copy of the same work
based on the Library, uncombined with any other library
facilities. This must be distributed under the terms of the
Sections above.
b) Give prominent notice with the combined library of the fact
that part of it is a work based on the Library, and explaining
where to find the accompanying uncombined form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute
the Library except as expressly provided under this License. Any
attempt otherwise to copy, modify, sublicense, link with, or
distribute the Library is void, and will automatically terminate your
rights under this License. However, parties who have received copies,
or rights, from you under this License will not have their licenses
terminated so long as such parties remain in full compliance.
9. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Library or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.
10. Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
subject to these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.
11. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Library.
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply,
and the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
12. If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library under this License may add
an explicit geographical distribution limitation excluding those countries,
so that distribution is permitted only in or among countries not thus
excluded. In such case, this License incorporates the limitation as if
written in the body of this License.
13. The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Library
specifies a version number of this License which applies to it and
"any later version", you have the option of following the terms and
conditions either of that version or of any later version published by
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this. Our
decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing
and reuse of software generally.
NO WARRANTY
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Libraries
If you develop a new library, and you want it to be of the greatest
possible use to the public, we recommend making it free software that
everyone can redistribute and change. You can do so by permitting
redistribution under these terms (or, alternatively, under the terms of the
ordinary General Public License).
To apply these terms, attach the following notices to the library. It is
safest to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least the
"copyright" line and a pointer to where the full notice is found.
Copyright (C)
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Also add information on how to contact you by electronic and paper mail.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the library, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
, 1 April 1990
Ty Coon, President of Vice
That's all there is to it!
libidn-v1.43/COPYING.LESSERv3 0000664 0000000 0000000 00000016743 14767240365 0015421 0 ustar 00root root 0000000 0000000 GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
This version of the GNU Lesser General Public License incorporates
the terms and conditions of version 3 of the GNU General Public
License, supplemented by the additional permissions listed below.
0. Additional Definitions.
As used herein, "this License" refers to version 3 of the GNU Lesser
General Public License, and the "GNU GPL" refers to version 3 of the GNU
General Public License.
"The Library" refers to a covered work governed by this License,
other than an Application or a Combined Work as defined below.
An "Application" is any work that makes use of an interface provided
by the Library, but which is not otherwise based on the Library.
Defining a subclass of a class defined by the Library is deemed a mode
of using an interface provided by the Library.
A "Combined Work" is a work produced by combining or linking an
Application with the Library. The particular version of the Library
with which the Combined Work was made is also called the "Linked
Version".
The "Minimal Corresponding Source" for a Combined Work means the
Corresponding Source for the Combined Work, excluding any source code
for portions of the Combined Work that, considered in isolation, are
based on the Application, and not on the Linked Version.
The "Corresponding Application Code" for a Combined Work means the
object code and/or source code for the Application, including any data
and utility programs needed for reproducing the Combined Work from the
Application, but excluding the System Libraries of the Combined Work.
1. Exception to Section 3 of the GNU GPL.
You may convey a covered work under sections 3 and 4 of this License
without being bound by section 3 of the GNU GPL.
2. Conveying Modified Versions.
If you modify a copy of the Library, and, in your modifications, a
facility refers to a function or data to be supplied by an Application
that uses the facility (other than as an argument passed when the
facility is invoked), then you may convey a copy of the modified
version:
a) under this License, provided that you make a good faith effort to
ensure that, in the event an Application does not supply the
function or data, the facility still operates, and performs
whatever part of its purpose remains meaningful, or
b) under the GNU GPL, with none of the additional permissions of
this License applicable to that copy.
3. Object Code Incorporating Material from Library Header Files.
The object code form of an Application may incorporate material from
a header file that is part of the Library. You may convey such object
code under terms of your choice, provided that, if the incorporated
material is not limited to numerical parameters, data structure
layouts and accessors, or small macros, inline functions and templates
(ten or fewer lines in length), you do both of the following:
a) Give prominent notice with each copy of the object code that the
Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the object code with a copy of the GNU GPL and this license
document.
4. Combined Works.
You may convey a Combined Work under terms of your choice that,
taken together, effectively do not restrict modification of the
portions of the Library contained in the Combined Work and reverse
engineering for debugging such modifications, if you also do each of
the following:
a) Give prominent notice with each copy of the Combined Work that
the Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the Combined Work with a copy of the GNU GPL and this license
document.
c) For a Combined Work that displays copyright notices during
execution, include the copyright notice for the Library among
these notices, as well as a reference directing the user to the
copies of the GNU GPL and this license document.
d) Do one of the following:
0) Convey the Minimal Corresponding Source under the terms of this
License, and the Corresponding Application Code in a form
suitable for, and under terms that permit, the user to
recombine or relink the Application with a modified version of
the Linked Version to produce a modified Combined Work, in the
manner specified by section 6 of the GNU GPL for conveying
Corresponding Source.
1) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (a) uses at run time
a copy of the Library already present on the user's computer
system, and (b) will operate properly with a modified version
of the Library that is interface-compatible with the Linked
Version.
e) Provide Installation Information, but only if you would otherwise
be required to provide such information under section 6 of the
GNU GPL, and only to the extent that such information is
necessary to install and execute a modified version of the
Combined Work produced by recombining or relinking the
Application with a modified version of the Linked Version. (If
you use option 4d0, the Installation Information must accompany
the Minimal Corresponding Source and Corresponding Application
Code. If you use option 4d1, you must provide the Installation
Information in the manner specified by section 6 of the GNU GPL
for conveying Corresponding Source.)
5. Combined Libraries.
You may place library facilities that are a work based on the
Library side by side in a single library together with other library
facilities that are not Applications and are not covered by this
License, and convey such a combined library under terms of your
choice, if you do both of the following:
a) Accompany the combined library with a copy of the same work based
on the Library, uncombined with any other library facilities,
conveyed under the terms of this License.
b) Give prominent notice with the combined library that part of it
is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
6. Revised Versions of the GNU Lesser General Public License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Lesser General Public License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the
Library as you received it specifies that a certain numbered version
of the GNU Lesser General Public License "or any later version"
applies to it, you have the option of following the terms and
conditions either of that published version or of any later version
published by the Free Software Foundation. If the Library as you
received it does not specify a version number of the GNU Lesser
General Public License, you may choose any version of the GNU Lesser
General Public License ever published by the Free Software Foundation.
If the Library as you received it specifies that a proxy can decide
whether future versions of the GNU Lesser General Public License shall
apply, that proxy's public statement of acceptance of any version is
permanent authorization for you to choose that version for the
Library.
libidn-v1.43/COPYINGv2 0000664 0000000 0000000 00000043254 14767240365 0014421 0 ustar 00root root 0000000 0000000 GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License.
libidn-v1.43/DEPENDENCIES.md 0000664 0000000 0000000 00000005305 14767240365 0015261 0 ustar 00root root 0000000 0000000 # Libidn2 DEPENDENCIES -- Related packages
The following packages should be installed before GNU Libidn is
installed (runtime dependencies that are also build dependencies):
* libintl, part of GNU gettext
+ Not needed on systems with glibc.
But recommended on all other systems.
Needed for localization of messages.
+ Homepage:
https://www.gnu.org/software/gettext/
+ Download:
https://ftp.gnu.org/gnu/gettext/
+ Pre-built package name:
- On Debian and Debian-based systems: --,
- On Red Hat distributions: --.
- Other: https://repology.org/project/gettext/versions
+ If it is installed in a nonstandard directory, pass the option
--with-libintl-prefix=DIR to 'configure'.
The following packages should be installed when GNU Libidn is installed
(runtime dependencies, but not build dependencies):
* The Gnulib localizations.
+ Recommended.
Needed for localization of some of the programs to the user's language.
+ Documentation:
https://www.gnu.org/software/gnulib/manual/html_node/Localization.html
+ Download:
https://ftp.gnu.org/gnu/gnulib/gnulib-l10n-*
The following should be installed when GNU libidn is built, but are not
needed later, once it is installed (build dependencies, but not runtime
dependencies):
* A C runtime, compiler, linker, etc.
+ Mandatory.
Either the platform's native 'cc', or GCC.
+ GCC Homepage:
https://www.gnu.org/software/gcc/
+ Download:
https://ftp.gnu.org/gnu/gcc/
* A POSIX-like 'make' utility.
+ Mandatory.
Either the platform's native 'make' (for in-tree builds only),
or GNU Make 3.79.1 or newer.
+ GNU Make Homepage:
https://www.gnu.org/software/make/
+ Download:
https://ftp.gnu.org/gnu/make/
* A POSIX-like shell
+ Mandatory.
Either the platform's native 'sh', or Bash.
+ Homepage:
https://www.gnu.org/software/bash/
+ Download:
https://ftp.gnu.org/gnu/bash/
* Core POSIX utilities, including:
[ basename cat chgrp chmod chown cp dd echo expand expr
false hostname install kill ln ls md5sum mkdir mkfifo
mknod mv printenv pwd rm rmdir sleep sort tee test touch
true uname
+ Mandatory.
Either the platform's native utilities, or GNU coreutils.
+ Homepage:
https://www.gnu.org/software/coreutils/
+ Download:
https://ftp.gnu.org/gnu/coreutils/
* The comparison utilities 'cmp' and 'diff'.
+ Mandatory.
Either the platform's native utilities, or GNU diffutils.
+ Homepage:
https://www.gnu.org/software/diffutils/
+ Download:
https://ftp.gnu.org/gnu/diffutils/
* Grep.
+ Mandatory.
Either the platform's native grep, or GNU grep.
+ Homepage:
https://www.gnu.org/software/grep/
+ Download:
https://ftp.gnu.org/gnu/grep/
libidn-v1.43/FAQ 0000664 0000000 0000000 00000004206 14767240365 0013442 0 ustar 00root root 0000000 0000000 Libidn FAQ -- Anticipated Frequently Asked Questions.
Copyright (C) 2002-2025 Simon Josefsson
See the end for copying conditions.
Q#1: Why doesn't Libidn use a separate library for the Unicode
operations?
A#1: Separate libraries (Glib, QT, libiconv) seldom mark the
Unicode tables with the corresponding Unicode version they
implement, nor do they provide a interface where a specific
version can be requested. This violates the stringprep
specification which requires that a specific version must be
used. Also, some of these third party libraries depend on
non-portable behavior (e.g. threads).
Q#2: Why do Libidn include several stringprep profiles? They waste
space!
A#2: The stringprep profiles included are usually derived from the
generic stringprep tables, and doesn't waste more than say a few
hundred bytes (see profiles.c). The Unicode normalization tables
and the generic stringprep tables are roughly equivalent in size,
although the latter tables can surely be compressed much further.
They occupy about 100 kilobytes on typical platforms. However,
if in the future several large Stringprep profiles are added,
configure options will be added to help reduce size.
Q#3: I thought GNU was encouraging libraries to be licensed under the GPL?
A#3: The reasoning for this was for libraries that provide unique
functionality to encourage more free programs. Since there are
several IDN libraries out there, using the GPL for Libidn would
only encourage people not to use Libidn which would not help the
spread of free software.
Q#4: How do I add a new stringprep profile?
A#4: Add the profile definition to profiles.c, export the symbol and
optionally add a CPP macro in stringprep.h (and document it in
stringprep.c). If you want to add self tests, do it through
tst_stringprep.c. Mention it in NEWS.
----------------------------------------------------------------------
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/Makefile.am 0000664 0000000 0000000 00000007603 14767240365 0015150 0 ustar 00root root 0000000 0000000 ## Process this file with automake to produce Makefile.in
# Copyright (C) 2002-2025 Simon Josefsson
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
SUBDIRS = gl lib/gl lib po src
if ENABLE_DOC
SUBDIRS += doc
endif
SUBDIRS += fuzz examples
if JAVA
SUBDIRS += java
endif
if CSHARP
SUBDIRS += csharp
endif
SUBDIRS += tests
EXTRA_DIST = cfg.mk maint.mk
EXTRA_DIST += CONTRIBUTING.md DEPENDENCIES.md
EXTRA_DIST += COPYING.LESSERv2 COPYING.LESSERv3 COPYINGv2
ACLOCAL_AMFLAGS = -I lib/m4 -I gl/m4 -I lib/gl/m4 -I m4
AM_DISTCHECK_CONFIGURE_FLAGS = --enable-doc --enable-gtk-doc --disable-valgrind-tests
EXTRA_DIST += FAQ libc/README libc/getaddrinfo-idn.txt libc/example.c \
contrib/README contrib/idn-python/README \
contrib/idn-python/Makefile contrib/idn-python/idn.c \
contrib/idn-python/test.py contrib/web/idn.php \
contrib/java/README contrib/java/autogen.sh \
contrib/java/configure.ac contrib/java/Makefile.am \
contrib/java/ExampleIDNA.java contrib/java/IDNA.java \
contrib/java/IDNA.c contrib/doxygen/Doxyfile.in \
contrib/doxygen/Doxyfile.orig contrib/doxygen/gdoc2doxygen
# Visual Studio project files.
EXTRA_DIST += windows/libidn.sln windows/libidn.vcproj \
windows/include/unistd.h windows/include/idn-int.h \
windows/include/stdbool.h windows/include/ac-stdint.h \
windows/include/config.h windows/libidn4win.mk
# version-stamp
EXTRA_DIST += $(top_srcdir)/.version
BUILT_SOURCES = $(top_srcdir)/.version
# git-version-gen
dist-hook: dist-tarball-version
.PHONY: dist-tarball-version
dist-tarball-version:
echo '$(VERSION)' > $(distdir)/.tarball-version
dist-hook: po-CreationDate-to-mtime-NEWS
.PHONY: po-CreationDate-to-mtime-NEWS
po-CreationDate-to-mtime-NEWS: mtime-NEWS-to-git-HEAD
$(AM_V_GEN)for p in $(distdir)/po/*.po $(distdir)/po/$(PACKAGE).pot; do \
if test -f "$$p"; then \
$(SED) -e 's,POT-Creation-Date: .*\\n",POT-Creation-Date: '"$$(env LC_ALL=C TZ=UTC0 stat --format=%y $(srcdir)/NEWS | cut -c1-16,31-)"'\\n",' < $$p > $$p.tmp && \
if cmp $$p $$p.tmp > /dev/null; then \
rm -f $$p.tmp; \
else \
mv $$p.tmp $$p; \
fi \
fi \
done
dist-hook: srcdist
.PHONY: srcdist
srcdist:
$(AM_V_GEN)if test -e $(srcdir)/.git \
&& command -v git > /dev/null; then \
cd $(srcdir) && \
git archive --prefix=$(PACKAGE)-v$(VERSION)/ \
-o $(abs_builddir)/$(PACKAGE)-v$(VERSION)-src.tar.gz HEAD; \
fi
dist-hook: mtime-NEWS-to-git-HEAD
.PHONY: mtime-NEWS-to-git-HEAD
mtime-NEWS-to-git-HEAD:
$(AM_V_GEN)if test -e $(srcdir)/.git \
&& command -v git > /dev/null; then \
touch -m -t "$$(git log -1 --format=%cd --date=format-local:%Y%m%d%H%M.%S)" $(srcdir)/NEWS; \
fi
dist-hook: texi-stamps-to-mtime-NEWS
.PHONY: texi-stamps-to-mtime-NEWS
texi-stamps-to-mtime-NEWS: mtime-NEWS-to-git-HEAD
$(AM_V_GEN)touch -m -r $(srcdir)/NEWS $(srcdir)/doc/$(PACKAGE).texi
dist-hook: gen-ChangeLog
.PHONY: gen-ChangeLog
gen-ChangeLog:
$(AM_V_GEN)if test -e $(srcdir)/.git; then \
LC_ALL=en_US.UTF-8 TZ=UTC0 \
$(top_srcdir)/build-aux/gitlog-to-changelog \
--srcdir=$(srcdir) -- \
v$(PREV_VERSION)~.. > $(distdir)/cl-t && \
{ printf '\n\nSee the source repo for older entries\n' \
>> $(distdir)/cl-t && \
rm -f $(distdir)/ChangeLog && \
mv $(distdir)/cl-t $(distdir)/ChangeLog; } \
fi
libidn-v1.43/NEWS 0000664 0000000 0000000 00000175620 14767240365 0013620 0 ustar 00root root 0000000 0000000 Libidn NEWS -- History of user-visible changes. -*- outline -*-
* Noteworthy changes in release 1.43 (2025-03-21) [stable]
** The release tarball is now reproducible.
Builds on the following pairs of systems are tested continuously in
GitLab CI/CD to assert that the tarball is identical: Trisquel 11
against Ubuntu 22.04, PureOS 10 against Debian 11, Devuan 5 against
Debian 12, AlmaLinux 8 against RockyLinux 8, and AlmaLinux 9 against
RockyLinux 9. There are still minor variations between non-similar
platforms, depending on the different versions of the bootstrapping
tools used. For example, a tarball generated on a Trisquel 11
(derived from Ubuntu 22.04) system should be identical to a tarball
from a Ubuntu 22.04 system, but will not be identical to a tarball
generated on a PureOS 10 system which uses different bootstrapping
tool versions. The release archive itself was prepared using Guix.
** We publish a minimal source-only tarball generated by 'git archive'.
This tarball only contains the files stored in version controlled
sources, and no auxiliary files. The source-only tarball may be
reproduced with Git 2.48.1 from Guix. If something results in the
'git archive' format changing again, the tarball can only be
reproduced using an earlier system. The git version in AlmaLinux 8,
AlmaLinux 9, RockyLinux 8, RockyLinux 9, Devuan 5, Debian 12 and
Ubuntu 24.04 all produce the same identical 'git archive' tarball.
The git version used on Debian 11, PureOS 10, Trisquel 11 and Ubuntu
22.04 produce another identical tarball. These two 'git archive'
outputs are not the same, due to how Git works.
** A use of uninitialized value bug was fixed in idna_to_unicode_4z4z.
If the call to idna_to_unicode_44i failed due to an out of memory
condition (malloc() returning NULL) then the code would copy the
content of allocated but uninitialized memory into the output buffer.
The bug was found using GCC's static analyzer.
** The C# Libidn.dll can now be built with .NET as well as Mono/SSCLI.
** Fix self-check tst-version due to broken strverscmp on Windows/musl.
** The release tarball uses tar --format=ustar.
** The idn tool now binds the "gnulib" domain for translations.
** Unicode tables are now rebuilt from source again.
The lib/gen-unicode-tables.pl script stopped working with Perl 5.10
and in 2008 we added the then-generated source code files to git. Now
we fixed the script to work with modern perl, so that gunibreak.h
gunicomp.h gunidecomp.h can now be generated from source again.
** Update gnulib files and build fixes.
* Noteworthy changes in release 1.42 (2024-01-13) [stable]
** Bump required gettext version to 0.19.8 for musl-libc.
** Compiler warning improvements.
As before, compiler warnings are enabled by default. You may disable
them using ./configure --disable-gcc-warnings or turn them into fatal
errors using ./configure --enable-gcc-warnings=error to add -Werror
and sensible -Wno-error='s. Based on gnulib's manywarnings, see
.
** Fix type confusion on LLP64/Windows platforms.
While libidn has worked using cygwin libc, it has never worked on
ucrt/msvcrt libc. Report and tiny patch by Francesco Pretto in
.
** tests: Added script tests/standalone.sh suitable for integrators.
The main purpose is to test a system-installed libidn, suitable for
distributor checking (a'la Debian's autopkgtest/debci). It may also
be used to test a newly built libidn outside the usual 'make check'
infrastructure. To check that your system libidn is working, invoke
the script with `srcdir` as an environment variable indicating where
it can be find the source code for libidn's tests/ directory (it will
use the directory name where the script is by default):
tests/standalone.sh
To check that a newly built static libidn behaves, invoke:
env STANDALONE_CFLAGS="-Ilib lib/.libs/libidn.a" tests/standalone.sh
To check that a newly built shared libidn behaves, invoke:
env srcdir=tests STANDALONE_CFLAGS="-Ilib -Wl,-rpath lib/.libs lib/.libs/libidn.so" tests/standalone.sh
If the libidn under testing is too old and has known bugs, that should
cause tests to fail, which is intentional.
** Updated translations.
** Update gnulib files and build fixes.
* Noteworthy changes in release 1.41 (2022-06-25) [stable]
** Bump LT_REVISION for new release.
It was mistakenly left at the same value since 1.38.
** Add version number related self-checks.
* Noteworthy changes in release 1.40 (2022-06-20) [stable]
** lib: Bump STRINGPREP_VERSION to 1.40.
It was mistakenly left at 1.38 in the 1.39 release.
* Noteworthy changes in release 1.39 (2022-06-20) [stable]
** lib: Code detecting current locale broken since 1.36.
The code always returned ASCII. The precise cause is complicated to
track down but likely boils down to the new autotools/gettext
bootstrapping sequence introduced in release 1.36. Reported by Богдан
Пилипенко .
** maint: Java JAR archive no longer included in source tarball.
** Minor fixes: typos, makefiles, indentation, gnulib update, etc.
* Noteworthy changes in release 1.38 (2021-07-22) [stable]
** doc: Simplify building of gdoc-generated man/texi outputs.
Now the targets are rebuilt on version number changes properly.
** doc: Improve GTK-DOC manual.
** build: Fix build errors related to doc/idn--help.texi.
** build: Fix --disable-tld builds.
Now tld_strerror() is removed when --disable-tld is used.
* Noteworthy changes in release 1.37 (2021-05-15) [stable]
** doc: Minor fixes and codespell typos.
** Updated translations.
** Update gnulib files and build fixes.
We now use gnulib's ./bootstrap and gnulib's readme-release
infrastructure for making releases.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.36 (2020-07-22) [stable]
** Fix unlikely memory leak in idna_to_unicode_4z4z().
Patch from Miroslav Lichvar .
** Check codepoint validity in punycode_decode() and punycode_decode().
Reported-by: Mike Schiffman (Farsight Security, Inc.).
** tld: Add U+00EF to .nl TLD table.
Reported by Trond Haugen .
** Indent code.
** Translation fixes.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.35 (2018-05-11) [stable]
** Reflect ABI/API breakage in version 1.34
(Stringprep_profile has a new struct member)
Reported-by: Miroslav Lichvar
** Added new gnulib files to repository
** Fix build issues introduced in 1.34
* Noteworthy changes in release 1.34 (2018-03-31) [beta]
** libidn: Fix integer overflow in combine_hangul()
Found by fuzzing.
** libidn: Fix integer overflow in punycode decoder
Found by fuzzing, fix for the fix reported by Christian Weisgerber
** libidn: Fix performance issue in idna_to_unicode_internal()
Found by fuzzing.
** libidn: Fix performance issue in stringprep functions.
Found by fuzzing.
** libidn: Fix NULL pointer dereference in g_utf8_normalize()
Found by fuzzing.
** libidn: Fix NULL pointer dereference in stringprep_ucs4_nfkc_normalize()
Found by fuzzing.
** libidn: Increase performance of stringprep functions
Found by fuzzing.
** testing: Add OSS-fuzz integration and regression testing
** build: Update gnulib files
** build: Modernize GTK-Doc build
** build: Fix parallel builds
** build: Add configure flag --disable-doc
** build: Add configure flag --enable-ubsan (enable UB Sanitizer)
** build: Add configure flag --enable-asan (enable Address Sanitizer)
** build: Fix compiler warnings
** build: Fix build for gcc-7
** i18n: Added Swedish translation.
Thanks to Josef Andersson.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.33 (2016-07-20) [beta]
** libidn: Fix out-of-bounds stack read in idna_to_ascii_4i.
See tests/tst_toascii64oob.c for regression check (and the comment in
it how to use it). Reported by Hanno Böck .
** idn: Solve out-of-bounds-read when reading one zero byte as input.
Also replaced fgets with getline. Reported by Hanno Böck .
** libidn: stringprep_utf8_nfkc_normalize reject invalid UTF-8.
It was always documented to only accept UTF-8 data, but now it doesn't
crash when presented with such data. Reported by Hanno Böck.
** Dropped valgrind suppressions file, should no longer be needed.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.32 (2015-08-01) [beta]
** libidn: Fix crash in idna_to_unicode_8z8z and idna_to_unicode_8zlz.
This problem was introduced in 1.31. Reported by Adam Sampson.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.31 (2015-07-08) [beta]
** libidn: stringprep_utf8_to_ucs4 now rejects invalid UTF-8. CVE-2015-2059
This function has always been documented to not validate that the
input UTF-8 string is actually valid UTF-8. Like the rest of the API,
when you call a function that works on UTF-8 data, you have to pass it
valid UTF-8 data. Application writers appear to have difficulties
using interfaces designed like that, as bugs triggered by invalid
UTF-8 has been identified in a number of projects (jabberd2, gnutls,
wget, and curl). While we could introduce a new API to perform UTF-8
validation, so that applications can easily implement the proper
checks, this appear error prone because there is a risk that the check
will be forgotten. Instead, we took the more radical approach of
modifying the documentation and the implementation of the API. The
intention is that all functions that accepts UTF-8 data should
validate it before use. This will solve the problem for applications,
without needing to change them. This change has the unfortunate
side-effect that Surrogate codes (see section 5.5 of RFC 3454) no
longer trigger the STRINGPREP_CONTAINS_PROHIBITED error code but
instead will trigger the newly introduced STRINGPREP_ICONV_ERROR error
code, as the gnulib/libunistring-based code that we use to test
UTF-8-compliance rejects Surrogate codes. We hope that this is an
acceptable cost to live with in order to improve application security.
We welcome feedback on this solution, and we are marking this release
as beta rather than stable to signal that we may reconsider this
approach if people disagree. Reported by several people including
Thijs Alkemade, Gustavo Grieco, Daniel Stenberg, and Nikos
Mavrogiannopoulos.
** libidn: Added STRINGPREP_ICONV_ERROR error code.
** libidn: Workaround valgrind/gcc/glibc issue.
Valgrind reported a 'Invalid read of size 4' that was caused by
optimized strlen implementation. Reported and patch by Alessandro
Ghedini .
** build: Use LOG_COMPILER instead of TESTS_ENVIRONMENT to fix valgrind use.
Errors caught by valgrind did not always trigger 'make check' failures
before.
** i18n: Updated Danish translation.
Thanks to Joe Hansen.
** API and ABI is backwards compatible with the previous version.
See discussion above on slight change in semantics of functions.
* Noteworthy changes in release 1.30 (2015-03-02) [stable]
** libidn: The punycode.{c,h} files were re-imported from RFC 3492bis.
A comment explaining the origin and what was changed was added.
** Bump gettext to 0.19.3.
** Use LT_INIT instead of AC_LIBTOOL_WIN32_DLL.
** i18n: Added Hungarian translation. Updated some other languages.
Thanks to Balázs Úr.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.29 (2014-08-10) [stable]
** libidn: Mark internal variable "g_utf8_skip" as static.
Reported by Thomas Dineen .
** idn: Flush stdout to simplify for tools that buffer too heavily.
Tiny patch from Hugh Daschbach .
** i18n: Added Brazilian Portuguese translation.
Thanks to Rafael Ferreira.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.28 (2013-07-10) [stable]
** idn: Don't crash when string conversion from UTF-8 to locale fails.
Reported by Jeffrey Frey .
** java: Fix build failures.
** java: TestIDNA -a and -u logic was reversed, now fixed.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.27 (2013-06-05) [stable]
** Java library can be built using Maven. Speed improvements.
Thanks to several patches from Stefan Larsson. Testing indicate 70-90
times faster node/name/resource-prep.
** Update gnulib files and translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.26 (2012-12-11) [stable]
** libidn, idna_to_ascii: Propagate error on malloc failure.
Reported by Sarat Chandra Addepalli .
** libidn, tld_get_4: Fix out of bounds read access violation.
** i18n: Added Croatian translation. Updated Vietnamese translation.
Thanks to Tomislav Krznar and Trần Ngọc Quân.
** java: Permit usage by Apache projects.
Thanks to Oliver Hitz and Angus Turner.
** tests: Improve tld self-tests.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.25 (2012-05-23) [stable]
** MSVC: Build fixes related to _GL_ATTRIBUTE_CONST and _GL_ATTRIBUTE_PURE.
Reported by Bartosz Brachaczek .
** examples: Fix compiler warning about ignoring return value from fgets.
** tests: Ship with a valgrind suppressions file for the strlen issue.
See tests/libidn.supp and bottom of HACKING for discussion.
** Update gnulib files and translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.24 (2012-01-10) [stable]
** Libraries are re-licensed from LGPLv2+ to dual-GPLv2+|LGPLv3+.
** build: Fix parallel Windows builds.
Reported by René Berber .
** libidn: Fix potential infloop in pr29 code.
Reported by Jon Nelson in
.
** libidn: Add 'const' keyword to 'stringprep_ucs4_nfkc_normalize' function.
** Sync glib NFKC code and improve copyright/license statements.
** Update gnulib files and translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.23 (2011-11-25) [stable]
** stringprep.h: Now #include's sys/types.h instead of unistd.h for ssize_t.
Some systems (e.g., Mingw with MSVC 9) does not have unistd.h.
** idn-free.h: Protect prototypes with 'extern "C"' marker.
Reported by Bittner Ede .
** doc: Update link to experimental TLD tables.
The new link is .
** Update gnulib files and translations.
** QA: Improved cyclo output. Update GTK-DOC files. Various bugfixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.22 (2011-05-04) [stable]
** libidn: Add -liconv as static library requirement in libidn.pc, for MinGW.
Reported by Volker Grabsch .
** libidn: Fix memory leak in idna_to_ascii_4z when idna_to_ascii_4i fails.
Reported by and tiny patch from Olga Limburg .
** libidn: Ran clang-analyze on the code.
Fixed some dead assignments/initializations.
** build: Really distribute win32/libidn4win.mk.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.21 (2011-04-24) [stable]
** build/gettext: Demand gettext >= 0.18.1 in order to get newer M4 files.
The old M4 files associated with 0.17 caused problems on Solaris,
hopefully now fixed. Reported by Dagobert Michelsen
in .
** build: Improve MinGW cross-compile makefile, see win32/libidn4win.mk.
** build: Visual Studio files fixed to define LIBIDN_BUILDING.
Tiny patch from Waqas Hussain .
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.20 (2011-03-01) [stable]
** libidn: Fix bug in ToUnicode to compare 'xn--' case-insensitively.
The problem is typically noticed when an upper ACE case string is
converted to Unicode. Before, this would return the input rather than
converting the ACE form to Unicode. Reported by Stepan Golosunov
in .
** tests: Added self-test tst_idna3 to catch any regression of problem above.
** idn: Only print copyright and license blurb when used interactively.
Reported by "Andrew O. Shadoura" and Roman Mamedov
in and
respectively.
** Update gnulib files and translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.19 (2010-05-22) [stable]
** doc: Typo fixes. Added PDF version of API reference manual.
See doc/reference/libidn.pdf.
** build: Update gnulib files.
** build: Use valgrind -q to reduce verbosity.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.18 (2010-02-15) [stable]
** libidn: Put forgotten symbols under old namespace.
Reverts one unnecessary change introduced in 1.17. Suggested by Marco
d'Itri .
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.17 (2010-02-05) [alpha]
** libidn: Fix symbol export problem for a few variables.
Applications (that use these rarely used variables) built against
versions before 1.13 did not work with libidn versions 1.13 to 1.16.
Symbol versioning was introduced in version 1.13 but by accident some
symbols that were visible before that release were not exported, and
the consequence was that those symbols were not available in version
1.13 to 1.16. This release fixes the problem, so the symbols are
visible again, making this release backwards compatible with all
earlier releases.
The affected symbols are the following variables:
stringprep_iscsi_prohibit, stringprep_rfc3454_A_1,
stringprep_rfc3454_B_1, stringprep_rfc3454_B_2,
stringprep_rfc3454_B_3, stringprep_rfc3454_C_1_1,
stringprep_rfc3454_C_1_2, stringprep_rfc3454_C_2_1,
stringprep_rfc3454_C_2_2, stringprep_rfc3454_C_3,
stringprep_rfc3454_C_4, stringprep_rfc3454_C_5,
stringprep_rfc3454_C_6, stringprep_rfc3454_C_7,
stringprep_rfc3454_C_8, stringprep_rfc3454_C_9,
stringprep_rfc3454_D_1, stringprep_rfc3454_D_2,
stringprep_saslprep_space_map.
Thanks to Marco d'Itri for reporting
that led to
discovering this problem.
** Really fix the link error of self-tests on MinGW.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.16 (2010-01-12) [alpha]
** java: Add a Maven pom.xml project file.
Contributed by Guus der Kinderen .
** Fix a link error on MinGW.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.15 (2009-06-08) [alpha]
** libidn: Use c_strcasecmp instead of strcasecmp.
For portability to NetWare CLIB. The specification requires a ASCII
comparison, so it is also more appropriate to use c_strcasecmp.
Reported by Guenter Knauf .
** java: Fix some Java compiler warnings.
** doc: Improved sections for the info manual.
We now follow the advice given by the texinfo manual on which
directory categories to use. In particular, libidn moved from the
'GNU Libraries' section to the 'Software libraries' and 'Invoking idn'
moved from 'GNU utilities' to 'Localization'.
** New configure parameters to set packaging specific information.
The parameters are --with-packager, --with-packager-version, and
--with-packager-bug-reports. See
for more
details.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.14 (2009-04-03) [alpha]
** libidn: Install a libidn-*.def file when building under MinGW.
The file is useful if you develop programs in Visual Studio that links
to libidn.
** tests/tst_toutf8: Don't crash if stringprep_utf8_to_locale returns NULL.
Reported by Dagobert Michelsen in
.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.13 (2009-03-06) [alpha]
** libidn: Use a LD version script on platforms where it is supported.
Currently only GNU LD and the Solaris linker supports it. This helps
Debian package tools to produce better dependencies. Before we used
Libtool -export-symbols-regex that created an anonymous version tag.
Libidn uses -export-symbols-regex if the system does not support LD
version scripts, but that only affect symbol visibility.
** libidn: Compiled with -fvisibility=hidden by default if supported.
Currently only GCC supports it for ELF targets. This hides internal
symbols and has other advantages, see
.
** libidn: Compiled with warning flags only when GCC is used.
This avoids the problem that some flags confuse non-GCC compilers, for
example -fdiagnostics-show-option. Reported by
jens.rehsack@bayerbbs.com.
** doc: The idn_free function is now documented.
Suggested by "Sisyphus" .
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.12 (2009-01-23) [alpha]
** idn: New parameter --no-tld to deprecate the old parameter --tld.
The new parameter --no-tld disable TLD checking of the input string.
The --tld parameter was broken; it behaved opposite to its documented
behaviour. To avoid confusion over what --tld means, we decided to
deprecate it. Now --tld is not printed in the idn --help output, but
will continue to work as before.
** doc: Modernize doxygen configuration.
** doc: Change license on the manual to GFDLv1.3+.
** doc: Improve JavaDoc output.
** Update gnulib files and translations.
** Build with more warnings.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.11 (2008-10-28) [alpha]
** libidn: New WARN_CFLAGS configure variable.
It is used internally to add -Werror and other warnings flags, to
catch coding mistakes before releases.
** Win32: Perl is no longer required to build Libidn in Visual Studio.
** Win32: Functions in idna.h are also exported.
Reported by Adam Strzelecki .
** doc: Included cyclomatic code complexity charts of the library code.
See doc/cyclo/.
** tests: Add more self-tests to get more self-test code coverage.
** tests: New 'make coverage' command to generate code coverage reports.
The output is created in doc/coverage/. Requires the LCOV tools. See
https://www.gnu.org/software/libidn/coverage/ for a pre-generated copy.
** Clarify copyright and license for gdoc, man pages, and C# port.
** Update gnulib files and translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.10 (2008-08-27) [alpha]
** idn: accept -n as short form for --nfkc.
Before '-k' was used as the short form, but all documentation has said
'-n'. We now accept both short forms, and -n remains the documented
short form. Reported by John McGowan in
.
** Fix compiler warnings.
** Update gnulib files.
** Update translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.9 (2008-07-01) [alpha]
** idn: fix error message when NFKC fails, and some other translation fixes.
Reported by Benno Schulenberg .
** C# Libidn.dll: Work around bug that cause a failure during C# compilation.
See .
** Remove more non-free text from doc/specifications/rfc3454.txt.
The remaining data tables are not copyrightable.
** Update gnulib files, and include gnulib self-tests.
** Update translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.8 (2008-04-23) [alpha]
** Translations files not stored directly in git to avoid merge conflicts.
This allows us to avoid use of --no-location which makes the
translation teams happier.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.7 (2008-04-10) [alpha]
** idn: new parameter --nfkc to process string with Unicode v3.2 NFKC.
** Minor build fix for native Win32 builds.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.6 (2008-03-19) [alpha]
** Add native Windows Visual Studio project files.
Contributed by Adam Strzelecki .
** Remove non-free portions of RFC 3454 in doc/specifications/rfc3454.txt.
** Update gnulib files.
** Doc fixes in IDNA to clarify that some functions operate on
** just one domain labels and some operate on domain name (which
** can contain several domain labels).
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.5 (2008-02-19) [alpha]
** Don't include wchar.h in idn-int.h.
Fixes problems on uClibc systems which lack a wchar.h. Reported by
Mike Frysinger , see
.
** Added appendix 'On Label Separators' to the manual.
Thanks to Erik van der Poel for bringing the issue
to our attention and for discussing the matter. See
.
** Improved rendering of non-ASCII in the info manual.
Done by adding a @documentencoding UTF-8. This affect how the
examples are encoded, the files examples/*.c are now encoded using
UTF-8 instead of a mix of ISO-8859-1 and ISO-8859-15.
** Fix non-portable use of brace expansion in makefiles.
** Update translations.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.4 (2008-01-09) [alpha]
** Fixes to make the C# port compile under Mono.
** Update gnulib files.
** Improve idn --version and --help output to conform to GNU standards.
This also enables translations of --help output.
** Update translations.
Added Finish translation, thanks to Jorma Karvonen. Updated Dutch and
Vietnamese.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.3 (2007-12-11) [alpha]
** Some hints on Windows installation in the manual.
** Update translations.
Added Czech translation, thanks to Petr Pisar.
** Use gettext 0.17.
** Update gnulib files.
Top-level gnulib files are now distributed under GPLv3+. (The gnulib
files used by the core library are still under LGPLv2.1+.)
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.2 (2007-10-01) [alpha]
** Development git tree moved to savannah.
See .
** Update gnulib files.
Including mono detection fixes.
** Update translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.1 (2007-09-01) [alpha]
** Fix compilation error in idn-int.h.
The error would typically be 'error: no include path in which to
search for stdint.h'. Reported by Remko van der Vossen
, see
and
.
** Declare external variables with __declspec(import) for Windows.
Apparently this is required for variables in DLL's on Windows. This
is enabled if __DECLSPEC_SUPPORTED is defined (MinGW), or if _MSC_VER
and_DLL is defined (MSVC).
** Update gnulib files.
** Update translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 1.0 (2007-07-31) [alpha]
** Command-line tools, examples, etc are now licensed under GPL version 3.
The library is still licensed under LGPL v2.1 for compatibility
reasons (it is included in glibc).
** Updated documentation as per license change.
** Update gnulib files.
** Update translations.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.14 (2007-05-31) [alpha]
** Libidn is now developed using Git instead of CVS.
A public git mirror is available from
. If you have pulled from this
repository before this release, you need to erase your clone because
it has been re-generated from scratch.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.13 (2007-05-31) [alpha]
** Documentation fixes.
Clarify that the C# and Java libraries are licensed under the LGPL.
Earlier, some places incorrectly said that these were licensed under
the GPL. If you encounter other places that still suggest that GPL
applies to the C# and Java library, please let me know.
** Updated Polish and Vietnamese translations.
Thanks to Jakub Bogusz and Clytie Siddall
.
** Install images for the manual in $infodir.
This fixes the broken image in the info manual. Image files will be
called libidn-*.png to avoid namespace collisions with images from
other info manuals.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.12 (2007-04-25) [alpha]
** Use AM_JAVACFLAGS instead of JAVACFLAGS in java/misc/Makefile.am.
Reported by Petteri Räty .
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.11 (2007-03-13) [alpha]
** Update of the C# Libidn port, by Alexander Gnauck.
The code has been refactored and the namespace has been modified to
comply with .NET naming conventions. An IDNA bug was fixed.
** Update gnulib files.
We now use the "striconv" module instead of the "iconvme", which
causes a slight increase of code size (from 303kb to 319kb with
debugging symbols on i386). The reason is the use of a new locale
independent strcasecmp, which may cause faster operation in some
locales where, e.g., "ASCII" and "ascii" are not treated as the same.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.10 (2007-01-04) [alpha]
** Corrected year in copyright notices.
** Update gnulib files.
Including the code to convert strings between different encodings
(noted in case this introduces problems).
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.9 (2006-11-30) [alpha]
** The Java code is fixed to properly translate any non-ASCII dot into '.'.
Reported and fixed by "Stephane Mikaty" .
** Update gnulib files.
** Bump tool versions to autoconf 2.61, automake 1.10, and gettext 0.16.
** Old versions of iconv.m4, codeset.m4 and lib-link.m4 removed from m4/.
Modern versions are part of gnulib.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.8 (2006-10-18) [alpha]
** The gnulib directory is separated into two directories.
One gnulib directory (lib/gl/) for the LGPL library in lib/, and one
gnulib directory (gl/) for the GPL tools in src/. This allows the
GPL'd tools to use more gnulib modules than before, since earlier all
gnulib files had to be LGPL.
** Update gnulib files.
** Some minor cleanups, like assuming locale.h and setlocale().
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.7 (2006-09-13) [alpha]
** Fix build failure of idn-int.h on C99 platforms.
Reported by Paul Howarth .
** The manual includes the GPL license, for the command-line tools.
** The function, variable and concept index is moved to the end of the manual.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.6 (2006-08-23) [alpha]
** Instead of AX_CREATE_STDINT_H, use the stdint gnulib module, for idn-int.h.
This solves building on some HPPA systems. Note that the generated
idn-int.h is specific to the build environment that libidn was built
under, and is not generally usable by any other compiler (if any) on
the host. This was true before too.
** Update gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.5 (2006-06-07) [alpha]
** Link the library with external libintl, for gettext.
This fixes building on FreeBSD, reported by Kirill Ponomarew
.
** Update doxygen config file to version 1.4.7.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.4 (2006-06-07) [alpha]
** Fix translation of error messages.
Thanks to Joe Orton .
** Fix warnings on 64-bit platforms.
Thanks to Joe Orton .
** The tests are run under valgrind, if it is installed.
Use --disable-valgrind-tests to unconditionally disable this. It is
disabled by default for cross compiles.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.3 (2006-03-08) [alpha]
** Fixes for the build environment.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.2 (2006-02-07) [alpha]
** Fix objdir != srcdir builds for the Java documentation.
Thanks to Bernard Leak .
** Update of gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.1 (2006-01-20) [alpha]
** Make it possible to cross-compile to mingw32.
You can build Libidn for Windows by invoking `./configure
--host=i586-mingw32msvc' (or similar).
** Minor changes in how the C# code is built.
** Update of gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.6.0 (2005-12-03) [alpha]
** A C# port of Libidn has been contributed by Alexander Gnauck.
The port resides in the csharp/ directory. Configure will build it if
a working C# compiler can be found. Mono's "mcs" compiler is known to
work (available in Debian in the "mono-mcs" package), but PNET's
"cscc" compiler should also work (available in Debian in the "pnet"
package). The port is licensed under the GPL. Some Microsoft Visual
Studio project files are also present in the csharp/ directory, which
may be useful when building the port under Windows. The C# API is
currently not documented, improvements are gratefully accepted.
** Support shared libraries on Cygwin and Mingw32, thanks to Yaakov S.
** Fix memory leak.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.20 (2005-10-23) [alpha]
** The header file pr29.h is now installed by 'make install'.
** Translation updates.
** Update of gnulib files.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.19 (2005-09-19) [alpha]
** The test for setlocale and nl_langinfo has now been separated.
The autoconf script now test for locale.h, setlocale and
nl_langinfo(CODESET) independently.
** Gnulib updates, fixes for getopt.
** Java manuals in doc/java/ are now generated by Gjdoc from GNU Classpath.
** Kaffe is used to link the pre-built libidn-*.jar file.
** Translation updates.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.18 (2005-07-16) [alpha]
** The macro AX_CREATE_STDINT_H that is used to create idn-int.h
** has been updated.
** Fix use of 'head -1' in configure script (should be 'head -n -1'),
** thanks to Carsten Lohrke.
** Announce the help-libidn mailing list in documentation and README.
** Translation updates.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.17 (2005-05-26) [alpha]
** The gnulib portability files were updated.
** The license template in files were updated with the new address.
** Translation updated.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.16 (2005-05-06) [alpha]
** Mark static PR29 data tables as 'const', thanks to Joe Orton.
** Kinyarwanda translations added, thanks to Steve Murphy.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.15 (2005-03-19) [alpha]
** Improvements to code to convert data between character sets.
The license template was changed to the LGPL, from the GPL template
that was mistakenly used in the previous two releases. Document here
that cleaning up this code has solved memory allocation and arithmetic
overflow problems.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.14 (2005-03-19) [alpha]
** Building for srcdir != objdir from CVS now work, thanks to Linus Nordberg.
** Simplified Chinese translations added, thanks to Meng Jie.
** Vietnamese translation added, thanks to Clytie Siddall.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.13 (2005-01-29) [alpha]
** The code to convert data between character encodings have been cleaned up.
The stringprep_convert function has been added to gnulib, under the
name iconv_string, and is now used by libidn. This should not have
any user-visible consequences, though.
** It is now possible to bootstrap with unmodified Automake installations.
** Italian translation added, thanks to Marco Colombo.
** Swedish translation updated.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.12 (2004-12-04) [alpha]
** Java code now support the XMPP NodePrep and ResourcePrep profiles.
** Bug fixes and improvements to Java code.
The allowUnassigned flag is now respected properly. The prohibited
code points check now works. Arguments are now checked. Convenience
method with allowUnassigned set to false was added.
** Update getopt from gnulib.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.11 (2004-11-21) [alpha]
** Fix formatting of man pages, based on warnings from Doclifter.
** Update of gnulib files to fix potential getopt problem on ELF systems.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.10 (2004-11-08) [alpha]
** Libtool's -export-symbols-regex is now used to only export official APIs.
Before, applications might accidentally access internal functions.
Note that this is not supported on all platforms, so you must still
make sure you are not using undocumented symbols in Libidn.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.9 (2004-11-07) [alpha]
** Align GTK-DOC build infrastructure with GTK-DOC official recommendations.
This mean that you can now browse the Libidn API manual using Devhelp.
** Update of gnulib files to fix potential problem in getopt on BSD.
** Documentation improvements.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.8 (2004-10-12) [alpha]
** BidiMirroring-3.2.0.txt is now included, not only the generated source code.
This allow builds to succeed after 'make realclean'.
** Generated files now have consistent 'DO NOT EDIT!' comments.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.7 (2004-10-12) [alpha]
** Shared library version incremented, because new APIs were added.
This was forgotten in the last release.
** French translation updated.
** Minor bug fixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.6 (2004-10-02) [alpha]
** Added functions to convert return codes to human readable text.
** Now using GNULib in command line front end (src/) for portability code.
See for more information on
GNULib. This should make the code easier to read and maintain.
** API and ABI is backwards compatible with the previous version.
idna_strerror: ADD.
pr29_strerror: ADD.
punycode_strerror: ADD.
stringprep_strerror: ADD.
tld_strerror: ADD.
TLD_NO_TLD: ADD. Replaces TLD_NOTLD.
TLD_NOTLD: DEPRECATED. Use TLD_NO_TLD instead.
* Noteworthy changes in release 0.5.5 (2004-09-13) [alpha]
** Hide accidentally exported variable g_utf8_skip, by marking it as static.
** Various fixes.
** API and ABI is backwards compatible with the previous version.
g_utf8_skip: REMOVED. (But never meant to be used.)
* Noteworthy changes in release 0.5.4 (2004-08-08) [alpha]
** Translation updates.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.3 (2004-08-05) [alpha]
** Fix crash in `idn --tld' command line tool.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.2 (2004-07-14) [alpha]
** Java "make install" rules are now DESTDIR compatible.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.1 (2004-07-09) [alpha]
** Cross compile builds should work.
It should work for any sane cross compile target, but the only tested
platform is uClibc/uClinux on Motorola Coldfire.
** The example programs now correctly invoke `setlocale (LC_ALL, "")'.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.5.0 (2004-06-26) [alpha]
** Functions to detect "normalization problem sequences" as per PR-29 added.
See the new chapter "PR29 Functions" in the manual
(doc/libidn.{ps,pdf,html}) for more information and the background
story. An external link that discuss the problem is
.
** More translations.
Added Esperanto (by Edmund GRIMLEY EVANS).
** API and ABI is backwards compatible with the previous version.
pr29.h: ADD. Prototypes for PR29 types and functions.
pr29_4, pr29_4z, pr29_8z: ADD. New API entry points for PR29 functions.
Pr29_rc: ADD. New error code enum type for PR29 functions.
* Noteworthy changes in release 0.4.9 (2004-06-11) [alpha]
** The Java library (java/libidn-*.jar) is included in the distribution.
** JavaDoc manuals (doc/javadoc/) are included.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.8 (2004-06-01) [alpha]
** The Java source code is actually included in the distribution.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.7 (2004-05-31) [alpha]
** The Java port should now be functional, contributed by Oliver Hitz.
See the new section "Java API" in the manual for more information.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.6 (2004-05-24) [alpha]
** The header file idn-free.h is actually installed by 'make install'.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.5 (2004-05-21) [alpha]
** In IDNA ToUnicode, a `free' on a stale pointer fixed by Ulrich Drepper.
** Several memory leaks fixed by Ulrich Drepper.
** Added more SASLPrep and NFKC test vectors.
** Automake 1.8.4 is used.
** API and ABI is backwards compatible with the previous version.
idn_free: ADD. Wrapper around system `free'.
idn-free.h: ADD. Prototype for `idn_free'.
See idn-free.h for discussion. The interface is
currently not documented. Comments and feedback is
appreciated.
* Noteworthy changes in release 0.4.4 (2004-04-29) [alpha]
** Fixed two bugs in iSCSI definition, syncing with newly published RFC 3722.
The first bug was an omission of prohibiting the characters in C.1.1,
C.1.2 and C.7 (space characters and characters that are inappropriate
for canonical representation). The second was a bug in the definition
of the table, causing the entire table to be skipped, of the special
prohibited output character table defined in RFC 3722 (see section 6,
the characters in the table are various ASCII characters and U+3002).
** A few test vectors for iSCSI were added.
** The self tests are linked with libtool -no-install to avoid wrapper script.
** Separated self test utilities into a separate library, shared by all tests.
** More translations.
Added Romanian (by Laurentiu Buzdugan).
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.3 (2004-04-22) [alpha]
** Fixed a bug in table processing code to prohibit control characters.
The problem was that the code used a code point of 0 to indicate end
of table, but if (as for table C.2.1) a range starts with 0, this
logic would fail. The end-of-table test is now that both the start
and end code points of the range is 0. Table C.2.1 is responsible for
prohibiting non-ASCII control characters, i.e. ASCII 0-31 and 127.
Before, libidn silently accepted such strings without complaining.
** A few test vectors for SASLprep were added.
** The pkg-config script no longer include a -R parameter.
** More translations.
Added Dutch (by Elros Cyriatan), and German (by Roland Illig).
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.2 (2004-03-20) [alpha]
** A Punycode implementation in Java was added, by Oliver Hitz.
Eventually hopefully a StringPrep, Nameprep and IDNA implementation
will be added as well. Currently you need to specify --enable-java to
enable the Java interface. The Java sources (below java/) are
compiled into byte-code (not native code) into a JAR library.
** More translations.
Added Danish (by Morten Bo Johansen), French (by Michel Robitaille),
Polish (by Jakub Bogusz), and Serbian (by Aleksandar Jelenak).
** Norwegian TLD table added, by Thomas Jacob.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.4.1 (2004-03-08) [alpha]
** The user messages from the command line utility are now translated.
Currently English and Swedish is supported.
** Logic of stringprep_locale_charset modified.
Future versions will use, in order, $CHARSET iff defined, nl_langinfo
(CODESET) iff working, or fall back to returning "ASCII". Earlier it
attempted to guess the system locale, in contrast with the current
application's locale, via some setlocale save/set/reset magic. This
change may require you to invoke setlocale() in your application,
which is (should be) required for non-ASCII to work anyway. Based on
discussion with Ulrich Drepper.
** The command-line utility now invoke setlocale (LC_ALL, "") at startup.
** Fixed SASLprep tables to prohibit non-ASCII space in output.
Non-ASCII space has always been mapped to ASCII space, so it is not
clear this really have any effect, but the specification require it.
** Building Libidn as part of GLIBC has been updated.
Refer to libc/README for more information. Incidentally, GLIBC in CVS
now include a copy of Libidn.
** API and ABI is backwards compatible with the previous version.
IDNA_DLOPEN_ERROR: ADD. Only used internally by Libidn in libc.
* Noteworthy changes in release 0.4.0 (2004-02-28) [alpha]
** Support for TLD restrictions on IDN strings, contributed by Thomas Jacob.
Many TLDs restrict the set of characters that can be used, from the
full Unicode 3.2 range that is normally available. This contribution
make it possible for you to test strings for TLD conformance locally.
The code can be disabled by --disable-tld. If enabled (the default),
the new API "tld.h" is installed which can be used to check a string
for conformance to TLD specific rules. This add a new self test, and
a new chapter in the manual. People responsible for maintaining TLD
tables are hereby encouraged to contribute them (under reasonable
licensing terms) for inclusion in future versions of Libidn. Be
warned that the API for TLD checking may change throughout the 0.4.x
series as we get feedback on it.
** Kerberos 5 stringprep profile macro is no longer documented.
The macro itself will probably be removed in the future, if the
specification is dropped from the Kerberos WG agenda.
** API and ABI is backwards compatible with the previous version.
stringprep_kerberos5: DEPRECATED.
Tld_table_element:
Tld_table:
Tld_rc: ADD. New data types.
tld_get_4:
tld_get_4z:
tld_get_z: ADD. New functions to extract TLD from string.
tld_get_table:
tld_default_table: ADD. New functions to get TLD table from TLD name.
tld_check_4t:
tld_check_4tz: ADD. New function to provide core TLD operations.
tld_check_4:
tld_check_4z:
tld_check_8z:
tld_check_lz: ADD. New functions that combine all TLD operations in one call.
* Noteworthy changes in release 0.3.7 (2004-01-22) [alpha]
** The command line parameter '--' idiom is documented.
** The iSCSI stringprep profile now recognized as "iSCSI".
The earlier name "ISCSIprep" is still recognized, for backwards
compatibility.
** DocBook manuals no longer included (the tools are too unstable).
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.3.6 (2004-01-06) [alpha]
** The manual now contain a troubleshooting section for the command line tool.
** The PHP interface pass the string directly on the command line.
** The macro that create 'idn-int.h' has been updated to latest version.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.3.5 (2003-12-15) [alpha]
** The program 'idn' accepts input strings directly on the command line.
** The program 'idn' defaults to --idna-to-ascii if no parameter is given.
** The program 'idn' now print user instructions before waiting for input.
** DocBook HTML output not included any longer.
The reason is that the filenames generated by docbook2html appear to
be rather random, so it is difficult to maintain the Makefile.am rules
for them.
** Autoconf 2.59, automake 1.8 and libtool from CVS is used.
** API and ABI is backwards compatible with the previous version.
IDNA_CONTAINS_NON_LDH: ADD. Same integer value as IDNA_CONTAINS_LDH.
IDNA_CONTAINS_LDH: DEPRECATED. LDH (letter-digits-hyphens) characters
are not an error, but non-LDH characters are, when
IDNA_USE_STD3_ASCII_RULES is used. The logic of the
mnemonic name of this error constant was reversed.
* Noteworthy changes in release 0.3.4 (2003-11-09) [alpha]
** DocBook manuals in XML, PDF, PostScript, ASCII and HTML formats included.
* Noteworthy changes in release 0.3.3 (2003-10-18) [alpha]
** Fixed list of Stringprep profiles in 'idn --help' and 'idn.php'.
** Fixed debug information in 'idn'.
** Internal improvements.
Leads to reduced heap memory usage. Simplified inter-dependency among
files in lib/* to make it easier to copy them into your project.
** Debugging stringprep profile 'generic' removed.
** Punycode implementation updated to rfc3492bis-00.
** API and ABI is backwards compatible with the previous version.
stringprep_4i: NEW.
stringprep_4zi: NEW.
stringprep: CHANGED. 'profile' is marked as 'const'.
stringprep_profile: CHANGED. 'profile' is marked as 'const'.
stringprep_generic: REMOVED. Never meant for public use.
* Noteworthy changes in release 0.3.2 (2003-10-07) [alpha]
** SASL ANONYMOUS stringprep profile "trace" added.
It is equivalent to the already supported "plain" SASL ANONYMOUS
stringprep profile, except for the name.
** API and ABI is backwards compatible with the previous version.
The 'in' parameter to stringprep_profile was changed from 'char*' to
'const char*'.
* Noteworthy changes in release 0.3.1 (2003-10-02) [alpha]
** Fixed handling of implicit and explicit zero-length root labels in ToASCII.
** Fixed support for Hangul Syllables during Unicode NFKC normalization.
** Fixed Unicode NFKC normalization of (some) BMP code points.
This was done by syncing the NFKC code with latest GLIB, and may have
fixed other bugs in the earlier versions of the updated functions.
** Added more IDNA test vectors.
** Emacs Lisp IDNA implementation now set the UseSTD3ASCIIRules flag.
This is the appropriate setting for mail-related uses of IDNA.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.3.0 (2003-09-23) [alpha]
** Ported to Mac OS X.
** Gnulib code removed, we now assume a C89 compatible environment.
** Building libidn as a libc add-on now works again.
** Man pages for all public API functions are included.
** Fixed bug in SASLprep profile.
** API and ABI is NOT backwards compatible with the previous version.
All previously labeled (since 0.1.x) obsolete functions have been dropped.
The use of 'enum' types instead of 'int' added in 0.2.3 reverted, it
confused documentation generators and wasn't all that common practice.
* Noteworthy changes in release 0.2.3 (2003-08-26) [alpha]
** Example 4 was the same as example 3, now changed to demo ToUnicode.
** Documentation improvements.
** Prototype cleanups.
The proper enum types (Stringprep_rc, Idna_rc, etc) are now used in
several places where plain int where used before. String lengths are
handled by (s)size_t instead of int.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.2.2 (2003-08-13) [alpha]
** Fixed problem with strings longer than 4GB in punycode functions.
The punycode code cannot handle strings longer than 4GB. The code now
return PUNYCODE_BAD_INPUT on too long input, instead of failing in an
unknown way.
** The "idn --idna-to-unicode" command now output locale encoded strings.
** Build fixes, bug fixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.2.1 (2003-07-04) [alpha]
** Don't reject zero-length trailing labels as in, e.g., "www.example.org.".
The IDNA RFC is not clear on this topic, zero-length labels in general
are forbidden by the ToASCII algorithm in section 4.1 step 8, but the
terminology section define, inside a parenthesis, that the zero-length
root label is in fact not considered a label at all in IDNA.
** Bug fixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.2.0 (2003-06-19) [alpha]
** Unicode code point data is now uint32_t, defined in "idn-int.h".
A header file "idn-int.h" is generated and installed to make sure the
"uint32_t" data type is available on all platforms. The reason for
this change is that on 64-bit platforms, the application was required
to convert 32 bit integers (which is how Unicode code points are
typically represented) into 64 bit integers before calling libidn
functions.
** New idna_*() functions have improved flags handling.
The allowunassigned and usestd3asciirules parameters were collapsed
into a flags parameter, that can take on the IDNA_ALLOW_UNASSIGNED and
IDNA_USE_STD3_ASCII_RULES values. This allows for easier extensions
to support, e.g., Unicode 4.0 or RFC 952 ASCII rules checking. Note
that the old entry points are unmodified (in this regard), and new
entry points with this modification were added.
** The manual was moved into a separate directory doc/.
** Bugfixes.
** API and ABI is not backwards compatible.
In punycode.h and stringprep.h the "unsigned long" data type was
changed into "uint32_t", which cause a API and ABI mismatch. For
idna.h, the old entry points that used "unsigned long" still exist,
and new entry points that uses "uint32_t" was added. To update your
application, you probably only need to change "unsigned long" to
"uint32_t". As a result of these changes, the shared object version
has been increased.
* Noteworthy changes in release 0.1.15 (2003-06-07) [alpha]
** Bugfixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.14 (2003-05-10) [alpha]
** Experimental documentation generation in contrib/doxygen/.
Simply invoke "doxygen" in that directory and it should build the
documentation.
** Lisp API bug fixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.13 (2003-03-13) [alpha]
** Unfinished Java *.class files implementing the libidn API.
See the contrib/java/ directory. It is implemented using the Java
Native Interface, and light initial testing indicate interoperability
between GCJ, IBM's JDK and Sun's JDK.
** Building is now silent when gengetopt is not present.
** Bug fixes.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.12 (2003-03-06) [alpha]
** Building libidn doesn't require gengetopt.
Warnings are still printed though. Gengetopt will be replaced by argp
eventually.
** Command line tool "idn" supports stringprep too.
** New stringprep API entry point: stringprep_profile().
It takes a name of the stringprep profile as an argument instead of
the stringprep table structure.
** stringprep_*.h are deprecated and will be removed in the future.
All symbols have been moved to stringprep.h. The reasons are that (1)
the files typically only defined one CPP macro and exported one symbol
definition, which is wasteful as it generates too much work in the
manual, and (2) using one header file for all profiles allows easier
access to all stringprep profiles during runtime. Note that the files
are still installed, but they only #include stringprep.h now, for
backwards compatibility.
** GNU Libc add-on build instructions updated to GNU Libc 2.3.2.
** SASLprep stringprep profile added.
** An online interface to libidn written in PHP added to contrib/web/.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.11 (2003-02-26) [alpha]
** Command line application "idn" is included.
A simple wrapper around the library that allows you to invoke punycode
encoding/decoding and IDNA ToASCII/ToUnicode on the command line.
** Emacs Lisp interface for punycode and IDNA included.
See punycode.el and idna.el.
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.10 (2003-02-21) [alpha]
** idna_*_to_ace() and idna_*ace_to_*() are deprecated in favor of
** idna_to_ascii_from_*() and idna_to_unicode_*_from_*() respectively.
The reason was that the old interfaces did not accept the
AllowUnassigned and UseSTD3ASCIIRules flags. Note that the old
functions are not removed, but will be in the future.
** IPS iSCSI stringprep profile added.
** A new contrib/ directory added.
Currently it contains a Python interface to Libidn, contributed by
Stephane Bortzmeyer.
** idna.h and punycode.h are now installed by "make install".
** API and ABI is backwards compatible with the previous version.
* Noteworthy changes in release 0.1.9 (2003-02-20) [alpha]
** SASL ANONYMOUS "plain" stringprep profile added.
** XMPP nodeprep profile fixed.
** API and ABI is backwards compatible with the previous version.
For future releases, the NEWS entry will specifically mention whether
the C header API or library ABI backwards compatibility is affected.
* Noteworthy changes in release 0.1.8 (2003-02-14) [alpha]
** Portability fixes.
This includes not building the API Reference Manual with GTK-DOC by
default, if you want it use configure parameter --enable-gtk-doc after
making sure your gtkdoc-mkdb accept the --tmpl-dir parameter.
** The type for string length variables is now (s)size_t.
Unfortunately this means binary shared library binary backwards
compatible is lost.
** New nameprep test vectors.
* Noteworthy changes in release 0.1.7 (2003-02-12) [alpha]
** Uses official IDNA ACE prefix.
* Noteworthy changes in release 0.1.6 (2003-02-11) [alpha]
** Uses tentative IDNA ACE prefix.
** Added XMPP Node/Resource Identifiers stringprep profiles.
** Fixed prohibited character checks for bidi.
* Noteworthy changes in release 0.1.5 (2003-01-28) [alpha]
** The library can now be built as part of GNU Libc.
This is experimental and only tested against GNU Libc version 2.3.1.
See the libc/ directory, and libc/README in particular.
** Bug fixes.
* Noteworthy changes in release 0.1.4 (2003-01-15) [alpha]
** Documentation fixes.
** Portability fixes.
** Bug fixes.
* Noteworthy changes in release 0.1.3 (2003-01-15) [alpha]
** Added texinfo manual.
* Noteworthy changes in release 0.1.2 (2003-01-08) [alpha]
** Added high-level IDNA API.
** Added example3.c and example4.c demonstrating the high-level IDNA API.
* Noteworthy changes in release 0.1.1 (2003-01-08) [alpha]
** Added documentation using GTK-DOC.
** The obsolete stringprep_utf8_to_ucs4_fast API entry point was removed.
By accident it was never removed in 0.1.0.
* Noteworthy changes in release 0.1.0 (2003-01-05) [alpha]
** Official GNU project.
** Renamed from libstringprep to libidn.
** Supports punycode and IDNA. Caveat emptor: I don't use it myself.
** Uses "unsigned long" for Unicode code points instead of "long".
Long is guaranteed to be at least 32 bits by C standards so it is
always sufficiently large, no need to use uint32_t and the like.
** The obsolete stringprep_utf8_to_ucs4_fast API entry point was removed.
* Noteworthy changes in release 0.0.8 (2002-12-13) [alpha]
** Portability fixes (now works under Cygwin on Windows 2000).
** Bug fixes.
* Noteworthy changes in release 0.0.7 (2002-12-09) [alpha]
** Apply all tables to entire strings, not just first hit.
** Fix bidi infloop.
* Noteworthy changes in release 0.0.5 (2002-12-07) [alpha]
** Fix prohibited characters handling.
** Fix bidi.
** Renamed type (struct) stringprep_table_element to Stringprep_table_element.
** Renamed type stringprep_profile to Stringprep_profile.
** Renamed type (struct) stringprep_table to Stringprep_table.
** Added more self-tests.
* Noteworthy changes in release 0.0.4 (2002-12-06) [alpha]
** Add unassigned code point handling, including self test cases.
** Portability fixes.
* Noteworthy changes in release 0.0.3 (2002-11-30) [alpha]
** Exported utility function `stringprep_utf8_to_unichar', complementary
to existing `stringprep_unichar_to_utf8'.
** Renamed `stringprep_utf8_to_ucs4_fast' to `stringprep_utf8_to_ucs4' to
clean up API. The old entry point is maintained for binary backwards
compatibility though.
** The distribution is from now on signed using GnuPG.
** Bug fixes.
* Noteworthy changes in release 0.0.2 (2002-11-07) [alpha]
** NFKC self test.
** Bug fixes.
* Noteworthy changes in release 0.0.1 (2002-11-06) [alpha]
** Add utility functions stringprep_locale_charset(), stringprep_convert()
and stringprep_locale_to_utf8 () that can be used to convert text from
system's locale into UTF-8, which should be done before invoking
stringprep(). The functions requires iconv() in the operating system.
** An example program (example.c) that illustrates how libstringprep can be
used is included.
** The pkg-config --libs output should now include necessary -R options.
* Noteworthy changes in release 0.0.0 (2002-11-05) [alpha]
** Initial release
----------------------------------------------------------------------
Copyright (C) 2002-2025 Simon Josefsson
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/README 0000777 0000000 0000000 00000000000 14767240365 0015240 2README.md ustar 00root root 0000000 0000000 libidn-v1.43/README.md 0000664 0000000 0000000 00000006150 14767240365 0014367 0 ustar 00root root 0000000 0000000 # Libidn README -- Introduction information
Libidn is a package for internationalized string handling based on the
Stringprep, Punycode, IDNA2003 and TLD specifications. Libidn is a
GNU project. For technical reference, see:
* [Stringprep](https://www.rfc-editor.org/rfc/rfc3454)
* [IDNA aka IDNA2003](https://www.rfc-editor.org/rfc/rfc3490)
* [Nameprep](https://www.rfc-editor.org/rfc/rfc3491)
* [Punycode](https://www.rfc-editor.org/rfc/rfc3492)
* [Unicode 3.2.0](http://www.unicode.org/versions/Unicode3.2.0/)
WARNING! The IDNA2003 specifications have been superseded by IDNA2008
which is implemented by Libidn2
. The only reasonable
use of the libidn library today is to support the historic IDNA2003
behaviour or to use Stringprep profiles. Please try to migrate to
libidn2 wherever possible.
If this file came to you as part of a tar archive, then see the file
(INSTALL)[INSTALL] for generic compilation and installation
instructions. Before building you should consider installing the
[dependencies](DEPENDENCIES.md). If you obtained this file as part of
a "git clone", then see the CONTRIBUTING.md file.
If you need help to use Libidn, or wish to help others, you are
invited to join our mailing list help-libidn@gnu.org, see
.
For more information, see .
# Documentation
[GNU Libidn Manual](https://www.gnu.org/software/libidn/manual/)
[Libidn API Reference Manual](https://www.gnu.org/software/libidn/reference/)
# License
The source code for the C library (libidn.a or libidn.so), the C#
library (Libidn.dll) and the Java library (libidn-*.jar) are
dual-licensed under the terms of either the GNU General Public License
version 2.0 or later - see the file [COPYINGv2](COPYINGv2) - or the
GNU Lesser General Public License version 3.0 or later - see the file
[COPYING.LESSERv3](COPYING.LESSERv3) - or both in parallel as here.
The author of the Java library has agreed to also distribute it under
the Apache License Version 2.0, see the file
[java/LICENSE-2.0](java/LICENSE-2.0).
The manual is licensed under the GNU Free Documentation License,
Version 1.3 or any later, see the file
[doc/fdl-1.3.texi](doc/fdl-1.3.texi).
The command line tool, self tests, examples, and other auxiliary
files, are licensed under the GNU General Public License version 3.0
or later, see the file [COPYING](COPYING).
The library embed data tables published by Unicode, Inc and The
Internet Society (IETF), see [doc/specification/](doc/specification/).
Other files are licensed as indicated in each file. There may be
exceptions to these general rules, see each file for precise
information.
For any copyright year range specified as YYYY-ZZZZ in this package
note that the range specifies every single year in that closed
interval.
----------------------------------------------------------------------
Copyright (C) 2002-2025 Simon Josefsson
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/THANKS 0000664 0000000 0000000 00000005714 14767240365 0014030 0 ustar 00root root 0000000 0000000 Libidn THANKS -- Acknowledgements.
Copyright (C) 2002-2025 Simon Josefsson
See the end for copying conditions.
The punycode code was taken from the IETF IDN Punycode specification,
by Adam M. Costello. The TLD code was contributed by Thomas Jacob.
The Java implementation was contributed by Oliver Hitz. The C#
implementation was contributed by Alexander Gnauck. The Unicode
tables were provided by Unicode, Inc. Functions for dealing with
Unicode (see lib/nfkc.c) are borrowed from GLib downloaded from
www.gtk.org. Gnulib is used to simplify portability and to improve
readability of the code.
Suggestions, bug reports, patches, translations, test vectors or other
contributions were also received from or written by the people
mentioned below. If you have contributed and aren't mentioned here,
please let us know!
Stephane Bortzmeyer
Seungho Lee
Waldo Bastian
Travis Shirk
Hugo Salgado H.
Leonard Stiles
Ryan M. Golbeck
Joe Hildebrand
Thiago Macieira
Ienup Sung
Wim Lewis
Robert Norris
Patrik Wallstrom
Marcos Sanz
Gerrit P. Haase
Adam M. Costello
Trond Haugen
Marco d'Itri
Arkadiusz Miskiewicz
Noah Levitt
Paul Hoffman / JDNA
Oden Eriksson
Kai Schaetzl
Graydon Hoare
Jan-Hendrik Heuing
Chris Moore
Niels Möller
Thomas Jacob
Ulrich Drepper
Jakub Bogusz
Aleksandar Jelenak
Michel Robitaille
Morten Bo Johansen
Oliver Hitz
Jørgen Thomsen
Roland Illig
Elros Cyriatan
Martin Waitz
Laurentiu Buzdugan
Joe Orton
Daniel Stenberg
Gisle Vanem
Robert Scheck
Benjamin Reed
Edmund GRIMLEY EVANS
Stephan Kulow
Andreas Schwab
Eric S. Raymond
Matt Tucker
Marco Colombo
Linus Nordberg
Simon Walter
Clytie Siddall
Meng Jie
Carsten Lohrke
Wim Lewis
Yaakov S
Alexander Gnauck
Bernard Leak
Kirill Ponomarew
Paul Howarth
Stephane Mikaty
Petteri Räty
Petr Pisar
Christian Ehrlicher
Remko van der Vossen
Erik van der Poel
Mike Frysinger
Adam Strzelecki
Benno Schulenberg
John McGowan
Sisyphus
Jens Rehsack
Dagobert Michelsen
Guus der Kinderen
Guenter Knauf
Stepan Golosunov
Andrej Shadura
Roman Mamedov
Waqas Hussain
Guido Trentalancia
Volker Grabsch
Olga Limburg
Bittner Ede
René Berber
Jon Nelson
Bartosz Brachaczek
Sarat Chandra Addepalli
Jeffrey Frey
Thijs Alkemade
Nikos Mavrogiannopoulos
Gustavo Grieco
Adam Sampson
Hanno Böck
Trond Haugen
Bruno Haible
----------------------------------------------------------------------
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/bootstrap 0000775 0000000 0000000 00000022075 14767240365 0015057 0 ustar 00root root 0000000 0000000 #! /bin/sh
# Bootstrap this package from checked-out sources.
scriptversion=2024-07-04.10; # UTC
# Copyright (C) 2003-2025 Free Software Foundation, Inc.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
# Originally written by Paul Eggert. The canonical version of this
# script is maintained as top/bootstrap in gnulib. However, to be
# useful to your package, you should place a copy of it under version
# control in the top-level directory of your package. The intent is
# that all customization can be done with a bootstrap.conf file also
# maintained in your version control; gnulib comes with a template
# build-aux/bootstrap.conf to get you started.
# Please report bugs or propose patches to bug-gnulib@gnu.org.
me="$0"
medir=`dirname "$me"`
# Read the function library and the configuration.
. "$medir"/bootstrap-funclib.sh
usage() {
cat <.
# Originally written by Paul Eggert. The canonical version of this
# script is maintained as top/bootstrap-funclib.sh in gnulib. However,
# to be useful to your package, you should place a copy of it under
# version control in the top-level directory of your package. The
# intent is that all customization can be done with a bootstrap.conf
# file also maintained in your version control; gnulib comes with a
# template build-aux/bootstrap.conf to get you started.
nl='
'
# Ensure file names are sorted consistently across platforms.
LC_ALL=C
export LC_ALL
# Honor $PERL, but work even if there is none.
PERL="${PERL-perl}"
default_gnulib_url=https://git.savannah.gnu.org/git/gnulib.git
# Copyright year, for the --version output.
copyright_year=`echo "$scriptlibversion" | sed -e 's/[^0-9].*//'`
copyright="Copyright (C) ${copyright_year} Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later .
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law."
# warnf_ FORMAT-STRING ARG1...
warnf_ ()
{
warnf_format_=$1
shift
nl='
'
case $* in
*$nl*) me_=$(printf "$me"|tr "$nl|" '??')
printf "$warnf_format_" "$@" | sed "s|^|$me_: |" ;;
*) printf "$me: $warnf_format_" "$@" ;;
esac >&2
}
# warn_ WORD1...
warn_ ()
{
# If IFS does not start with ' ', set it and emit the warning in a subshell.
case $IFS in
' '*) warnf_ '%s\n' "$*";;
*) (IFS=' '; warn_ "$@");;
esac
}
# die WORD1...
die() { warn_ "$@"; exit 1; }
# ------------------------------ Configuration. ------------------------------
# Directory that contains package-specific gnulib modules and/or overrides.
local_gl_dir=gl
# Name of the Makefile.am
# XXX Not used.
gnulib_mk=gnulib.mk
# List of gnulib modules needed.
gnulib_modules=
# Any gnulib files needed that are not in modules.
gnulib_files=
# A function to be called for each unrecognized option. Returns 0 if
# the option in $1 has been processed by the function. Returns 1 if
# the option has not been processed by the function. Override it via
# your own definition in bootstrap.conf
bootstrap_option_hook() { return 1; }
# A function to be called in order to print the --help information
# corresponding to user-defined command-line options.
bootstrap_print_option_usage_hook() { :; }
# A function to be called at the end of autopull.sh.
# Override it via your own definition in bootstrap.conf.
bootstrap_post_pull_hook() { :; }
# A function to be called right after gnulib-tool is run.
# Override it via your own definition in bootstrap.conf.
bootstrap_post_import_hook() { :; }
# A function to be called after everything else in this script.
# Override it via your own definition in bootstrap.conf.
bootstrap_epilogue() { :; }
# The command to download all .po files for a specified domain into a
# specified directory. Fill in the first %s with the destination
# directory and the second with the domain name.
po_download_command_format=\
"wget --mirror --level=1 -nd -nv -A.po -P '%s' \
https://translationproject.org/latest/%s/"
# When extracting the package name from an AC_INIT invocation,
# prefer a non-empty tarname (4th argument of AC_INIT if given), else
# fall back to the package name (1st argument with munging).
extract_package_name='
/^AC_INIT(\[*/{
s///
/^[^,]*,[^,]*,[^,]*,[ []*\([^][ ,)]\)/{
s//\1/
s/[],)].*//
p
q
}
s/[],)].*//
p
}
'
normalize_package_name='
s/^GNU //
y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/
s/[^abcdefghijklmnopqrstuvwxyz0123456789_]/-/g
'
package=$(${AUTOCONF:-autoconf} --trace 'AC_INIT:$4' configure.ac 2>/dev/null)
if test -z "$package"; then
package=$(sed -n "$extract_package_name" configure.ac) \
|| die 'cannot find package name in configure.ac'
fi
package=$(echo "$package" | sed "$normalize_package_name")
gnulib_name=lib$package
build_aux=build-aux
source_base=lib
m4_base=m4
doc_base=doc
tests_base=tests
gnulib_extra_files="
build-aux/install-sh
build-aux/mdate-sh
build-aux/texinfo.tex
build-aux/depcomp
build-aux/config.guess
build-aux/config.sub
doc/INSTALL
"
# Additional gnulib-tool options to use. Use "\newline" to break lines.
gnulib_tool_option_extras=
# Other locale categories that need message catalogs.
EXTRA_LOCALE_CATEGORIES=
# Additional xgettext options to use. Use "\\\newline" to break lines.
XGETTEXT_OPTIONS='\\\
--flag=_:1:pass-c-format\\\
--flag=N_:1:pass-c-format\\\
--flag=error:3:c-format --flag=error_at_line:5:c-format\\\
'
# Package bug report address and copyright holder for gettext files
COPYRIGHT_HOLDER='Free Software Foundation, Inc.'
MSGID_BUGS_ADDRESS=bug-$package@gnu.org
# Files we don't want to import.
# XXX Not used.
excluded_files=
# File that should exist in the top directory of a checked out hierarchy,
# but not in a distribution tarball.
checkout_only_file=README-hacking
# Set this to '.cvsignore .gitignore' in bootstrap.conf if you want
# those files to be generated in directories like lib/, m4/, and po/.
# Or set it to 'auto' to make this script select which to use based
# on which version control system (if any) is used in the source directory.
vc_ignore=auto
# Set this to true in bootstrap.conf to enable --bootstrap-sync by
# default.
bootstrap_sync=false
# Override the default configuration, if necessary.
# Make sure that bootstrap.conf is sourced from the current directory
# if we were invoked as "sh bootstrap".
conffile=`dirname "$me"`/bootstrap.conf
test -r "$conffile" && . "$conffile"
# ------------------------- Build-time prerequisites -------------------------
check_exists() {
if test "$1" = "--verbose"; then
($2 --version /dev/null 2>&1
if test $? -ge 126; then
# If not found, run with diagnostics as one may be
# presented with env variables to set to find the right version
($2 --version /dev/null 2>&1
fi
test $? -lt 126
}
# Note this deviates from the version comparison in automake
# in that it treats 1.5 < 1.5.0, and treats 1.4.4a < 1.4-p3a
# but this should suffice as we won't be specifying old
# version formats or redundant trailing .0 in bootstrap.conf.
# If we did want full compatibility then we should probably
# use m4_version_compare from autoconf.
sort_ver() { # sort -V is not generally available
ver1="$1"
ver2="$2"
# split on '.' and compare each component
i=1
while : ; do
p1=$(echo "$ver1" | cut -d. -f$i)
p2=$(echo "$ver2" | cut -d. -f$i)
if [ ! "$p1" ]; then
echo "$1 $2"
break
elif [ ! "$p2" ]; then
echo "$2 $1"
break
elif [ ! "$p1" = "$p2" ]; then
if [ "$p1" -gt "$p2" ] 2>/dev/null; then # numeric comparison
echo "$2 $1"
elif [ "$p2" -gt "$p1" ] 2>/dev/null; then # numeric comparison
echo "$1 $2"
else # numeric, then lexicographic comparison
lp=$(printf "%s\n%s\n" "$p1" "$p2" | LANG=C sort -n | tail -n1)
if [ "$lp" = "$p2" ]; then
echo "$1 $2"
else
echo "$2 $1"
fi
fi
break
fi
i=$(($i+1))
done
}
get_version_sed='
# Move version to start of line.
s/.*[v ]\([0-9]\)/\1/
# Skip lines that do not start with version.
/^[0-9]/!d
# Remove characters after the version.
s/[^.a-z0-9-].*//
# The first component must be digits only.
s/^\([0-9]*\)[a-z-].*/\1/
#the following essentially does s/5.005/5.5/
s/\.0*\([1-9]\)/.\1/g
p
q'
get_version() {
app=$1
$app --version >/dev/null 2>&1 || { $app --version; return 1; }
$app --version 2>&1 | sed -n "$get_version_sed"
}
check_versions() {
ret=0
while read app req_ver; do
# We only need libtoolize from the libtool package.
if test "$app" = libtool; then
app=libtoolize
fi
# Exempt git if git is not needed.
if test "$app" = git; then
$check_git || continue
fi
# Honor $APP variables ($TAR, $AUTOCONF, etc.)
appvar=$(echo $app | LC_ALL=C tr '[a-z]-' '[A-Z]_')
test "$appvar" = TAR && appvar=AMTAR
case $appvar in
GZIP) ;; # Do not use $GZIP: it contains gzip options.
PERL::*) ;; # Keep perl modules as-is
*) eval "app=\${$appvar-$app}" ;;
esac
# Handle the still-experimental Automake-NG programs specially.
# They remain named as the mainstream Automake programs ("automake",
# and "aclocal") to avoid gratuitous incompatibilities with
# preexisting usages (by, say, autoreconf, or custom autogen.sh
# scripts), but correctly identify themselves (as being part of
# "GNU automake-ng") when asked their version.
case $app in
automake-ng|aclocal-ng)
app=${app%-ng}
($app --version | grep '(GNU automake-ng)') >/dev/null 2>&1 || {
warn_ "Error: '$app' not found or not from Automake-NG"
ret=1
continue
} ;;
# Another check is for perl modules. These can be written as
# e.g. perl::XML::XPath in case of XML::XPath module, etc.
perl::*)
# Extract module name
app="${app#perl::}"
if ! $PERL -m"$app" -e 'exit 0' >/dev/null 2>&1; then
warn_ "Error: perl module '$app' not found"
ret=1
fi
continue
;;
esac
if [ "$req_ver" = "-" ]; then
# Merely require app to exist; not all prereq apps are well-behaved
# so we have to rely on $? rather than get_version.
if ! check_exists --verbose $app; then
warn_ "Error: '$app' not found"
ret=1
fi
else
# Require app to produce a new enough version string.
inst_ver=$(get_version $app)
if [ ! "$inst_ver" ]; then
warn_ "Error: '$app' not found"
ret=1
else
latest_ver=$(sort_ver $req_ver $inst_ver | cut -d' ' -f2)
if [ ! "$latest_ver" = "$inst_ver" ]; then
warnf_ '%s\n' \
"Error: '$app' version == $inst_ver is too old" \
" '$app' version >= $req_ver is required"
ret=1
fi
fi
fi
done
return $ret
}
print_versions() {
echo "Program Min_version"
echo "----------------------"
printf %s "$buildreq"
echo "----------------------"
# can't depend on column -t
}
# check_build_prerequisites check_git
check_build_prerequisites()
{
check_git="$1"
# gnulib-tool requires at least automake and autoconf.
# If either is not listed, add it (with minimum version) as a prerequisite.
case $buildreq in
*automake*) ;;
*) buildreq="automake 1.9
$buildreq" ;;
esac
case $buildreq in
*autoconf*) ;;
*) buildreq="autoconf 2.59
$buildreq" ;;
esac
# When we can deduce that gnulib-tool will require patch,
# and when patch is not already listed as a prerequisite, add it, too.
if test -d "$local_gl_dir" \
&& ! find "$local_gl_dir" -name '*.diff' -exec false {} +; then
case $buildreq in
*patch*) ;;
*) buildreq="patch -
$buildreq" ;;
esac
fi
if ! printf '%s' "$buildreq" | check_versions; then
echo >&2
if test -f README-prereq; then
die "See README-prereq for how to get the prerequisite programs"
else
die "Please install the prerequisite programs"
fi
fi
# Warn the user if autom4te appears to be broken; this causes known
# issues with at least gettext 0.18.3.
probe=$(echo 'm4_quote([hi])' | autom4te -l M4sugar -t 'm4_quote:$%' -)
if test "x$probe" != xhi; then
warn_ "WARNING: your autom4te wrapper eats stdin;"
warn_ "if bootstrap fails, consider upgrading your autotools"
fi
}
# find_tool ENVVAR NAMES...
# -------------------------
# Search for a required program. Use the value of ENVVAR, if set,
# otherwise find the first of the NAMES that can be run.
# If found, set ENVVAR to the program name, die otherwise.
#
# FIXME: code duplication, see also gnu-web-doc-update.
find_tool ()
{
find_tool_envvar=$1
shift
find_tool_names=$@
eval "find_tool_res=\$$find_tool_envvar"
if test x"$find_tool_res" = x; then
for i; do
if check_exists $i; then
find_tool_res=$i
break
fi
done
fi
if test x"$find_tool_res" = x; then
warn_ "one of these is required: $find_tool_names;"
die "alternatively set $find_tool_envvar to a compatible tool"
fi
eval "$find_tool_envvar=\$find_tool_res"
eval "export $find_tool_envvar"
}
# --------------------- Preparing GNULIB_SRCDIR for use. ---------------------
# This is part of autopull.sh, but bootstrap needs it too, for self-upgrading.
# cleanup_gnulib fails, removing the directory $gnulib_path first.
cleanup_gnulib() {
status=$?
rm -fr "$gnulib_path"
exit $status
}
git_modules_config () {
test -f .gitmodules && git config --file .gitmodules "$@"
}
prepare_GNULIB_SRCDIR ()
{
if test -n "$GNULIB_SRCDIR"; then
# Use GNULIB_SRCDIR directly.
# We already checked that $GNULIB_SRCDIR references a directory.
# Verify that it contains a gnulib checkout.
test -f "$GNULIB_SRCDIR/gnulib-tool" \
|| die "Error: --gnulib-srcdir or \$GNULIB_SRCDIR is specified," \
"but does not contain gnulib-tool"
if test -n "$GNULIB_REVISION" && $use_git; then
# The 'git checkout "$GNULIB_REVISION"' command succeeds if the
# GNULIB_REVISION is a commit hash that exists locally, or if it is
# branch name that can be fetched from origin. It fails, however,
# if the GNULIB_REVISION is a commit hash that only exists in
# origin. In this case, we need a 'git fetch' and then retry
# 'git checkout "$GNULIB_REVISION"'.
git -C "$GNULIB_SRCDIR" checkout "$GNULIB_REVISION" 2>/dev/null \
|| { git -C "$GNULIB_SRCDIR" fetch origin \
&& git -C "$GNULIB_SRCDIR" checkout "$GNULIB_REVISION"; } \
|| exit $?
fi
else
if ! $use_git; then
die "Error: --no-git is specified," \
"but neither --gnulib-srcdir nor \$GNULIB_SRCDIR is specified"
fi
if git submodule -h | grep -- --reference > /dev/null; then
:
else
die "git version is too old, git >= 1.6.4 is required"
fi
gnulib_path=$(git_modules_config submodule.gnulib.path)
if test -n "$gnulib_path"; then
# A submodule 'gnulib' is configured.
# Get gnulib files. Populate $gnulib_path, updating the submodule.
if test -n "$GNULIB_REFDIR" && test -d "$GNULIB_REFDIR"/.git; then
# Use GNULIB_REFDIR as a reference.
echo "$0: getting gnulib files..."
git submodule update --init --reference "$GNULIB_REFDIR" "$gnulib_path"\
|| exit $?
else
# GNULIB_REFDIR is not set or not usable. Ignore it.
if git_modules_config submodule.gnulib.url >/dev/null; then
echo "$0: getting gnulib files..."
git submodule init -- "$gnulib_path" || exit $?
git submodule update -- "$gnulib_path" || exit $?
else
die "Error: submodule 'gnulib' has no configured url"
fi
fi
else
gnulib_path='gnulib'
if test ! -d "$gnulib_path"; then
# The subdirectory 'gnulib' does not yet exist. Clone into it.
echo "$0: getting gnulib files..."
trap cleanup_gnulib HUP INT PIPE TERM
gnulib_url=${GNULIB_URL:-$default_gnulib_url}
if test -n "$GNULIB_REFDIR" && test -d "$GNULIB_REFDIR"/.git; then
# Use GNULIB_REFDIR as a reference.
git clone "$GNULIB_REFDIR" "$gnulib_path" \
&& git -C "$gnulib_path" remote set-url origin "$gnulib_url" \
&& if test -z "$GNULIB_REVISION"; then
git -C "$gnulib_path" pull origin \
&& {
# We want the default branch of "$gnulib_url" (since that's
# the behaviour if GNULIB_REFDIR is not specified), not the
# current branch of "$GNULIB_REFDIR".
default_branch=`LC_ALL=C git -C "$gnulib_path" \
remote show origin \
| sed -n -e 's/^ *HEAD branch: //p'`
test -n "$default_branch" || default_branch='master'
git -C "$gnulib_path" checkout "$default_branch"
}
else
# The 'git checkout "$GNULIB_REVISION"' command succeeds if the
# GNULIB_REVISION is a commit hash that exists locally, or if it
# is a branch name that can be fetched from origin. It fails,
# however, if the GNULIB_REVISION is a commit hash that only
# exists in origin. In this case, we need a 'git fetch' and then
# retry 'git checkout "$GNULIB_REVISION"'.
git -C "$gnulib_path" checkout "$GNULIB_REVISION" 2>/dev/null \
|| { git -C "$gnulib_path" fetch origin \
&& git -C "$gnulib_path" checkout "$GNULIB_REVISION"; }
fi \
|| cleanup_gnulib
else
# GNULIB_REFDIR is not set or not usable. Ignore it.
shallow=
if test -z "$GNULIB_REVISION"; then
if git clone -h 2>&1 | grep -- --depth > /dev/null; then
shallow='--depth 2'
fi
git clone $shallow "$gnulib_url" "$gnulib_path" \
|| cleanup_gnulib
else
if git fetch -h 2>&1 | grep -- --depth > /dev/null; then
shallow='--depth 2'
fi
# Only want a shallow checkout of $GNULIB_REVISION, but git does not
# support cloning by commit hash. So attempt a shallow fetch by
# commit hash to minimize the amount of data downloaded and changes
# needed to be processed, which can drastically reduce download and
# processing time for checkout. If the fetch by commit fails, a
# shallow fetch cannot be performed because we do not know what the
# depth of the commit is without fetching all commits. So fall back
# to fetching all commits.
# $GNULIB_REVISION can be a commit id, a tag name, or a branch name.
mkdir -p "$gnulib_path"
git -C "$gnulib_path" init
git -C "$gnulib_path" remote add origin "$gnulib_url"
if git -C "$gnulib_path" fetch $shallow origin "$GNULIB_REVISION"
then
# "git fetch" of the specific commit succeeded.
git -C "$gnulib_path" reset --hard FETCH_HEAD \
|| cleanup_gnulib
# "git fetch" does not fetch tags (at least in git version 2.43).
# If $GNULIB_REVISION is a tag (not a commit id or branch name),
# add the tag explicitly.
revision=`git -C "$gnulib_path" log -1 --pretty=format:%H`
branch=`LC_ALL=C git -C "$gnulib_path" remote show origin \
| sed -n -e 's/^ \([^ ]*\) * tracked$/\1/p'`
test "$revision" = "$GNULIB_REVISION" \
|| test "$branch" = "$GNULIB_REVISION" \
|| git -C "$gnulib_path" tag "$GNULIB_REVISION"
else
# Fetch the entire repository.
git -C "$gnulib_path" fetch origin \
|| cleanup_gnulib
git -C "$gnulib_path" checkout "$GNULIB_REVISION" \
|| cleanup_gnulib
fi
fi
fi
trap - HUP INT PIPE TERM
else
# The subdirectory 'gnulib' already exists.
if test -n "$GNULIB_REVISION"; then
if test -d "$gnulib_path/.git"; then
# The 'git checkout "$GNULIB_REVISION"' command succeeds if the
# GNULIB_REVISION is a commit hash that exists locally, or if it
# is a branch name that can be fetched from origin. It fails,
# however, if the GNULIB_REVISION is a commit hash that only
# exists in origin. In this case, we need a 'git fetch' and then
# retry 'git checkout "$GNULIB_REVISION"'.
git -C "$gnulib_path" checkout "$GNULIB_REVISION" 2>/dev/null \
|| { git -C "$gnulib_path" fetch origin \
&& git -C "$gnulib_path" checkout "$GNULIB_REVISION"; } \
|| exit $?
else
die "Error: GNULIB_REVISION is specified in bootstrap.conf," \
"but '$gnulib_path' contains no git history"
fi
fi
fi
fi
# Verify that $gnulib_path contains a gnulib checkout.
test -f "$gnulib_path/gnulib-tool" \
|| die "Error: '$gnulib_path' is supposed to contain a gnulib checkout," \
"but does not contain gnulib-tool"
GNULIB_SRCDIR=$gnulib_path
fi
# $GNULIB_SRCDIR now points to the version of gnulib to use, and
# we no longer need to use git or $gnulib_path below here.
}
# -------- Upgrading bootstrap to the version found in GNULIB_SRCDIR. --------
upgrade_bootstrap ()
{
if test -f "$medir"/bootstrap-funclib.sh; then
update_lib=true
{ cmp -s "$medir"/bootstrap "$GNULIB_SRCDIR/top/bootstrap" \
&& cmp -s "$medir"/bootstrap-funclib.sh \
"$GNULIB_SRCDIR/top/bootstrap-funclib.sh" \
&& cmp -s "$medir"/autopull.sh "$GNULIB_SRCDIR/top/autopull.sh" \
&& cmp -s "$medir"/autogen.sh "$GNULIB_SRCDIR/top/autogen.sh"; \
}
else
update_lib=false
cmp -s "$medir"/bootstrap "$GNULIB_SRCDIR/build-aux/bootstrap"
fi || {
if $update_lib; then
echo "$0: updating bootstrap & companions and restarting..."
else
echo "$0: updating bootstrap and restarting..."
fi
case $(sh -c 'echo "$1"' -- a) in
a) ignored=--;;
*) ignored=ignored;;
esac
u=$update_lib
exec sh -c \
'{ if '$u' && test -f "$1"; then cp "$1" "$3"; else cp "$2" "$3"; fi; } &&
{ if '$u' && test -f "$4"; then cp "$4" "$5"; else rm -f "$5"; fi; } &&
{ if '$u' && test -f "$6"; then cp "$6" "$7"; else rm -f "$7"; fi; } &&
{ if '$u' && test -f "$8"; then cp "$8" "$9"; else rm -f "$9"; fi; } &&
shift && shift && shift && shift && shift &&
shift && shift && shift && shift &&
exec "${CONFIG_SHELL-/bin/sh}" "$@"' \
$ignored \
"$GNULIB_SRCDIR/top/bootstrap" "$GNULIB_SRCDIR/build-aux/bootstrap" \
"$medir/bootstrap" \
"$GNULIB_SRCDIR/top/bootstrap-funclib.sh" "$medir/bootstrap-funclib.sh" \
"$GNULIB_SRCDIR/top/autopull.sh" "$medir/autopull.sh" \
"$GNULIB_SRCDIR/top/autogen.sh" "$medir/autogen.sh" \
"$0" "$@" --no-bootstrap-sync
}
}
# ----------------------------------------------------------------------------
if test x"$gnulib_modules$gnulib_files$gnulib_extra_files" = x; then
use_gnulib=false
else
use_gnulib=true
fi
# -------- Fetch auxiliary files from the network. --------------------------
autopull_usage() {
cat </dev/null 2>&1 && unset CDPATH
# Parse options.
# Use git to update gnulib sources
use_git=true
for option
do
case $option in
--help)
autopull_usage
return;;
--version)
set -e
echo "autopull.sh $scriptlibversion"
echo "$copyright"
return 0
;;
--skip-po)
SKIP_PO=t;;
--force)
checkout_only_file=;;
--bootstrap-sync)
bootstrap_sync=true;;
--no-bootstrap-sync)
bootstrap_sync=false;;
--no-git)
use_git=false;;
*)
bootstrap_option_hook $option || die "$option: unknown option";;
esac
done
$use_git || test -n "$GNULIB_SRCDIR" \
|| die "Error: --no-git requires \$GNULIB_SRCDIR environment variable" \
"or --gnulib-srcdir option"
test -z "$GNULIB_SRCDIR" || test -d "$GNULIB_SRCDIR" \
|| die "Error: \$GNULIB_SRCDIR environment variable" \
"or --gnulib-srcdir option is specified," \
"but does not denote a directory"
if test -n "$checkout_only_file" && test ! -r "$checkout_only_file"; then
die "Running this script from a non-checked-out distribution is risky."
fi
check_build_prerequisites $use_git
if $use_gnulib || $bootstrap_sync; then
prepare_GNULIB_SRCDIR
if $bootstrap_sync; then
upgrade_bootstrap "$@"
fi
fi
# Find sha1sum, named gsha1sum on MacPorts, shasum on Mac OS X 10.6.
# Also find the compatible sha1 utility on the BSDs
if test x"$SKIP_PO" = x; then
find_tool SHA1SUM sha1sum gsha1sum shasum sha1
fi
# See if we can use gnulib's git-merge-changelog merge driver.
if $use_git && test -d .git && check_exists git; then
if git config merge.merge-changelog.driver >/dev/null ; then
:
elif check_exists git-merge-changelog; then
echo "$0: initializing git-merge-changelog driver"
git config merge.merge-changelog.name 'GNU-style ChangeLog merge driver'
git config merge.merge-changelog.driver 'git-merge-changelog %O %A %B'
else
echo "$0: consider installing git-merge-changelog from gnulib"
fi
fi
case $SKIP_PO in
'')
if test -d po; then
update_po_files po $package || return
fi
if test -d runtime-po; then
update_po_files runtime-po $package-runtime || return
fi;;
esac
# ---------------------------------------------------------------------------
bootstrap_post_pull_hook \
|| die "bootstrap_post_pull_hook failed"
# Don't proceed if there are uninitialized submodules. In particular,
# autogen.sh will remove dangling links, which might be links into
# uninitialized submodules.
# But it's OK if the 'gnulib' submodule is uninitialized, as long as
# GNULIB_SRCDIR is set.
if $use_git; then
# Uninitialized submodules are listed with an initial dash.
uninitialized=`git submodule | grep '^-' | awk '{ print $2 }'`
if test -n "$GNULIB_SRCDIR"; then
uninitialized=`echo "$uninitialized" | grep -v '^gnulib$'`
fi
if test -n "$uninitialized"; then
uninit_comma=`echo "$uninitialized" | tr '\n' ',' | sed -e 's|,$|.|'`
die "Some git submodules are not initialized: "$uninit_comma \
"Either use option '--no-git'," \
"or run 'git submodule update --init' and bootstrap again."
fi
fi
if test -f "$medir"/autogen.sh; then
echo "$0: done. Now you can run '$medir/autogen.sh'."
fi
}
# ----------------------------- Get translations. -----------------------------
download_po_files() {
subdir=$1
domain=$2
echo "$me: getting translations into $subdir for $domain..."
cmd=$(printf "$po_download_command_format" "$subdir" "$domain")
eval "$cmd"
}
# Mirror .po files to $po_dir/.reference and copy only the new
# or modified ones into $po_dir. Also update $po_dir/LINGUAS.
# Note po files that exist locally only are left in $po_dir but will
# not be included in LINGUAS and hence will not be distributed.
update_po_files() {
# Directory containing primary .po files.
# Overwrite them only when we're sure a .po file is new.
po_dir=$1
domain=$2
# Mirror *.po files into this dir.
# Usually contains *.s1 checksum files.
ref_po_dir="$po_dir/.reference"
test -d $ref_po_dir || mkdir $ref_po_dir || return
download_po_files $ref_po_dir $domain \
&& ls "$ref_po_dir"/*.po 2>/dev/null |
sed 's|.*/||; s|\.po$||' > "$po_dir/LINGUAS" || return
for po in x $(ls $ref_po_dir | sed -n 's/\.po$//p'); do
case $po in x) continue;; esac
new_po="$ref_po_dir/$po.po"
cksum_file="$ref_po_dir/$po.s1"
if ! test -f "$cksum_file" ||
! test -f "$po_dir/$po.po" ||
! $SHA1SUM -c "$cksum_file" < "$new_po" > /dev/null 2>&1; then
echo "$me: updated $po_dir/$po.po..."
cp "$new_po" "$po_dir/$po.po" \
&& $SHA1SUM < "$new_po" > "$cksum_file" || return
fi
done
}
# -------- Generate files automatically from existing sources. --------------
autogen_usage() {
cat < /dev/null 2>&1
elif test -d .svn; then
svn log -r HEAD "$file" > /dev/null 2>&1
elif test -d CVS; then
grep -F "/${file##*/}/" "$parent/CVS/Entries" 2>/dev/null |
grep '^/[^/]*/[0-9]' > /dev/null
else
warn_ "no version control for $file?"
false
fi
}
# Strip blank and comment lines to leave significant entries.
gitignore_entries() {
sed '/^#/d; /^$/d' "$@"
}
# If $STR is not already on a line by itself in $FILE, insert it at the start.
# Entries are inserted at the start of the ignore list to ensure existing
# entries starting with ! are not overridden. Such entries support
# whitelisting exceptions after a more generic blacklist pattern.
insert_if_absent() {
file=$1
str=$2
test -f $file || touch $file
test -r $file || die "Error: failed to read ignore file: $file"
duplicate_entries=$(gitignore_entries $file | sort | uniq -d)
if [ "$duplicate_entries" ] ; then
die "Error: Duplicate entries in $file: " $duplicate_entries
fi
linesold=$(gitignore_entries $file | wc -l)
linesnew=$( { echo "$str"; cat $file; } | gitignore_entries | sort -u | wc -l)
if [ $linesold != $linesnew ] ; then
{ echo "$str" | cat - $file > $file.bak && mv $file.bak $file; } \
|| die "insert_if_absent $file $str: failed"
fi
}
# Adjust $PATTERN for $VC_IGNORE_FILE and insert it with
# insert_if_absent.
insert_vc_ignore() {
vc_ignore_file="$1"
pattern="$2"
case $vc_ignore_file in
*.gitignore)
# A .gitignore entry that does not start with '/' applies
# recursively to subdirectories, so prepend '/' to every
# .gitignore entry.
pattern=$(echo "$pattern" | sed s,^,/,);;
esac
insert_if_absent "$vc_ignore_file" "$pattern"
}
symlink_to_dir()
{
src=$1/$2
dst=${3-$2}
test -f "$src" && {
# If the destination directory doesn't exist, create it.
# This is required at least for "lib/uniwidth/cjk.h".
dst_dir=$(dirname "$dst")
if ! test -d "$dst_dir"; then
mkdir -p "$dst_dir"
# If we've just created a directory like lib/uniwidth,
# tell version control system(s) it's ignorable.
# FIXME: for now, this does only one level
parent=$(dirname "$dst_dir")
for dot_ig in x $vc_ignore; do
test $dot_ig = x && continue
ig=$parent/$dot_ig
insert_vc_ignore $ig "${dst_dir##*/}/"
done
fi
if $copy; then
{
test ! -h "$dst" || {
echo "$me: rm -f $dst" &&
rm -f "$dst"
}
} &&
test -f "$dst" &&
cmp -s "$src" "$dst" || {
echo "$me: cp -fp $src $dst" &&
cp -fp "$src" "$dst"
}
else
# Leave any existing symlink alone, if it already points to the source,
# so that broken build tools that care about symlink times
# aren't confused into doing unnecessary builds. Conversely, if the
# existing symlink's timestamp is older than the source, make it afresh,
# so that broken tools aren't confused into skipping needed builds. See
# .
test -h "$dst" &&
src_ls=$(ls -diL "$src" 2>/dev/null) && set $src_ls && src_i=$1 &&
dst_ls=$(ls -diL "$dst" 2>/dev/null) && set $dst_ls && dst_i=$1 &&
test "$src_i" = "$dst_i" &&
both_ls=$(ls -dt "$src" "$dst") &&
test "X$both_ls" = "X$dst$nl$src" || {
dot_dots=
case $src in
/*) ;;
*)
case /$dst/ in
*//* | */../* | */./* | /*/*/*/*/*/)
die "invalid symlink calculation: $src -> $dst";;
/*/*/*/*/) dot_dots=../../../;;
/*/*/*/) dot_dots=../../;;
/*/*/) dot_dots=../;;
esac;;
esac
echo "$me: ln -fs $dot_dots$src $dst" &&
ln -fs "$dot_dots$src" "$dst"
}
fi
}
}
# Regenerate all autogeneratable files that are omitted from the
# version control repository. In particular, regenerate all
# aclocal.m4, config.h.in, Makefile.in, configure files with new
# versions of autoconf or automake.
autogen()
{
# Ensure that CDPATH is not set. Otherwise, the output from cd
# would cause trouble in at least one use below.
(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
# Environment variables that may be set by the user.
: "${AUTOPOINT=autopoint}"
: "${AUTORECONF=autoreconf}"
if test "$vc_ignore" = auto; then
vc_ignore=
test -d .git && vc_ignore=.gitignore
test -d CVS && vc_ignore="$vc_ignore .cvsignore"
fi
# Parse options.
# Whether to use copies instead of symlinks.
copy=false
for option
do
case $option in
--help)
autogen_usage
return;;
--version)
set -e
echo "autogen.sh $scriptlibversion"
echo "$copyright"
return 0
;;
--force)
checkout_only_file=;;
--copy)
copy=true;;
*)
bootstrap_option_hook $option || die "$option: unknown option";;
esac
done
test -z "$GNULIB_SRCDIR" || test -d "$GNULIB_SRCDIR" \
|| die "Error: \$GNULIB_SRCDIR environment variable or --gnulib-srcdir" \
"option is specified, but does not denote a directory"
if test -n "$checkout_only_file" && test ! -r "$checkout_only_file"; then
die "Running this script from a non-checked-out distribution is risky."
fi
if $use_gnulib; then
if test -z "$GNULIB_SRCDIR"; then
gnulib_path=$(test -f .gitmodules &&
git config --file .gitmodules submodule.gnulib.path)
test -z "$gnulib_path" && gnulib_path=gnulib
GNULIB_SRCDIR=$gnulib_path
fi
fi
# Die if there is no AC_CONFIG_AUX_DIR($build_aux) line in configure.ac.
found_aux_dir=no
grep '^[ ]*AC_CONFIG_AUX_DIR(\['"$build_aux"'])' configure.ac \
>/dev/null && found_aux_dir=yes
grep '^[ ]*AC_CONFIG_AUX_DIR('"$build_aux"')' configure.ac \
>/dev/null && found_aux_dir=yes
test $found_aux_dir = yes \
|| die "configure.ac lacks 'AC_CONFIG_AUX_DIR([$build_aux])'; add it"
# If $build_aux doesn't exist, create it now, otherwise some bits
# below will malfunction. If creating it, also mark it as ignored.
if test ! -d $build_aux; then
mkdir $build_aux
for dot_ig in x $vc_ignore; do
test $dot_ig = x && continue
insert_vc_ignore $dot_ig $build_aux/
done
fi
check_build_prerequisites false
use_libtool=0
# We'd like to use grep -E, to see if any of LT_INIT,
# AC_PROG_LIBTOOL, AM_PROG_LIBTOOL is used in configure.ac,
# but that's not portable enough (e.g., for Solaris).
grep '^[ ]*A[CM]_PROG_LIBTOOL' configure.ac >/dev/null \
&& use_libtool=1
grep '^[ ]*LT_INIT' configure.ac >/dev/null \
&& use_libtool=1
if test $use_libtool = 1; then
find_tool LIBTOOLIZE glibtoolize libtoolize
fi
if $use_gnulib; then
gnulib_tool=$GNULIB_SRCDIR/gnulib-tool
<$gnulib_tool || return
fi
# NOTE: we have to be careful to run both autopoint and libtoolize
# before gnulib-tool, since gnulib-tool is likely to provide newer
# versions of files "installed" by these two programs.
# Then, *after* gnulib-tool (see below), we have to be careful to
# run autoreconf in such a way that it does not run either of these
# two just-pre-run programs.
# Import from gettext.
with_gettext=yes
grep '^[ ]*AM_GNU_GETTEXT_VERSION(' configure.ac >/dev/null || \
with_gettext=no
if test $with_gettext = yes || test $use_libtool = 1; then
tempbase=.bootstrap$$
trap "rm -f $tempbase.0 $tempbase.1" HUP INT PIPE TERM
> $tempbase.0 > $tempbase.1 &&
find . ! -type d -print | sort > $tempbase.0 || return
if test $with_gettext = yes; then
# Released autopoint has the tendency to install macros that have been
# obsoleted in current gnulib, so run this before gnulib-tool.
echo "$0: $AUTOPOINT --force"
$AUTOPOINT --force || return
fi
# Autoreconf runs aclocal before libtoolize, which causes spurious
# warnings if the initial aclocal is confused by the libtoolized
# (or worse out-of-date) macro directory.
# libtoolize 1.9b added the --install option; but we support back
# to libtoolize 1.5.22, where the install action was default.
if test $use_libtool = 1; then
install=
case $($LIBTOOLIZE --help) in
*--install*) install=--install ;;
esac
echo "running: $LIBTOOLIZE $install --copy"
$LIBTOOLIZE $install --copy
fi
find . ! -type d -print | sort >$tempbase.1
old_IFS=$IFS
IFS=$nl
for file in $(comm -13 $tempbase.0 $tempbase.1); do
IFS=$old_IFS
parent=${file%/*}
version_controlled_file "$parent" "$file" || {
for dot_ig in x $vc_ignore; do
test $dot_ig = x && continue
ig=$parent/$dot_ig
insert_vc_ignore "$ig" "${file##*/}"
done
}
done
IFS=$old_IFS
rm -f $tempbase.0 $tempbase.1
trap - HUP INT PIPE TERM
fi
# Import from gnulib.
if $use_gnulib; then
gnulib_tool_options="\
--no-changelog\
--aux-dir=$build_aux\
--doc-base=$doc_base\
--lib=$gnulib_name\
--m4-base=$m4_base/\
--source-base=$source_base/\
--tests-base=$tests_base\
--local-dir=$local_gl_dir\
$gnulib_tool_option_extras\
"
if test $use_libtool = 1; then
case "$gnulib_tool_options " in
*' --libtool '*) ;;
*) gnulib_tool_options="$gnulib_tool_options --libtool" ;;
esac
fi
echo "$0: $gnulib_tool $gnulib_tool_options --import ..."
$gnulib_tool $gnulib_tool_options --import $gnulib_modules \
|| die "gnulib-tool failed"
if test $with_gettext = yes && test ! -f $m4_base/gettext.m4; then
# The gnulib-tool invocation has removed $m4_base/gettext.m4, that the
# AUTOPOINT invocation had installed. This can occur when the gnulib
# module 'gettext' was previously present but is now not present any more.
# Repeat the AUTOPOINT invocation and the gnulib-tool invocation.
echo "$0: $AUTOPOINT --force"
$AUTOPOINT --force || return
echo "$0: $gnulib_tool $gnulib_tool_options --import ..."
$gnulib_tool $gnulib_tool_options --import $gnulib_modules \
|| die "gnulib-tool failed"
fi
for file in $gnulib_files; do
symlink_to_dir "$GNULIB_SRCDIR" $file \
|| die "failed to symlink $file"
done
fi
bootstrap_post_import_hook \
|| die "bootstrap_post_import_hook failed"
# Remove any dangling symlink matching "*.m4" or "*.[ch]" in some
# gnulib-populated directories. Such .m4 files would cause aclocal to fail.
# The following requires GNU find 4.2.3 or newer. Considering the usual
# portability constraints of this script, that may seem a very demanding
# requirement, but it should be ok. Ignore any failure, which is fine,
# since this is only a convenience to help developers avoid the relatively
# unusual case in which a symlinked-to .m4 file is git-removed from gnulib
# between successive runs of this script.
find "$m4_base" "$source_base" \
-depth \( -name '*.m4' -o -name '*.[ch]' \) \
-type l -xtype l -delete > /dev/null 2>&1
# Invoke autoreconf with --force --install to ensure upgrades of tools
# such as ylwrap.
AUTORECONFFLAGS="--verbose --install --force $ACLOCAL_FLAGS"
AUTORECONFFLAGS="$AUTORECONFFLAGS --no-recursive"
# Tell autoreconf not to invoke autopoint or libtoolize; they were run above.
echo "running: AUTOPOINT=true LIBTOOLIZE=true $AUTORECONF $AUTORECONFFLAGS"
AUTOPOINT=true LIBTOOLIZE=true $AUTORECONF $AUTORECONFFLAGS \
|| die "autoreconf failed"
# Get some extra files from gnulib, overriding existing files.
for file in $gnulib_extra_files; do
case $file in
*/INSTALL) dst=INSTALL;;
build-aux/*) dst=$build_aux/${file#build-aux/};;
*) dst=$file;;
esac
symlink_to_dir "$GNULIB_SRCDIR" $file $dst \
|| die "failed to symlink $file"
done
if test $with_gettext = yes; then
# Create gettext configuration.
echo "$0: Creating po/Makevars from po/Makevars.template ..."
rm -f po/Makevars
sed '
/^EXTRA_LOCALE_CATEGORIES *=/s/=.*/= '"$EXTRA_LOCALE_CATEGORIES"'/
/^COPYRIGHT_HOLDER *=/s/=.*/= '"$COPYRIGHT_HOLDER"'/
/^MSGID_BUGS_ADDRESS *=/s|=.*|= '"$MSGID_BUGS_ADDRESS"'|
/^XGETTEXT_OPTIONS *=/{
s/$/ \\/
a\
'"$XGETTEXT_OPTIONS"' $${end_of_xgettext_options+}
}
' po/Makevars.template >po/Makevars \
|| die 'cannot generate po/Makevars'
# If the 'gettext' module is in use, grab the latest Makefile.in.in.
# If only the 'gettext-h' module is in use, assume autopoint already
# put the correct version of this file into place.
case $gnulib_modules in
*gettext-h*) ;;
*gettext*)
cp $GNULIB_SRCDIR/build-aux/po/Makefile.in.in po/Makefile.in.in \
|| die "cannot create po/Makefile.in.in"
;;
esac
if test -d runtime-po; then
# Similarly for runtime-po/Makevars, but not quite the same.
rm -f runtime-po/Makevars
sed '
/^DOMAIN *=.*/s/=.*/= '"$package"'-runtime/
/^subdir *=.*/s/=.*/= runtime-po/
/^MSGID_BUGS_ADDRESS *=/s/=.*/= bug-'"$package"'@gnu.org/
/^XGETTEXT_OPTIONS *=/{
s/$/ \\/
a\
'"$XGETTEXT_OPTIONS_RUNTIME"' $${end_of_xgettext_options+}
}
' po/Makevars.template >runtime-po/Makevars \
|| die 'cannot generate runtime-po/Makevars'
# Copy identical files from po to runtime-po.
cp -p po/Makefile.in.in po/*-quot po/*.header po/*.sed po/*.sin runtime-po
fi
fi
bootstrap_epilogue
echo "$0: done. Now you can run './configure'."
}
# ----------------------------------------------------------------------------
# Local Variables:
# eval: (add-hook 'before-save-hook 'time-stamp nil t)
# time-stamp-start: "scriptlibversion="
# time-stamp-format: "%:y-%02m-%02d.%02H"
# time-stamp-time-zone: "UTC0"
# time-stamp-end: "; # UTC"
# End:
libidn-v1.43/bootstrap.conf 0000664 0000000 0000000 00000011111 14767240365 0015765 0 ustar 00root root 0000000 0000000 # Bootstrap configuration. -*- sh -*-
# Copyright (C) 2021-2025 Simon Josefsson
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
GNULIB_REVISION=c89cd2fbd3b9f3d7c5a146247256599714c91ec7
source_base=gl
tests_base=gl/tests
m4_base=gl/m4
gnulib_name=libgnu
gnulib_tool_option_extras="--no-vc-files"
checkout_only_file=.gitignore
gnulib_modules="
autobuild
csharpcomp-script
csharpexec-script
error
getline
getopt-gnu
git-version-gen
gitlog-to-changelog
lib-msvc-compat
lib-symbol-versions
lib-symbol-visibility
manywarnings
pmccabe2html
progname
readme-release
update-copyright
useless-if-before-free
valgrind-tests
version-etc
version-stamp
"
lib_modules="
gettext-h
langinfo
stdint
striconv
strverscmp
unistr/u8-check
"
# Build prerequisites
buildreq="\
autoconf 2.64
automake 1.13
git 1.4.4
perl 5.5
make -
gperf -
gengetopt -
"
if ! command -v gtkdocize >/dev/null; then
# Pacify autoreconf's invocation of gtkdocize.
GTKDOCIZE="true gtkdocize"
export GTKDOCIZE
fi
# Prime po/*.po from fall-back copy stored in git.
for poin in po/*.po.in; do
po=$(echo $poin | sed 's/.in//')
test -f $po || cp -v $poin $po
done
ls po/*.po | sed 's|.*/||; s|\.po$||' > po/LINGUAS
bootstrap_post_import_hook ()
{
# No test modules are used but 'valgrind-tests' make gnulib-tool
# believe we need this.
rm -rf gl/tests
${GNULIB_SRCDIR}/gnulib-tool --without-tests --libtool --macro-prefix=lgl --lgpl=2 --dir=. --lib=libgnu --source-base=lib/gl --m4-base=lib/gl/m4 --no-vc-files --import ${lib_modules}
# Autopoint and libtoolize copy M4 macros into AC_CONFIG_MACRO_DIR
# which is lib/m4 in this project. The ./bootstrap script copies
# gnulib's M4 macros into gl/m4 and lib/gl/m4 respectively.
#
# The M4 files from gnulib must be preferred over the files from
# autopoint and libtoolize. Otherwise you get build errors, since
# gnulib (other M4 macros and the *.in.h header file stubs) assume
# they are using the gnulib M4 macros. It may be possible to solve
# this with clever ordering of aclocal -I's but then you would still
# have multiple versions of the same M4 macro in the tarball.
#
# In most projects, the M4 files from one single gnulib-tool
# instance would overwrite all autopoint/libtoolize M4 files, and
# then you would use that m4-base as the AC_CONFIG_MACRO_DIR value
# and everything would work.
#
# In this project it happens that some M4 files are put in gl/m4/
# and some in lib/gl/m4/ and that neither directory contains a
# strict superset of the M4 files that were copied into lib/m4/.
#
# The following is a generic solution to make sure any
# autopoint/libtoolize M4 macros are not used, but instead the
# version from gnulib ends up being used.
#
# This seem like a hack, so other solutions are welcome.
echo Removing older autopoint/libtool M4 macros...
for f in `cd lib/m4 && ls *.m4`; do
test -f gl/m4/$f && rm -fv lib/m4/$f
test -f lib/gl/m4/$f && rm -fv lib/m4/$f
done
if ! gtkdocize; then
echo "warning: gtkdocize missing -- gtk-doc manual will be missing"
# rm because gtk-doc.make might be a link to a protected file
rm -f gtk-doc.make
echo "EXTRA_DIST =" > gtk-doc.make
echo "CLEANFILES =" >> gtk-doc.make
fi
# Automake requires that ChangeLog exist.
touch ChangeLog || return 1
}
bootstrap_epilogue ()
{
# Run automake again. It seems the first time ./bootstrap runs
# automake, it will not add some files to am__DIST_COMMON in
# top-level Makefile.in, but on subsequent runs (for example
# through autoreconf, which is triggered on 'make release') it
# will add the files. The missing files include
# build-aux/depcomp, build-aux/mdate-sh, build-aux/texinfo.texi,
# and build-aux/ylwrap. We want the am__DIST_COMMON value to be
# identical so that "make dist" and "make release" tarballs are
# identical and reproducible.
${AUTOMAKE=automake} --no-force
}
libidn-v1.43/cfg.mk 0000664 0000000 0000000 00000012044 14767240365 0014177 0 ustar 00root root 0000000 0000000 # Copyright (C) 2006-2025 Simon Josefsson
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
manual_title = Internationalized Domain Names Library
old_NEWS_hash = a64ec7fa8abeb91277eb3479d79c2272
guix = $(shell command -v guix > /dev/null && echo ,guix)
bootstrap-tools = git,gnulib,autoconf,automake,libtoolize,make,makeinfo,help2man,gperf,gengetopt,gtkdocize,tar,gzip$(guix)
# make syntax-check
local-checks-to-skip = sc_GPL_version sc_prohibit_strcmp
local-checks-to-skip += sc_prohibit_have_config_h sc_require_config_h sc_require_config_h_first
local-checks-to-skip += sc_prohibit_gnu_make_extensions
VC_LIST_ALWAYS_EXCLUDE_REGEX = ^doc/specifications/.*|(fuzz/.*.(in|repro)/.*)$$
exclude_file_name_regexp--sc_bindtextdomain = ^examples/|libc/|tests/|fuzz/
exclude_file_name_regexp--sc_file_system = ^contrib/doxygen/Doxyfile.(in|orig)$$
exclude_file_name_regexp--sc_fsf_postal = ^(m4/pkg.m4|COPYINGv2|COPYING.LESSERv2)$$
exclude_file_name_regexp--sc_indent = '^lib/\(gunibreak\|gunicomp\|gunidecomp\).h$$'
exclude_file_name_regexp--sc_prohibit_always_true_header_tests = ^lib/toutf8.c$$
exclude_file_name_regexp--sc_prohibit_atoi_atof = ^examples/example2.c$$
exclude_file_name_regexp--sc_prohibit_empty_lines_at_EOF = ^csharp/libidn.suo|csharp/libidn_PPC.suo$$
exclude_file_name_regexp--sc_prohibit_strncpy = ^src/idn.c$$
exclude_file_name_regexp--sc_trailing_blank = ^doc/components.fig|m4/pkg.m4|contrib/doxygen/Doxyfile.(in|orig)|gl/top/README-release.diff|csharp/|java/src/|lib/gen-unicode-tables.pl|lib/(gunibreak|gunicomp|gunidecomp).h$$
exclude_file_name_regexp--sc_two_space_separator_in_usage = ^cfg.mk$$
exclude_file_name_regexp--sc_unportable_grep_q = ^gl/top/README-release.diff$$
exclude_file_name_regexp--sc_useless_cpp_parens = ^lib/nfkc.c$$
TAR_OPTIONS += --mode=go+u,go-w --mtime=$(abs_top_srcdir)/NEWS
announce_gen_args = --cksum-checksums
url_dir_list = https://ftp.gnu.org/gnu/libidn
DIST_ARCHIVES += $(shell \
if test -e $(srcdir)/.git && command -v git > /dev/null; then \
echo $(PACKAGE)-v$(VERSION)-src.tar.gz; \
fi)
review-diff:
git diff `git describe --abbrev=0`.. \
| grep -v -e '^index' -e '^deleted file mode' -e '^new file mode' \
| filterdiff -p 1 -x 'build-aux/*' -x 'gl/*' -x 'lib/gl/*' -x 'po/*' -x 'maint.mk' -x '.gitignore' -x .gitlab-ci.yml -x '.x-sc*' -x ChangeLog -x GNUmakefile -x .prev-version -x bootstrap -x bootstrap-funclib.sh \
| less
my-update-copyright:
make update-copyright update-copyright-env='UPDATE_COPYRIGHT_USE_INTERVALS=1'
make update-copyright update-copyright-env='UPDATE_COPYRIGHT_HOLDER="Simon Josefsson" UPDATE_COPYRIGHT_USE_INTERVALS=1'
perl -pi -e "s/2002-20.. Simon Josefsson/2002-`(date +%Y)` Simon Josefsson/" doc/Makefile.am src/idn.c
aximport:
for f in m4/ax_*.m4; do \
wget -nv -O $$f "https://git.savannah.gnu.org/gitweb/?p=autoconf-archive.git;a=blob_plain;f=$$f"; \
done
update-po: refresh-po
rm -fv po/*.po.in
for f in `ls po/*.po | grep -v quot.po`; do \
cp $$f $$f.in; \
done
git add po/*.po.in
git commit po/*.po.in \
-m "maint: Run 'make update-po' for new translations."
CODESPELL_IGNORE_WORDS_LIST = meu,bu,te,ba,noe,nwe,mye,myu,tye,tim,ede,wich,poin
exclude_file_name_regexp--sc_codespell = '^gnulib|doc/specifications/.*|doc/gdoc|po/.*\.po\.in|fuzz/libidn_(stringprep|toascii|tounicode)_fuzzer.in/.*$$'
sc_codespell:
@if ! command -v codespell > /dev/null; then \
echo 1>&2 '$(ME): sc_codespell: codespell is missing'; \
else \
codespell --ignore-words-list $(CODESPELL_IGNORE_WORDS_LIST) \
$$(git -C $(srcdir) ls-files | egrep -v \
$(exclude_file_name_regexp--sc_codespell)); \
fi
sc_libtool_version_bump:
@git -C $(srcdir) diff v$(PREV_VERSION).. | grep '^+AC_SUBST(LT' > /dev/null
# Fuzz
COVERAGE_CCOPTS ?= "-g --coverage"
COVERAGE_OUT ?= doc/coverage
fuzz-coverage:
$(MAKE) $(AM_MAKEFLAGS) clean
lcov --directory . --zerocounters
$(MAKE) $(AM_MAKEFLAGS) CFLAGS=$(COVERAGE_CCOPTS) CXXFLAGS=$(COVERAGE_CCOPTS)
$(MAKE) -C fuzz $(AM_MAKEFLAGS) CFLAGS=$(COVERAGE_CCOPTS) CXXFLAGS=$(COVERAGE_CCOPTS) check
mkdir -p $(COVERAGE_OUT)
lcov --directory . --output-file $(COVERAGE_OUT)/$(PACKAGE).info --capture
lcov --remove $(COVERAGE_OUT)/$(PACKAGE).info '*/lib/gl/*' -o $(COVERAGE_OUT)/$(PACKAGE).info
genhtml --output-directory $(COVERAGE_OUT) \
$(COVERAGE_OUT)/$(PACKAGE).info \
--highlight --frames --legend \
--title "$(PACKAGE_NAME)"
@echo
@echo "View fuzz coverage report with 'xdg-open $(COVERAGE_OUT)/index.html'"
libidn-v1.43/configure.ac 0000664 0000000 0000000 00000020660 14767240365 0015400 0 ustar 00root root 0000000 0000000 dnl Process this file with autoconf to produce a configure script.
dnl Copyright (C) 2002-2025 Simon Josefsson
dnl
dnl This file is part of GNU Libidn.
dnl
dnl This program is free software: you can redistribute it and/or modify
dnl it under the terms of the GNU General Public License as published by
dnl the Free Software Foundation, either version 3 of the License, or
dnl (at your option) any later version.
dnl
dnl This program is distributed in the hope that it will be useful,
dnl but WITHOUT ANY WARRANTY; without even the implied warranty of
dnl MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
dnl GNU General Public License for more details.
dnl
dnl You should have received a copy of the GNU General Public License
dnl along with this program. If not, see .
AC_INIT([GNU Libidn],
m4_esyscmd([build-aux/git-version-gen .tarball-version]),
[help-libidn@gnu.org])
# Library code modified: REVISION++
# Interfaces changed/added/removed: CURRENT++ REVISION=0
# Interfaces added: AGE++
# Interfaces removed: AGE=0
AC_SUBST(LT_CURRENT, 18)
AC_SUBST(LT_REVISION, 6)
AC_SUBST(LT_AGE, 6)
DLL_VERSION=`expr ${LT_CURRENT} - ${LT_AGE}`
AC_SUBST(DLL_VERSION)
AC_MSG_NOTICE([$PACKAGE_NAME $PACKAGE_VERSION $PACKAGE_TARNAME $LT_CURRENT:$LT_REVISION:$LT_AGE $DLL_VERSION])
AC_CONFIG_AUX_DIR([build-aux])
AC_CONFIG_MACRO_DIR([lib/m4])
AC_CONFIG_HEADERS([config.h])
AM_INIT_AUTOMAKE([-Wall tar-ustar])
AM_SILENT_RULES([yes])
AC_PROG_CC
gl_EARLY
lgl_EARLY
# Checks for programs.
AM_PROG_AR
LT_INIT([win32-dll])
AM_MISSING_PROG(PERL, perl, $missing_dir)
AM_MISSING_PROG(HELP2MAN, help2man, $missing_dir)
AM_MISSING_PROG([DOT], [dot])
AM_MISSING_PROG([GS], [gs])
AM_ICONV
AM_PATH_LISPDIR
AM_GNU_GETTEXT([external])
AM_GNU_GETTEXT_VERSION([0.19.8])
AM_LANGINFO_CODESET
# For gnulib stuff in gl/.
gl_INIT
lgl_INIT
AC_DEFINE([GNULIB_NO_VLA], 1, [Disable VLA usage in gettext.h.])
# Make it possible to disable TLD code.
AC_ARG_ENABLE(tld, AS_HELP_STRING([--disable-tld], [disable TLD code]),
enable_tld=$enableval, enable_tld=yes)
AM_CONDITIONAL(TLD, test "$enable_tld" != "no")
if test "$enable_tld" != "no"; then
AC_DEFINE([WITH_TLD], 1, [Define to 1 if you want TLD code.])
fi
AC_MSG_CHECKING([if TLD API for specific TLD rules should be built])
AC_MSG_RESULT($enable_tld)
#
# check for gtk-doc
#
m4_ifdef([GTK_DOC_CHECK], [
GTK_DOC_CHECK([1.14],[--flavour no-tmpl])
],[
AM_CONDITIONAL([ENABLE_GTK_DOC], false)
])
# needed for some older versions of gtk-doc
m4_ifdef([GTK_DOC_USE_LIBTOOL], [], [
AM_CONDITIONAL([GTK_DOC_USE_LIBTOOL], false)
])
# Check for java
AC_ARG_ENABLE(java, AS_HELP_STRING([--enable-java], [enable Java API]),,
enable_java=no)
if test "$enable_java" != "no"; then
AX_JAVA_OPTIONS
AX_PROG_JAVAC
AX_PROG_JAVADOC
AX_PROG_JAR
AM_MISSING_PROG(JAVADOC, javadoc, $missing_dir)
fi
AM_CONDITIONAL(JAVA, test "$enable_java" != "no")
AC_MSG_CHECKING([if implementation in Java should be built])
AC_MSG_RESULT($enable_java)
# Check for C#
if test -n "$HAVE_CSHARPCOMP"; then
gt_CSHARPEXEC
fi
AC_MSG_CHECKING([[if implementation in C# should be built]])
if test -n "$HAVE_CSHARPCOMP" && test -n "$HAVE_CSHARPEXEC"; then
enable_csharp=yes
else
enable_csharp=no
fi
AC_MSG_RESULT($enable_csharp)
AM_CONDITIONAL(CSHARP, test "$enable_csharp" = yes)
ubsan=no
AC_ARG_ENABLE([ubsan],
[AS_HELP_STRING([--enable-ubsan], [Turn on Undefined Behavior Sanitizer (UBSan)])],
[
if test "$enableval" = yes; then
ubsan=yes
CFLAGS=$CFLAGS" -fsanitize=undefined -fno-sanitize-recover=undefined"
fi
])
asan=no
AC_ARG_ENABLE([asan],
[AS_HELP_STRING([--enable-asan], [Turn on Address Sanitizer (ASan)])],
[
if test "$enableval" = yes; then
asan=yes
CFLAGS=$CFLAGS" -fsanitize=address -fno-omit-frame-pointer"
fi
])
AC_ARG_ENABLE([gcc-warnings],
[AS_HELP_STRING([[--enable-gcc-warnings[=TYPE]]],
[control generation of GCC warnings. The TYPE 'no' disables
warnings; 'yes' (default) generates cheap warnings;
'expensive' in addition generates expensive warnings
and 'error' also turn warnings into errors.])])
# https://www.gnu.org/software/gnulib//manual/html_node/manywarnings.html
AS_IF([test "$enable_gcc_warnings" != no],
[
# Set up the list of unwanted warning options.
nw=
if test "$enable_gcc_warnings" = yes; then
nw="$nw -fanalyzer"
fi
nw="$nw -Wbad-function-cast" # Casting a function's result is not more
# dangerous than casting any other value.
nw="$nw -Winline" # It's OK to not inline.
nw="$nw -Wsign-compare" # Too many false alarms.
nw="$nw -Wstrict-overflow" # It's OK to optimize strictly.
nw="$nw -Wsystem-headers" # Don't warn in system headers.
nw="$nw -Wsuggest-attribute=pure" # Is it worth using attributes?
nw="$nw -Wsuggest-attribute=const" # Is it worth using attributes?
nw="$nw -Wmissing-field-initializers" # We use missing fields = 0 a lot
gl_WARN_ADD([-Wframe-larger-than=208], [WARN_LIB_CFLAGS])
if test "$enable_gcc_warnings" = error; then
gl_WARN_ADD([-Werror], [WERROR_CFLAGS])
gl_WARN_ADD([-Wno-error=suggest-attribute=malloc], [WERROR_CFLAGS])
gl_WARN_ADD([-Wno-error=overlength-strings], [WERROR_CFLAGS])
gl_WARN_ADD([-Wno-error=analyzer-out-of-bounds], [WERROR_CFLAGS])
fi
# Setup the list of meaningful warning options for the C compiler.
# The list comes from manywarnings.m4. Warning options that are not
# generally meaningful have already been filtered out (cf.
# build-aux/gcc-warning.spec).
gl_MANYWARN_ALL_GCC([possible_warning_options])
# Compute the list of warning options that are desired.
gl_MANYWARN_COMPLEMENT([desired_warning_options],
[$possible_warning_options], [$nw])
# Compute the list of remaining undesired warning options.
# Namely those, that were not in manywarnings.m4 because they were
# already listed in build-aux/gcc-warning.spec; this includes those
# that are implied by -Wall.
gl_MANYWARN_COMPLEMENT([remaining_undesired_warning_options],
[$nw], [$possible_warning_options])
# Add the desired warning options to WARN_CFLAGS.
for w in $desired_warning_options; do
gl_WARN_ADD([$w])
done
# Add the opposites of the remaining undesired warning options to
# WARN_CFLAGS.
for w in `echo "$remaining_undesired_warning_options" | sed -e 's/-W/-Wno-/g'`; do
gl_WARN_ADD([$w])
done
])
AC_ARG_ENABLE(doc,
AS_HELP_STRING([--disable-doc], [don't generate any documentation]),
enable_doc=$enableval, enable_doc=yes)
AM_CONDITIONAL(ENABLE_DOC, test "$enable_doc" != "no")
AC_CONFIG_FILES([
Makefile
contrib/doxygen/Doxyfile
csharp/Makefile
doc/Makefile
doc/cyclo/Makefile
doc/java/Makefile
doc/reference/Makefile
doc/reference/version.xml
doc/specifications/Makefile
doc/tld/Makefile
examples/Makefile
fuzz/Makefile
gl/Makefile
java/Makefile
java/pom.xml
java/src/Makefile
java/src/main/Makefile
java/src/main/java/Makefile
java/src/main/java/gnu/Makefile
java/src/main/java/gnu/inet/Makefile
java/src/main/java/gnu/inet/encoding/Makefile
java/src/test/Makefile
java/src/test/java/Makefile
java/src/util/Makefile
java/src/util/java/Makefile
lib/Makefile
lib/gl/Makefile
lib/libidn.pc
po/Makefile.in
src/Makefile
tests/Makefile
])
gl_CONFIG_VERSION_STAMP
AC_OUTPUT
AC_MSG_NOTICE([summary of main build options:
Version: ${VERSION}
Libtool version $LT_CURRENT:$LT_REVISION:$LT_AGE
DLL version: $DLL_VERSION
Build system: ${build}
Host/Target system: ${host}
Install prefix: ${prefix}
Compiler: ${CC}
CFLAGS: ${CFLAGS}
CPPFLAGS: ${CPPFLAGS}
LDFLAGS: ${LDFLAGS}
Library types: Shared=${enable_shared}, Static=${enable_static}
Warning flags: $enable_gcc_warnings
WERROR_CFLAGS: $WERROR_CFLAGS
WARN_LIB_CFLAGS: $WARN_LIB_CFLAGS
WARN_CFLAGS: $WARN_CFLAGS
Documentation: ${enable_doc}
nl_langinfo: $gl_cv_header_langinfo_codeset
iconv: $am_cv_func_iconv_summary $LTLIBICONV
Version script: $have_ld_version_script
TLD code: $enable_tld
Build Java port: $enable_java
Build C# port: $enable_csharp
Address Sanitizer: $asan
UB Sanitizer: $ubsan
Valgrind: $opt_valgrind_tests ${VALGRIND}
])
libidn-v1.43/contrib/ 0000775 0000000 0000000 00000000000 14767240365 0014546 5 ustar 00root root 0000000 0000000 libidn-v1.43/contrib/README 0000664 0000000 0000000 00000002163 14767240365 0015430 0 ustar 00root root 0000000 0000000 Libidn contrib/README -- Notes for the contrib/ subdirectory.
Copyright (C) 2003-2025 Simon Josefsson
See the end for copying conditions.
The idn-python/ sub-directory contains a Python interface for Libidn,
contributed by Stephane Bortzmeyer . It is
licensed under the same licence as Libidn itself. Note that as of
version 2.3 Python has native IDN support, see
.
The web/ sub-directory contains a online libidn interface in PHP.
The java/ sub-directory builds Java *.class files that implement the
Libidn API. Note! It is unfinished and left as a proof of concept.
A developer with knowledge about Java is encouraged to take over it.
The doxygen/ sub-directory builds Doxygen documentation (HTML,
LaTeX/PDF and MAN). Simply invoke "doxygen" in that directory and it
should build the documentation.
----------------------------------------------------------------------
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/contrib/doxygen/ 0000775 0000000 0000000 00000000000 14767240365 0016223 5 ustar 00root root 0000000 0000000 libidn-v1.43/contrib/doxygen/Doxyfile.in 0000664 0000000 0000000 00000164050 14767240365 0020344 0 ustar 00root root 0000000 0000000 # Doxyfile 1.5.6
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project
#
# All text after a hash (#) is considered a comment and will be ignored
# The format is:
# TAG = value [value, ...]
# For lists items can also be appended using:
# TAG += value [value, ...]
# Values that contain spaces should be placed between quotes (" ")
#---------------------------------------------------------------------------
# Project related configuration options
#---------------------------------------------------------------------------
# This tag specifies the encoding used for all characters in the config file
# that follow. The default is UTF-8 which is also the encoding used for all
# text before the first occurrence of this tag. Doxygen uses libiconv (or the
# iconv built into libc) for the transcoding. See
# https://www.gnu.org/software/libiconv for the list of possible encodings.
DOXYFILE_ENCODING = UTF-8
# The PROJECT_NAME tag is a single word (or a sequence of words surrounded
# by quotes) that should identify the project.
PROJECT_NAME = @PACKAGE@
# The PROJECT_NUMBER tag can be used to enter a project or revision number.
# This could be handy for archiving the generated documentation or
# if some version control system is used.
PROJECT_NUMBER = @VERSION@
# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
# base path where the generated documentation will be put.
# If a relative path is entered, it will be relative to the location
# where doxygen was started. If left blank the current directory will be used.
OUTPUT_DIRECTORY =
# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
# 4096 sub-directories (in 2 levels) under the output directory of each output
# format and will distribute the generated files over these directories.
# Enabling this option can be useful when feeding doxygen a huge amount of
# source files, where putting all generated files in the same directory would
# otherwise cause performance problems for the file system.
CREATE_SUBDIRS = NO
# The OUTPUT_LANGUAGE tag is used to specify the language in which all
# documentation generated by doxygen is written. Doxygen will use this
# information to generate all constant output in the proper language.
# The default language is English, other supported languages are:
# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
# Croatian, Czech, Danish, Dutch, Farsi, Finnish, French, German, Greek,
# Hungarian, Italian, Japanese, Japanese-en (Japanese with English messages),
# Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, Polish,
# Portuguese, Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish,
# and Ukrainian.
OUTPUT_LANGUAGE = English
# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
# include brief member descriptions after the members that are listed in
# the file and class documentation (similar to JavaDoc).
# Set to NO to disable this.
BRIEF_MEMBER_DESC = YES
# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
# the brief description of a member or function before the detailed description.
# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
# brief descriptions will be completely suppressed.
REPEAT_BRIEF = YES
# This tag implements a quasi-intelligent brief description abbreviator
# that is used to form the text in various listings. Each string
# in this list, if found as the leading text of the brief description, will be
# stripped from the text and the result after processing the whole list, is
# used as the annotated text. Otherwise, the brief description is used as-is.
# If left blank, the following values are used ("$name" is automatically
# replaced with the name of the entity): "The $name class" "The $name widget"
# "The $name file" "is" "provides" "specifies" "contains"
# "represents" "a" "an" "the"
ABBREVIATE_BRIEF =
# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
# Doxygen will generate a detailed section even if there is only a brief
# description.
ALWAYS_DETAILED_SEC = NO
# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
# inherited members of a class in the documentation of that class as if those
# members were ordinary class members. Constructors, destructors and assignment
# operators of the base classes will not be shown.
INLINE_INHERITED_MEMB = NO
# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
# path before files name in the file list and in the header files. If set
# to NO the shortest path that makes the file name unique will be used.
FULL_PATH_NAMES = NO
# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
# can be used to strip a user-defined part of the path. Stripping is
# only done if one of the specified strings matches the left-hand part of
# the path. The tag can be used to show relative paths in the file list.
# If left blank the directory from which doxygen is run is used as the
# path to strip.
STRIP_FROM_PATH =
# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
# the path mentioned in the documentation of a class, which tells
# the reader which header file to include in order to use a class.
# If left blank only the name of the header file containing the class
# definition is used. Otherwise one should specify the include paths that
# are normally passed to the compiler using the -I flag.
STRIP_FROM_INC_PATH =
# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
# (but less readable) file names. This can be useful is your file systems
# doesn't support long names like on DOS, Mac, or CD-ROM.
SHORT_NAMES = NO
# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
# will interpret the first line (until the first dot) of a JavaDoc-style
# comment as the brief description. If set to NO, the JavaDoc
# comments will behave just like regular Qt-style comments
# (thus requiring an explicit @brief command for a brief description.)
JAVADOC_AUTOBRIEF = NO
# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
# interpret the first line (until the first dot) of a Qt-style
# comment as the brief description. If set to NO, the comments
# will behave just like regular Qt-style comments (thus requiring
# an explicit \brief command for a brief description.)
QT_AUTOBRIEF = NO
# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
# treat a multi-line C++ special comment block (i.e. a block of //! or ///
# comments) as a brief description. This used to be the default behaviour.
# The new default is to treat a multi-line C++ comment block as a detailed
# description. Set this tag to YES if you prefer the old behaviour instead.
MULTILINE_CPP_IS_BRIEF = NO
# If the DETAILS_AT_TOP tag is set to YES then Doxygen
# will output the detailed description near the top, like JavaDoc.
# If set to NO, the detailed description appears after the member
# documentation.
DETAILS_AT_TOP = NO
# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
# member inherits the documentation from any documented member that it
# re-implements.
INHERIT_DOCS = YES
# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
# a new page for each member. If set to NO, the documentation of a member will
# be part of the file/class/namespace that contains it.
SEPARATE_MEMBER_PAGES = NO
# The TAB_SIZE tag can be used to set the number of spaces in a tab.
# Doxygen uses this value to replace tabs by spaces in code fragments.
TAB_SIZE = 8
# This tag can be used to specify a number of aliases that acts
# as commands in the documentation. An alias has the form "name=value".
# For example adding "sideeffect=\par Side Effects:\n" will allow you to
# put the command \sideeffect (or @sideeffect) in the documentation, which
# will result in a user-defined paragraph with heading "Side Effects:".
# You can put \n's in the value part of an alias to insert newlines.
ALIASES =
# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
# sources only. Doxygen will then generate output that is more tailored for C.
# For instance, some of the names that are used will be different. The list
# of all members will be omitted, etc.
OPTIMIZE_OUTPUT_FOR_C = YES
# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
# sources only. Doxygen will then generate output that is more tailored for
# Java. For instance, namespaces will be presented as packages, qualified
# scopes will look different, etc.
OPTIMIZE_OUTPUT_JAVA = NO
# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
# sources only. Doxygen will then generate output that is more tailored for
# Fortran.
OPTIMIZE_FOR_FORTRAN = NO
# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
# sources. Doxygen will then generate output that is tailored for
# VHDL.
OPTIMIZE_OUTPUT_VHDL = NO
# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
# to include (a tag file for) the STL sources as input, then you should
# set this tag to YES in order to let doxygen match functions declarations and
# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
# func(std::string) {}). This also make the inheritance and collaboration
# diagrams that involve STL classes more complete and accurate.
BUILTIN_STL_SUPPORT = NO
# If you use Microsoft's C++/CLI language, you should set this option to YES to
# enable parsing support.
CPP_CLI_SUPPORT = NO
# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
# Doxygen will parse them like normal C++ but will assume all classes use public
# instead of private inheritance when no explicit protection keyword is present.
SIP_SUPPORT = NO
# For Microsoft's IDL there are propget and propput attributes to indicate getter
# and setter methods for a property. Setting this option to YES (the default)
# will make doxygen to replace the get and set methods by a property in the
# documentation. This will only work if the methods are indeed getting or
# setting a simple type. If this is not the case, or you want to show the
# methods anyway, you should set this option to NO.
IDL_PROPERTY_SUPPORT = YES
# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
# tag is set to YES, then doxygen will reuse the documentation of the first
# member in the group (if any) for the other members of the group. By default
# all members of a group must be documented explicitly.
DISTRIBUTE_GROUP_DOC = NO
# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
# the same type (for instance a group of public functions) to be put as a
# subgroup of that type (e.g. under the Public Functions section). Set it to
# NO to prevent subgrouping. Alternatively, this can be done per class using
# the \nosubgrouping command.
SUBGROUPING = YES
# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
# is documented as struct, union, or enum with the name of the typedef. So
# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
# with name TypeT. When disabled the typedef will appear as a member of a file,
# namespace, or class. And the struct will be named TypeS. This can typically
# be useful for C code in case the coding convention dictates that all compound
# types are typedef'ed and only the typedef is referenced, never the tag name.
TYPEDEF_HIDES_STRUCT = NO
#---------------------------------------------------------------------------
# Build related configuration options
#---------------------------------------------------------------------------
# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
# documentation are documented, even if no documentation was available.
# Private class members and static file members will be hidden unless
# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
EXTRACT_ALL = YES
# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
# will be included in the documentation.
EXTRACT_PRIVATE = NO
# If the EXTRACT_STATIC tag is set to YES all static members of a file
# will be included in the documentation.
EXTRACT_STATIC = NO
# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
# defined locally in source files will be included in the documentation.
# If set to NO only classes defined in header files are included.
EXTRACT_LOCAL_CLASSES = YES
# This flag is only useful for Objective-C code. When set to YES local
# methods, which are defined in the implementation section but not in
# the interface are included in the documentation.
# If set to NO (the default) only methods in the interface are included.
EXTRACT_LOCAL_METHODS = NO
# If this flag is set to YES, the members of anonymous namespaces will be
# extracted and appear in the documentation as a namespace called
# 'anonymous_namespace{file}', where file will be replaced with the base
# name of the file that contains the anonymous namespace. By default
# anonymous namespace are hidden.
EXTRACT_ANON_NSPACES = NO
# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
# undocumented members of documented classes, files or namespaces.
# If set to NO (the default) these members will be included in the
# various overviews, but no documentation section is generated.
# This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_MEMBERS = NO
# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
# undocumented classes that are normally visible in the class hierarchy.
# If set to NO (the default) these classes will be included in the various
# overviews. This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_CLASSES = NO
# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
# friend (class|struct|union) declarations.
# If set to NO (the default) these declarations will be included in the
# documentation.
HIDE_FRIEND_COMPOUNDS = NO
# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
# documentation blocks found inside the body of a function.
# If set to NO (the default) these blocks will be appended to the
# function's detailed documentation block.
HIDE_IN_BODY_DOCS = NO
# The INTERNAL_DOCS tag determines if documentation
# that is typed after a \internal command is included. If the tag is set
# to NO (the default) then the documentation will be excluded.
# Set it to YES to include the internal documentation.
INTERNAL_DOCS = NO
# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
# file names in lower-case letters. If set to YES upper-case letters are also
# allowed. This is useful if you have classes or files whose names only differ
# in case and if your file system supports case sensitive file names. Windows
# and Mac users are advised to set this option to NO.
CASE_SENSE_NAMES = YES
# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
# will show members with their full class and namespace scopes in the
# documentation. If set to YES the scope will be hidden.
HIDE_SCOPE_NAMES = NO
# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
# will put a list of the files that are included by a file in the documentation
# of that file.
SHOW_INCLUDE_FILES = YES
# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
# is inserted in the documentation for inline members.
INLINE_INFO = YES
# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
# will sort the (detailed) documentation of file and class members
# alphabetically by member name. If set to NO the members will appear in
# declaration order.
SORT_MEMBER_DOCS = YES
# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
# brief documentation of file, namespace and class members alphabetically
# by member name. If set to NO (the default) the members will appear in
# declaration order.
SORT_BRIEF_DOCS = NO
# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
# hierarchy of group names into alphabetical order. If set to NO (the default)
# the group names will appear in their defined order.
SORT_GROUP_NAMES = NO
# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
# sorted by fully-qualified names, including namespaces. If set to
# NO (the default), the class list will be sorted only by class name,
# not including the namespace part.
# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
# Note: This option applies only to the class list, not to the
# alphabetical list.
SORT_BY_SCOPE_NAME = NO
# The GENERATE_TODOLIST tag can be used to enable (YES) or
# disable (NO) the todo list. This list is created by putting \todo
# commands in the documentation.
GENERATE_TODOLIST = YES
# The GENERATE_TESTLIST tag can be used to enable (YES) or
# disable (NO) the test list. This list is created by putting \test
# commands in the documentation.
GENERATE_TESTLIST = YES
# The GENERATE_BUGLIST tag can be used to enable (YES) or
# disable (NO) the bug list. This list is created by putting \bug
# commands in the documentation.
GENERATE_BUGLIST = YES
# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
# disable (NO) the deprecated list. This list is created by putting
# \deprecated commands in the documentation.
GENERATE_DEPRECATEDLIST= YES
# The ENABLED_SECTIONS tag can be used to enable conditional
# documentation sections, marked by \if sectionname ... \endif.
ENABLED_SECTIONS =
# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
# the initial value of a variable or define consists of for it to appear in
# the documentation. If the initializer consists of more lines than specified
# here it will be hidden. Use a value of 0 to hide initializers completely.
# The appearance of the initializer of individual variables and defines in the
# documentation can be controlled using \showinitializer or \hideinitializer
# command in the documentation regardless of this setting.
MAX_INITIALIZER_LINES = 30
# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
# at the bottom of the documentation of classes and structs. If set to YES the
# list will mention the files that were used to generate the documentation.
SHOW_USED_FILES = YES
# If the sources in your project are distributed over multiple directories
# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy
# in the documentation. The default is NO.
SHOW_DIRECTORIES = NO
# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
# This will remove the Files entry from the Quick Index and from the
# Folder Tree View (if specified). The default is YES.
SHOW_FILES = YES
# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
# Namespaces page. This will remove the Namespaces entry from the Quick Index
# and from the Folder Tree View (if specified). The default is YES.
SHOW_NAMESPACES = YES
# The FILE_VERSION_FILTER tag can be used to specify a program or script that
# doxygen should invoke to get the current version for each file (typically from
# the version control system). Doxygen will invoke the program by executing (via
# popen()) the command , where is the value of
# the FILE_VERSION_FILTER tag, and is the name of an input file
# provided by doxygen. Whatever the program writes to standard output
# is used as the file version. See the manual for examples.
FILE_VERSION_FILTER =
#---------------------------------------------------------------------------
# configuration options related to warning and progress messages
#---------------------------------------------------------------------------
# The QUIET tag can be used to turn on/off the messages that are generated
# by doxygen. Possible values are YES and NO. If left blank NO is used.
QUIET = NO
# The WARNINGS tag can be used to turn on/off the warning messages that are
# generated by doxygen. Possible values are YES and NO. If left blank
# NO is used.
WARNINGS = YES
# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
# automatically be disabled.
WARN_IF_UNDOCUMENTED = YES
# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
# potential errors in the documentation, such as not documenting some
# parameters in a documented function, or documenting parameters that
# don't exist or using markup commands wrongly.
WARN_IF_DOC_ERROR = YES
# This WARN_NO_PARAMDOC option can be abled to get warnings for
# functions that are documented, but have no documentation for their parameters
# or return value. If set to NO (the default) doxygen will only warn about
# wrong or incomplete parameter documentation, but not about the absence of
# documentation.
WARN_NO_PARAMDOC = NO
# The WARN_FORMAT tag determines the format of the warning messages that
# doxygen can produce. The string should contain the $file, $line, and $text
# tags, which will be replaced by the file and line number from which the
# warning originated and the warning text. Optionally the format may contain
# $version, which will be replaced by the version of the file (if it could
# be obtained via FILE_VERSION_FILTER)
WARN_FORMAT = "$file:$line: $text"
# The WARN_LOGFILE tag can be used to specify a file to which warning
# and error messages should be written. If left blank the output is written
# to stderr.
WARN_LOGFILE =
#---------------------------------------------------------------------------
# configuration options related to the input files
#---------------------------------------------------------------------------
# The INPUT tag can be used to specify the files and/or directories that contain
# documented source files. You may enter file names like "myfile.cpp" or
# directories like "/usr/src/myproject". Separate the files or directories
# with spaces.
INPUT = ../../lib
# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
# also the default input encoding. Doxygen uses libiconv (or the iconv built
# into libc) for the transcoding. See https://www.gnu.org/software/libiconv for
# the list of possible encodings.
INPUT_ENCODING = UTF-8
# If the value of the INPUT tag contains directories, you can use the
# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank the following patterns are tested:
# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx
# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
FILE_PATTERNS =
# The RECURSIVE tag can be used to turn specify whether or not subdirectories
# should be searched for input files as well. Possible values are YES and NO.
# If left blank NO is used.
RECURSIVE = NO
# The EXCLUDE tag can be used to specify files and/or directories that should
# excluded from the INPUT source files. This way you can easily exclude a
# subdirectory from a directory tree whose root is specified with the INPUT tag.
EXCLUDE =
# The EXCLUDE_SYMLINKS tag can be used select whether or not files or
# directories that are symbolic links (a Unix filesystem feature) are excluded
# from the input.
EXCLUDE_SYMLINKS = NO
# If the value of the INPUT tag contains directories, you can use the
# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
# certain files from those directories. Note that the wildcards are matched
# against the file with absolute path, so to exclude all test directories
# for example use the pattern */test/*
EXCLUDE_PATTERNS =
# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
# (namespaces, classes, functions, etc.) that should be excluded from the
# output. The symbol name can be a fully qualified name, a word, or if the
# wildcard * is used, a substring. Examples: ANamespace, AClass,
# AClass::ANamespace, ANamespace::*Test
EXCLUDE_SYMBOLS =
# The EXAMPLE_PATH tag can be used to specify one or more files or
# directories that contain example code fragments that are included (see
# the \include command).
EXAMPLE_PATH = ../../examples
# If the value of the EXAMPLE_PATH tag contains directories, you can use the
# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank all files are included.
EXAMPLE_PATTERNS = example*.c
# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
# searched for input files to be used with the \include or \dontinclude
# commands irrespective of the value of the RECURSIVE tag.
# Possible values are YES and NO. If left blank NO is used.
EXAMPLE_RECURSIVE = NO
# The IMAGE_PATH tag can be used to specify one or more files or
# directories that contain image that are included in the documentation (see
# the \image command).
IMAGE_PATH =
# The INPUT_FILTER tag can be used to specify a program that doxygen should
# invoke to filter for each input file. Doxygen will invoke the filter program
# by executing (via popen()) the command , where
# is the value of the INPUT_FILTER tag, and is the name of an
# input file. Doxygen will then use the output that the filter program writes
# to standard output. If FILTER_PATTERNS is specified, this tag will be
# ignored.
INPUT_FILTER = ./gdoc2doxygen
# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
# basis. Doxygen will compare the file name with each pattern and apply the
# filter if there is a match. The filters are a list of the form:
# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER
# is applied to all files.
FILTER_PATTERNS =
# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
# INPUT_FILTER) will be used to filter the input files when producing source
# files to browse (i.e. when SOURCE_BROWSER is set to YES).
FILTER_SOURCE_FILES = NO
#---------------------------------------------------------------------------
# configuration options related to source browsing
#---------------------------------------------------------------------------
# If the SOURCE_BROWSER tag is set to YES then a list of source files will
# be generated. Documented entities will be cross-referenced with these sources.
# Note: To get rid of all source code in the generated output, make sure also
# VERBATIM_HEADERS is set to NO.
SOURCE_BROWSER = YES
# Setting the INLINE_SOURCES tag to YES will include the body
# of functions and classes directly in the documentation.
INLINE_SOURCES = NO
# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
# doxygen to hide any special comment blocks from generated source code
# fragments. Normal C and C++ comments will always remain visible.
STRIP_CODE_COMMENTS = YES
# If the REFERENCED_BY_RELATION tag is set to YES
# then for each documented function all documented
# functions referencing it will be listed.
REFERENCED_BY_RELATION = NO
# If the REFERENCES_RELATION tag is set to YES
# then for each documented function all documented entities
# called/used by that function will be listed.
REFERENCES_RELATION = NO
# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
# link to the source code. Otherwise they will link to the documentation.
REFERENCES_LINK_SOURCE = YES
# If the USE_HTAGS tag is set to YES then the references to source code
# will point to the HTML generated by the htags(1) tool instead of doxygen
# built-in source browser. The htags tool is part of GNU's global source
# tagging system (see https://www.gnu.org/software/global/global.html). You
# will need version 4.8.6 or higher.
USE_HTAGS = NO
# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
# will generate a verbatim copy of the header file for each class for
# which an include is specified. Set to NO to disable this.
VERBATIM_HEADERS = YES
#---------------------------------------------------------------------------
# configuration options related to the alphabetical class index
#---------------------------------------------------------------------------
# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
# of all compounds will be generated. Enable this if the project
# contains a lot of classes, structs, unions or interfaces.
ALPHABETICAL_INDEX = NO
# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
# in which this list will be split (can be a number in the range [1..20])
COLS_IN_ALPHA_INDEX = 5
# In case all classes in a project start with a common prefix, all
# classes will be put under the same header in the alphabetical index.
# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
# should be ignored while generating the index headers.
IGNORE_PREFIX =
#---------------------------------------------------------------------------
# configuration options related to the HTML output
#---------------------------------------------------------------------------
# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
# generate HTML output.
GENERATE_HTML = YES
# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `html' will be used as the default path.
HTML_OUTPUT = html
# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
# doxygen will generate files with .html extension.
HTML_FILE_EXTENSION = .html
# The HTML_HEADER tag can be used to specify a personal HTML header for
# each generated HTML page. If it is left blank doxygen will generate a
# standard header.
HTML_HEADER =
# The HTML_FOOTER tag can be used to specify a personal HTML footer for
# each generated HTML page. If it is left blank doxygen will generate a
# standard footer.
HTML_FOOTER =
# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
# style sheet that is used by each HTML page. It can be used to
# fine-tune the look of the HTML output. If the tag is left blank doxygen
# will generate a default style sheet. Note that doxygen will try to copy
# the style sheet file to the HTML output directory, so don't put your own
# stylesheet in the HTML output directory as well, or it will be erased!
HTML_STYLESHEET =
# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes,
# files or namespaces will be aligned in HTML using tables. If set to
# NO a bullet list will be used.
HTML_ALIGN_MEMBERS = YES
# If the GENERATE_HTMLHELP tag is set to YES, additional index files
# will be generated that can be used as input for tools like the
# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
# of the generated HTML documentation.
GENERATE_HTMLHELP = NO
# If the GENERATE_DOCSET tag is set to YES, additional index files
# will be generated that can be used as input for Apple's Xcode 3
# integrated development environment, introduced with OSX 10.5 (Leopard).
# To create a documentation set, doxygen will generate a Makefile in the
# HTML output directory. Running make will produce the docset in that
# directory and running "make install" will install the docset in
# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
# it at startup.
GENERATE_DOCSET = NO
# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
# feed. A documentation feed provides an umbrella under which multiple
# documentation sets from a single provider (such as a company or product suite)
# can be grouped.
DOCSET_FEEDNAME = "Doxygen generated docs"
# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
# should uniquely identify the documentation set bundle. This should be a
# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
# will append .docset to the name.
DOCSET_BUNDLE_ID = org.doxygen.Project
# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
# documentation will contain sections that can be hidden and shown after the
# page has loaded. For this to work a browser that supports
# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox
# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
HTML_DYNAMIC_SECTIONS = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
# be used to specify the file name of the resulting .chm file. You
# can add a path in front of the file if the result should not be
# written to the html output directory.
CHM_FILE =
# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
# be used to specify the location (absolute path including file name) of
# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
# the HTML help compiler on the generated index.hhp.
HHC_LOCATION =
# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
# controls if a separate .chi index file is generated (YES) or that
# it should be included in the master .chm file (NO).
GENERATE_CHI = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
# is used to encode HtmlHelp index (hhk), content (hhc) and project file
# content.
CHM_INDEX_ENCODING =
# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
# controls whether a binary table of contents is generated (YES) or a
# normal table of contents (NO) in the .chm file.
BINARY_TOC = NO
# The TOC_EXPAND flag can be set to YES to add extra items for group members
# to the contents of the HTML help documentation and to the tree view.
TOC_EXPAND = NO
# The DISABLE_INDEX tag can be used to turn on/off the condensed index at
# top of each HTML page. The value NO (the default) enables the index and
# the value YES disables it.
DISABLE_INDEX = NO
# This tag can be used to set the number of enum values (range [1..20])
# that doxygen will group on one line in the generated HTML documentation.
ENUM_VALUES_PER_LINE = 4
# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
# structure should be generated to display hierarchical information.
# If the tag value is set to FRAME, a side panel will be generated
# containing a tree-like index structure (just like the one that
# is generated for HTML Help). For this to work a browser that supports
# JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+,
# Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are
# probably better off using the HTML help feature. Other possible values
# for this tag are: HIERARCHIES, which will generate the Groups, Directories,
# and Class Hiererachy pages using a tree view instead of an ordered list;
# ALL, which combines the behavior of FRAME and HIERARCHIES; and NONE, which
# disables this behavior completely. For backwards compatibility with previous
# releases of Doxygen, the values YES and NO are equivalent to FRAME and NONE
# respectively.
GENERATE_TREEVIEW = NONE
# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
# used to set the initial width (in pixels) of the frame in which the tree
# is shown.
TREEVIEW_WIDTH = 250
# Use this tag to change the font size of Latex formulas included
# as images in the HTML documentation. The default is 10. Note that
# when you change the font size after a successful doxygen run you need
# to manually remove any form_*.png images from the HTML output directory
# to force them to be regenerated.
FORMULA_FONTSIZE = 10
#---------------------------------------------------------------------------
# configuration options related to the LaTeX output
#---------------------------------------------------------------------------
# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
# generate Latex output.
GENERATE_LATEX = YES
# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `latex' will be used as the default path.
LATEX_OUTPUT = latex
# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
# invoked. If left blank `latex' will be used as the default command name.
LATEX_CMD_NAME = latex
# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
# generate index for LaTeX. If left blank `makeindex' will be used as the
# default command name.
MAKEINDEX_CMD_NAME = makeindex
# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
# LaTeX documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_LATEX = NO
# The PAPER_TYPE tag can be used to set the paper type that is used
# by the printer. Possible values are: a4, a4wide, letter, legal and
# executive. If left blank a4wide will be used.
PAPER_TYPE = a4wide
# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
# packages that should be included in the LaTeX output.
EXTRA_PACKAGES =
# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
# the generated latex document. The header should contain everything until
# the first chapter. If it is left blank doxygen will generate a
# standard header. Notice: only use this tag if you know what you are doing!
LATEX_HEADER =
# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
# is prepared for conversion to pdf (using ps2pdf). The pdf file will
# contain links (just like the HTML output) instead of page references
# This makes the output suitable for online browsing using a pdf viewer.
PDF_HYPERLINKS = YES
# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
# plain latex in the generated Makefile. Set this option to YES to get a
# higher quality PDF documentation.
USE_PDFLATEX = YES
# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
# command to the generated LaTeX files. This will instruct LaTeX to keep
# running if errors occur, instead of asking the user for help.
# This option is also used when generating formulas in HTML.
LATEX_BATCHMODE = NO
# If LATEX_HIDE_INDICES is set to YES then doxygen will not
# include the index chapters (such as File Index, Compound Index, etc.)
# in the output.
LATEX_HIDE_INDICES = NO
#---------------------------------------------------------------------------
# configuration options related to the RTF output
#---------------------------------------------------------------------------
# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
# The RTF output is optimized for Word 97 and may not look very pretty with
# other RTF readers or editors.
GENERATE_RTF = NO
# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `rtf' will be used as the default path.
RTF_OUTPUT = rtf
# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
# RTF documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_RTF = NO
# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
# will contain hyperlink fields. The RTF file will
# contain links (just like the HTML output) instead of page references.
# This makes the output suitable for online browsing using WORD or other
# programs which support those fields.
# Note: wordpad (write) and others do not support links.
RTF_HYPERLINKS = NO
# Load stylesheet definitions from file. Syntax is similar to doxygen's
# config file, i.e. a series of assignments. You only have to provide
# replacements, missing definitions are set to their default value.
RTF_STYLESHEET_FILE =
# Set optional variables used in the generation of an rtf document.
# Syntax is similar to doxygen's config file.
RTF_EXTENSIONS_FILE =
#---------------------------------------------------------------------------
# configuration options related to the man page output
#---------------------------------------------------------------------------
# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
# generate man pages
GENERATE_MAN = NO
# The MAN_OUTPUT tag is used to specify where the man pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `man' will be used as the default path.
MAN_OUTPUT = man
# The MAN_EXTENSION tag determines the extension that is added to
# the generated man pages (default is the subroutine's section .3)
MAN_EXTENSION = .3
# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
# then it will generate one additional man file for each entity
# documented in the real man page(s). These additional files
# only source the real man page, but without them the man command
# would be unable to find the correct page. The default is NO.
MAN_LINKS = NO
#---------------------------------------------------------------------------
# configuration options related to the XML output
#---------------------------------------------------------------------------
# If the GENERATE_XML tag is set to YES Doxygen will
# generate an XML file that captures the structure of
# the code including all documentation.
GENERATE_XML = NO
# The XML_OUTPUT tag is used to specify where the XML pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `xml' will be used as the default path.
XML_OUTPUT = xml
# The XML_SCHEMA tag can be used to specify an XML schema,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_SCHEMA =
# The XML_DTD tag can be used to specify an XML DTD,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_DTD =
# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
# dump the program listings (including syntax highlighting
# and cross-referencing information) to the XML output. Note that
# enabling this will significantly increase the size of the XML output.
XML_PROGRAMLISTING = YES
#---------------------------------------------------------------------------
# configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
# generate an AutoGen Definitions (see autogen.sf.net) file
# that captures the structure of the code including all
# documentation. Note that this feature is still experimental
# and incomplete at the moment.
GENERATE_AUTOGEN_DEF = NO
#---------------------------------------------------------------------------
# configuration options related to the Perl module output
#---------------------------------------------------------------------------
# If the GENERATE_PERLMOD tag is set to YES Doxygen will
# generate a Perl module file that captures the structure of
# the code including all documentation. Note that this
# feature is still experimental and incomplete at the
# moment.
GENERATE_PERLMOD = NO
# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
# the necessary Makefile rules, Perl scripts and LaTeX code to be able
# to generate PDF and DVI output from the Perl module output.
PERLMOD_LATEX = NO
# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
# nicely formatted so it can be parsed by a human reader. This is useful
# if you want to understand what is going on. On the other hand, if this
# tag is set to NO the size of the Perl module output will be much smaller
# and Perl will parse it just the same.
PERLMOD_PRETTY = YES
# The names of the make variables in the generated doxyrules.make file
# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
# This is useful so different doxyrules.make files included by the same
# Makefile don't overwrite each other's variables.
PERLMOD_MAKEVAR_PREFIX =
#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------
# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
# evaluate all C-preprocessor directives found in the sources and include
# files.
ENABLE_PREPROCESSING = YES
# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
# names in the source code. If set to NO (the default) only conditional
# compilation will be performed. Macro expansion can be done in a controlled
# way by setting EXPAND_ONLY_PREDEF to YES.
MACRO_EXPANSION = NO
# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
# then the macro expansion is limited to the macros specified with the
# PREDEFINED and EXPAND_AS_DEFINED tags.
EXPAND_ONLY_PREDEF = NO
# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
# in the INCLUDE_PATH (see below) will be search if a #include is found.
SEARCH_INCLUDES = YES
# The INCLUDE_PATH tag can be used to specify one or more directories that
# contain include files that are not input files but should be processed by
# the preprocessor.
INCLUDE_PATH =
# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
# patterns (like *.h and *.hpp) to filter out the header-files in the
# directories. If left blank, the patterns specified with FILE_PATTERNS will
# be used.
INCLUDE_FILE_PATTERNS =
# The PREDEFINED tag can be used to specify one or more macro names that
# are defined before the preprocessor is started (similar to the -D option of
# gcc). The argument of the tag is a list of macros of the form: name
# or name=definition (no spaces). If the definition and the = are
# omitted =1 is assumed. To prevent a macro definition from being
# undefined via #undef or recursively expanded use the := operator
# instead of the = operator.
PREDEFINED =
# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
# this tag can be used to specify a list of macro names that should be expanded.
# The macro definition that is found in the sources will be used.
# Use the PREDEFINED tag if you want to use a different macro definition.
EXPAND_AS_DEFINED =
# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
# doxygen's preprocessor will remove all function-like macros that are alone
# on a line, have an all uppercase name, and do not end with a semicolon. Such
# function macros are typically used for boiler-plate code, and will confuse
# the parser if not removed.
SKIP_FUNCTION_MACROS = YES
#---------------------------------------------------------------------------
# Configuration::additions related to external references
#---------------------------------------------------------------------------
# The TAGFILES option can be used to specify one or more tagfiles.
# Optionally an initial location of the external documentation
# can be added for each tagfile. The format of a tag file without
# this location is as follows:
# TAGFILES = file1 file2 ...
# Adding location for the tag files is done as follows:
# TAGFILES = file1=loc1 "file2 = loc2" ...
# where "loc1" and "loc2" can be relative or absolute paths or
# URLs. If a location is present for each tag, the installdox tool
# does not have to be run to correct the links.
# Note that each tag file must have a unique name
# (where the name does NOT include the path)
# If a tag file is not located in the directory in which doxygen
# is run, you must also specify the path to the tagfile here.
TAGFILES =
# When a file name is specified after GENERATE_TAGFILE, doxygen will create
# a tag file that is based on the input files it reads.
GENERATE_TAGFILE =
# If the ALLEXTERNALS tag is set to YES all external classes will be listed
# in the class index. If set to NO only the inherited external classes
# will be listed.
ALLEXTERNALS = NO
# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
# in the modules index. If set to NO, only the current project's groups will
# be listed.
EXTERNAL_GROUPS = YES
# The PERL_PATH should be the absolute path and name of the perl script
# interpreter (i.e. the result of `which perl').
PERL_PATH = /usr/bin/perl
#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------
# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
# or super classes. Setting the tag to NO turns the diagrams off. Note that
# this option is superseded by the HAVE_DOT option below. This is only a
# fallback. It is recommended to install and use dot, since it yields more
# powerful graphs.
CLASS_DIAGRAMS = YES
# You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see
# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# documentation. The MSCGEN_PATH tag allows you to specify the directory where
# the mscgen tool resides. If left empty the tool is assumed to be found in the
# default search path.
MSCGEN_PATH =
# If set to YES, the inheritance and collaboration graphs will hide
# inheritance and usage relations if the target is undocumented
# or is not a class.
HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz, a graph visualization
# toolkit from AT&T and Lucent Bell Labs. The other options in this section
# have no effect if this option is set to NO (the default)
HAVE_DOT = NO
# By default doxygen will write a font called FreeSans.ttf to the output
# directory and reference it in all dot files that doxygen generates. This
# font does not include all possible unicode characters however, so when you need
# these (or just want a differently looking font) you can specify the font name
# using DOT_FONTNAME. You need need to make sure dot is able to find the font,
# which can be done by putting it in a standard location or by setting the
# DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory
# containing the font.
DOT_FONTNAME = FreeSans
# By default doxygen will tell dot to use the output directory to look for the
# FreeSans.ttf font (which doxygen will put there itself). If you specify a
# different font using DOT_FONTNAME you can set the path where dot
# can find it using this tag.
DOT_FONTPATH =
# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect inheritance relations. Setting this tag to YES will force the
# the CLASS_DIAGRAMS tag to NO.
CLASS_GRAPH = YES
# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect implementation dependencies (inheritance, containment, and
# class references variables) of the class with other documented classes.
COLLABORATION_GRAPH = YES
# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for groups, showing the direct groups dependencies
GROUP_GRAPHS = YES
# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
# collaboration diagrams in a style similar to the OMG's Unified Modeling
# Language.
UML_LOOK = NO
# If set to YES, the inheritance and collaboration graphs will show the
# relations between templates and their instances.
TEMPLATE_RELATIONS = NO
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
# tags are set to YES then doxygen will generate a graph for each documented
# file showing the direct and indirect include dependencies of the file with
# other documented files.
INCLUDE_GRAPH = YES
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
# documented header file showing the documented files that directly or
# indirectly include this file.
INCLUDED_BY_GRAPH = YES
# If the CALL_GRAPH and HAVE_DOT options are set to YES then
# doxygen will generate a call dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable call graphs
# for selected functions only using the \callgraph command.
CALL_GRAPH = NO
# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
# doxygen will generate a caller dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable caller
# graphs for selected functions only using the \callergraph command.
CALLER_GRAPH = NO
# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
# will graphical hierarchy of all classes instead of a textual one.
GRAPHICAL_HIERARCHY = YES
# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES
# then doxygen will show the dependencies a directory has on other directories
# in a graphical way. The dependency relations are determined by the #include
# relations between the files in the directories.
DIRECTORY_GRAPH = YES
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. Possible values are png, jpg, or gif
# If left blank png will be used.
DOT_IMAGE_FORMAT = png
# The tag DOT_PATH can be used to specify the path where the dot tool can be
# found. If left blank, it is assumed the dot tool can be found in the path.
DOT_PATH =
# The DOTFILE_DIRS tag can be used to specify one or more directories that
# contain dot files that are included in the documentation (see the
# \dotfile command).
DOTFILE_DIRS =
# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
# nodes that will be shown in the graph. If the number of nodes in a graph
# becomes larger than this value, doxygen will truncate the graph, which is
# visualized by representing a node as a red box. Note that doxygen if the
# number of direct children of the root node in a graph is already larger than
# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
DOT_GRAPH_MAX_NODES = 50
# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
# graphs generated by dot. A depth value of 3 means that only nodes reachable
# from the root by following a path via at most 3 edges will be shown. Nodes
# that lay further from the root node will be omitted. Note that setting this
# option to 1 or 2 may greatly reduce the computation time needed for large
# code bases. Also note that the size of a graph can be further restricted by
# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
MAX_DOT_GRAPH_DEPTH = 0
# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
# background. This is enabled by default, which results in a transparent
# background. Warning: Depending on the platform used, enabling this option
# may lead to badly anti-aliased labels on the edges of a graph (i.e. they
# become hard to read).
DOT_TRANSPARENT = YES
# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
# files in one run (i.e. multiple -o and -T options on the command line). This
# makes dot run faster, but since only newer versions of dot (>1.8.10)
# support this, this feature is disabled by default.
DOT_MULTI_TARGETS = NO
# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
# generate a legend page explaining the meaning of the various boxes and
# arrows in the dot generated graphs.
GENERATE_LEGEND = YES
# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
# remove the intermediate dot files that are used to generate
# the various graphs.
DOT_CLEANUP = YES
#---------------------------------------------------------------------------
# Configuration::additions related to the search engine
#---------------------------------------------------------------------------
# The SEARCHENGINE tag specifies whether or not a search engine should be
# used. If set to NO the values of all tags below this one will be ignored.
SEARCHENGINE = NO
libidn-v1.43/contrib/doxygen/Doxyfile.orig 0000664 0000000 0000000 00000163745 14767240365 0020710 0 ustar 00root root 0000000 0000000 # Doxyfile 1.5.6
# This file describes the settings to be used by the documentation system
# doxygen (www.doxygen.org) for a project
#
# All text after a hash (#) is considered a comment and will be ignored
# The format is:
# TAG = value [value, ...]
# For lists items can also be appended using:
# TAG += value [value, ...]
# Values that contain spaces should be placed between quotes (" ")
#---------------------------------------------------------------------------
# Project related configuration options
#---------------------------------------------------------------------------
# This tag specifies the encoding used for all characters in the config file
# that follow. The default is UTF-8 which is also the encoding used for all
# text before the first occurrence of this tag. Doxygen uses libiconv (or the
# iconv built into libc) for the transcoding. See
# https://www.gnu.org/software/libiconv for the list of possible encodings.
DOXYFILE_ENCODING = UTF-8
# The PROJECT_NAME tag is a single word (or a sequence of words surrounded
# by quotes) that should identify the project.
PROJECT_NAME =
# The PROJECT_NUMBER tag can be used to enter a project or revision number.
# This could be handy for archiving the generated documentation or
# if some version control system is used.
PROJECT_NUMBER =
# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
# base path where the generated documentation will be put.
# If a relative path is entered, it will be relative to the location
# where doxygen was started. If left blank the current directory will be used.
OUTPUT_DIRECTORY =
# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
# 4096 sub-directories (in 2 levels) under the output directory of each output
# format and will distribute the generated files over these directories.
# Enabling this option can be useful when feeding doxygen a huge amount of
# source files, where putting all generated files in the same directory would
# otherwise cause performance problems for the file system.
CREATE_SUBDIRS = NO
# The OUTPUT_LANGUAGE tag is used to specify the language in which all
# documentation generated by doxygen is written. Doxygen will use this
# information to generate all constant output in the proper language.
# The default language is English, other supported languages are:
# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
# Croatian, Czech, Danish, Dutch, Farsi, Finnish, French, German, Greek,
# Hungarian, Italian, Japanese, Japanese-en (Japanese with English messages),
# Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, Polish,
# Portuguese, Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish,
# and Ukrainian.
OUTPUT_LANGUAGE = English
# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
# include brief member descriptions after the members that are listed in
# the file and class documentation (similar to JavaDoc).
# Set to NO to disable this.
BRIEF_MEMBER_DESC = YES
# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
# the brief description of a member or function before the detailed description.
# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
# brief descriptions will be completely suppressed.
REPEAT_BRIEF = YES
# This tag implements a quasi-intelligent brief description abbreviator
# that is used to form the text in various listings. Each string
# in this list, if found as the leading text of the brief description, will be
# stripped from the text and the result after processing the whole list, is
# used as the annotated text. Otherwise, the brief description is used as-is.
# If left blank, the following values are used ("$name" is automatically
# replaced with the name of the entity): "The $name class" "The $name widget"
# "The $name file" "is" "provides" "specifies" "contains"
# "represents" "a" "an" "the"
ABBREVIATE_BRIEF =
# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
# Doxygen will generate a detailed section even if there is only a brief
# description.
ALWAYS_DETAILED_SEC = NO
# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
# inherited members of a class in the documentation of that class as if those
# members were ordinary class members. Constructors, destructors and assignment
# operators of the base classes will not be shown.
INLINE_INHERITED_MEMB = NO
# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
# path before files name in the file list and in the header files. If set
# to NO the shortest path that makes the file name unique will be used.
FULL_PATH_NAMES = YES
# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
# can be used to strip a user-defined part of the path. Stripping is
# only done if one of the specified strings matches the left-hand part of
# the path. The tag can be used to show relative paths in the file list.
# If left blank the directory from which doxygen is run is used as the
# path to strip.
STRIP_FROM_PATH =
# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
# the path mentioned in the documentation of a class, which tells
# the reader which header file to include in order to use a class.
# If left blank only the name of the header file containing the class
# definition is used. Otherwise one should specify the include paths that
# are normally passed to the compiler using the -I flag.
STRIP_FROM_INC_PATH =
# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
# (but less readable) file names. This can be useful is your file systems
# doesn't support long names like on DOS, Mac, or CD-ROM.
SHORT_NAMES = NO
# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
# will interpret the first line (until the first dot) of a JavaDoc-style
# comment as the brief description. If set to NO, the JavaDoc
# comments will behave just like regular Qt-style comments
# (thus requiring an explicit @brief command for a brief description.)
JAVADOC_AUTOBRIEF = NO
# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
# interpret the first line (until the first dot) of a Qt-style
# comment as the brief description. If set to NO, the comments
# will behave just like regular Qt-style comments (thus requiring
# an explicit \brief command for a brief description.)
QT_AUTOBRIEF = NO
# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
# treat a multi-line C++ special comment block (i.e. a block of //! or ///
# comments) as a brief description. This used to be the default behaviour.
# The new default is to treat a multi-line C++ comment block as a detailed
# description. Set this tag to YES if you prefer the old behaviour instead.
MULTILINE_CPP_IS_BRIEF = NO
# If the DETAILS_AT_TOP tag is set to YES then Doxygen
# will output the detailed description near the top, like JavaDoc.
# If set to NO, the detailed description appears after the member
# documentation.
DETAILS_AT_TOP = NO
# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
# member inherits the documentation from any documented member that it
# re-implements.
INHERIT_DOCS = YES
# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
# a new page for each member. If set to NO, the documentation of a member will
# be part of the file/class/namespace that contains it.
SEPARATE_MEMBER_PAGES = NO
# The TAB_SIZE tag can be used to set the number of spaces in a tab.
# Doxygen uses this value to replace tabs by spaces in code fragments.
TAB_SIZE = 8
# This tag can be used to specify a number of aliases that acts
# as commands in the documentation. An alias has the form "name=value".
# For example adding "sideeffect=\par Side Effects:\n" will allow you to
# put the command \sideeffect (or @sideeffect) in the documentation, which
# will result in a user-defined paragraph with heading "Side Effects:".
# You can put \n's in the value part of an alias to insert newlines.
ALIASES =
# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
# sources only. Doxygen will then generate output that is more tailored for C.
# For instance, some of the names that are used will be different. The list
# of all members will be omitted, etc.
OPTIMIZE_OUTPUT_FOR_C = NO
# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
# sources only. Doxygen will then generate output that is more tailored for
# Java. For instance, namespaces will be presented as packages, qualified
# scopes will look different, etc.
OPTIMIZE_OUTPUT_JAVA = NO
# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
# sources only. Doxygen will then generate output that is more tailored for
# Fortran.
OPTIMIZE_FOR_FORTRAN = NO
# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
# sources. Doxygen will then generate output that is tailored for
# VHDL.
OPTIMIZE_OUTPUT_VHDL = NO
# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
# to include (a tag file for) the STL sources as input, then you should
# set this tag to YES in order to let doxygen match functions declarations and
# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
# func(std::string) {}). This also make the inheritance and collaboration
# diagrams that involve STL classes more complete and accurate.
BUILTIN_STL_SUPPORT = NO
# If you use Microsoft's C++/CLI language, you should set this option to YES to
# enable parsing support.
CPP_CLI_SUPPORT = NO
# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
# Doxygen will parse them like normal C++ but will assume all classes use public
# instead of private inheritance when no explicit protection keyword is present.
SIP_SUPPORT = NO
# For Microsoft's IDL there are propget and propput attributes to indicate getter
# and setter methods for a property. Setting this option to YES (the default)
# will make doxygen to replace the get and set methods by a property in the
# documentation. This will only work if the methods are indeed getting or
# setting a simple type. If this is not the case, or you want to show the
# methods anyway, you should set this option to NO.
IDL_PROPERTY_SUPPORT = YES
# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
# tag is set to YES, then doxygen will reuse the documentation of the first
# member in the group (if any) for the other members of the group. By default
# all members of a group must be documented explicitly.
DISTRIBUTE_GROUP_DOC = NO
# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
# the same type (for instance a group of public functions) to be put as a
# subgroup of that type (e.g. under the Public Functions section). Set it to
# NO to prevent subgrouping. Alternatively, this can be done per class using
# the \nosubgrouping command.
SUBGROUPING = YES
# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
# is documented as struct, union, or enum with the name of the typedef. So
# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
# with name TypeT. When disabled the typedef will appear as a member of a file,
# namespace, or class. And the struct will be named TypeS. This can typically
# be useful for C code in case the coding convention dictates that all compound
# types are typedef'ed and only the typedef is referenced, never the tag name.
TYPEDEF_HIDES_STRUCT = NO
#---------------------------------------------------------------------------
# Build related configuration options
#---------------------------------------------------------------------------
# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
# documentation are documented, even if no documentation was available.
# Private class members and static file members will be hidden unless
# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
EXTRACT_ALL = NO
# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
# will be included in the documentation.
EXTRACT_PRIVATE = NO
# If the EXTRACT_STATIC tag is set to YES all static members of a file
# will be included in the documentation.
EXTRACT_STATIC = NO
# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
# defined locally in source files will be included in the documentation.
# If set to NO only classes defined in header files are included.
EXTRACT_LOCAL_CLASSES = YES
# This flag is only useful for Objective-C code. When set to YES local
# methods, which are defined in the implementation section but not in
# the interface are included in the documentation.
# If set to NO (the default) only methods in the interface are included.
EXTRACT_LOCAL_METHODS = NO
# If this flag is set to YES, the members of anonymous namespaces will be
# extracted and appear in the documentation as a namespace called
# 'anonymous_namespace{file}', where file will be replaced with the base
# name of the file that contains the anonymous namespace. By default
# anonymous namespace are hidden.
EXTRACT_ANON_NSPACES = NO
# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
# undocumented members of documented classes, files or namespaces.
# If set to NO (the default) these members will be included in the
# various overviews, but no documentation section is generated.
# This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_MEMBERS = NO
# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
# undocumented classes that are normally visible in the class hierarchy.
# If set to NO (the default) these classes will be included in the various
# overviews. This option has no effect if EXTRACT_ALL is enabled.
HIDE_UNDOC_CLASSES = NO
# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
# friend (class|struct|union) declarations.
# If set to NO (the default) these declarations will be included in the
# documentation.
HIDE_FRIEND_COMPOUNDS = NO
# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
# documentation blocks found inside the body of a function.
# If set to NO (the default) these blocks will be appended to the
# function's detailed documentation block.
HIDE_IN_BODY_DOCS = NO
# The INTERNAL_DOCS tag determines if documentation
# that is typed after a \internal command is included. If the tag is set
# to NO (the default) then the documentation will be excluded.
# Set it to YES to include the internal documentation.
INTERNAL_DOCS = NO
# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
# file names in lower-case letters. If set to YES upper-case letters are also
# allowed. This is useful if you have classes or files whose names only differ
# in case and if your file system supports case sensitive file names. Windows
# and Mac users are advised to set this option to NO.
CASE_SENSE_NAMES = YES
# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
# will show members with their full class and namespace scopes in the
# documentation. If set to YES the scope will be hidden.
HIDE_SCOPE_NAMES = NO
# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
# will put a list of the files that are included by a file in the documentation
# of that file.
SHOW_INCLUDE_FILES = YES
# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
# is inserted in the documentation for inline members.
INLINE_INFO = YES
# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
# will sort the (detailed) documentation of file and class members
# alphabetically by member name. If set to NO the members will appear in
# declaration order.
SORT_MEMBER_DOCS = YES
# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
# brief documentation of file, namespace and class members alphabetically
# by member name. If set to NO (the default) the members will appear in
# declaration order.
SORT_BRIEF_DOCS = NO
# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
# hierarchy of group names into alphabetical order. If set to NO (the default)
# the group names will appear in their defined order.
SORT_GROUP_NAMES = NO
# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
# sorted by fully-qualified names, including namespaces. If set to
# NO (the default), the class list will be sorted only by class name,
# not including the namespace part.
# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
# Note: This option applies only to the class list, not to the
# alphabetical list.
SORT_BY_SCOPE_NAME = NO
# The GENERATE_TODOLIST tag can be used to enable (YES) or
# disable (NO) the todo list. This list is created by putting \todo
# commands in the documentation.
GENERATE_TODOLIST = YES
# The GENERATE_TESTLIST tag can be used to enable (YES) or
# disable (NO) the test list. This list is created by putting \test
# commands in the documentation.
GENERATE_TESTLIST = YES
# The GENERATE_BUGLIST tag can be used to enable (YES) or
# disable (NO) the bug list. This list is created by putting \bug
# commands in the documentation.
GENERATE_BUGLIST = YES
# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
# disable (NO) the deprecated list. This list is created by putting
# \deprecated commands in the documentation.
GENERATE_DEPRECATEDLIST= YES
# The ENABLED_SECTIONS tag can be used to enable conditional
# documentation sections, marked by \if sectionname ... \endif.
ENABLED_SECTIONS =
# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
# the initial value of a variable or define consists of for it to appear in
# the documentation. If the initializer consists of more lines than specified
# here it will be hidden. Use a value of 0 to hide initializers completely.
# The appearance of the initializer of individual variables and defines in the
# documentation can be controlled using \showinitializer or \hideinitializer
# command in the documentation regardless of this setting.
MAX_INITIALIZER_LINES = 30
# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
# at the bottom of the documentation of classes and structs. If set to YES the
# list will mention the files that were used to generate the documentation.
SHOW_USED_FILES = YES
# If the sources in your project are distributed over multiple directories
# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy
# in the documentation. The default is NO.
SHOW_DIRECTORIES = NO
# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
# This will remove the Files entry from the Quick Index and from the
# Folder Tree View (if specified). The default is YES.
SHOW_FILES = YES
# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
# Namespaces page. This will remove the Namespaces entry from the Quick Index
# and from the Folder Tree View (if specified). The default is YES.
SHOW_NAMESPACES = YES
# The FILE_VERSION_FILTER tag can be used to specify a program or script that
# doxygen should invoke to get the current version for each file (typically from
# the version control system). Doxygen will invoke the program by executing (via
# popen()) the command , where is the value of
# the FILE_VERSION_FILTER tag, and is the name of an input file
# provided by doxygen. Whatever the program writes to standard output
# is used as the file version. See the manual for examples.
FILE_VERSION_FILTER =
#---------------------------------------------------------------------------
# configuration options related to warning and progress messages
#---------------------------------------------------------------------------
# The QUIET tag can be used to turn on/off the messages that are generated
# by doxygen. Possible values are YES and NO. If left blank NO is used.
QUIET = NO
# The WARNINGS tag can be used to turn on/off the warning messages that are
# generated by doxygen. Possible values are YES and NO. If left blank
# NO is used.
WARNINGS = YES
# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
# automatically be disabled.
WARN_IF_UNDOCUMENTED = YES
# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
# potential errors in the documentation, such as not documenting some
# parameters in a documented function, or documenting parameters that
# don't exist or using markup commands wrongly.
WARN_IF_DOC_ERROR = YES
# This WARN_NO_PARAMDOC option can be abled to get warnings for
# functions that are documented, but have no documentation for their parameters
# or return value. If set to NO (the default) doxygen will only warn about
# wrong or incomplete parameter documentation, but not about the absence of
# documentation.
WARN_NO_PARAMDOC = NO
# The WARN_FORMAT tag determines the format of the warning messages that
# doxygen can produce. The string should contain the $file, $line, and $text
# tags, which will be replaced by the file and line number from which the
# warning originated and the warning text. Optionally the format may contain
# $version, which will be replaced by the version of the file (if it could
# be obtained via FILE_VERSION_FILTER)
WARN_FORMAT = "$file:$line: $text"
# The WARN_LOGFILE tag can be used to specify a file to which warning
# and error messages should be written. If left blank the output is written
# to stderr.
WARN_LOGFILE =
#---------------------------------------------------------------------------
# configuration options related to the input files
#---------------------------------------------------------------------------
# The INPUT tag can be used to specify the files and/or directories that contain
# documented source files. You may enter file names like "myfile.cpp" or
# directories like "/usr/src/myproject". Separate the files or directories
# with spaces.
INPUT =
# This tag can be used to specify the character encoding of the source files
# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
# also the default input encoding. Doxygen uses libiconv (or the iconv built
# into libc) for the transcoding. See https://www.gnu.org/software/libiconv for
# the list of possible encodings.
INPUT_ENCODING = UTF-8
# If the value of the INPUT tag contains directories, you can use the
# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank the following patterns are tested:
# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx
# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
FILE_PATTERNS =
# The RECURSIVE tag can be used to turn specify whether or not subdirectories
# should be searched for input files as well. Possible values are YES and NO.
# If left blank NO is used.
RECURSIVE = NO
# The EXCLUDE tag can be used to specify files and/or directories that should
# excluded from the INPUT source files. This way you can easily exclude a
# subdirectory from a directory tree whose root is specified with the INPUT tag.
EXCLUDE =
# The EXCLUDE_SYMLINKS tag can be used select whether or not files or
# directories that are symbolic links (a Unix filesystem feature) are excluded
# from the input.
EXCLUDE_SYMLINKS = NO
# If the value of the INPUT tag contains directories, you can use the
# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
# certain files from those directories. Note that the wildcards are matched
# against the file with absolute path, so to exclude all test directories
# for example use the pattern */test/*
EXCLUDE_PATTERNS =
# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
# (namespaces, classes, functions, etc.) that should be excluded from the
# output. The symbol name can be a fully qualified name, a word, or if the
# wildcard * is used, a substring. Examples: ANamespace, AClass,
# AClass::ANamespace, ANamespace::*Test
EXCLUDE_SYMBOLS =
# The EXAMPLE_PATH tag can be used to specify one or more files or
# directories that contain example code fragments that are included (see
# the \include command).
EXAMPLE_PATH =
# If the value of the EXAMPLE_PATH tag contains directories, you can use the
# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
# and *.h) to filter out the source-files in the directories. If left
# blank all files are included.
EXAMPLE_PATTERNS =
# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
# searched for input files to be used with the \include or \dontinclude
# commands irrespective of the value of the RECURSIVE tag.
# Possible values are YES and NO. If left blank NO is used.
EXAMPLE_RECURSIVE = NO
# The IMAGE_PATH tag can be used to specify one or more files or
# directories that contain image that are included in the documentation (see
# the \image command).
IMAGE_PATH =
# The INPUT_FILTER tag can be used to specify a program that doxygen should
# invoke to filter for each input file. Doxygen will invoke the filter program
# by executing (via popen()) the command , where
# is the value of the INPUT_FILTER tag, and is the name of an
# input file. Doxygen will then use the output that the filter program writes
# to standard output. If FILTER_PATTERNS is specified, this tag will be
# ignored.
INPUT_FILTER =
# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
# basis. Doxygen will compare the file name with each pattern and apply the
# filter if there is a match. The filters are a list of the form:
# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER
# is applied to all files.
FILTER_PATTERNS =
# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
# INPUT_FILTER) will be used to filter the input files when producing source
# files to browse (i.e. when SOURCE_BROWSER is set to YES).
FILTER_SOURCE_FILES = NO
#---------------------------------------------------------------------------
# configuration options related to source browsing
#---------------------------------------------------------------------------
# If the SOURCE_BROWSER tag is set to YES then a list of source files will
# be generated. Documented entities will be cross-referenced with these sources.
# Note: To get rid of all source code in the generated output, make sure also
# VERBATIM_HEADERS is set to NO.
SOURCE_BROWSER = NO
# Setting the INLINE_SOURCES tag to YES will include the body
# of functions and classes directly in the documentation.
INLINE_SOURCES = NO
# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
# doxygen to hide any special comment blocks from generated source code
# fragments. Normal C and C++ comments will always remain visible.
STRIP_CODE_COMMENTS = YES
# If the REFERENCED_BY_RELATION tag is set to YES
# then for each documented function all documented
# functions referencing it will be listed.
REFERENCED_BY_RELATION = NO
# If the REFERENCES_RELATION tag is set to YES
# then for each documented function all documented entities
# called/used by that function will be listed.
REFERENCES_RELATION = NO
# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
# link to the source code. Otherwise they will link to the documentation.
REFERENCES_LINK_SOURCE = YES
# If the USE_HTAGS tag is set to YES then the references to source code
# will point to the HTML generated by the htags(1) tool instead of doxygen
# built-in source browser. The htags tool is part of GNU's global source
# tagging system (see https://www.gnu.org/software/global/global.html). You
# will need version 4.8.6 or higher.
USE_HTAGS = NO
# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
# will generate a verbatim copy of the header file for each class for
# which an include is specified. Set to NO to disable this.
VERBATIM_HEADERS = YES
#---------------------------------------------------------------------------
# configuration options related to the alphabetical class index
#---------------------------------------------------------------------------
# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
# of all compounds will be generated. Enable this if the project
# contains a lot of classes, structs, unions or interfaces.
ALPHABETICAL_INDEX = NO
# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
# in which this list will be split (can be a number in the range [1..20])
COLS_IN_ALPHA_INDEX = 5
# In case all classes in a project start with a common prefix, all
# classes will be put under the same header in the alphabetical index.
# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
# should be ignored while generating the index headers.
IGNORE_PREFIX =
#---------------------------------------------------------------------------
# configuration options related to the HTML output
#---------------------------------------------------------------------------
# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
# generate HTML output.
GENERATE_HTML = YES
# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `html' will be used as the default path.
HTML_OUTPUT = html
# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
# doxygen will generate files with .html extension.
HTML_FILE_EXTENSION = .html
# The HTML_HEADER tag can be used to specify a personal HTML header for
# each generated HTML page. If it is left blank doxygen will generate a
# standard header.
HTML_HEADER =
# The HTML_FOOTER tag can be used to specify a personal HTML footer for
# each generated HTML page. If it is left blank doxygen will generate a
# standard footer.
HTML_FOOTER =
# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
# style sheet that is used by each HTML page. It can be used to
# fine-tune the look of the HTML output. If the tag is left blank doxygen
# will generate a default style sheet. Note that doxygen will try to copy
# the style sheet file to the HTML output directory, so don't put your own
# stylesheet in the HTML output directory as well, or it will be erased!
HTML_STYLESHEET =
# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes,
# files or namespaces will be aligned in HTML using tables. If set to
# NO a bullet list will be used.
HTML_ALIGN_MEMBERS = YES
# If the GENERATE_HTMLHELP tag is set to YES, additional index files
# will be generated that can be used as input for tools like the
# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
# of the generated HTML documentation.
GENERATE_HTMLHELP = NO
# If the GENERATE_DOCSET tag is set to YES, additional index files
# will be generated that can be used as input for Apple's Xcode 3
# integrated development environment, introduced with OSX 10.5 (Leopard).
# To create a documentation set, doxygen will generate a Makefile in the
# HTML output directory. Running make will produce the docset in that
# directory and running "make install" will install the docset in
# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
# it at startup.
GENERATE_DOCSET = NO
# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
# feed. A documentation feed provides an umbrella under which multiple
# documentation sets from a single provider (such as a company or product suite)
# can be grouped.
DOCSET_FEEDNAME = "Doxygen generated docs"
# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
# should uniquely identify the documentation set bundle. This should be a
# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
# will append .docset to the name.
DOCSET_BUNDLE_ID = org.doxygen.Project
# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
# documentation will contain sections that can be hidden and shown after the
# page has loaded. For this to work a browser that supports
# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox
# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
HTML_DYNAMIC_SECTIONS = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
# be used to specify the file name of the resulting .chm file. You
# can add a path in front of the file if the result should not be
# written to the html output directory.
CHM_FILE =
# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
# be used to specify the location (absolute path including file name) of
# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
# the HTML help compiler on the generated index.hhp.
HHC_LOCATION =
# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
# controls if a separate .chi index file is generated (YES) or that
# it should be included in the master .chm file (NO).
GENERATE_CHI = NO
# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
# is used to encode HtmlHelp index (hhk), content (hhc) and project file
# content.
CHM_INDEX_ENCODING =
# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
# controls whether a binary table of contents is generated (YES) or a
# normal table of contents (NO) in the .chm file.
BINARY_TOC = NO
# The TOC_EXPAND flag can be set to YES to add extra items for group members
# to the contents of the HTML help documentation and to the tree view.
TOC_EXPAND = NO
# The DISABLE_INDEX tag can be used to turn on/off the condensed index at
# top of each HTML page. The value NO (the default) enables the index and
# the value YES disables it.
DISABLE_INDEX = NO
# This tag can be used to set the number of enum values (range [1..20])
# that doxygen will group on one line in the generated HTML documentation.
ENUM_VALUES_PER_LINE = 4
# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
# structure should be generated to display hierarchical information.
# If the tag value is set to FRAME, a side panel will be generated
# containing a tree-like index structure (just like the one that
# is generated for HTML Help). For this to work a browser that supports
# JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+,
# Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are
# probably better off using the HTML help feature. Other possible values
# for this tag are: HIERARCHIES, which will generate the Groups, Directories,
# and Class Hiererachy pages using a tree view instead of an ordered list;
# ALL, which combines the behavior of FRAME and HIERARCHIES; and NONE, which
# disables this behavior completely. For backwards compatibility with previous
# releases of Doxygen, the values YES and NO are equivalent to FRAME and NONE
# respectively.
GENERATE_TREEVIEW = NONE
# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
# used to set the initial width (in pixels) of the frame in which the tree
# is shown.
TREEVIEW_WIDTH = 250
# Use this tag to change the font size of Latex formulas included
# as images in the HTML documentation. The default is 10. Note that
# when you change the font size after a successful doxygen run you need
# to manually remove any form_*.png images from the HTML output directory
# to force them to be regenerated.
FORMULA_FONTSIZE = 10
#---------------------------------------------------------------------------
# configuration options related to the LaTeX output
#---------------------------------------------------------------------------
# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
# generate Latex output.
GENERATE_LATEX = YES
# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `latex' will be used as the default path.
LATEX_OUTPUT = latex
# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
# invoked. If left blank `latex' will be used as the default command name.
LATEX_CMD_NAME = latex
# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
# generate index for LaTeX. If left blank `makeindex' will be used as the
# default command name.
MAKEINDEX_CMD_NAME = makeindex
# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
# LaTeX documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_LATEX = NO
# The PAPER_TYPE tag can be used to set the paper type that is used
# by the printer. Possible values are: a4, a4wide, letter, legal and
# executive. If left blank a4wide will be used.
PAPER_TYPE = a4wide
# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
# packages that should be included in the LaTeX output.
EXTRA_PACKAGES =
# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
# the generated latex document. The header should contain everything until
# the first chapter. If it is left blank doxygen will generate a
# standard header. Notice: only use this tag if you know what you are doing!
LATEX_HEADER =
# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
# is prepared for conversion to pdf (using ps2pdf). The pdf file will
# contain links (just like the HTML output) instead of page references
# This makes the output suitable for online browsing using a pdf viewer.
PDF_HYPERLINKS = YES
# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
# plain latex in the generated Makefile. Set this option to YES to get a
# higher quality PDF documentation.
USE_PDFLATEX = YES
# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
# command to the generated LaTeX files. This will instruct LaTeX to keep
# running if errors occur, instead of asking the user for help.
# This option is also used when generating formulas in HTML.
LATEX_BATCHMODE = NO
# If LATEX_HIDE_INDICES is set to YES then doxygen will not
# include the index chapters (such as File Index, Compound Index, etc.)
# in the output.
LATEX_HIDE_INDICES = NO
#---------------------------------------------------------------------------
# configuration options related to the RTF output
#---------------------------------------------------------------------------
# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
# The RTF output is optimized for Word 97 and may not look very pretty with
# other RTF readers or editors.
GENERATE_RTF = NO
# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `rtf' will be used as the default path.
RTF_OUTPUT = rtf
# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
# RTF documents. This may be useful for small projects and may help to
# save some trees in general.
COMPACT_RTF = NO
# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
# will contain hyperlink fields. The RTF file will
# contain links (just like the HTML output) instead of page references.
# This makes the output suitable for online browsing using WORD or other
# programs which support those fields.
# Note: wordpad (write) and others do not support links.
RTF_HYPERLINKS = NO
# Load stylesheet definitions from file. Syntax is similar to doxygen's
# config file, i.e. a series of assignments. You only have to provide
# replacements, missing definitions are set to their default value.
RTF_STYLESHEET_FILE =
# Set optional variables used in the generation of an rtf document.
# Syntax is similar to doxygen's config file.
RTF_EXTENSIONS_FILE =
#---------------------------------------------------------------------------
# configuration options related to the man page output
#---------------------------------------------------------------------------
# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
# generate man pages
GENERATE_MAN = NO
# The MAN_OUTPUT tag is used to specify where the man pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `man' will be used as the default path.
MAN_OUTPUT = man
# The MAN_EXTENSION tag determines the extension that is added to
# the generated man pages (default is the subroutine's section .3)
MAN_EXTENSION = .3
# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
# then it will generate one additional man file for each entity
# documented in the real man page(s). These additional files
# only source the real man page, but without them the man command
# would be unable to find the correct page. The default is NO.
MAN_LINKS = NO
#---------------------------------------------------------------------------
# configuration options related to the XML output
#---------------------------------------------------------------------------
# If the GENERATE_XML tag is set to YES Doxygen will
# generate an XML file that captures the structure of
# the code including all documentation.
GENERATE_XML = NO
# The XML_OUTPUT tag is used to specify where the XML pages will be put.
# If a relative path is entered the value of OUTPUT_DIRECTORY will be
# put in front of it. If left blank `xml' will be used as the default path.
XML_OUTPUT = xml
# The XML_SCHEMA tag can be used to specify an XML schema,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_SCHEMA =
# The XML_DTD tag can be used to specify an XML DTD,
# which can be used by a validating XML parser to check the
# syntax of the XML files.
XML_DTD =
# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
# dump the program listings (including syntax highlighting
# and cross-referencing information) to the XML output. Note that
# enabling this will significantly increase the size of the XML output.
XML_PROGRAMLISTING = YES
#---------------------------------------------------------------------------
# configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------
# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
# generate an AutoGen Definitions (see autogen.sf.net) file
# that captures the structure of the code including all
# documentation. Note that this feature is still experimental
# and incomplete at the moment.
GENERATE_AUTOGEN_DEF = NO
#---------------------------------------------------------------------------
# configuration options related to the Perl module output
#---------------------------------------------------------------------------
# If the GENERATE_PERLMOD tag is set to YES Doxygen will
# generate a Perl module file that captures the structure of
# the code including all documentation. Note that this
# feature is still experimental and incomplete at the
# moment.
GENERATE_PERLMOD = NO
# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
# the necessary Makefile rules, Perl scripts and LaTeX code to be able
# to generate PDF and DVI output from the Perl module output.
PERLMOD_LATEX = NO
# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
# nicely formatted so it can be parsed by a human reader. This is useful
# if you want to understand what is going on. On the other hand, if this
# tag is set to NO the size of the Perl module output will be much smaller
# and Perl will parse it just the same.
PERLMOD_PRETTY = YES
# The names of the make variables in the generated doxyrules.make file
# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
# This is useful so different doxyrules.make files included by the same
# Makefile don't overwrite each other's variables.
PERLMOD_MAKEVAR_PREFIX =
#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------
# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
# evaluate all C-preprocessor directives found in the sources and include
# files.
ENABLE_PREPROCESSING = YES
# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
# names in the source code. If set to NO (the default) only conditional
# compilation will be performed. Macro expansion can be done in a controlled
# way by setting EXPAND_ONLY_PREDEF to YES.
MACRO_EXPANSION = NO
# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
# then the macro expansion is limited to the macros specified with the
# PREDEFINED and EXPAND_AS_DEFINED tags.
EXPAND_ONLY_PREDEF = NO
# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
# in the INCLUDE_PATH (see below) will be search if a #include is found.
SEARCH_INCLUDES = YES
# The INCLUDE_PATH tag can be used to specify one or more directories that
# contain include files that are not input files but should be processed by
# the preprocessor.
INCLUDE_PATH =
# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
# patterns (like *.h and *.hpp) to filter out the header-files in the
# directories. If left blank, the patterns specified with FILE_PATTERNS will
# be used.
INCLUDE_FILE_PATTERNS =
# The PREDEFINED tag can be used to specify one or more macro names that
# are defined before the preprocessor is started (similar to the -D option of
# gcc). The argument of the tag is a list of macros of the form: name
# or name=definition (no spaces). If the definition and the = are
# omitted =1 is assumed. To prevent a macro definition from being
# undefined via #undef or recursively expanded use the := operator
# instead of the = operator.
PREDEFINED =
# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
# this tag can be used to specify a list of macro names that should be expanded.
# The macro definition that is found in the sources will be used.
# Use the PREDEFINED tag if you want to use a different macro definition.
EXPAND_AS_DEFINED =
# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
# doxygen's preprocessor will remove all function-like macros that are alone
# on a line, have an all uppercase name, and do not end with a semicolon. Such
# function macros are typically used for boiler-plate code, and will confuse
# the parser if not removed.
SKIP_FUNCTION_MACROS = YES
#---------------------------------------------------------------------------
# Configuration::additions related to external references
#---------------------------------------------------------------------------
# The TAGFILES option can be used to specify one or more tagfiles.
# Optionally an initial location of the external documentation
# can be added for each tagfile. The format of a tag file without
# this location is as follows:
# TAGFILES = file1 file2 ...
# Adding location for the tag files is done as follows:
# TAGFILES = file1=loc1 "file2 = loc2" ...
# where "loc1" and "loc2" can be relative or absolute paths or
# URLs. If a location is present for each tag, the installdox tool
# does not have to be run to correct the links.
# Note that each tag file must have a unique name
# (where the name does NOT include the path)
# If a tag file is not located in the directory in which doxygen
# is run, you must also specify the path to the tagfile here.
TAGFILES =
# When a file name is specified after GENERATE_TAGFILE, doxygen will create
# a tag file that is based on the input files it reads.
GENERATE_TAGFILE =
# If the ALLEXTERNALS tag is set to YES all external classes will be listed
# in the class index. If set to NO only the inherited external classes
# will be listed.
ALLEXTERNALS = NO
# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
# in the modules index. If set to NO, only the current project's groups will
# be listed.
EXTERNAL_GROUPS = YES
# The PERL_PATH should be the absolute path and name of the perl script
# interpreter (i.e. the result of `which perl').
PERL_PATH = /usr/bin/perl
#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------
# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
# or super classes. Setting the tag to NO turns the diagrams off. Note that
# this option is superseded by the HAVE_DOT option below. This is only a
# fallback. It is recommended to install and use dot, since it yields more
# powerful graphs.
CLASS_DIAGRAMS = YES
# You can define message sequence charts within doxygen comments using the \msc
# command. Doxygen will then run the mscgen tool (see
# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
# documentation. The MSCGEN_PATH tag allows you to specify the directory where
# the mscgen tool resides. If left empty the tool is assumed to be found in the
# default search path.
MSCGEN_PATH =
# If set to YES, the inheritance and collaboration graphs will hide
# inheritance and usage relations if the target is undocumented
# or is not a class.
HIDE_UNDOC_RELATIONS = YES
# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
# available from the path. This tool is part of Graphviz, a graph visualization
# toolkit from AT&T and Lucent Bell Labs. The other options in this section
# have no effect if this option is set to NO (the default)
HAVE_DOT = NO
# By default doxygen will write a font called FreeSans.ttf to the output
# directory and reference it in all dot files that doxygen generates. This
# font does not include all possible unicode characters however, so when you need
# these (or just want a differently looking font) you can specify the font name
# using DOT_FONTNAME. You need need to make sure dot is able to find the font,
# which can be done by putting it in a standard location or by setting the
# DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory
# containing the font.
DOT_FONTNAME = FreeSans
# By default doxygen will tell dot to use the output directory to look for the
# FreeSans.ttf font (which doxygen will put there itself). If you specify a
# different font using DOT_FONTNAME you can set the path where dot
# can find it using this tag.
DOT_FONTPATH =
# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect inheritance relations. Setting this tag to YES will force the
# the CLASS_DIAGRAMS tag to NO.
CLASS_GRAPH = YES
# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for each documented class showing the direct and
# indirect implementation dependencies (inheritance, containment, and
# class references variables) of the class with other documented classes.
COLLABORATION_GRAPH = YES
# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
# will generate a graph for groups, showing the direct groups dependencies
GROUP_GRAPHS = YES
# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
# collaboration diagrams in a style similar to the OMG's Unified Modeling
# Language.
UML_LOOK = NO
# If set to YES, the inheritance and collaboration graphs will show the
# relations between templates and their instances.
TEMPLATE_RELATIONS = NO
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
# tags are set to YES then doxygen will generate a graph for each documented
# file showing the direct and indirect include dependencies of the file with
# other documented files.
INCLUDE_GRAPH = YES
# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
# documented header file showing the documented files that directly or
# indirectly include this file.
INCLUDED_BY_GRAPH = YES
# If the CALL_GRAPH and HAVE_DOT options are set to YES then
# doxygen will generate a call dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable call graphs
# for selected functions only using the \callgraph command.
CALL_GRAPH = NO
# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
# doxygen will generate a caller dependency graph for every global function
# or class method. Note that enabling this option will significantly increase
# the time of a run. So in most cases it will be better to enable caller
# graphs for selected functions only using the \callergraph command.
CALLER_GRAPH = NO
# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
# will graphical hierarchy of all classes instead of a textual one.
GRAPHICAL_HIERARCHY = YES
# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES
# then doxygen will show the dependencies a directory has on other directories
# in a graphical way. The dependency relations are determined by the #include
# relations between the files in the directories.
DIRECTORY_GRAPH = YES
# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
# generated by dot. Possible values are png, jpg, or gif
# If left blank png will be used.
DOT_IMAGE_FORMAT = png
# The tag DOT_PATH can be used to specify the path where the dot tool can be
# found. If left blank, it is assumed the dot tool can be found in the path.
DOT_PATH =
# The DOTFILE_DIRS tag can be used to specify one or more directories that
# contain dot files that are included in the documentation (see the
# \dotfile command).
DOTFILE_DIRS =
# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
# nodes that will be shown in the graph. If the number of nodes in a graph
# becomes larger than this value, doxygen will truncate the graph, which is
# visualized by representing a node as a red box. Note that doxygen if the
# number of direct children of the root node in a graph is already larger than
# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
DOT_GRAPH_MAX_NODES = 50
# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
# graphs generated by dot. A depth value of 3 means that only nodes reachable
# from the root by following a path via at most 3 edges will be shown. Nodes
# that lay further from the root node will be omitted. Note that setting this
# option to 1 or 2 may greatly reduce the computation time needed for large
# code bases. Also note that the size of a graph can be further restricted by
# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
MAX_DOT_GRAPH_DEPTH = 0
# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
# background. This is enabled by default, which results in a transparent
# background. Warning: Depending on the platform used, enabling this option
# may lead to badly anti-aliased labels on the edges of a graph (i.e. they
# become hard to read).
DOT_TRANSPARENT = YES
# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
# files in one run (i.e. multiple -o and -T options on the command line). This
# makes dot run faster, but since only newer versions of dot (>1.8.10)
# support this, this feature is disabled by default.
DOT_MULTI_TARGETS = NO
# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
# generate a legend page explaining the meaning of the various boxes and
# arrows in the dot generated graphs.
GENERATE_LEGEND = YES
# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
# remove the intermediate dot files that are used to generate
# the various graphs.
DOT_CLEANUP = YES
#---------------------------------------------------------------------------
# Configuration::additions related to the search engine
#---------------------------------------------------------------------------
# The SEARCHENGINE tag specifies whether or not a search engine should be
# used. If set to NO the values of all tags below this one will be ignored.
SEARCHENGINE = NO
libidn-v1.43/contrib/doxygen/gdoc2doxygen 0000775 0000000 0000000 00000001513 14767240365 0020545 0 ustar 00root root 0000000 0000000 #!/usr/bin/perl
# Copyright (C) 2003-2025 Simon Josefsson
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
# I consider the output of this program to be unrestricted. Use it as
# you will.
while (<>) {
s, \* @(.*):, * \\param $1,g;
print $_;
}
libidn-v1.43/contrib/idn-python/ 0000775 0000000 0000000 00000000000 14767240365 0016637 5 ustar 00root root 0000000 0000000 libidn-v1.43/contrib/idn-python/Makefile 0000664 0000000 0000000 00000000326 14767240365 0020300 0 ustar 00root root 0000000 0000000 INCLUDE=/usr/include/python2.1
INSTDIR=/usr/local/lib/python2.1/site-packages
LIBS=-lidn
all: idn.so
%.so: %.c
gcc -I${INCLUDE} ${LIBS} -shared -fPIC -o $@ $<
install:
cp idn.so ${INSTDIR}
clean:
rm -f *.so
libidn-v1.43/contrib/idn-python/README 0000664 0000000 0000000 00000001217 14767240365 0017520 0 ustar 00root root 0000000 0000000 *** Note that as of version 2.3 Python has native IDN support, see
*** .
This is a Python interface over Simon Josefsson's libidn
.
To install, be sure you have libidn installed, check the Makefile, and
type "make" and "make install".
Sample use:
import idn
print idn.idn2ace("Café"); # The string must be in UTF-8
With a conversion to UTF-8 first, assuming your locale is Latin-1:
import idn
name = sys.argv[1]
ustring = unicode(name, "Latin-1")
print idn.idn2ace(ustring.encode("UTF-8"))
------------------
Stephane Bortzmeyer
libidn-v1.43/contrib/idn-python/idn.c 0000664 0000000 0000000 00000003461 14767240365 0017561 0 ustar 00root root 0000000 0000000 /*
* This is a Python interface over Simon Josefsson's libidn
* .
*
* Stephane Bortzmeyer
*
*/
#include
#include
#include
#define MESSAGE_SIZE 512
static PyObject *IDNError;
static PyObject *IDNInvLengthError;
#define onError(message) { PyErr_SetString(IDNError, message); free(message); return NULL; }
static PyObject *
idn2ace (PyObject *self, PyObject *args)
{
char *instr, *result;
int rc;
PyObject *outstr;
if (!PyArg_ParseTuple (args, "s", &instr))
onError ("Invalid argument");
rc = idna_to_ascii_8z (instr, &result);
if (rc != IDNA_SUCCESS)
{
switch (rc)
{
case IDNA_INVALID_LENGTH:
result = malloc (MESSAGE_SIZE);
sprintf (result, "%d bytes", strlen (instr));
PyErr_SetString (IDNInvLengthError, result);
free (result);
return NULL;
break;
default:
result = malloc (MESSAGE_SIZE);
sprintf (result, "IDN error: %d (see idna.h)", rc);
onError (result);
}
}
outstr = Py_BuildValue ("s", result);
return outstr;
}
static PyObject *
ace2idn (PyObject *self, PyObject *args)
{
char *instr, *result;
int rc;
PyObject *outstr;
if (!PyArg_ParseTuple (args, "s", &instr))
onError ("Invalid argument");
rc = idna_to_unicode_8z8z (instr, &result);
if (rc != IDNA_SUCCESS)
{
result = malloc (MESSAGE_SIZE);
sprintf (result, "IDN error: %d (see idna.h)", rc);
onError (result);
}
outstr = Py_BuildValue ("s", result);
return outstr;
}
static struct PyMethodDef methods[] = {
{"idn2ace", idn2ace, 1},
{"ace2idn", ace2idn, 1},
{NULL, NULL}
};
void
initidn ()
{
Py_InitModule ("idn", methods);
IDNError = PyErr_NewException ("idn.error", NULL, NULL);
IDNInvLengthError = PyErr_NewException ("idn.invalidLength", NULL, NULL);
}
libidn-v1.43/contrib/idn-python/test.py 0000664 0000000 0000000 00000000356 14767240365 0020174 0 ustar 00root root 0000000 0000000 #!/usr/bin/python
locale = "Latin-1"
import idn
import sys
if len(sys.argv) <= 1:
print "Usage: %s name" % sys.argv[0]
sys.exit(1)
name = sys.argv[1]
ustring = unicode(name, locale)
print idn.idn2ace(ustring.encode("UTF-8"))
libidn-v1.43/contrib/java/ 0000775 0000000 0000000 00000000000 14767240365 0015467 5 ustar 00root root 0000000 0000000 libidn-v1.43/contrib/java/ExampleIDNA.java 0000664 0000000 0000000 00000000173 14767240365 0020362 0 ustar 00root root 0000000 0000000 class ExampleIDNA {
public static void main(String[] args) {
System.out.println(new IDNA().toAscii(args[0]));
}
}
libidn-v1.43/contrib/java/IDNA.c 0000664 0000000 0000000 00000000555 14767240365 0016353 0 ustar 00root root 0000000 0000000 #include
#include "IDNA.h"
JNIEXPORT jstring JNICALL
Java_IDNA_toAscii (JNIEnv *env, jobject obj, jstring jstr)
{
const char *in;
const char *out;
int rc;
in = (*env)->GetStringUTFChars (env, jstr, 0);
rc = idna_to_ascii_from_utf8 (in, &out, 0, 0);
(*env)->ReleaseStringUTFChars (env, jstr, in);
return (*env)->NewStringUTF (env, out);
}
libidn-v1.43/contrib/java/IDNA.java 0000664 0000000 0000000 00000000171 14767240365 0017044 0 ustar 00root root 0000000 0000000 class IDNA {
public native String toAscii(String str);
static {
System.loadLibrary("idn-java");
}
}
libidn-v1.43/contrib/java/Makefile.am 0000664 0000000 0000000 00000001755 14767240365 0017533 0 ustar 00root root 0000000 0000000 ## Process this file with automake to produce Makefile.in
# Copyright (C) 2002-2025 Simon Josefsson.
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
lib_LTLIBRARIES = libidn-java.la
libidn_java_la_SOURCES = IDNA.c
libidn_java_la_LIBADD = -lidn
%.class: %.java
gcj -C $<
%.h: %.class
gcjh -jni $*
IDNA.c: IDNA.h
clean-local:
rm -f IDNA.h IDNA.class ExampleIDNA.class *~
libidn-v1.43/contrib/java/README 0000664 0000000 0000000 00000002455 14767240365 0016355 0 ustar 00root root 0000000 0000000 Libidn README -- Notes for the JAVA API proof of concept.
Copyright (C) 2003-2025 Simon Josefsson
See the end for copying conditions.
This directory builds Java *.class files that implement the Libidn
API. Note! It is unfinished and left as a proof of concept. A
developer with knowledge about Java is encouraged to take over it.
The current Makefile.am require GCJ. It was tested with Sun JDK 1.1
and IBM JDK 1.1.8 too, after replacing "gcj" with "javac" and "gcjh"
with "javah" in Makefile.am. Some combinations of compilation with
one package and executing using another package (e.g., compile with
GCJ, run with Sun's JRE) also seemed to work.
$ ./autogen.sh
$ ./configure
$ make
$ su
# make install
# exit
$ make ExampleIDNA
$ gij ExampleIDNA räksmörgås
xn--rksmrgs-5wao1o
$
Please let me know if you want to finish and maintain the Java API
glue. It may involve some tedious work initially, but could be useful
for Java developers.
Eventually I think the Java API Glue functions should be merged into
libidn, instead of having a separate libidn-java library.
----------------------------------------------------------------------
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright
notice and this notice are preserved.
libidn-v1.43/contrib/java/autogen.sh 0000775 0000000 0000000 00000000064 14767240365 0017470 0 ustar 00root root 0000000 0000000 #!/bin/sh -x
autoreconf --install --force --verbose
libidn-v1.43/contrib/java/configure.ac 0000664 0000000 0000000 00000000251 14767240365 0017753 0 ustar 00root root 0000000 0000000 AC_INIT(libidn-java, 0.0.0, bug-libidn@gnu.org)
AM_INIT_AUTOMAKE(foreign)
AM_CONFIG_HEADER(config.h)
AC_PROG_LIBTOOL
AC_PROG_CC
AC_CONFIG_FILES([Makefile])
AC_OUTPUT
libidn-v1.43/contrib/web/ 0000775 0000000 0000000 00000000000 14767240365 0015323 5 ustar 00root root 0000000 0000000 libidn-v1.43/contrib/web/idn.php 0000664 0000000 0000000 00000057701 14767240365 0016620 0 ustar 00root root 0000000 0000000
Try GNU Libidn
Try GNU Libidn
This page allows you to try the string preparation, punycode
encode/decode and ToASCII/ToUnicode operations of GNU Libidn. If you
encounter a problem with this page, write a (detailed!) report to
bug-libidn@gnu.org.
If you are interested in commercial support or enhancement of
Libidn, you can contact
me.
Free shrimp sandwiches are served over
here (or here
if you want the experimental flavour).
This page ignores any Accept-Charset headers sent by your
browser. Instead, the Unicode repertoire encoded as UTF-8 is
used. If you are using software that cannot handle this, you must
select another MIME charset below. BIG5, ISO-2022-JP-2,
ISO-8859-1, and KOI-8 are popular choices. I am sorry for the
inconvenience.
libidn-v1.43/csharp/ 0000775 0000000 0000000 00000000000 14767240365 0014366 5 ustar 00root root 0000000 0000000 libidn-v1.43/csharp/AssemblyInfo.cs 0000664 0000000 0000000 00000006711 14767240365 0017315 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System.Reflection;
using System.Runtime.CompilerServices;
//
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
//
[assembly: AssemblyTitle("")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
//
// Version information for an assembly consists of the following four values:
//
// Major Version
// Minor Versionu
// Build Number
// Revision
//
// You can specify all the values or you can default the Revision and Build Numbers
// by using the '*' as shown below:
[assembly: AssemblyVersion("1.0.*")]
//
// In order to sign your assembly you must specify a key to use. Refer to the
// Microsoft .NET Framework documentation for more information on assembly signing.
//
// Use the attributes below to control which key is used for signing.
//
// Notes:
// (*) If no key is specified, the assembly is not signed.
// (*) KeyName refers to a key that has been installed in the Crypto Service
// Provider (CSP) on your machine. KeyFile refers to a file which contains
// a key.
// (*) If the KeyFile and the KeyName values are both specified, the
// following processing occurs:
// (1) If the KeyName can be found in the CSP, that key is used.
// (2) If the KeyName does not exist and the KeyFile does exist, the key
// in the KeyFile is installed into the CSP and used.
// (*) In order to create a KeyFile, you can use the sn.exe (Strong Name) utility.
// When specifying the KeyFile, the location of the KeyFile should be
// relative to the project output directory which is
// %Project Directory%\obj\. For example, if your KeyFile is
// located in the project directory, you would specify the AssemblyKeyFile
// attribute as [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
// (*) Delay Signing is an advanced option - see the Microsoft .NET Framework
// documentation for more information on this.
//
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("")]
[assembly: AssemblyKeyName("")]
libidn-v1.43/csharp/IDNA.cs 0000664 0000000 0000000 00000017120 14767240365 0015431 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Text;
namespace Gnu.Inet.Encoding
{
public class IDNA
{
public const string ACE_PREFIX = "xn--";
///
/// Converts a Unicode string to ASCII using the procedure in RFC3490
/// section 4.1. Unassigned characters are not allowed and STD3 ASCII
/// rules are enforced. The input string may be a domain name
/// containing dots.
///
/// Unicode string.
/// Encoded string.
public static string ToASCII(string input)
{
StringBuilder o = new StringBuilder();
StringBuilder h = new StringBuilder();
for (int i = 0; i < input.Length; i++)
{
char c = input[i];
if (c == '.' || c == '\u3002' || c == '\uff0e' || c == '\uff61')
{
o.Append(ToASCII(h.ToString(), false, true));
o.Append('.');
h = new StringBuilder();
}
else
{
h.Append(c);
}
}
o.Append(ToASCII(h.ToString(), false, true));
return o.ToString();
}
///
/// Converts a Unicode string to ASCII using the procedure in RFC3490
/// section 4.1. Unassigned characters are not allowed and STD3 ASCII
/// rules are enforced.
///
/// Unicode string.
/// Unassigned characters, allowed or not?
/// STD3 ASCII rules, enforced or not?
/// Encoded string.
public static string ToASCII(string input, bool allowUnassigned, bool useSTD3ASCIIRules)
{
// Step 1: Check if the string contains code points outside
// the ASCII range 0..0x7c.
bool nonASCII = false;
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if (c > 0x7f)
{
nonASCII = true;
break;
}
}
// Step 2: Perform the nameprep operation.
if (nonASCII)
{
try
{
input = Stringprep.NamePrep(input, allowUnassigned);
}
catch (StringprepException e)
{
// TODO
throw new IDNAException(e);
}
}
// Step 3: - Verify the absence of non-LDH ASCII code points
// (char) 0..0x2c, 0x2e..0x2f, 0x3a..0x40, 0x5b..0x60,
// (char) 0x7b..0x7f
// - Verify the absence of leading and trailing
// hyphen-minus
if (useSTD3ASCIIRules)
{
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if ((c <= 0x2c) || (c >= 0x2e && c <= 0x2f) || (c >= 0x3a && c <= 0x40) || (c >= 0x5b && c <= 0x60) || (c >= 0x7b && c <= 0x7f))
{
throw new IDNAException(IDNAException.CONTAINS_NON_LDH);
}
}
if (input.StartsWith("-") || input.EndsWith("-"))
{
throw new IDNAException(IDNAException.CONTAINS_HYPHEN);
}
}
// Step 4: If all code points are inside 0..0x7f, skip to step 8
nonASCII = false;
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if (c > 0x7f)
{
nonASCII = true;
break;
}
}
string output = input;
if (nonASCII)
{
// Step 5: Verify that the sequence does not begin with the ACE prefix.
if (input.StartsWith(ACE_PREFIX))
{
throw new IDNAException(IDNAException.CONTAINS_ACE_PREFIX);
}
// Step 6: Punycode
try
{
output = Punycode.Encode(input);
}
catch (PunycodeException e)
{
// TODO
throw new IDNAException(e);
}
// Step 7: Prepend the ACE prefix.
output = ACE_PREFIX + output;
}
// Step 8: Check that the length is inside 1..63.
if (output.Length < 1 || output.Length > 63)
{
throw new IDNAException(IDNAException.TOO_LONG);
}
return output;
}
///
/// Converts an ASCII-encoded string to Unicode. Unassigned
/// characters are not allowed and STD3 hostnames are enforced. Input
/// may be domain name containing dots.
///
/// ASCII input string.
/// Unicode string.
public static string ToUnicode(string input)
{
input = input.ToLower();
StringBuilder o = new StringBuilder();
StringBuilder h = new StringBuilder();
for (int i = 0; i < input.Length; i++)
{
char c = input[i];
if (c == '.' || c == '\u3002' || c == '\uff0e' || c == '\uff61')
{
o.Append(ToUnicode(h.ToString(), false, true));
o.Append(c);
h = new StringBuilder();
}
else
{
h.Append(c);
}
}
o.Append(ToUnicode(h.ToString(), false, true));
return o.ToString();
}
///
/// Converts an ASCII-encoded string to Unicode.
///
/// ASCII input string.
/// Allow unassigned Unicode characters.
/// Check that the output conforms to STD3.
/// Unicode string.
public static string ToUnicode(string input, bool allowUnassigned, bool useSTD3ASCIIRules)
{
string original = input;
bool nonASCII = false;
// Step 1: If all code points are inside 0..0x7f, skip to step 3.
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if (c > 0x7f)
{
nonASCII = true;
break;
}
}
// Step 2: Perform the Nameprep operation.
if (nonASCII)
{
try
{
input = Stringprep.NamePrep(input, allowUnassigned);
}
catch (StringprepException e)
{
// ToUnicode never fails!
return original;
}
}
// Step 3: Verify the sequence starts with the ACE prefix.
if (!input.StartsWith(ACE_PREFIX))
{
// ToUnicode never fails!
return original;
}
string stored = input;
// Step 4: Remove the ACE prefix.
input = input.Substring(ACE_PREFIX.Length);
// Step 5: Decode using punycode
string output;
try
{
output = Punycode.Decode(input);
}
catch (PunycodeException e)
{
// ToUnicode never fails!
return original;
}
// Step 6: Apply toASCII
string ascii;
try
{
ascii = ToASCII(output, allowUnassigned, useSTD3ASCIIRules);
}
catch (IDNAException e)
{
// ToUnicode never fails!
return original;
}
// Step 7: Compare case-insensitively.
if (!ascii.ToUpper().Equals(stored.ToUpper()))
{
// ToUnicode never fails!
return original;
}
// Step 8: Return the result.
return output;
}
}
}
libidn-v1.43/csharp/IDNAException.cs 0000664 0000000 0000000 00000003357 14767240365 0017317 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
namespace Gnu.Inet.Encoding
{
public class IDNAException : System.Exception
{
public static string CONTAINS_NON_LDH = "Contains non-LDH characters.";
public static string CONTAINS_HYPHEN = "Leading or trailing hyphen not allowed.";
public static string CONTAINS_ACE_PREFIX = "ACE prefix (xn--) not allowed.";
public static string TOO_LONG = "String too long.";
public IDNAException(string m) : base(m)
{
}
// TODO
public IDNAException(StringprepException e) :base( "", e)
{
}
public IDNAException(PunycodeException e) : base( "", e)
{
}
}
}
libidn-v1.43/csharp/Makefile.am 0000664 0000000 0000000 00000006352 14767240365 0016430 0 ustar 00root root 0000000 0000000 ## Process this file with automake to produce Makefile.in
# Copyright (C) 2005-2025 Simon Josefsson.
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
.NOTPARALLEL:
CSHARPEXEC = $(SHELL) $(top_builddir)/csharpexec.sh
CSHARPCOMP = $(SHELL) $(top_builddir)/csharpcomp.sh
CSHARPCOMPFLAGS =
SOURCES = AssemblyInfo.cs IDNA.cs RFC3454.cs CombiningClass.cs \
IDNAException.cs Stringprep.cs Composition.cs NFKC.cs \
StringprepException.cs DecompositionKeys.cs Punycode.cs \
DecompositionMappings.cs PunycodeException.cs
SOURCES_GENERATE = generate/AssemblyInfo.cs \
generate/GenerateNFKC.cs generate/GenerateRFC3454.cs \
generate/HashSet.cs generate/Program.cs generate/Tokenizer.cs
MSVSC = libidn.csproj libidn.csproj.user libidn_PPC.csdproj \
libidn_PPC.csdproj.user libidn_PPC.sln libidn_PPC.suo \
libidn.sln libidn.suo
EXTRA_DIST = $(SOURCES) $(SOURCES_GENERATE) $(MSVSC)
CLEANFILES = Libidn.dll
ALL_LOCAL_TARGETS =
INSTALLDIRS_LOCAL_TARGETS =
INSTALL_DATA_LOCAL_TARGETS =
UNINSTALL_LOCAL_TARGETS =
if CSHARP
ALL_LOCAL_TARGETS += Libidn.dll
INSTALLDIRS_LOCAL_TARGETS += install-dll-dir
INSTALL_DATA_LOCAL_TARGETS += install-dll
UNINSTALL_LOCAL_TARGETS += uninstall-dll
Libidn.dll: $(SOURCES)
$(AM_V_GEN)$(CSHARPCOMP) $(CSHARPCOMPFLAGS) -o $@ \
`for src in $(SOURCES); do echo $(srcdir)/$$src; done`
SPEC = $(top_srcdir)/doc/specifications
GenerateTables.exe: $(SOURCES_GENERATE)
$(CSHARPCOMP) $(CSHARPCOMPFLAGS) -o $@ \
`for src in $(SOURCES_GENERATE); do echo $(srcdir)/$$src; done`
if ! test -f rfc3454.txt; then \
ln -s $(SPEC)/rfc3454.txt . \
|| cp $(SPEC)/rfc3454.txt . || true; \
fi
if ! test -f UnicodeData.txt; then \
ln -s $(SPEC)/UnicodeData-3.2.0.txt UnicodeData.txt \
|| cp $(SPEC)/UnicodeData-3.2.0.txt UnicodeData.txt || true; \
fi
if ! test -f CompositionExclusions.txt; then \
ln -s $(SPEC)/CompositionExclusions-3.2.0.txt CompositionExclusions.txt \
|| cp $(SPEC)/CompositionExclusions-3.2.0.txt CompositionExclusions.txt || true; \
fi
GEN_OUTPUTS = RFC3454.cs CombiningClass.cs DecompositionKeys.cs DecompositionMappings.cs Composition.cs
$(GEN_OUTPUTS): $(GEN_SOURCES)
$(AM_V_GEN)make GenerateTables.exe
$(AM_V_GEN)$(CSHARPEXEC) ./GenerateTables.exe
$(AM_V_GEN)if test "$(srcdir)" != "$(builddir)"; then cp -v $(GEN_OUTPUTS) $(srcdir); fi
install-dll-dir:
$(mkinstalldirs) $(DESTDIR)$(libdir)
install-dll: install-dll-dir
$(INSTALL_DATA) Libidn.dll $(DESTDIR)$(libdir)/Libidn.dll
uninstall-dll:
rm -f $(DESTDIR)$(libdir)/Libidn.dll
endif
all-local: $(ALL_LOCAL_TARGETS)
install-data-local: $(INSTALL_DATA_LOCAL_TARGETS)
installdirs-local: $(INSTALLDIRS_LOCAL_TARGETS)
uninstall-local: $(UNINSTALL_LOCAL_TARGETS)
libidn-v1.43/csharp/NFKC.cs 0000664 0000000 0000000 00000022241 14767240365 0015437 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Text;
namespace Gnu.Inet.Encoding
{
public class NFKC
{
///
/// Applies NFKC normalization to a string.
///
/// The string to normalize.
/// An NFKC normalized string.
public static string NormalizeNFKC(string sbIn)
{
StringBuilder sbOut = new StringBuilder();
for (int i = 0; i < sbIn.Length; i++)
{
char code = sbIn[i];
// In Unicode 3.0, Hangul was defined as the block from U+AC00
// to U+D7A3, however, since Unicode 3.2 the block extends until
// U+D7AF. The decomposeHangul function only decomposes until
// U+D7A3. Should this be changed?
if (code >= 0xAC00 && code <= 0xD7AF)
{
sbOut.Append(decomposeHangul(code));
}
else
{
int index = decomposeIndex(code);
if (index == - 1)
{
sbOut.Append(code);
}
else
{
sbOut.Append(DecompositionMappings.m[index]);
}
}
}
// Bring the stringbuffer into canonical order.
canonicalOrdering(sbOut);
// Do the canonical composition.
int last_cc = 0;
int last_start = 0;
for (int i = 0; i < sbOut.Length; i++)
{
int cc = combiningClass(sbOut[i]);
if (i > 0 && (last_cc == 0 || last_cc != cc))
{
// Try to combine characters
char a = sbOut[last_start];
char b = sbOut[i];
int c = compose(a, b);
if (c != - 1)
{
sbOut[last_start] = (char) c;
//sbOut.deleteCharAt(i);
sbOut.Remove(i, 1);
i--;
if (i == last_start)
{
last_cc = 0;
}
else
{
last_cc = combiningClass(sbOut[i - 1]);
}
continue;
}
}
if (cc == 0)
{
last_start = i;
}
last_cc = cc;
}
return sbOut.ToString();
}
///
/// Returns the index inside the decomposition table, implemented
/// using a binary search.
///
/// Character to look up.
/// Index if found, -1 otherwise.
internal static int decomposeIndex(char c)
{
int start = 0;
int end = DecompositionKeys.k.Length / 2;
while (true)
{
int half = (start + end) / 2;
int code = DecompositionKeys.k[half * 2];
if (c == code)
{
return DecompositionKeys.k[half * 2 + 1];
}
if (half == start)
{
// Character not found
return - 1;
}
else if (c > code)
{
start = half;
}
else
{
end = half;
}
}
}
///
/// Returns the combining class of a given character.
///
/// The character.
/// The combining class.
internal static int combiningClass(char c)
{
int h = c >> 8;
int l = c & 0xff;
int i = CombiningClass.i[h];
if (i > - 1)
{
return CombiningClass.c[i, l];
}
else
{
return 0;
}
}
///
/// Rearranges characters in a stringbuffer in order to respect the
/// canonical ordering properties.
///
/// StringBuffer to rearrange.
internal static void canonicalOrdering(StringBuilder sbIn)
{
bool isOrdered = false;
while (!isOrdered)
{
isOrdered = true;
// 24.10.2005
int lastCC = 0;
if (sbIn.Length > 0)
lastCC = combiningClass(sbIn[0]);
for (int i = 0; i < sbIn.Length - 1; i++)
{
int nextCC = combiningClass(sbIn[i + 1]);
if (nextCC != 0 && lastCC > nextCC)
{
for (int j = i + 1; j > 0; j--)
{
if (combiningClass(sbIn[j - 1]) <= nextCC)
{
break;
}
char t = sbIn[j];
sbIn[j] = sbIn[j - 1];
sbIn[j - 1] = t;
isOrdered = false;
}
nextCC = lastCC;
}
lastCC = nextCC;
}
}
}
///
/// Returns the index inside the composition table.
///
/// Character to look up.
/// Index if found, -1 otherwise.
internal static int composeIndex(char a)
{
if (a >> 8 >= Composition.composePage.Length)
{
return - 1;
}
int ap = Composition.composePage[a >> 8];
if (ap == - 1)
{
return - 1;
}
return Composition.composeData[ap, a & 0xff];
}
///
/// Tries to compose two characters canonically.
///
/// First character.
/// Second character.
/// The composed character or -1 if no composition could be found.
internal static int compose(char a, char b)
{
int h = composeHangul(a, b);
if (h != - 1)
{
return h;
}
int ai = composeIndex(a);
if (ai >= Composition.singleFirstStart && ai < Composition.singleSecondStart)
{
if (b == Composition.singleFirst[ai - Composition.singleFirstStart, 0])
{
return Composition.singleFirst[ai - Composition.singleFirstStart, 1];
}
else
{
return - 1;
}
}
int bi = composeIndex(b);
if (bi >= Composition.singleSecondStart)
{
if (a == Composition.singleSecond[bi - Composition.singleSecondStart,0])
{
return Composition.singleSecond[bi - Composition.singleSecondStart,1];
}
else
{
return - 1;
}
}
if (ai >= 0 && ai < Composition.multiSecondStart && bi >= Composition.multiSecondStart && bi < Composition.singleFirstStart)
{
char[] f = Composition.multiFirst[ai];
if (bi - Composition.multiSecondStart < f.Length)
{
char r = f[bi - Composition.multiSecondStart];
if (r == 0)
{
return - 1;
}
else
{
return r;
}
}
}
return - 1;
}
///
/// Entire hangul code copied from:
/// http://www.unicode.org/unicode/reports/tr15/
/// Several hangul specific constants
///
internal const int SBase = 0xAC00;
internal const int LBase = 0x1100;
internal const int VBase = 0x1161;
internal const int TBase = 0x11A7;
internal const int LCount = 19;
internal const int VCount = 21;
internal const int TCount = 28;
internal static readonly int NCount = VCount * TCount;
internal static readonly int SCount = LCount * NCount;
///
/// Decomposes a hangul character.
///
/// A character to decompose.
/// A string containing the hangul decomposition of the input
/// character. If no hangul decomposition can be found, a string
/// containing the character itself is returned.
internal static string decomposeHangul(char s)
{
int SIndex = s - SBase;
if (SIndex < 0 || SIndex >= SCount)
{
return s.ToString();
}
StringBuilder result = new StringBuilder();
int L = LBase + SIndex / NCount;
int V = VBase + (SIndex % NCount) / TCount;
int T = TBase + SIndex % TCount;
result.Append((char) L);
result.Append((char) V);
if (T != TBase)
result.Append((char) T);
return result.ToString();
}
///
/// Composes two hangul characters.
///
/// First character.
/// Second character.
/// Returns the composed character or -1 if the two characters cannot be composed.
internal static int composeHangul(char a, char b)
{
// 1. check to see if two current characters are L and V
int LIndex = a - LBase;
if (0 <= LIndex && LIndex < LCount)
{
int VIndex = b - VBase;
if (0 <= VIndex && VIndex < VCount)
{
// make syllable of form LV
return SBase + (LIndex * VCount + VIndex) * TCount;
}
}
// 2. check to see if two current characters are LV and T
int SIndex = a - SBase;
if (0 <= SIndex && SIndex < SCount && (SIndex % TCount) == 0)
{
int TIndex = b - TBase;
if (0 <= TIndex && TIndex <= TCount)
{
// make syllable of form LVT
return a + TIndex;
}
}
return - 1;
}
}
}
libidn-v1.43/csharp/Punycode.cs 0000664 0000000 0000000 00000014332 14767240365 0016506 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Text;
namespace Gnu.Inet.Encoding
{
public class Punycode
{
/* Punycode parameters */
internal const int TMIN = 1;
internal const int TMAX = 26;
internal const int BASE = 36;
internal const int INITIAL_N = 128;
internal const int INITIAL_BIAS = 72;
internal const int DAMP = 700;
internal const int SKEW = 38;
internal const char DELIMITER = '-';
///
/// Punycodes a unicode string.
///
/// Unicode string.
/// Punycoded string.
public static string Encode(string input)
{
int n = INITIAL_N;
int delta = 0;
int bias = INITIAL_BIAS;
StringBuilder output = new StringBuilder();
// Copy all basic code points to the output
int b = 0;
for (int i = 0; i < input.Length; i++)
{
char c = input[i];
if (IsBasic(c))
{
output.Append(c);
b++;
}
}
// Append delimiter
if (b > 0)
{
output.Append(DELIMITER);
}
int h = b;
while (h < input.Length)
{
int m = System.Int32.MaxValue;
// Find the minimum code point >= n
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if (c >= n && c < m)
{
m = c;
}
}
if (m - n > (System.Int32.MaxValue - delta) / (h + 1))
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
delta = delta + (m - n) * (h + 1);
n = m;
for (int j = 0; j < input.Length; j++)
{
int c = input[j];
if (c < n)
{
delta++;
if (0 == delta)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
}
if (c == n)
{
int q = delta;
for (int k = BASE; ; k += BASE)
{
int t;
if (k <= bias)
{
t = TMIN;
}
else if (k >= bias + TMAX)
{
t = TMAX;
}
else
{
t = k - bias;
}
if (q < t)
{
break;
}
output.Append((char) Digit2Codepoint(t + (q - t) % (BASE - t)));
q = (q - t) / (BASE - t);
}
output.Append((char) Digit2Codepoint(q));
bias = Adapt(delta, h + 1, h == b);
delta = 0;
h++;
}
}
delta++;
n++;
}
return output.ToString();
}
///
/// Decode a punycoded string.
///
/// Punycode string
/// Unicode string.
public static string Decode(string input)
{
int n = INITIAL_N;
int i = 0;
int bias = INITIAL_BIAS;
StringBuilder output = new StringBuilder();
int d = input.LastIndexOf((System.Char) DELIMITER);
if (d > 0)
{
for (int j = 0; j < d; j++)
{
char c = input[j];
if (!IsBasic(c))
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
output.Append(c);
}
d++;
}
else
{
d = 0;
}
while (d < input.Length)
{
int oldi = i;
int w = 1;
for (int k = BASE; ; k += BASE)
{
if (d == input.Length)
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
int c = input[d++];
int digit = Codepoint2Digit(c);
if (digit > (System.Int32.MaxValue - i) / w)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
i = i + digit * w;
int t;
if (k <= bias)
{
t = TMIN;
}
else if (k >= bias + TMAX)
{
t = TMAX;
}
else
{
t = k - bias;
}
if (digit < t)
{
break;
}
w = w * (BASE - t);
}
bias = Adapt(i - oldi, output.Length + 1, oldi == 0);
if (i / (output.Length + 1) > Int32.MaxValue - n)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
n = n + i / (output.Length + 1);
i = i % (output.Length + 1);
// following overload is not supported on CF
//output.Insert(i,(char) n);
output.Insert(i, new char[1] { (char) n });
i++;
}
return output.ToString();
}
public static int Adapt(int delta, int numpoints, bool first)
{
if (first)
{
delta = delta / DAMP;
}
else
{
delta = delta / 2;
}
delta = delta + (delta / numpoints);
int k = 0;
while (delta > ((BASE - TMIN) * TMAX) / 2)
{
delta = delta / (BASE - TMIN);
k = k + BASE;
}
return k + ((BASE - TMIN + 1) * delta) / (delta + SKEW);
}
public static bool IsBasic(char c)
{
return c < 0x80;
}
public static int Digit2Codepoint(int d)
{
if (d < 26)
{
// 0..25 : 'a'..'z'
return d + 'a';
}
else if (d < 36)
{
// 26..35 : '0'..'9';
return d - 26 + '0';
}
else
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
}
public static int Codepoint2Digit(int c)
{
if (c - '0' < 10)
{
// '0'..'9' : 26..35
return c - '0' + 26;
}
else if (c - 'a' < 26)
{
// 'a'..'z' : 0..25
return c - 'a';
}
else
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
}
}
}
libidn-v1.43/csharp/PunycodeException.cs 0000664 0000000 0000000 00000003037 14767240365 0020365 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
namespace Gnu.Inet.Encoding
{
public class PunycodeException : Exception
{
public static string OVERFLOW = "Overflow.";
public static string BAD_INPUT = "Bad input.";
///
/// Creates a new PunycodeException.
///
/// message
public PunycodeException(string message) : base(message)
{
}
}
}
libidn-v1.43/csharp/Stringprep.cs 0000664 0000000 0000000 00000027672 14767240365 0017070 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Text;
namespace Gnu.Inet.Encoding
{
/// This class offers static methods for preparing internationalized
/// strings. It supports the following stringprep profiles:
///
///
RFC3491 nameprep
///
RFC3920 XMPP nodeprep and resourceprep
///
/// Note that this implementation only supports 16-bit Unicode code
/// points.
///
public class Stringprep
{
/// Preps a name according to the Stringprep profile defined in
/// RFC3491. Unassigned code points are not allowed.
/// *
///
/// the name to prep.
///
/// the prepped name.
/// @throws StringprepException If the name cannot be prepped with
/// this profile.
/// @throws NullPointerException If the name is null.
///
///
public static string NamePrep(string input)
{
return NamePrep(input, false);
}
/// Preps a name according to the Stringprep profile defined in
/// RFC3491.
/// *
///
/// the name to prep.
///
/// true if the name may contain unassigned
/// code points.
///
/// the prepped name.
/// @throws StringprepException If the name cannot be prepped with
/// this profile.
/// @throws NullPointerException If the name is null.
///
///
public static string NamePrep(string input, bool allowUnassigned)
{
if (input == null)
{
throw new System.NullReferenceException();
}
StringBuilder s = new StringBuilder(input);
if (!allowUnassigned && Contains(s, RFC3454.A1))
{
throw new StringprepException(StringprepException.CONTAINS_UNASSIGNED);
}
Filter(s, RFC3454.B1);
Map(s, RFC3454.B2search, RFC3454.B2replace);
s = new StringBuilder(NFKC.NormalizeNFKC(s.ToString()));
// B.3 is only needed if NFKC is not used, right?
// map(s, RFC3454.B3search, RFC3454.B3replace);
if (Contains(s, RFC3454.C12) || Contains(s, RFC3454.C22) || Contains(s, RFC3454.C3) || Contains(s, RFC3454.C4) || Contains(s, RFC3454.C5) || Contains(s, RFC3454.C6) || Contains(s, RFC3454.C7) || Contains(s, RFC3454.C8))
{
// Table C.9 only contains code points > 0xFFFF which Java
// doesn't handle
throw new StringprepException(StringprepException.CONTAINS_PROHIBITED);
}
// Bidi handling
bool r = Contains(s, RFC3454.D1);
bool l = Contains(s, RFC3454.D2);
// RFC 3454, section 6, requirement 1: already handled above (table C.8)
// RFC 3454, section 6, requirement 2
if (r && l)
{
throw new StringprepException(StringprepException.BIDI_BOTHRAL);
}
// RFC 3454, section 6, requirement 3
if (r)
{
if (!Contains(s[0], RFC3454.D1) || !Contains(s[s.Length - 1], RFC3454.D1))
{
throw new StringprepException(StringprepException.BIDI_LTRAL);
}
}
return s.ToString();
}
/**
* Characters prohibited by RFC3920 nodeprep that aren't defined as
* part of the RFC3454 tables.
*/
private static char [] RFC3920_NODEPREP_PROHIBIT = new char [] {
'\u0022', '\u0026', '\'', '\u002F',
'\u003A', '\u003C', '\u003E', '\u0040'
};
/// Preps a node name according to the Stringprep profile defined in
/// RFC3920. Unassigned code points are not allowed.
/// *
///
/// the node name to prep.
///
/// the prepped node name.
/// @throws StringprepException If the node name cannot be prepped
/// with this profile.
/// @throws NullPointerException If the node name is null.
///
///
public static string NodePrep(string input)
{
return NodePrep(input, false);
}
///
/// Preps a node name according to the Stringprep profile defined in RFC3920.
///
/// the node name to prep.
///
/// true if the node name may contain
/// unassigned code points.
///
/// the prepped node name.
/// @throws StringprepException If the node name cannot be prepped
/// with this profile.
/// @throws NullPointerException If the node name is null.
///
///
public static string NodePrep(string input, bool allowUnassigned)
{
if (input == null)
{
throw new System.NullReferenceException();
}
StringBuilder s = new StringBuilder(input);
if (!allowUnassigned && Contains(s, RFC3454.A1))
{
throw new StringprepException(StringprepException.CONTAINS_UNASSIGNED);
}
Filter(s, RFC3454.B1);
Map(s, RFC3454.B2search, RFC3454.B2replace);
s = new StringBuilder(NFKC.NormalizeNFKC(s.ToString()));
if (Contains(s, RFC3454.C11) || Contains(s, RFC3454.C12) || Contains(s, RFC3454.C21) || Contains(s, RFC3454.C22) || Contains(s, RFC3454.C3) || Contains(s, RFC3454.C4) || Contains(s, RFC3454.C5) || Contains(s, RFC3454.C6) || Contains(s, RFC3454.C7) || Contains(s, RFC3454.C8) || Contains(s, RFC3920_NODEPREP_PROHIBIT))
{
// Table C.9 only contains code points > 0xFFFF which Java
// doesn't handle
throw new StringprepException(StringprepException.CONTAINS_PROHIBITED);
}
// Bidi handling
bool r = Contains(s, RFC3454.D1);
bool l = Contains(s, RFC3454.D2);
// RFC 3454, section 6, requirement 1: already handled above (table C.8)
// RFC 3454, section 6, requirement 2
if (r && l)
{
throw new StringprepException(StringprepException.BIDI_BOTHRAL);
}
// RFC 3454, section 6, requirement 3
if (r)
{
if (!Contains(s[0], RFC3454.D1) || !Contains(s[s.Length - 1], RFC3454.D1))
{
throw new StringprepException(StringprepException.BIDI_LTRAL);
}
}
return s.ToString();
}
///
/// Preps a resource name according to the Stringprep profile defined
/// in RFC3920. Unassigned code points are not allowed.
///
/// the resource name to prep.
///
/// the prepped node name.
/// @throws StringprepException If the resource name cannot be prepped
/// with this profile.
/// @throws NullPointerException If the resource name is null.
///
///
public static string ResourcePrep(string input)
{
return ResourcePrep(input, false);
}
///
/// Preps a resource name according to the Stringprep profile defined
/// in RFC3920.
///
/// the resource name to prep.
///
/// true if the resource name may contain
/// unassigned code points.
///
///
/// the prepped node name.
/// @throws StringprepException If the resource name cannot be prepped
/// with this profile.
/// @throws NullPointerException If the resource name is null.
///
///
public static string ResourcePrep(string input, bool allowUnassigned)
{
if (input == null)
{
throw new System.NullReferenceException();
}
StringBuilder s = new StringBuilder(input);
if (!allowUnassigned && Contains(s, RFC3454.A1))
{
throw new StringprepException(StringprepException.CONTAINS_UNASSIGNED);
}
Filter(s, RFC3454.B1);
s = new StringBuilder(NFKC.NormalizeNFKC(s.ToString()));
if (Contains(s, RFC3454.C12) || Contains(s, RFC3454.C21) || Contains(s, RFC3454.C22) || Contains(s, RFC3454.C3) || Contains(s, RFC3454.C4) || Contains(s, RFC3454.C5) || Contains(s, RFC3454.C6) || Contains(s, RFC3454.C7) || Contains(s, RFC3454.C8))
{
// Table C.9 only contains code points > 0xFFFF which Java
// doesn't handle
throw new StringprepException(StringprepException.CONTAINS_PROHIBITED);
}
// Bidi handling
bool r = Contains(s, RFC3454.D1);
bool l = Contains(s, RFC3454.D2);
// RFC 3454, section 6, requirement 1: already handled above (table C.8)
// RFC 3454, section 6, requirement 2
if (r && l)
{
throw new StringprepException(StringprepException.BIDI_BOTHRAL);
}
// RFC 3454, section 6, requirement 3
if (r)
{
if (!Contains(s[0], RFC3454.D1) || !Contains(s[s.Length - 1], RFC3454.D1))
{
throw new StringprepException(StringprepException.BIDI_LTRAL);
}
}
return s.ToString();
}
internal static bool Contains(StringBuilder s, char[] p)
{
for (int i = 0; i < p.Length; i++)
{
char c = p[i];
for (int j = 0; j < s.Length; j++)
{
if (c == s[j])
{
return true;
}
}
}
return false;
}
internal static bool Contains(StringBuilder s, char[][] p)
{
for (int i = 0; i < p.Length; i++)
{
char[] r = p[i];
if (1 == r.Length)
{
char c = r[0];
for (int j = 0; j < s.Length; j++)
{
if (c == s[j])
{
return true;
}
}
}
else if (2 == r.Length)
{
char f = r[0];
char t = r[1];
for (int j = 0; j < s.Length; j++)
{
if (f <= s[j] && t >= s[j])
{
return true;
}
}
}
}
return false;
}
internal static bool Contains(char c, char[][] p)
{
for (int i = 0; i < p.Length; i++)
{
char[] r = p[i];
if (1 == r.Length)
{
if (c == r[0])
{
return true;
}
}
else if (2 == r.Length)
{
char f = r[0];
char t = r[1];
if (f <= c && t >= c)
{
return true;
}
}
}
return false;
}
internal static void Filter(StringBuilder s, char[] f)
{
for (int i = 0; i < f.Length; i++)
{
char c = f[i];
int j = 0;
while (j < s.Length)
{
if (c == s[j])
{
//s.deleteCharAt(j);
s.Remove(j, 1);
}
else
{
j++;
}
}
}
}
internal static void Filter(StringBuilder s, char[][] f)
{
for (int i = 0; i < f.Length; i++)
{
char[] r = f[i];
if (1 == r.Length)
{
char c = r[0];
int j = 0;
while (j < s.Length)
{
if (c == s[j])
{
//s.deleteCharAt(j);
s.Remove(j, 1);
}
else
{
j++;
}
}
}
else if (2 == r.Length)
{
char from = r[0];
char to = r[1];
int j = 0;
while (j < s.Length)
{
if (from <= s[j] && to >= s[j])
{
//s.deleteCharAt(j);
s.Remove(j, 1);
}
else
{
j++;
}
}
}
}
}
internal static void Map(StringBuilder s, char[] search, string[] replace)
{
for (int i = 0; i < search.Length; i++)
{
char c = search[i];
int j = 0;
while (j < s.Length)
{
if (c == s[j])
{
//s.deleteCharAt(j);
s.Remove(j, 1);
if (null != replace[i])
{
s.Insert(j, replace[i]);
j += replace[i].Length - 1;
}
}
else
{
j++;
}
}
}
}
}
}
libidn-v1.43/csharp/StringprepException.cs 0000664 0000000 0000000 00000003250 14767240365 0020731 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
namespace Gnu.Inet.Encoding
{
public class StringprepException : Exception
{
public static string CONTAINS_UNASSIGNED = "Contains unassigned code points.";
public static string CONTAINS_PROHIBITED = "Contains prohibited code points.";
public static string BIDI_BOTHRAL = "Contains both R and AL code points.";
public static string BIDI_LTRAL = "Leading and trailing code points not both R or AL.";
public StringprepException(string message) : base(message)
{
}
}
}
libidn-v1.43/csharp/generate/ 0000775 0000000 0000000 00000000000 14767240365 0016160 5 ustar 00root root 0000000 0000000 libidn-v1.43/csharp/generate/AssemblyInfo.cs 0000664 0000000 0000000 00000004471 14767240365 0021110 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
// Setting ComVisible to false makes the types in this assembly not visible
// to COM components. If you need to access a type in this assembly from
// COM, set the ComVisible attribute to true on that type.
[assembly: ComVisible(false)]
// The following GUID is for the ID of the typelib if this project is exposed to COM
[assembly: Guid("6D72484E-39BA-4312-9B64-74FD5CB81001")]
// Version information for an assembly consists of the following four values:
//
// Major Version
// Minor Version
// Build Number
// Revision
//
[assembly: AssemblyVersion("1.0.0.0")]
[assembly: AssemblyFileVersion("1.0.0.0")]
libidn-v1.43/csharp/generate/GenerateNFKC.cs 0000664 0000000 0000000 00000063070 14767240365 0020711 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.IO;
using System.Collections;
using System.Text;
namespace gnu.inet.encoding.misc
{
public class GenerateNFKC
{
internal static string stripComment(string sIn)
{
int c = sIn.IndexOf('#');
if (c == -1)
{
return sIn;
}
else
{
return sIn.Substring(0, (c) - (0));
}
}
internal static string[] split(string sIn, char sep)
{
StringBuilder sb = new StringBuilder(sIn);
int c = 0;
for (int i = 0; i < sb.Length; i++)
{
if (sb[i] == sep)
{
c++;
}
}
string[] sOut = new string[c + 1];
c = 0;
int l = 0;
for (int i = 0; i < sb.Length; i++)
{
if (sb[i] == sep)
{
if (l >= i)
{
sOut[c] = "";
}
else
{
// TODO, check this
sOut[c] = sb.ToString(l, i-l);
}
l = i + 1;
c++;
}
}
if (l < sb.Length)
{
sOut[c] = sb.ToString(l, sb.Length - l);
}
return sOut;
}
internal static bool isCompatibilityMapping(string sIn)
{
return sIn.Length > 0 && sIn[0] == '<';
}
internal static string stripCompatibilityTag(string sIn)
{
return sIn.Substring(sIn.IndexOf('>') + 2);
}
internal static string toString(string sIn)
{
StringBuilder sOut = new StringBuilder();
string[] chars = split(sIn, ' ');
for (int i = 0; i < chars.Length; i++)
{
if (chars[i].Equals("005C"))
{
sOut.Append("\\\\");
}
else if (chars[i].Equals("0022"))
{
sOut.Append("\\\"");
}
else
{
sOut.Append("\\u");
sOut.Append(chars[i]);
}
}
return sOut.ToString();
}
internal static string decompose(string sIn, SortedList mappings)
{
StringBuilder sOut = new StringBuilder();
string[] c = split(sIn, ' ');
for (int i = 0; i < c.Length; i++)
{
if (mappings.ContainsKey(c[i]))
{
if (sOut.Length > 0)
{
sOut.Append(" ");
}
sOut.Append(decompose((string)mappings[c[i]], mappings));
}
else
{
if (sOut.Length > 0)
{
sOut.Append(" ");
}
sOut.Append(c[i]);
}
}
return sOut.ToString();
}
public static void Generate()
{
// Check if the unicode files exist
{
FileInfo f1 = new FileInfo("CompositionExclusions.txt");
FileInfo f2 = new FileInfo("UnicodeData.txt");
bool tmpBool;
if (File.Exists(f1.FullName))
tmpBool = true;
else
tmpBool = Directory.Exists(f1.FullName);
bool tmpBool2;
if (File.Exists(f2.FullName))
tmpBool2 = true;
else
tmpBool2 = Directory.Exists(f2.FullName);
if (!tmpBool || !tmpBool2)
{
Console.WriteLine("Unable to find UnicodeData.txt or CompositionExclusions.txt.");
Console.WriteLine("Please download the latest version of these file from:");
Console.WriteLine("http://www.unicode.org/Public/UNIDATA/");
System.Environment.Exit(1);
}
}
ArrayList exclusions = new ArrayList();
{
StreamReader r = new StreamReader("CompositionExclusions.txt", System.Text.Encoding.Default);
string line;
while (null != (line = r.ReadLine()))
{
line = stripComment(line);
line = line.Trim();
if (line.Length == 0)
{
// Empty line
}
else if (line.Length == 4)
{
exclusions.Add(line);
}
else
{
// Skip code points > 0xffff
}
}
r.Close();
}
// Read UnicodeData
SortedList canonical = new SortedList();
SortedList compatibility = new SortedList();
SortedList combiningClasses = new SortedList();
{
StreamReader r = new StreamReader("UnicodeData.txt", Encoding.Default);
string line;
while (null != (line = r.ReadLine()))
{
line = stripComment(line);
line = line.Trim();
if (line.Length == 0)
{
// Empty line
}
else
{
string[] f = split(line, ';');
if (f[0].Length == 4)
{
if (!f[5].Equals(""))
{
if (isCompatibilityMapping(f[5]))
{
compatibility[f[0]] = stripCompatibilityTag(f[5]);
}
else
{
compatibility[f[0]] = f[5];
if (!exclusions.Contains(f[0]))
{
canonical[f[0]] = f[5];
}
}
}
if (!f[3].Equals("0"))
{
//UPGRADE_TODO: Method 'java.lang.Integer.parseInt' was converted to 'System.Convert.ToInt32' which has a different behavior. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1073'"
combiningClasses[(int)System.Convert.ToInt32(f[0], 16)] = f[3];
}
}
else
{
// Skip code points > 0xffff
}
}
}
r.Close();
}
// Recursively apply compatibility mappings
while (true)
{
bool replaced = false;
IEnumerator i = new HashSet(compatibility.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
string v = (string)compatibility[k];
string d = decompose(v, compatibility);
if (!d.Equals(v))
{
replaced = true;
compatibility[k] = d;
}
}
if (!replaced)
{
break;
}
}
// Eliminate duplicate mappings
SortedList compatibilityKeys = new SortedList();
ArrayList compatibilityMappings = new ArrayList();
{
IEnumerator i = new HashSet(compatibility.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
string v = (string)compatibility[k];
int index = compatibilityMappings.IndexOf(v);
if (index == -1)
{
index = compatibilityMappings.Count;
compatibilityMappings.Add(v);
}
compatibilityKeys[k] = (int)index;
}
}
// Create composition tables
SortedList firstMap = new SortedList();
SortedList secondMap = new SortedList();
{
IEnumerator i = new HashSet(canonical.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
string v = (string)canonical[k];
string[] s = split(v, ' ');
if (s.Length == 2)
{
// If both characters have the same combining class, they
// won't be combined (in the sequence AB, B is blocked from
// A if both have the same combining class)
string cc1 = (string)combiningClasses[(int)System.Convert.ToInt32(s[0], 16)];
string cc2 = (string)combiningClasses[(int)System.Convert.ToInt32(s[1], 16)];
if (cc1 != null || (cc1 != null && cc1.Equals(cc2)))
{
// Ignore this composition
// TODO check this
//i.remove();
canonical.Remove(k);
continue;
}
if (firstMap.ContainsKey(s[0]))
{
int c = (int)firstMap[s[0]];
firstMap[s[0]] = (int)(c + 1);
}
else
{
firstMap[s[0]] = 1;
}
if (secondMap.ContainsKey(s[1]))
{
int c = (int)secondMap[s[1]];
secondMap[s[1]] = (int)(c + 1);
}
else
{
secondMap[s[1]] = 1;
}
}
else if (s.Length > 2)
{
Console.WriteLine("? wrong canonical mapping for " + k);
System.Environment.Exit(1);
}
}
}
SortedList singleFirstComposition = new SortedList();
SortedList singleSecondComposition = new SortedList();
SortedList complexComposition = new SortedList();
int composeLookupMax = 0;
{
IEnumerator i = new HashSet(canonical.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string) i.Current;
string v = (string) canonical[k];
string[] s = split(v, ' ');
if (s.Length == 2)
{
// TODO, check this
int first = 0;
if(firstMap.Contains(s[0]))
first = (int) firstMap[s[0]];
int second = 0;
if (secondMap.Contains(s[1]))
second = (int) secondMap[s[1]];
// TODO, check this
if (first == 1)
{
singleFirstComposition[s[0]] = new string[] { s[1], k };
composeLookupMax = System.Math.Max(composeLookupMax, System.Convert.ToInt32(s[0], 16));
}
else if (second == 1)
{
singleSecondComposition[s[1]] = new string[] { s[0], k };
composeLookupMax = System.Math.Max(composeLookupMax, System.Convert.ToInt32(s[1], 16));
}
else
{
if (complexComposition.ContainsKey(s[0]))
{
SortedList m = (SortedList)complexComposition[s[0]];
if (m.ContainsKey(s[1]))
{
Console.WriteLine("? ambiguous canonical mapping for " + s[0]);
System.Environment.Exit(1);
}
m[s[1]] = k;
}
else
{
SortedList m = new SortedList();
m[s[1]] = k;
complexComposition[s[0]] = m;
}
composeLookupMax = System.Math.Max(composeLookupMax, System.Convert.ToInt32(s[0], 16));
composeLookupMax = System.Math.Max(composeLookupMax, System.Convert.ToInt32(s[1], 16));
}
}
}
}
Console.WriteLine("Generating CombiningClass.cs file...");
// Dump combining classes
{
StreamWriter w = new StreamWriter("CombiningClass.cs", false, Encoding.Default);
w.WriteLine("// Do not edit !!!");
w.WriteLine("// this file is generated automatically");
w.WriteLine();
w.WriteLine("public class CombiningClass");
w.WriteLine("{");
w.WriteLine("\tpublic static readonly int[,] c = new int[,] {");
System.Text.StringBuilder index = new System.Text.StringBuilder();
int count = 0;
for (int i = 0; i < 256; i++)
{
bool empty = true;
StringBuilder page = new StringBuilder();
page.Append(" { /* Page " + i + " */");
for (int j = 0; j < 256; j++)
{
int c = (int)((i << 8) + j);
string cc = (string)combiningClasses[c];
if (0 == (j & 31))
{
page.Append("\r\n ");
}
if (cc == null)
{
page.Append("0, ");
}
else
{
page.Append(cc + ", ");
empty = false;
}
}
page.Append("\r\n },");
index.Append(" ");
if (!empty)
{
w.WriteLine(page.ToString());
index.Append(count++);
index.Append(",\r\n");
}
else
{
index.Append("-1,\r\n");
}
}
w.WriteLine(" };\r\n");
w.WriteLine("\tpublic static readonly int[] i = new int[] {");
w.Write(index.ToString());
w.WriteLine(" };");
w.WriteLine("}");
w.Close();
}
//Console.WriteLine(" Ok.");
Console.WriteLine("Generating DecompositionKeys.cs file...");
// Dump compatibility decomposition
{
StreamWriter w = new StreamWriter("DecompositionKeys.cs", false, Encoding.Default);
w.WriteLine("// Do not edit !!!");
w.WriteLine("// this file is generated automatically");
w.WriteLine();
w.WriteLine("public class DecompositionKeys");
w.WriteLine("{");
w.WriteLine("\tpublic static readonly int[] k = new int[] {");
IEnumerator i = new HashSet(compatibilityKeys.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
int index = ((int)compatibilityKeys[k]);
w.WriteLine(" '\\u" + k + "', " + index + ",");
}
w.WriteLine(" };");
w.WriteLine("}");
w.Close();
}
//Console.WriteLine(" Ok.");
Console.WriteLine("Generating DecompositionMappings.cs file...");
{
StreamWriter w = new StreamWriter("DecompositionMappings.cs", false, Encoding.Default);
w.WriteLine("// Do not edit !!!");
w.WriteLine("// this file is generated automatically");
w.WriteLine();
w.WriteLine("public class DecompositionMappings");
w.WriteLine("{");
w.WriteLine("\tpublic static readonly string[] m = new string[] {");
IEnumerator i = compatibilityMappings.GetEnumerator();
while (i.MoveNext())
{
string m = (string)i.Current;
w.WriteLine(" \"" + toString(m) + "\",");
}
w.WriteLine(" };");
w.WriteLine("}");
w.Close();
}
//Console.WriteLine(" Ok.");
Console.WriteLine("Generating Composition.cs file...");
// Dump canonical composition
{
StreamWriter w = new StreamWriter("Composition.cs", false, Encoding.Default);
w.WriteLine("// Do not edit !!!");
w.WriteLine("// this file is generated automatically");
w.WriteLine();
w.WriteLine("public class Composition");
w.WriteLine("{");
IEnumerator i;
int index = 0;
SortedList indices = new SortedList();
i = new HashSet(complexComposition.Keys).GetEnumerator();
while (i.MoveNext())
{
string s0 = (string)i.Current;
indices[(int)System.Convert.ToInt32(s0, 16)] = (int)index;
index++;
}
int multiSecondStart = index;
w.WriteLine("\t/* jagged Array */");
w.WriteLine("\tpublic static readonly char[][] multiFirst = new char[][] {");
//w.WriteLine(" public final static char[][] multiFirst = new char[][] {");
i = new HashSet(complexComposition.Keys).GetEnumerator();
while (i.MoveNext())
{
string s0 = (string)i.Current;
SortedList m = (SortedList)complexComposition[s0];
SortedList line = new SortedList();
int maxIndex = 1;
System.Collections.IEnumerator i2 = new HashSet(m.Keys).GetEnumerator();
while (i2.MoveNext())
{
string s1 = (string)i2.Current;
string k = (string)m[s1];
int s1i = (int)System.Convert.ToInt32(s1, 16);
if (!indices.ContainsKey(s1i))
{
indices[s1i] = (int)index;
index++;
}
line[indices[s1i]] = k;
maxIndex = System.Math.Max(maxIndex, ((int)indices[s1i]));
}
w.Write("\tnew char[] { ");
for (int j = multiSecondStart; j <= maxIndex; j++)
{
if (line.ContainsKey((int)j))
{
string s = (string)line[(int)j];
w.Write("'" + toString(s) + "', ");
}
else
{
//w.Write(" 0, ");
w.Write("'" + toString("0000") + "', ");
}
}
w.WriteLine("},");
}
w.WriteLine(" };");
int singleFirstStart = index;
w.WriteLine("\tpublic static readonly char[,] singleFirst = new char[,] {");
i = new HashSet(singleFirstComposition.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
string[] v = ((string[])singleFirstComposition[k]);
w.WriteLine(" { '" + toString(v[0]) + "', '" + toString(v[1]) + "' },");
if (indices.ContainsKey((int)System.Convert.ToInt32(k, 16)))
{
Console.WriteLine(k + " already indexed!");
}
indices[(int)System.Convert.ToInt32(k, 16)] = (int)index;
index++;
}
w.WriteLine(" };");
int singleSecondStart = index;
w.WriteLine("\tpublic static readonly char[,] singleSecond = new char[,] {");
i = new HashSet(singleSecondComposition.Keys).GetEnumerator();
while (i.MoveNext())
{
string k = (string)i.Current;
string[] v = ((string[])singleSecondComposition[k]);
w.WriteLine(" { '" + toString(v[0]) + "', '" + toString(v[1]) + "' },");
indices[(int)System.Convert.ToInt32(k, 16)] = (int)index;
index++;
}
w.WriteLine(" };");
w.WriteLine("\tpublic static readonly int multiSecondStart = " + multiSecondStart + ";");
w.WriteLine("\tpublic static readonly int singleFirstStart = " + singleFirstStart + ";");
w.WriteLine("\tpublic static readonly int singleSecondStart = " + singleSecondStart + ";");
System.Text.StringBuilder compositionPages = new System.Text.StringBuilder();
w.WriteLine("\tpublic static readonly int[] composePage = new int[] {");
int pageCount = 0;
for (int j = 0; j * 256 < composeLookupMax + 255; j++)
{
bool empty = true;
StringBuilder page = new StringBuilder();
for (int k = 0; k < 256; k++)
{
if (k % 16 == 0)
{
page.Append("\r\n ");
}
if (indices.ContainsKey((int)(j * 256 + k)))
{
page.Append(indices[(int)(j * 256 + k)]);
page.Append(", ");
empty = false;
}
else
{
page.Append("-1, ");
}
}
if (empty)
{
w.WriteLine(" -1,");
}
else
{
w.WriteLine(" " + pageCount + ",");
compositionPages.Append("\t{");
compositionPages.Append(page);
compositionPages.Append("\r\n },\r\n");
pageCount++;
}
}
w.WriteLine(" };");
//w.WriteLine("\t/* jagged Array */");
w.WriteLine("\tpublic static readonly int[,] composeData = new int[,] {");
w.Write(compositionPages);
w.WriteLine(" };");
w.WriteLine("}");
w.Close();
}
//Console.WriteLine(" Ok.");
Console.WriteLine("Finished!");
}
}
}
libidn-v1.43/csharp/generate/GenerateRFC3454.cs 0000664 0000000 0000000 00000031015 14767240365 0021114 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.IO;
using System.Text;
namespace gnu.inet.encoding.misc
{
public class GenerateRFC3454
{
internal const string FILE_RFC3454 = "rfc3454.txt";
internal const string FILE_OUTPUT = "RFC3454.cs";
public static void Generate()
{
if (!File.Exists(FILE_RFC3454))
{
Console.WriteLine("Unable to find rfc3454.txt.");
Console.WriteLine("Please download this file from:");
Console.WriteLine("http://www.ietf.org/rfc/rfc3454.txt");
return;
}
Console.WriteLine("Generating " + FILE_OUTPUT + " file...");
StreamReader r = new StreamReader(FILE_RFC3454);
StreamWriter w = new StreamWriter(FILE_OUTPUT);
w.WriteLine("// Do not edit !!!");
w.WriteLine("// this file is generated automatically");
w.WriteLine();
w.WriteLine("using System;");
w.WriteLine();
w.WriteLine("namespace Gnu.Inet.Encoding{");
w.WriteLine();
w.WriteLine("public class RFC3454");
w.WriteLine("{");
int n = 0;
string t = null;
System.Text.StringBuilder o1 = null;
System.Text.StringBuilder o2 = null;
while (true)
{
string line = r.ReadLine();
string l = line;
if (null == l)
{
break;
}
l = l.Trim();
if (l.Equals(""))
{
// Ignore empty line
}
else if (-1 != l.IndexOf("\u000c"))
{
// Ignore FF
}
else if (0 == l.IndexOf("RFC"))
{
// Ignore page header
}
else if (0 == l.IndexOf("Hoffman & Blanchet"))
{
// Ignore page footer
}
else if (-1 != l.IndexOf("----- Start Table "))
{
// Start of a table
t = l.Substring(l.IndexOf("Table") + 6, (l.LastIndexOf("-----") - 1) - (l.IndexOf("Table") + 6));
o1 = new System.Text.StringBuilder();
o2 = new System.Text.StringBuilder();
}
else if (-1 != l.IndexOf("----- End Table "))
{
// End of a table
if ("A.1".Equals(t))
{
w.WriteLine(" public static char[][] A1 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("B.1".Equals(t))
{
w.WriteLine(" public static char[] B1 = new char[] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("B.2".Equals(t))
{
w.WriteLine(" public static char[] B2search = new char[] {\r\n" + o1.ToString() + " };\r\n");
w.WriteLine(" public static string[] B2replace = new string[] {\r\n" + o2.ToString() + " };\r\n");
}
else if ("B.3".Equals(t))
{
w.WriteLine(" public static char[] B3search = new char[] {\r\n" + o1.ToString() + " };\r\n");
w.WriteLine(" public static string[] B3replace = new string[] {\r\n" + o2.ToString() + " };\r\n");
}
else if ("C.1.1".Equals(t))
{
w.WriteLine(" public static char[] C11 = new char[] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.1.2".Equals(t))
{
w.WriteLine(" public static char[] C12 = new char[] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.2.1".Equals(t))
{
w.WriteLine(" public static char[][] C21 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.2.2".Equals(t))
{
w.WriteLine(" public static char[][] C22 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.3".Equals(t))
{
w.WriteLine(" public static char[][] C3 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.4".Equals(t))
{
w.WriteLine(" public static char[][] C4 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.5".Equals(t))
{
w.WriteLine(" public static char[][] C5 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.6".Equals(t))
{
w.WriteLine(" public static char[][] C6 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.7".Equals(t))
{
w.WriteLine(" public static char[][] C7 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("C.8".Equals(t))
{
w.WriteLine(" public static char[][] C8 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("D.1".Equals(t))
{
w.WriteLine(" public static char[][] D1 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
else if ("D.2".Equals(t))
{
w.WriteLine(" public static char[][] D2 = new char[][] {\r\n" + o1.ToString() + " };\r\n");
}
t = null;
}
else if (null != t)
{
// Filter comments
if (-1 != l.LastIndexOf(";"))
{
string c = l.Substring(l.LastIndexOf(";")).Trim();
try
{
Convert.ToInt32(c, 16);
}
catch
{
l = l.Substring(0, (l.LastIndexOf(";")) - (0));
}
}
if ("A.1".Equals(t))
{
if (4 == l.Length)
{
o1.Append(" new char[] { '\\u");
o1.Append(l);
o1.Append("' },");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if (5 == l.Length)
{
//Char
o1.Append("\t/* Skip characters outside the range of .NET unicode " + line.Trim() + " */\n");
//Console.WriteLine("Skip: " + l);
// Skip characters outside the range of Java unicode
}
else if (9 == l.Length)
{
o1.Append(" new char[] { '\\u");
o1.Append(l.Substring(0, (4) - (0)));
o1.Append("', '\\u");
o1.Append(l.Substring(5, (9) - (5)));
o1.Append("' },");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if (11 == l.Length)
{
o1.Append("\t/* Skip characters outside the range of .NET unicode " + line.Trim() + " */\n");
//o1.AppendLine("// " + l);
// Console.WriteLine("Skip: " + l);
// Skip characters outside the range of Java unicode
}
else
{
Console.WriteLine("Unknown format of A.1 line: " + l);
}
}
else if ("B.1".Equals(t))
{
Tokenizer tok = new Tokenizer(l, " ;");
o1.Append(" '\\u" + tok.NextToken() + "',");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if ("B.2".Equals(t) || "B.3".Equals(t))
{
Tokenizer tok = new Tokenizer(l, "; ");
string c = tok.NextToken();
if (c.Length == 4)
{
o1.Append(" '\\u" + c + "',");
o1.Append("\t/*" + line.Trim() + "*/\r\n");
if (tok.HasMoreTokens())
{
o2.Append(" \"");
while (tok.HasMoreTokens())
{
o2.Append("\\u" + tok.NextToken());
}
o2.Append("\",");
o2.Append("\t/*" + line.Trim() + "*/\r\n");
}
else
{
o2.Append(" null,");
o2.Append("\t/*" + line.Trim() + "*/\r\n");
}
}
}
else if ("C.1.1".Equals(t))
{
o1.Append(" '\\u" + l + "',");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if ("C.1.2".Equals(t))
{
o1.Append(" '\\u" + l + "',");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if ("C.2.1".Equals(t) || "C.2.2".Equals(t) || "C.3".Equals(t) || "C.4".Equals(t) || "C.5".Equals(t) || "C.6".Equals(t) || "C.7".Equals(t) || "C.8".Equals(t) || "D.1".Equals(t) || "D.2".Equals(t))
{
if (4 == l.Length)
{
o1.Append(" new char[] { '\\u" + l + "' },");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
else if (9 == l.Length)
{
o1.Append(" new char[] { '\\u");
o1.Append(l.Substring(0, (4) - (0)));
o1.Append("', '\\u");
o1.Append(l.Substring(5, (9) - (5)));
o1.Append("' },");
o1.Append("\t/* " + line.Trim() + " */\r\n");
}
}
}
n++;
}
w.WriteLine("}");
w.WriteLine("}");
w.Close();
}
}
}
libidn-v1.43/csharp/generate/HashSet.cs 0000664 0000000 0000000 00000006100 14767240365 0020043 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Collections;
namespace gnu.inet.encoding.misc
{
///
/// HashSet class.
///
public class HashSet : ArrayList
{
public HashSet() : base()
{
}
public HashSet(System.Collections.ICollection c)
{
this.AddAll(c);
}
public HashSet(int capacity) : base(capacity)
{
}
///
/// Adds a new element to the ArrayList if it is not already present.
///
/// Element to insert to the ArrayList.
/// Returns true if the new element was inserted, false otherwise.
new public virtual bool Add(System.Object obj)
{
bool inserted;
if ((inserted = this.Contains(obj)) == false)
{
base.Add(obj);
}
return !inserted;
}
///
/// Adds all the elements of the specified collection that are not present to the list.
///
/// Collection where the new elements will be added
/// Returns true if at least one element was added, false otherwise.
public bool AddAll(System.Collections.ICollection c)
{
System.Collections.IEnumerator e = new System.Collections.ArrayList(c).GetEnumerator();
bool added = false;
while (e.MoveNext() == true)
{
if (this.Add(e.Current) == true)
added = true;
}
return added;
}
///
/// Returns a copy of the HashSet instance.
///
/// Returns a shallow copy of the current HashSet.
public override System.Object Clone()
{
return base.MemberwiseClone();
}
}
}
libidn-v1.43/csharp/generate/Program.cs 0000664 0000000 0000000 00000002764 14767240365 0020127 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
namespace gnu.inet.encoding.misc
{
class Program
{
///
/// Main entry point of this console app
///
///
static void Main(string[] args)
{
GenerateRFC3454.Generate();
GenerateNFKC.Generate();
}
}
}
libidn-v1.43/csharp/generate/Tokenizer.cs 0000664 0000000 0000000 00000017156 14767240365 0020473 0 ustar 00root root 0000000 0000000 ///
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see .
///
using System;
using System.Collections;
using System.Text;
namespace gnu.inet.encoding.misc
{
///
/// The class performs token processing in strings
///
public class Tokenizer : IEnumerator
{
/// Position over the string
private long currentPos = 0;
/// Include demiliters in the results.
private bool includeDelims = false;
/// Char representation of the String to tokenize.
private char[] chars = null;
//The tokenizer uses the default delimiter set: the space character, the tab character, the newline character, and the carriage-return character and the form-feed character
private string delimiters = " \t\n\r\f";
///
/// Initializes a new class instance with a specified string to process
///
/// String to tokenize
public Tokenizer(string source)
{
this.chars = source.ToCharArray();
}
///
/// Initializes a new class instance with a specified string to process
/// and the specified token delimiters to use
///
/// String to tokenize
/// String containing the delimiters
public Tokenizer(string source, string delimiters)
: this(source)
{
this.delimiters = delimiters;
}
///
/// Initializes a new class instance with a specified string to process, the specified token
/// delimiters to use, and whether the delimiters must be included in the results.
///
/// String to tokenize
/// String containing the delimiters
/// Determines if delimiters are included in the results.
public Tokenizer(string source, string delimiters, bool includeDelims)
: this(source, delimiters)
{
this.includeDelims = includeDelims;
}
///
/// Returns the next token from the token list
///
/// The string value of the token
public string NextToken()
{
return NextToken(this.delimiters);
}
///
/// Returns the next token from the source string, using the provided
/// token delimiters
///
/// String containing the delimiters to use
/// The string value of the token
public string NextToken(string delimiters)
{
//According to documentation, the usage of the received delimiters should be temporary (only for this call).
//However, it seems it is not true, so the following line is necessary.
this.delimiters = delimiters;
//at the end
if (this.currentPos == this.chars.Length)
throw new System.ArgumentOutOfRangeException();
//if over a delimiter and delimiters must be returned
else if ((System.Array.IndexOf(delimiters.ToCharArray(), chars[this.currentPos]) != -1)
&& this.includeDelims)
return "" + this.chars[this.currentPos++];
//need to get the token wo delimiters.
else
return nextToken(delimiters.ToCharArray());
}
//Returns the nextToken wo delimiters
private string nextToken(char[] delimiters)
{
string token = "";
long pos = this.currentPos;
//skip possible delimiters
while (System.Array.IndexOf(delimiters, this.chars[currentPos]) != -1)
//The last one is a delimiter (i.e there is no more tokens)
if (++this.currentPos == this.chars.Length)
{
this.currentPos = pos;
throw new System.ArgumentOutOfRangeException();
}
//getting the token
while (System.Array.IndexOf(delimiters, this.chars[this.currentPos]) == -1)
{
// don't use += to work around bug in compiler
// see https://bugzilla.novell.com/show_bug.cgi?id=372483
token = token + this.chars[this.currentPos];
//the last one is not a delimiter
if (++this.currentPos == this.chars.Length)
break;
}
return token;
}
///
/// Determines if there are more tokens to return from the source string
///
/// True or false, depending if there are more tokens
public bool HasMoreTokens()
{
//keeping the current pos
long pos = this.currentPos;
try
{
this.NextToken();
}
catch (System.ArgumentOutOfRangeException)
{
return false;
}
finally
{
this.currentPos = pos;
}
return true;
}
///
/// Remaining tokens count
///
public int Count
{
get
{
//keeping the current pos
long pos = this.currentPos;
int i = 0;
try
{
while (true)
{
this.NextToken();
i++;
}
}
catch (System.ArgumentOutOfRangeException)
{
this.currentPos = pos;
return i;
}
}
}
///
/// Performs the same action as NextToken.
///
public System.Object Current
{
get
{
return (Object)this.NextToken();
}
}
///
// Performs the same action as HasMoreTokens.
///
/// True or false, depending if there are more tokens
public bool MoveNext()
{
return this.HasMoreTokens();
}
///
/// Does nothing.
///
public void Reset()
{
;
}
}
}
libidn-v1.43/csharp/libidn.cmbx 0000664 0000000 0000000 00000001060 14767240365 0016477 0 ustar 00root root 0000000 0000000
libidn-v1.43/csharp/libidn.csproj 0000664 0000000 0000000 00000004546 14767240365 0017062 0 ustar 00root root 0000000 0000000 DebugAnyCPU2.0{BED43666-B1A2-486D-871C-A65A2A925764}libidnLibrary1FalseFalseOnSuccessfulBuildTrueFalseFalseFalsebin\Debug\FalseFalseFalseFalseFalsebin\Release\False
libidn-v1.43/csharp/libidn.csproj.user 0000664 0000000 0000000 00000000671 14767240365 0020032 0 ustar 00root root 0000000 0000000
libidn-v1.43/csharp/libidn.prjx 0000664 0000000 0000000 00000007120 14767240365 0016534 0 ustar 00root root 0000000 0000000
libidn-v1.43/csharp/libidn.sln 0000664 0000000 0000000 00000001476 14767240365 0016355 0 ustar 00root root 0000000 0000000
Microsoft Visual Studio Solution File, Format Version 9.00
# Visual Studio 2005
# SharpDevelop 2.1.0.2376
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "libidn", "libidn.csproj", "{BED43666-B1A2-486D-871C-A65A2A925764}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
Debug|Any CPU = Debug|Any CPU
Release|Any CPU = Release|Any CPU
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
{BED43666-B1A2-486D-871C-A65A2A925764}.Debug|Any CPU.Build.0 = Debug|Any CPU
{BED43666-B1A2-486D-871C-A65A2A925764}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{BED43666-B1A2-486D-871C-A65A2A925764}.Release|Any CPU.Build.0 = Release|Any CPU
{BED43666-B1A2-486D-871C-A65A2A925764}.Release|Any CPU.ActiveCfg = Release|Any CPU
EndGlobalSection
EndGlobal
libidn-v1.43/csharp/libidn.suo 0000664 0000000 0000000 00000241000 14767240365 0016354 0 ustar 00root root 0000000 0000000 ࡱ >
I 8 : " # $ % & ' ( ) + , - . / 0 1 2 3 4 5 6 7 9 ; = < > T V @ A B C D E F G H J K L M N O P Q R U k Y l m x X q r s Z o R o o t E n t r y P^+J%\ I P r o j I n f o E x T a s k L i s t U s e r T a s k s $ H I T o o l b o x S e r v i c e )
" # $ ' D - . / 0 2 3 4 5 6 7 8 9 ; < = > @ A B C O P Q R T U V W _ ` a b d e f k h i j m n o p r s t u w x y z } ~ #\E5ϭݗ
C
My User Controls Device Controls Crystal Reports Data
XML Schema
Dialog Editor Mobile Web Forms Web Forms
Components
Windows Forms HTML Clipboard Ring General onenten
Windows Forms HTML Zw s b C : \ D o k u m e n t e u n d E i n s t e l l u n g I V S M D P r o p e r t y B r o w s e r * I V S M D D e s i g n e r S e r v i c e * D e b u g g e r W a t c h e s D e b u g g e r B r e a k p o i n t s ( * x D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ c r t \ s r c \ D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ s r c \ m f c \ D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ s r c \ a t l \ 2 0 0 3 \ V c 7 \ c r t \ s D e b u g g e r E x c e p t i o n s & ' D e b u g g e r F i n d S o u r c e &
D e b u g g e r F i n d S y m b o l & D e b u g g e r M e m o r y W i n d o w s , T . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ ͫ4 . F ͫ4 M u l t i S t a r t u p P r o j = ; 4 { B E D 4 3 6 6 6 - B 1 A 2 - 4 8 6 D - 8 7 1 C - A 6 5 A 2 A 9 2 5 7 6 4 } . d w S t a r t u p O p t = ; S t a r t u p P r o j e c t = & { B E D 4 3 6 6 6 - B 1 A 2 - 4 8 6 D - 8 7 1 C - A 6 5 A 2 A 9 2 5 7 6 4 } ; A { B E D 4 3 6 6 6 - B 1 A 2 - 4 8 6 D - 8 7 1 C - A 6 5 A 2 A 9 2 5 7 6 4 } . R e l e a s e | E x t e r n a l F i l e s P r o j e c t C o n t e n t s :
D o c u m e n t W i n d o w P o s i t i o n s 0 7 1 D o c u m e n t W i n d o w U s e r D a t a . S o l u t i o n C o n f i g u r a t i o n , v A n y C P U . f B a t c h B l d = ; ? { B E D 4 3 6 6 6 - B 1 A 2 - 4 8 6 D - 8 7 1 C - A 6 5 A 2 A 9 2 5 7 6 4 } . D e b u g | A n y C P U . f B a t c h B l d = ;
A c t i v e C f g =
D e b u g | A n y C P U ; A 3 E 0 1 S $ A+HڪWL rJA)jKנR L кX"E:cx L [ {0Aw9
L l #O¤E L %ү##G}'bm4 S 8f Ld 9L rJA)jKנR L кX"E:cx L [ {0Aw9
L l #O¤E L %ү##G}'bm4 3 - 4 4 9 1 4 2 B 4 C A C 2 } . d w S t a r t u p O p t Q c : \ d o k u m e n t e u n d e i n s t e l l u n g e n \ g n a u c k \ e i g e n e d a t e i e n \ v i s u a l s t u d i o 2 0 0 5 \ p r o j e c t s \ a g s x m p p _ n e t 2 . 0 \ l i b i d n . n e t \ l i b i d n \ g | A n y ECSPU . f B a t c h B l d = ; 4 { 7 0 3 5 9 C 4 9 - 7 [ {0Aw9
NSܾ M% кX"E:cx I D N A T e s t
T e s t q c o n s o l e t e s$ B o o k m a r k s V 0 0 1 . 0 1 E i n s t e l l u n g e X
a u c k \ E i g e n e D a t e i e n \ V i s u a l S ECSPf6ԾmH Z*Wd r o j e c t s \ a g s x m p p _ N e t 2 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i C:\Dokumente und Einstellungen\gnauck\Eigene Dateien\Visual Studio 2005\Projects\agsxmpp_Net2.0\libidn.NET\IDNATest\frmMain.resx ]D:\Eigene Dateien\Visual Studio 2005\Projects\agsxmpp_Net2.0\libidn.NET\IDNATest\frmMain.resx u n d E i n s t e l l u n g e n \ g n a u c k \ E i g d
| {| { B E D 4 3 6 6 6 - B 1 A 2 - 4 8 6 D - 8 7 1 C - A 6 5 A 2 A 9 2 5 7 6 4 } | l i b i d n . c s p r o j | c : \ d o k u m e n t e u n d e i n s t e l l u n g e n \ g n a u c k \ e i g e n e d a t e i e n \ v i s u a l s t u d i o 2 0 0 5 \ p r o j e c t s \ a g s x m p p _ n e t 2 . 0 \ l i b i d n . n e t \ l i b i d n \ a s s e m b l y i n f o . c s | | { A 6 CT a s k L i s t S h o r t c u t s $ ) O u t l i n i n g S t a t e 9 % g V s T o o l b o x S e r v i c e " + O b j M g r C o n t e n t s V 8 " 7 4 4 A 8 - 0 E 4 A - 4 F C 6 - 8 8 6 A - 0 6 4 2 8 3 0 5 4 6 7 4 } P : C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s e} s E : \ D o c u m e n t s \ a g s x m p C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s " D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s Xu a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s 7 D : \ E i g e n e D a t e i e C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s e}s i t i o n K e y s . c s C : \ D o k u m e n t e u n V i s u a l S t u d i o 2 0 0 5 \ P r o j e C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e E x c e p t i o n . c s ܖä i b i d n . N E T \ l i b i d C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s ŕ$ d e i n s t e l l u n g e n \ g n a u c k \ e m \ g n a u c k \ D e s k t o p \ l i b i d n C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s u d n \ _ C o m p o s i t i o n . c s D : \ E i g C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s 3)% a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s P J N A T e s t \ f r m M a i n . c s
d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s t8 S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p E x c e p t i o n . c s v P r o j e c t s \ a g s x C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s ' 2 0 0 5 \ P r o j e c t s \ a g s x s cf E : \ D o c u m e n t s \ a g s x m p C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n K e y s . c s 2 o n M a p p i n g s . c s n s t e l l u n g e n \ T e m p \ v s p 3 8 5 3 . t m p . c s / D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ H i d d e n S l n F o l d e r s " O u t l i n i n g S t a t e D i r $ ? % B o o k m a r k S t a t e ( ( F A E 0 4 E C 1 - 3 0 1 F - 1 1 D 3 _ P r o j T r u s t : C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s e n t s \ a g s x m p b i d n . N E T \ l i b i d n \ I D N A . c s 6h
%ү##G}'bm4 - 7 1 E 8 - 4 A D 1 - B A 5 6 - 2 5 9C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s I v i s u a l s t u d i o 2 0 0 5 \ p r D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s ['
\8 [8\8
|{ C D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n K e y s . c s + 0 \ l i b i d n . n e t \ l i b i d D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o F A E 0 4 E C 1 - 3 0 1 F - 1 1 D 3 _ P r o j S t a t e : ! O u t l i n i n g S t a t e 7 $ O u t l i n i n g S t a t e 2 # " O u t l i n i n g S t a t e 5 ! BCSPf6ԾmH Z*Wd GBSC C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ l i b i d n . c s p r o j ^p%\ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ l i b i d n . c s p r o j . u s e r 4$\BCSC D e b u g | A n y C P U
1 7 0 1 ; 1 7 0 2 l i b r a r y o b j \ D e b u g \ l i b i d n . d l l l i b r a r y GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p E x c e p t i o n . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s GBLI~ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n K e y s . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ A s s e m b l y I n f o . c s GBLI} C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s GBLIz C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s GBLIz C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e E x c e p t i o n . c s DELIGBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l DELIGBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m DELIDELIDELIDESCECSP DELIGBLI; C : \ W I N D O W S \ M i c r o s o f t C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 5 . 2 0 \ l i b i d n - 0 . 5 . 2 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ T e s t \ F o r m 1 . c s d d P : G : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ P r o g r a m m i e r u n g \ d o t N e t 2 0 0 3 \ a g s x m p p \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s B : C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : " I D N A T e s t . f r m M a i n C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s 9 : ` G n u . I n e t . E n c o d i n g . P u n y c o d e . D e c o d e ( s t r i n g i n p u t ) B bQ?S O C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : " I D N A T e s t . f r m M a i n C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s I : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e )
C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s D : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e )
C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l l i b i d n GBLI5 C : \ P r o g r a m m e \ P r o g T o o l s \ n U n 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s IHw
D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s -B D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s D D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s :/ lS D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o O u t l i n i n g S t a t e 6 O u t l i n i n g S t a t e 4 O u t l i n i n g S t a t e 3 O u t l i n i n g S t a t e 1 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s 0
d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s _0Ț Y7 e n t s \ a g s x m p l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s l E : D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s Y$ D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s E- D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o O u t l i n i n g S t a t e 8 O u t l i n i n g S t a t e 1 0 " + E 6 F D F 8 B 0 - F 3 D 1 - 1 1 D 4 _ P r o j S t a t e : % X m l P a c k a g e O p t i o n s $ , 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ _ D e c o m p o s i t i o n K e y s . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ D e c o m p o s i t i o n K e y s . j a v a R} 6 - 2 5 9 0 E 3 3 9 D 9 A D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n K e y s . c s E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s $ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ A s s e m b l y I n f o . c s 1 D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s " D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n K e y s . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 3 8 5 3 . t m p . c s / D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s l E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s ! D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s v E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s * n E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s ( C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s # C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ N F K C . j a v a C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ D e c o m p o s i t i o n K e y s . j a v a D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ _ C o m p o s i t i o n . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e E x c e p t i o n . c s l E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s % D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s
D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p E x c e p t i o n . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 3 8 1 1 . t m p . c s . C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c " # k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s 0 C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s t E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 3 7 D F . t m p . c s + C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 3 8 0 2 . t m p . c s , C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 3 8 0 7 . t m p . c s - C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ _ D e c o m p o s i t i o n K e y s . c s
C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 1 B 2 . t m p . c s ' C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s r E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s x E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s & D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s ) l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ L o k a l e E i n s t e l l u n g e n \ T e m p \ v s p 1 B 2 . t m p . c s ' C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b O u t l i n i n g S t a t e 1 4 " O u t l i n i n g S t a t e 1 2 " , O u t l i n i n g S t a t e 1 3 " ( O u t l i n i n g S t a t e 1 1 " O u t l i n i n g S t a t e 1 5 " * ; O u t l i n i n g S t a t e 1 6 " O u t l i n i n g S t a t e 2 4 " / 6 N O u t l i n i n g S t a t e 2 3 " 1 S 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ _ C o m p o s i t i o n . c s | C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ N F K C . j a v a 2s \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n i d n \ C o m p o s i t i o n . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s r E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n O u t l i n i n g S t a t e 3 7 " O u t l i n i n g S t a t e 3 1 " < >
O u t l i n i n g S t a t e 3 6 " C @
O u t l i n i n g S t a t e 3 5 " D O u t l i n i n g S t a t e 3 4 " O u t l i n i n g S t a t e 4 0 " O u t l i n i n g S t a t e 4 1 " E O u t l i n i n g S t a t e 4 2 " ! s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N v E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s к[ i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O f r m M a i n . c s I : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O m . X M L . d l l S y s t e m . X M L DELIDELIDELIBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t l i b r a r y o b j \ D e b u g \ T e s t s . d l l l i b r a r y GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ A s s e m b l y I n f o . c s GBLI{ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l GBLI5 C : \ P r o g r a m m e \ P r o g T o o l s \ n U n i t \ b i n \ n u n i t . f r a m e w o r k . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s x E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s & D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s ) c s d \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l l i b i d n GBLI5 C : \ P r o g r a m m e \ P r o g T o o l s \ n U n i t \ b i n \ n u n i t . f r a m e w o r k . d l l n u n i t . f r a m e w o r k GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l S y s t e m . X M L DELIDELIDELIDESCBCSPmJDB GBSC C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C o n s o l e T e s t . c s p r o j (N C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 5 . 2 0 \ l i b i d n - 0 . 5 . 2 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ T e s t \ F o r m 1 . c s d C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 5 . 2 0 \ l i b i d n - 0 . 5 . 2 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ T e s t \ F o r m 1 . c s d d P : G : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ P r o g r a m m i e r u n g \ d o t N e t 2 0 0 3 \ a g s x m p p \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s B : C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : " I D N A T e s t . f r m M a i n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C o n s o l e T e s t . c s p r o j . u s e r BCSC R e l e a s e | A n y C P U
2 8 5 2 1 2 6 7 2 T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t e x e o b j \ R e l e a s e \ C o n s o l e T e s t . e x e e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ A s s e . N E T \ l i b i d n \ N F K C . c s ! D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s v E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s * n E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s ( C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A E x c e p t i o n . c s z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s # C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d O u t l i n i n g S t a t e 3 0 " * O u t l i n i n g S t a t e 3 2 " O u t l i n i n g S t a t e 3 3 " = ? O u t l i n i n g S t a t e 3 8 " B F 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s x E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ S t r i n g p r e p . c s & 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 m b l y I n f o . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ l E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ I D N A . c s % t E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ D e c o m p o s i t i o n M a p p i n g s . c s -B s x m p p _ N e t 2 . 0 \ l i z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m p o s i t i o n . c s ŕ$ 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ C o m b i n i n g C l a s s . c s I b i d n . N E T \ l i b i d n \ N F K C . c n E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s FE% \ l i b i d n . N E T \ T e s t s \ C l a s s 1 . c s v z E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b r E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ R F C 3 4 5 4 . c s M i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 l E : \ D o c u m e n t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ N F K C . c s }-r i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s 1)E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l S y s t e m . X M L DELIDELIDELIBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t e x e o b j \ D e b u g \ C o n s o l e T e s t . e x e e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ C l a s s 1 . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ C o n s o l e T e s t \ A s s e m b l y I n f o . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l GBLI i n g \ N F K C . j a v a C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ D e s k t o p \ l i b i d n - 0 . 6 . 0 \ j a v a \ g n u \ i n e t \ e n c o d i n g \ D e c o m p o s i t i o n K e y s . j a v a D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ _ C o m p o s i t i o n . c s D : \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X M L . d l l S y s t e m . X M L DELIDELIDELIDESCBCSPI5pqJV%9٩ GBSC C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ I D N A T e s t . c s p r o j 4 C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ I D N A T e s t . c s p r o j . u s e r /ŲBCSC R e l e a s e | A n y C P U
2 8 5 2 1 2 6 7 2 T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t w i n e x e o b j \ R e l e a s e \ I D N A T e s t . e x e w i n e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ A s s e m b l y I n f o . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . n d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l S y s t e m . D r a w i n g GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l S y s t e m . W i n d o w s . F o r m s GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l DELIDELIDELIBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t w i n e x e o b j \ D e b u g \ I D N A T e s t . e x e w i n e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ A s s e m b l y I n f o . c s GBLI C : \ D o k u O u t l i n i n g S t a t e 2 6 " & O u t l i n i n g S t a t e 2 7 " 3 : O u t l i n i n g S t a t e 2 8 " O u t l i n i n g S t a t e 2 9 " 9 A " m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l S y s t e m . D r a w i n g GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l S y s t e m . W i n d o w s . F o r m s GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l DELIDELIDELIDESCECSPf t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ P u n y c o d e . c s 9 : ` G n u . I n e t . E n c o d i n g . P u n y c o d e . D e c o d e ( s t r i n g i n p u t ) B bQ?S O C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : O u t l i n i n g S t a t e 2 1 " : O u t l i n i n g S t a t e 2 2 " 0 ^ " O u t l i n i n g S t a t e 1 7 " - 4 c O u t l i n i n g S t a t e 2 0 " 2 . l O u t l i n i n g S t a t e 1 8 " 5 q
O u t l i n i n g S t a t e 1 9 " v O u t l i n i n g S t a t e 2 5 " 8 | 1 6 4 B 1 0 B 9 - B 2 0 0 - 1 1 D 0 _ P r o j S t a t e : & * " I D N A T e s t . f r m M a i n C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s I : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) bQ?S O C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s : x I D N A T e s t . f r m M a i n . b t n T e s t 2 _ C l i c k ( o b j e c t s e n d e r , E v e n t A r g s e ) C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e 6 7 2 T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t w i n e x e o b j \ R e l e a s e \ I D N A T e s t . e x e w i n e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ A s s e m b l y I n f o . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ R e l e a s e \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l S y s t e m . D r a w i n g GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l S y s t e m . W i n d o w s . F o r m s GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l DELIDELIDELIBCSC D e b u g | A n y C P U
2 8 5 2 1 2 6 7 2 f u l l D E B U G ; T R A C E
1 7 0 1 ; 1 7 0 2 p r o m p t w i n e x e o b j \ D e b u g \ I D N A T e s t . e x e w i n e x e A p p . i c o GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ A s s e m b l y I n f o . c s GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ I D N A T e s t \ f r m M a i n . c s DELIGBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l GBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l ' { C 1 B 5 E 6 5 9 - 7 8 0 A - 4 E E 1 - A 1 A 7 - 7 7 7 1 3 1 F A C 4 3 C } GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l DELIGBLI C : \ D o k u m e n t e u n d E i n s t e l l u n g e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ b i n \ D e b u g \ l i b i d n . d l l l i b i d n GBLI> C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D a t a . d l l S y s t e m . D a t a GBLI9 C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . d l l S y s t e m GBLIA C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . D r a w i n g . d l l S y s t e m . D r a w i n g GBLIG C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . W i n d o w s . F o r m s . d l l S y s t e m . W i n d o w s . F o r m s GBLI= C : \ W I N D O W S \ M i c r o s o f t . N E T \ F r a m e w o r k \ v 2 . 0 . 5 0 7 2 7 \ S y s t e m . X m l . d l l S y s t e m . X m l DELIDELIDELIDESCECSP O u t l i n i n g S t a t e 4 8 " G O u t l i n i n g S t a t e 4 9 " ? libidn-v1.43/csharp/libidn_PPC.csdproj 0000664 0000000 0000000 00000015363 14767240365 0017727 0 ustar 00root root 0000000 0000000
libidn-v1.43/csharp/libidn_PPC.csdproj.user 0000664 0000000 0000000 00000004176 14767240365 0020704 0 ustar 00root root 0000000 0000000
libidn-v1.43/csharp/libidn_PPC.sln 0000664 0000000 0000000 00000002070 14767240365 0017046 0 ustar 00root root 0000000 0000000 Microsoft Visual Studio Solution File, Format Version 8.00
Project("{20D4826A-C6FA-45DB-90F4-C717570B9F32}") = "libidn_PPC", "libidn_PPC.csdproj", "{D890E339-5F13-482B-BD29-C0ED806F41BD}"
ProjectSection(ProjectDependencies) = postProject
EndProjectSection
EndProject
Global
GlobalSection(SolutionConfiguration) = preSolution
Debug = Debug
Release = Release
EndGlobalSection
GlobalSection(ProjectConfiguration) = postSolution
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Debug.ActiveCfg = Debug|Pocket PC
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Debug.Build.0 = Debug|Pocket PC
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Debug.Deploy.0 = Debug|Pocket PC
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Release.ActiveCfg = Release|Pocket PC
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Release.Build.0 = Release|Pocket PC
{D890E339-5F13-482B-BD29-C0ED806F41BD}.Release.Deploy.0 = Release|Pocket PC
EndGlobalSection
GlobalSection(ExtensibilityGlobals) = postSolution
EndGlobalSection
GlobalSection(ExtensibilityAddIns) = postSolution
EndGlobalSection
EndGlobal
libidn-v1.43/csharp/libidn_PPC.suo 0000664 0000000 0000000 00000020000 14767240365 0017051 0 ustar 00root root 0000000 0000000 ࡱ >
R o o t E n t r y `j$\ @ P r o j I n f o E x T a s k L i s t U s e r T a s k s $ I T o o l b o x S e r v i c e
! " $ % & ( ) * Zu#C&ˈwg C
Eigene Benutzersteuerelemente Developer Express: DXCore Device Controls Data
XML Schema
Dialog Editor Mobile Web Forms Web Forms
Components
Windows Forms HTML Clipboard Ring General C : \ D o k u m e n t e u n d E i n s t e l l u n g I V S M D P r o p e r t y B r o w s e r *
I V S M D D e s i g n e r S e r v i c e * D e b u g g e r W a t c h e s D e b u g g e r B r e a k p o i n t s ( e n \ g n a u c k \ E i g e n e D a t e i e n \ V i s u a l S t u d i o 2 0 0 5 \ P r o j e c t s \ a g s x m p p _ N e t 2 . 0 \ l i b i d n . N E T \ l i b i d n \ x D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ c r t \ s r c \ D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ D e b u g g e r E x c e p t i o n s & D e b u g g e r F i n d S o u r c e &
D e b u g g e r F i n d S y m b o l & D e b u g g e r M e m o r y W i n d o w s , T s r c \ m f c \ D : \ P r o g r a m m e \ M i c r o s o f t V i s u a l S t u d i o . N E T 2 0 0 3 \ V c 7 \ a t l m f c \ s r c \ a t l \ d l
& K L $NE { D 8 9E x t e r n a l F i l e s P r o j e c t C o n t e n t s : D o c u m e n t W i n d o w P o s i t i o n s 0 D o c u m e n t W i n d o w U s e r D a t a . S o l u t i o n C o n f i g u r a t i o n , n 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B M u l t i S t a r t u p P r o j = ; 4 { D 8 9 0 E 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B D } . d w S t a r t u p O p t = ; S t a r t u p P r o j e c t = & { D 8 9 0 E 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B D } ; C { D 8 9 0 E 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B D } . R e l e a s e | P o c k e t P C . f B a t c h B l d = ; A { D 8 9 0 E 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B D } . D e b u g | P o c k e t P C . f B a t c h B l d = ;
A c t i v e C f g = D e b u g ; a r t u p P r o j NSܾ M% [ {0Aw9
кX"E:cx
T e s t c o n s o l e t e s t l i b i d n _ P P C T e s t s l i b i d n rJA)jKנR c k e t P C . f B a t c h B l d = ; A { D 8 9 0 Q c : \ d o k u m e n t e u n d e i n s t e l l u n g e n \ g n a u c k \ e i g e n e d a t e i e n \ v i s u a l s t u d i o 2 0 0 5 \ p r o j e c t s \ a g s x m p p _ n e t 2 . 0 \ l i b i d n . n e t \ l i b i d n \ e s t X
o l e t e s t l i b i d n _ P P C T e s t" E n d O f S t r e a m Q g : \ d o k u m e n t e u n d e i n s t e l l u n g e n \ g n a u c k \ e i g e n e d a t e i e n \ p r o g r a m m i e r u n g \ d o t n e t 2 0 0 3 \ a g s x m p p \ l i b i d O b j M g r C o n t e n t s # C l a s s V i e w C o n t e n t s $ P r o j E x p l o r e r S t a t e $ ' U n l o a d e d P r o j e c t s " n . n e t \ l i b i d n \ X
K L $NE { D 8 9 0 E 3 3 9 - 5 F 1 3 - 4 8 2 B - B D 2 9 - C 0 E D 8 0 6 F 4 1 B D } | l i b i d n _ P P C . c s d p r o j | g : \ d o k u m e n t e u n d e i n s t e l l u n g e n \ g n a u c k \ e i g e n e d a t e i e n \ p r o g r a m m i e r u n g \ d o t n e t 2 0 0 3 \ a g s x m p p \ l i b i d n . n e t \ l i b i d n \ p u n y c o d e . c s | | { A 6 C 7T a s k L i s t S h o r t c u t s $ + S o u r c e C o d e C o n t r o l $ , , libidn-v1.43/doc/ 0000775 0000000 0000000 00000000000 14767240365 0013653 5 ustar 00root root 0000000 0000000 libidn-v1.43/doc/Makefile.am 0000664 0000000 0000000 00000022020 14767240365 0015703 0 ustar 00root root 0000000 0000000 ## Process this file with automake to produce Makefile.in
# Copyright (C) 2002-2025 Simon Josefsson.
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
SUBDIRS = specifications tld java cyclo
if ENABLE_GTK_DOC
SUBDIRS += . reference
endif
EXTRA_DIST = gdoc components.dot
info_TEXINFOS = libidn.texi
libidn_TEXINFOS = fdl-1.3.texi idn-help.texi
libidn_TEXINFOS += example.txt example2.txt example3.txt
libidn_TEXINFOS += example4.txt example5.txt
libidn_TEXINFOS += $(gdoc_TEXINFOS) libidn-components.png
imagesdir = $(infodir)
images_DATA = libidn-components.png
DISTCLEANFILES = \
libidn-components.eps libidn-components.png libidn-components.pdf
libidn-components.eps: $(srcdir)/components.dot
$(AM_V_GEN)$(DOT) -Nfontsize=9 -Teps < $< > $@.tmp
$(AM_V_at)! grep %%CreationDate $@.tmp
$(AM_V_at)mv $@.tmp $@
libidn-components.pdf: $(srcdir)/components.dot
$(AM_V_GEN)$(DOT) -Nfontsize=9 -Tpdf < $< > $@.tmp
# A simple sed on CreationDate is no longer possible due to compression.
# 'exiftool -CreateDate' is alternative to 'gs', but adds ~4kb to file.
# Ghostscript add <1kb. Why can't 'dot' avoid setting CreationDate?
$(AM_V_at)printf '[ /ModDate ()\n /CreationDate ()\n /DOCINFO pdfmark\n' > pdfmarks
$(AM_V_at)$(GS) -q -dBATCH -dNOPAUSE -sDEVICE=pdfwrite -sOutputFile=$@.tmp2 $@.tmp pdfmarks
$(AM_V_at)rm -f $@.tmp pdfmarks
$(AM_V_at)mv $@.tmp2 $@
libidn-components.png: $(srcdir)/components.dot
$(AM_V_GEN)$(DOT) -Nfontsize=9 -Tpng < $< > $@.tmp
$(AM_V_at)mv $@.tmp $@
pdf-recursive: libidn-components.pdf
dvi-recursive: libidn-components.eps
ps-recursive: libidn-components.eps
info-recursive: $(top_srcdir)/.version libidn-components.png
idn-help.texi: idn.1
$(AM_V_GEN)env LANG=C $(top_builddir)/src/idn$(EXEEXT) --help | $(SED) -n -e '/^ *-/p' > $@.tmp
$(AM_V_at)mv $@.tmp $@
example.txt: $(top_srcdir)/examples/example.c
$(AM_V_GEN)$(SED) -e '/* example/,/^$$/d' $(top_srcdir)/examples/example.c > $@.tmp
$(AM_V_at)mv $@.tmp $@
example2.txt: $(top_srcdir)/examples/example2.c
$(AM_V_GEN)$(SED) -e '/* example/,/^$$/d' $(top_srcdir)/examples/example2.c > $@.tmp
$(AM_V_at)mv $@.tmp $@
example3.txt: $(top_srcdir)/examples/example3.c
$(AM_V_GEN)$(SED) -e '/* example/,/^$$/d' $(top_srcdir)/examples/example3.c > $@.tmp
$(AM_V_at)mv $@.tmp $@
example4.txt: $(top_srcdir)/examples/example4.c
$(AM_V_GEN)$(SED) -e '/* example/,/^$$/d' $(top_srcdir)/examples/example4.c > $@.tmp
$(AM_V_at)mv $@.tmp $@
example5.txt: $(top_srcdir)/examples/example5.c
$(AM_V_GEN)$(SED) -e '/* example/,/^$$/d' $(top_srcdir)/examples/example5.c > $@.tmp
$(AM_V_at)mv $@.tmp $@
BUILT_SOURCES = example.txt example2.txt example3.txt example4.txt example5.txt
# Man pages.
dist_man_MANS = idn.1 $(gdoc_MANS)
MAINTAINERCLEANFILES = $(dist_man_MANS)
idn.1: $(top_srcdir)/src/idn.c $(top_srcdir)/src/idn.ggo $(top_srcdir)/.version
$(MAKE) -C ../lib
$(MAKE) -C ../src
$(AM_V_GEN)env SOURCE_DATE_EPOCH=0 $(HELP2MAN) \
--name="Internationalized Domain Names command line tool" \
--output=$@ $(top_builddir)/src/idn$(EXEEXT)
# GDOC
gdoc_TEXINFOS =
gdoc_TEXINFOS += texi/idna_to_ascii_4i.texi
gdoc_TEXINFOS += texi/idna_to_unicode_44i.texi
gdoc_TEXINFOS += texi/idna_to_ascii_4z.texi
gdoc_TEXINFOS += texi/idna_to_ascii_8z.texi
gdoc_TEXINFOS += texi/idna_to_ascii_lz.texi
gdoc_TEXINFOS += texi/idna_to_unicode_4z4z.texi
gdoc_TEXINFOS += texi/idna_to_unicode_8z4z.texi
gdoc_TEXINFOS += texi/idna_to_unicode_8z8z.texi
gdoc_TEXINFOS += texi/idna_to_unicode_8zlz.texi
gdoc_TEXINFOS += texi/idna_to_unicode_lzlz.texi
gdoc_TEXINFOS += texi/stringprep_utf8_to_unichar.texi
gdoc_TEXINFOS += texi/stringprep_unichar_to_utf8.texi
gdoc_TEXINFOS += texi/stringprep_utf8_to_ucs4.texi
gdoc_TEXINFOS += texi/stringprep_ucs4_to_utf8.texi
gdoc_TEXINFOS += texi/stringprep_utf8_nfkc_normalize.texi
gdoc_TEXINFOS += texi/stringprep_ucs4_nfkc_normalize.texi
gdoc_TEXINFOS += texi/pr29_4.texi
gdoc_TEXINFOS += texi/pr29_4z.texi
gdoc_TEXINFOS += texi/pr29_8z.texi
gdoc_TEXINFOS += texi/punycode_encode.texi
gdoc_TEXINFOS += texi/punycode_decode.texi
gdoc_TEXINFOS += texi/stringprep_4i.texi
gdoc_TEXINFOS += texi/stringprep_4zi.texi
gdoc_TEXINFOS += texi/stringprep.texi
gdoc_TEXINFOS += texi/stringprep_profile.texi
gdoc_TEXINFOS += texi/tld_get_table.texi
gdoc_TEXINFOS += texi/tld_default_table.texi
gdoc_TEXINFOS += texi/tld_get_4.texi
gdoc_TEXINFOS += texi/tld_get_4z.texi
gdoc_TEXINFOS += texi/tld_get_z.texi
gdoc_TEXINFOS += texi/tld_check_4t.texi
gdoc_TEXINFOS += texi/tld_check_4tz.texi
gdoc_TEXINFOS += texi/tld_check_4.texi
gdoc_TEXINFOS += texi/tld_check_4z.texi
gdoc_TEXINFOS += texi/tld_check_8z.texi
gdoc_TEXINFOS += texi/tld_check_lz.texi
gdoc_TEXINFOS += texi/stringprep_locale_charset.texi
gdoc_TEXINFOS += texi/stringprep_convert.texi
gdoc_TEXINFOS += texi/stringprep_locale_to_utf8.texi
gdoc_TEXINFOS += texi/stringprep_utf8_to_locale.texi
gdoc_TEXINFOS += texi/stringprep_check_version.texi
gdoc_TEXINFOS += texi/idn_free.texi
gdoc_TEXINFOS += texi/idna_strerror.texi
gdoc_TEXINFOS += texi/pr29_strerror.texi
gdoc_TEXINFOS += texi/punycode_strerror.texi
gdoc_TEXINFOS += texi/stringprep_strerror.texi
gdoc_TEXINFOS += texi/tld_strerror.texi
gdoc_MANS =
gdoc_MANS += man/idna_to_ascii_4i.3
gdoc_MANS += man/idna_to_unicode_44i.3
gdoc_MANS += man/idna_to_ascii_4z.3
gdoc_MANS += man/idna_to_ascii_8z.3
gdoc_MANS += man/idna_to_ascii_lz.3
gdoc_MANS += man/idna_to_unicode_4z4z.3
gdoc_MANS += man/idna_to_unicode_8z4z.3
gdoc_MANS += man/idna_to_unicode_8z8z.3
gdoc_MANS += man/idna_to_unicode_8zlz.3
gdoc_MANS += man/idna_to_unicode_lzlz.3
gdoc_MANS += man/stringprep_utf8_to_unichar.3
gdoc_MANS += man/stringprep_unichar_to_utf8.3
gdoc_MANS += man/stringprep_utf8_to_ucs4.3
gdoc_MANS += man/stringprep_ucs4_to_utf8.3
gdoc_MANS += man/stringprep_utf8_nfkc_normalize.3
gdoc_MANS += man/stringprep_ucs4_nfkc_normalize.3
gdoc_MANS += man/pr29_4.3
gdoc_MANS += man/pr29_4z.3
gdoc_MANS += man/pr29_8z.3
gdoc_MANS += man/punycode_encode.3
gdoc_MANS += man/punycode_decode.3
gdoc_MANS += man/stringprep_4i.3
gdoc_MANS += man/stringprep_4zi.3
gdoc_MANS += man/stringprep.3
gdoc_MANS += man/stringprep_profile.3
gdoc_MANS += man/tld_get_table.3
gdoc_MANS += man/tld_default_table.3
gdoc_MANS += man/tld_get_4.3
gdoc_MANS += man/tld_get_4z.3
gdoc_MANS += man/tld_get_z.3
gdoc_MANS += man/tld_check_4t.3
gdoc_MANS += man/tld_check_4tz.3
gdoc_MANS += man/tld_check_4.3
gdoc_MANS += man/tld_check_4z.3
gdoc_MANS += man/tld_check_8z.3
gdoc_MANS += man/tld_check_lz.3
gdoc_MANS += man/stringprep_locale_charset.3
gdoc_MANS += man/stringprep_convert.3
gdoc_MANS += man/stringprep_locale_to_utf8.3
gdoc_MANS += man/stringprep_utf8_to_locale.3
gdoc_MANS += man/stringprep_check_version.3
gdoc_MANS += man/idn_free.3
gdoc_MANS += man/idna_strerror.3
gdoc_MANS += man/pr29_strerror.3
gdoc_MANS += man/punycode_strerror.3
gdoc_MANS += man/stringprep_strerror.3
gdoc_MANS += man/tld_strerror.3
BUILT_SOURCES += $(gdoc_MANS) $(gdoc_TEXINFOS)
GDOC_SRC = $(top_srcdir)/lib/idna.c $(top_srcdir)/lib/nfkc.c \
$(top_srcdir)/lib/pr29.c $(top_srcdir)/lib/punycode.c \
$(top_srcdir)/lib/stringprep.c $(top_srcdir)/lib/tld.c \
$(top_srcdir)/lib/toutf8.c $(top_srcdir)/lib/version.c \
$(top_srcdir)/lib/idn-free.c \
$(top_srcdir)/lib/strerror-idna.c $(top_srcdir)/lib/strerror-pr29.c \
$(top_srcdir)/lib/strerror-punycode.c \
$(top_srcdir)/lib/strerror-stringprep.c \
$(top_srcdir)/lib/strerror-tld.c
.PHONY: compare-makefile
compare-makefile:
$(AM_V_GEN) \
MANS=""; \
TEXINFOS=""; \
FUNCS=`$(srcdir)/gdoc -listfunc $(GDOC_SRC)`; \
for i in $$FUNCS; do \
MANS="$$MANS\ngdoc_MANS += man/$$i.3"; \
TEXINFOS="$$TEXINFOS\ngdoc_TEXINFOS += texi/$$i.texi"; \
done && \
grep -v -e '^gdoc_MANS += ' -e '^gdoc_TEXINFOS += ' $(srcdir)/Makefile.am | \
perl -p -e "s,^gdoc_MANS =,gdoc_MANS =$$MANS,;" | \
perl -p -e "s,^gdoc_TEXINFOS =,gdoc_TEXINFOS =$$TEXINFOS,;" \
> tmp-$@ && \
diff -u $(srcdir)/Makefile.am tmp-$@ && \
rm -f tmp-$@
EXTRA_DIST += stamp-gdoc
$(gdoc_MANS) $(gdoc_TEXINFOS): stamp-gdoc
clean-local:
-rm -f stamp-gdoc
stamp-gdoc: $(top_srcdir)/.version $(GDOC_SRC)
$(AM_V_at)$(MKDIR_P) man texi
$(AM_V_GEN)for i in `$(srcdir)/gdoc -listfunc $(GDOC_SRC)`; do \
$(srcdir)/gdoc -man \
-bugsto $(PACKAGE_BUGREPORT) \
-module $(PACKAGE) \
-pkg-name "$(PACKAGE_NAME)" \
-sourceversion $(VERSION) \
-includefuncprefix \
-seeinfo $(PACKAGE) \
-verbatimcopying \
-copyright "2002-2025 Simon Josefsson" \
-function $$i \
$(GDOC_SRC) > man/$$i.3 && \
$(srcdir)/gdoc -texinfo -function $$i \
$(GDOC_SRC) > texi/$$i.texi; \
done
$(AM_V_at)touch $@
libidn-v1.43/doc/components.dot 0000664 0000000 0000000 00000002001 14767240365 0016541 0 ustar 00root root 0000000 0000000 # Copyright (C) 2025 Simon Josefsson.
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
digraph G {
Application [shape=box];
Application -> Libidn [style=dotted];
Libidn -> Nameprep;
Libidn -> IDNA;
Libidn -> StringPrep;
Libidn -> { XMPP, SASL, iSCSI }
Libidn -> TLD;
IDNA -> Punycode;
IDNA -> Nameprep;
iSCSI -> StringPrep
Nameprep -> StringPrep
XMPP -> StringPrep
SASL -> StringPrep
}
libidn-v1.43/doc/cyclo/ 0000775 0000000 0000000 00000000000 14767240365 0014764 5 ustar 00root root 0000000 0000000 libidn-v1.43/doc/cyclo/Makefile.am 0000664 0000000 0000000 00000002354 14767240365 0017024 0 ustar 00root root 0000000 0000000 ## Process this file with automake to produce Makefile.in
# Copyright (C) 2008-2025 Simon Josefsson.
#
# This file is part of GNU Libidn.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
vcurl = "https://git.savannah.gnu.org/gitweb/?p=$(PACKAGE).git;a=blob;f=lib/%FILENAME%;hb=HEAD"
cyclo-$(PACKAGE).html: $(top_srcdir)/.version
$(AM_V_GEN)(cd ${top_srcdir}/lib && \
$(PMCCABE) *.[ch] \
| sort -nr \
| LANG=C $(AWK) -f ${abs_top_srcdir}/build-aux/pmccabe2html \
-v lang=html -v name="$(PACKAGE_STRING)" \
-v vcurl=$(vcurl) \
-v url="https://www.gnu.org/software/$(PACKAGE)/" \
-v css=${abs_top_srcdir}/build-aux/pmccabe.css) \
> tmp && \
mv tmp $@
libidn-v1.43/doc/fdl-1.3.texi 0000664 0000000 0000000 00000055612 14767240365 0015623 0 ustar 00root root 0000000 0000000 @c The GNU Free Documentation License.
@center Version 1.3, 3 November 2008
@c This file is intended to be included within another document,
@c hence no sectioning command or @node.
@display
Copyright @copyright{} 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
@uref{https://fsf.org/}
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
@end display
@enumerate 0
@item
PREAMBLE
The purpose of this License is to make a manual, textbook, or other
functional and useful document @dfn{free} in the sense of freedom: to
assure everyone the effective freedom to copy and redistribute it,
with or without modifying it, either commercially or noncommercially.
Secondarily, this License preserves for the author and publisher a way
to get credit for their work, while not being considered responsible
for modifications made by others.
This License is a kind of ``copyleft'', which means that derivative
works of the document must themselves be free in the same sense. It
complements the GNU General Public License, which is a copyleft
license designed for free software.
We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does. But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book. We recommend this License
principally for works whose purpose is instruction or reference.
@item
APPLICABILITY AND DEFINITIONS
This License applies to any manual or other work, in any medium, that
contains a notice placed by the copyright holder saying it can be
distributed under the terms of this License. Such a notice grants a
world-wide, royalty-free license, unlimited in duration, to use that
work under the conditions stated herein. The ``Document'', below,
refers to any such manual or work. Any member of the public is a
licensee, and is addressed as ``you''. You accept the license if you
copy, modify or distribute the work in a way requiring permission
under copyright law.
A ``Modified Version'' of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.
A ``Secondary Section'' is a named appendix or a front-matter section
of the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document's overall
subject (or to related matters) and contains nothing that could fall
directly within that overall subject. (Thus, if the Document is in
part a textbook of mathematics, a Secondary Section may not explain
any mathematics.) The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.
The ``Invariant Sections'' are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License. If a
section does not fit the above definition of Secondary then it is not
allowed to be designated as Invariant. The Document may contain zero
Invariant Sections. If the Document does not identify any Invariant
Sections then there are none.
The ``Cover Texts'' are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License. A Front-Cover Text may
be at most 5 words, and a Back-Cover Text may be at most 25 words.
A ``Transparent'' copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, that is suitable for revising the document
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters. A copy made in an otherwise Transparent file
format whose markup, or absence of markup, has been arranged to thwart
or discourage subsequent modification by readers is not Transparent.
An image format is not Transparent if used for any substantial amount
of text. A copy that is not ``Transparent'' is called ``Opaque''.
Examples of suitable formats for Transparent copies include plain
ASCII without markup, Texinfo input format, La@TeX{} input
format, SGML or XML using a publicly available
DTD, and standard-conforming simple HTML,
PostScript or PDF designed for human modification. Examples
of transparent image formats include PNG, XCF and
JPG@. Opaque formats include proprietary formats that can be
read and edited only by proprietary word processors, SGML or
XML for which the DTD and/or processing tools are
not generally available, and the machine-generated HTML,
PostScript or PDF produced by some word processors for
output purposes only.
The ``Title Page'' means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page. For works in
formats which do not have any title page as such, ``Title Page'' means
the text near the most prominent appearance of the work's title,
preceding the beginning of the body of the text.
The ``publisher'' means any person or entity that distributes copies
of the Document to the public.
A section ``Entitled XYZ'' means a named subunit of the Document whose
title either is precisely XYZ or contains XYZ in parentheses following
text that translates XYZ in another language. (Here XYZ stands for a
specific section name mentioned below, such as ``Acknowledgements'',
``Dedications'', ``Endorsements'', or ``History''.) To ``Preserve the Title''
of such a section when you modify the Document means that it remains a
section ``Entitled XYZ'' according to this definition.
The Document may include Warranty Disclaimers next to the notice which
states that this License applies to the Document. These Warranty
Disclaimers are considered to be included by reference in this
License, but only as regards disclaiming warranties: any other
implication that these Warranty Disclaimers may have is void and has
no effect on the meaning of this License.
@item
VERBATIM COPYING
You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute. However, you may accept
compensation in exchange for copies. If you distribute a large enough
number of copies you must also follow the conditions in section 3.
You may also lend copies, under the same conditions stated above, and
you may publicly display copies.
@item
COPYING IN QUANTITY
If you publish printed copies (or copies in media that commonly have
printed covers) of the Document, numbering more than 100, and the
Document's license notice requires Cover Texts, you must enclose the
copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify
you as the publisher of these copies. The front cover must present
the full title with all words of the title equally prominent and
visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.
If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.
If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a computer-network location from which the general network-using
public has access to download using public-standard network protocols
a complete Transparent copy of the Document, free of added material.
If you use the latter option, you must take reasonably prudent steps,
when you begin distribution of Opaque copies in quantity, to ensure
that this Transparent copy will remain thus accessible at the stated
location until at least one year after the last time you distribute an
Opaque copy (directly or through your agents or retailers) of that
edition to the public.
It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.
@item
MODIFICATIONS
You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it. In addition, you must do these things in the Modified Version:
@enumerate A
@item
Use in the Title Page (and on the covers, if any) a title distinct
from that of the Document, and from those of previous versions
(which should, if there were any, be listed in the History section
of the Document). You may use the same title as a previous version
if the original publisher of that version gives permission.
@item
List on the Title Page, as authors, one or more persons or entities
responsible for authorship of the modifications in the Modified
Version, together with at least five of the principal authors of the
Document (all of its principal authors, if it has fewer than five),
unless they release you from this requirement.
@item
State on the Title page the name of the publisher of the
Modified Version, as the publisher.
@item
Preserve all the copyright notices of the Document.
@item
Add an appropriate copyright notice for your modifications
adjacent to the other copyright notices.
@item
Include, immediately after the copyright notices, a license notice
giving the public permission to use the Modified Version under the
terms of this License, in the form shown in the Addendum below.
@item
Preserve in that license notice the full lists of Invariant Sections
and required Cover Texts given in the Document's license notice.
@item
Include an unaltered copy of this License.
@item
Preserve the section Entitled ``History'', Preserve its Title, and add
to it an item stating at least the title, year, new authors, and
publisher of the Modified Version as given on the Title Page. If
there is no section Entitled ``History'' in the Document, create one
stating the title, year, authors, and publisher of the Document as
given on its Title Page, then add an item describing the Modified
Version as stated in the previous sentence.
@item
Preserve the network location, if any, given in the Document for
public access to a Transparent copy of the Document, and likewise
the network locations given in the Document for previous versions
it was based on. These may be placed in the ``History'' section.
You may omit a network location for a work that was published at
least four years before the Document itself, or if the original
publisher of the version it refers to gives permission.
@item
For any section Entitled ``Acknowledgements'' or ``Dedications'', Preserve
the Title of the section, and preserve in the section all the
substance and tone of each of the contributor acknowledgements and/or
dedications given therein.
@item
Preserve all the Invariant Sections of the Document,
unaltered in their text and in their titles. Section numbers
or the equivalent are not considered part of the section titles.
@item
Delete any section Entitled ``Endorsements''. Such a section
may not be included in the Modified Version.
@item
Do not retitle any existing section to be Entitled ``Endorsements'' or
to conflict in title with any Invariant Section.
@item
Preserve any Warranty Disclaimers.
@end enumerate
If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant. To do this, add their titles to the
list of Invariant Sections in the Modified Version's license notice.
These titles must be distinct from any other section titles.
You may add a section Entitled ``Endorsements'', provided it contains
nothing but endorsements of your Modified Version by various
parties---for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.
You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version. Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.
The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.
@item
COMBINING DOCUMENTS
You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice, and that you preserve all their Warranty Disclaimers.
The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy. If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.
In the combination, you must combine any sections Entitled ``History''
in the various original documents, forming one section Entitled
``History''; likewise combine any sections Entitled ``Acknowledgements'',
and any sections Entitled ``Dedications''. You must delete all
sections Entitled ``Endorsements.''
@item
COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.
You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.
@item
AGGREGATION WITH INDEPENDENT WORKS
A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, is called an ``aggregate'' if the copyright
resulting from the compilation is not used to limit the legal rights
of the compilation's users beyond what the individual works permit.
When the Document is included in an aggregate, this License does not
apply to the other works in the aggregate which are not themselves
derivative works of the Document.
If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one half of
the entire aggregate, the Document's Cover Texts may be placed on
covers that bracket the Document within the aggregate, or the
electronic equivalent of covers if the Document is in electronic form.
Otherwise they must appear on printed covers that bracket the whole
aggregate.
@item
TRANSLATION
Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections. You may include a
translation of this License, and all the license notices in the
Document, and any Warranty Disclaimers, provided that you also include
the original English version of this License and the original versions
of those notices and disclaimers. In case of a disagreement between
the translation and the original version of this License or a notice
or disclaimer, the original version will prevail.
If a section in the Document is Entitled ``Acknowledgements'',
``Dedications'', or ``History'', the requirement (section 4) to Preserve
its Title (section 1) will typically require changing the actual
title.
@item
TERMINATION
You may not copy, modify, sublicense, or distribute the Document
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense, or distribute it is void, and
will automatically terminate your rights under this License.
However, if you cease all violation of this License, then your license
from a particular copyright holder is reinstated (a) provisionally,
unless and until the copyright holder explicitly and finally
terminates your license, and (b) permanently, if the copyright holder
fails to notify you of the violation by some reasonable means prior to
60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, receipt of a copy of some or all of the same material does
not give you any rights to use it.
@item
FUTURE REVISIONS OF THIS LICENSE
The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns. See
@uref{https://www.gnu.org/licenses/}.
Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License ``or any later version'' applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation. If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation. If the Document
specifies that a proxy can decide which future versions of this
License can be used, that proxy's public statement of acceptance of a
version permanently authorizes you to choose that version for the
Document.
@item
RELICENSING
``Massive Multiauthor Collaboration Site'' (or ``MMC Site'') means any
World Wide Web server that publishes copyrightable works and also
provides prominent facilities for anybody to edit those works. A
public wiki that anybody can edit is an example of such a server. A
``Massive Multiauthor Collaboration'' (or ``MMC'') contained in the
site means any set of copyrightable works thus published on the MMC
site.
``CC-BY-SA'' means the Creative Commons Attribution-Share Alike 3.0
license published by Creative Commons Corporation, a not-for-profit
corporation with a principal place of business in San Francisco,
California, as well as future copyleft versions of that license
published by that same organization.
``Incorporate'' means to publish or republish a Document, in whole or
in part, as part of another Document.
An MMC is ``eligible for relicensing'' if it is licensed under this
License, and if all works that were first published under this License
somewhere other than this MMC, and subsequently incorporated in whole
or in part into the MMC, (1) had no cover texts or invariant sections,
and (2) were thus incorporated prior to November 1, 2008.
The operator of an MMC Site may republish an MMC contained in the site
under CC-BY-SA on the same site at any time before August 1, 2009,
provided the MMC is eligible for relicensing.
@end enumerate
@page
@heading ADDENDUM: How to use this License for your documents
To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:
@smallexample
@group
Copyright (C) @var{year} @var{your name}.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
Texts. A copy of the license is included in the section entitled ``GNU
Free Documentation License''.
@end group
@end smallexample
If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
replace the ``with@dots{}Texts.''@: line with this:
@smallexample
@group
with the Invariant Sections being @var{list their titles}, with
the Front-Cover Texts being @var{list}, and with the Back-Cover Texts
being @var{list}.
@end group
@end smallexample
If you have Invariant Sections without Cover Texts, or some other
combination of the three, merge those two alternatives to suit the
situation.
If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.
@c Local Variables:
@c ispell-local-pdict: "ispell-dict"
@c End:
libidn-v1.43/doc/gdoc 0000775 0000000 0000000 00000072006 14767240365 0014522 0 ustar 00root root 0000000 0000000 eval '(exit $?0)' && eval 'exec perl "$0" ${1+"$@"}' # -*- mode: perl -*- #
& eval 'exec perl "$0" $argv:q'
if 0;
## Copyright (c) 2002-2025 Simon Josefsson
## added -texinfo, -listfunc, -pkg-name
## man page revamp
## various improvements
## Copyright (c) 2001, 2002 Nikos Mavrogiannopoulos
## added -tex
## Copyright (c) 1998 Michael Zucchi
## Copyright (c) 2013 Adam Sampson
## made highlighting not depend on hash order, for Perl 5.18
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see .
# This will read a C source code file and scan for embedded comments
# in the style of gnome comments (+minor extensions - see below).
# usage:
# gdoc [ -docbook | -html | -text | -man | -tex | -texinfo | -listfunc ]
# [ -sourceversion verno ] [ -include file | -includefuncprefix ]
# [ -bugsto address ] [ -pkg-name packagename ]
# [ -seeinfo infonode ] [ -copyright notice ] [ -verbatimcopying ]
# [ -function funcname [ -function funcname ...] ] c file(s)s > outputfile
#
# Set output format using one of -docbook, -html, -text, -man, -tex,
# -texinfo, or -listfunc. Default is man.
#
# -sourceversion
# Version number for source code, e.g. '1.0.4'. Used in 'man' headers.
# Defaults to using current date.
#
# -include FILE
# For man pages, mention #include in the synopsis.
#
# -includefuncprefix
# For man pages, mention a #include in the synopsis.
# The FILE derived from the function prefix. For example, a
# function gss_init_sec_context will generate an include
# statement of #include .
#
# -bugsto address
# For man pages, include a section about reporting bugs and mention
# the given e-mail address, e.g 'bug-libidn@gnu.org'.
#
# -pkg-name packagename
# For man pages when -bugsto is used, also include help URLs to the
# the project's home page. For example, "GNU Libidn".
#
# -seeinfo infonode
# For man pages, include a section that point to an info manual
# for more information.
#
# -copyright notice
# For man pages, include a copyright section with the given
# notice after a preamble. Use, e.g., '2002, 2003 Simon Josefsson'.
#
# -verbatimcopying
# For man pages, and when the -copyright parameter is used,
# add a licensing statement that say verbatim copying is permitted.
#
# -function funcname
# If set, then only generate documentation for the given function(s). All
# other functions are ignored.
#
# c files - list of 'c' files to process
#
# All output goes to stdout, with errors to stderr.
#
# format of comments.
# In the following table, (...)? signifies optional structure.
# (...)* signifies 0 or more structure elements
# /**
# * function_name(:)? (- short description)?
# (* @parameterx: (description of parameter x)?)*
# (* a blank line)?
# * (Description:)? (Description of function)?
# * (Section header: (section description)? )*
# (*)?*/
#
# So .. the trivial example would be:
#
# /**
# * my_function
# **/
#
# If the Description: header tag is ommitted, then there must be a blank line
# after the last parameter specification.
# e.g.
# /**
# * my_function - does my stuff
# * @my_arg: its mine damnit
# *
# * Does my stuff explained.
# */
#
# or, could also use:
# /**
# * my_function - does my stuff
# * @my_arg: its mine damnit
# * Description: Does my stuff explained.
# */
# etc.
#
# All descriptions can be multiline, apart from the short function description.
#
# All descriptive text is further processed, scanning for the following special
# patterns, which are highlighted appropriately.
#
# 'funcname()' - function
# '$ENVVAR' - environmental variable OBSOLETE (?)
# '#struct_name' - name of a structure
# '@parameter' - name of a parameter
# '%CONST' - name of a constant.
#
# Extensions for LaTeX:
#
# 1. the symbol '->' will be replaced with a rightarrow
# 2. x^y with ${x}^{y}$.
# 3. xxx\: with xxx:
use POSIX qw(strftime);
# match expressions used to find embedded type information
$type_constant = "\\\%([A-Za-z0-9_]+)";
$type_func = "([A-Za-z0-9_]+\\(\\))";
$type_param = '\@([A-Za-z0-9_]+)\s*';
$type_struct = "\\\#([A-Za-z0-9_]+)";
$type_env = "(\\\$[A-Za-z0-9_]+)";
# Output conversion substitutions.
# One for each output format
# these work fairly well
@highlights_html = ( [$type_constant, '"$1"'],
[$type_func, '"$1"'],
[$type_struct, '"$1"'],
[$type_param, '" $1 "'] );
$blankline_html = "