mirror of
https://github.com/hasura/graphql-engine.git
synced 2024-12-17 20:41:49 +03:00
fd30fb343b
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/3982 Co-authored-by: Brandon Simmons <210815+jberryman@users.noreply.github.com> GitOrigin-RevId: f90b2e8f394e7bd69780f003d2d980475f104f42
321 lines
12 KiB
Haskell
321 lines
12 KiB
Haskell
-- | This module defines the type class 'BackendSchema' and auxiliary types.
|
|
--
|
|
-- 'BackendSchema' represents the part of the interface that a backend driver
|
|
-- presents to the GraphQL Engine core that is responsible for generating
|
|
-- the backend's Schema Parsers.
|
|
--
|
|
-- The Schema Parsers recognise (and reflect) the schema that a backend exposes.
|
|
--
|
|
-- The 'BackendSchema' methods are used by
|
|
-- 'Hasura.GraphQL.Schema.buildGQLContext', which is the core's entrypoint to
|
|
-- schema generation.
|
|
--
|
|
-- Many of the 'BackendSchema' methods will have default implementations that a
|
|
-- backend driver may use. These may be found (chiefly) in the modules:
|
|
--
|
|
-- * The module "Hasura.GraphQL.Schema.Build", commonly qualified @GSB@
|
|
-- * "Hasura.GraphQL.Schema.Select", commonly qualified @GSS@
|
|
-- * "Hasura.GraphQL.Schema.BoolExp"
|
|
--
|
|
-- For more information see:
|
|
--
|
|
-- * <https://github.com/hasura/graphql-engine/blob/master/server/documentation/schema.md Technical overview of Schema Generation >
|
|
-- * The type 'Hasura.GraphQL.Parser.Parser', and associated source code notes
|
|
-- in the same folder (not exposed with Haddock unfortunately)
|
|
module Hasura.GraphQL.Schema.Backend
|
|
( -- * Main Types
|
|
BackendSchema (..),
|
|
MonadBuildSchema,
|
|
|
|
-- * Auxiliary Types
|
|
ComparisonExp,
|
|
|
|
-- * Note: @BackendSchema@ modelling principles
|
|
-- $modelling
|
|
)
|
|
where
|
|
|
|
import Data.Has
|
|
import Data.Text.Casing (GQLNameIdentifier)
|
|
import Hasura.Base.Error
|
|
import Hasura.GraphQL.Parser hiding (Type)
|
|
import Hasura.GraphQL.Schema.Common
|
|
import Hasura.Prelude
|
|
import Hasura.RQL.IR
|
|
import Hasura.RQL.IR.Insert qualified as IR
|
|
import Hasura.RQL.IR.Select qualified as IR
|
|
import Hasura.RQL.Types.Backend
|
|
import Hasura.RQL.Types.Column hiding (EnumValueInfo)
|
|
import Hasura.RQL.Types.Common
|
|
import Hasura.RQL.Types.ComputedField
|
|
import Hasura.RQL.Types.Function
|
|
import Hasura.RQL.Types.Relationships.Local
|
|
import Hasura.RQL.Types.SchemaCache
|
|
import Hasura.RQL.Types.SourceCustomization (NamingCase)
|
|
import Hasura.RQL.Types.Table
|
|
import Hasura.SQL.Backend
|
|
import Language.GraphQL.Draft.Syntax qualified as G
|
|
|
|
-- TODO: Might it make sense to add those constraints to MonadSchema directly?
|
|
|
|
-- | Bag of constraints available to the methods of @BackendSchema@.
|
|
--
|
|
-- Note that @BackendSchema b@ is itself part of this, so a methods may also
|
|
-- call other methods. This might seem trivial, but it can be easy to miss when
|
|
-- the functions used to implement a class instance are defined in multiple
|
|
-- modules.
|
|
type MonadBuildSchema b r m n =
|
|
( BackendSchema b,
|
|
MonadBuildSchemaBase r m n
|
|
)
|
|
|
|
-- | This type class is responsible for generating the schema of a backend.
|
|
-- Its methods are called by the common core that orchestrates the various
|
|
-- backend drivers.
|
|
--
|
|
-- Its purpose in life is to make it convenient to express the GraphQL schema we
|
|
-- want to expose for the backends that we support. This means balancing the
|
|
-- desire to have consistency with the desire to differentiate the schema of a
|
|
-- backend.
|
|
--
|
|
-- This means that it is expected to evolve over time as we add new backends,
|
|
-- and that you have the license to change it: Whatever form it currently takes
|
|
-- only reflects status quo current implementation.
|
|
--
|
|
-- The module "Hasura.GraphQL.Schema.Build" (commonly qualified as @GSB@)
|
|
-- provides standard building blocks for implementing many methods of this
|
|
-- class. And as such, these two modules are very much expected to evolve in
|
|
-- tandem.
|
|
--
|
|
-- See <#modelling Note BackendSchema modelling principles>.
|
|
class
|
|
( Backend b,
|
|
Eq (BooleanOperators b (UnpreparedValue b)),
|
|
Eq (FunctionArgumentExp b (UnpreparedValue b))
|
|
) =>
|
|
BackendSchema (b :: BackendType)
|
|
where
|
|
-- top level parsers
|
|
buildTableQueryFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
GQLNameIdentifier ->
|
|
m [FieldParser n (QueryDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
buildTableStreamingSubscriptionFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
GQLNameIdentifier ->
|
|
m [FieldParser n (QueryDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
buildTableRelayQueryFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
GQLNameIdentifier ->
|
|
NESeq (ColumnInfo b) ->
|
|
m [FieldParser n (QueryDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
buildTableInsertMutationFields ::
|
|
MonadBuildSchema b r m n =>
|
|
Scenario ->
|
|
SourceName ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
GQLNameIdentifier ->
|
|
m [FieldParser n (AnnotatedInsert b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
-- | This method is responsible for building the GraphQL Schema for mutations
|
|
-- backed by @UPDATE@ statements on some table, as described in
|
|
-- @https://hasura.io/docs/latest/graphql/core/databases/postgres/mutations/update.html@.
|
|
--
|
|
-- The suggested way to implement this is using building blocks in GSB, c.f.
|
|
-- its namesake @GSB.@'Hasura.GraphQL.Schema.Build.buildTableUpdateMutationFields'.
|
|
buildTableUpdateMutationFields ::
|
|
MonadBuildSchema b r m n =>
|
|
-- | The source that the table lives in
|
|
SourceName ->
|
|
-- | The name of the table being acted on
|
|
TableName b ->
|
|
-- | table info
|
|
TableInfo b ->
|
|
-- | field display name
|
|
GQLNameIdentifier ->
|
|
m [FieldParser n (AnnotatedUpdateG b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
buildTableDeleteMutationFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
GQLNameIdentifier ->
|
|
m [FieldParser n (AnnDelG b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
buildFunctionQueryFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
FunctionName b ->
|
|
FunctionInfo b ->
|
|
TableName b ->
|
|
m [FieldParser n (QueryDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
buildFunctionRelayQueryFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
FunctionName b ->
|
|
FunctionInfo b ->
|
|
TableName b ->
|
|
NESeq (ColumnInfo b) ->
|
|
m [FieldParser n (QueryDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
buildFunctionMutationFields ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
FunctionName b ->
|
|
FunctionInfo b ->
|
|
TableName b ->
|
|
m [FieldParser n (MutationDB b (RemoteRelationshipField UnpreparedValue) (UnpreparedValue b))]
|
|
|
|
-- table components
|
|
tableArguments ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
TableInfo b ->
|
|
m (InputFieldsParser n (IR.SelectArgsG b (UnpreparedValue b)))
|
|
|
|
-- | Make a parser for relationships. Default implementaton elides
|
|
-- relationships altogether.
|
|
mkRelationshipParser ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
RelInfo b ->
|
|
m (Maybe (InputFieldsParser n (Maybe (IR.AnnotatedInsertField b (UnpreparedValue b)))))
|
|
mkRelationshipParser _ _ = pure Nothing
|
|
|
|
-- backend extensions
|
|
relayExtension :: Maybe (XRelay b)
|
|
nodesAggExtension :: Maybe (XNodesAgg b)
|
|
streamSubscriptionExtension :: Maybe (XStreamingSubscription b)
|
|
|
|
-- individual components
|
|
columnParser ::
|
|
(MonadSchema n m, MonadError QErr m, MonadReader r m, Has MkTypename r, Has NamingCase r) =>
|
|
ColumnType b ->
|
|
G.Nullability -> -- TODO maybe use Hasura.GraphQL.Parser.Schema.Nullability instead?
|
|
m (Parser 'Both n (ValueWithOrigin (ColumnValue b)))
|
|
|
|
-- | Parser for arguments on scalar fields in a selection set
|
|
scalarSelectionArgumentsParser ::
|
|
MonadParse n =>
|
|
ColumnType b ->
|
|
InputFieldsParser n (Maybe (ScalarSelectionArguments b))
|
|
|
|
orderByOperators ::
|
|
NamingCase ->
|
|
NonEmpty (Definition EnumValueInfo, (BasicOrderType b, NullsOrderType b))
|
|
comparisonExps ::
|
|
MonadBuildSchema b r m n =>
|
|
ColumnType b ->
|
|
m (Parser 'Input n [ComparisonExp b])
|
|
|
|
-- | The input fields parser, for "count" aggregate field, yielding a function
|
|
-- which generates @'CountType b' from optional "distinct" field value
|
|
countTypeInput ::
|
|
MonadParse n =>
|
|
Maybe (Parser 'Both n (Column b)) ->
|
|
InputFieldsParser n (CountDistinct -> CountType b)
|
|
|
|
aggregateOrderByCountType :: ScalarType b
|
|
|
|
-- | Computed field parser
|
|
computedField ::
|
|
MonadBuildSchema b r m n =>
|
|
SourceName ->
|
|
ComputedFieldInfo b ->
|
|
TableName b ->
|
|
TableInfo b ->
|
|
m (Maybe (FieldParser n (AnnotatedField b)))
|
|
|
|
-- | The 'node' root field of a Relay request.
|
|
node ::
|
|
MonadBuildSchema b r m n =>
|
|
m (Parser 'Output n (HashMap (TableName b) (SourceName, SourceConfig b, SelPermInfo b, PrimaryKeyColumns b, AnnotatedFields b)))
|
|
|
|
type ComparisonExp b = OpExpG b (UnpreparedValue b)
|
|
|
|
-- $modelling
|
|
-- #modelling#
|
|
--
|
|
-- In its current form, we model every component, from the top level (query,
|
|
-- insert mutation, etc.) of the schema down to its leaf values, as a type class
|
|
-- method of @BackendSchema@.
|
|
--
|
|
-- Consider, for example, the following query for a given table "author":
|
|
--
|
|
-- > query {
|
|
-- > author(where: {id: {_eq: 2}}) {
|
|
-- > name
|
|
-- > }
|
|
-- > }
|
|
--
|
|
-- The chain of functions leading to a parser for this RootField will be along
|
|
-- the lines of:
|
|
--
|
|
-- > > BackendSchema.buildTableQueryFields (Suggested default its GSB namesake)
|
|
-- > > GSS.selectTable
|
|
-- > > BackendSchema.tableArguments (Suggested default implementation being
|
|
-- > GSS.defaultTableArgs)
|
|
-- > > GSS.tableWhereArg
|
|
-- > > GSBE.boolExp
|
|
-- > > BackendSchema.comparisonExps
|
|
-- > > BackendSchema.columnParser
|
|
-- >
|
|
-- > > tableSelectionSet (...)
|
|
-- > > fieldSelection
|
|
--
|
|
-- (where the abbreviation @GSB@ refers to "Hasura.GraphQL.Schema.Build" and @GSS@
|
|
-- refers to "Hasura.GraphQL.Schema.Select", and @GSBE@ refers to
|
|
-- "Hasura.GraphQL.Schema.BoolExp".)
|
|
--
|
|
-- Several of those steps are part of the class, meaning that a backend can
|
|
-- customize part of this tree without having to reimplement all of it. For
|
|
-- instance, a backend that supports a different set ot table arguments can
|
|
-- choose to reimplement 'tableArguments', but can still use
|
|
-- 'Hasura.GraphQL.Schema.Select.tableWhereArg' in its custom implementation.
|
|
--
|
|
-- Applying the above modelling guidelines has pros and cons:
|
|
--
|
|
-- * Pro: You can specify both shared and diverging behavior.
|
|
-- * Pro: You can specify a lot of behavior implicitly, i.e. it's easy to write.
|
|
-- * Con: You can specify a lot of behavior implicitly, i.e. it's hard do
|
|
-- understand without tracing through implementations.
|
|
-- * Con: You get a proliferation of type class methods and it's difficult to
|
|
-- understand how they fit together.
|
|
--
|
|
-- == Going forward, we want to follow some different modelling guidelines:
|
|
--
|
|
-- We should break up / refactor the building blocks (in
|
|
-- "Hasura.GraphQL.Schema.Build" etc.) which are used to implement the top-level
|
|
-- type class methods (e.g. @BackendSchema@.'buildTableQueryFields', c.f.
|
|
-- @GSB.@'Hasura.GraphQL.Schema.Build.buildTableQueryFields', etc.) and have them
|
|
-- invoke the backend-specific behaviors they rely on via /function arguments/
|
|
-- instead of other type class methods.
|
|
--
|
|
-- When we do this, the function call sites (which will often be in @instance
|
|
-- BackendSchema ...@) becomes the centralised place where we decide which behavior
|
|
-- variation to follow.
|
|
--
|
|
-- When faced with answering the question of "what does this method do, and how does
|
|
-- it do it?", at least you will have listed the other components it depends on
|
|
-- front and center without having to trace through its implementation.
|
|
--
|
|
-- That is of course, if we refactor our building blocks mindfully into
|
|
-- conceptually meaningful units. Otherwise we'll just end up with an
|
|
-- incomprehensible mass of poorly shaped pieces. And we will still have a hard
|
|
-- time explaining what they do.
|
|
--
|
|
-- In other words, It is still the case that if you don't clean your room
|
|
-- you'll be living in a mess.
|