Skip to content
Snippets Groups Projects
Select Git revision
  • benchmark-tools
  • postgres-lambda
  • master default
  • REL9_4_25
  • REL9_5_20
  • REL9_6_16
  • REL_10_11
  • REL_11_6
  • REL_12_1
  • REL_12_0
  • REL_12_RC1
  • REL_12_BETA4
  • REL9_4_24
  • REL9_5_19
  • REL9_6_15
  • REL_10_10
  • REL_11_5
  • REL_12_BETA3
  • REL9_4_23
  • REL9_5_18
  • REL9_6_14
  • REL_10_9
  • REL_11_4
23 results

pg_dump

  • Clone with SSH
  • Clone with HTTPS
  • user avatar
    Tom Lane authored
    Cases where a back-reference is part of a larger subexpression that
    is quantified have never worked in Spencer's regex engine, because
    he used a compile-time transformation that neglected the need to
    check the back-reference match in iterations before the last one.
    (That was okay for capturing parens, and we still do it if the
    regex has *only* capturing parens ... but it's not okay for backrefs.)
    
    To make this work properly, we have to add an "iteration" node type
    to the regex engine's vocabulary of sub-regex nodes.  Since this is a
    moderately large change with a fair risk of introducing new bugs of its
    own, apply to HEAD only, even though it's a fix for a longstanding bug.
    173e29aa
    History
    Name Last commit Last update
    ..