mirror of
https://we.phorge.it/source/phorge.git
synced 2025-03-28 04:00:17 +01:00
22e3e35418
Summary: Ref T4100. Share all edge logic code across applications. - Internalizes the "check that the viewer can see projects" check into edge logic. - Adds some convenience functions. Some of these aren't really all that convenient, but it's rare that we actually apply project constraints to queries in the applications -- and most of these callsites will go away in the long term -- so I didn't go too crazy with providing a simpler `withProjectPHIDs()` universal API or anything. Test Plan: - Grepped for all affected symbols. - Tried to violate policies. - Used workboards. - Used normal Maniphest queries. - Used `maniphest.query`. - Verified the special grouping behavior works as expected. Reviewers: btrahan Reviewed By: btrahan Subscribers: epriestley Maniphest Tasks: T4100 Differential Revision: https://secure.phabricator.com/D12526
1613 lines
43 KiB
PHP
1613 lines
43 KiB
PHP
<?php
|
|
|
|
/**
|
|
* A query class which uses cursor-based paging. This paging is much more
|
|
* performant than offset-based paging in the presence of policy filtering.
|
|
*
|
|
* @task clauses Building Query Clauses
|
|
* @task appsearch Integration with ApplicationSearch
|
|
* @task customfield Integration with CustomField
|
|
* @task paging Paging
|
|
* @task order Result Ordering
|
|
* @task edgelogic Working with Edge Logic
|
|
*/
|
|
abstract class PhabricatorCursorPagedPolicyAwareQuery
|
|
extends PhabricatorPolicyAwareQuery {
|
|
|
|
private $afterID;
|
|
private $beforeID;
|
|
private $applicationSearchConstraints = array();
|
|
protected $applicationSearchOrders = array();
|
|
private $internalPaging;
|
|
private $orderVector;
|
|
private $builtinOrder;
|
|
private $edgeLogicConstraints = array();
|
|
private $edgeLogicConstraintsAreValid = false;
|
|
|
|
protected function getPageCursors(array $page) {
|
|
return array(
|
|
$this->getResultCursor(head($page)),
|
|
$this->getResultCursor(last($page)),
|
|
);
|
|
}
|
|
|
|
protected function getResultCursor($object) {
|
|
if (!is_object($object)) {
|
|
throw new Exception(
|
|
pht(
|
|
'Expected object, got "%s".',
|
|
gettype($object)));
|
|
}
|
|
|
|
return $object->getID();
|
|
}
|
|
|
|
protected function nextPage(array $page) {
|
|
// See getPagingViewer() for a description of this flag.
|
|
$this->internalPaging = true;
|
|
|
|
if ($this->beforeID !== null) {
|
|
$page = array_reverse($page, $preserve_keys = true);
|
|
list($before, $after) = $this->getPageCursors($page);
|
|
$this->beforeID = $before;
|
|
} else {
|
|
list($before, $after) = $this->getPageCursors($page);
|
|
$this->afterID = $after;
|
|
}
|
|
}
|
|
|
|
final public function setAfterID($object_id) {
|
|
$this->afterID = $object_id;
|
|
return $this;
|
|
}
|
|
|
|
final protected function getAfterID() {
|
|
return $this->afterID;
|
|
}
|
|
|
|
final public function setBeforeID($object_id) {
|
|
$this->beforeID = $object_id;
|
|
return $this;
|
|
}
|
|
|
|
final protected function getBeforeID() {
|
|
return $this->beforeID;
|
|
}
|
|
|
|
|
|
/**
|
|
* Get the viewer for making cursor paging queries.
|
|
*
|
|
* NOTE: You should ONLY use this viewer to load cursor objects while
|
|
* building paging queries.
|
|
*
|
|
* Cursor paging can happen in two ways. First, the user can request a page
|
|
* like `/stuff/?after=33`, which explicitly causes paging. Otherwise, we
|
|
* can fall back to implicit paging if we filter some results out of a
|
|
* result list because the user can't see them and need to go fetch some more
|
|
* results to generate a large enough result list.
|
|
*
|
|
* In the first case, want to use the viewer's policies to load the object.
|
|
* This prevents an attacker from figuring out information about an object
|
|
* they can't see by executing queries like `/stuff/?after=33&order=name`,
|
|
* which would otherwise give them a hint about the name of the object.
|
|
* Generally, if a user can't see an object, they can't use it to page.
|
|
*
|
|
* In the second case, we need to load the object whether the user can see
|
|
* it or not, because we need to examine new results. For example, if a user
|
|
* loads `/stuff/` and we run a query for the first 100 items that they can
|
|
* see, but the first 100 rows in the database aren't visible, we need to
|
|
* be able to issue a query for the next 100 results. If we can't load the
|
|
* cursor object, we'll fail or issue the same query over and over again.
|
|
* So, generally, internal paging must bypass policy controls.
|
|
*
|
|
* This method returns the appropriate viewer, based on the context in which
|
|
* the paging is occuring.
|
|
*
|
|
* @return PhabricatorUser Viewer for executing paging queries.
|
|
*/
|
|
final protected function getPagingViewer() {
|
|
if ($this->internalPaging) {
|
|
return PhabricatorUser::getOmnipotentUser();
|
|
} else {
|
|
return $this->getViewer();
|
|
}
|
|
}
|
|
|
|
final protected function buildLimitClause(AphrontDatabaseConnection $conn_r) {
|
|
if ($this->getRawResultLimit()) {
|
|
return qsprintf($conn_r, 'LIMIT %d', $this->getRawResultLimit());
|
|
} else {
|
|
return '';
|
|
}
|
|
}
|
|
|
|
final protected function didLoadResults(array $results) {
|
|
if ($this->beforeID) {
|
|
$results = array_reverse($results, $preserve_keys = true);
|
|
}
|
|
return $results;
|
|
}
|
|
|
|
final public function executeWithCursorPager(AphrontCursorPagerView $pager) {
|
|
$limit = $pager->getPageSize();
|
|
|
|
$this->setLimit($limit + 1);
|
|
|
|
if ($pager->getAfterID()) {
|
|
$this->setAfterID($pager->getAfterID());
|
|
} else if ($pager->getBeforeID()) {
|
|
$this->setBeforeID($pager->getBeforeID());
|
|
}
|
|
|
|
$results = $this->execute();
|
|
$count = count($results);
|
|
|
|
$sliced_results = $pager->sliceResults($results);
|
|
if ($sliced_results) {
|
|
list($before, $after) = $this->getPageCursors($sliced_results);
|
|
|
|
if ($pager->getBeforeID() || ($count > $limit)) {
|
|
$pager->setNextPageID($after);
|
|
}
|
|
|
|
if ($pager->getAfterID() ||
|
|
($pager->getBeforeID() && ($count > $limit))) {
|
|
$pager->setPrevPageID($before);
|
|
}
|
|
}
|
|
|
|
return $sliced_results;
|
|
}
|
|
|
|
|
|
/**
|
|
* Return the alias this query uses to identify the primary table.
|
|
*
|
|
* Some automatic query constructions may need to be qualified with a table
|
|
* alias if the query performs joins which make column names ambiguous. If
|
|
* this is the case, return the alias for the primary table the query
|
|
* uses; generally the object table which has `id` and `phid` columns.
|
|
*
|
|
* @return string Alias for the primary table.
|
|
*/
|
|
protected function getPrimaryTableAlias() {
|
|
return null;
|
|
}
|
|
|
|
protected function newResultObject() {
|
|
return null;
|
|
}
|
|
|
|
|
|
/* -( Building Query Clauses )--------------------------------------------- */
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildSelectClause(AphrontDatabaseConnection $conn) {
|
|
$parts = $this->buildSelectClauseParts($conn);
|
|
return $this->formatSelectClause($parts);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildSelectClauseParts(AphrontDatabaseConnection $conn) {
|
|
$select = array();
|
|
|
|
$alias = $this->getPrimaryTableAlias();
|
|
if ($alias) {
|
|
$select[] = qsprintf($conn, '%T.*', $alias);
|
|
} else {
|
|
$select[] = '*';
|
|
}
|
|
|
|
$select[] = $this->buildEdgeLogicSelectClause($conn);
|
|
|
|
return $select;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildJoinClause(AphrontDatabaseConnection $conn) {
|
|
$joins = $this->buildJoinClauseParts($conn);
|
|
return $this->formatJoinClause($joins);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildJoinClauseParts(AphrontDatabaseConnection $conn) {
|
|
$joins = array();
|
|
$joins[] = $this->buildEdgeLogicJoinClause($conn);
|
|
return $joins;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildWhereClause(AphrontDatabaseConnection $conn) {
|
|
$where = $this->buildWhereClauseParts($conn);
|
|
return $this->formatWhereClause($where);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildWhereClauseParts(AphrontDatabaseConnection $conn) {
|
|
$where = array();
|
|
$where[] = $this->buildPagingClause($conn);
|
|
$where[] = $this->buildEdgeLogicWhereClause($conn);
|
|
return $where;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildHavingClause(AphrontDatabaseConnection $conn) {
|
|
$having = $this->buildHavingClauseParts($conn);
|
|
return $this->formatHavingClause($having);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildHavingClauseParts(AphrontDatabaseConnection $conn) {
|
|
$having = array();
|
|
$having[] = $this->buildEdgeLogicHavingClause($conn);
|
|
return $having;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function buildGroupClause(AphrontDatabaseConnection $conn) {
|
|
if (!$this->shouldGroupQueryResultRows()) {
|
|
return '';
|
|
}
|
|
|
|
return qsprintf(
|
|
$conn,
|
|
'GROUP BY %Q',
|
|
$this->getApplicationSearchObjectPHIDColumn());
|
|
}
|
|
|
|
|
|
/**
|
|
* @task clauses
|
|
*/
|
|
protected function shouldGroupQueryResultRows() {
|
|
if ($this->shouldGroupEdgeLogicResultRows()) {
|
|
return true;
|
|
}
|
|
|
|
if ($this->getApplicationSearchMayJoinMultipleRows()) {
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
|
|
/* -( Paging )------------------------------------------------------------- */
|
|
|
|
|
|
/**
|
|
* @task paging
|
|
*/
|
|
protected function buildPagingClause(AphrontDatabaseConnection $conn) {
|
|
$orderable = $this->getOrderableColumns();
|
|
$vector = $this->getOrderVector();
|
|
|
|
if ($this->beforeID !== null) {
|
|
$cursor = $this->beforeID;
|
|
$reversed = true;
|
|
} else if ($this->afterID !== null) {
|
|
$cursor = $this->afterID;
|
|
$reversed = false;
|
|
} else {
|
|
// No paging is being applied to this query so we do not need to
|
|
// construct a paging clause.
|
|
return '';
|
|
}
|
|
|
|
$keys = array();
|
|
foreach ($vector as $order) {
|
|
$keys[] = $order->getOrderKey();
|
|
}
|
|
|
|
$value_map = $this->getPagingValueMap($cursor, $keys);
|
|
|
|
$columns = array();
|
|
foreach ($vector as $order) {
|
|
$key = $order->getOrderKey();
|
|
|
|
if (!array_key_exists($key, $value_map)) {
|
|
throw new Exception(
|
|
pht(
|
|
'Query "%s" failed to return a value from getPagingValueMap() '.
|
|
'for column "%s".',
|
|
get_class($this),
|
|
$key));
|
|
}
|
|
|
|
$column = $orderable[$key];
|
|
$column['value'] = $value_map[$key];
|
|
|
|
$columns[] = $column;
|
|
}
|
|
|
|
return $this->buildPagingClauseFromMultipleColumns(
|
|
$conn,
|
|
$columns,
|
|
array(
|
|
'reversed' => $reversed,
|
|
));
|
|
}
|
|
|
|
|
|
/**
|
|
* @task paging
|
|
*/
|
|
protected function getPagingValueMap($cursor, array $keys) {
|
|
return array(
|
|
'id' => $cursor,
|
|
);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task paging
|
|
*/
|
|
protected function loadCursorObject($cursor) {
|
|
$query = newv(get_class($this), array())
|
|
->setViewer($this->getPagingViewer())
|
|
->withIDs(array((int)$cursor));
|
|
|
|
$this->willExecuteCursorQuery($query);
|
|
|
|
$object = $query->executeOne();
|
|
if (!$object) {
|
|
throw new Exception(
|
|
pht(
|
|
'Cursor "%s" does not identify a valid object.',
|
|
$cursor));
|
|
}
|
|
|
|
return $object;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task paging
|
|
*/
|
|
protected function willExecuteCursorQuery(
|
|
PhabricatorCursorPagedPolicyAwareQuery $query) {
|
|
return;
|
|
}
|
|
|
|
|
|
/**
|
|
* Simplifies the task of constructing a paging clause across multiple
|
|
* columns. In the general case, this looks like:
|
|
*
|
|
* A > a OR (A = a AND B > b) OR (A = a AND B = b AND C > c)
|
|
*
|
|
* To build a clause, specify the name, type, and value of each column
|
|
* to include:
|
|
*
|
|
* $this->buildPagingClauseFromMultipleColumns(
|
|
* $conn_r,
|
|
* array(
|
|
* array(
|
|
* 'table' => 't',
|
|
* 'column' => 'title',
|
|
* 'type' => 'string',
|
|
* 'value' => $cursor->getTitle(),
|
|
* 'reverse' => true,
|
|
* ),
|
|
* array(
|
|
* 'table' => 't',
|
|
* 'column' => 'id',
|
|
* 'type' => 'int',
|
|
* 'value' => $cursor->getID(),
|
|
* ),
|
|
* ),
|
|
* array(
|
|
* 'reversed' => $is_reversed,
|
|
* ));
|
|
*
|
|
* This method will then return a composable clause for inclusion in WHERE.
|
|
*
|
|
* @param AphrontDatabaseConnection Connection query will execute on.
|
|
* @param list<map> Column description dictionaries.
|
|
* @param map Additional constuction options.
|
|
* @return string Query clause.
|
|
* @task paging
|
|
*/
|
|
final protected function buildPagingClauseFromMultipleColumns(
|
|
AphrontDatabaseConnection $conn,
|
|
array $columns,
|
|
array $options) {
|
|
|
|
foreach ($columns as $column) {
|
|
PhutilTypeSpec::checkMap(
|
|
$column,
|
|
array(
|
|
'table' => 'optional string|null',
|
|
'column' => 'string',
|
|
'value' => 'wild',
|
|
'type' => 'string',
|
|
'reverse' => 'optional bool',
|
|
'unique' => 'optional bool',
|
|
'null' => 'optional string|null',
|
|
));
|
|
}
|
|
|
|
PhutilTypeSpec::checkMap(
|
|
$options,
|
|
array(
|
|
'reversed' => 'optional bool',
|
|
));
|
|
|
|
$is_query_reversed = idx($options, 'reversed', false);
|
|
|
|
$clauses = array();
|
|
$accumulated = array();
|
|
$last_key = last_key($columns);
|
|
foreach ($columns as $key => $column) {
|
|
$type = $column['type'];
|
|
|
|
$null = idx($column, 'null');
|
|
if ($column['value'] === null) {
|
|
if ($null) {
|
|
$value = null;
|
|
} else {
|
|
throw new Exception(
|
|
pht(
|
|
'Column "%s" has null value, but does not specify a null '.
|
|
'behavior.',
|
|
$key));
|
|
}
|
|
} else {
|
|
switch ($type) {
|
|
case 'int':
|
|
$value = qsprintf($conn, '%d', $column['value']);
|
|
break;
|
|
case 'float':
|
|
$value = qsprintf($conn, '%f', $column['value']);
|
|
break;
|
|
case 'string':
|
|
$value = qsprintf($conn, '%s', $column['value']);
|
|
break;
|
|
default:
|
|
throw new Exception(
|
|
pht(
|
|
'Column "%s" has unknown column type "%s".',
|
|
$column['column'],
|
|
$type));
|
|
}
|
|
}
|
|
|
|
$is_column_reversed = idx($column, 'reverse', false);
|
|
$reverse = ($is_query_reversed xor $is_column_reversed);
|
|
|
|
$clause = $accumulated;
|
|
|
|
$table_name = idx($column, 'table');
|
|
$column_name = $column['column'];
|
|
if ($table_name !== null) {
|
|
$field = qsprintf($conn, '%T.%T', $table_name, $column_name);
|
|
} else {
|
|
$field = qsprintf($conn, '%T', $column_name);
|
|
}
|
|
|
|
$parts = array();
|
|
if ($null) {
|
|
$can_page_if_null = ($null === 'head');
|
|
$can_page_if_nonnull = ($null === 'tail');
|
|
|
|
if ($reverse) {
|
|
$can_page_if_null = !$can_page_if_null;
|
|
$can_page_if_nonnull = !$can_page_if_nonnull;
|
|
}
|
|
|
|
$subclause = null;
|
|
if ($can_page_if_null && $value === null) {
|
|
$parts[] = qsprintf(
|
|
$conn,
|
|
'(%Q IS NOT NULL)',
|
|
$field);
|
|
} else if ($can_page_if_nonnull && $value !== null) {
|
|
$parts[] = qsprintf(
|
|
$conn,
|
|
'(%Q IS NULL)',
|
|
$field);
|
|
}
|
|
}
|
|
|
|
if ($value !== null) {
|
|
$parts[] = qsprintf(
|
|
$conn,
|
|
'%Q %Q %Q',
|
|
$field,
|
|
$reverse ? '>' : '<',
|
|
$value);
|
|
}
|
|
|
|
if ($parts) {
|
|
if (count($parts) > 1) {
|
|
$clause[] = '('.implode(') OR (', $parts).')';
|
|
} else {
|
|
$clause[] = head($parts);
|
|
}
|
|
}
|
|
|
|
if ($clause) {
|
|
if (count($clause) > 1) {
|
|
$clauses[] = '('.implode(') AND (', $clause).')';
|
|
} else {
|
|
$clauses[] = head($clause);
|
|
}
|
|
}
|
|
|
|
if ($value === null) {
|
|
$accumulated[] = qsprintf(
|
|
$conn,
|
|
'%Q IS NULL',
|
|
$field);
|
|
} else {
|
|
$accumulated[] = qsprintf(
|
|
$conn,
|
|
'%Q = %Q',
|
|
$field,
|
|
$value);
|
|
}
|
|
}
|
|
|
|
return '('.implode(') OR (', $clauses).')';
|
|
}
|
|
|
|
|
|
/* -( Result Ordering )---------------------------------------------------- */
|
|
|
|
|
|
/**
|
|
* Select a result ordering.
|
|
*
|
|
* This is a high-level method which selects an ordering from a predefined
|
|
* list of builtin orders, as provided by @{method:getBuiltinOrders}. These
|
|
* options are user-facing and not exhaustive, but are generally convenient
|
|
* and meaningful.
|
|
*
|
|
* You can also use @{method:setOrderVector} to specify a low-level ordering
|
|
* across individual orderable columns. This offers greater control but is
|
|
* also more involved.
|
|
*
|
|
* @param string Key of a builtin order supported by this query.
|
|
* @return this
|
|
* @task order
|
|
*/
|
|
public function setOrder($order) {
|
|
$orders = $this->getBuiltinOrders();
|
|
|
|
if (empty($orders[$order])) {
|
|
throw new Exception(
|
|
pht(
|
|
'Query "%s" does not support a builtin order "%s". Supported orders '.
|
|
'are: %s.',
|
|
get_class($this),
|
|
$order,
|
|
implode(', ', array_keys($orders))));
|
|
}
|
|
|
|
$this->builtinOrder = $order;
|
|
$this->orderVector = null;
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* Get builtin orders for this class.
|
|
*
|
|
* In application UIs, we want to be able to present users with a small
|
|
* selection of meaningful order options (like "Order by Title") rather than
|
|
* an exhaustive set of column ordering options.
|
|
*
|
|
* Meaningful user-facing orders are often really orders across multiple
|
|
* columns: for example, a "title" ordering is usually implemented as a
|
|
* "title, id" ordering under the hood.
|
|
*
|
|
* Builtin orders provide a mapping from convenient, understandable
|
|
* user-facing orders to implementations.
|
|
*
|
|
* A builtin order should provide these keys:
|
|
*
|
|
* - `vector` (`list<string>`): The actual order vector to use.
|
|
* - `name` (`string`): Human-readable order name.
|
|
*
|
|
* @return map<string, wild> Map from builtin order keys to specification.
|
|
* @task order
|
|
*/
|
|
public function getBuiltinOrders() {
|
|
$orders = array(
|
|
'newest' => array(
|
|
'vector' => array('id'),
|
|
'name' => pht('Creation (Newest First)'),
|
|
'aliases' => array('created'),
|
|
),
|
|
'oldest' => array(
|
|
'vector' => array('-id'),
|
|
'name' => pht('Creation (Oldest First)'),
|
|
),
|
|
);
|
|
|
|
$object = $this->newResultObject();
|
|
if ($object instanceof PhabricatorCustomFieldInterface) {
|
|
$list = PhabricatorCustomField::getObjectFields(
|
|
$object,
|
|
PhabricatorCustomField::ROLE_APPLICATIONSEARCH);
|
|
foreach ($list->getFields() as $field) {
|
|
$index = $field->buildOrderIndex();
|
|
if (!$index) {
|
|
continue;
|
|
}
|
|
|
|
$key = $field->getFieldKey();
|
|
$digest = $field->getFieldIndex();
|
|
|
|
$full_key = 'custom:'.$key;
|
|
$orders[$full_key] = array(
|
|
'vector' => array($full_key, 'id'),
|
|
'name' => $field->getFieldName(),
|
|
);
|
|
}
|
|
}
|
|
|
|
return $orders;
|
|
}
|
|
|
|
|
|
/**
|
|
* Set a low-level column ordering.
|
|
*
|
|
* This is a low-level method which offers granular control over column
|
|
* ordering. In most cases, applications can more easily use
|
|
* @{method:setOrder} to choose a high-level builtin order.
|
|
*
|
|
* To set an order vector, specify a list of order keys as provided by
|
|
* @{method:getOrderableColumns}.
|
|
*
|
|
* @param PhabricatorQueryOrderVector|list<string> List of order keys.
|
|
* @return this
|
|
* @task order
|
|
*/
|
|
public function setOrderVector($vector) {
|
|
$vector = PhabricatorQueryOrderVector::newFromVector($vector);
|
|
|
|
$orderable = $this->getOrderableColumns();
|
|
|
|
// Make sure that all the components identify valid columns.
|
|
$unique = array();
|
|
foreach ($vector as $order) {
|
|
$key = $order->getOrderKey();
|
|
if (empty($orderable[$key])) {
|
|
$valid = implode(', ', array_keys($orderable));
|
|
throw new Exception(
|
|
pht(
|
|
'This query ("%s") does not support sorting by order key "%s". '.
|
|
'Supported orders are: %s.',
|
|
get_class($this),
|
|
$key,
|
|
$valid));
|
|
}
|
|
|
|
$unique[$key] = idx($orderable[$key], 'unique', false);
|
|
}
|
|
|
|
// Make sure that the last column is unique so that this is a strong
|
|
// ordering which can be used for paging.
|
|
$last = last($unique);
|
|
if ($last !== true) {
|
|
throw new Exception(
|
|
pht(
|
|
'Order vector "%s" is invalid: the last column in an order must '.
|
|
'be a column with unique values, but "%s" is not unique.',
|
|
$vector->getAsString(),
|
|
last_key($unique)));
|
|
}
|
|
|
|
// Make sure that other columns are not unique; an ordering like "id, name"
|
|
// does not make sense because only "id" can ever have an effect.
|
|
array_pop($unique);
|
|
foreach ($unique as $key => $is_unique) {
|
|
if ($is_unique) {
|
|
throw new Exception(
|
|
pht(
|
|
'Order vector "%s" is invalid: only the last column in an order '.
|
|
'may be unique, but "%s" is a unique column and not the last '.
|
|
'column in the order.',
|
|
$vector->getAsString(),
|
|
$key));
|
|
}
|
|
}
|
|
|
|
$this->orderVector = $vector;
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* Get the effective order vector.
|
|
*
|
|
* @return PhabricatorQueryOrderVector Effective vector.
|
|
* @task order
|
|
*/
|
|
protected function getOrderVector() {
|
|
if (!$this->orderVector) {
|
|
if ($this->builtinOrder !== null) {
|
|
$builtin_order = idx($this->getBuiltinOrders(), $this->builtinOrder);
|
|
$vector = $builtin_order['vector'];
|
|
} else {
|
|
$vector = $this->getDefaultOrderVector();
|
|
}
|
|
$vector = PhabricatorQueryOrderVector::newFromVector($vector);
|
|
|
|
// We call setOrderVector() here to apply checks to the default vector.
|
|
// This catches any errors in the implementation.
|
|
$this->setOrderVector($vector);
|
|
}
|
|
|
|
return $this->orderVector;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task order
|
|
*/
|
|
protected function getDefaultOrderVector() {
|
|
return array('id');
|
|
}
|
|
|
|
|
|
/**
|
|
* @task order
|
|
*/
|
|
public function getOrderableColumns() {
|
|
$columns = array(
|
|
'id' => array(
|
|
'table' => $this->getPrimaryTableAlias(),
|
|
'column' => 'id',
|
|
'reverse' => false,
|
|
'type' => 'int',
|
|
'unique' => true,
|
|
),
|
|
);
|
|
|
|
$object = $this->newResultObject();
|
|
if ($object instanceof PhabricatorCustomFieldInterface) {
|
|
$list = PhabricatorCustomField::getObjectFields(
|
|
$object,
|
|
PhabricatorCustomField::ROLE_APPLICATIONSEARCH);
|
|
foreach ($list->getFields() as $field) {
|
|
$index = $field->buildOrderIndex();
|
|
if (!$index) {
|
|
continue;
|
|
}
|
|
|
|
$key = $field->getFieldKey();
|
|
$digest = $field->getFieldIndex();
|
|
|
|
$full_key = 'custom:'.$key;
|
|
$columns[$full_key] = array(
|
|
'table' => 'appsearch_order_'.$digest,
|
|
'column' => 'indexValue',
|
|
'type' => $index->getIndexValueType(),
|
|
'null' => 'tail',
|
|
);
|
|
}
|
|
}
|
|
|
|
return $columns;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task order
|
|
*/
|
|
final protected function buildOrderClause(AphrontDatabaseConnection $conn) {
|
|
$orderable = $this->getOrderableColumns();
|
|
$vector = $this->getOrderVector();
|
|
|
|
$parts = array();
|
|
foreach ($vector as $order) {
|
|
$part = $orderable[$order->getOrderKey()];
|
|
if ($order->getIsReversed()) {
|
|
$part['reverse'] = !idx($part, 'reverse', false);
|
|
}
|
|
$parts[] = $part;
|
|
}
|
|
|
|
return $this->formatOrderClause($conn, $parts);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task order
|
|
*/
|
|
protected function formatOrderClause(
|
|
AphrontDatabaseConnection $conn,
|
|
array $parts) {
|
|
|
|
$is_query_reversed = false;
|
|
if ($this->getBeforeID()) {
|
|
$is_query_reversed = !$is_query_reversed;
|
|
}
|
|
|
|
$sql = array();
|
|
foreach ($parts as $key => $part) {
|
|
$is_column_reversed = !empty($part['reverse']);
|
|
|
|
$descending = true;
|
|
if ($is_query_reversed) {
|
|
$descending = !$descending;
|
|
}
|
|
|
|
if ($is_column_reversed) {
|
|
$descending = !$descending;
|
|
}
|
|
|
|
$table = idx($part, 'table');
|
|
$column = $part['column'];
|
|
|
|
if ($table !== null) {
|
|
$field = qsprintf($conn, '%T.%T', $table, $column);
|
|
} else {
|
|
$field = qsprintf($conn, '%T', $column);
|
|
}
|
|
|
|
$null = idx($part, 'null');
|
|
if ($null) {
|
|
switch ($null) {
|
|
case 'head':
|
|
$null_field = qsprintf($conn, '(%Q IS NULL)', $field);
|
|
break;
|
|
case 'tail':
|
|
$null_field = qsprintf($conn, '(%Q IS NOT NULL)', $field);
|
|
break;
|
|
default:
|
|
throw new Exception(
|
|
pht(
|
|
'NULL value "%s" is invalid. Valid values are "head" and '.
|
|
'"tail".',
|
|
$null));
|
|
}
|
|
|
|
if ($descending) {
|
|
$sql[] = qsprintf($conn, '%Q DESC', $null_field);
|
|
} else {
|
|
$sql[] = qsprintf($conn, '%Q ASC', $null_field);
|
|
}
|
|
}
|
|
|
|
if ($descending) {
|
|
$sql[] = qsprintf($conn, '%Q DESC', $field);
|
|
} else {
|
|
$sql[] = qsprintf($conn, '%Q ASC', $field);
|
|
}
|
|
}
|
|
|
|
return qsprintf($conn, 'ORDER BY %Q', implode(', ', $sql));
|
|
}
|
|
|
|
|
|
/* -( Application Search )------------------------------------------------- */
|
|
|
|
|
|
/**
|
|
* Constrain the query with an ApplicationSearch index, requiring field values
|
|
* contain at least one of the values in a set.
|
|
*
|
|
* This constraint can build the most common types of queries, like:
|
|
*
|
|
* - Find users with shirt sizes "X" or "XL".
|
|
* - Find shoes with size "13".
|
|
*
|
|
* @param PhabricatorCustomFieldIndexStorage Table where the index is stored.
|
|
* @param string|list<string> One or more values to filter by.
|
|
* @return this
|
|
* @task appsearch
|
|
*/
|
|
public function withApplicationSearchContainsConstraint(
|
|
PhabricatorCustomFieldIndexStorage $index,
|
|
$value) {
|
|
|
|
$this->applicationSearchConstraints[] = array(
|
|
'type' => $index->getIndexValueType(),
|
|
'cond' => '=',
|
|
'table' => $index->getTableName(),
|
|
'index' => $index->getIndexKey(),
|
|
'value' => $value,
|
|
);
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* Constrain the query with an ApplicationSearch index, requiring values
|
|
* exist in a given range.
|
|
*
|
|
* This constraint is useful for expressing date ranges:
|
|
*
|
|
* - Find events between July 1st and July 7th.
|
|
*
|
|
* The ends of the range are inclusive, so a `$min` of `3` and a `$max` of
|
|
* `5` will match fields with values `3`, `4`, or `5`. Providing `null` for
|
|
* either end of the range will leave that end of the constraint open.
|
|
*
|
|
* @param PhabricatorCustomFieldIndexStorage Table where the index is stored.
|
|
* @param int|null Minimum permissible value, inclusive.
|
|
* @param int|null Maximum permissible value, inclusive.
|
|
* @return this
|
|
* @task appsearch
|
|
*/
|
|
public function withApplicationSearchRangeConstraint(
|
|
PhabricatorCustomFieldIndexStorage $index,
|
|
$min,
|
|
$max) {
|
|
|
|
$index_type = $index->getIndexValueType();
|
|
if ($index_type != 'int') {
|
|
throw new Exception(
|
|
pht(
|
|
'Attempting to apply a range constraint to a field with index type '.
|
|
'"%s", expected type "%s".',
|
|
$index_type,
|
|
'int'));
|
|
}
|
|
|
|
$this->applicationSearchConstraints[] = array(
|
|
'type' => $index->getIndexValueType(),
|
|
'cond' => 'range',
|
|
'table' => $index->getTableName(),
|
|
'index' => $index->getIndexKey(),
|
|
'value' => array($min, $max),
|
|
);
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* Order the results by an ApplicationSearch index.
|
|
*
|
|
* @param PhabricatorCustomField Field to which the index belongs.
|
|
* @param PhabricatorCustomFieldIndexStorage Table where the index is stored.
|
|
* @param bool True to sort ascending.
|
|
* @return this
|
|
* @task appsearch
|
|
*/
|
|
public function withApplicationSearchOrder(
|
|
PhabricatorCustomField $field,
|
|
PhabricatorCustomFieldIndexStorage $index,
|
|
$ascending) {
|
|
|
|
$this->applicationSearchOrders[] = array(
|
|
'key' => $field->getFieldKey(),
|
|
'type' => $index->getIndexValueType(),
|
|
'table' => $index->getTableName(),
|
|
'index' => $index->getIndexKey(),
|
|
'ascending' => $ascending,
|
|
);
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* Get the name of the query's primary object PHID column, for constructing
|
|
* JOIN clauses. Normally (and by default) this is just `"phid"`, but it may
|
|
* be something more exotic.
|
|
*
|
|
* See @{method:getPrimaryTableAlias} if the column needs to be qualified with
|
|
* a table alias.
|
|
*
|
|
* @return string Column name.
|
|
* @task appsearch
|
|
*/
|
|
protected function getApplicationSearchObjectPHIDColumn() {
|
|
if ($this->getPrimaryTableAlias()) {
|
|
$prefix = $this->getPrimaryTableAlias().'.';
|
|
} else {
|
|
$prefix = '';
|
|
}
|
|
|
|
return $prefix.'phid';
|
|
}
|
|
|
|
|
|
/**
|
|
* Determine if the JOINs built by ApplicationSearch might cause each primary
|
|
* object to return multiple result rows. Generally, this means the query
|
|
* needs an extra GROUP BY clause.
|
|
*
|
|
* @return bool True if the query may return multiple rows for each object.
|
|
* @task appsearch
|
|
*/
|
|
protected function getApplicationSearchMayJoinMultipleRows() {
|
|
foreach ($this->applicationSearchConstraints as $constraint) {
|
|
$type = $constraint['type'];
|
|
$value = $constraint['value'];
|
|
$cond = $constraint['cond'];
|
|
|
|
switch ($cond) {
|
|
case '=':
|
|
switch ($type) {
|
|
case 'string':
|
|
case 'int':
|
|
if (count((array)$value) > 1) {
|
|
return true;
|
|
}
|
|
break;
|
|
default:
|
|
throw new Exception(pht('Unknown index type "%s"!', $type));
|
|
}
|
|
break;
|
|
case 'range':
|
|
// NOTE: It's possible to write a custom field where multiple rows
|
|
// match a range constraint, but we don't currently ship any in the
|
|
// upstream and I can't immediately come up with cases where this
|
|
// would make sense.
|
|
break;
|
|
default:
|
|
throw new Exception(pht('Unknown constraint condition "%s"!', $cond));
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
/**
|
|
* Construct a GROUP BY clause appropriate for ApplicationSearch constraints.
|
|
*
|
|
* @param AphrontDatabaseConnection Connection executing the query.
|
|
* @return string Group clause.
|
|
* @task appsearch
|
|
*/
|
|
protected function buildApplicationSearchGroupClause(
|
|
AphrontDatabaseConnection $conn_r) {
|
|
|
|
if ($this->getApplicationSearchMayJoinMultipleRows()) {
|
|
return qsprintf(
|
|
$conn_r,
|
|
'GROUP BY %Q',
|
|
$this->getApplicationSearchObjectPHIDColumn());
|
|
} else {
|
|
return '';
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Construct a JOIN clause appropriate for applying ApplicationSearch
|
|
* constraints.
|
|
*
|
|
* @param AphrontDatabaseConnection Connection executing the query.
|
|
* @return string Join clause.
|
|
* @task appsearch
|
|
*/
|
|
protected function buildApplicationSearchJoinClause(
|
|
AphrontDatabaseConnection $conn_r) {
|
|
|
|
$joins = array();
|
|
foreach ($this->applicationSearchConstraints as $key => $constraint) {
|
|
$table = $constraint['table'];
|
|
$alias = 'appsearch_'.$key;
|
|
$index = $constraint['index'];
|
|
$cond = $constraint['cond'];
|
|
$phid_column = $this->getApplicationSearchObjectPHIDColumn();
|
|
switch ($cond) {
|
|
case '=':
|
|
$type = $constraint['type'];
|
|
switch ($type) {
|
|
case 'string':
|
|
$constraint_clause = qsprintf(
|
|
$conn_r,
|
|
'%T.indexValue IN (%Ls)',
|
|
$alias,
|
|
(array)$constraint['value']);
|
|
break;
|
|
case 'int':
|
|
$constraint_clause = qsprintf(
|
|
$conn_r,
|
|
'%T.indexValue IN (%Ld)',
|
|
$alias,
|
|
(array)$constraint['value']);
|
|
break;
|
|
default:
|
|
throw new Exception(pht('Unknown index type "%s"!', $type));
|
|
}
|
|
|
|
$joins[] = qsprintf(
|
|
$conn_r,
|
|
'JOIN %T %T ON %T.objectPHID = %Q
|
|
AND %T.indexKey = %s
|
|
AND (%Q)',
|
|
$table,
|
|
$alias,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$index,
|
|
$constraint_clause);
|
|
break;
|
|
case 'range':
|
|
list($min, $max) = $constraint['value'];
|
|
if (($min === null) && ($max === null)) {
|
|
// If there's no actual range constraint, just move on.
|
|
break;
|
|
}
|
|
|
|
if ($min === null) {
|
|
$constraint_clause = qsprintf(
|
|
$conn_r,
|
|
'%T.indexValue <= %d',
|
|
$alias,
|
|
$max);
|
|
} else if ($max === null) {
|
|
$constraint_clause = qsprintf(
|
|
$conn_r,
|
|
'%T.indexValue >= %d',
|
|
$alias,
|
|
$min);
|
|
} else {
|
|
$constraint_clause = qsprintf(
|
|
$conn_r,
|
|
'%T.indexValue BETWEEN %d AND %d',
|
|
$alias,
|
|
$min,
|
|
$max);
|
|
}
|
|
|
|
$joins[] = qsprintf(
|
|
$conn_r,
|
|
'JOIN %T %T ON %T.objectPHID = %Q
|
|
AND %T.indexKey = %s
|
|
AND (%Q)',
|
|
$table,
|
|
$alias,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$index,
|
|
$constraint_clause);
|
|
break;
|
|
default:
|
|
throw new Exception(pht('Unknown constraint condition "%s"!', $cond));
|
|
}
|
|
}
|
|
|
|
foreach ($this->applicationSearchOrders as $key => $order) {
|
|
$table = $order['table'];
|
|
$index = $order['index'];
|
|
$alias = 'appsearch_order_'.$index;
|
|
$phid_column = $this->getApplicationSearchObjectPHIDColumn();
|
|
|
|
$joins[] = qsprintf(
|
|
$conn_r,
|
|
'LEFT JOIN %T %T ON %T.objectPHID = %Q
|
|
AND %T.indexKey = %s',
|
|
$table,
|
|
$alias,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$index);
|
|
}
|
|
|
|
return implode(' ', $joins);
|
|
}
|
|
|
|
|
|
/* -( Integration with CustomField )--------------------------------------- */
|
|
|
|
|
|
/**
|
|
* @task customfield
|
|
*/
|
|
protected function getPagingValueMapForCustomFields(
|
|
PhabricatorCustomFieldInterface $object) {
|
|
|
|
// We have to get the current field values on the cursor object.
|
|
$fields = PhabricatorCustomField::getObjectFields(
|
|
$object,
|
|
PhabricatorCustomField::ROLE_APPLICATIONSEARCH);
|
|
$fields->setViewer($this->getViewer());
|
|
$fields->readFieldsFromStorage($object);
|
|
|
|
$map = array();
|
|
foreach ($fields->getFields() as $field) {
|
|
$map['custom:'.$field->getFieldKey()] = $field->getValueForStorage();
|
|
}
|
|
|
|
return $map;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task customfield
|
|
*/
|
|
protected function isCustomFieldOrderKey($key) {
|
|
$prefix = 'custom:';
|
|
return !strncmp($key, $prefix, strlen($prefix));
|
|
}
|
|
|
|
|
|
/* -( Edge Logic )--------------------------------------------------------- */
|
|
|
|
|
|
/**
|
|
* Convenience method for specifying edge logic constraints with a list of
|
|
* PHIDs.
|
|
*
|
|
* @param const Edge constant.
|
|
* @param const Constraint operator.
|
|
* @param list<phid> List of PHIDs.
|
|
* @return this
|
|
* @task edgelogic
|
|
*/
|
|
public function withEdgeLogicPHIDs($edge_type, $operator, array $phids) {
|
|
$constraints = array();
|
|
foreach ($phids as $phid) {
|
|
$constraints[] = new PhabricatorQueryConstraint($operator, $phid);
|
|
}
|
|
|
|
return $this->withEdgeLogicConstraints($edge_type, $constraints);
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function withEdgeLogicConstraints($edge_type, array $constraints) {
|
|
assert_instances_of($constraints, 'PhabricatorQueryConstraint');
|
|
|
|
$constraints = mgroup($constraints, 'getOperator');
|
|
foreach ($constraints as $operator => $list) {
|
|
foreach ($list as $item) {
|
|
$value = $item->getValue();
|
|
$this->edgeLogicConstraints[$edge_type][$operator][$value] = $item;
|
|
}
|
|
}
|
|
|
|
$this->edgeLogicConstraintsAreValid = false;
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function buildEdgeLogicSelectClause(AphrontDatabaseConnection $conn) {
|
|
$select = array();
|
|
|
|
$this->validateEdgeLogicConstraints();
|
|
|
|
foreach ($this->edgeLogicConstraints as $type => $constraints) {
|
|
foreach ($constraints as $operator => $list) {
|
|
$alias = $this->getEdgeLogicTableAlias($operator, $type);
|
|
switch ($operator) {
|
|
case PhabricatorQueryConstraint::OPERATOR_AND:
|
|
if (count($list) > 1) {
|
|
$select[] = qsprintf(
|
|
$conn,
|
|
'COUNT(DISTINCT(%T.dst)) %T',
|
|
$alias,
|
|
$this->buildEdgeLogicTableAliasCount($alias));
|
|
}
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
return $select;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function buildEdgeLogicJoinClause(AphrontDatabaseConnection $conn) {
|
|
$edge_table = PhabricatorEdgeConfig::TABLE_NAME_EDGE;
|
|
$phid_column = $this->getApplicationSearchObjectPHIDColumn();
|
|
|
|
$joins = array();
|
|
foreach ($this->edgeLogicConstraints as $type => $constraints) {
|
|
|
|
$op_null = PhabricatorQueryConstraint::OPERATOR_NULL;
|
|
$has_null = isset($constraints[$op_null]);
|
|
|
|
foreach ($constraints as $operator => $list) {
|
|
$alias = $this->getEdgeLogicTableAlias($operator, $type);
|
|
switch ($operator) {
|
|
case PhabricatorQueryConstraint::OPERATOR_NOT:
|
|
$joins[] = qsprintf(
|
|
$conn,
|
|
'LEFT JOIN %T %T ON %Q = %T.src AND %T.type = %d
|
|
AND %T.dst IN (%Ls)',
|
|
$edge_table,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$alias,
|
|
$type,
|
|
$alias,
|
|
mpull($list, 'getValue'));
|
|
break;
|
|
case PhabricatorQueryConstraint::OPERATOR_AND:
|
|
case PhabricatorQueryConstraint::OPERATOR_OR:
|
|
// If we're including results with no matches, we have to degrade
|
|
// this to a LEFT join. We'll use WHERE to select matching rows
|
|
// later.
|
|
if ($has_null) {
|
|
$join_type = 'LEFT';
|
|
} else {
|
|
$join_type = '';
|
|
}
|
|
|
|
$joins[] = qsprintf(
|
|
$conn,
|
|
'%Q JOIN %T %T ON %Q = %T.src AND %T.type = %d
|
|
AND %T.dst IN (%Ls)',
|
|
$join_type,
|
|
$edge_table,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$alias,
|
|
$type,
|
|
$alias,
|
|
mpull($list, 'getValue'));
|
|
break;
|
|
case PhabricatorQueryConstraint::OPERATOR_NULL:
|
|
$joins[] = qsprintf(
|
|
$conn,
|
|
'LEFT JOIN %T %T ON %Q = %T.src AND %T.type = %d',
|
|
$edge_table,
|
|
$alias,
|
|
$phid_column,
|
|
$alias,
|
|
$alias,
|
|
$type);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
return $joins;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function buildEdgeLogicWhereClause(AphrontDatabaseConnection $conn) {
|
|
$where = array();
|
|
|
|
foreach ($this->edgeLogicConstraints as $type => $constraints) {
|
|
|
|
$full = array();
|
|
$null = array();
|
|
|
|
$op_null = PhabricatorQueryConstraint::OPERATOR_NULL;
|
|
$has_null = isset($constraints[$op_null]);
|
|
|
|
foreach ($constraints as $operator => $list) {
|
|
$alias = $this->getEdgeLogicTableAlias($operator, $type);
|
|
switch ($operator) {
|
|
case PhabricatorQueryConstraint::OPERATOR_NOT:
|
|
$full[] = qsprintf(
|
|
$conn,
|
|
'%T.dst IS NULL',
|
|
$alias);
|
|
break;
|
|
case PhabricatorQueryConstraint::OPERATOR_AND:
|
|
case PhabricatorQueryConstraint::OPERATOR_OR:
|
|
if ($has_null) {
|
|
$full[] = qsprintf(
|
|
$conn,
|
|
'%T.dst IS NOT NULL',
|
|
$alias);
|
|
}
|
|
break;
|
|
case PhabricatorQueryConstraint::OPERATOR_NULL:
|
|
$null[] = qsprintf(
|
|
$conn,
|
|
'%T.dst IS NULL',
|
|
$alias);
|
|
break;
|
|
}
|
|
}
|
|
|
|
if ($full && $null) {
|
|
$full = $this->formatWhereSubclause($full);
|
|
$null = $this->formatWhereSubclause($null);
|
|
$where[] = qsprintf($conn, '(%Q OR %Q)', $full, $null);
|
|
} else if ($full) {
|
|
foreach ($full as $condition) {
|
|
$where[] = $condition;
|
|
}
|
|
} else if ($null) {
|
|
foreach ($null as $condition) {
|
|
$where[] = $condition;
|
|
}
|
|
}
|
|
}
|
|
|
|
return $where;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function buildEdgeLogicHavingClause(AphrontDatabaseConnection $conn) {
|
|
$having = array();
|
|
|
|
foreach ($this->edgeLogicConstraints as $type => $constraints) {
|
|
foreach ($constraints as $operator => $list) {
|
|
$alias = $this->getEdgeLogicTableAlias($operator, $type);
|
|
switch ($operator) {
|
|
case PhabricatorQueryConstraint::OPERATOR_AND:
|
|
if (count($list) > 1) {
|
|
$having[] = qsprintf(
|
|
$conn,
|
|
'%T = %d',
|
|
$this->buildEdgeLogicTableAliasCount($alias),
|
|
count($list));
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
return $having;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
public function shouldGroupEdgeLogicResultRows() {
|
|
foreach ($this->edgeLogicConstraints as $type => $constraints) {
|
|
foreach ($constraints as $operator => $list) {
|
|
switch ($operator) {
|
|
case PhabricatorQueryConstraint::OPERATOR_NOT:
|
|
case PhabricatorQueryConstraint::OPERATOR_AND:
|
|
case PhabricatorQueryConstraint::OPERATOR_OR:
|
|
if (count($list) > 1) {
|
|
return true;
|
|
}
|
|
break;
|
|
case PhabricatorQueryConstraint::OPERATOR_NULL:
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
private function getEdgeLogicTableAlias($operator, $type) {
|
|
return 'edgelogic_'.$operator.'_'.$type;
|
|
}
|
|
|
|
|
|
/**
|
|
* @task edgelogic
|
|
*/
|
|
private function buildEdgeLogicTableAliasCount($alias) {
|
|
return $alias.'_count';
|
|
}
|
|
|
|
|
|
/**
|
|
* Select certain edge logic constraint values.
|
|
*
|
|
* @task edgelogic
|
|
*/
|
|
protected function getEdgeLogicValues(
|
|
array $edge_types,
|
|
array $operators) {
|
|
|
|
$values = array();
|
|
|
|
$constraint_lists = $this->edgeLogicConstraints;
|
|
if ($edge_types) {
|
|
$constraint_lists = array_select_keys($constraint_lists, $edge_types);
|
|
}
|
|
|
|
foreach ($constraint_lists as $type => $constraints) {
|
|
if ($operators) {
|
|
$constraints = array_select_keys($constraints, $operators);
|
|
}
|
|
foreach ($constraints as $operator => $list) {
|
|
foreach ($list as $constraint) {
|
|
$values[] = $constraint->getValue();
|
|
}
|
|
}
|
|
}
|
|
|
|
return $values;
|
|
}
|
|
|
|
|
|
/**
|
|
* Validate edge logic constraints for the query.
|
|
*
|
|
* @return this
|
|
* @task edgelogic
|
|
*/
|
|
private function validateEdgeLogicConstraints() {
|
|
if ($this->edgeLogicConstraintsAreValid) {
|
|
return $this;
|
|
}
|
|
|
|
// This should probably be more modular, eventually, but we only do
|
|
// project-based edge logic today.
|
|
|
|
$project_phids = $this->getEdgeLogicValues(
|
|
array(
|
|
PhabricatorProjectObjectHasProjectEdgeType::EDGECONST,
|
|
),
|
|
array(
|
|
PhabricatorQueryConstraint::OPERATOR_AND,
|
|
PhabricatorQueryConstraint::OPERATOR_OR,
|
|
PhabricatorQueryConstraint::OPERATOR_NOT,
|
|
));
|
|
if ($project_phids) {
|
|
$projects = id(new PhabricatorProjectQuery())
|
|
->setViewer($this->getViewer())
|
|
->setParentQuery($this)
|
|
->withPHIDs($project_phids)
|
|
->execute();
|
|
$projects = mpull($projects, null, 'getPHID');
|
|
foreach ($project_phids as $phid) {
|
|
if (empty($projects[$phid])) {
|
|
throw new PhabricatorEmptyQueryException(
|
|
pht(
|
|
'This query is constrained by a project you do not have '.
|
|
'permission to see.'));
|
|
}
|
|
}
|
|
}
|
|
|
|
$this->edgeLogicConstraintsAreValid = true;
|
|
|
|
return $this;
|
|
}
|
|
|
|
|
|
}
|