README.rst 25.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
..
.. NB:  This file is machine generated, DO NOT EDIT!
..
.. Edit vmod.vcc and run make instead
..

.. role:: ref(emphasis)

.. _vmod_selector(3):

=============
vmod_selector
=============

---------------------------------------------------------------------------------------
Varnish Module for matching strings associated with backends, regexen and other strings
---------------------------------------------------------------------------------------

:Manual section: 3

SYNOPSIS
========

24
import selector [from "path"] ;
Geoff Simmons's avatar
Geoff Simmons committed
25

26 27

::
28

29
  # Set creation
30
  new <obj> = selector.set([BOOL case_sensitive])
31 32 33 34
  VOID <obj>.add(STRING [, STRING string] [, STRING regex]
  		 [, BACKEND backend])

  # Matching
35
  BOOL <obj>.match(STRING)
36 37 38
  BOOL <obj>.hasprefix(STRING)

  # Match properties
39 40 41
  INT <obj>.nmatches()
  BOOL <obj>.matched(INT)
  INT <obj>.which([ENUM select])
42 43 44 45 46 47 48

  # Retrieving objects after match
  STRING <obj>.element([INT n] [, ENUM select])
  STRING <obj>.string([INT n,] [, ENUM select])
  BACKEND <obj>.backend([INT n] [, ENUM select])
  BOOL <obj>.re_match(STRING [, INT n] [, ENUM select])
  STRING <obj>.sub(STRING text, STRING rewrite [, BOOL all] [, INT n]
Geoff Simmons's avatar
Geoff Simmons committed
49
                   [, ENUM select])
50 51 52 53 54 55 56

  # VMOD version
  STRING selector.version()

DESCRIPTION
===========

57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
Varnish Module (VMOD) for matching strings against sets of fixed
strings, and optionally associating the matched string with a backend,
another string, or a regular expression.

The VMOD is intended to support a variety of use cases that are
typical for VCL deployments, such as:

* Determining the backend based on the Host header or the prefix of
  the URL.

* Rewriting the URL or a header.

* Generating redirect responses, based on a header or the URL.

Operations such as these are commonly implemented in native VCL with
an ``if-elsif-elsif`` sequence of string comparisons or regex matches.
As the number of matches increases, such a sequence becomes cumbersome
and scales poorly -- the time needed to execute the sequence increases
Geoff Simmons's avatar
Geoff Simmons committed
75
with the number of matches to be performed.
76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104

With the VMOD, the strings to be matched are declared in a tabular
form in ``vcl_init``, and the operation is executed in a few
lines. For example::

  import selector;

  sub vcl_init {

      # Requests for URLs with these prefixes will be sent to the
      # associated backend.
      new url_prefix = selector.set();
      url_prefix.add("/foo/", backend=foo_backend);
      url_prefix.add("/bar/", backend=bar_backend);
      url_prefix.add("/baz/", backend=baz_backend);

      # For requests with these Host headers, generate a redirect
      # response, using the associated string to construct the
      # Location header.
      new redirect = selector.set();
      redirect.add("www.foo.com", string="/foo");
      redirect.add("www.bar.com", string="/bar");
      redirect.add("www.baz.com", string="/baz");

      # Requests for these URLs are rewritten by altering the
      # query string, using the associated regex for a
      # substitution operation, each of which removes a
      # parameter.
      new rewrite = selector.set();
105 106 107
      rewrite.add("/alpha/beta", regex="(\?.*)\bfoo=[^&]+&?(.*)$");
      rewrite.add("/delta/gamma", regex="(\?.*)\bbar=[^&]+&?(.*)$");
      rewrite.add("/epsilon/zeta", regex="(\?.*)\bbaz=[^&]+&?(.*)$");
108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168

  }

  sub vcl_recv {

      # .match() returns true if the Host header exactly matches
      # one of the strings in the set.
      if (redirect.match(req.http.Host)) {
          # .string() returns the string added to the set above
	  # with the 'string' parameter, for the string that was
	  # matched. We assign it to another header, to be
	  # retrieved in vcl_synth below to construct the
	  # redirect response.
	  set req.http.X-URL-Prefix = redirect.string();
	  return (synth(301));
      }

      # If the URL matches the rewrite set, change the query string by
      # applying a substitution using the associated regex (removing a
      # query parameter).
      if (rewrite.match(req.req.url)) {
          set req.url = rewrite.sub(req.url, "\1\2");
      }

  }
  
  sub vcl_backend_fetch {

      # The .hasprefix() method returns true if the URL has a prefix
      # in the set.
      if (url_prefix.hasprefix(bereq.url)) {
          # .backend() returns the backend associated with the
	  # string in the set that was matched as a prefix.
	  set bereq.backend = url_prefix.backend();
      }
  
  }

  sub vcl_synth {

      # We come here when Host matched the redirect set in vcl_recv
      # above. Set the Location response header using the URL prefix
      # saved in the request header, and generate the redirect
      # response.
      if (resp.status == 301) {
	  set resp.http.Location
	  	= "http://other.com" + req.http.X-URL-Prefix + req.url;
	  return (deliver);
      }
  
  }

Matches with the ``.match()`` and ``.hasprefix()`` methods scale well
as the number of strings in the set increases. The time needed for
``.match()`` is proportional to the length of the string to be
matched; for ``.hasprefix()``, it is proportional to the length of the
longest string in the set that forms a prefix of the string to be
matched. In both cases, the time for execution is independent of the
number of strings in the set, and is predictable and fast for large
sets of strings.

Geoff Simmons's avatar
Geoff Simmons committed
169 170 171 172 173 174
In the case of non-matches, the search for a match stops as soon as it
encounters a character in the string such that no string in the set
can match. Thus if a set contains the strings ``foo``, ``bar`` and
``baz``, then the search stops after the first character if it is
neither of ``f`` or ``b``.

175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
When new strings are added to a set (with new ``.add()`` statements in
``vcl_init``), the VCL code that executes the various operations
(rewrites, backend assignment and so forth) can remain unchanged. So
the VMOD can contribute to better code maintainability.

Matches with ``.match()`` and ``.hasprefix()`` are fixed string
matches; characters such as wildcards and regex metacharacters are
matched literally, and have no special meaning. Regex operations
such as matching or substitution can be performed after set matches,
using the regex saved with the ``regex`` parameter. But if you need
to match against sets of patterns, consider using the set interface
of `VMOD re2`_, which provides techniques similar to the present VMOD.

Selecting matched elements of a set
-----------------------------------

The ``.match()`` operation is an exact, fixed string match, and hence
always matches exactly one string in the set if it succeeds. With
``.hasprefix()``, more than one string in the set may be matched, if
the set includes strings that are prefixes of other strings in the
same set::

  sub vcl_init {
      new myset = selector.set();
      myset.add("/foo/");		# element 1
      myset.add("/foo/bar/");		# element 2
      myset.add("/foo/bar/baz/");	# element 3
  }

  sub vcl_recv {
      # With .hasprefix(), a URL such as /foo/bar/baz/quux matches all
      # 3 elements in the set.
      if (myset.hasprefix(req.url)) {
          # ...
      }
  }

Just calling ``.hasprefix()`` may be sufficient if all that matters is
whether a string has any prefix that appears in the set. But for some
uses it may be necessary to identify one matching element of the set;
this is done in particular for the ``.element()``, ``.backend()``,
``.string()``, ``.re_match()`` and ``.sub()`` methods, which retrieve
data associated with a specific set element. For such cases, the
method parameters ``INT n`` and ``ENUM select`` are used to choose a
matched element.

As indicated in the example, elements of a set are implicitly numbered
in the order in which they were added to the set using the ``.add()``
method, starting from 1. In all of the following, the ``n`` and
``select`` parameters for a method call are evaluated as follows:

* If ``n`` >= 1, then the ``n``-th element of the set is chosen, and
  the ``select`` parameter has no effect. A method with ``n`` >= 1 can
  be called in any context, and does not depend on prior match
  operations.

* If ``n`` is greater than the number of elements in the set, the
  method fails, returning a "error" return value (depending on the
  method's return type), with an error message written to the Varnish
  log (see `ERRORS`_ below).

* If ``n`` <= 0, then the ``select`` parameter is used to choose an
  element based on the most recent ``.match()`` or ``.hasprefix()``
  call for the same set object in the same task scope; that is, the
  most recent call in the same client or backend context. Thus a
  method call in one of the ``vcl_backend_*`` subroutines refers back
  to the most recent ``.match()`` or ``.hasprefix()`` invocation in
  the same backend context.

  ``n`` is 0 by default, so it can be left out of the method call for
  this purpose.

* If ``n`` <= 0 and neither of ``.match()`` or ``.hasprefix()`` has
  been called for the same set object in the same task scope, or if
  the most recent call resulted in a failed match, then the method
  fails.

* When ``n`` <= 0 after a successful ``.match()`` call, then for any
  value of ``select``, the element chosen is the one that matched.

* When ``n`` <= 0 after a successful ``.hasprefix()`` call, then the
  value of ``select`` determines the element chosen, as follows:

  * ``UNIQUE`` (default): if exactly one element of the set matched,
    choose that element. The method fails in this case if more than
    one element matched.

    Since the defaults for ``n`` and ``select`` are 0 and ``UNIQUE``,
    ``select=UNIQUE`` is in effect if both parameters are left out of
    the method call.

  * ``EXACT``: if one of the elements in the set matched exactly
    (even if other prefixes in the set matched as well), choose
    that element. The method fails if there was no exact match.

    Thus if a prefix match for ``/foo/bar`` is run against a set
    containing ``/foo`` and ``/foo/bar``, the latter element is chosen
    with ``select=EXACT``.

  * ``FIRST``: choose the first element in the set that matched
    (in the order in which they were added with ``.add()``).

  * ``LAST``: choose the last element in the set that matched.

  * ``SHORTEST``: choose the shortest element in the set that matched.

  * ``LONGEST``: choose the longest element in the set that matched.

So for sets of strings with common prefixes, a strategy for selecting
the matched element after a prefix match can be implemented by
ordering the strings added to the set, by choosing only an exact match
or the longest match, and so on::

  # In this example, we set the backend for a fetch based on the most
  # specific matching prefix of the URL, i.e. the longest prefix in
  # the URL that appears in the set.

  sub vcl_init {
      new myset = selector.set();
      myset.add("/foo/",		backend=foo_backend);
      myset.add("/foo/bar/",		backend=bar_backend);
      myset.add("/foo/bar/baz/",	backend=baz_backend);
  }

  sub vcl_backend_fetch {
      if (myset.hasprefix(bereq.url)) {
          set bereq.backend = myset.backend(select=LONGEST);
      }
  }

  # This sets baz_backend for /foo/bar/baz/quux
  # bar_backend for /foo/bar/quux
  # foo_backend for /foo/quux
308

309 310 311 312 313
CONTENTS
========

* set(BOOL)
* STRING version()
314 315 316

.. _obj_set:

317 318 319 320 321 322
set
---

::

	new OBJ = set(BOOL case_sensitive=1)
323

324 325 326
Create a set object. When ``case_sensitive`` is ``false``, matches
using the ``.match()`` and ``.hasprefix()`` methods are
case-insensitive.  By default, ``case_sensitive`` is ``true``.
327 328 329 330

Example::

  sub vcl_init {
331 332 333 334 335 336
      new myset = selector.set();
      # ...

      # For case-insensitive matching.
      new caseless = selector.set(case_sensitive=false);
      # ...
337 338 339 340
  }

.. _func_set.add:

341 342
set.add
-------
343 344 345

::

346
	VOID set.add(STRING, STRING string=0, STRING regex=0, BACKEND backend=0)
347

348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382
Add the given string to the set. As indicated above, elements added to
the set are implicitly numbered in the order in which they are added
with ``.add()``, starting with 1.

If values are set for the optional parameters ``string``, ``regex`` or
``backend``, then those values are associated with this element, and
can be retrieved with the ``.string()``, ``.backend()``,
``.re_match()`` or ``.sub()`` methods, as described below.

A regular expression in the ``regex`` parameter is compiled at VCL load
time. If the compile fails, then the VCL load fails with an error message.
Regular expressions are evaluated exactly as native regexen in VCL.

``.add()`` fails and invokes VCL failure (see `ERRORS`_) under the
following conditions:

* ``.add()`` is called any subroutine besides ``vcl_init``.

* The string to be added is NULL.

* The same string is added to the same set more than once.

* A regular expression in the ``regex`` parameter fails to compile.

Example::

  sub vcl_init {
      new myset = selector.set();
      myset.add("www.foo.com");
      myset.add("www.bar.com", string="/bar");
      myset.add("www.baz.com", string="/baz", backend=baz_backend);
      myset.add("www.quux.com", string="/quux", backend=quux_backend,
      		regex="^/quux/([^/]+)/");
  }

383 384
.. _func_set.match:

385 386 387 388 389 390
set.match
---------

::

	BOOL set.match(STRING)
391

392 393 394 395 396 397 398 399 400 401 402
Returns ``true`` if the given STRING exactly matches one of the
strings in the set. The match is case insensitive if and only if the
parameter ``case_sensitive`` was set to ``false`` in the set
constructor (matches are case sensitive by default).

``.match()`` fails and returns ``false`` under the following conditions:

* The string to be matched is NULL (such as an unset header).

* No strings were added to the set.

Geoff Simmons's avatar
Geoff Simmons committed
403
* There is insufficient workspace for internal operations.
404 405 406 407 408 409 410

Example::

  if (myset.match(req.http.Host)) {
     call do_on_match;
  }

411 412
.. _func_set.hasprefix:

413 414 415 416 417 418
set.hasprefix
-------------

::

	BOOL set.hasprefix(STRING)
419

420 421 422 423 424 425
Returns ``true`` if the STRING to be matched has a prefix that is in
the set. The match is case insensitive if ``case_sensitive`` was set
to ``false`` in the constructor.

``.hasprefix()`` fails and returns ``false`` under the same conditions
given for ``.match()`` above.
426 427 428 429 430 431 432 433 434

Example::

  if (myset.hasprefix(req.url)) {
     call do_if_prefix_matched;
  }

.. _func_set.nmatches:

435 436 437 438 439 440
set.nmatches
------------

::

	INT set.nmatches()
441

442 443 444 445 446 447 448 449 450 451 452 453 454 455
Returns the number of elements that were matched by the most recent
successful invocation of ``.match()`` or ``.hasprefix()`` for the same
set object in the same task scope (that is, in the same client or
backend context).

``.nmatches()`` returns 0 after either of ``.match()`` or
``.hasprefix()`` returned ``false``, and it returns 1 after
``.match()`` returned ``true``.  After a successful ``.hasprefix()``
call, it returns the number of strings in the set that are prefixes of
the string that was matched.

``.nmatches()`` returns 0 and writes an error message to the log if
there was no prior invocation of ``.match()`` or ``.hasprefix()`` in
the same task scope.
456 457 458

Example::

459 460 461 462 463 464 465 466 467
  # For a use case that requires a unique prefix match, use
  # .nmatches() to ensure that there was exactly one match, and fail
  # fast with VCL failure otherwise.
  if (myset.hasprefix(bereq.url)) {
     if (myset.nmatches() != 1) {
         std.log(bereq.url + " matched > 1 prefix in the set");
	 return (fail);
     }
     set bereq.backend = myset.backend(select=UNIQUE);
468 469 470 471
  }

.. _func_set.matched:

472 473 474 475 476 477
set.matched
-----------

::

	BOOL set.matched(INT)
478

479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
After a successful ``.match()`` or ``.hasprefix()`` call for the same
set object in the same task scope, return ``true`` if the element
indicated by the INT parameter was matched. The numbering corresponds
to the order of ``.add()`` invocations in ``vcl_init`` (starting from
1).

``.matched()`` always returns ``false`` if the most recent
``.match()`` or ``.hasprefix()`` call returned ``false``.

``.matched()`` fails and returns ``false`` if:

* The parameter is out of range -- it is less than 1 or greater than
  the number of elements in the set.

* There was no prior invocation of ``.match()`` or ``.hasprefix()`` in
  the same task scope.
495 496 497

Example::

498 499 500 501
  if (myset.match(req.http.Host)) {
     if (myset.matched(1)) {
         call do_if_the_first_element_matched;
     }
502 503 504 505
  }

.. _func_set.which:

506 507
set.which
---------
508 509 510

::

511
	INT set.which(ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
512

513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
After a successful ``.match()`` or ``.hasprefix()`` call for the same
set object in the same task scope, return the index of the matching
element indicated by ``select``. The numbering corresponds to the
order of ``.add()`` calls in ``vcl_init``.

Return 0 if the most recent ``.match()`` or ``.hasprefix()`` call
returned ``false``.

If more than one element matched after calling ``.hasprefix()``, the
index is chosen with the ``select`` parameter, according to the rules
given above. By default, ``select`` is ``UNIQUE``.

``.which()`` fails and returns 0 if:

* The choice of ``select`` indicates failure, as documented above; that
  is, if ``select`` is ``UNIQUE`` or ``EXACT``, but there was no unique
  or exact match, respectively.

* There was no prior invocation of ``.match()`` or ``.hasprefix()`` in
  the same task scope.
533 534 535 536

Example::

  if (myset.hasprefix(req.url)) {
537 538 539
     if (myset.which(select=SHORTEST) > 1) {
         call do_if_the_shortest_match_was_not_the_first_element;
     }
540 541 542 543
  }

.. _func_set.element:

544 545
set.element
-----------
546 547 548

::

549
	STRING set.element(INT n=0, ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
550

551 552 553 554 555 556 557 558 559 560 561
Returns the element of the set indicated by the ``n`` and ``select``
parameters as described above. Thus if ``n`` >= 1, the ``n``-th
element of the set is returned; otherwise the matched element
indicated by ``select`` is returned after calling ``.match()`` or
``.hasprefix()``.

The string returned is the same as it was added to the set; even if a
prior match was case insensitive, and the matched string differs in
case, the string with the case as added to the set is returned.

``.element()`` fails and returns NULL if the rules for ``n`` and
Geoff Simmons's avatar
Geoff Simmons committed
562 563 564 565 566 567 568 569 570
``select`` indicate failure; that is:

* ``n`` is out of range (greater than the number of elements in the
  set)

* ``n`` < 1 and ``select`` fails for ``UNIQUE`` or ``EXACT``

* ``n`` < 1 and there was no prior invocation of ``.match()`` or
  ``.hasprefix()``.
571 572 573 574

Example::

  if (myset.hasprefix(req.url)) {
575
     # Construct a redirect response for another host, using the
Geoff Simmons's avatar
Geoff Simmons committed
576
     # matching prefix in the request URL as the new URL path.
577
     set resp.http.Location = "http://other.com" + myset.element();
578 579 580 581
  }

.. _func_set.backend:

582 583
set.backend
-----------
584 585 586

::

587
	BACKEND set.backend(INT n=0, ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
588

589 590 591 592 593 594 595 596 597 598 599
Returns the backend associated with the element of the set indicated
by ``n`` and ``select``, according to the rules given above; that is,
it returns the backend that was set via the ``backend`` parameter in
``.add()``.

``.backend()`` fails and returns NULL if:

* The rules for ``n`` and ``select`` indicate failure.

* No backend was set with the ``backend`` parameter in the ``.add()``
  call corresponding to the selected element.
600 601 602

Example::

603 604 605 606
  if (myset.hasprefix(bereq.url)) {
     # Set the backend associated with the string in the set that
     # forms the longest prefix of the URL
     set bereq.backend = myset.backend(select=LONGEST);
607 608 609 610
  }

.. _func_set.string:

611 612
set.string
----------
613 614 615

::

616
	STRING set.string(INT n=0, ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
617

618 619 620 621 622 623 624 625 626
Returns the string set by the ``string`` parameter for the element of
the set indicated by ``n`` and ``select``, according to the rules
given above.

``.string()`` fails and returns NULL if:

* The rules for ``n`` and ``select`` indicate failure.

* No string was set with the ``string`` parameter in ``.add()``.
627 628 629

Example::

630 631 632
  # Rewrite the URL if it matches one of the strings in the set.
  if (myset.match(req.url)) {
     set req.url = myset.string();
633 634 635 636
  }

.. _func_set.re_match:

637 638
set.re_match
------------
639 640 641

::

642
	BOOL set.re_match(STRING subject, INT n=0, ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
643

644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667
Using the regular expression set by the ``regex`` parameter for the
element of the set indicated by ``n`` and ``select``, return the
result of matching the regex against ``subject``. The regex match is
the same operation performed for the native VCL ``~`` operator, see
vcl(7).

In other words, this method can be used to perform a second match with
the saved regular expression, after matching a fixed string against
the set.

The regex match is subject to the same conditions imposed for matching
in native VCL; in particular, it may be limited by the varnishd
parameters ``pcre_match_limit`` and ``pcre_match_limit_recursion``
(see varnishd(1)).

``.re_match()`` fails and returns ``false`` if:

* The rules for ``n`` and ``select`` indicate failure.

* No regular expression was set with the ``regex`` parameter in
  ``.add()``.

* The regex match fails, for any of the reasons that cause a native
  match to fail.
668 669 670

Example::

671 672 673 674 675 676
  # If the Host header exactly matches a string in the set, perform a
  # regex match against the URL.
  if (myset.match(req.http.Host)) {
     if (myset.re_match(req.url)) {
         call do_if_the_URL_matches_the_regex_for_Host;
     }
677 678 679 680
  }

.. _func_set.sub:

681 682
set.sub
-------
683 684 685

::

686
	STRING set.sub(STRING str, STRING sub, BOOL all=0, INT n=0, ENUM {UNIQUE,EXACT,FIRST,LAST,SHORTEST,LONGEST} select="UNIQUE")
687

688 689 690
Using the regular expression set by the ``regex`` parameter for the
element of the set indicated by ``n`` and ``select``, return the
result of a substitution using ``str`` and ``sub``.
691

692 693 694 695
If ``all`` is ``false``, then return the result of replacing the first
portion of ``str`` that matches the regex with ``sub``. ``sub`` may
contain backreferences ``\0`` through ``\9``, to include captured
substrings from ``str`` in the substitution. This is the same
Geoff Simmons's avatar
Geoff Simmons committed
696 697
operation performed by the native VCL function
``regsub(str, regex, sub)`` (see vcl(7)). By default, ``all`` is false.
698

699 700 701 702
If ``all`` is ``true``, return the result of replacing each
non-overlapping portion of ``str`` that matches the regex with ``sub``
(possibly with backreferences). This is the same operation as native
VCL's ``regsuball(str, regex, sub)``.
703

704
``.sub()`` fails and returns NULL if:
705

706
* The rules for ``n`` and ``select`` indicate failure.
707

708 709
* No regular expression was set with the ``regex`` parameter in
  ``.add()``.
710

711 712
* The substitution fails for any of the reasons that cause native
  ``regsub()`` or ``regsuball()`` to fail.
713 714 715

Example::

716 717
  # In this example we match the URL prefix, and if a match is found,
  # rewrite the URL by exchanging path components as indicated.
718
  sub vcl_init {
719 720 721 722 723 724 725
      new rewrite = selector.set();
      rewrite.add("/foo/", regex="^(/foo)/([^/]+)/([^/]+)/");
      rewrite.add("/foo/bar/", regex="^(/foo/bar)/([^/]+)/([^/]+)/");
      rewrite.add("/foo/bar/baz/", regex="^(/foo/bar/baz)/([^/]+)/([^/]+)/");
  }

  if (rewrite.hasprefix(req.url)) {
726
     set req.url = rewrite.sub(req.url, "\1/\3/\2/", select=LAST);
727 728
  }

729 730 731 732
  # /foo/1/2/* is rewritten as /foo/2/1/*
  # /foo/bar/1/2/* is rewritten as /foo/bar/2/1/*
  # /foo/bar/baz/1/2/* is rewritten as /foo/bar/baz/2/1/*

733 734
.. _func_set.debug:

735 736
set.debug
---------
737

738
::
739

740
	STRING set.debug()
741

742
Intentionally not documented.
743

744
.. _func_version:
745

746 747
version
-------
748

749
::
750

751
	STRING version()
752 753 754 755 756 757 758

Return the version string for this VMOD.

Example::

  std.log("Using VMOD selector version: " + selector.version());

759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781
ERRORS
======

The method documentation above refers to two kinds of failures: method
failure and VCL failure.

When a method fails, an error message is written to the Varnish log
with the ``VCL_Error`` tag, and the method returns an "error" value,
which depends on the return type, as documented above.

VCL failure has the same results as if ``return(fail)`` is called from
a VCL subroutine:

* If the failure occurs in ``vcl_init``, then the VCL load fails with
  an error message.

* If the failure occurs in any other subroutine besides ``vcl_synth``,
  then a ``VCL_Error`` message is written to the log, and control is
  directed immediately to ``vcl_synth``, with ``resp.status`` set to
  503 and ``resp.reason`` set to ``"VCL failed"``.

* If the failure occurs in ``vcl_synth``, then ``vcl_synth`` is
  aborted, and the response line "503 VCL failed" is sent.
782

783 784 785
REQUIREMENTS
============

786
The VMOD requires Varnish versions 5.1.x. See the VMOD source
787 788
repository for versions that are compatible with other Varnish
versions.
789 790 791 792 793 794 795 796 797

INSTALLATION
============

See `INSTALL.rst <INSTALL.rst>`_ in the source repository.

LIMITATIONS
===========

798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821
The VMOD uses workspace for two purposes:

* Saving task-scoped data about a match with ``.match()`` and
  ``.hasprefix()``, for use by the methods that retrieve information
  about the prior match.  This data is stored separately for each
  object for which a match is executed.

* A copy of the string to be matched for case insensitive matches (the
  copy is set to all one case).

If you find that methods are failing with ``VCL_Error`` messages
indicating "out of space", consider increasing the varnishd parameters
``workspace_client`` and/or ``workspace_backend`` (see varnishd(1)).

Set objects and their internal structures are allocated from the heap,
and hence are only limited by available RAM.

The regex methods ``.re_match()`` and ``.sub()`` use the same internal
mechanisms as native VCL's ``~`` operator and the ``regsub/all()``
functions, and are subject to the same limitations. In particular,
they may be limited by the varnishd parameters ``pcre_match_limit``
and ``pcre_match_limit_recursion``, in which case they emit the same
``VCL_Error`` messages as the native operations. If necessary, adjust
these parameters as advised in varnishd(1).
822 823 824 825 826 827 828 829 830 831 832 833 834 835

AUTHOR
======

* Geoffrey Simmons <geoff@uplex.de>

UPLEX Nils Goroll Systemoptimierung

SEE ALSO
========

* varnishd(1)
* vcl(7)
* VMOD source repository: https://code.uplex.de/uplex-varnish/libvmod-selector
836
* `VMOD re2`_: https://code.uplex.de/uplex-varnish/libvmod-re2
837 838 839 840 841 842 843 844 845 846 847 848 849

COPYRIGHT
=========

::

  Copyright (c) 2018 UPLEX Nils Goroll Systemoptimierung
  All rights reserved
 
  Author: Geoffrey Simmons <geoffrey.simmons@uplex.de>
 
  See LICENSE
 
850 851 852

.. _VMOD re2: https://code.uplex.de/uplex-varnish/libvmod-re2