diff --git a/404.html b/404.html index 7bf4a241b..f9aaf014c 100644 --- a/404.html +++ b/404.html @@ -5,14 +5,14 @@ Page Not Found | Glean - +
Skip to main content

Page Not Found

We could not find what you were looking for.

Please contact the owner of the site that linked you to the original URL and let them know their link is broken.

- + \ No newline at end of file diff --git a/_src/cli.md b/_src/cli.md index 3b09621a0..92a0eeee2 100644 --- a/_src/cli.md +++ b/_src/cli.md @@ -24,6 +24,20 @@ hash or revision of a repository. The available commands are as follows: +### `glean list` + +List the available databases. + +* `[DBNAME]`
+List only databases that match `DBNAME` +* `--format (tty|plain|json|compact-json)`
+Various different formats for the output. JSON is useful for +processing and filtering the result in a script, e.g. using `jq`. +* `-v` / `--verbose`
+Show the full metadata associated with each database. +* `--include-backups`
+Also list databases in backup storage (note: may be slow). + ### `glean create` Create a new database. diff --git a/assets/js/1a20bc57.46e5373a.js b/assets/js/1a20bc57.46e5373a.js new file mode 100644 index 000000000..ec41beee1 --- /dev/null +++ b/assets/js/1a20bc57.46e5373a.js @@ -0,0 +1 @@ +"use strict";(self.webpackChunkwebsite=self.webpackChunkwebsite||[]).push([[4468],{3905:(e,n,a)=>{a.r(n),a.d(n,{MDXContext:()=>o,MDXProvider:()=>u,mdx:()=>N,useMDXComponents:()=>s,withMDXComponents:()=>p});var t=a(67294);function l(e,n,a){return n in e?Object.defineProperty(e,n,{value:a,enumerable:!0,configurable:!0,writable:!0}):e[n]=a,e}function i(){return i=Object.assign||function(e){for(var n=1;n=0||(l[a]=e[a]);return l}(e,n);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(t=0;t=0||Object.prototype.propertyIsEnumerable.call(e,a)&&(l[a]=e[a])}return l}var o=t.createContext({}),p=function(e){return function(n){var a=s(n.components);return t.createElement(e,i({},n,{components:a}))}},s=function(e){var n=t.useContext(o),a=n;return e&&(a="function"==typeof e?e(n):r(r({},n),e)),a},u=function(e){var n=s(e.components);return t.createElement(o.Provider,{value:n},e.children)},c={inlineCode:"code",wrapper:function(e){var n=e.children;return t.createElement(t.Fragment,{},n)}},x=t.forwardRef((function(e,n){var a=e.components,l=e.mdxType,i=e.originalType,d=e.parentName,o=m(e,["components","mdxType","originalType","parentName"]),p=s(a),u=l,x=p["".concat(d,".").concat(u)]||p[u]||c[u]||i;return a?t.createElement(x,r(r({ref:n},o),{},{components:a})):t.createElement(x,r({ref:n},o))}));function N(e,n){var a=arguments,l=n&&n.mdxType;if("string"==typeof e||l){var i=a.length,d=new Array(i);d[0]=x;var r={};for(var m in n)hasOwnProperty.call(n,m)&&(r[m]=n[m]);r.originalType=e,r.mdxType="string"==typeof e?e:l,d[1]=r;for(var o=2;o{a.r(n),a.d(n,{assets:()=>m,contentTitle:()=>d,default:()=>s,frontMatter:()=>i,metadata:()=>r,toc:()=>o});var t=a(83117),l=(a(67294),a(3905));const i={id:"cli",title:"The Glean CLI tool",sidebar_label:"The Glean CLI tool"},d=void 0,r={unversionedId:"cli",id:"cli",title:"The Glean CLI tool",description:"The Glean CLI tool (glean) can create and write data into databases,",source:"@site/docs/cli.md",sourceDirName:".",slug:"/cli",permalink:"/docs/cli",draft:!1,editUrl:"https://github.com/facebookincubator/Glean/tree/main/glean/website/docs/cli.md",tags:[],version:"current",frontMatter:{id:"cli",title:"The Glean CLI tool",sidebar_label:"The Glean CLI tool"},sidebar:"someSidebar",previous:{title:"Running the Glean Server",permalink:"/docs/server"},next:{title:"Introduction",permalink:"/docs/indexer/intro"}},m={},o=[{value:"glean list",id:"glean-list",level:3},{value:"glean create",id:"glean-create",level:3},{value:"glean write",id:"glean-write",level:3},{value:"glean finish",id:"glean-finish",level:3},{value:"glean dump",id:"glean-dump",level:3},{value:"glean delete",id:"glean-delete",level:3},{value:"glean derive",id:"glean-derive",level:3},{value:"glean index",id:"glean-index",level:3},{value:"glean query",id:"glean-query",level:3},{value:"glean restore",id:"glean-restore",level:3},{value:"glean validate",id:"glean-validate",level:3},{value:"glean validate-schema",id:"glean-validate-schema",level:3},{value:"glean stats",id:"glean-stats",level:3},{value:"glean unfinish",id:"glean-unfinish",level:3}],p={toc:o};function s(e){let{components:n,...a}=e;return(0,l.mdx)("wrapper",(0,t.Z)({},p,a,{components:n,mdxType:"MDXLayout"}),(0,l.mdx)("p",null,"The Glean CLI tool (",(0,l.mdx)("inlineCode",{parentName:"p"},"glean"),") can create and write data into databases,\nperform a variety of admin tasks on databases, and also do one-off\nqueries."),(0,l.mdx)("p",null,"The ",(0,l.mdx)("inlineCode",{parentName:"p"},"glean")," tool accepts all the ",(0,l.mdx)("a",{parentName:"p",href:"/docs/running#common-options"},"common\noptions")," to specify how to connect to access\nthe databases."),(0,l.mdx)("admonition",{type:"note"},(0,l.mdx)("p",{parentName:"admonition"},"The ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db")," flag used to be called ",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo"),", ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name")," used to be\n",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo-name"),", and ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-instance")," used to be ",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo-hash"),". The\nterminology was changed because databases don't necessarily correspond\nto repositories, and the instance doesn't necessarily correspond to a\nhash or revision of a repository.")),(0,l.mdx)("p",null,"The available commands are as follows:"),(0,l.mdx)("h3",{id:"glean-list"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean list")),(0,l.mdx)("p",null,"List the available databases."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"[DBNAME]")," ",(0,l.mdx)("br",null),"\nList only databases that match ",(0,l.mdx)("inlineCode",{parentName:"li"},"DBNAME")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--format (tty|plain|json|compact-json)")," ",(0,l.mdx)("br",null),"\nVarious different formats for the output. JSON is useful for\nprocessing and filtering the result in a script, e.g. using ",(0,l.mdx)("inlineCode",{parentName:"li"},"jq"),"."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"-v")," / ",(0,l.mdx)("inlineCode",{parentName:"li"},"--verbose")," ",(0,l.mdx)("br",null),"\nShow the full metadata associated with each database."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--include-backups")," ",(0,l.mdx)("br",null),"\nAlso list databases in backup storage (note: may be slow).")),(0,l.mdx)("h3",{id:"glean-create"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean create")),(0,l.mdx)("p",null,"Create a new database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--finish"),(0,l.mdx)("br",null),"\nAlso mark the DB as complete"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--stacked DB"),(0,l.mdx)("br",null),"\nCreate a stacked database on top of ",(0,l.mdx)("inlineCode",{parentName:"li"},"DB"),"."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--property NAME=VALUE"),(0,l.mdx)("br",null),"\nSet properties when creating a DB"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--update-schema-for-stacked"),(0,l.mdx)("br",null),"\nWhen creating a stacked DB, the schema is taken from the base DB. This\noption specifies that the current schema should be used instead. When\nusing this option, creation will fail if the current schema has\na different definition for any predicate in the base DB schema;\ntherefore predicates may only be added or removed relative to the base DB."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE.."),(0,l.mdx)("br",null),"\nFile(s) of facts to write into the database (JSON). See ",(0,l.mdx)("a",{parentName:"li",href:"/docs/write"},"Writing data\nto Glean"),".")),(0,l.mdx)("p",null,"The schema for the new DB is given by:"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"the property ",(0,l.mdx)("inlineCode",{parentName:"p"},"glean.schema_id")," if specified, or")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"if ",(0,l.mdx)("inlineCode",{parentName:"p"},"--stacked")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--incremental"),", then"),(0,l.mdx)("ul",{parentName:"li"},(0,l.mdx)("li",{parentName:"ul"},"if ",(0,l.mdx)("inlineCode",{parentName:"li"},"--update-schema-for-stacked")," is specified, then the default\nschema (or the one given by the ",(0,l.mdx)("inlineCode",{parentName:"li"},"--schema")," option),"),(0,l.mdx)("li",{parentName:"ul"},"otherwise, the schema from the base DB."))),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"otherwise the default schema, or the one given by the ",(0,l.mdx)("inlineCode",{parentName:"p"},"--schema"),"\nflag."))),(0,l.mdx)("p",null,"Note that when creating a stacked DB, it is an error if the schema\ndoes not agree with the schema in the base DB for any predicate that\nhas facts. That is, you cannot change the schema in a stacked DB for\nexisting facts in the base DB."),(0,l.mdx)("h3",{id:"glean-write"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean write")),(0,l.mdx)("p",null,"Write facts to a database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE.."),(0,l.mdx)("br",null),"\nFile(s) of facts to write into the database (JSON). See ",(0,l.mdx)("a",{parentName:"li",href:"/docs/write"},"Writing data\nto Glean"),"."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--finish"),(0,l.mdx)("br",null),"\nAlso mark the DB as complete")),(0,l.mdx)("h3",{id:"glean-finish"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean finish")),(0,l.mdx)("p",null,"Notify server that a database is complete."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-dump"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean dump")),(0,l.mdx)("p",null,"Dump the contents of the specified database into a file."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE"),(0,l.mdx)("br",null),"\nFile to write the facts into")),(0,l.mdx)("h3",{id:"glean-delete"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean delete")),(0,l.mdx)("p",null,"Delete a database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-derive"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean derive")),(0,l.mdx)("p",null,"Derive and store a predicate. See ",(0,l.mdx)("a",{parentName:"p",href:"/docs/derived"},"Derived Predicates"),"."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-bytes BYTES"),(0,l.mdx)("br",null),"\nMaximum number of bytes per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-facts FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"PREDICATE"),(0,l.mdx)("br",null),"\nPredicates to derive"))),(0,l.mdx)("h3",{id:"glean-index"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean index")),(0,l.mdx)("p",null,"Index some source code using one of the known indexers."),(0,l.mdx)("p",null,"The form of the command in general is"),(0,l.mdx)("pre",null,(0,l.mdx)("code",{parentName:"pre"},"glean index LANGUAGE DIR --db NAME/INSTANCE\n")),(0,l.mdx)("p",null,"There may also be additional options accepted for each ",(0,l.mdx)("inlineCode",{parentName:"p"},"LANGUAGE"),"; try\n",(0,l.mdx)("inlineCode",{parentName:"p"},"glean index LANGUAGE --help")," to find out."),(0,l.mdx)("p",null,"For information on each indexer, see ",(0,l.mdx)("a",{parentName:"p",href:"/docs/indexer/intro"},"Indexers"),"."),(0,l.mdx)("h3",{id:"glean-query"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean query")),(0,l.mdx)("p",null,"Execute an Angle query and print the results, or write them to a file."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name NAME"),(0,l.mdx)("br",null),"\nSpecifies the database to query")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-bytes BYTES"),(0,l.mdx)("br",null),"\nMaximum number of bytes per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-facts FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--recursive"),(0,l.mdx)("br",null),"\nFetch nested facts (slower)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--limit FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts to query (default: no limit)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"-o,--output FILE"),(0,l.mdx)("br",null),"\nOutput the facts to a file")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--stats FILE"),(0,l.mdx)("br",null),"\nOutput stats to a file ('-' for stdout)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--timeout MILLISECONDS"),"\nOverride the default query timeout")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"QUERY"),"\nquery to execute (",(0,l.mdx)("inlineCode",{parentName:"p"},"@file")," to read from file, ",(0,l.mdx)("inlineCode",{parentName:"p"},"-")," for stdin)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--omit-results"),"\nDon't print results; use with ",(0,l.mdx)("inlineCode",{parentName:"p"},"--stat")," to get a count of results"))),(0,l.mdx)("h3",{id:"glean-restore"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean restore")),(0,l.mdx)("p",null,"Restore a database from backup."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"LOCATOR"),(0,l.mdx)("br",null),"\nDB location, see ",(0,l.mdx)("inlineCode",{parentName:"li"},":list-all")," in glean shell.")),(0,l.mdx)("p",null,"Alternatively the DB to restore can be specified by:"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME")," and (",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-instance INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--date YYY-MM-DD"),")")),(0,l.mdx)("h3",{id:"glean-validate"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean validate")),(0,l.mdx)("p",null,"Perform checks on the internal integrity of a database. This is for\ntesting and debugging Glean itself."),(0,l.mdx)("p",null," a local database"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--no-typecheck"),(0,l.mdx)("br",null),"\nDon't typecheck facts.")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--no-keys"),(0,l.mdx)("br",null),"\nDon't verify key uniqueness")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--limit N"),(0,l.mdx)("br",null),"\nOnly validate the first N facts"))),(0,l.mdx)("h3",{id:"glean-validate-schema"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean validate-schema")),(0,l.mdx)("p",null,"Validate a schema. Checks that a new schem does not modify any of the\npredicates in the existing schema, which could lead to problems."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE"),(0,l.mdx)("br",null),"\nName of schema file")),(0,l.mdx)("h3",{id:"glean-stats"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean stats")),(0,l.mdx)("p",null,"Get fact counts and sizes. Like the ",(0,l.mdx)("inlineCode",{parentName:"p"},":statistics")," command in the shell."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-unfinish"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean unfinish")),(0,l.mdx)("p",null,"Unfinish a local database (turn it from complete to incomplete\nstate). This is for testing and development and not for routine use:\nonce a database is marked complete it could be replicated, so we\nshouldn't be modifying it."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")))}s.isMDXComponent=!0}}]); \ No newline at end of file diff --git a/assets/js/1a20bc57.d97b194e.js b/assets/js/1a20bc57.d97b194e.js deleted file mode 100644 index 41bcab69c..000000000 --- a/assets/js/1a20bc57.d97b194e.js +++ /dev/null @@ -1 +0,0 @@ -"use strict";(self.webpackChunkwebsite=self.webpackChunkwebsite||[]).push([[4468],{3905:(e,n,a)=>{a.r(n),a.d(n,{MDXContext:()=>o,MDXProvider:()=>c,mdx:()=>N,useMDXComponents:()=>s,withMDXComponents:()=>p});var t=a(67294);function l(e,n,a){return n in e?Object.defineProperty(e,n,{value:a,enumerable:!0,configurable:!0,writable:!0}):e[n]=a,e}function i(){return i=Object.assign||function(e){for(var n=1;n=0||(l[a]=e[a]);return l}(e,n);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(t=0;t=0||Object.prototype.propertyIsEnumerable.call(e,a)&&(l[a]=e[a])}return l}var o=t.createContext({}),p=function(e){return function(n){var a=s(n.components);return t.createElement(e,i({},n,{components:a}))}},s=function(e){var n=t.useContext(o),a=n;return e&&(a="function"==typeof e?e(n):r(r({},n),e)),a},c=function(e){var n=s(e.components);return t.createElement(o.Provider,{value:n},e.children)},u={inlineCode:"code",wrapper:function(e){var n=e.children;return t.createElement(t.Fragment,{},n)}},x=t.forwardRef((function(e,n){var a=e.components,l=e.mdxType,i=e.originalType,d=e.parentName,o=m(e,["components","mdxType","originalType","parentName"]),p=s(a),c=l,x=p["".concat(d,".").concat(c)]||p[c]||u[c]||i;return a?t.createElement(x,r(r({ref:n},o),{},{components:a})):t.createElement(x,r({ref:n},o))}));function N(e,n){var a=arguments,l=n&&n.mdxType;if("string"==typeof e||l){var i=a.length,d=new Array(i);d[0]=x;var r={};for(var m in n)hasOwnProperty.call(n,m)&&(r[m]=n[m]);r.originalType=e,r.mdxType="string"==typeof e?e:l,d[1]=r;for(var o=2;o{a.r(n),a.d(n,{assets:()=>m,contentTitle:()=>d,default:()=>s,frontMatter:()=>i,metadata:()=>r,toc:()=>o});var t=a(83117),l=(a(67294),a(3905));const i={id:"cli",title:"The Glean CLI tool",sidebar_label:"The Glean CLI tool"},d=void 0,r={unversionedId:"cli",id:"cli",title:"The Glean CLI tool",description:"The Glean CLI tool (glean) can create and write data into databases,",source:"@site/docs/cli.md",sourceDirName:".",slug:"/cli",permalink:"/docs/cli",draft:!1,editUrl:"https://github.com/facebookincubator/Glean/tree/main/glean/website/docs/cli.md",tags:[],version:"current",frontMatter:{id:"cli",title:"The Glean CLI tool",sidebar_label:"The Glean CLI tool"},sidebar:"someSidebar",previous:{title:"Running the Glean Server",permalink:"/docs/server"},next:{title:"Introduction",permalink:"/docs/indexer/intro"}},m={},o=[{value:"glean create",id:"glean-create",level:3},{value:"glean write",id:"glean-write",level:3},{value:"glean finish",id:"glean-finish",level:3},{value:"glean dump",id:"glean-dump",level:3},{value:"glean delete",id:"glean-delete",level:3},{value:"glean derive",id:"glean-derive",level:3},{value:"glean index",id:"glean-index",level:3},{value:"glean query",id:"glean-query",level:3},{value:"glean restore",id:"glean-restore",level:3},{value:"glean validate",id:"glean-validate",level:3},{value:"glean validate-schema",id:"glean-validate-schema",level:3},{value:"glean stats",id:"glean-stats",level:3},{value:"glean unfinish",id:"glean-unfinish",level:3}],p={toc:o};function s(e){let{components:n,...a}=e;return(0,l.mdx)("wrapper",(0,t.Z)({},p,a,{components:n,mdxType:"MDXLayout"}),(0,l.mdx)("p",null,"The Glean CLI tool (",(0,l.mdx)("inlineCode",{parentName:"p"},"glean"),") can create and write data into databases,\nperform a variety of admin tasks on databases, and also do one-off\nqueries."),(0,l.mdx)("p",null,"The ",(0,l.mdx)("inlineCode",{parentName:"p"},"glean")," tool accepts all the ",(0,l.mdx)("a",{parentName:"p",href:"/docs/running#common-options"},"common\noptions")," to specify how to connect to access\nthe databases."),(0,l.mdx)("admonition",{type:"note"},(0,l.mdx)("p",{parentName:"admonition"},"The ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db")," flag used to be called ",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo"),", ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name")," used to be\n",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo-name"),", and ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-instance")," used to be ",(0,l.mdx)("inlineCode",{parentName:"p"},"--repo-hash"),". The\nterminology was changed because databases don't necessarily correspond\nto repositories, and the instance doesn't necessarily correspond to a\nhash or revision of a repository.")),(0,l.mdx)("p",null,"The available commands are as follows:"),(0,l.mdx)("h3",{id:"glean-create"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean create")),(0,l.mdx)("p",null,"Create a new database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--finish"),(0,l.mdx)("br",null),"\nAlso mark the DB as complete"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--stacked DB"),(0,l.mdx)("br",null),"\nCreate a stacked database on top of ",(0,l.mdx)("inlineCode",{parentName:"li"},"DB"),"."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--property NAME=VALUE"),(0,l.mdx)("br",null),"\nSet properties when creating a DB"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--update-schema-for-stacked"),(0,l.mdx)("br",null),"\nWhen creating a stacked DB, the schema is taken from the base DB. This\noption specifies that the current schema should be used instead. When\nusing this option, creation will fail if the current schema has\na different definition for any predicate in the base DB schema;\ntherefore predicates may only be added or removed relative to the base DB."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE.."),(0,l.mdx)("br",null),"\nFile(s) of facts to write into the database (JSON). See ",(0,l.mdx)("a",{parentName:"li",href:"/docs/write"},"Writing data\nto Glean"),".")),(0,l.mdx)("p",null,"The schema for the new DB is given by:"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"the property ",(0,l.mdx)("inlineCode",{parentName:"p"},"glean.schema_id")," if specified, or")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"if ",(0,l.mdx)("inlineCode",{parentName:"p"},"--stacked")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--incremental"),", then"),(0,l.mdx)("ul",{parentName:"li"},(0,l.mdx)("li",{parentName:"ul"},"if ",(0,l.mdx)("inlineCode",{parentName:"li"},"--update-schema-for-stacked")," is specified, then the default\nschema (or the one given by the ",(0,l.mdx)("inlineCode",{parentName:"li"},"--schema")," option),"),(0,l.mdx)("li",{parentName:"ul"},"otherwise, the schema from the base DB."))),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},"otherwise the default schema, or the one given by the ",(0,l.mdx)("inlineCode",{parentName:"p"},"--schema"),"\nflag."))),(0,l.mdx)("p",null,"Note that when creating a stacked DB, it is an error if the schema\ndoes not agree with the schema in the base DB for any predicate that\nhas facts. That is, you cannot change the schema in a stacked DB for\nexisting facts in the base DB."),(0,l.mdx)("h3",{id:"glean-write"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean write")),(0,l.mdx)("p",null,"Write facts to a database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE.."),(0,l.mdx)("br",null),"\nFile(s) of facts to write into the database (JSON). See ",(0,l.mdx)("a",{parentName:"li",href:"/docs/write"},"Writing data\nto Glean"),"."),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--finish"),(0,l.mdx)("br",null),"\nAlso mark the DB as complete")),(0,l.mdx)("h3",{id:"glean-finish"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean finish")),(0,l.mdx)("p",null,"Notify server that a database is complete."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-dump"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean dump")),(0,l.mdx)("p",null,"Dump the contents of the specified database into a file."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database"),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE"),(0,l.mdx)("br",null),"\nFile to write the facts into")),(0,l.mdx)("h3",{id:"glean-delete"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean delete")),(0,l.mdx)("p",null,"Delete a database."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-derive"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean derive")),(0,l.mdx)("p",null,"Derive and store a predicate. See ",(0,l.mdx)("a",{parentName:"p",href:"/docs/derived"},"Derived Predicates"),"."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-bytes BYTES"),(0,l.mdx)("br",null),"\nMaximum number of bytes per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-facts FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"PREDICATE"),(0,l.mdx)("br",null),"\nPredicates to derive"))),(0,l.mdx)("h3",{id:"glean-index"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean index")),(0,l.mdx)("p",null,"Index some source code using one of the known indexers."),(0,l.mdx)("p",null,"The form of the command in general is"),(0,l.mdx)("pre",null,(0,l.mdx)("code",{parentName:"pre"},"glean index LANGUAGE DIR --db NAME/INSTANCE\n")),(0,l.mdx)("p",null,"There may also be additional options accepted for each ",(0,l.mdx)("inlineCode",{parentName:"p"},"LANGUAGE"),"; try\n",(0,l.mdx)("inlineCode",{parentName:"p"},"glean index LANGUAGE --help")," to find out."),(0,l.mdx)("p",null,"For information on each indexer, see ",(0,l.mdx)("a",{parentName:"p",href:"/docs/indexer/intro"},"Indexers"),"."),(0,l.mdx)("h3",{id:"glean-query"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean query")),(0,l.mdx)("p",null,"Execute an Angle query and print the results, or write them to a file."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name NAME"),(0,l.mdx)("br",null),"\nSpecifies the database to query")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-bytes BYTES"),(0,l.mdx)("br",null),"\nMaximum number of bytes per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--page-facts FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts per page")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--recursive"),(0,l.mdx)("br",null),"\nFetch nested facts (slower)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--limit FACTS"),(0,l.mdx)("br",null),"\nMaximum number of facts to query (default: no limit)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"-o,--output FILE"),(0,l.mdx)("br",null),"\nOutput the facts to a file")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--stats FILE"),(0,l.mdx)("br",null),"\nOutput stats to a file ('-' for stdout)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--timeout MILLISECONDS"),"\nOverride the default query timeout")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"QUERY"),"\nquery to execute (",(0,l.mdx)("inlineCode",{parentName:"p"},"@file")," to read from file, ",(0,l.mdx)("inlineCode",{parentName:"p"},"-")," for stdin)")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--omit-results"),"\nDon't print results; use with ",(0,l.mdx)("inlineCode",{parentName:"p"},"--stat")," to get a count of results"))),(0,l.mdx)("h3",{id:"glean-restore"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean restore")),(0,l.mdx)("p",null,"Restore a database from backup."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"LOCATOR"),(0,l.mdx)("br",null),"\nDB location, see ",(0,l.mdx)("inlineCode",{parentName:"li"},":list-all")," in glean shell.")),(0,l.mdx)("p",null,"Alternatively the DB to restore can be specified by:"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME")," and (",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-instance INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--date YYY-MM-DD"),")")),(0,l.mdx)("h3",{id:"glean-validate"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean validate")),(0,l.mdx)("p",null,"Perform checks on the internal integrity of a database. This is for\ntesting and debugging Glean itself."),(0,l.mdx)("p",null," a local database"),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"p"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--no-typecheck"),(0,l.mdx)("br",null),"\nDon't typecheck facts.")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--no-keys"),(0,l.mdx)("br",null),"\nDon't verify key uniqueness")),(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("p",{parentName:"li"},(0,l.mdx)("inlineCode",{parentName:"p"},"--limit N"),(0,l.mdx)("br",null),"\nOnly validate the first N facts"))),(0,l.mdx)("h3",{id:"glean-validate-schema"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean validate-schema")),(0,l.mdx)("p",null,"Validate a schema. Checks that a new schem does not modify any of the\npredicates in the existing schema, which could lead to problems."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"FILE"),(0,l.mdx)("br",null),"\nName of schema file")),(0,l.mdx)("h3",{id:"glean-stats"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean stats")),(0,l.mdx)("p",null,"Get fact counts and sizes. Like the ",(0,l.mdx)("inlineCode",{parentName:"p"},":statistics")," command in the shell."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")),(0,l.mdx)("h3",{id:"glean-unfinish"},(0,l.mdx)("inlineCode",{parentName:"h3"},"glean unfinish")),(0,l.mdx)("p",null,"Unfinish a local database (turn it from complete to incomplete\nstate). This is for testing and development and not for routine use:\nonce a database is marked complete it could be replicated, so we\nshouldn't be modifying it."),(0,l.mdx)("ul",null,(0,l.mdx)("li",{parentName:"ul"},(0,l.mdx)("inlineCode",{parentName:"li"},"--db NAME/INSTANCE")," or ",(0,l.mdx)("inlineCode",{parentName:"li"},"--db-name NAME --db-instance INSTANCE"),(0,l.mdx)("br",null),"\nSpecifies the name and instance of the database")))}s.isMDXComponent=!0}}]); \ No newline at end of file diff --git a/assets/js/runtime~main.49febced.js b/assets/js/runtime~main.c48becb8.js similarity index 99% rename from assets/js/runtime~main.49febced.js rename to assets/js/runtime~main.c48becb8.js index b6ef6c287..e51f551b8 100644 --- a/assets/js/runtime~main.49febced.js +++ b/assets/js/runtime~main.c48becb8.js @@ -1 +1 @@ -(()=>{"use strict";var e,a,d,c,f,t={},b={};function r(e){var a=b[e];if(void 0!==a)return a.exports;var d=b[e]={id:e,loaded:!1,exports:{}};return t[e].call(d.exports,d,d.exports,r),d.loaded=!0,d.exports}r.m=t,r.c=b,e=[],r.O=(a,d,c,f)=>{if(!d){var t=1/0;for(i=0;i=f)&&Object.keys(r.O).every((e=>r.O[e](d[o])))?d.splice(o--,1):(b=!1,f0&&e[i-1][2]>f;i--)e[i]=e[i-1];e[i]=[d,c,f]},r.n=e=>{var a=e&&e.__esModule?()=>e.default:()=>e;return r.d(a,{a:a}),a},d=Object.getPrototypeOf?e=>Object.getPrototypeOf(e):e=>e.__proto__,r.t=function(e,c){if(1&c&&(e=this(e)),8&c)return e;if("object"==typeof e&&e){if(4&c&&e.__esModule)return e;if(16&c&&"function"==typeof e.then)return e}var f=Object.create(null);r.r(f);var t={};a=a||[null,d({}),d([]),d(d)];for(var b=2&c&&e;"object"==typeof b&&!~a.indexOf(b);b=d(b))Object.getOwnPropertyNames(b).forEach((a=>t[a]=()=>e[a]));return t.default=()=>e,r.d(f,t),f},r.d=(e,a)=>{for(var d in a)r.o(a,d)&&!r.o(e,d)&&Object.defineProperty(e,d,{enumerable:!0,get:a[d]})},r.f={},r.e=e=>Promise.all(Object.keys(r.f).reduce(((a,d)=>(r.f[d](e,a),a)),[])),r.u=e=>"assets/js/"+({53:"935f2afb",533:"b2b675dd",684:"af94d498",695:"0b5ee478",702:"e72a3ded",734:"f349a764",949:"eb83943b",1218:"2dc45ced",1477:"b2f554cd",1713:"a7023ddc",1953:"3e65d5b4",2535:"814f3328",2597:"373392d9",2642:"a81f2d1d",2731:"473435fa",3089:"a6aa9e1f",3106:"581d6198",3345:"ca95d5ad",3608:"9e4087bc",3627:"7c10977a",3824:"9d050fe4",3827:"37fc9d46",3988:"cfd71120",4013:"01a85c17",4128:"a09c2993",4195:"c4f5d8e4",4224:"5c4c46e6",4282:"31d6d5ed",4338:"41206b0e",4468:"1a20bc57",4648:"d558f29a",4904:"b0b0b448",5307:"af32bd62",5310:"476d6aec",5622:"f228e963",5628:"8293a772",5917:"21418ead",5925:"b8b1253e",5943:"a5dc57e5",6103:"ccc49370",6166:"2dfecbce",6412:"b16bf7d2",6439:"2651e53d",6587:"5e677a75",6910:"27315305",6982:"90f022e0",7023:"31fe93dc",7187:"246b6efd",7586:"d22a0e6a",7698:"abda9da4",7918:"17896441",8325:"33b5e0ca",8490:"6b032a97",8528:"5baf5c08",8610:"6875c492",9357:"391ef999",9403:"cc8d6d7f",9407:"ea32bb6f",9428:"283d7b21",9514:"1be78505",9519:"432e378d",9607:"c83e76ae",9675:"14a2b9f8",9704:"60691868"}[e]||e)+"."+{53:"9119e8a8",533:"37b72b08",684:"e1bf73db",695:"a5791784",702:"39d9265d",734:"9a7ac39c",949:"31f84837",1218:"b7bd7c4e",1477:"942e1482",1713:"9e1bdfb8",1953:"48c54bb8",2535:"714d8b90",2597:"29477b3f",2642:"253b6a55",2731:"6fed96fc",3089:"2f29c6cf",3106:"c5e44c63",3345:"11f5a106",3608:"62af1a24",3627:"cb3a5eb2",3824:"382fbf8f",3827:"2c5cec8d",3988:"29a57898",4013:"fc514125",4128:"c3a045a0",4195:"c2e74945",4224:"95a0da25",4282:"52a7d976",4338:"ced36b31",4468:"d97b194e",4648:"624c5a42",4904:"e681fb9f",4972:"c98eee24",5307:"55a39fc6",5310:"efb5df1c",5622:"fa7e970f",5628:"df9f83db",5917:"dcdf8c9d",5925:"3745c099",5943:"cd2b7b08",6103:"ae691c92",6166:"1c4e87bb",6412:"0087e5e1",6439:"6af9bd8e",6587:"081a0151",6910:"edee02ea",6921:"f20e80a2",6982:"16ee69ab",7023:"d080ed08",7187:"013bd076",7586:"e17700ba",7698:"009f7f7a",7918:"cbaf46f4",8325:"a6308c17",8490:"7ec6431f",8528:"6656e233",8610:"6363f22a",9357:"8149209a",9403:"60d7af99",9407:"c7edbf91",9428:"894dddce",9514:"c14ec086",9519:"8e24ccc5",9607:"a7dff9eb",9675:"a113c165",9704:"985278fb"}[e]+".js",r.miniCssF=e=>{},r.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(e){if("object"==typeof window)return window}}(),r.o=(e,a)=>Object.prototype.hasOwnProperty.call(e,a),c={},f="website:",r.l=(e,a,d,t)=>{if(c[e])c[e].push(a);else{var b,o;if(void 0!==d)for(var n=document.getElementsByTagName("script"),i=0;i{b.onerror=b.onload=null,clearTimeout(s);var f=c[e];if(delete c[e],b.parentNode&&b.parentNode.removeChild(b),f&&f.forEach((e=>e(d))),a)return a(d)},s=setTimeout(u.bind(null,void 0,{type:"timeout",target:b}),12e4);b.onerror=u.bind(null,b.onerror),b.onload=u.bind(null,b.onload),o&&document.head.appendChild(b)}},r.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},r.nmd=e=>(e.paths=[],e.children||(e.children=[]),e),r.p="/",r.gca=function(e){return e={17896441:"7918",27315305:"6910",60691868:"9704","935f2afb":"53",b2b675dd:"533",af94d498:"684","0b5ee478":"695",e72a3ded:"702",f349a764:"734",eb83943b:"949","2dc45ced":"1218",b2f554cd:"1477",a7023ddc:"1713","3e65d5b4":"1953","814f3328":"2535","373392d9":"2597",a81f2d1d:"2642","473435fa":"2731",a6aa9e1f:"3089","581d6198":"3106",ca95d5ad:"3345","9e4087bc":"3608","7c10977a":"3627","9d050fe4":"3824","37fc9d46":"3827",cfd71120:"3988","01a85c17":"4013",a09c2993:"4128",c4f5d8e4:"4195","5c4c46e6":"4224","31d6d5ed":"4282","41206b0e":"4338","1a20bc57":"4468",d558f29a:"4648",b0b0b448:"4904",af32bd62:"5307","476d6aec":"5310",f228e963:"5622","8293a772":"5628","21418ead":"5917",b8b1253e:"5925",a5dc57e5:"5943",ccc49370:"6103","2dfecbce":"6166",b16bf7d2:"6412","2651e53d":"6439","5e677a75":"6587","90f022e0":"6982","31fe93dc":"7023","246b6efd":"7187",d22a0e6a:"7586",abda9da4:"7698","33b5e0ca":"8325","6b032a97":"8490","5baf5c08":"8528","6875c492":"8610","391ef999":"9357",cc8d6d7f:"9403",ea32bb6f:"9407","283d7b21":"9428","1be78505":"9514","432e378d":"9519",c83e76ae:"9607","14a2b9f8":"9675"}[e]||e,r.p+r.u(e)},(()=>{var e={1303:0,532:0};r.f.j=(a,d)=>{var c=r.o(e,a)?e[a]:void 0;if(0!==c)if(c)d.push(c[2]);else if(/^(1303|532)$/.test(a))e[a]=0;else{var f=new Promise(((d,f)=>c=e[a]=[d,f]));d.push(c[2]=f);var t=r.p+r.u(a),b=new Error;r.l(t,(d=>{if(r.o(e,a)&&(0!==(c=e[a])&&(e[a]=void 0),c)){var f=d&&("load"===d.type?"missing":d.type),t=d&&d.target&&d.target.src;b.message="Loading chunk "+a+" failed.\n("+f+": "+t+")",b.name="ChunkLoadError",b.type=f,b.request=t,c[1](b)}}),"chunk-"+a,a)}},r.O.j=a=>0===e[a];var a=(a,d)=>{var c,f,t=d[0],b=d[1],o=d[2],n=0;if(t.some((a=>0!==e[a]))){for(c in b)r.o(b,c)&&(r.m[c]=b[c]);if(o)var i=o(r)}for(a&&a(d);n{"use strict";var e,a,d,c,f,t={},b={};function r(e){var a=b[e];if(void 0!==a)return a.exports;var d=b[e]={id:e,loaded:!1,exports:{}};return t[e].call(d.exports,d,d.exports,r),d.loaded=!0,d.exports}r.m=t,r.c=b,e=[],r.O=(a,d,c,f)=>{if(!d){var t=1/0;for(i=0;i=f)&&Object.keys(r.O).every((e=>r.O[e](d[o])))?d.splice(o--,1):(b=!1,f0&&e[i-1][2]>f;i--)e[i]=e[i-1];e[i]=[d,c,f]},r.n=e=>{var a=e&&e.__esModule?()=>e.default:()=>e;return r.d(a,{a:a}),a},d=Object.getPrototypeOf?e=>Object.getPrototypeOf(e):e=>e.__proto__,r.t=function(e,c){if(1&c&&(e=this(e)),8&c)return e;if("object"==typeof e&&e){if(4&c&&e.__esModule)return e;if(16&c&&"function"==typeof e.then)return e}var f=Object.create(null);r.r(f);var t={};a=a||[null,d({}),d([]),d(d)];for(var b=2&c&&e;"object"==typeof b&&!~a.indexOf(b);b=d(b))Object.getOwnPropertyNames(b).forEach((a=>t[a]=()=>e[a]));return t.default=()=>e,r.d(f,t),f},r.d=(e,a)=>{for(var d in a)r.o(a,d)&&!r.o(e,d)&&Object.defineProperty(e,d,{enumerable:!0,get:a[d]})},r.f={},r.e=e=>Promise.all(Object.keys(r.f).reduce(((a,d)=>(r.f[d](e,a),a)),[])),r.u=e=>"assets/js/"+({53:"935f2afb",533:"b2b675dd",684:"af94d498",695:"0b5ee478",702:"e72a3ded",734:"f349a764",949:"eb83943b",1218:"2dc45ced",1477:"b2f554cd",1713:"a7023ddc",1953:"3e65d5b4",2535:"814f3328",2597:"373392d9",2642:"a81f2d1d",2731:"473435fa",3089:"a6aa9e1f",3106:"581d6198",3345:"ca95d5ad",3608:"9e4087bc",3627:"7c10977a",3824:"9d050fe4",3827:"37fc9d46",3988:"cfd71120",4013:"01a85c17",4128:"a09c2993",4195:"c4f5d8e4",4224:"5c4c46e6",4282:"31d6d5ed",4338:"41206b0e",4468:"1a20bc57",4648:"d558f29a",4904:"b0b0b448",5307:"af32bd62",5310:"476d6aec",5622:"f228e963",5628:"8293a772",5917:"21418ead",5925:"b8b1253e",5943:"a5dc57e5",6103:"ccc49370",6166:"2dfecbce",6412:"b16bf7d2",6439:"2651e53d",6587:"5e677a75",6910:"27315305",6982:"90f022e0",7023:"31fe93dc",7187:"246b6efd",7586:"d22a0e6a",7698:"abda9da4",7918:"17896441",8325:"33b5e0ca",8490:"6b032a97",8528:"5baf5c08",8610:"6875c492",9357:"391ef999",9403:"cc8d6d7f",9407:"ea32bb6f",9428:"283d7b21",9514:"1be78505",9519:"432e378d",9607:"c83e76ae",9675:"14a2b9f8",9704:"60691868"}[e]||e)+"."+{53:"9119e8a8",533:"37b72b08",684:"e1bf73db",695:"a5791784",702:"39d9265d",734:"9a7ac39c",949:"31f84837",1218:"b7bd7c4e",1477:"942e1482",1713:"9e1bdfb8",1953:"48c54bb8",2535:"714d8b90",2597:"29477b3f",2642:"253b6a55",2731:"6fed96fc",3089:"2f29c6cf",3106:"c5e44c63",3345:"11f5a106",3608:"62af1a24",3627:"cb3a5eb2",3824:"382fbf8f",3827:"2c5cec8d",3988:"29a57898",4013:"fc514125",4128:"c3a045a0",4195:"c2e74945",4224:"95a0da25",4282:"52a7d976",4338:"ced36b31",4468:"46e5373a",4648:"624c5a42",4904:"e681fb9f",4972:"c98eee24",5307:"55a39fc6",5310:"efb5df1c",5622:"fa7e970f",5628:"df9f83db",5917:"dcdf8c9d",5925:"3745c099",5943:"cd2b7b08",6103:"ae691c92",6166:"1c4e87bb",6412:"0087e5e1",6439:"6af9bd8e",6587:"081a0151",6910:"edee02ea",6921:"f20e80a2",6982:"16ee69ab",7023:"d080ed08",7187:"013bd076",7586:"e17700ba",7698:"009f7f7a",7918:"cbaf46f4",8325:"a6308c17",8490:"7ec6431f",8528:"6656e233",8610:"6363f22a",9357:"8149209a",9403:"60d7af99",9407:"c7edbf91",9428:"894dddce",9514:"c14ec086",9519:"8e24ccc5",9607:"a7dff9eb",9675:"a113c165",9704:"985278fb"}[e]+".js",r.miniCssF=e=>{},r.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(e){if("object"==typeof window)return window}}(),r.o=(e,a)=>Object.prototype.hasOwnProperty.call(e,a),c={},f="website:",r.l=(e,a,d,t)=>{if(c[e])c[e].push(a);else{var b,o;if(void 0!==d)for(var n=document.getElementsByTagName("script"),i=0;i{b.onerror=b.onload=null,clearTimeout(s);var f=c[e];if(delete c[e],b.parentNode&&b.parentNode.removeChild(b),f&&f.forEach((e=>e(d))),a)return a(d)},s=setTimeout(u.bind(null,void 0,{type:"timeout",target:b}),12e4);b.onerror=u.bind(null,b.onerror),b.onload=u.bind(null,b.onload),o&&document.head.appendChild(b)}},r.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},r.nmd=e=>(e.paths=[],e.children||(e.children=[]),e),r.p="/",r.gca=function(e){return e={17896441:"7918",27315305:"6910",60691868:"9704","935f2afb":"53",b2b675dd:"533",af94d498:"684","0b5ee478":"695",e72a3ded:"702",f349a764:"734",eb83943b:"949","2dc45ced":"1218",b2f554cd:"1477",a7023ddc:"1713","3e65d5b4":"1953","814f3328":"2535","373392d9":"2597",a81f2d1d:"2642","473435fa":"2731",a6aa9e1f:"3089","581d6198":"3106",ca95d5ad:"3345","9e4087bc":"3608","7c10977a":"3627","9d050fe4":"3824","37fc9d46":"3827",cfd71120:"3988","01a85c17":"4013",a09c2993:"4128",c4f5d8e4:"4195","5c4c46e6":"4224","31d6d5ed":"4282","41206b0e":"4338","1a20bc57":"4468",d558f29a:"4648",b0b0b448:"4904",af32bd62:"5307","476d6aec":"5310",f228e963:"5622","8293a772":"5628","21418ead":"5917",b8b1253e:"5925",a5dc57e5:"5943",ccc49370:"6103","2dfecbce":"6166",b16bf7d2:"6412","2651e53d":"6439","5e677a75":"6587","90f022e0":"6982","31fe93dc":"7023","246b6efd":"7187",d22a0e6a:"7586",abda9da4:"7698","33b5e0ca":"8325","6b032a97":"8490","5baf5c08":"8528","6875c492":"8610","391ef999":"9357",cc8d6d7f:"9403",ea32bb6f:"9407","283d7b21":"9428","1be78505":"9514","432e378d":"9519",c83e76ae:"9607","14a2b9f8":"9675"}[e]||e,r.p+r.u(e)},(()=>{var e={1303:0,532:0};r.f.j=(a,d)=>{var c=r.o(e,a)?e[a]:void 0;if(0!==c)if(c)d.push(c[2]);else if(/^(1303|532)$/.test(a))e[a]=0;else{var f=new Promise(((d,f)=>c=e[a]=[d,f]));d.push(c[2]=f);var t=r.p+r.u(a),b=new Error;r.l(t,(d=>{if(r.o(e,a)&&(0!==(c=e[a])&&(e[a]=void 0),c)){var f=d&&("load"===d.type?"missing":d.type),t=d&&d.target&&d.target.src;b.message="Loading chunk "+a+" failed.\n("+f+": "+t+")",b.name="ChunkLoadError",b.type=f,b.request=t,c[1](b)}}),"chunk-"+a,a)}},r.O.j=a=>0===e[a];var a=(a,d)=>{var c,f,t=d[0],b=d[1],o=d[2],n=0;if(t.some((a=>0!==e[a]))){for(c in b)r.o(b,c)&&(r.m[c]=b[c]);if(o)var i=o(r)}for(a&&a(d);n Archive | Glean - +

Archive

Archive

2022

- + \ No newline at end of file diff --git a/blog/incremental/index.html b/blog/incremental/index.html index 742b507f8..d7ec50417 100644 --- a/blog/incremental/index.html +++ b/blog/incremental/index.html @@ -5,7 +5,7 @@ Incremental indexing with Glean | Glean - + @@ -89,7 +89,7 @@ ownership of x is {A} and y is {B,C} (because it is referred to from z which has owner B), so the final owner of d is {A} && {B,C}.

Tracking all this shouldn't be too expensive, but it's tricky to get right!

- + \ No newline at end of file diff --git a/blog/index.html b/blog/index.html index 52065204b..130ca212e 100644 --- a/blog/index.html +++ b/blog/index.html @@ -5,7 +5,7 @@ Blog | Glean - + @@ -89,7 +89,7 @@ ownership of x is {A} and y is {B,C} (because it is referred to from z which has owner B), so the final owner of d is {A} && {B,C}.

Tracking all this shouldn't be too expensive, but it's tricky to get right!

- + \ No newline at end of file diff --git a/blog/tags/glean/index.html b/blog/tags/glean/index.html index 77f491df9..d1f589ac8 100644 --- a/blog/tags/glean/index.html +++ b/blog/tags/glean/index.html @@ -5,7 +5,7 @@ One post tagged with "glean" | Glean - + @@ -89,7 +89,7 @@ ownership of x is {A} and y is {B,C} (because it is referred to from z which has owner B), so the final owner of d is {A} && {B,C}.

Tracking all this shouldn't be too expensive, but it's tricky to get right!

- + \ No newline at end of file diff --git a/blog/tags/incremental/index.html b/blog/tags/incremental/index.html index 657fafe2f..fda26411e 100644 --- a/blog/tags/incremental/index.html +++ b/blog/tags/incremental/index.html @@ -5,7 +5,7 @@ One post tagged with "incremental" | Glean - + @@ -89,7 +89,7 @@ ownership of x is {A} and y is {B,C} (because it is referred to from z which has owner B), so the final owner of d is {A} && {B,C}.

Tracking all this shouldn't be too expensive, but it's tricky to get right!

- + \ No newline at end of file diff --git a/blog/tags/index.html b/blog/tags/index.html index b9dc0b392..271832d80 100644 --- a/blog/tags/index.html +++ b/blog/tags/index.html @@ -5,14 +5,14 @@ Tags | Glean - +

Tags

- + \ No newline at end of file diff --git a/docs/angle/advanced/index.html b/docs/angle/advanced/index.html index 32644da46..78091c60b 100644 --- a/docs/angle/advanced/index.html +++ b/docs/angle/advanced/index.html @@ -5,14 +5,14 @@ Advanced Query Features | Glean - +

Advanced Query Features

Types and signatures​

Angle queries are strongly typed: the server will check your query for type-safety before executing it. Type-checking ensures that the query makes sense; that it's not trying to pattern-match strings against integers, or look for a field in a record that doesn't exist for example.

Angle's type-checker isn't very clever, though. It mostly doesn't do type inference, it checks that expressions have the intended type. When it doesn't know the intended type of an expression, it uses a dumb inference mode that can only infer the type when it's really obvious: like a fact match, or a string.

facts> P where C = { name = "Fish" }; example.Parent { C, P }
can't infer the type of: {name = "Fish"}
    try adding a type annotation like ({name = "Fish"} : T)
    or reverse the statement (Q = P instead of P = Q)

In cases like this, Angle's type-checker needs a bit of help. We can use a type signature to supply more information about the type:

facts> P where C = { name = "Fish" } : example.Class; example.Parent { C, P }
{ "id": 1024, "key": { "name": "Pet", "line": 10 } }

Here we used { name = "Fish" } : example.Class to tell Angle the expected type of the pattern. You should read the colon as "has type", and the type can be any valid Angle type, for details see Built-in types.

Explicit fact IDs​

Every fact has an ID, which is a 64-bit integer that uniquely identifies the fact in a particular database. You've probably noticed these fact IDs in the query results: every result has an id field with the fact ID, and a key field with the fact key.

Most Angle queries don't need to mention fact IDs explicitly, but sometimes it's useful. For example, you might need to perform a query to fetch some results, do some custom filtering on the results and then query Glean again using some of the fact IDs from the first query.

WARNING: a fact ID only makes sense in the context of a particular database, so make sure that your query that mentions fact IDs is being made on the same database that you obtained the fact ID from originally.

Glean has a syntax for referring to fact IDs directly; for example

facts> $1026 : example.Class
{ "id": 1026, "key": { "name": "Fish", "line": 30 } }

the syntax is $<fact ID>, but you will often want to use it with a type signature, as $<fact ID> : <predicate>.

If you get the predicate wrong, Glean will complain:

facts> $1026 : example.Parent
*** Exception: fact has the wrong type

The type can be omitted only if it is clear from the context, for example

facts> example.Parent { child = $1026 }
{ "id": 1029, "key": { "child": { "id": 1026 }, "parent": { "id": 1024 } } }

Sometimes you might want to use multiple fact IDs in a query. Or-patterns come in handy here:

facts> example.Parent { child = $1026 | $1027 }

Functional predicates​

All the predicates we've seen so far have been key-only predicates. A predicate can also have a value; we call these functional predicates or key-value predicates.

For example, we might model a reference to a class in our example schema like this:

predicate Reference :
  { file : string, line : nat, column : nat } -> Class

This says that for a given (file,line,column) there can be at most one reference to a Class. This uniqueness is the important property of a key-value predicate: for each key there is at most one value.

We query for key-value predicates using this syntax:

facts> C where example.Reference { file = "x", line = 1, column = 2 } -> C

The pattern after the -> matches the value. It can be an arbitrary pattern, just like the key. Note that facts cannot be efficiently searched by value, so the pattern that matches the value is a filter only.

- + \ No newline at end of file diff --git a/docs/angle/debugging/index.html b/docs/angle/debugging/index.html index eb36ab243..1cffe3c1e 100644 --- a/docs/angle/debugging/index.html +++ b/docs/angle/debugging/index.html @@ -5,7 +5,7 @@ Debugging | Glean - + @@ -15,7 +15,7 @@ shell, where you can experiment with queries quickly and easily.

If you're writing particularly complex queries, then consider using Derived Predicates to structure your query and to allow parts of the query to be re-used. To iterate on derived predicates, see How do I write and test a derived predicate?

Debugging a slow query​

Performance debugging can be tricky, because Angle is a very declarative language. There are often many ways to write the query that are correct, but not all of them will be fast.

The shell provides a few facilities to help with this.

> :profile full

Turning on query profiling allows you to see how many facts of each predicate are being searched by your query. For example:

fbsource> search.cxx.SearchByNameAndScope { name = "Future" }
...
Facts searched:
                cxx1.RecordDeclaration.1 : 103
             cxx1.TypeAliasDeclaration.2 : 11
                            cxx1.QName.1 : 8
              cxx1.VariableDeclaration.2 : 7
                  cxx1.EnumDeclaration.1 : 7
                             cxx1.Name.1 : 1

If your query is expensive, then likely you will see some large numbers next to one or more predicates. This is a sign that you probably want to reorder the statements in your query, or lift out some nested queries into statements so that you can control the ordering more precisely.

Showing the internals​

The shell provides ways to show what Glean's query engine is doing internally. This is mostly useful for those working on the query engine itself, but it might also be helpful when debugging queries.

danger

We provide no guarantees about this functionality and it might change without warning.

> :debug ir

Shows the internal representation of the query after parsing, name resolution, type checking, and various transformations to simplify it. In particular, all the nesting has been flattened at this stage, so you can see the exact order of the searches on each predicate, which might help with performance debugging.

> :debug bytecode

Shows the compiled bytecode for the query. This is what Glean's virtual machine (VM) will execute to perform the query. Probably not all that useful for debugging queries.

- + \ No newline at end of file diff --git a/docs/angle/efficiency/index.html b/docs/angle/efficiency/index.html index 9ed725b17..e0d6c54c5 100644 --- a/docs/angle/efficiency/index.html +++ b/docs/angle/efficiency/index.html @@ -5,14 +5,14 @@ Query Efficiency | Glean - +

Query Efficiency

There are two important aspects of a query that affect its efficiency;

  1. Which fields are specified in a pattern
  2. The ordering of statements

We’ll cover each of these in the following sections.

Efficient matching of facts​

The order of fields in the schema matters a lot for efficiency. Glean indexes facts by a prefix of their keys, so if we know the prefix when searching for facts this will be a lot faster. Often this difference is absolutely crucial; the difference is between O(log n) and O(n), so when the database is large this can be many orders of magnitude.

For example, the example.Parent predicate we saw earlier is defined as

predicate Parent :
  {
    child : Person,
    parent : Person,
  }

We should think of this as a mapping from child to parent. Glean won’t stop you writing a query for { parent = ... }, but such a query will examine all of the example.Parent facts in the database. We can see how many facts are searched for our query using :profile full in the shell (see debugging for more details):

facts> :profile full
facts> example.Parent { parent = { name = "Pet" }}
(snip)
2 results, 2 facts, 0.40ms, 159440 bytes, 988 compiled bytes
Facts searched:
                        example.Parent.1 : 3

This tells us that although it found the 2 results we expected, it searched all 3 example.Parent facts in the process.

Making queries efficient using a derived predicate​

What if we wanted to efficiently map from parent to child? That’s easy to accomplish using a derived predicate. We’re going to define a new predicate with a different field ordering, and automatically generate the facts of our new predicate by deriving them from the facts of the existing predicate. For full details see Derived Predicates, what follows will be a walkthrough showing how to use a derived predicate to make our queries more efficient.

First we’ll define our derived predicate in the schema, like this:

predicate Child :
  {
    parent : Class,
    child : Class,
  }
  stored
  { P, C } where Parent { C, P }

We can try this out in the shell. First we have to create a new database to hold the derived facts that is stacked on top of the old database. Drop out of the shell and run this command to create the new database:

glean create --db-root /tmp/glean/db --schema dir:/tmp/glean/schema --db derived/1 --stacked facts/1

Now start the shell again and load the stacked database. Note that we can still query facts from the original database:

> :db derived/1
derived> example.Parent _
{ "id": 1028, "key": { "child": { "id": 1025 }, "parent": { "id": 1024 } } }
{ "id": 1029, "key": { "child": { "id": 1026 }, "parent": { "id": 1024 } } }
{ "id": 1030, "key": { "child": { "id": 1027 }, "parent": { "id": 1026 } } }

Initially we have no facts of the Child predicate:

derived> example.Child _
0 results, 0 facts, 0.91ms, 812952 bytes, 664 compiled bytes

But we can create them automatically:

derived> * example.Child _
{ "id": 1037, "key": { "parent": { "id": 1024 }, "child": { "id": 1025 } } }
{ "id": 1038, "key": { "parent": { "id": 1024 }, "child": { "id": 1026 } } }
{ "id": 1039, "key": { "parent": { "id": 1026 }, "child": { "id": 1027 } } }

(the * means β€œderive and store” the facts produced by the query. To derive facts for a production database you would use either glean derive from the command line, or the appropriate Thrift API in whatever language you’re using to talk to the Glean server).

Now we have 3 facts of our derived predicate:

derived> :stat
example.Child.1
  count: 3
  size:  87 (87 bytes) 100.0000%

And finally we can make efficient queries to find a parent’s children:

derived> example.Child { parent = { name = "Pet" }}
{ "id": 1037, "key": { "parent": { "id": 1024 }, "child": { "id": 1025 } } }
{ "id": 1038, "key": { "parent": { "id": 1024 }, "child": { "id": 1026 } } }

2 results, 2 facts, 0.41ms, 160992 bytes, 1013 compiled bytes
Facts searched:
                         example.Child.1 : 2
                         example.Class.1 : 1

We found the correct 2 results, and only searched 2 example.Child facts.

This idea of adding extra indices to your database using derived predicates is common practice when working with Glean data, so it’s worthwhile getting familiar with it.

The order of statements is important​

Suppose we want to find the grandparent of the Goldfish class using our example schema. We would probably write it like this:

Q where
    example.Parent { child = { name = "Goldfish" }, parent = P };
    example.Parent { child = P, parent = Q }

Generally speaking the statements are matched top-to-bottom. For each of the facts that match the first statement, bind the variables in the pattern and then proceed with the second statement, and so on.

As written, this query works by first finding the parent of Goldfish and then finding its parent, which is exactly what we want. This query will be efficient, because both stages are matching on the first field of the example.Parent predicate.

If instead we swapped the order of the statements:

Q where
    example.Parent { child = P, parent = Q };
    example.Parent { child = { name = "Goldfish" }, parent = P }

The query still works, and means exactly the same thing, but it’s much less efficient. This query works as follows:

  • for each example.Parent fact, call the child P and the parent Q
  • search for an example.Parent fact with child { name = "Goldfish" } and parent P
  • if it exists, then Q is a result

This is going to involve searching all of the example.Parent facts, instead of just the ones for the parent of Goldfish.

The general rule of thumb is to do the more specific searches first. The search for example.Parent { child = { name = "Goldfish" }, parent = P } is efficient because we know the child, this binds he value of P which makes the search for example.Parent { child = P, parent = Q } also fast.

- + \ No newline at end of file diff --git a/docs/angle/guide/index.html b/docs/angle/guide/index.html index 3d5776424..a8015de45 100644 --- a/docs/angle/guide/index.html +++ b/docs/angle/guide/index.html @@ -5,7 +5,7 @@ Angle Guide | Glean - + @@ -35,7 +35,7 @@ than it. If Y = Values[..] were outside of the negation, the meaning would be give me all X for which there is at least one Y that is not greater than it. The answer to that would be all elements.

- + \ No newline at end of file diff --git a/docs/angle/intro/index.html b/docs/angle/intro/index.html index 63ce1ec4e..af14a1066 100644 --- a/docs/angle/intro/index.html +++ b/docs/angle/intro/index.html @@ -5,7 +5,7 @@ Angle Introduction | Glean - + @@ -16,7 +16,7 @@ particularly suited for finding and extracting data from Glean.

To give you a flavour of the query language, here is how we could return the names of all the member declarations defined in a JavaScript file project/myfile.js:

N where
  flow.FileDeclaration {
    file = "project/myfile.js",
    declaration = {
      memberDecl = {
        name = N
      }
    }
  }

To learn about Angle, start with the Guide.

- + \ No newline at end of file diff --git a/docs/angle/reference/index.html b/docs/angle/reference/index.html index ce3bbd411..29f3062d8 100644 --- a/docs/angle/reference/index.html +++ b/docs/angle/reference/index.html @@ -5,7 +5,7 @@ Angle Reference | Glean - + @@ -24,7 +24,7 @@ Β Β term < term
Β Β term <= term
Β Β term !== term

Standard numerical comparisons. These work on values of type nat only, and they have value {} if the comparison succeeds, otherwise they fail (in the same way as a predicate match fails if there are no facts that match the pattern).

Β Β term != term

Standard comparison between two terms of any type. It has a value of {} if the comparison succeeds, otherwise it fails in the same way as a predicate match fails if there are no facts that match the pattern.

- + \ No newline at end of file diff --git a/docs/angle/style/index.html b/docs/angle/style/index.html index 08adf7554..eccdca80f 100644 --- a/docs/angle/style/index.html +++ b/docs/angle/style/index.html @@ -5,14 +5,14 @@ Angle Style Guide | Glean - +

Angle Style Guide

Typical Angle style uses the following rules:

  • 2-column indentation
  • trailing commas
  • open/close braces on a line by themselves
  • camel case for record field names

e.g.

# Named parameter
type Parameter =
  {
    name : Name,
    type : Type,
    isVariadic : bool,
  }

This uses quite a lot of vertical space, but it's clear and works well with source control.

It's OK to put things on a single line if they fit:

type Access = enum { Public | Protected | Private }
- + \ No newline at end of file diff --git a/docs/building/index.html b/docs/building/index.html index c660e6c22..442b38369 100644 --- a/docs/building/index.html +++ b/docs/building/index.html @@ -5,7 +5,7 @@ Building Glean from Source | Glean - + @@ -26,7 +26,7 @@ build and install its dependencies:

./install_deps.sh

Build Glean​

Now you can build all the Glean parts:

make

If everything worked, the tests should pass:

make test

At this point you can cabal install to install the executables into ~/.cabal/bin.

Tips for faster builds​

If you have 4 or more cores and at least 16G of ram, you can significantly speed up the build times by passing some flags to the build stages. On an 6 core machine with 16G of ram you might use, to save 50% or more of the build time.

./install_deps.sh --threads 6
make EXTRA_GHC_OPTS='-j4 +RTS -A128m -n2m -RTS'

Using clang++-12 and clang-12 as the C and C++ compilers can shave another 25% off the build time.

- + \ No newline at end of file diff --git a/docs/cli/index.html b/docs/cli/index.html index 2567dd2db..8fe4ed2e3 100644 --- a/docs/cli/index.html +++ b/docs/cli/index.html @@ -5,7 +5,7 @@ The Glean CLI tool | Glean - + @@ -19,7 +19,12 @@ --repo-name, and --db-instance used to be --repo-hash. The terminology was changed because databases don't necessarily correspond to repositories, and the instance doesn't necessarily correspond to a -hash or revision of a repository.

The available commands are as follows:

glean create​

Create a new database.

To use the API, import Glean.Haxl. The implementation of the API is in glean/haxl/Haxl/DataSource/Glean.hs.

- + \ No newline at end of file diff --git a/docs/query/haskell/index.html b/docs/query/haskell/index.html index 32d4f93cc..cfed698db 100644 --- a/docs/query/haskell/index.html +++ b/docs/query/haskell/index.html @@ -5,14 +5,14 @@ Haskell Query API | Glean - +
- + \ No newline at end of file diff --git a/docs/query/intro/index.html b/docs/query/intro/index.html index 3027d2b5e..4a46af9a4 100644 --- a/docs/query/intro/index.html +++ b/docs/query/intro/index.html @@ -5,7 +5,7 @@ Querying Glean | Glean - + @@ -27,7 +27,7 @@ that you can install in VS Code by following the instructions in the next section.

Installing​

code --install-extension path/to/glean-x.y.z.vsix

The VS Code documentation describes alternative ways to install an extension from a .vsix file, from within the editor, in case the above command does not work or a more graphical, user-friendly is preferable.

- + \ No newline at end of file diff --git a/docs/running/index.html b/docs/running/index.html index 32836e934..9bb4bbb28 100644 --- a/docs/running/index.html +++ b/docs/running/index.html @@ -5,7 +5,7 @@ Running the Tools | Glean - + @@ -52,7 +52,7 @@ created, so it is likely to be a correct description of the data in the database.

  • --db-mock-writes
    Allow write operations, but discard the data and don't write it to the DB.

    • - + \ No newline at end of file diff --git a/docs/schema/all/index.html b/docs/schema/all/index.html index e5b1449a6..89c2312e7 100644 --- a/docs/schema/all/index.html +++ b/docs/schema/all/index.html @@ -5,7 +5,7 @@ The special "all" schema | Glean - + @@ -26,7 +26,7 @@ all separately, and clients can select at build time which version they want to use. This enables incremental migration of code from one schema to another schema.

    - + \ No newline at end of file diff --git a/docs/schema/basic/index.html b/docs/schema/basic/index.html index 4b742ccd0..980a65a88 100644 --- a/docs/schema/basic/index.html +++ b/docs/schema/basic/index.html @@ -5,7 +5,7 @@ Basic Concepts | Glean - + @@ -23,7 +23,7 @@ patterns that match multiple keys, and get back all the facts that match the pattern. More about this when we talk about Angle queries.

    - + \ No newline at end of file diff --git a/docs/schema/changing/index.html b/docs/schema/changing/index.html index f9fb5e966..745986603 100644 --- a/docs/schema/changing/index.html +++ b/docs/schema/changing/index.html @@ -5,7 +5,7 @@ How do I change a schema? | Glean - + @@ -52,7 +52,7 @@ which can be useful if you want to perform schema changes in a more explicit way, or to rename schemas.

    The feature is enabled using a top-level directive

    schema my_schema.2 evolves my_schema.1

    This declaration has the effect of treating queries for my_schema.1 predicates as if they were for my_schema.2. That is the query results will be retrieved from the database in the shape of a my_schema.2 fact and transformed into a fact of the equivalent my_schema.1 predicate specified in the query.

    The new schema must contain all the predicates of the old schema, either with new versions or old versions, and their definitions must be backwards compatible. We can achieve this by copying the entire content of the old schema into the new one and modifying it there.

    Now what should Glean do when a client asks for a fact from an old schema?

    • Answer with db facts from the old schema
    • Answer with db facts from the new schema transformed into the old ones.

    If there are no facts of the old schema in in the database we will take option 2. If the database has any fact at all of the old schema we choose option 1.

    That is, schema evolutions only take effect if there are no facts of the old schema in the database; it is ignored otherwise.

    As an example suppose we start with the following schemas:

    schema src.1 {
       predicate File {
         path : string
       }
    }

    schema os.1 {
      import src.1

      predicate Permissions {
        file : File,
        permissions : nat
      }
    }

    schema info.1 {
      import src.1

      predicate IsTemporary {
        file : File
      } F where F = src.File { path = "/tmp".. }
    }

    Now we want to make a backward-compatible change to src.File and add an extension field. We could add this to the file:

    schema src.2 {
       predicate File {
         path : string,
         extension : string
       }
    }

    schema src.2 evolves src.1

    Now if the indexer is still producing only src.1 facts, all other predicates will work as before and queries for src.File.2 will return no results.

    Once the indexer is changed to produce only src.2 facts queries like src.File.1 _ will be fulfilled using data from the src.2 schema, converting the src.File.2 results to the shape of src.File.1 before returning to the client.

    This is also the case in the derivation query of info.IsTemporary. Although info imports src.1, the query will be transformed to use src.2 facts.

    On the other hand, os.Permissions will be empty. This must be the case because its first field references a src.File.1 fact, of which there is none in the database. For this predicate to continue being available we must evolve its schema as well.

    schema os.2 {             # changed
      import src.2            # changed

      predicate Permissions {
        file : File,
        permissions : nat
      }
    }

    schema os.2 evolves os.1    # changed
    - + \ No newline at end of file diff --git a/docs/schema/design/index.html b/docs/schema/design/index.html index cf82d1e4b..52b3be6a5 100644 --- a/docs/schema/design/index.html +++ b/docs/schema/design/index.html @@ -5,7 +5,7 @@ Schema Design | Glean - + @@ -52,7 +52,7 @@ example of this was described in What is the difference between a predicate and a type?.

    How to experiment with schema design​

    • Generate some data and see how large it is, using :stat in the shell.

    • Write some example queries against your data, and check how much searching they do using :profile in the shell (see Query Debugging).

    - + \ No newline at end of file diff --git a/docs/schema/recursion/index.html b/docs/schema/recursion/index.html index 860fa76da..cd27317de 100644 --- a/docs/schema/recursion/index.html +++ b/docs/schema/recursion/index.html @@ -5,7 +5,7 @@ Recursion | Glean - + @@ -23,7 +23,7 @@ keys would make this process significantly harder.

    Facts can be recursive in their values, but not their keys. A mutually recursive set of facts must be added to the database in a single batch, however.

    To summarise, recursion is

    • allowed between predicates
    • not allowed between keys
    • allowed between values
    - + \ No newline at end of file diff --git a/docs/schema/syntax/index.html b/docs/schema/syntax/index.html index 7a6ee76b8..144820c39 100644 --- a/docs/schema/syntax/index.html +++ b/docs/schema/syntax/index.html @@ -5,7 +5,7 @@ Syntax | Glean - + @@ -44,7 +44,7 @@ future. The process for safely changing schemas is described in Changing the Schema.

    schema example.2 : example.1 {
    predicate Class :
      {
           # new definition of Class
      }
    }

    Inheritance is useful for making changes to a schema by creating a new schema version:

    • Inheriting from a schema brings into scope all the types and predicates of that schema, both qualified and unqualified.
    • The new schema also exports all the types and predicates defined in the schemas it inherits from, except those that are re-defined.

    Specifically, in the above example:

    • We can import example.2 anywhere and get all the predicates defined in example.1, except that we'll get the new Class defined in example.2.
    • We can still import example.1 and get the old version of the schema.

    Note that if you have predicates that depend on a predicate that was revised in this way, you must also copy those predicates to the new schema, because the existing predicates will refer to the old version of the predicate you revised. (In due course Glean will probably provide a convenient way to do this; in the meantime you have to copy & paste. Not a big deal because you'll usually delete the old one at some point, and you can't modify it anyway.)

    Named schemas can not form cycles through their import or inheritance declarations.

    Naming rules and conventions​

    Names take the form of a dot-separated sequence of alphanumeric words. For example, sys.Blob, clang.File, or cxx.objc.Name. The words up to the last dot are the namespace, the final word is the name.

    See Names for full details.

    Briefly:

    • Namespaces (schema names) are dot-separated sequences of identifiers each beginning with a lower-case letter
    • Names and namespaces can contain only alphanumeric characters, '_', or '.' (namespaces only)
    • There is a set of reserved words that can't be used for names, e.g. class. Syncing the schema will fail with an error if you use a reserved word.
    - + \ No newline at end of file diff --git a/docs/schema/thrift/index.html b/docs/schema/thrift/index.html index 16c7da037..fa63cb43f 100644 --- a/docs/schema/thrift/index.html +++ b/docs/schema/thrift/index.html @@ -5,7 +5,7 @@ Thrift and JSON | Glean - + @@ -20,7 +20,7 @@ shell, the results are printed as JSON-encoded Thrift; when you write data to Glean it can be in the form of JSON-encoded Thrift.

    The relationship between schema types and Thrift/JSON is given by the following table:

    Schema typeThrift typeJSON
    natNat (i64)123
    byteByte (i8)123
    stringstring"abc"
    boolbooltrue or false
    [byte]binarybase-64 encoded string *1
    [T]list<T>[...]
    {
    Β Β f₁ : T₁,
    Β Β ...,
    Β Β fβ‚™ : Tβ‚™
    }    		struct Foo {
    Β Β 1: T₁ f₁;
    Β Β ...
    Β Β n: Tβ‚™ fβ‚™;
    }    		{
    Β Β "f₁" : q₁,
    Β Β ...
    Β Β "fβ‚™" : qβ‚™
    }
    {
    Β Β f₁ : T₁ |
    Β Β ... |
    Β Β fβ‚™ : Tβ‚™
    }    		union Foo {
    Β Β 1: T₁ f₁;
    Β Β ...
    Β Β n: Tβ‚™ fβ‚™;
    }    		{ "f" : t }
    for one of the fields f₁..fβ‚™
    maybe TIn a record field:
    optional T f    		f : t
    if the value is present
    enum {
    Β Β L₁|
    Β Β ...|
    Β Β Lβ‚™
    }    		enum Foo {
    Β Β L₁ = 1,
    Β Β ...
    Β Β Lβ‚™ = n
    }    		the index of the value,
    e.g. 12
    predicate P : K -> Vstruct P {
    Β Β 1: Id id
    Β Β 2: optional K key
    Β Β 3: optional V value
    }
    note*2    		refer to fact N:
    N or { "id": N }
    define a fact:
    { "id" : N,
    Β Β Β "key" : t } or
    { "key": t } or
    { "key": t,
    Β Β Β Β "value" : v }
    type N = Tdepending on T:
    struct N { .. }
    union N {...}
    enum N {...}
    typedef T N;    		same as type T

    1. The Thrift encoding of a binary field in JSON is a base-64-encoded string. However, not all Thrift implementations respect this. At the time of writing, the Python Thrift implementation doesn't base-64-encode binary values. For this reason we provide an option in the Glean Thrift API to disable base-64 encoding for binary if your client doesn't support it. The Glean Shell also uses this option to make it easier to work with binary.

    2. the key is optional - a nested fact may be expanded in place or represented by a reference to the fact ID only. When querying Glean data the query specifies which nested facts should be expanded in the result, and when writing data to Glean using Thrift or JSON, we can optionally specify the value of nested facts inline.

    - + \ No newline at end of file diff --git a/docs/schema/types/index.html b/docs/schema/types/index.html index 17be4ab66..30963e47a 100644 --- a/docs/schema/types/index.html +++ b/docs/schema/types/index.html @@ -5,14 +5,14 @@ Built-in Types | Glean - +

    Built-in Types

    TypeMeaning
    nat64-bit natural numbers
    byte8-bit natural numbers
    stringUTF-8 encoded strings
    [T]lists of elements of type T
    { field₁ : T₁, ..., fieldβ‚™ : Tβ‚™ }a record with zero or more named fields
    { field₁ : T₁ | ... | fieldβ‚™ : Tβ‚™ }a sum (union) type with one or more named alternatives
    Pa reference to a fact of predicate P
    boolthe boolean type with values true and false
    maybe Tan optional value of type T
    enum { name₁ | ... | nameβ‚™ }exactly one of the symbols name₁..nameβ‚™
    - + \ No newline at end of file diff --git a/docs/schema/workflow/index.html b/docs/schema/workflow/index.html index 363beddc3..6647cd92d 100644 --- a/docs/schema/workflow/index.html +++ b/docs/schema/workflow/index.html @@ -5,7 +5,7 @@ Workflow | Glean - + @@ -15,7 +15,7 @@ glean/schema/thrift, which are then processed into Haskell code by

    make thrift-schema-hs

    and finally built by

    make glean

    Examples of code using these types:

    Experimenting with schemas​

    1. Modify the source files in glean/schema/source

    2. Start up the shell locally using your schema:
      glean shell --db-root ~/local/gleandb --schema glean/schema/source
      If you don't already have a ~/local/gleandb for storing local DBs, create it with mkdir ~/local/gleandb.

    3. Test it with some example data: see Loading a DB from JSON in the shell.

    4. Iterate as necessary, using :reload in the shell to reload the schema.

    - + \ No newline at end of file diff --git a/docs/server/index.html b/docs/server/index.html index 7eb988505..a8223973b 100644 --- a/docs/server/index.html +++ b/docs/server/index.html @@ -5,7 +5,7 @@ Running the Glean Server | Glean - + @@ -17,7 +17,7 @@ Port number to listen on.

    The server watches for changes in any configuration files specified with config:PATH, including the schema.

    - + \ No newline at end of file diff --git a/docs/shell/index.html b/docs/shell/index.html index ae49c9e86..81ad99e61 100644 --- a/docs/shell/index.html +++ b/docs/shell/index.html @@ -5,7 +5,7 @@ Using the Shell | Glean - + @@ -55,7 +55,7 @@ test your changes.
  • :statistics [PREDICATE]
    Show statistics for the current database.
  • :quit
    Leave the shell.
    • - + \ No newline at end of file diff --git a/docs/trying/index.html b/docs/trying/index.html index eacc60aac..eb7a8a406 100644 --- a/docs/trying/index.html +++ b/docs/trying/index.html @@ -5,7 +5,7 @@ Trying Glean | Glean - + @@ -28,7 +28,7 @@ (http://localhost:8888/packages/react-dom/src/client/ReactDOMComponent.js) - note how Glean is accurately linking both local and imported symbols.

    - + \ No newline at end of file diff --git a/docs/walkthrough/index.html b/docs/walkthrough/index.html index 6ea6e7670..4f30cc37c 100644 --- a/docs/walkthrough/index.html +++ b/docs/walkthrough/index.html @@ -5,7 +5,7 @@ Walkthrough | Glean - + @@ -22,7 +22,7 @@ in /tmp/glean/facts.glean. Then reload schema and create a database from the example data using :reload and :load <file> in the shell:

    > :reload
    reloading schema [2 schemas, 7 predicates]
    > :load /tmp/glean/facts.glean
    facts>

    Now head over to Angle Guide to try some example queries and learn about how the query language works.

    - + \ No newline at end of file diff --git a/docs/write/index.html b/docs/write/index.html index bd4c5e912..68b8e218f 100644 --- a/docs/write/index.html +++ b/docs/write/index.html @@ -5,7 +5,7 @@ Writing data to Glean | Glean - + @@ -22,7 +22,7 @@ have dependencies between them, so the server won't hand out a task until its dependencies are complete.

  • When all tasks are done, the server marks the database as complete.

    • APIs for writing​

    If none of the above work for you, the Thrift API enable basic write access to the database.

    • kickOff can be used to create a new DB
    • sendJsonBatch is for sending facts in JSON-serialized form
    • finishBatch exposes the result of a previously sent JSON batch
    • workFinished closes a DB

    A rough outline of a client looks like:

    glean = make_glean_thrift_client()
    db_handle = make_uuid()
    glean.kickOff(my_repo, KickOffFill(writeHandle=db_handle))
    for json_batch in json_batches:
        handle = glean.sendJsonBatch(json_batch)
        result = glean.finishBatch(handle)
        # handle result
    glean.workFinished(my_repo, db_handle, success_or_failure)

    Writing from the command line​

    JSON format​

    The JSON format for Glean data is described in Thrift and JSON.

    Here's an example of JSON data for writing to Glean:

    [
      { "predicate": "cxx1.Name.1",          # define facts for cxx1.Name.1
        "facts": [
          { "id": 1, "key": "abc" },         # define a fact with id 1
          { "id": 2, "key": "def" }
        ]
      },
      { "predicate": "cxx1.FunctionName.1",  # define facts for cxx1.FunctionName.1
        "facts": [
          { "id": 3,
            "key": {
              "name": { "id": 1 }}}          # reference to fact with id 1
        ]
      },
      { "predicate": "cxx1.FunctionQName.1", # define facts for cxx1.FunctionQName.1
        "facts": [
          { "key": {
            "name": 3,                       # 3 is shorthand for { "id": 3 }
            "scope": { "global_": {} } } },
          { "key": {
            "name": {
              "key": {                       # define a nested fact directly
                "name": {
                  "key": "ghi" }}},         # another nested fact
            "scope": {
              "namespace_": {
                "key": {
                  "name": {
                    "key": "std" }}}}}
        ]
      }
    ]

    The rules of the game are:

    • Predicate names must include versions, i.e. cxx1.Name.1 rather than cxx1.Name.
    • The id field when defining a fact is optional. The id numbers in the input file will not be the final id numbers assigned to the facts in the database.
    • There are no restrictions on id values (any 64-bit integer will do) but an id value may not be reused within a file.
    • Later facts may refer to earlier ones using either { "id": N } or just N.
    • It is only possible to refer to ids from facts in the same file, if you are writing multiple files using glean write or via the sendJsonBatch API.
    • a nested facts can be defined inline, instead of defining it with an id first and then referencing it.
    • an inline nested fact can be given an id and referred to later.

    Loading a DB from JSON in the shell​

    The shell is useful for experimenting with creating a DB from JSON data directly. Let's try loading the data above into a DB in the shell:

    $ mkdir /tmp/glean
    $ glean shell --db-root /tmp/glean
    Glean Shell, dev mode
    type :help for help.
    no fbsource database availabe
    > :load test/0 /home/smarlow/test
    I0514 01:19:37.137109 3566745 Work.hs:184] test/16: database complete

    Let's see what facts we loaded:

    test> :stat
    1
      count: 72
      size:  5988
    cxx1.FunctionName.1
      count: 2
      size:  66
    cxx1.FunctionQName.1
      count: 2
      size:  70
    cxx1.Name.1
      count: 4
      size:  148
    cxx1.NamespaceQName.1
      count: 1
      size:  35
    test>

    Note that there were 4 cxx1.Name.1 facts - some of those were defined as inline nested facts in the JSON. We can query them all:

    test> cxx1.Name _
    4 results, 1 queries, 4 facts, 0.22ms, 44296 bytes

    { "id": 1096, "key": "abc" }
    { "id": 1097, "key": "def" }
    { "id": 1100, "key": "ghi" }
    { "id": 1102, "key": "std" }

    Note that the id values here do not correspond to the id values in the input file.

    Creating a database using the command line​

    The glean command-line tool can be used to create a database directly on the server.

    To create a database from a single file of JSON facts:

    glean create --service <write-server> --finish --db <name>/<instance> <filename>

    where

    • <write-server> is the host:port of the Glean server
    • <name> is the name for your DB. For indexing repositories we normally use the name of the repository, but it's just a string, so you can use whatever you want.
    • <hash> identifies this particular instance of your database. For repositories we normally use the revision hash, but, again, it's just a string.
    • <filename> the file containing the JSON facts.

    If the file is more than, say, 100MB, this operation will probably time out sending the data to the server. To send large amounts of data you need to batch it up into multiple files, and then send it like this:

    glean create --service <write-server> --db <name>/<hash>
    glean write --service <write-server> --db <name>/<hash> <filename1>
    glean write --service <write-server> --db <name>/<hash> <filename2>
    ...
    glean finish --service <write-server> --db <name>/<hash>

    To find out if your DB made it:

    glean shell --service <write-server> :list

    This will list the DBs available on the write server.

    - + \ No newline at end of file diff --git a/index.html b/index.html index c864de155..2eed6d79d 100644 --- a/index.html +++ b/index.html @@ -5,14 +5,14 @@ Glean | Glean - +
    Glean Logo

    Glean

    System for collecting, deriving and querying facts about source code

    Get Started

    Key Features

    Rich types

    Store detailed information about code

    Compact storage

    Store data about code at scale

    Efficient queries

    Build experiences with deep insights from code

    - + \ No newline at end of file