_pos = (int) $_REQUEST['pos']; } if (! isset($this->_pos)) { $this->_pos = $this->_getNavigationDbPos(); } // Get the active node if (isset($_REQUEST['aPath'])) { $this->_aPath[0] = $this->_parsePath($_REQUEST['aPath']); $this->_pos2_name[0] = $_REQUEST['pos2_name']; $this->_pos2_value[0] = $_REQUEST['pos2_value']; if (isset($_REQUEST['pos3_name'])) { $this->_pos3_name[0] = $_REQUEST['pos3_name']; $this->_pos3_value[0] = $_REQUEST['pos3_value']; } } else if (isset($_REQUEST['n0_aPath'])) { $count = 0; while (isset($_REQUEST['n' . $count . '_aPath'])) { $this->_aPath[$count] = $this->_parsePath( $_REQUEST['n' . $count . '_aPath'] ); $index = 'n' . $count . '_pos2_'; $this->_pos2_name[$count] = $_REQUEST[$index . 'name']; $this->_pos2_value[$count] = $_REQUEST[$index . 'value']; $index = 'n' . $count . '_pos3_'; if (isset($_REQUEST[$index])) { $this->_pos3_name[$count] = $_REQUEST[$index . 'name']; $this->_pos3_value[$count] = $_REQUEST[$index . 'value']; } $count++; } } if (isset($_REQUEST['vPath'])) { $this->_vPath[0] = $this->_parsePath($_REQUEST['vPath']); } else if (isset($_REQUEST['n0_vPath'])) { $count = 0; while (isset($_REQUEST['n' . $count . '_vPath'])) { $this->_vPath[$count] = $this->_parsePath( $_REQUEST['n' . $count . '_vPath'] ); $count++; } } if (isset($_REQUEST['searchClause'])) { $this->_searchClause = $_REQUEST['searchClause']; } if (isset($_REQUEST['searchClause2'])) { $this->_searchClause2 = $_REQUEST['searchClause2']; } // Initialise the tree by creating a root node $node = PMA_NodeFactory::getInstance('Node_Database_Container', 'root'); $this->_tree = $node; if ($GLOBALS['cfg']['NavigationTreeEnableGrouping']) { $this->_tree->separator = $GLOBALS['cfg']['NavigationTreeDbSeparator']; $this->_tree->separator_depth = 10000; } } /** * Returns the database position for the page selector * * @return int */ private function _getNavigationDbPos() { $retval = 0; if (! empty($GLOBALS['db'])) { $query = "SELECT (COUNT(`SCHEMA_NAME`) DIV %d) * %d "; $query .= "FROM `INFORMATION_SCHEMA`.`SCHEMATA` "; $query .= "WHERE `SCHEMA_NAME` < '%s' "; $query .= "ORDER BY `SCHEMA_NAME` ASC"; $retval = $GLOBALS['dbi']->fetchValue( sprintf( $query, (int)$GLOBALS['cfg']['MaxNavigationItems'], (int)$GLOBALS['cfg']['MaxNavigationItems'], PMA_Util::sqlAddSlashes($GLOBALS['db']) ) ); } return $retval; } /** * Converts an encoded path to a node in string format to an array * * @param string $string The path to parse * * @return array */ private function _parsePath($string) { $path = explode('.', $string); foreach ($path as $key => $value) { $path[$key] = base64_decode($value); } return $path; } /** * Generates the tree structure so that it can be rendered later * * @return Node|false The active node or false in case of failure */ private function _buildPath() { $retval = $this->_tree; // Add all databases unconditionally $data = $this->_tree->getData( 'databases', $this->_pos, $this->_searchClause ); foreach ($data as $db) { $node = PMA_NodeFactory::getInstance('Node_Database', $db); $this->_tree->addChild($node); } // Whether build other parts of the tree depends // on whether we have any paths in $this->_aPath foreach ($this->_aPath as $key => $path) { $retval = $this->_buildPathPart( $path, $this->_pos2_name[$key], $this->_pos2_value[$key], isset($this->_pos3_name[$key]) ? $this->_pos3_name[$key] : '', isset($this->_pos3_value[$key]) ? $this->_pos3_value[$key] : '' ); } return $retval; } /** * Builds a branch of the tree * * @param array $path A paths pointing to the branch * of the tree that needs to be built * @param string $type2 The type of item being paginated on * the second level of the tree * @param int $pos2 The position for the pagination of * the branch at the second level of the tree * @param string $type3 The type of item being paginated on * the third level of the tree * @param int $pos3 The position for the pagination of * the branch at the third level of the tree * * @return Node|false The active node or false in case of failure */ private function _buildPathPart($path, $type2, $pos2, $type3, $pos3) { $retval = true; if (count($path) > 1) { array_shift($path); // remove 'root' $db = $this->_tree->getChild($path[0]); $retval = $db; if ($db === false) { return false; } $containers = $this->_addDbContainers($db, $type2, $pos2); array_shift($path); // remove db if ((count($path) > 0 && array_key_exists($path[0], $containers)) || count($containers) == 1 ) { if (count($containers) == 1) { $container = array_shift($containers); } else { $container = $db->getChild($path[0], true); if ($container === false) { return false; } } $retval = $container; if (count($container->children) <= 1) { $dbData = $db->getData( $container->real_name, $pos2, $this->_searchClause2 ); foreach ($dbData as $item) { switch ($container->real_name) { case 'events': $node = PMA_NodeFactory::getInstance( 'Node_Event', $item ); break; case 'functions': $node = PMA_NodeFactory::getInstance( 'Node_Function', $item ); break; case 'procedures': $node = PMA_NodeFactory::getInstance( 'Node_Procedure', $item ); break; case 'tables': $node = PMA_NodeFactory::getInstance( 'Node_Table', $item ); break; case 'views': $node = PMA_NodeFactory::getInstance( 'Node_View', $item ); break; default: break; } if (isset($node)) { if ($type2 == $container->real_name) { $node->pos2 = $pos2; } $container->addChild($node); } } } if (count($path) > 1 && $path[0] != 'tables') { $retval = false; } else { array_shift($path); // remove container if (count($path) > 0) { $table = $container->getChild($path[0], true); if ($table === false) { return false; } $retval = $table; $containers = $this->_addTableContainers( $table, $pos2, $type3, $pos3 ); array_shift($path); // remove table if (count($path) > 0 && array_key_exists($path[0], $containers) ) { $container = $table->getChild($path[0], true); $retval = $container; $tableData = $table->getData( $container->real_name, $pos3 ); foreach ($tableData as $item) { switch ($container->real_name) { case 'indexes': $node = PMA_NodeFactory::getInstance( 'Node_Index', $item ); break; case 'columns': $node = PMA_NodeFactory::getInstance( 'Node_Column', $item ); break; case 'triggers': $node = PMA_NodeFactory::getInstance( 'Node_Trigger', $item ); break; default: break; } if (isset($node)) { $node->pos2 = $container->parent->pos2; if ($type3 == $container->real_name) { $node->pos3 = $pos3; } $container->addChild($node); } } } } } } } return $retval; } /** * Adds containers to a node that is a table * * References to existing children are returned * if this function is called twice on the same node * * @param Node $table The table node, new containers will be * attached to this node * @param int $pos2 The position for the pagination of * the branch at the second level of the tree * @param string $type3 The type of item being paginated on * the third level of the tree * @param int $pos3 The position for the pagination of * the branch at the third level of the tree * * @return array An array of new nodes */ private function _addTableContainers($table, $pos2, $type3, $pos3) { $retval = array(); if ($table->hasChildren(true) == 0) { if ($table->getPresence('columns')) { $retval['columns'] = PMA_NodeFactory::getInstance( 'Node_Column_Container' ); } if ($table->getPresence('indexes')) { $retval['indexes'] = PMA_NodeFactory::getInstance( 'Node_Index_Container' ); } if ($table->getPresence('triggers')) { $retval['triggers'] = PMA_NodeFactory::getInstance( 'Node_Trigger_Container' ); } // Add all new Nodes to the tree foreach ($retval as $node) { $node->pos2 = $pos2; if ($type3 == $node->real_name) { $node->pos3 = $pos3; } $table->addChild($node); } } else { foreach ($table->children as $node) { if ($type3 == $node->real_name) { $node->pos3 = $pos3; } $retval[$node->real_name] = $node; } } return $retval; } /** * Adds containers to a node that is a database * * References to existing children are returned * if this function is called twice on the same node * * @param Node $db The database node, new containers will be * attached to this node * @param string $type The type of item being paginated on * the second level of the tree * @param int $pos2 The position for the pagination of * the branch at the second level of the tree * * @return array An array of new nodes */ private function _addDbContainers($db, $type, $pos2) { $retval = array(); if ($db->hasChildren(true) == 0) { if ($db->getPresence('tables')) { $retval['tables'] = PMA_NodeFactory::getInstance( 'Node_Table_Container' ); } if ($db->getPresence('views')) { $retval['views'] = PMA_NodeFactory::getInstance( 'Node_View_Container' ); } if ($db->getPresence('functions')) { $retval['functions'] = PMA_NodeFactory::getInstance( 'Node_Function_Container' ); } if ($db->getPresence('procedures')) { $retval['procedures'] = PMA_NodeFactory::getInstance( 'Node_Procedure_Container' ); } if ($db->getPresence('events')) { $retval['events'] = PMA_NodeFactory::getInstance( 'Node_Event_Container' ); } // Add all new Nodes to the tree foreach ($retval as $node) { if ($type == $node->real_name) { $node->pos2 = $pos2; } $db->addChild($node); } } else { foreach ($db->children as $node) { if ($type == $node->real_name) { $node->pos2 = $pos2; } $retval[$node->real_name] = $node; } } return $retval; } /** * Recursively groups tree nodes given a separator * * @param mixed $node The node to group or null * to group the whole tree. If * passed as an argument, $node * must be of type CONTAINER * * @return void */ public function groupTree($node = null) { if (! isset($node)) { $node = $this->_tree; } $this->groupNode($node); foreach ($node->children as $child) { $this->groupTree($child); } } /** * Recursively groups tree nodes given a sperarator * * @param Node $node The node to group * * @return void */ public function groupNode($node) { if ($node->type == Node::CONTAINER) { $separators = array(); if (is_array($node->separator)) { $separators = $node->separator; } else if (strlen($node->separator)) { $separators[] = $node->separator; } $prefixes = array(); if ($node->separator_depth > 0) { foreach ($node->children as $child) { $prefix_pos = false; foreach ($separators as $separator) { $sep_pos = strpos($child->name, $separator); if ($sep_pos != false && $sep_pos != strlen($child->name) && $sep_pos != 0 && ($prefix_pos == false || $sep_pos < $prefix_pos) ) { $prefix_pos = $sep_pos; } } if ($prefix_pos !== false) { $prefix = substr($child->name, 0, $prefix_pos); if (! isset($prefixes[$prefix])) { $prefixes[$prefix] = 1; } else { $prefixes[$prefix]++; } } } } foreach ($prefixes as $key => $value) { if ($value == 1) { unset($prefixes[$key]); } } if (count($prefixes)) { $groups = array(); foreach ($prefixes as $key => $value) { $groups[$key] = new Node( $key, Node::CONTAINER, true ); $groups[$key]->separator = $node->separator; $groups[$key]->separator_depth = $node->separator_depth - 1; $groups[$key]->icon = ''; if (PMA_Util::showIcons('TableNavigationLinksMode')) { $groups[$key]->icon = PMA_Util::getImage( 'b_group.png' ); } $groups[$key]->pos2 = $node->pos2; $groups[$key]->pos3 = $node->pos3; if ($node instanceof Node_Table_Container || $node instanceof Node_View_Container ) { $tblGroup = '&tbl_group=' . urlencode($key); $groups[$key]->links = array( 'text' => $node->links['text'] . $tblGroup, 'icon' => $node->links['icon'] . $tblGroup ); } $node->addChild($groups[$key]); foreach ($separators as $separator) { // FIXME: this could be more efficient foreach ($node->children as $child) { $name_substring = substr( $child->name, 0, strlen($key) + strlen($separator) ); if (($name_substring == $key . $separator || $child->name == $key) && $child->type == Node::OBJECT ) { $class = get_class($child); $new_child = PMA_NodeFactory::getInstance( $class, substr( $child->name, strlen($key) + strlen($separator) ) ); $new_child->real_name = $child->real_name; $new_child->icon = $child->icon; $new_child->links = $child->links; $new_child->pos2 = $child->pos2; $new_child->pos3 = $child->pos3; $groups[$key]->addChild($new_child); foreach ($child->children as $elm) { $new_child->addChild($elm); } $node->removeChild($child->name); } } } } foreach ($prefixes as $key => $value) { $this->groupNode($groups[$key]); $groups[$key]->classes = "navGroup"; } } } } /** * Renders a state of the tree, used in light mode when * either JavaScript and/or Ajax are disabled * * @return string HTML code for the navigation tree */ public function renderState() { $this->_buildPath(); $retval = $this->_fastFilterHtml($this->_tree); $retval .= $this->_getPageSelector($this->_tree); $this->groupTree(); $retval .= "
"; return $retval; } /** * Renders a part of the tree, used for Ajax * requests in light mode * * @return string HTML code for the navigation tree */ public function renderPath() { $node = $this->_buildPath(); if ($node === false) { $retval = false; } else { $this->groupTree(); $retval = " "; } if (! empty($this->_searchClause) || ! empty($this->_searchClause2)) { $results = 0; if (! empty($this->_searchClause2)) { if (is_object($node->realParent())) { $results = $node->realParent()->getPresence( $node->real_name, $this->_searchClause2 ); } } else { $results = $this->_tree->getPresence( 'databases', $this->_searchClause ); } $clientResults = 0; if (! empty($_REQUEST['results'])) { $clientResults = (int)$_REQUEST['results']; } $otherResults = $results - $clientResults; if ($otherResults < 1) { $otherResults = ''; } else { $otherResults = sprintf( _ngettext( '%s other result found', '%s other results found', $otherResults ), $otherResults ); } PMA_Response::getInstance()->addJSON( 'results', $otherResults ); } return $retval; } /** * Renders the parameters that are required on the client * side to know which page(s) we will be requesting data from * * @param Node $node The node to create the pagination parameters for * * @return string */ private function _getPaginationParamsHtml($node) { $retval = ''; $paths = $node->getPaths(); if (isset($paths['aPath_clean'][2])) { $retval .= ""; $retval .= $paths['aPath_clean'][2]; $retval .= ""; $retval .= ""; $retval .= $node->pos2; $retval .= ""; } if (isset($paths['aPath_clean'][4])) { $retval .= ""; $retval .= $paths['aPath_clean'][4]; $retval .= ""; $retval .= ""; $retval .= $node->pos3; $retval .= ""; } return $retval; } /** * Renders a single node or a branch of the tree * * @param Node $node The node to render * @param int|bool $recursive Bool: Whether to render a single node or a branch * Int: How many levels deep to render * @param string $class An additional class for the list item * * @return string HTML code for the tree node or branch */ private function _renderNode($node, $recursive = -1, $class = '') { $retval = ''; $paths = $node->getPaths(); if ($node->hasSiblings() || isset($_REQUEST['results']) || $node->realParent() === false ) { if ( $node->type == Node::CONTAINER && count($node->children) == 0 && $GLOBALS['is_ajax_request'] != true ) { return ''; } $liClass = ''; if ($class || $node->classes) { $liClass = " class='" . trim($class . ' ' . $node->classes) . "'"; } $retval .= "