libvmod-re2 2.0.0-2ubuntu1 source package in Ubuntu

Changelog

libvmod-re2 (2.0.0-2ubuntu1) oracular; urgency=medium

  * Fix build failure by using std=c++17 (Closes: #1070649)

 -- Gianfranco Costamagna <email address hidden>  Sat, 25 May 2024 07:27:43 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Oracular
Original maintainer:
Varnish Package Maintainers
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc

Downloads

File Size SHA-256 Checksum
libvmod-re2_2.0.0.orig.tar.bz2 63.1 KiB 0067c80e9245d2df1e5375cc66d348405b7968e14090beae4aa86039f8e250d5
libvmod-re2_2.0.0-2ubuntu1.debian.tar.xz 6.9 KiB 590967506d98b444f66da4964b9c0deb5cf7ad656de941de5f0cbd35b764c417
libvmod-re2_2.0.0-2ubuntu1.dsc 2.1 KiB a27066b8a1b075c6f96de4d617141c05d986331c49241d52d990ee223045f1bb

View changes file

Binary packages built by this source

varnish-re2: RE2 regular expressions for Varnish

 Varnish Module (VMOD) for access to the Google RE2 regular expression
 engine. Varnish VCL uses the PCRE library (Perl Compatible Regular Expressions)
 for its native regular expressions, which runs very efficiently for many
 common uses of pattern matching in VCL, as attested by years of
 successful use of PCRE with Varnish.
 .
 But for certain kinds of patterns, the worst-case running time of the
 PCRE matcher is exponential in the length of the string to be matched.
 The matcher uses backtracking, implemented with recursive calls to the
 internal match() function. In principle there is no upper bound to the
 possible depth of backtracking and recursion, except as imposed by the
 varnishd runtime parameters pcre_match_limit and
 pcre_match_limit_recursion; matches fail if either of these limits are
 met. Stack overflow caused by deep backtracking has occasionally been
 the subject of varnishd issues.
 .
 RE2 differs from PCRE in that it limits the syntax of patterns so that
 they always specify a regular language in the formally strict sense.
 Most notably, backreferences within a pattern are not permitted, for
 example (foo|bar)\1 to match foofoo and barbar, but not foobar
 or barfoo. See the link in SEE ALSO for the specification of RE2
 syntax.
 .
 This means that an RE2 matcher runs as a finite automaton, which
 guarantees linear running time in the length of the matched string.
 There is no backtracking, and hence no risk of deep recursion or stack
 overflow.

varnish-re2-dbgsym: debug symbols for varnish-re2