cannam@135: # Copyright (c) 2013-2014 Sandstorm Development Group, Inc. and contributors
cannam@135: # Licensed under the MIT License:
cannam@135: #
cannam@135: # Permission is hereby granted, free of charge, to any person obtaining a copy
cannam@135: # of this software and associated documentation files (the "Software"), to deal
cannam@135: # in the Software without restriction, including without limitation the rights
cannam@135: # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
cannam@135: # copies of the Software, and to permit persons to whom the Software is
cannam@135: # furnished to do so, subject to the following conditions:
cannam@135: #
cannam@135: # The above copyright notice and this permission notice shall be included in
cannam@135: # all copies or substantial portions of the Software.
cannam@135: #
cannam@135: # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
cannam@135: # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
cannam@135: # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
cannam@135: # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
cannam@135: # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
cannam@135: # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
cannam@135: # THE SOFTWARE.
cannam@135: 
cannam@135: using Cxx = import "/capnp/c++.capnp";
cannam@135: 
cannam@135: @0xa93fc509624c72d9;
cannam@135: $Cxx.namespace("capnp::schema");
cannam@135: 
cannam@135: using Id = UInt64;
cannam@135: # The globally-unique ID of a file, type, or annotation.
cannam@135: 
cannam@135: struct Node {
cannam@135:   id @0 :Id;
cannam@135: 
cannam@135:   displayName @1 :Text;
cannam@135:   # Name to present to humans to identify this Node.  You should not attempt to parse this.  Its
cannam@135:   # format could change.  It is not guaranteed to be unique.
cannam@135:   #
cannam@135:   # (On Zooko's triangle, this is the node's nickname.)
cannam@135: 
cannam@135:   displayNamePrefixLength @2 :UInt32;
cannam@135:   # If you want a shorter version of `displayName` (just naming this node, without its surrounding
cannam@135:   # scope), chop off this many characters from the beginning of `displayName`.
cannam@135: 
cannam@135:   scopeId @3 :Id;
cannam@135:   # ID of the lexical parent node.  Typically, the scope node will have a NestedNode pointing back
cannam@135:   # at this node, but robust code should avoid relying on this (and, in fact, group nodes are not
cannam@135:   # listed in the outer struct's nestedNodes, since they are listed in the fields).  `scopeId` is
cannam@135:   # zero if the node has no parent, which is normally only the case with files, but should be
cannam@135:   # allowed for any kind of node (in order to make runtime type generation easier).
cannam@135: 
cannam@135:   parameters @32 :List(Parameter);
cannam@135:   # If this node is parameterized (generic), the list of parameters. Empty for non-generic types.
cannam@135: 
cannam@135:   isGeneric @33 :Bool;
cannam@135:   # True if this node is generic, meaning that it or one of its parent scopes has a non-empty
cannam@135:   # `parameters`.
cannam@135: 
cannam@135:   struct Parameter {
cannam@135:     # Information about one of the node's parameters.
cannam@135: 
cannam@135:     name @0 :Text;
cannam@135:   }
cannam@135: 
cannam@135:   nestedNodes @4 :List(NestedNode);
cannam@135:   # List of nodes nested within this node, along with the names under which they were declared.
cannam@135: 
cannam@135:   struct NestedNode {
cannam@135:     name @0 :Text;
cannam@135:     # Unqualified symbol name.  Unlike Node.displayName, this *can* be used programmatically.
cannam@135:     #
cannam@135:     # (On Zooko's triangle, this is the node's petname according to its parent scope.)
cannam@135: 
cannam@135:     id @1 :Id;
cannam@135:     # ID of the nested node.  Typically, the target node's scopeId points back to this node, but
cannam@135:     # robust code should avoid relying on this.
cannam@135:   }
cannam@135: 
cannam@135:   annotations @5 :List(Annotation);
cannam@135:   # Annotations applied to this node.
cannam@135: 
cannam@135:   union {
cannam@135:     # Info specific to each kind of node.
cannam@135: 
cannam@135:     file @6 :Void;
cannam@135: 
cannam@135:     struct :group {
cannam@135:       dataWordCount @7 :UInt16;
cannam@135:       # Size of the data section, in words.
cannam@135: 
cannam@135:       pointerCount @8 :UInt16;
cannam@135:       # Size of the pointer section, in pointers (which are one word each).
cannam@135: 
cannam@135:       preferredListEncoding @9 :ElementSize;
cannam@135:       # The preferred element size to use when encoding a list of this struct.  If this is anything
cannam@135:       # other than `inlineComposite` then the struct is one word or less in size and is a candidate
cannam@135:       # for list packing optimization.
cannam@135: 
cannam@135:       isGroup @10 :Bool;
cannam@135:       # If true, then this "struct" node is actually not an independent node, but merely represents
cannam@135:       # some named union or group within a particular parent struct.  This node's scopeId refers
cannam@135:       # to the parent struct, which may itself be a union/group in yet another struct.
cannam@135:       #
cannam@135:       # All group nodes share the same dataWordCount and pointerCount as the top-level
cannam@135:       # struct, and their fields live in the same ordinal and offset spaces as all other fields in
cannam@135:       # the struct.
cannam@135:       #
cannam@135:       # Note that a named union is considered a special kind of group -- in fact, a named union
cannam@135:       # is exactly equivalent to a group that contains nothing but an unnamed union.
cannam@135: 
cannam@135:       discriminantCount @11 :UInt16;
cannam@135:       # Number of fields in this struct which are members of an anonymous union, and thus may
cannam@135:       # overlap.  If this is non-zero, then a 16-bit discriminant is present indicating which
cannam@135:       # of the overlapping fields is active.  This can never be 1 -- if it is non-zero, it must be
cannam@135:       # two or more.
cannam@135:       #
cannam@135:       # Note that the fields of an unnamed union are considered fields of the scope containing the
cannam@135:       # union -- an unnamed union is not its own group.  So, a top-level struct may contain a
cannam@135:       # non-zero discriminant count.  Named unions, on the other hand, are equivalent to groups
cannam@135:       # containing unnamed unions.  So, a named union has its own independent schema node, with
cannam@135:       # `isGroup` = true.
cannam@135: 
cannam@135:       discriminantOffset @12 :UInt32;
cannam@135:       # If `discriminantCount` is non-zero, this is the offset of the union discriminant, in
cannam@135:       # multiples of 16 bits.
cannam@135: 
cannam@135:       fields @13 :List(Field);
cannam@135:       # Fields defined within this scope (either the struct's top-level fields, or the fields of
cannam@135:       # a particular group; see `isGroup`).
cannam@135:       #
cannam@135:       # The fields are sorted by ordinal number, but note that because groups share the same
cannam@135:       # ordinal space, the field's index in this list is not necessarily exactly its ordinal.
cannam@135:       # On the other hand, the field's position in this list does remain the same even as the
cannam@135:       # protocol evolves, since it is not possible to insert or remove an earlier ordinal.
cannam@135:       # Therefore, for most use cases, if you want to identify a field by number, it may make the
cannam@135:       # most sense to use the field's index in this list rather than its ordinal.
cannam@135:     }
cannam@135: 
cannam@135:     enum :group {
cannam@135:       enumerants@14 :List(Enumerant);
cannam@135:       # Enumerants ordered by numeric value (ordinal).
cannam@135:     }
cannam@135: 
cannam@135:     interface :group {
cannam@135:       methods @15 :List(Method);
cannam@135:       # Methods ordered by ordinal.
cannam@135: 
cannam@135:       superclasses @31 :List(Superclass);
cannam@135:       # Superclasses of this interface.
cannam@135:     }
cannam@135: 
cannam@135:     const :group {
cannam@135:       type @16 :Type;
cannam@135:       value @17 :Value;
cannam@135:     }
cannam@135: 
cannam@135:     annotation :group {
cannam@135:       type @18 :Type;
cannam@135: 
cannam@135:       targetsFile @19 :Bool;
cannam@135:       targetsConst @20 :Bool;
cannam@135:       targetsEnum @21 :Bool;
cannam@135:       targetsEnumerant @22 :Bool;
cannam@135:       targetsStruct @23 :Bool;
cannam@135:       targetsField @24 :Bool;
cannam@135:       targetsUnion @25 :Bool;
cannam@135:       targetsGroup @26 :Bool;
cannam@135:       targetsInterface @27 :Bool;
cannam@135:       targetsMethod @28 :Bool;
cannam@135:       targetsParam @29 :Bool;
cannam@135:       targetsAnnotation @30 :Bool;
cannam@135:     }
cannam@135:   }
cannam@135: }
cannam@135: 
cannam@135: struct Field {
cannam@135:   # Schema for a field of a struct.
cannam@135: 
cannam@135:   name @0 :Text;
cannam@135: 
cannam@135:   codeOrder @1 :UInt16;
cannam@135:   # Indicates where this member appeared in the code, relative to other members.
cannam@135:   # Code ordering may have semantic relevance -- programmers tend to place related fields
cannam@135:   # together.  So, using code ordering makes sense in human-readable formats where ordering is
cannam@135:   # otherwise irrelevant, like JSON.  The values of codeOrder are tightly-packed, so the maximum
cannam@135:   # value is count(members) - 1.  Fields that are members of a union are only ordered relative to
cannam@135:   # the other members of that union, so the maximum value there is count(union.members).
cannam@135: 
cannam@135:   annotations @2 :List(Annotation);
cannam@135: 
cannam@135:   const noDiscriminant :UInt16 = 0xffff;
cannam@135: 
cannam@135:   discriminantValue @3 :UInt16 = Field.noDiscriminant;
cannam@135:   # If the field is in a union, this is the value which the union's discriminant should take when
cannam@135:   # the field is active.  If the field is not in a union, this is 0xffff.
cannam@135: 
cannam@135:   union {
cannam@135:     slot :group {
cannam@135:       # A regular, non-group, non-fixed-list field.
cannam@135: 
cannam@135:       offset @4 :UInt32;
cannam@135:       # Offset, in units of the field's size, from the beginning of the section in which the field
cannam@135:       # resides.  E.g. for a UInt32 field, multiply this by 4 to get the byte offset from the
cannam@135:       # beginning of the data section.
cannam@135: 
cannam@135:       type @5 :Type;
cannam@135:       defaultValue @6 :Value;
cannam@135: 
cannam@135:       hadExplicitDefault @10 :Bool;
cannam@135:       # Whether the default value was specified explicitly.  Non-explicit default values are always
cannam@135:       # zero or empty values.  Usually, whether the default value was explicit shouldn't matter.
cannam@135:       # The main use case for this flag is for structs representing method parameters:
cannam@135:       # explicitly-defaulted parameters may be allowed to be omitted when calling the method.
cannam@135:     }
cannam@135: 
cannam@135:     group :group {
cannam@135:       # A group.
cannam@135: 
cannam@135:       typeId @7 :Id;
cannam@135:       # The ID of the group's node.
cannam@135:     }
cannam@135:   }
cannam@135: 
cannam@135:   ordinal :union {
cannam@135:     implicit @8 :Void;
cannam@135:     explicit @9 :UInt16;
cannam@135:     # The original ordinal number given to the field.  You probably should NOT use this; if you need
cannam@135:     # a numeric identifier for a field, use its position within the field array for its scope.
cannam@135:     # The ordinal is given here mainly just so that the original schema text can be reproduced given
cannam@135:     # the compiled version -- i.e. so that `capnp compile -ocapnp` can do its job.
cannam@135:   }
cannam@135: }
cannam@135: 
cannam@135: struct Enumerant {
cannam@135:   # Schema for member of an enum.
cannam@135: 
cannam@135:   name @0 :Text;
cannam@135: 
cannam@135:   codeOrder @1 :UInt16;
cannam@135:   # Specifies order in which the enumerants were declared in the code.
cannam@135:   # Like Struct.Field.codeOrder.
cannam@135: 
cannam@135:   annotations @2 :List(Annotation);
cannam@135: }
cannam@135: 
cannam@135: struct Superclass {
cannam@135:   id @0 :Id;
cannam@135:   brand @1 :Brand;
cannam@135: }
cannam@135: 
cannam@135: struct Method {
cannam@135:   # Schema for method of an interface.
cannam@135: 
cannam@135:   name @0 :Text;
cannam@135: 
cannam@135:   codeOrder @1 :UInt16;
cannam@135:   # Specifies order in which the methods were declared in the code.
cannam@135:   # Like Struct.Field.codeOrder.
cannam@135: 
cannam@135:   implicitParameters @7 :List(Node.Parameter);
cannam@135:   # The parameters listed in [] (typically, type / generic parameters), whose bindings are intended
cannam@135:   # to be inferred rather than specified explicitly, although not all languages support this.
cannam@135: 
cannam@135:   paramStructType @2 :Id;
cannam@135:   # ID of the parameter struct type.  If a named parameter list was specified in the method
cannam@135:   # declaration (rather than a single struct parameter type) then a corresponding struct type is
cannam@135:   # auto-generated.  Such an auto-generated type will not be listed in the interface's
cannam@135:   # `nestedNodes` and its `scopeId` will be zero -- it is completely detached from the namespace.
cannam@135:   # (Awkwardly, it does of course inherit generic parameters from the method's scope, which makes
cannam@135:   # this a situation where you can't just climb the scope chain to find where a particular
cannam@135:   # generic parameter was introduced. Making the `scopeId` zero was a mistake.)
cannam@135: 
cannam@135:   paramBrand @5 :Brand;
cannam@135:   # Brand of param struct type.
cannam@135: 
cannam@135:   resultStructType @3 :Id;
cannam@135:   # ID of the return struct type; similar to `paramStructType`.
cannam@135: 
cannam@135:   resultBrand @6 :Brand;
cannam@135:   # Brand of result struct type.
cannam@135: 
cannam@135:   annotations @4 :List(Annotation);
cannam@135: }
cannam@135: 
cannam@135: struct Type {
cannam@135:   # Represents a type expression.
cannam@135: 
cannam@135:   union {
cannam@135:     # The ordinals intentionally match those of Value.
cannam@135: 
cannam@135:     void @0 :Void;
cannam@135:     bool @1 :Void;
cannam@135:     int8 @2 :Void;
cannam@135:     int16 @3 :Void;
cannam@135:     int32 @4 :Void;
cannam@135:     int64 @5 :Void;
cannam@135:     uint8 @6 :Void;
cannam@135:     uint16 @7 :Void;
cannam@135:     uint32 @8 :Void;
cannam@135:     uint64 @9 :Void;
cannam@135:     float32 @10 :Void;
cannam@135:     float64 @11 :Void;
cannam@135:     text @12 :Void;
cannam@135:     data @13 :Void;
cannam@135: 
cannam@135:     list :group {
cannam@135:       elementType @14 :Type;
cannam@135:     }
cannam@135: 
cannam@135:     enum :group {
cannam@135:       typeId @15 :Id;
cannam@135:       brand @21 :Brand;
cannam@135:     }
cannam@135:     struct :group {
cannam@135:       typeId @16 :Id;
cannam@135:       brand @22 :Brand;
cannam@135:     }
cannam@135:     interface :group {
cannam@135:       typeId @17 :Id;
cannam@135:       brand @23 :Brand;
cannam@135:     }
cannam@135: 
cannam@135:     anyPointer :union {
cannam@135:       unconstrained :union {
cannam@135:         # A regular AnyPointer.
cannam@135:         #
cannam@135:         # The name "unconstained" means as opposed to constraining it to match a type parameter.
cannam@135:         # In retrospect this name is probably a poor choice given that it may still be constrained
cannam@135:         # to be a struct, list, or capability.
cannam@135: 
cannam@135:         anyKind @18 :Void;       # truly AnyPointer
cannam@135:         struct @25 :Void;        # AnyStruct
cannam@135:         list @26 :Void;          # AnyList
cannam@135:         capability @27 :Void;    # Capability
cannam@135:       }
cannam@135: 
cannam@135:       parameter :group {
cannam@135:         # This is actually a reference to a type parameter defined within this scope.
cannam@135: 
cannam@135:         scopeId @19 :Id;
cannam@135:         # ID of the generic type whose parameter we're referencing. This should be a parent of the
cannam@135:         # current scope.
cannam@135: 
cannam@135:         parameterIndex @20 :UInt16;
cannam@135:         # Index of the parameter within the generic type's parameter list.
cannam@135:       }
cannam@135: 
cannam@135:       implicitMethodParameter :group {
cannam@135:         # This is actually a reference to an implicit (generic) parameter of a method. The only
cannam@135:         # legal context for this type to appear is inside Method.paramBrand or Method.resultBrand.
cannam@135: 
cannam@135:         parameterIndex @24 :UInt16;
cannam@135:       }
cannam@135:     }
cannam@135:   }
cannam@135: }
cannam@135: 
cannam@135: struct Brand {
cannam@135:   # Specifies bindings for parameters of generics. Since these bindings turn a generic into a
cannam@135:   # non-generic, we call it the "brand".
cannam@135: 
cannam@135:   scopes @0 :List(Scope);
cannam@135:   # For each of the target type and each of its parent scopes, a parameterization may be included
cannam@135:   # in this list. If no parameterization is included for a particular relevant scope, then either
cannam@135:   # that scope has no parameters or all parameters should be considered to be `AnyPointer`.
cannam@135: 
cannam@135:   struct Scope {
cannam@135:     scopeId @0 :Id;
cannam@135:     # ID of the scope to which these params apply.
cannam@135: 
cannam@135:     union {
cannam@135:       bind @1 :List(Binding);
cannam@135:       # List of parameter bindings.
cannam@135: 
cannam@135:       inherit @2 :Void;
cannam@135:       # The place where this Brand appears is actually within this scope or a sub-scope,
cannam@135:       # and the bindings for this scope should be inherited from the reference point.
cannam@135:     }
cannam@135:   }
cannam@135: 
cannam@135:   struct Binding {
cannam@135:     union {
cannam@135:       unbound @0 :Void;
cannam@135:       type @1 :Type;
cannam@135: 
cannam@135:       # TODO(someday): Allow non-type parameters? Unsure if useful.
cannam@135:     }
cannam@135:   }
cannam@135: }
cannam@135: 
cannam@135: struct Value {
cannam@135:   # Represents a value, e.g. a field default value, constant value, or annotation value.
cannam@135: 
cannam@135:   union {
cannam@135:     # The ordinals intentionally match those of Type.
cannam@135: 
cannam@135:     void @0 :Void;
cannam@135:     bool @1 :Bool;
cannam@135:     int8 @2 :Int8;
cannam@135:     int16 @3 :Int16;
cannam@135:     int32 @4 :Int32;
cannam@135:     int64 @5 :Int64;
cannam@135:     uint8 @6 :UInt8;
cannam@135:     uint16 @7 :UInt16;
cannam@135:     uint32 @8 :UInt32;
cannam@135:     uint64 @9 :UInt64;
cannam@135:     float32 @10 :Float32;
cannam@135:     float64 @11 :Float64;
cannam@135:     text @12 :Text;
cannam@135:     data @13 :Data;
cannam@135: 
cannam@135:     list @14 :AnyPointer;
cannam@135: 
cannam@135:     enum @15 :UInt16;
cannam@135:     struct @16 :AnyPointer;
cannam@135: 
cannam@135:     interface @17 :Void;
cannam@135:     # The only interface value that can be represented statically is "null", whose methods always
cannam@135:     # throw exceptions.
cannam@135: 
cannam@135:     anyPointer @18 :AnyPointer;
cannam@135:   }
cannam@135: }
cannam@135: 
cannam@135: struct Annotation {
cannam@135:   # Describes an annotation applied to a declaration.  Note AnnotationNode describes the
cannam@135:   # annotation's declaration, while this describes a use of the annotation.
cannam@135: 
cannam@135:   id @0 :Id;
cannam@135:   # ID of the annotation node.
cannam@135: 
cannam@135:   brand @2 :Brand;
cannam@135:   # Brand of the annotation.
cannam@135:   #
cannam@135:   # Note that the annotation itself is not allowed to be parameterized, but its scope might be.
cannam@135: 
cannam@135:   value @1 :Value;
cannam@135: }
cannam@135: 
cannam@135: enum ElementSize {
cannam@135:   # Possible element sizes for encoded lists.  These correspond exactly to the possible values of
cannam@135:   # the 3-bit element size component of a list pointer.
cannam@135: 
cannam@135:   empty @0;    # aka "void", but that's a keyword.
cannam@135:   bit @1;
cannam@135:   byte @2;
cannam@135:   twoBytes @3;
cannam@135:   fourBytes @4;
cannam@135:   eightBytes @5;
cannam@135:   pointer @6;
cannam@135:   inlineComposite @7;
cannam@135: }
cannam@135: 
cannam@135: struct CodeGeneratorRequest {
cannam@135:   nodes @0 :List(Node);
cannam@135:   # All nodes parsed by the compiler, including for the files on the command line and their
cannam@135:   # imports.
cannam@135: 
cannam@135:   requestedFiles @1 :List(RequestedFile);
cannam@135:   # Files which were listed on the command line.
cannam@135: 
cannam@135:   struct RequestedFile {
cannam@135:     id @0 :Id;
cannam@135:     # ID of the file.
cannam@135: 
cannam@135:     filename @1 :Text;
cannam@135:     # Name of the file as it appeared on the command-line (minus the src-prefix).  You may use
cannam@135:     # this to decide where to write the output.
cannam@135: 
cannam@135:     imports @2 :List(Import);
cannam@135:     # List of all imported paths seen in this file.
cannam@135: 
cannam@135:     struct Import {
cannam@135:       id @0 :Id;
cannam@135:       # ID of the imported file.
cannam@135: 
cannam@135:       name @1 :Text;
cannam@135:       # Name which *this* file used to refer to the foreign file.  This may be a relative name.
cannam@135:       # This information is provided because it might be useful for code generation, e.g. to
cannam@135:       # generate #include directives in C++.  We don't put this in Node.file because this
cannam@135:       # information is only meaningful at compile time anyway.
cannam@135:       #
cannam@135:       # (On Zooko's triangle, this is the import's petname according to the importing file.)
cannam@135:     }
cannam@135:   }
cannam@135: }