RDatabaseSqlparserPositioncalculator::lookForBaseExpression()

Complexity

Conditions	33
Paths	36

Size

Total Lines	71
Code Lines	37

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    private function lookForBaseExpression($sql, &$charPos, &$parsed, $key, &$backtracking) {
        if (!is_numeric($key)) {
            if (($key === 'UNION' || $key === 'UNION ALL') || ($key === 'expr_type' && $parsed === 'expression')
                    || ($key === 'expr_type' && $parsed === 'subquery')
                    || ($key === 'expr_type' && $parsed === 'bracket_expression')
                    || ($key === 'expr_type' && $parsed === 'table_expression')
                    || ($key === 'expr_type' && $parsed === 'record')
                    || ($key === 'expr_type' && $parsed === 'in-list') || ($key === 'alias' && $parsed !== false)) {
	            // we hold the current position and come back after the next base_expr
	            // we do this, because the next base_expr contains the complete expression/subquery/record
	            // and we have to look into it too
                $backtracking[] = $charPos;

            } elseif (($key === 'ref_clause' || $key === 'columns') && $parsed !== false) {
              // we hold the current position and come back after n base_expr(s)
              // there is an array of sub-elements before (!) the base_expr clause of the current element
              // so we go through the sub-elements and must come at the end
                $backtracking[] = $charPos;
                $parsedCount = count($parsed);
                for ($i = 1; $i < $parsedCount; $i++) {
                    $backtracking[] = false; // backtracking only after n base_expr!
                }
            } elseif ($key === 'sub_tree' && $parsed !== false) {
              // we prevent wrong backtracking on subtrees (too much array_pop())
              // there is an array of sub-elements after(!) the base_expr clause of the current element
              // so we go through the sub-elements and must not come back at the end
                $parsedCount = count($parsed);
                for ($i = 1; $i < $parsedCount; $i++) {
                    $backtracking[] = false;
                }
            } else {
	            // move the current pos after the keyword
	            // SELECT, WHERE, INSERT etc.
                if (in_array($key, parent::$reserved)) {
                    $charPos = stripos($sql, $key, $charPos);
                    $charPos += strlen($key);
                }
            }
        }

        if (!is_array($parsed)) {
            return;
        }

        foreach ($parsed as $key => $value) {

$key is overwriting one of the parameters of this function.

            if ($key === 'base_expr') {

	            // $this->printPos("0", $sql, $charPos, $key, $value, $backtracking);

                $subject = substr($sql, $charPos);
                $pos = $this->findPositionWithinString($subject, $value,
                        isset($parsed['expr_type']) ? $parsed['expr_type'] : 'alias');
                if ($pos === false) {
                    throw new Exception("cannot calculate position of " . $value . " within " . $subject, 5);

                }

                $parsed['position'] = $charPos + $pos;
                $charPos += $pos + strlen($value);

	            // $this->printPos("1", $sql, $charPos, $key, $value, $backtracking);

                $oldPos = array_pop($backtracking);
                if (isset($oldPos) && $oldPos !== false) {
                    $charPos = $oldPos;
                }

	            // $this->printPos("2", $sql, $charPos, $key, $value, $backtracking);

            } else {
                $this->lookForBaseExpression($sql, $charPos, $parsed[$key], $key, $backtracking);
            }