Commit | Line | Data |
c443438f |
1 | package #hide from PAUSE |
2 | DBIx::Class::Storage::DBIHacks; |
d28bb90d |
3 | |
4 | # |
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 |
6a6394f1 |
7 | # display. The arrival of SQLA2 should immediately obsolete 90% of this |
d28bb90d |
8 | # |
9 | |
10 | use strict; |
11 | use warnings; |
12 | |
13 | use base 'DBIx::Class::Storage'; |
14 | use mro 'c3'; |
15 | |
6298a324 |
16 | use List::Util 'first'; |
17 | use Scalar::Util 'blessed'; |
ea5c7509 |
18 | use Sub::Name 'subname'; |
3441a9cc |
19 | use Data::Query::Constants; |
10cef607 |
20 | use Data::Query::ExprHelpers; |
6298a324 |
21 | use namespace::clean; |
d28bb90d |
22 | |
23 | # |
052e8431 |
24 | # This code will remove non-selecting/non-restricting joins from |
4b1b5ea3 |
25 | # {from} specs, aiding the RDBMS query optimizer |
052e8431 |
26 | # |
27 | sub _prune_unused_joins { |
e1861c2c |
28 | my ($self, $attrs) = @_; |
052e8431 |
29 | |
e1861c2c |
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' |
33 | and |
34 | @{$attrs->{from}} > 1 |
35 | and |
36 | ref $attrs->{from}[0] eq 'HASH' |
37 | and |
38 | ref $attrs->{from}[1] eq 'ARRAY' |
39 | and |
40 | $self->_use_join_optimizer |
41 | ); |
ea95892e |
42 | |
eb58c082 |
43 | my $orig_aliastypes = $self->_resolve_aliastypes_from_select_args($attrs); |
052e8431 |
44 | |
eb58c082 |
45 | my $new_aliastypes = { %$orig_aliastypes }; |
4b1b5ea3 |
46 | |
eb58c082 |
47 | # we will be recreating this entirely |
48 | my @reclassify = 'joining'; |
97e130fa |
49 | |
4b1b5ea3 |
50 | # a grouped set will not be affected by amount of rows. Thus any |
eb58c082 |
51 | # purely multiplicator classifications can go |
52 | # (will be reintroduced below if needed by something else) |
53 | push @reclassify, qw(multiplying premultiplied) |
437a9cfa |
54 | if $attrs->{_force_prune_multiplying_joins} or $attrs->{group_by}; |
4b1b5ea3 |
55 | |
eb58c082 |
56 | # nuke what will be recalculated |
57 | delete @{$new_aliastypes}{@reclassify}; |
052e8431 |
58 | |
e1861c2c |
59 | my @newfrom = $attrs->{from}[0]; # FROM head is always present |
97e130fa |
60 | |
eb58c082 |
61 | # recalculate what we need once the multipliers are potentially gone |
62 | # ignore premultiplies, since they do not add any value to anything |
a4812caa |
63 | my %need_joins; |
eb58c082 |
64 | for ( @{$new_aliastypes}{grep { $_ ne 'premultiplied' } keys %$new_aliastypes }) { |
a4812caa |
65 | # add all requested aliases |
66 | $need_joins{$_} = 1 for keys %$_; |
67 | |
68 | # add all their parents (as per joinpath which is an AoH { table => alias }) |
97e130fa |
69 | $need_joins{$_} = 1 for map { values %$_ } map { @{$_->{-parents}} } values %$_; |
a4812caa |
70 | } |
97e130fa |
71 | |
e1861c2c |
72 | for my $j (@{$attrs->{from}}[1..$#{$attrs->{from}}]) { |
539ffe87 |
73 | push @newfrom, $j if ( |
a6ef93cb |
74 | (! defined $j->[0]{-alias}) # legacy crap |
539ffe87 |
75 | || |
76 | $need_joins{$j->[0]{-alias}} |
77 | ); |
052e8431 |
78 | } |
79 | |
eb58c082 |
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}} |
86 | } |
87 | } |
88 | |
89 | return ( \@newfrom, $new_aliastypes ); |
052e8431 |
90 | } |
91 | |
052e8431 |
92 | # |
d28bb90d |
93 | # This is the code producing joined subqueries like: |
8273e845 |
94 | # SELECT me.*, other.* FROM ( SELECT me.* FROM ... ) JOIN other ON ... |
d28bb90d |
95 | # |
96 | sub _adjust_select_args_for_complex_prefetch { |
e1861c2c |
97 | my ($self, $attrs) = @_; |
d28bb90d |
98 | |
e1861c2c |
99 | $self->throw_exception ('Complex prefetches are not supported on resultsets with a custom from attribute') unless ( |
100 | ref $attrs->{from} eq 'ARRAY' |
101 | and |
102 | @{$attrs->{from}} > 1 |
103 | and |
104 | ref $attrs->{from}[0] eq 'HASH' |
105 | and |
106 | ref $attrs->{from}[1] eq 'ARRAY' |
107 | ); |
d28bb90d |
108 | |
1e4f9fb3 |
109 | my $root_alias = $attrs->{alias}; |
110 | |
d28bb90d |
111 | # generate inner/outer attribute lists, remove stuff that doesn't apply |
112 | my $outer_attrs = { %$attrs }; |
e1861c2c |
113 | delete @{$outer_attrs}{qw(from bind rows offset group_by _grouped_by_distinct having)}; |
d28bb90d |
114 | |
186ba34c |
115 | my $inner_attrs = { %$attrs }; |
e1861c2c |
116 | delete @{$inner_attrs}{qw(for collapse select as _related_results_construction)}; |
d28bb90d |
117 | |
4df1400e |
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} |
121 | or |
122 | ! $inner_attrs->{rows} |
123 | ); |
946f6260 |
124 | |
d28bb90d |
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 |
e1861c2c |
128 | $outer_attrs->{select} = [ @{$attrs->{select}} ]; |
36fd7f07 |
129 | |
97e130fa |
130 | my ($root_node, $root_node_offset); |
27e0370d |
131 | |
e1861c2c |
132 | for my $i (0 .. $#{$inner_attrs->{from}}) { |
133 | my $node = $inner_attrs->{from}[$i]; |
27e0370d |
134 | my $h = (ref $node eq 'HASH') ? $node |
135 | : (ref $node eq 'ARRAY' and ref $node->[0] eq 'HASH') ? $node->[0] |
136 | : next |
137 | ; |
138 | |
1e4f9fb3 |
139 | if ( ($h->{-alias}||'') eq $root_alias and $h->{-rsrc} ) { |
97e130fa |
140 | $root_node = $h; |
141 | $root_node_offset = $i; |
27e0370d |
142 | last; |
143 | } |
144 | } |
145 | |
146 | $self->throw_exception ('Complex prefetches are not supported on resultsets with a custom from attribute') |
97e130fa |
147 | unless $root_node; |
27e0370d |
148 | |
149 | # use the heavy duty resolver to take care of aliased/nonaliased naming |
e1861c2c |
150 | my $colinfo = $self->_resolve_column_info($inner_attrs->{from}); |
27e0370d |
151 | my $selected_root_columns; |
152 | |
e1861c2c |
153 | for my $i (0 .. $#{$outer_attrs->{select}}) { |
154 | my $sel = $outer_attrs->{select}->[$i]; |
d28bb90d |
155 | |
1e4f9fb3 |
156 | next if ( |
157 | $colinfo->{$sel} and $colinfo->{$sel}{-source_alias} ne $root_alias |
158 | ); |
159 | |
d28bb90d |
160 | if (ref $sel eq 'HASH' ) { |
161 | $sel->{-as} ||= $attrs->{as}[$i]; |
e1861c2c |
162 | $outer_attrs->{select}->[$i] = join ('.', $root_alias, ($sel->{-as} || "inner_column_$i") ); |
d28bb90d |
163 | } |
27e0370d |
164 | elsif (! ref $sel and my $ci = $colinfo->{$sel}) { |
165 | $selected_root_columns->{$ci->{-colname}} = 1; |
166 | } |
d28bb90d |
167 | |
e1861c2c |
168 | push @{$inner_attrs->{select}}, $sel; |
bb9bffea |
169 | |
170 | push @{$inner_attrs->{as}}, $attrs->{as}[$i]; |
d28bb90d |
171 | } |
172 | |
97e130fa |
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 |
e1861c2c |
175 | # preserved outside), or wheres. In other words everything but the inner |
176 | # selector |
97e130fa |
177 | # We can not just fetch everything because a potential has_many restricting |
178 | # join collapse *will not work* on heavy data types. |
e1861c2c |
179 | my $connecting_aliastypes = $self->_resolve_aliastypes_from_select_args({ |
180 | %$inner_attrs, |
b3577eae |
181 | select => undef, |
e1861c2c |
182 | }); |
97e130fa |
183 | |
184 | for (sort map { keys %{$_->{-seen_columns}||{}} } map { values %$_ } values %$connecting_aliastypes) { |
185 | my $ci = $colinfo->{$_} or next; |
186 | if ( |
1e4f9fb3 |
187 | $ci->{-source_alias} eq $root_alias |
97e130fa |
188 | and |
189 | ! $selected_root_columns->{$ci->{-colname}}++ |
190 | ) { |
191 | # adding it to both to keep limits not supporting dark selectors happy |
e1861c2c |
192 | push @{$inner_attrs->{select}}, $ci->{-fq_colname}; |
97e130fa |
193 | push @{$inner_attrs->{as}}, $ci->{-fq_colname}; |
27e0370d |
194 | } |
195 | } |
196 | |
e1861c2c |
197 | # construct the inner {from} and lock it in a subquery |
48580715 |
198 | # we need to prune first, because this will determine if we need a group_by below |
97e130fa |
199 | # throw away all non-selecting, non-restricting multijoins |
eb58c082 |
200 | # (since we def. do not care about multiplication of the contents of the subquery) |
6395604e |
201 | my $inner_subq = do { |
ea95892e |
202 | |
eb58c082 |
203 | # must use it here regardless of user requests (vastly gentler on optimizer) |
ea95892e |
204 | local $self->{_use_join_optimizer} = 1; |
205 | |
97e130fa |
206 | # throw away multijoins since we def. do not care about those inside the subquery |
e1861c2c |
207 | ($inner_attrs->{from}, my $inner_aliastypes) = $self->_prune_unused_joins ({ |
437a9cfa |
208 | %$inner_attrs, _force_prune_multiplying_joins => 1 |
209 | }); |
ea95892e |
210 | |
eb58c082 |
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 |
0a3441ee |
213 | if ( |
eb58c082 |
214 | grep { $_ ne $root_alias } keys %{ $inner_aliastypes->{multiplying} || {} } |
1e4f9fb3 |
215 | and |
560978e2 |
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} ) |
0a3441ee |
218 | ) { |
1e4f9fb3 |
219 | |
eb58c082 |
220 | my $cur_sel = { map { $_ => 1 } @{$inner_attrs->{select}} }; |
1e4f9fb3 |
221 | |
eb58c082 |
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 |
224 | # things properly |
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, |
e1861c2c |
230 | ); |
eb58c082 |
231 | for my $col (@pks) { |
232 | push @{ $inner_select_with_extras ||= [ @{$inner_attrs->{select}} ] }, $col |
233 | unless $cur_sel->{$col}++; |
1e4f9fb3 |
234 | } |
4ba07d6e |
235 | |
eb58c082 |
236 | ($inner_attrs->{group_by}, $inner_attrs->{order_by}) = $self->_group_over_selection({ |
237 | %$inner_attrs, |
238 | $inner_select_with_extras ? ( select => $inner_select_with_extras ) : (), |
239 | _aliastypes => $inner_aliastypes, |
240 | }); |
0a3441ee |
241 | } |
d28bb90d |
242 | |
e1861c2c |
243 | # we already optimized $inner_attrs->{from} above |
97e130fa |
244 | # and already local()ized |
245 | $self->{_use_join_optimizer} = 0; |
d28bb90d |
246 | |
ea95892e |
247 | # generate the subquery |
6395604e |
248 | $self->_select_args_to_query ( |
e1861c2c |
249 | @{$inner_attrs}{qw(from select where)}, |
ea95892e |
250 | $inner_attrs, |
251 | ); |
d28bb90d |
252 | }; |
253 | |
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. |
258 | # |
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 |
263 | |
27e0370d |
264 | # work on a shallow copy |
e1861c2c |
265 | my @orig_from = @{$attrs->{from}}; |
052e8431 |
266 | |
052e8431 |
267 | |
e1861c2c |
268 | $outer_attrs->{from} = \ my @outer_from; |
53c29913 |
269 | |
27e0370d |
270 | # we may not be the head |
97e130fa |
271 | if ($root_node_offset) { |
e1861c2c |
272 | # first generate the outer_from, up to the substitution point |
273 | @outer_from = splice @orig_from, 0, $root_node_offset; |
27e0370d |
274 | |
e1861c2c |
275 | # substitute the subq at the right spot |
27e0370d |
276 | push @outer_from, [ |
277 | { |
1e4f9fb3 |
278 | -alias => $root_alias, |
97e130fa |
279 | -rsrc => $root_node->{-rsrc}, |
1e4f9fb3 |
280 | $root_alias => $inner_subq, |
27e0370d |
281 | }, |
e1861c2c |
282 | # preserve attrs from what is now the head of the from after the splice |
283 | @{$orig_from[0]}[1 .. $#{$orig_from[0]}], |
27e0370d |
284 | ]; |
285 | } |
286 | else { |
27e0370d |
287 | @outer_from = { |
1e4f9fb3 |
288 | -alias => $root_alias, |
27e0370d |
289 | -rsrc => $root_node->{-rsrc}, |
1e4f9fb3 |
290 | $root_alias => $inner_subq, |
27e0370d |
291 | }; |
d28bb90d |
292 | } |
293 | |
e1861c2c |
294 | shift @orig_from; # what we just replaced above |
97e130fa |
295 | |
ea95892e |
296 | # scan the *remaining* from spec against different attributes, and see which joins are needed |
052e8431 |
297 | # in what role |
975b573a |
298 | my $outer_aliastypes = $outer_attrs->{_aliastypes} = |
e1861c2c |
299 | $self->_resolve_aliastypes_from_select_args({ %$outer_attrs, from => \@orig_from }); |
052e8431 |
300 | |
a4812caa |
301 | # unroll parents |
1e4f9fb3 |
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/; |
a4812caa |
305 | |
d28bb90d |
306 | # see what's left - throw away if not selecting/restricting |
eb58c082 |
307 | my $may_need_outer_group_by; |
e1861c2c |
308 | while (my $j = shift @orig_from) { |
d28bb90d |
309 | my $alias = $j->[0]{-alias}; |
310 | |
a4812caa |
311 | if ( |
312 | $outer_select_chain->{$alias} |
313 | ) { |
314 | push @outer_from, $j |
d28bb90d |
315 | } |
1e4f9fb3 |
316 | elsif (first { $_->{$alias} } @outer_nonselecting_chains ) { |
d28bb90d |
317 | push @outer_from, $j; |
eb58c082 |
318 | $may_need_outer_group_by ||= $outer_aliastypes->{multiplying}{$alias} ? 1 : 0; |
d28bb90d |
319 | } |
320 | } |
321 | |
eb58c082 |
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 ({ |
560978e2 |
328 | %$outer_attrs, |
329 | from => \@outer_from, |
560978e2 |
330 | }); |
36fd7f07 |
331 | } |
332 | |
e1861c2c |
333 | # This is totally horrific - the {where} ends up in both the inner and outer query |
d28bb90d |
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 |
4a0eed52 |
337 | # the outer select to exclude joins you didn't want in the first place |
d28bb90d |
338 | # |
339 | # OTOH it can be seen as a plus: <ash> (notes that this query would make a DBA cry ;) |
e1861c2c |
340 | return $outer_attrs; |
d28bb90d |
341 | } |
342 | |
1a736efb |
343 | # |
344 | # I KNOW THIS SUCKS! GET SQLA2 OUT THE DOOR SO THIS CAN DIE! |
345 | # |
ad630f4b |
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 |
4a0eed52 |
348 | # aliases are needed to fulfill the query. This information is used |
ad630f4b |
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 |
1a736efb |
352 | # happen is for it to fail due to some scalar SQL, which in turn will |
353 | # result in a vocal exception. |
539ffe87 |
354 | sub _resolve_aliastypes_from_select_args { |
e1861c2c |
355 | my ( $self, $attrs ) = @_; |
546f1cd9 |
356 | |
ad630f4b |
357 | $self->throw_exception ('Unable to analyze custom {from}') |
e1861c2c |
358 | if ref $attrs->{from} ne 'ARRAY'; |
546f1cd9 |
359 | |
ad630f4b |
360 | # what we will return |
964a3c71 |
361 | my $aliases_by_type; |
546f1cd9 |
362 | |
ad630f4b |
363 | # see what aliases are there to work with |
eb58c082 |
364 | # and record who is a multiplier and who is premultiplied |
ad630f4b |
365 | my $alias_list; |
e1861c2c |
366 | for my $node (@{$attrs->{from}}) { |
367 | |
368 | my $j = $node; |
ad630f4b |
369 | $j = $j->[0] if ref $j eq 'ARRAY'; |
539ffe87 |
370 | my $al = $j->{-alias} |
371 | or next; |
372 | |
373 | $alias_list->{$al} = $j; |
eb58c082 |
374 | |
375 | $aliases_by_type->{multiplying}{$al} ||= { -parents => $j->{-join_path}||[] } |
a4812caa |
376 | # not array == {from} head == can't be multiplying |
eb58c082 |
377 | if ref($node) eq 'ARRAY' and ! $j->{-is_single}; |
378 | |
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}{$_} } |
382 | grep { $_ ne $al } |
383 | map { values %$_ } |
384 | @{ $j->{-join_path}||[] } |
546f1cd9 |
385 | } |
546f1cd9 |
386 | |
318e3d94 |
387 | # get a column to source/alias map (including unambiguous unqualified ones) |
e1861c2c |
388 | my $colinfo = $self->_resolve_column_info ($attrs->{from}); |
1a736efb |
389 | |
ad630f4b |
390 | # set up a botched SQLA |
391 | my $sql_maker = $self->sql_maker; |
07f31d19 |
392 | |
4c2b30d6 |
393 | # these are throw away results, do not pollute the bind stack |
4c2b30d6 |
394 | local $sql_maker->{select_bind}; |
0542ec57 |
395 | local $sql_maker->{where_bind}; |
396 | local $sql_maker->{group_bind}; |
397 | local $sql_maker->{having_bind}; |
97e130fa |
398 | local $sql_maker->{from_bind}; |
3f5b99fe |
399 | |
400 | # we can't scan properly without any quoting (\b doesn't cut it |
401 | # everywhere), so unless there is proper quoting set - use our |
402 | # own weird impossible character. |
403 | # Also in the case of no quoting, we need to explicitly disable |
404 | # name_sep, otherwise sorry nasty legacy syntax like |
405 | # { 'count(foo.id)' => { '>' => 3 } } will stop working >:( |
406 | local $sql_maker->{quote_char} = $sql_maker->{quote_char}; |
407 | local $sql_maker->{name_sep} = $sql_maker->{name_sep}; |
408 | |
409 | unless (defined $sql_maker->{quote_char} and length $sql_maker->{quote_char}) { |
e493ecb2 |
410 | $sql_maker->{quote_char} = ["\x00", "\xFF"]; |
411 | # if we don't unset it we screw up retarded but unfortunately working |
412 | # 'MAX(foo.bar)' => { '>', 3 } |
3f5b99fe |
413 | $sql_maker->{name_sep} = ''; |
414 | } |
415 | |
a14cff97 |
416 | # delete local is 5.12+ |
417 | local @{$sql_maker}{qw(renderer converter)}; |
418 | delete @{$sql_maker}{qw(renderer converter)}; |
3e8c3d50 |
419 | |
3f5b99fe |
420 | my ($lquote, $rquote, $sep) = map { quotemeta $_ } ($sql_maker->_quote_chars, $sql_maker->name_sep); |
07f31d19 |
421 | |
1a736efb |
422 | # generate sql chunks |
423 | my $to_scan = { |
424 | restricting => [ |
b3577eae |
425 | ($attrs->{where} |
426 | ? ($sql_maker->_recurse_where($attrs->{where}))[0] |
1b8f2dd9 |
427 | : () |
428 | ), |
429 | ($attrs->{having} |
430 | ? ($sql_maker->_recurse_where($attrs->{having}))[0] |
431 | : () |
432 | ), |
1e4f9fb3 |
433 | ], |
434 | grouping => [ |
1b8f2dd9 |
435 | ($attrs->{group_by} |
436 | ? ($sql_maker->_render_sqla(group_by => $attrs->{group_by}))[0] |
437 | : (), |
438 | ) |
1a736efb |
439 | ], |
97e130fa |
440 | joining => [ |
441 | $sql_maker->_recurse_from ( |
e1861c2c |
442 | ref $attrs->{from}[0] eq 'ARRAY' ? $attrs->{from}[0][0] : $attrs->{from}[0], |
443 | @{$attrs->{from}}[1 .. $#{$attrs->{from}}], |
97e130fa |
444 | ), |
445 | ], |
1a736efb |
446 | selecting => [ |
b3577eae |
447 | ($attrs->{select} |
448 | ? ($sql_maker->_render_sqla(select_select => $attrs->{select}))[0] |
df013eca |
449 | : ()), |
1e4f9fb3 |
450 | ], |
451 | ordering => [ |
452 | map { $_->[0] } $self->_extract_order_criteria ($attrs->{order_by}, $sql_maker), |
1a736efb |
453 | ], |
454 | }; |
07f31d19 |
455 | |
1a736efb |
456 | # throw away empty chunks |
457 | $_ = [ map { $_ || () } @$_ ] for values %$to_scan; |
07f31d19 |
458 | |
318e3d94 |
459 | # first see if we have any exact matches (qualified or unqualified) |
460 | for my $type (keys %$to_scan) { |
461 | for my $piece (@{$to_scan->{$type}}) { |
462 | if ($colinfo->{$piece} and my $alias = $colinfo->{$piece}{-source_alias}) { |
463 | $aliases_by_type->{$type}{$alias} ||= { -parents => $alias_list->{$alias}{-join_path}||[] }; |
464 | $aliases_by_type->{$type}{$alias}{-seen_columns}{$colinfo->{$piece}{-fq_colname}} = $piece; |
465 | } |
466 | } |
467 | } |
468 | |
469 | # now loop through all fully qualified columns and get the corresponding |
1a736efb |
470 | # alias (should work even if they are in scalarrefs) |
ad630f4b |
471 | for my $alias (keys %$alias_list) { |
1a736efb |
472 | my $al_re = qr/ |
97e130fa |
473 | $lquote $alias $rquote $sep (?: $lquote ([^$rquote]+) $rquote )? |
1a736efb |
474 | | |
97e130fa |
475 | \b $alias \. ([^\s\)\($rquote]+)? |
1a736efb |
476 | /x; |
477 | |
1a736efb |
478 | for my $type (keys %$to_scan) { |
479 | for my $piece (@{$to_scan->{$type}}) { |
97e130fa |
480 | if (my @matches = $piece =~ /$al_re/g) { |
481 | $aliases_by_type->{$type}{$alias} ||= { -parents => $alias_list->{$alias}{-join_path}||[] }; |
1e4f9fb3 |
482 | $aliases_by_type->{$type}{$alias}{-seen_columns}{"$alias.$_"} = "$alias.$_" |
97e130fa |
483 | for grep { defined $_ } @matches; |
484 | } |
1a736efb |
485 | } |
ad630f4b |
486 | } |
1a736efb |
487 | } |
488 | |
489 | # now loop through unqualified column names, and try to locate them within |
490 | # the chunks |
491 | for my $col (keys %$colinfo) { |
3f5b99fe |
492 | next if $col =~ / \. /x; # if column is qualified it was caught by the above |
1a736efb |
493 | |
97e130fa |
494 | my $col_re = qr/ $lquote ($col) $rquote /x; |
07f31d19 |
495 | |
1a736efb |
496 | for my $type (keys %$to_scan) { |
497 | for my $piece (@{$to_scan->{$type}}) { |
318e3d94 |
498 | if ( my @matches = $piece =~ /$col_re/g) { |
a4812caa |
499 | my $alias = $colinfo->{$col}{-source_alias}; |
97e130fa |
500 | $aliases_by_type->{$type}{$alias} ||= { -parents => $alias_list->{$alias}{-join_path}||[] }; |
1e4f9fb3 |
501 | $aliases_by_type->{$type}{$alias}{-seen_columns}{"$alias.$_"} = $_ |
97e130fa |
502 | for grep { defined $_ } @matches; |
a4812caa |
503 | } |
1a736efb |
504 | } |
07f31d19 |
505 | } |
506 | } |
507 | |
508 | # Add any non-left joins to the restriction list (such joins are indeed restrictions) |
ad630f4b |
509 | for my $j (values %$alias_list) { |
07f31d19 |
510 | my $alias = $j->{-alias} or next; |
97e130fa |
511 | $aliases_by_type->{restricting}{$alias} ||= { -parents => $j->{-join_path}||[] } if ( |
07f31d19 |
512 | (not $j->{-join_type}) |
513 | or |
514 | ($j->{-join_type} !~ /^left (?: \s+ outer)? $/xi) |
515 | ); |
516 | } |
517 | |
1e4f9fb3 |
518 | for (keys %$aliases_by_type) { |
519 | delete $aliases_by_type->{$_} unless keys %{$aliases_by_type->{$_}}; |
520 | } |
521 | |
964a3c71 |
522 | return $aliases_by_type; |
07f31d19 |
523 | } |
524 | |
eb58c082 |
525 | # This is the engine behind { distinct => 1 } and the general |
526 | # complex prefetch grouper |
0a3441ee |
527 | sub _group_over_selection { |
560978e2 |
528 | my ($self, $attrs) = @_; |
0a3441ee |
529 | |
560978e2 |
530 | my $colinfos = $self->_resolve_column_info ($attrs->{from}); |
0a3441ee |
531 | |
532 | my (@group_by, %group_index); |
533 | |
36fd7f07 |
534 | # the logic is: if it is a { func => val } we assume an aggregate, |
535 | # otherwise if \'...' or \[...] we assume the user knows what is |
536 | # going on thus group over it |
560978e2 |
537 | for (@{$attrs->{select}}) { |
0a3441ee |
538 | if (! ref($_) or ref ($_) ne 'HASH' ) { |
539 | push @group_by, $_; |
540 | $group_index{$_}++; |
560978e2 |
541 | if ($colinfos->{$_} and $_ !~ /\./ ) { |
0a3441ee |
542 | # add a fully qualified version as well |
560978e2 |
543 | $group_index{"$colinfos->{$_}{-source_alias}.$_"}++; |
0a3441ee |
544 | } |
07f31d19 |
545 | } |
546 | } |
ad630f4b |
547 | |
b3577eae |
548 | my $sql_maker = $self->sql_maker; |
549 | my @order_by = $self->_extract_order_criteria($attrs->{order_by}, $sql_maker) |
eb58c082 |
550 | or return (\@group_by, $attrs->{order_by}); |
551 | |
552 | # add any order_by parts that are not already present in the group_by |
553 | # to maintain SQL cross-compatibility and general sanity |
554 | # |
555 | # also in case the original selection is *not* unique, or in case part |
556 | # of the ORDER BY refers to a multiplier - we will need to replace the |
557 | # skipped order_by elements with their MIN/MAX equivalents as to maintain |
558 | # the proper overall order without polluting the group criteria (and |
559 | # possibly changing the outcome entirely) |
560 | |
b3577eae |
561 | my ($leftovers, @new_order_by, $order_chunks, $aliastypes); |
eb58c082 |
562 | |
563 | my $group_already_unique = $self->_columns_comprise_identifying_set($colinfos, \@group_by); |
564 | |
565 | for my $o_idx (0 .. $#order_by) { |
566 | |
567 | # if the chunk is already a min/max function - there is nothing left to touch |
568 | next if $order_by[$o_idx][0] =~ /^ (?: min | max ) \s* \( .+ \) $/ix; |
569 | |
0a3441ee |
570 | # only consider real columns (for functions the user got to do an explicit group_by) |
eb58c082 |
571 | my $chunk_ci; |
572 | if ( |
573 | @{$order_by[$o_idx]} != 1 |
574 | or |
575 | # only declare an unknown *plain* identifier as "leftover" if we are called with |
576 | # aliastypes to examine. If there are none - we are still in _resolve_attrs, and |
577 | # can just assume the user knows what they want |
578 | ( ! ( $chunk_ci = $colinfos->{$order_by[$o_idx][0]} ) and $attrs->{_aliastypes} ) |
579 | ) { |
580 | push @$leftovers, $order_by[$o_idx][0]; |
14e26c5f |
581 | } |
560978e2 |
582 | |
eb58c082 |
583 | next unless $chunk_ci; |
584 | |
585 | # no duplication of group criteria |
586 | next if $group_index{$chunk_ci->{-fq_colname}}; |
587 | |
588 | $aliastypes ||= ( |
589 | $attrs->{_aliastypes} |
560978e2 |
590 | or |
eb58c082 |
591 | $self->_resolve_aliastypes_from_select_args({ |
592 | from => $attrs->{from}, |
593 | order_by => $attrs->{order_by}, |
594 | }) |
595 | ) if $group_already_unique; |
596 | |
597 | # check that we are not ordering by a multiplier (if a check is requested at all) |
598 | if ( |
599 | $group_already_unique |
600 | and |
601 | ! $aliastypes->{multiplying}{$chunk_ci->{-source_alias}} |
602 | and |
603 | ! $aliastypes->{premultiplied}{$chunk_ci->{-source_alias}} |
560978e2 |
604 | ) { |
eb58c082 |
605 | push @group_by, $chunk_ci->{-fq_colname}; |
606 | $group_index{$chunk_ci->{-fq_colname}}++ |
560978e2 |
607 | } |
eb58c082 |
608 | else { |
609 | # We need to order by external columns without adding them to the group |
610 | # (eiehter a non-unique selection, or a multi-external) |
611 | # |
612 | # This doesn't really make sense in SQL, however from DBICs point |
613 | # of view is rather valid (e.g. order the leftmost objects by whatever |
614 | # criteria and get the offset/rows many). There is a way around |
615 | # this however in SQL - we simply tae the direction of each piece |
616 | # of the external order and convert them to MIN(X) for ASC or MAX(X) |
617 | # for DESC, and group_by the root columns. The end result should be |
618 | # exactly what we expect |
619 | |
620 | # FIXME - this code is a joke, will need to be completely rewritten in |
621 | # the DQ branch. But I need to push a POC here, otherwise the |
622 | # pesky tests won't pass |
623 | # wrap any part of the order_by that "responds" to an ordering alias |
624 | # into a MIN/MAX |
0a3441ee |
625 | |
b3577eae |
626 | $order_chunks ||= do { |
627 | my @c; |
628 | my $dq_node = $sql_maker->converter->_order_by_to_dq($attrs->{order_by}); |
eb58c082 |
629 | |
b3577eae |
630 | while (is_Order($dq_node)) { |
631 | push @c, { |
632 | is_desc => $dq_node->{reverse}, |
633 | dq_node => $dq_node->{by}, |
634 | }; |
635 | |
636 | @{$c[-1]}{qw(sql bind)} = $sql_maker->_render_dq($dq_node->{by}); |
637 | |
638 | $dq_node = $dq_node->{from}; |
639 | } |
0a3441ee |
640 | |
b3577eae |
641 | \@c; |
642 | }; |
643 | |
644 | $new_order_by[$o_idx] = { |
645 | ($order_chunks->[$o_idx]{is_desc} ? '-desc' : '-asc') => \[ |
646 | sprintf ( '%s( %s )', |
647 | ($order_chunks->[$o_idx]{is_desc} ? 'MAX' : 'MIN'), |
648 | $order_chunks->[$o_idx]{sql}, |
649 | ), |
650 | @{ $order_chunks->[$o_idx]{bind} || [] } |
651 | ] |
652 | }; |
eb58c082 |
653 | } |
0a3441ee |
654 | } |
655 | |
eb58c082 |
656 | $self->throw_exception ( sprintf |
657 | 'A required group_by clause could not be constructed automatically due to a complex ' |
658 | . 'order_by criteria (%s). Either order_by columns only (no functions) or construct a suitable ' |
659 | . 'group_by by hand', |
660 | join ', ', map { "'$_'" } @$leftovers, |
661 | ) if $leftovers; |
662 | |
663 | # recreate the untouched order parts |
664 | if (@new_order_by) { |
b3577eae |
665 | $new_order_by[$_] ||= { |
666 | ( $order_chunks->[$_]{is_desc} ? '-desc' : '-asc' ) |
667 | => \ $order_chunks->[$_]{dq_node} |
668 | } for ( 0 .. $#$order_chunks ); |
eb58c082 |
669 | } |
670 | |
671 | return ( |
672 | \@group_by, |
673 | (@new_order_by ? \@new_order_by : $attrs->{order_by} ), # same ref as original == unchanged |
674 | ); |
07f31d19 |
675 | } |
676 | |
d28bb90d |
677 | sub _resolve_ident_sources { |
678 | my ($self, $ident) = @_; |
679 | |
680 | my $alias2source = {}; |
d28bb90d |
681 | |
682 | # the reason this is so contrived is that $ident may be a {from} |
683 | # structure, specifying multiple tables to join |
6298a324 |
684 | if ( blessed $ident && $ident->isa("DBIx::Class::ResultSource") ) { |
d28bb90d |
685 | # this is compat mode for insert/update/delete which do not deal with aliases |
686 | $alias2source->{me} = $ident; |
d28bb90d |
687 | } |
688 | elsif (ref $ident eq 'ARRAY') { |
689 | |
690 | for (@$ident) { |
691 | my $tabinfo; |
692 | if (ref $_ eq 'HASH') { |
693 | $tabinfo = $_; |
d28bb90d |
694 | } |
695 | if (ref $_ eq 'ARRAY' and ref $_->[0] eq 'HASH') { |
696 | $tabinfo = $_->[0]; |
697 | } |
698 | |
4376a157 |
699 | $alias2source->{$tabinfo->{-alias}} = $tabinfo->{-rsrc} |
700 | if ($tabinfo->{-rsrc}); |
d28bb90d |
701 | } |
702 | } |
703 | |
90f10b5a |
704 | return $alias2source; |
d28bb90d |
705 | } |
706 | |
707 | # Takes $ident, \@column_names |
708 | # |
709 | # returns { $column_name => \%column_info, ... } |
710 | # also note: this adds -result_source => $rsrc to the column info |
711 | # |
09e14fdc |
712 | # If no columns_names are supplied returns info about *all* columns |
713 | # for all sources |
d28bb90d |
714 | sub _resolve_column_info { |
715 | my ($self, $ident, $colnames) = @_; |
90f10b5a |
716 | my $alias2src = $self->_resolve_ident_sources($ident); |
d28bb90d |
717 | |
52416317 |
718 | my (%seen_cols, @auto_colnames); |
d28bb90d |
719 | |
720 | # compile a global list of column names, to be able to properly |
721 | # disambiguate unqualified column names (if at all possible) |
722 | for my $alias (keys %$alias2src) { |
723 | my $rsrc = $alias2src->{$alias}; |
724 | for my $colname ($rsrc->columns) { |
725 | push @{$seen_cols{$colname}}, $alias; |
3f5b99fe |
726 | push @auto_colnames, "$alias.$colname" unless $colnames; |
d28bb90d |
727 | } |
728 | } |
729 | |
09e14fdc |
730 | $colnames ||= [ |
731 | @auto_colnames, |
732 | grep { @{$seen_cols{$_}} == 1 } (keys %seen_cols), |
733 | ]; |
734 | |
52416317 |
735 | my (%return, $colinfos); |
d28bb90d |
736 | foreach my $col (@$colnames) { |
52416317 |
737 | my ($source_alias, $colname) = $col =~ m/^ (?: ([^\.]+) \. )? (.+) $/x; |
d28bb90d |
738 | |
52416317 |
739 | # if the column was seen exactly once - we know which rsrc it came from |
740 | $source_alias ||= $seen_cols{$colname}[0] |
741 | if ($seen_cols{$colname} and @{$seen_cols{$colname}} == 1); |
d28bb90d |
742 | |
52416317 |
743 | next unless $source_alias; |
744 | |
745 | my $rsrc = $alias2src->{$source_alias} |
746 | or next; |
747 | |
748 | $return{$col} = { |
6395604e |
749 | %{ |
750 | ( $colinfos->{$source_alias} ||= $rsrc->columns_info )->{$colname} |
751 | || |
752 | $self->throw_exception( |
753 | "No such column '$colname' on source " . $rsrc->source_name |
754 | ); |
755 | }, |
d28bb90d |
756 | -result_source => $rsrc, |
52416317 |
757 | -source_alias => $source_alias, |
81bf295c |
758 | -fq_colname => $col eq $colname ? "$source_alias.$col" : $col, |
759 | -colname => $colname, |
d28bb90d |
760 | }; |
81bf295c |
761 | |
762 | $return{"$source_alias.$colname"} = $return{$col} if $col eq $colname; |
d28bb90d |
763 | } |
764 | |
765 | return \%return; |
766 | } |
767 | |
289ac713 |
768 | # The DBIC relationship chaining implementation is pretty simple - every |
769 | # new related_relationship is pushed onto the {from} stack, and the {select} |
770 | # window simply slides further in. This means that when we count somewhere |
771 | # in the middle, we got to make sure that everything in the join chain is an |
772 | # actual inner join, otherwise the count will come back with unpredictable |
773 | # results (a resultset may be generated with _some_ rows regardless of if |
774 | # the relation which the $rs currently selects has rows or not). E.g. |
775 | # $artist_rs->cds->count - normally generates: |
776 | # SELECT COUNT( * ) FROM artist me LEFT JOIN cd cds ON cds.artist = me.artistid |
777 | # which actually returns the number of artists * (number of cds || 1) |
778 | # |
779 | # So what we do here is crawl {from}, determine if the current alias is at |
780 | # the top of the stack, and if not - make sure the chain is inner-joined down |
781 | # to the root. |
782 | # |
31a8aaaf |
783 | sub _inner_join_to_node { |
289ac713 |
784 | my ($self, $from, $alias) = @_; |
785 | |
786 | # subqueries and other oddness are naturally not supported |
787 | return $from if ( |
788 | ref $from ne 'ARRAY' |
789 | || |
790 | @$from <= 1 |
791 | || |
792 | ref $from->[0] ne 'HASH' |
793 | || |
794 | ! $from->[0]{-alias} |
795 | || |
7eb76996 |
796 | $from->[0]{-alias} eq $alias # this last bit means $alias is the head of $from - nothing to do |
289ac713 |
797 | ); |
798 | |
799 | # find the current $alias in the $from structure |
800 | my $switch_branch; |
801 | JOINSCAN: |
802 | for my $j (@{$from}[1 .. $#$from]) { |
803 | if ($j->[0]{-alias} eq $alias) { |
804 | $switch_branch = $j->[0]{-join_path}; |
805 | last JOINSCAN; |
806 | } |
807 | } |
808 | |
7eb76996 |
809 | # something else went quite wrong |
289ac713 |
810 | return $from unless $switch_branch; |
811 | |
812 | # So it looks like we will have to switch some stuff around. |
813 | # local() is useless here as we will be leaving the scope |
814 | # anyway, and deep cloning is just too fucking expensive |
8273e845 |
815 | # So replace the first hashref in the node arrayref manually |
289ac713 |
816 | my @new_from = ($from->[0]); |
faeb2407 |
817 | my $sw_idx = { map { (values %$_), 1 } @$switch_branch }; #there's one k/v per join-path |
289ac713 |
818 | |
819 | for my $j (@{$from}[1 .. $#$from]) { |
820 | my $jalias = $j->[0]{-alias}; |
821 | |
822 | if ($sw_idx->{$jalias}) { |
823 | my %attrs = %{$j->[0]}; |
824 | delete $attrs{-join_type}; |
825 | push @new_from, [ |
826 | \%attrs, |
827 | @{$j}[ 1 .. $#$j ], |
828 | ]; |
829 | } |
830 | else { |
831 | push @new_from, $j; |
832 | } |
833 | } |
834 | |
835 | return \@new_from; |
836 | } |
837 | |
bac358c9 |
838 | sub _extract_order_criteria { |
fe386563 |
839 | my ($self, $order_by, $sql_maker, $ident_only) = @_; |
c0748280 |
840 | |
10cef607 |
841 | $sql_maker ||= $self->sql_maker; |
842 | |
843 | my $order_dq = $sql_maker->converter->_order_by_to_dq($order_by); |
844 | |
845 | my @by; |
0f975d81 |
846 | while (is_Order($order_dq)) { |
10cef607 |
847 | push @by, $order_dq->{by}; |
848 | $order_dq = $order_dq->{from}; |
849 | } |
850 | |
a14cff97 |
851 | # delete local is 5.12+ |
852 | local @{$sql_maker}{qw(quote_char renderer converter)}; |
853 | delete @{$sql_maker}{qw(quote_char renderer converter)}; |
daa6fd83 |
854 | |
fe386563 |
855 | return map { [ $sql_maker->_render_dq($_) ] } do { |
856 | if ($ident_only) { |
857 | my @by_ident; |
858 | scan_dq_nodes({ DQ_IDENTIFIER ,=> sub { push @by_ident, $_[0] } }, @by); |
859 | @by_ident |
860 | } else { |
861 | @by |
862 | } |
863 | }; |
bac6c4fb |
864 | } |
865 | |
7cec4356 |
866 | sub _order_by_is_stable { |
5f11e54f |
867 | my ($self, $ident, $order_by, $where) = @_; |
c0748280 |
868 | |
eb58c082 |
869 | my @cols = ( |
fe386563 |
870 | (map { $_->[0] } $self->_extract_order_criteria($order_by, undef, 1)), |
5f11e54f |
871 | $where ? @{$self->_extract_fixed_condition_columns($where)} :(), |
eb58c082 |
872 | ) or return undef; |
873 | |
874 | my $colinfo = $self->_resolve_column_info($ident, \@cols); |
875 | |
876 | return keys %$colinfo |
877 | ? $self->_columns_comprise_identifying_set( $colinfo, \@cols ) |
878 | : undef |
879 | ; |
880 | } |
c0748280 |
881 | |
eb58c082 |
882 | sub _columns_comprise_identifying_set { |
883 | my ($self, $colinfo, $columns) = @_; |
7cec4356 |
884 | |
885 | my $cols_per_src; |
eb58c082 |
886 | $cols_per_src -> {$_->{-source_alias}} -> {$_->{-colname}} = $_ |
887 | for grep { defined $_ } @{$colinfo}{@$columns}; |
7cec4356 |
888 | |
889 | for (values %$cols_per_src) { |
890 | my $src = (values %$_)[0]->{-result_source}; |
891 | return 1 if $src->_identifying_column_set($_); |
c0748280 |
892 | } |
893 | |
7cec4356 |
894 | return undef; |
895 | } |
896 | |
0e81e691 |
897 | # this is almost identical to the above, except it accepts only |
898 | # a single rsrc, and will succeed only if the first portion of the order |
899 | # by is stable. |
900 | # returns that portion as a colinfo hashref on success |
901 | sub _main_source_order_by_portion_is_stable { |
902 | my ($self, $main_rsrc, $order_by, $where) = @_; |
903 | |
904 | die "Huh... I expect a blessed result_source..." |
905 | if ref($main_rsrc) eq 'ARRAY'; |
906 | |
907 | my @ord_cols = map |
908 | { $_->[0] } |
909 | ( $self->_extract_order_criteria($order_by) ) |
910 | ; |
911 | return unless @ord_cols; |
912 | |
318e3d94 |
913 | my $colinfos = $self->_resolve_column_info($main_rsrc); |
914 | |
0e81e691 |
915 | for (0 .. $#ord_cols) { |
916 | if ( |
917 | ! $colinfos->{$ord_cols[$_]} |
918 | or |
919 | $colinfos->{$ord_cols[$_]}{-result_source} != $main_rsrc |
920 | ) { |
921 | $#ord_cols = $_ - 1; |
922 | last; |
923 | } |
924 | } |
925 | |
926 | # we just truncated it above |
927 | return unless @ord_cols; |
928 | |
0e81e691 |
929 | my $order_portion_ci = { map { |
930 | $colinfos->{$_}{-colname} => $colinfos->{$_}, |
931 | $colinfos->{$_}{-fq_colname} => $colinfos->{$_}, |
932 | } @ord_cols }; |
933 | |
318e3d94 |
934 | # since all we check here are the start of the order_by belonging to the |
935 | # top level $rsrc, a present identifying set will mean that the resultset |
936 | # is ordered by its leftmost table in a stable manner |
937 | # |
938 | # RV of _identifying_column_set contains unqualified names only |
939 | my $unqualified_idset = $main_rsrc->_identifying_column_set({ |
940 | ( $where ? %{ |
941 | $self->_resolve_column_info( |
942 | $main_rsrc, $self->_extract_fixed_condition_columns($where) |
943 | ) |
944 | } : () ), |
945 | %$order_portion_ci |
946 | }) or return; |
947 | |
948 | my $ret_info; |
949 | my %unqualified_idcols_from_order = map { |
950 | $order_portion_ci->{$_} ? ( $_ => $order_portion_ci->{$_} ) : () |
951 | } @$unqualified_idset; |
952 | |
953 | # extra optimization - cut the order_by at the end of the identifying set |
954 | # (just in case the user was stupid and overlooked the obvious) |
955 | for my $i (0 .. $#ord_cols) { |
956 | my $col = $ord_cols[$i]; |
957 | my $unqualified_colname = $order_portion_ci->{$col}{-colname}; |
958 | $ret_info->{$col} = { %{$order_portion_ci->{$col}}, -idx_in_order_subset => $i }; |
959 | delete $unqualified_idcols_from_order{$ret_info->{$col}{-colname}}; |
960 | |
961 | # we didn't reach the end of the identifying portion yet |
962 | return $ret_info unless keys %unqualified_idcols_from_order; |
963 | } |
0e81e691 |
964 | |
318e3d94 |
965 | die 'How did we get here...'; |
0e81e691 |
966 | } |
967 | |
4a0eed52 |
968 | # returns an arrayref of column names which *definitely* have some |
5f11e54f |
969 | # sort of non-nullable equality requested in the given condition |
970 | # specification. This is used to figure out if a resultset is |
971 | # constrained to a column which is part of a unique constraint, |
972 | # which in turn allows us to better predict how ordering will behave |
973 | # etc. |
974 | # |
975 | # this is a rudimentary, incomplete, and error-prone extractor |
976 | # however this is OK - it is conservative, and if we can not find |
977 | # something that is in fact there - the stack will recover gracefully |
978 | # Also - DQ and the mst it rode in on will save us all RSN!!! |
979 | sub _extract_fixed_condition_columns { |
e1861c2c |
980 | my ($self, $where) = @_; |
5f11e54f |
981 | |
bcf127a5 |
982 | if (ref($where) eq 'REF' and ref($$where) eq 'HASH') { |
983 | # Yes. I know. |
984 | my $fixed = DBIx::Class::ResultSource->_extract_fixed_values_for($$where); |
985 | return [ keys %$fixed ]; |
986 | } |
987 | |
5f11e54f |
988 | return unless ref $where eq 'HASH'; |
989 | |
990 | my @cols; |
991 | for my $lhs (keys %$where) { |
992 | if ($lhs =~ /^\-and$/i) { |
993 | push @cols, ref $where->{$lhs} eq 'ARRAY' |
e1861c2c |
994 | ? ( map { @{ $self->_extract_fixed_condition_columns($_) } } @{$where->{$lhs}} ) |
995 | : @{ $self->_extract_fixed_condition_columns($where->{$lhs}) } |
5f11e54f |
996 | ; |
997 | } |
998 | elsif ($lhs !~ /^\-/) { |
999 | my $val = $where->{$lhs}; |
1000 | |
1001 | push @cols, $lhs if (defined $val and ( |
1002 | ! ref $val |
1003 | or |
1004 | (ref $val eq 'HASH' and keys %$val == 1 and defined $val->{'='}) |
1005 | )); |
1006 | } |
1007 | } |
e1861c2c |
1008 | return \@cols; |
c0748280 |
1009 | } |
bac6c4fb |
1010 | |
d28bb90d |
1011 | 1; |