tld_check_4(3) libidn tld_check_4(3)
NAME
tld_check_4 - API function
SYNOPSIS
#include <tld.h>
int tld_check_4(const uint32_t * in, size_t inlen, size_t * errpos,
const Tld_table ** overrides);
ARGUMENTS
const uint32_t * in
Array of unicode code points to process. Does not need to
be zero terminated.
size_t inlen
Number of unicode code points.
size_t * errpos
Position of offending character is returned here.
const Tld_table ** overrides
A Tld_table array of additional domain restriction struc-
tures that complement and supersede the built-in informa-
tion.
DESCRIPTION
Test each of the code points in in for whether or not they are allowed
by the information in overrides or by the built-in TLD restriction
data. When data for the same TLD is available both internally and in
overrides , the information in overrides takes precedence. If several
entries for a specific TLD are found, the first one is used. If over-
rides is NULL, only the built-in information is used. The position of
the first offending character is returned in errpos .
Return value: Returns the Tld_rc value TLD_SUCCESS if all code points
are valid or when tld is null, TLD_INVALID if a character is not al-
lowed, or additional error codes on general failure conditions.
REPORTING BUGS
Report bugs to <help-libidn@gnu.org>.
General guidelines for reporting bugs: http://www.gnu.org/gethelp/
GNU Libidn home page: http://www.gnu.org/software/libidn/
COPYRIGHT
Copyright © 2002-2021 Simon Josefsson.
Copying and distribution of this file, with or without modification,
are permitted in any medium without royalty provided the copyright no-
tice and this notice are preserved.
SEE ALSO
The full documentation for libidn is maintained as a Texinfo manual.
If the info and libidn programs are properly installed at your site,
the command
info libidn
should give you access to the complete manual. As an alternative you
may obtain the manual from:
http://www.gnu.org/software/libidn/manual/
libidn 1.38 tld_check_4(3)
Generated by dwww version 1.14 on Fri Jan 24 06:20:41 CET 2025.