1 package #hide from PAUSE
2 DBIx::Class::Storage::DBIHacks;
5 # This module contains code that should never have seen the light of day,
6 # does not belong in the Storage, or is otherwise unfit for public
7 # display. The arrival of SQLA2 should immediately obsolete 90% of this
13 use base 'DBIx::Class::Storage';
16 use List::Util 'first';
17 use Scalar::Util 'blessed';
18 use DBIx::Class::_Util qw(UNRESOLVABLE_CONDITION serialize);
19 use SQL::Abstract qw(is_plain_value is_literal_value);
20 use DBIx::Class::Carp;
24 # This code will remove non-selecting/non-restricting joins from
25 # {from} specs, aiding the RDBMS query optimizer
27 sub _prune_unused_joins {
28 my ($self, $attrs) = @_;
30 # only standard {from} specs are supported, and we could be disabled in general
31 return ($attrs->{from}, {}) unless (
32 ref $attrs->{from} eq 'ARRAY'
36 ref $attrs->{from}[0] eq 'HASH'
38 ref $attrs->{from}[1] eq 'ARRAY'
40 $self->_use_join_optimizer
43 my $orig_aliastypes = $self->_resolve_aliastypes_from_select_args($attrs);
45 my $new_aliastypes = { %$orig_aliastypes };
47 # we will be recreating this entirely
48 my @reclassify = 'joining';
50 # a grouped set will not be affected by amount of rows. Thus any
51 # purely multiplicator classifications can go
52 # (will be reintroduced below if needed by something else)
53 push @reclassify, qw(multiplying premultiplied)
54 if $attrs->{_force_prune_multiplying_joins} or $attrs->{group_by};
56 # nuke what will be recalculated
57 delete @{$new_aliastypes}{@reclassify};
59 my @newfrom = $attrs->{from}[0]; # FROM head is always present
61 # recalculate what we need once the multipliers are potentially gone
62 # ignore premultiplies, since they do not add any value to anything
64 for ( @{$new_aliastypes}{grep { $_ ne 'premultiplied' } keys %$new_aliastypes }) {
65 # add all requested aliases
66 $need_joins{$_} = 1 for keys %$_;
68 # add all their parents (as per joinpath which is an AoH { table => alias })
69 $need_joins{$_} = 1 for map { values %$_ } map { @{$_->{-parents}} } values %$_;
72 for my $j (@{$attrs->{from}}[1..$#{$attrs->{from}}]) {
73 push @newfrom, $j if (
74 (! defined $j->[0]{-alias}) # legacy crap
76 $need_joins{$j->[0]{-alias}}
80 # we have a new set of joiners - for everything we nuked pull the classification
81 # off the original stack
82 for my $ctype (@reclassify) {
83 $new_aliastypes->{$ctype} = { map
84 { $need_joins{$_} ? ( $_ => $orig_aliastypes->{$ctype}{$_} ) : () }
85 keys %{$orig_aliastypes->{$ctype}}
89 return ( \@newfrom, $new_aliastypes );
93 # This is the code producing joined subqueries like:
94 # SELECT me.*, other.* FROM ( SELECT me.* FROM ... ) JOIN other ON ...
96 sub _adjust_select_args_for_complex_prefetch {
97 my ($self, $attrs) = @_;
99 $self->throw_exception ('Complex prefetches are not supported on resultsets with a custom from attribute') unless (
100 ref $attrs->{from} eq 'ARRAY'
102 @{$attrs->{from}} > 1
104 ref $attrs->{from}[0] eq 'HASH'
106 ref $attrs->{from}[1] eq 'ARRAY'
109 my $root_alias = $attrs->{alias};
111 # generate inner/outer attribute lists, remove stuff that doesn't apply
112 my $outer_attrs = { %$attrs };
113 delete @{$outer_attrs}{qw(from bind rows offset group_by _grouped_by_distinct having)};
115 my $inner_attrs = { %$attrs, _simple_passthrough_construction => 1 };
116 delete @{$inner_attrs}{qw(for collapse select as)};
118 # there is no point of ordering the insides if there is no limit
119 delete $inner_attrs->{order_by} if (
120 delete $inner_attrs->{_order_is_artificial}
122 ! $inner_attrs->{rows}
125 # generate the inner/outer select lists
126 # for inside we consider only stuff *not* brought in by the prefetch
127 # on the outside we substitute any function for its alias
128 $outer_attrs->{select} = [ @{$attrs->{select}} ];
130 my ($root_node, $root_node_offset);
132 for my $i (0 .. $#{$inner_attrs->{from}}) {
133 my $node = $inner_attrs->{from}[$i];
134 my $h = (ref $node eq 'HASH') ? $node
135 : (ref $node eq 'ARRAY' and ref $node->[0] eq 'HASH') ? $node->[0]
139 if ( ($h->{-alias}||'') eq $root_alias and $h->{-rsrc} ) {
141 $root_node_offset = $i;
146 $self->throw_exception ('Complex prefetches are not supported on resultsets with a custom from attribute')
149 # use the heavy duty resolver to take care of aliased/nonaliased naming
150 my $colinfo = $self->_resolve_column_info($inner_attrs->{from});
151 my $selected_root_columns;
153 for my $i (0 .. $#{$outer_attrs->{select}}) {
154 my $sel = $outer_attrs->{select}->[$i];
157 $colinfo->{$sel} and $colinfo->{$sel}{-source_alias} ne $root_alias
160 if (ref $sel eq 'HASH' ) {
161 $sel->{-as} ||= $attrs->{as}[$i];
162 $outer_attrs->{select}->[$i] = join ('.', $root_alias, ($sel->{-as} || "inner_column_$i") );
164 elsif (! ref $sel and my $ci = $colinfo->{$sel}) {
165 $selected_root_columns->{$ci->{-colname}} = 1;
168 push @{$inner_attrs->{select}}, $sel;
170 push @{$inner_attrs->{as}}, $attrs->{as}[$i];
173 # We will need to fetch all native columns in the inner subquery, which may
174 # be a part of an *outer* join condition, or an order_by (which needs to be
175 # preserved outside), or wheres. In other words everything but the inner
177 # We can not just fetch everything because a potential has_many restricting
178 # join collapse *will not work* on heavy data types.
179 my $connecting_aliastypes = $self->_resolve_aliastypes_from_select_args({
184 for (sort map { keys %{$_->{-seen_columns}||{}} } map { values %$_ } values %$connecting_aliastypes) {
185 my $ci = $colinfo->{$_} or next;
187 $ci->{-source_alias} eq $root_alias
189 ! $selected_root_columns->{$ci->{-colname}}++
191 # adding it to both to keep limits not supporting dark selectors happy
192 push @{$inner_attrs->{select}}, $ci->{-fq_colname};
193 push @{$inner_attrs->{as}}, $ci->{-fq_colname};
197 # construct the inner {from} and lock it in a subquery
198 # we need to prune first, because this will determine if we need a group_by below
199 # throw away all non-selecting, non-restricting multijoins
200 # (since we def. do not care about multiplication of the contents of the subquery)
201 my $inner_subq = do {
203 # must use it here regardless of user requests (vastly gentler on optimizer)
204 local $self->{_use_join_optimizer} = 1;
206 # throw away multijoins since we def. do not care about those inside the subquery
207 ($inner_attrs->{from}, my $inner_aliastypes) = $self->_prune_unused_joins ({
208 %$inner_attrs, _force_prune_multiplying_joins => 1
211 # uh-oh a multiplier (which is not us) left in, this is a problem for limits
212 # we will need to add a group_by to collapse the resultset for proper counts
214 grep { $_ ne $root_alias } keys %{ $inner_aliastypes->{multiplying} || {} }
216 # if there are user-supplied groups - assume user knows wtf they are up to
217 ( ! $inner_aliastypes->{grouping} or $inner_attrs->{_grouped_by_distinct} )
220 my $cur_sel = { map { $_ => 1 } @{$inner_attrs->{select}} };
222 # *possibly* supplement the main selection with pks if not already
223 # there, as they will have to be a part of the group_by to collapse
225 my $inner_select_with_extras;
226 my @pks = map { "$root_alias.$_" } $root_node->{-rsrc}->primary_columns
227 or $self->throw_exception( sprintf
228 'Unable to perform complex limited prefetch off %s without declared primary key',
229 $root_node->{-rsrc}->source_name,
232 push @{ $inner_select_with_extras ||= [ @{$inner_attrs->{select}} ] }, $col
233 unless $cur_sel->{$col}++;
236 ($inner_attrs->{group_by}, $inner_attrs->{order_by}) = $self->_group_over_selection({
238 $inner_select_with_extras ? ( select => $inner_select_with_extras ) : (),
239 _aliastypes => $inner_aliastypes,
243 # we already optimized $inner_attrs->{from} above
244 # and already local()ized
245 $self->{_use_join_optimizer} = 0;
247 # generate the subquery
248 $self->_select_args_to_query (
249 @{$inner_attrs}{qw(from select where)},
254 # Generate the outer from - this is relatively easy (really just replace
255 # the join slot with the subquery), with a major caveat - we can not
256 # join anything that is non-selecting (not part of the prefetch), but at
257 # the same time is a multi-type relationship, as it will explode the result.
259 # There are two possibilities here
260 # - either the join is non-restricting, in which case we simply throw it away
261 # - it is part of the restrictions, in which case we need to collapse the outer
262 # result by tackling yet another group_by to the outside of the query
264 # work on a shallow copy
265 my @orig_from = @{$attrs->{from}};
268 $outer_attrs->{from} = \ my @outer_from;
270 # we may not be the head
271 if ($root_node_offset) {
272 # first generate the outer_from, up to the substitution point
273 @outer_from = splice @orig_from, 0, $root_node_offset;
275 # substitute the subq at the right spot
278 -alias => $root_alias,
279 -rsrc => $root_node->{-rsrc},
280 $root_alias => $inner_subq,
282 # preserve attrs from what is now the head of the from after the splice
283 @{$orig_from[0]}[1 .. $#{$orig_from[0]}],
288 -alias => $root_alias,
289 -rsrc => $root_node->{-rsrc},
290 $root_alias => $inner_subq,
294 shift @orig_from; # what we just replaced above
296 # scan the *remaining* from spec against different attributes, and see which joins are needed
298 my $outer_aliastypes = $outer_attrs->{_aliastypes} =
299 $self->_resolve_aliastypes_from_select_args({ %$outer_attrs, from => \@orig_from });
302 my ($outer_select_chain, @outer_nonselecting_chains) = map { +{
303 map { $_ => 1 } map { values %$_} map { @{$_->{-parents}} } values %{ $outer_aliastypes->{$_} || {} }
304 } } qw/selecting restricting grouping ordering/;
306 # see what's left - throw away if not selecting/restricting
307 my $may_need_outer_group_by;
308 while (my $j = shift @orig_from) {
309 my $alias = $j->[0]{-alias};
312 $outer_select_chain->{$alias}
316 elsif (first { $_->{$alias} } @outer_nonselecting_chains ) {
317 push @outer_from, $j;
318 $may_need_outer_group_by ||= $outer_aliastypes->{multiplying}{$alias} ? 1 : 0;
322 # also throw in a synthetic group_by if a non-selecting multiplier,
323 # to guard against cross-join explosions
324 # the logic is somewhat fragile, but relies on the idea that if a user supplied
325 # a group by on their own - they know what they were doing
326 if ( $may_need_outer_group_by and $attrs->{_grouped_by_distinct} ) {
327 ($outer_attrs->{group_by}, $outer_attrs->{order_by}) = $self->_group_over_selection ({
329 from => \@outer_from,
333 # This is totally horrific - the {where} ends up in both the inner and outer query
334 # Unfortunately not much can be done until SQLA2 introspection arrives, and even
335 # then if where conditions apply to the *right* side of the prefetch, you may have
336 # to both filter the inner select (e.g. to apply a limit) and then have to re-filter
337 # the outer select to exclude joins you didn't want in the first place
339 # OTOH it can be seen as a plus: <ash> (notes that this query would make a DBA cry ;)
344 # I KNOW THIS SUCKS! GET SQLA2 OUT THE DOOR SO THIS CAN DIE!
346 # Due to a lack of SQLA2 we fall back to crude scans of all the
347 # select/where/order/group attributes, in order to determine what
348 # aliases are needed to fulfill the query. This information is used
349 # throughout the code to prune unnecessary JOINs from the queries
350 # in an attempt to reduce the execution time.
351 # Although the method is pretty horrific, the worst thing that can
352 # happen is for it to fail due to some scalar SQL, which in turn will
353 # result in a vocal exception.
354 sub _resolve_aliastypes_from_select_args {
355 my ( $self, $attrs ) = @_;
357 $self->throw_exception ('Unable to analyze custom {from}')
358 if ref $attrs->{from} ne 'ARRAY';
360 # what we will return
363 # see what aliases are there to work with
364 # and record who is a multiplier and who is premultiplied
366 for my $node (@{$attrs->{from}}) {
369 $j = $j->[0] if ref $j eq 'ARRAY';
370 my $al = $j->{-alias}
373 $alias_list->{$al} = $j;
375 $aliases_by_type->{multiplying}{$al} ||= { -parents => $j->{-join_path}||[] }
376 # not array == {from} head == can't be multiplying
377 if ref($node) eq 'ARRAY' and ! $j->{-is_single};
379 $aliases_by_type->{premultiplied}{$al} ||= { -parents => $j->{-join_path}||[] }
380 # parts of the path that are not us but are multiplying
381 if grep { $aliases_by_type->{multiplying}{$_} }
384 @{ $j->{-join_path}||[] }
387 # get a column to source/alias map (including unambiguous unqualified ones)
388 my $colinfo = $self->_resolve_column_info ($attrs->{from});
390 # set up a botched SQLA
391 my $sql_maker = $self->sql_maker;
393 # these are throw away results, do not pollute the bind stack
394 local $sql_maker->{where_bind};
395 local $sql_maker->{group_bind};
396 local $sql_maker->{having_bind};
397 local $sql_maker->{from_bind};
399 # we can't scan properly without any quoting (\b doesn't cut it
400 # everywhere), so unless there is proper quoting set - use our
401 # own weird impossible character.
402 # Also in the case of no quoting, we need to explicitly disable
403 # name_sep, otherwise sorry nasty legacy syntax like
404 # { 'count(foo.id)' => { '>' => 3 } } will stop working >:(
405 local $sql_maker->{quote_char} = $sql_maker->{quote_char};
406 local $sql_maker->{name_sep} = $sql_maker->{name_sep};
408 unless (defined $sql_maker->{quote_char} and length $sql_maker->{quote_char}) {
409 $sql_maker->{quote_char} = ["\x00", "\xFF"];
410 # if we don't unset it we screw up retarded but unfortunately working
411 # 'MAX(foo.bar)' => { '>', 3 }
412 $sql_maker->{name_sep} = '';
415 my ($lquote, $rquote, $sep) = map { quotemeta $_ } ($sql_maker->_quote_chars, $sql_maker->name_sep);
417 # generate sql chunks
420 ($sql_maker->_recurse_where ($attrs->{where}))[0],
421 $sql_maker->_parse_rs_attrs ({ having => $attrs->{having} }),
424 $sql_maker->_parse_rs_attrs ({ group_by => $attrs->{group_by} }),
427 $sql_maker->_recurse_from (
428 ref $attrs->{from}[0] eq 'ARRAY' ? $attrs->{from}[0][0] : $attrs->{from}[0],
429 @{$attrs->{from}}[1 .. $#{$attrs->{from}}],
433 # kill all selectors which look like a proper subquery
434 # this is a sucky heuristic *BUT* - if we get it wrong the query will simply
435 # fail to run, so we are relatively safe
437 { $_ !~ / \A \s* \( \s* SELECT \s+ .+? \s+ FROM \s+ .+? \) \s* \z /xsi }
439 { ($sql_maker->_recurse_fields($_))[0] }
444 ( my $sql = (ref $_ ? $_->[0] : $_) ) =~ s/ \s+ (?: ASC | DESC ) \s* \z //xi;
447 $sql_maker->_order_by_chunks( $attrs->{order_by} ),
451 # throw away empty-string chunks, and make sure no binds snuck in
452 # note that we operate over @{$to_scan->{$type}}, hence the
453 # semi-mindbending ... map ... for values ...
457 : (length ref $_) ? (require Data::Dumper::Concise && $self->throw_exception(
458 "Unexpected ref in scan-plan: " . Data::Dumper::Concise::Dumper($_)
462 } @$_ ] ) for values %$to_scan;
464 # throw away empty to-scan's
468 delete $to_scan->{$_}
469 ) for keys %$to_scan;
472 # these will be used for matching in the loop below
473 my $all_aliases = join ' | ', map { quotemeta $_ } keys %$alias_list;
475 $lquote ( $all_aliases ) $rquote $sep (?: $lquote ([^$rquote]+) $rquote )?
477 \b ( $all_aliases ) \. ( [^\s\)\($rquote]+ )?
480 my $all_unq_columns = join ' | ',
484 # using a regex here shows up on profiles, boggle
485 { index( $_, '.') < 0 }
488 my $unq_col_re = $all_unq_columns
489 ? qr/ $lquote ( $all_unq_columns ) $rquote /x
494 # the actual scan, per type
495 for my $type (keys %$to_scan) {
497 # first see if we have any exact matches (qualified or unqualified)
498 for my $piece (@{$to_scan->{$type}}) {
499 if ($colinfo->{$piece} and my $alias = $colinfo->{$piece}{-source_alias}) {
500 $aliases_by_type->{$type}{$alias} ||= { -parents => $alias_list->{$alias}{-join_path}||[] };
501 $aliases_by_type->{$type}{$alias}{-seen_columns}{$colinfo->{$piece}{-fq_colname}} = $piece;
506 # we will be bulk-scanning anyway - pieces will not matter in that case
507 # (unlike in the direct-equivalence above)
508 my $scan_string = join ' ', @{$to_scan->{$type}};
511 # now loop through all fully qualified columns and get the corresponding
512 # alias (should work even if they are in scalarrefs)
514 # The regex matches in multiples of 4, with one of the two pairs being
515 # undef. There may be a *lot* of matches, hence the convoluted loop
516 my @matches = $scan_string =~ /$fq_col_re/g;
518 while( $i < $#matches ) {
523 $aliases_by_type->{$type}{$matches[$i]} ||= { -parents => $alias_list->{$matches[$i]}{-join_path}||[] };
525 $aliases_by_type->{$type}{$matches[$i]}{-seen_columns}{"$matches[$i].$matches[$i+1]"} = "$matches[$i].$matches[$i+1]"
526 if defined $matches[$i+1];
535 # now loop through unqualified column names, and try to locate them within
536 # the chunks, if there are any unqualified columns in the 1st place
537 next unless $unq_col_re;
538 for ( $scan_string =~ /$unq_col_re/g ) {
539 my $alias = $colinfo->{$_}{-source_alias} or next;
540 $aliases_by_type->{$type}{$alias} ||= { -parents => $alias_list->{$alias}{-join_path}||[] };
541 $aliases_by_type->{$type}{$alias}{-seen_columns}{"$alias.$_"} = $_
546 # Add any non-left joins to the restriction list (such joins are indeed restrictions)
550 ! $aliases_by_type->{restricting}{ $_->{-alias} }
555 $_->{-join_type} !~ /^left (?: \s+ outer)? $/xi
558 $aliases_by_type->{restricting}{ $_->{-alias} } = { -parents => $_->{-join_path}||[] }
559 ) for values %$alias_list;
564 keys %{$aliases_by_type->{$_}}
566 delete $aliases_by_type->{$_}
567 ) for keys %$aliases_by_type;
573 # This is the engine behind { distinct => 1 } and the general
574 # complex prefetch grouper
575 sub _group_over_selection {
576 my ($self, $attrs) = @_;
578 my $colinfos = $self->_resolve_column_info ($attrs->{from});
580 my (@group_by, %group_index);
582 # the logic is: if it is a { func => val } we assume an aggregate,
583 # otherwise if \'...' or \[...] we assume the user knows what is
584 # going on thus group over it
585 for (@{$attrs->{select}}) {
586 if (! ref($_) or ref ($_) ne 'HASH' ) {
589 if ($colinfos->{$_} and $_ !~ /\./ ) {
590 # add a fully qualified version as well
591 $group_index{"$colinfos->{$_}{-source_alias}.$_"}++;
596 my @order_by = $self->_extract_order_criteria($attrs->{order_by})
597 or return (\@group_by, $attrs->{order_by});
599 # add any order_by parts that are not already present in the group_by
600 # to maintain SQL cross-compatibility and general sanity
602 # also in case the original selection is *not* unique, or in case part
603 # of the ORDER BY refers to a multiplier - we will need to replace the
604 # skipped order_by elements with their MIN/MAX equivalents as to maintain
605 # the proper overall order without polluting the group criteria (and
606 # possibly changing the outcome entirely)
608 my ($leftovers, $sql_maker, @new_order_by, $order_chunks, $aliastypes);
610 my $group_already_unique = $self->_columns_comprise_identifying_set($colinfos, \@group_by);
612 for my $o_idx (0 .. $#order_by) {
614 # if the chunk is already a min/max function - there is nothing left to touch
615 next if $order_by[$o_idx][0] =~ /^ (?: min | max ) \s* \( .+ \) $/ix;
617 # only consider real columns (for functions the user got to do an explicit group_by)
620 @{$order_by[$o_idx]} != 1
622 # only declare an unknown *plain* identifier as "leftover" if we are called with
623 # aliastypes to examine. If there are none - we are still in _resolve_attrs, and
624 # can just assume the user knows what they want
625 ( ! ( $chunk_ci = $colinfos->{$order_by[$o_idx][0]} ) and $attrs->{_aliastypes} )
627 push @$leftovers, $order_by[$o_idx][0];
630 next unless $chunk_ci;
632 # no duplication of group criteria
633 next if $group_index{$chunk_ci->{-fq_colname}};
636 $attrs->{_aliastypes}
638 $self->_resolve_aliastypes_from_select_args({
639 from => $attrs->{from},
640 order_by => $attrs->{order_by},
642 ) if $group_already_unique;
644 # check that we are not ordering by a multiplier (if a check is requested at all)
646 $group_already_unique
648 ! $aliastypes->{multiplying}{$chunk_ci->{-source_alias}}
650 ! $aliastypes->{premultiplied}{$chunk_ci->{-source_alias}}
652 push @group_by, $chunk_ci->{-fq_colname};
653 $group_index{$chunk_ci->{-fq_colname}}++
656 # We need to order by external columns without adding them to the group
657 # (eiehter a non-unique selection, or a multi-external)
659 # This doesn't really make sense in SQL, however from DBICs point
660 # of view is rather valid (e.g. order the leftmost objects by whatever
661 # criteria and get the offset/rows many). There is a way around
662 # this however in SQL - we simply tae the direction of each piece
663 # of the external order and convert them to MIN(X) for ASC or MAX(X)
664 # for DESC, and group_by the root columns. The end result should be
665 # exactly what we expect
667 # FIXME - this code is a joke, will need to be completely rewritten in
668 # the DQ branch. But I need to push a POC here, otherwise the
669 # pesky tests won't pass
670 # wrap any part of the order_by that "responds" to an ordering alias
672 $sql_maker ||= $self->sql_maker;
674 map { ref $_ eq 'ARRAY' ? $_ : [ $_ ] } $sql_maker->_order_by_chunks($attrs->{order_by})
677 my ($chunk, $is_desc) = $sql_maker->_split_order_chunk($order_chunks->[$o_idx][0]);
679 $new_order_by[$o_idx] = \[
680 sprintf( '%s( %s )%s',
681 ($is_desc ? 'MAX' : 'MIN'),
683 ($is_desc ? ' DESC' : ''),
685 @ {$order_chunks->[$o_idx]} [ 1 .. $#{$order_chunks->[$o_idx]} ]
690 $self->throw_exception ( sprintf
691 'Unable to programatically derive a required group_by from the supplied '
692 . 'order_by criteria. To proceed either add an explicit group_by, or '
693 . 'simplify your order_by to only include plain columns '
694 . '(supplied order_by: %s)',
695 join ', ', map { "'$_'" } @$leftovers,
698 # recreate the untouched order parts
700 $new_order_by[$_] ||= \ $order_chunks->[$_] for ( 0 .. $#$order_chunks );
705 (@new_order_by ? \@new_order_by : $attrs->{order_by} ), # same ref as original == unchanged
709 sub _resolve_ident_sources {
710 my ($self, $ident) = @_;
712 my $alias2source = {};
714 # the reason this is so contrived is that $ident may be a {from}
715 # structure, specifying multiple tables to join
716 if ( blessed $ident && $ident->isa("DBIx::Class::ResultSource") ) {
717 # this is compat mode for insert/update/delete which do not deal with aliases
718 $alias2source->{me} = $ident;
720 elsif (ref $ident eq 'ARRAY') {
724 if (ref $_ eq 'HASH') {
727 if (ref $_ eq 'ARRAY' and ref $_->[0] eq 'HASH') {
731 $alias2source->{$tabinfo->{-alias}} = $tabinfo->{-rsrc}
732 if ($tabinfo->{-rsrc});
736 return $alias2source;
739 # Takes $ident, \@column_names
741 # returns { $column_name => \%column_info, ... }
742 # also note: this adds -result_source => $rsrc to the column info
744 # If no columns_names are supplied returns info about *all* columns
746 sub _resolve_column_info {
747 my ($self, $ident, $colnames) = @_;
749 return {} if $colnames and ! @$colnames;
751 my $sources = $self->_resolve_ident_sources($ident);
753 $_ = { rsrc => $_, colinfos => $_->columns_info }
754 for values %$sources;
756 my (%seen_cols, @auto_colnames);
758 # compile a global list of column names, to be able to properly
759 # disambiguate unqualified column names (if at all possible)
760 for my $alias (keys %$sources) {
762 ++$seen_cols{$_}{$alias}
766 push @auto_colnames, "$alias.$_"
767 ) for keys %{ $sources->{$alias}{colinfos} };
772 ( grep { keys %{$seen_cols{$_}} == 1 } keys %seen_cols ),
777 my ($colname, $source_alias) = reverse split /\./, $_;
782 # if the column was seen exactly once - we know which rsrc it came from
786 keys %{$seen_cols{$colname}} == 1
788 ( %{$seen_cols{$colname}} )[0]
794 $self->throw_exception(
795 "No such column '$colname' on source " . $sources->{$assumed_alias}{rsrc}->source_name
796 ) unless $seen_cols{$colname}{$assumed_alias};
799 %{ $sources->{$assumed_alias}{colinfos}{$colname} },
800 -result_source => $sources->{$assumed_alias}{rsrc},
801 -source_alias => $assumed_alias,
802 -fq_colname => "$assumed_alias.$colname",
803 -colname => $colname,
806 $return{"$assumed_alias.$colname"} = $return{$_}
807 unless $source_alias;
813 # The DBIC relationship chaining implementation is pretty simple - every
814 # new related_relationship is pushed onto the {from} stack, and the {select}
815 # window simply slides further in. This means that when we count somewhere
816 # in the middle, we got to make sure that everything in the join chain is an
817 # actual inner join, otherwise the count will come back with unpredictable
818 # results (a resultset may be generated with _some_ rows regardless of if
819 # the relation which the $rs currently selects has rows or not). E.g.
820 # $artist_rs->cds->count - normally generates:
821 # SELECT COUNT( * ) FROM artist me LEFT JOIN cd cds ON cds.artist = me.artistid
822 # which actually returns the number of artists * (number of cds || 1)
824 # So what we do here is crawl {from}, determine if the current alias is at
825 # the top of the stack, and if not - make sure the chain is inner-joined down
828 sub _inner_join_to_node {
829 my ($self, $from, $alias) = @_;
831 my $switch_branch = $self->_find_join_path_to_node($from, $alias);
833 return $from unless @{$switch_branch||[]};
835 # So it looks like we will have to switch some stuff around.
836 # local() is useless here as we will be leaving the scope
837 # anyway, and deep cloning is just too fucking expensive
838 # So replace the first hashref in the node arrayref manually
839 my @new_from = ($from->[0]);
840 my $sw_idx = { map { (values %$_), 1 } @$switch_branch }; #there's one k/v per join-path
842 for my $j (@{$from}[1 .. $#$from]) {
843 my $jalias = $j->[0]{-alias};
845 if ($sw_idx->{$jalias}) {
846 my %attrs = %{$j->[0]};
847 delete $attrs{-join_type};
861 sub _find_join_path_to_node {
862 my ($self, $from, $target_alias) = @_;
864 # subqueries and other oddness are naturally not supported
868 ref $from->[0] ne 'HASH'
870 ! defined $from->[0]{-alias}
873 # no path - the head is the alias
874 return [] if $from->[0]{-alias} eq $target_alias;
876 for my $i (1 .. $#$from) {
877 return $from->[$i][0]{-join_path} if ( ($from->[$i][0]{-alias}||'') eq $target_alias );
880 # something else went quite wrong
884 sub _extract_order_criteria {
885 my ($self, $order_by, $sql_maker) = @_;
888 my ($sql_maker, $order_by, $orig_quote_chars) = @_;
890 return scalar $sql_maker->_order_by_chunks ($order_by)
893 my ($lq, $rq, $sep) = map { quotemeta($_) } (
894 ($orig_quote_chars ? @$orig_quote_chars : $sql_maker->_quote_chars),
899 for ($sql_maker->_order_by_chunks ($order_by) ) {
900 my $chunk = ref $_ ? [ @$_ ] : [ $_ ];
901 ($chunk->[0]) = $sql_maker->_split_order_chunk($chunk->[0]);
903 # order criteria may have come back pre-quoted (literals and whatnot)
904 # this is fragile, but the best we can currently do
905 $chunk->[0] =~ s/^ $lq (.+?) $rq $sep $lq (.+?) $rq $/"$1.$2"/xe
906 or $chunk->[0] =~ s/^ $lq (.+) $rq $/$1/x;
908 push @chunks, $chunk;
915 return $parser->($sql_maker, $order_by);
918 $sql_maker = $self->sql_maker;
920 # pass these in to deal with literals coming from
921 # the user or the deep guts of prefetch
922 my $orig_quote_chars = [$sql_maker->_quote_chars];
924 local $sql_maker->{quote_char};
925 return $parser->($sql_maker, $order_by, $orig_quote_chars);
929 sub _order_by_is_stable {
930 my ($self, $ident, $order_by, $where) = @_;
933 ( map { $_->[0] } $self->_extract_order_criteria($order_by) ),
934 ( $where ? keys %{ $self->_extract_fixed_condition_columns($where) } : () ),
937 my $colinfo = $self->_resolve_column_info($ident, \@cols);
939 return keys %$colinfo
940 ? $self->_columns_comprise_identifying_set( $colinfo, \@cols )
945 sub _columns_comprise_identifying_set {
946 my ($self, $colinfo, $columns) = @_;
949 $cols_per_src -> {$_->{-source_alias}} -> {$_->{-colname}} = $_
950 for grep { defined $_ } @{$colinfo}{@$columns};
952 for (values %$cols_per_src) {
953 my $src = (values %$_)[0]->{-result_source};
954 return 1 if $src->_identifying_column_set($_);
960 # this is almost similar to _order_by_is_stable, except it takes
961 # a single rsrc, and will succeed only if the first portion of the order
963 # returns that portion as a colinfo hashref on success
964 sub _extract_colinfo_of_stable_main_source_order_by_portion {
965 my ($self, $attrs) = @_;
967 my $nodes = $self->_find_join_path_to_node($attrs->{from}, $attrs->{alias});
969 return unless defined $nodes;
973 ( $self->_extract_order_criteria($attrs->{order_by}) )
975 return unless @ord_cols;
977 my $valid_aliases = { map { $_ => 1 } (
978 $attrs->{from}[0]{-alias},
979 map { values %$_ } @$nodes,
982 my $colinfos = $self->_resolve_column_info($attrs->{from});
984 my ($colinfos_to_return, $seen_main_src_cols);
986 for my $col (@ord_cols) {
987 # if order criteria is unresolvable - there is nothing we can do
988 my $colinfo = $colinfos->{$col} or last;
990 # if we reached the end of the allowed aliases - also nothing we can do
991 last unless $valid_aliases->{$colinfo->{-source_alias}};
993 $colinfos_to_return->{$col} = $colinfo;
995 $seen_main_src_cols->{$colinfo->{-colname}} = 1
996 if $colinfo->{-source_alias} eq $attrs->{alias};
999 # FIXME the condition may be singling out things on its own, so we
1000 # conceivable could come back wi "stable-ordered by nothing"
1001 # not confient enough in the parser yet, so punt for the time being
1002 return unless $seen_main_src_cols;
1004 my $main_src_fixed_cols_from_cond = [ $attrs->{where}
1008 ( $colinfos->{$_} and $colinfos->{$_}{-source_alias} eq $attrs->{alias} )
1009 ? $colinfos->{$_}{-colname}
1012 keys %{ $self->_extract_fixed_condition_columns($attrs->{where}) }
1017 return $attrs->{result_source}->_identifying_column_set([
1018 keys %$seen_main_src_cols,
1019 @$main_src_fixed_cols_from_cond,
1020 ]) ? $colinfos_to_return : ();
1023 # Attempts to flatten a passed in SQLA condition as much as possible towards
1024 # a plain hashref, *without* altering its semantics. Required by
1025 # create/populate being able to extract definitive conditions from preexisting
1026 # resultset {where} stacks
1028 # FIXME - while relatively robust, this is still imperfect, one of the first
1029 # things to tackle with DQ
1030 sub _collapse_cond {
1031 my ($self, $where, $where_is_anded_array) = @_;
1038 elsif ($where_is_anded_array or ref $where eq 'HASH') {
1042 my @pieces = $where_is_anded_array ? @$where : $where;
1044 my $chunk = shift @pieces;
1046 if (ref $chunk eq 'HASH') {
1047 for (sort keys %$chunk) {
1049 # Match SQLA 1.79 behavior
1051 is_literal_value($chunk->{$_})
1052 ? carp 'Hash-pairs consisting of an empty string with a literal are deprecated, use -and => [ $literal ] instead'
1053 : $self->throw_exception("Supplying an empty left hand side argument is not supported in hash-pairs")
1057 push @pairs, $_ => $chunk->{$_};
1060 elsif (ref $chunk eq 'ARRAY') {
1061 push @pairs, -or => $chunk
1064 elsif ( ! length ref $chunk) {
1066 # Match SQLA 1.79 behavior
1067 $self->throw_exception("Supplying an empty left hand side argument is not supported in array-pairs")
1068 if $where_is_anded_array and (! defined $chunk or $chunk eq '');
1070 push @pairs, $chunk, shift @pieces;
1073 push @pairs, '', $chunk;
1077 return unless @pairs;
1079 my @conds = $self->_collapse_cond_unroll_pairs(\@pairs)
1082 # Consolidate various @conds back into something more compact
1083 for my $c (@conds) {
1084 if (ref $c ne 'HASH') {
1085 push @{$fin->{-and}}, $c;
1088 for my $col (sort keys %$c) {
1090 # consolidate all -and nodes
1091 if ($col =~ /^\-and$/i) {
1092 push @{$fin->{-and}},
1093 ref $c->{$col} eq 'ARRAY' ? @{$c->{$col}}
1094 : ref $c->{$col} eq 'HASH' ? %{$c->{$col}}
1095 : { $col => $c->{$col} }
1098 elsif ($col =~ /^\-/) {
1099 push @{$fin->{-and}}, { $col => $c->{$col} };
1101 elsif (exists $fin->{$col}) {
1102 $fin->{$col} = [ -and => map {
1103 (ref $_ eq 'ARRAY' and ($_->[0]||'') =~ /^\-and$/i )
1107 } ($fin->{$col}, $c->{$col}) ];
1110 $fin->{$col} = $c->{$col};
1116 elsif (ref $where eq 'ARRAY') {
1117 # we are always at top-level here, it is safe to dump empty *standalone* pieces
1120 for (my $i = 0; $i <= $#$where; $i++ ) {
1122 # Match SQLA 1.79 behavior
1123 $self->throw_exception(
1124 "Supplying an empty left hand side argument is not supported in array-pairs"
1125 ) if (! defined $where->[$i] or ! length $where->[$i]);
1127 my $logic_mod = lc ( ($where->[$i] =~ /^(\-(?:and|or))$/i)[0] || '' );
1131 $self->throw_exception("Unsupported top-level op/arg pair: [ $logic_mod => $where->[$i] ]")
1132 unless ref $where->[$i] eq 'HASH' or ref $where->[$i] eq 'ARRAY';
1134 my $sub_elt = $self->_collapse_cond({ $logic_mod => $where->[$i] })
1137 my @keys = keys %$sub_elt;
1138 if ( @keys == 1 and $keys[0] !~ /^\-/ ) {
1139 $fin_idx->{ "COL_$keys[0]_" . serialize $sub_elt } = $sub_elt;
1142 $fin_idx->{ "SER_" . serialize $sub_elt } = $sub_elt;
1145 elsif (! length ref $where->[$i] ) {
1146 my $sub_elt = $self->_collapse_cond({ @{$where}[$i, $i+1] })
1149 $fin_idx->{ "COL_$where->[$i]_" . serialize $sub_elt } = $sub_elt;
1153 $fin_idx->{ "SER_" . serialize $where->[$i] } = $self->_collapse_cond( $where->[$i] ) || next;
1160 elsif ( keys %$fin_idx == 1 ) {
1161 $fin = (values %$fin_idx)[0];
1166 # at this point everything is at most one level deep - unroll if needed
1167 for (sort keys %$fin_idx) {
1168 if ( ref $fin_idx->{$_} eq 'HASH' and keys %{$fin_idx->{$_}} == 1 ) {
1169 my ($l, $r) = %{$fin_idx->{$_}};
1175 ( @$r == 1 and $l =~ /^\-and$/i )
1188 $l =~ /^\-(?:and|or)$/i
1198 push @or, $fin_idx->{$_};
1206 # not a hash not an array
1207 $fin = { -and => [ $where ] };
1210 # unroll single-element -and's
1216 my $and = delete $fin->{-and};
1219 # at this point we have @$and == 1
1221 ref $and->[0] eq 'HASH'
1223 ! grep { exists $fin->{$_} } keys %{$and->[0]}
1230 $fin->{-and} = $and;
1235 # compress same-column conds found in $fin
1236 for my $col ( grep { $_ !~ /^\-/ } keys %$fin ) {
1237 next unless ref $fin->{$col} eq 'ARRAY' and ($fin->{$col}[0]||'') =~ /^\-and$/i;
1238 my $val_bag = { map {
1239 (! defined $_ ) ? ( UNDEF => undef )
1240 : ( ! length ref $_ or is_plain_value $_ ) ? ( "VAL_$_" => $_ )
1241 : ( ( 'SER_' . serialize $_ ) => $_ )
1242 } @{$fin->{$col}}[1 .. $#{$fin->{$col}}] };
1244 if (keys %$val_bag == 1 ) {
1245 ($fin->{$col}) = values %$val_bag;
1248 $fin->{$col} = [ -and => map { $val_bag->{$_} } sort keys %$val_bag ];
1252 return keys %$fin ? $fin : ();
1255 sub _collapse_cond_unroll_pairs {
1256 my ($self, $pairs) = @_;
1261 my ($lhs, $rhs) = splice @$pairs, 0, 2;
1264 push @conds, $self->_collapse_cond($rhs);
1266 elsif ( $lhs =~ /^\-and$/i ) {
1267 push @conds, $self->_collapse_cond($rhs, (ref $rhs eq 'ARRAY'));
1269 elsif ( $lhs =~ /^\-or$/i ) {
1270 push @conds, $self->_collapse_cond(
1271 (ref $rhs eq 'HASH') ? [ map { $_ => $rhs->{$_} } sort keys %$rhs ] : $rhs
1275 if (ref $rhs eq 'HASH' and ! keys %$rhs) {
1276 # FIXME - SQLA seems to be doing... nothing...?
1278 # normalize top level -ident, for saner extract_fixed_condition_columns code
1279 elsif (ref $rhs eq 'HASH' and keys %$rhs == 1 and exists $rhs->{-ident}) {
1280 push @conds, { $lhs => { '=', $rhs } };
1282 elsif (ref $rhs eq 'HASH' and keys %$rhs == 1 and exists $rhs->{-value} and is_plain_value $rhs->{-value}) {
1283 push @conds, { $lhs => $rhs->{-value} };
1285 elsif (ref $rhs eq 'HASH' and keys %$rhs == 1 and exists $rhs->{'='}) {
1286 if ( length ref $rhs->{'='} and is_literal_value $rhs->{'='} ) {
1287 push @conds, { $lhs => $rhs };
1290 for my $p ($self->_collapse_cond_unroll_pairs([ $lhs => $rhs->{'='} ])) {
1292 # extra sanity check
1294 require Data::Dumper::Concise;
1295 local $Data::Dumper::Deepcopy = 1;
1296 $self->throw_exception(
1297 "Internal error: unexpected collapse unroll:"
1298 . Data::Dumper::Concise::Dumper { in => { $lhs => $rhs }, out => $p }
1307 # the unroller recursion may return a '=' prepended value already
1308 ref $r eq 'HASH' and keys %$rhs == 1 and exists $rhs->{'='}
1313 : { $l => { '=' => $r } }
1318 elsif (ref $rhs eq 'ARRAY') {
1319 # some of these conditionals encounter multi-values - roll them out using
1320 # an unshift, which will cause extra looping in the while{} above
1322 push @conds, { $lhs => [] };
1324 elsif ( ($rhs->[0]||'') =~ /^\-(?:and|or)$/i ) {
1325 $self->throw_exception("Value modifier not followed by any values: $lhs => [ $rhs->[0] ] ")
1328 if( $rhs->[0] =~ /^\-and$/i ) {
1329 unshift @$pairs, map { $lhs => $_ } @{$rhs}[1..$#$rhs];
1331 # if not an AND then it's an OR
1333 unshift @$pairs, $lhs => $rhs->[1];
1336 push @conds, { $lhs => [ @{$rhs}[1..$#$rhs] ] };
1339 elsif (@$rhs == 1) {
1340 unshift @$pairs, $lhs => $rhs->[0];
1343 push @conds, { $lhs => $rhs };
1346 # unroll func + { -value => ... }
1350 ( my ($subop) = keys %$rhs ) == 1
1352 length ref ((values %$rhs)[0])
1354 my $vref = is_plain_value( (values %$rhs)[0] )
1356 push @conds, { $lhs => { $subop => $$vref } }
1359 push @conds, { $lhs => $rhs };
1367 # Analyzes a given condition and attempts to extract all columns
1368 # with a definitive fixed-condition criteria. Returns a hashref
1369 # of k/v pairs suitable to be passed to set_columns(), with a
1370 # MAJOR CAVEAT - multi-value (contradictory) equalities are still
1371 # represented as a reference to the UNRESOVABLE_CONDITION constant
1372 # The reason we do this is that some codepaths only care about the
1373 # codition being stable, as opposed to actually making sense
1375 # The normal mode is used to figure out if a resultset is constrained
1376 # to a column which is part of a unique constraint, which in turn
1377 # allows us to better predict how ordering will behave etc.
1379 # With the optional "consider_nulls" boolean argument, the function
1380 # is instead used to infer inambiguous values from conditions
1381 # (e.g. the inheritance of resultset conditions on new_result)
1383 sub _extract_fixed_condition_columns {
1384 my ($self, $where, $consider_nulls) = @_;
1385 my $where_hash = $self->_collapse_cond($_[1]);
1389 for $c (keys %$where_hash) {
1392 if (!defined ($v = $where_hash->{$c}) ) {
1393 $vals->{UNDEF} = $v if $consider_nulls
1400 if (exists $v->{-value}) {
1401 if (defined $v->{-value}) {
1402 $vals->{"VAL_$v->{-value}"} = $v->{-value}
1404 elsif( $consider_nulls ) {
1405 $vals->{UNDEF} = $v->{-value};
1408 # do not need to check for plain values - _collapse_cond did it for us
1410 length ref $v->{'='}
1413 ( ref $v->{'='} eq 'HASH' and keys %{$v->{'='}} == 1 and exists $v->{'='}{-ident} )
1415 is_literal_value($v->{'='})
1418 $vals->{ 'SER_' . serialize $v->{'='} } = $v->{'='};
1426 $vals->{"VAL_$v"} = $v;
1428 elsif (ref $v eq 'ARRAY' and ($v->[0]||'') eq '-and') {
1429 for ( @{$v}[1..$#$v] ) {
1430 my $subval = $self->_extract_fixed_condition_columns({ $c => $_ }, 'consider nulls'); # always fish nulls out on recursion
1431 next unless exists $subval->{$c}; # didn't find anything
1433 ! defined $subval->{$c} ? 'UNDEF'
1434 : ( ! length ref $subval->{$c} or is_plain_value $subval->{$c} ) ? "VAL_$subval->{$c}"
1435 : ( 'SER_' . serialize $subval->{$c} )
1440 if (keys %$vals == 1) {
1441 ($res->{$c}) = (values %$vals)
1442 unless !$consider_nulls and exists $vals->{UNDEF};
1444 elsif (keys %$vals > 1) {
1445 $res->{$c} = UNRESOLVABLE_CONDITION;