diff options
author | Karl Williamson <public@khwilliamson.com> | 2010-07-31 22:21:54 -0600 |
---|---|---|
committer | Rafael Garcia-Suarez <rgs@consttype.org> | 2010-08-11 10:23:35 +0200 |
commit | beae72eec1a5f0babdb94514be158b0d599d674a (patch) | |
tree | 960d5eaeea1c3fd7c9e38c4c178d96061a757143 /op.h | |
parent | e795e96407a9fc6554e7af8feb583459eaf0cd1e (diff) | |
download | perl-beae72eec1a5f0babdb94514be158b0d599d674a.tar.gz |
op.h: Move bits around to allow for future growth
This creates an unallocated space at the shared/unshared boundary of the
data with regexp.h. This allows any future bits that may be needed to
go into either, without affecting binary compatibility. I chose a
number of spare bits larger than I thought we would ever need
Diffstat (limited to 'op.h')
-rw-r--r-- | op.h | 4 |
1 files changed, 3 insertions, 1 deletions
@@ -360,7 +360,9 @@ struct pmop { #define PM_SETRE(o,r) ((o)->op_pmregexp = (r)) #endif -#define PMf_BASE_SHIFT _RXf_PMf_SHIFT_NEXT +/* Leave some space, so future bit allocations can go either in the shared or + * unshared area without affecting binary compatibility */ +#define PMf_BASE_SHIFT (_RXf_PMf_SHIFT_NEXT+8) /* taint $1 etc. if target tainted */ #define PMf_RETAINT (1<<(PMf_BASE_SHIFT+0)) |