| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
To allow comparing directly with the value of a three-valued boolean
without being affected by the semantic of = operator, we have to support
SQL <boolean test> syntax.
To keep the parser simple, UNKNOWN is considered as a boolean literal
and it can be used outside of IS. It seems to me that the SQL standard
suggests that this is the correct behavior because UNKNOWN is listed
in both <boolean literal> and <truth value>.
This behavior seems to be different from what PostgreSQL and MySQL do.
They only recognize UNKNOWN when it is used at the right-hand side of IS
and consider it as an identifier when it is used outside of IS. However,
the standard says UNKNOWN is a reserved word, so automatically making
UNKNOWN an identifier looks non-standard to me.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
We have many interfaces decalred as a part of AST. Most of them are used
in a way called 'sum type', a type which is a collection of other types.
Since Go does not have a builtin way to check whether a type switch is
exhaustive, we add a static analysis tool called 'go-sumtype' to the CI
process to ensure we never hit the default panic case at runtime.
Since each interface must have at least a unique unexported method to
be considered as a valid sum type, we need a naming convention here.
Currently a unique name is created by putting ˉ character in front of
the name of the interface.
Remove Value function from Valuer interface declaration because the AST
printer has switched to reflection instead of using this interface. It
is not expected to have new users of Value functions because it returns
an empty interface. Type assertion is still required to access the value
and it is just clearer to assert the type of the AST node.
Remove AnyValueNode and DefaultValueNode from ExprNode. It is invalid to
use them as a part of an expression, and putting them in ExprNode just
makes type switches unreliable. Data types allocated for them are also
removed because non-expression nodes don't need data types.
Introduce InsertOptionNode and ColumnConstraintNode interfaces as sum
types. We used to use the generic Node interface to store them. Create
specific sum types enables go-sumtype to check type switches statically.
Drop assertNodeSlice because all callers are gone.
|
|
|
|
|
|
|
|
|
| |
* core: vm: sqlvm: README.md
Move design doc from private Google Doc to README.md.
* Add explanation for packing data.
* Move phase 2 items to TODO sectoin.
* Move fixed data type to "Unsupported Field Types"
* Add limitation section.
|
| |
|
|
|
|
|
|
| |
This commit implements fillAutoInc and fillDefault, and modifies
Storage.IncSequence such that it can handle the numbers larger than
maximum of uint64.
|
|
|
|
|
|
|
|
|
|
|
| |
In order to report messages other than errors, we are going to reuse
the error struct to store non-error messages, such as warnings and
notes. We add a new field to distinguish between error and non-error
messages. This field is not a part of SQLVM ABI, so non-error messages
should never be returned to the caller of the contract.
The zero value of severity is 'error'. Code which doesn't set this field
should keep working because 'error' was the only use case.
|
|
|
|
|
|
|
|
|
|
| |
In order to construct an error message which can be easily understood,
it is sometimes required to reference source code tokens corresponding
to nodes. It should not increase memory usage too much since all byte
slices share the same underlying array.
Drop UpdatePosition because it is never used. It is unclear that how it
can be used and it becomes obsolete after adding this new field.
|
|
|
|
|
|
|
| |
Instead of returning a fixed error code, we can return a boolean here
because the only possibility of an error is invalid arguments. Callers
of these functions must know where invalid arguments come from, and
correctly handle it by converting it to an error struct or panicking.
|
|
|
|
|
|
|
|
| |
Our BYTES type works like a binary string, while TEXT and STRING are
commonly used to represent a character string. Since SQL distinguishes
between binary strings and character strings and defines different
functions for them, we should avoid confusing users with misleading
names.
|
|
|
|
| |
Split methods of Storage into files by funtionalities.
|
|
|
|
|
|
|
|
| |
* core: vm: sqlvm: storage: implement bitmap and increasePK
* fixup! core: vm: sqlvm: storage: implement bitmap and increasePK
* fixup! core: vm: sqlvm: storage: implement bitmap and increasePK
|
| |
|
|
|
|
| |
Update dexon-foundation/decimal for new performance tuning commit.
|
|
|
| |
core: vm: sqlvm: remove underflow error
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Add `opFunc` as built-in funtions entry point.
|
|
|
|
| |
Add `opNeg` supports operand negative.
|
|
|
|
| |
Add `opConcat` supports dynamic bytes (string) concating.
|
|
|
|
|
| |
Add `opRange` which supports row range evaluation, such as `LIMIT` and
`OFFSET`.
|
|
|
|
| |
Add `opCut` which supports slice cutting.
|
|
|
|
|
| |
To reduce redundant information in template source data, we pre-process
source data and generate target information before rendering.
|
|
|
|
|
| |
Names will be mapped to references after parsing. Use references in hash
will have better performance.
|
|
|
|
|
|
|
| |
In the context of vm module, we usually access vm.StateDB interface
object instead of state.StateDB directly. Also, state.StateDB is usually
passed with pointer and used with pointer receiver. Implement the
similar behavior on Storage object.
|
|
|
|
|
| |
Sometimes we need a stream reader writer for the data on storage. For
example, RLP decode the data on storage. Implement a wrapper around it.
|
|
|
|
|
| |
Add methods for ACL control and index meta loading. These methods will
be used outside runtime, so put them on Storage.
|
| |
|
|
|
|
|
| |
The original limit values are so wrong. We fix the values, rename
parameters according to Go's limit values naming rule.
|
|
|
|
|
| |
Because decimalDecode modifies input data, we should make a copy first
to prevent side effect.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
We reduce code of funtion call and nested struct initialization by
generating testcases with go template system.
Run `go run cmd/gen-op-test/main.go` first before testing instructions,
and commit generated code for fully testing on CI.
|
|
|
|
|
| |
For runtime implementation, we define opcodes and basic structs for
runtime usage and concrete implementation.
|
|
|
|
|
|
| |
* Remove STOREPK.
* Split STORE to UPDATE and INSERT.
* Remove the examples.
|
|
|
|
|
| |
To satisfy the latest spec, the data of type of address and fixed bytes will
be stored in bytes instead of decimal value.
|
|
|
|
|
|
| |
Refine behaviors:
1. Check decimal.NewFromString by type instead of string compare.
2. Use Rescale in DecimalEncode.
|
| |
|
|
|
|
| |
It is allowed to declare multiple foreign key constraints on a column.
|
|
|
|
|
| |
It will be used to store the descriptor of the object after the name is
resolved.
|
|
|
|
|
|
| |
We make the zero value invalid by design. Users must be aware of the
difference between SQL boolean and Go boolean and initialize it
explicitly.
|
|
|
|
|
|
|
|
| |
SQL uses three-valued logic which includes an unknown state. To prevent
the reader of the code from confusing the unknown value with the unknown
data type defined here, we rename 'unknown' data type to 'pending'
because it is intended to be used by nodes whose type has not been
determined.
|
|
|
|
|
| |
It is the last test function which doesn't mention what kind of data it
operates on.
|
|
|
|
|
|
| |
It is unsafe to write a map concurrently. Even if it is unlikely for us
to call it from multiple threads, it is better to avoid providing an
thread-unsafe API when it is possible.
|
|
|
|
|
|
|
|
| |
Since we have dropped DataTypeEncode in favor of GetType method of
TypeNode, rename DataTypeDecode to GetNode and make it a method.
Drop unnecessary zero checks because we don't care minor bytes when
there is only one type belong to a category.
|
|
|
|
|
|
| |
Since we have both DataType and Decimal functions in this file, we
should avoid using generic names such as TestEncode and TestDecode
without mentioning what types are going to be tested.
|
|
|
|
|
|
|
|
| |
To allow callers to provide precise error messages, return an error
message in addition to an error code from GetType of TypeNode.
Drop DataTypeEncode because it is never used by any code and it has
become a simple wrapper of GetType.
|
|
|
|
| |
We will add more methods to DataType.
|
|
|
|
| |
It is a special field which should not be accessed by any other files.
|
| |
|
|
|
|
| |
Keep them consisitent with ast/types.go.
|
|
|
|
|
| |
* If first byte is not VM enum, we should reserve it as checking VM type.
* Remove debug print.
|
|
|
|
|
| |
deciaml.IntPart() returns int64, so we have to implement a function to
convert deciaml to uint64 for reading primary id from Raw.
|
| |
|
|
|
|
|
| |
Implement some storage utility functions, including
shift slot, get dynamic byte and get primary key hash.
|
|
|
|
|
| |
Since we have to packing our data in slot, it needs to calculate each
column field's slot and byte offset.
|
|
|
|
| |
Implement load register to input operands, before each op.
|
|
|
|
| |
Move error code to errors.go, and implement Size method for column field.
|
|
|
|
|
| |
It is possible that the number to encode is produced by arithmetic
operations and has negative exponent even when it is an integer.
Properly handle this case and modify test cases to check it.
|
|
|
|
|
| |
These structs will be used in identifier nodes to store references to
objects defined in the schema or the command itself.
|
|
|
|
|
|
|
| |
In order to check foreign keys efficiently during deletion, an index
should be marked when it is referenced by foreign keys. Since we now
have flags which cannot be declared directly from the source code, two
helper functions are added to distinguish between two groups of flags.
|
|
|
|
|
| |
Reorder fields and enums according to the grammar file to make it easier
to check whether all features supported by the grammar are implemented.
|
|
|
|
|
|
|
| |
The number of tables, columns, indices are all limited to 256, so we
don't have to do much memory copying during appending. Drop pointers
from slices to save memory for storing pointers and possibly improve
locality.
|
|
|
|
|
|
| |
ORDER BY and GROUP BY options have to decide whether an expression is a
reference to the column specified in SELECT command by checking whether
it consists of only one integer literal.
|
|
|
|
|
|
|
| |
So Parse now returns a []ast.StmtNode instead of a generic []ast.Node,
which should be clearer on what the return value looks like. This also
adds a field recording the verb use to identify the statement in order
to provide better error messages.
|
|
|
|
|
|
|
|
| |
Now both position and length are both recorded in the error struct,
recording the token in the error struct no longer provides any benefit.
It is easy to find the token when position and length are known, but
requiring all error locations to fill the field is complicated because
they have to access the source code to find the token.
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Provide ESCAPE grammar for specifying escape character in like pattern
matching.
|
|
|
|
|
| |
When an error corresponds to a source code token, it should be able to
report the length of the token in addition to the position.
|
|
|
|
|
| |
Since we traverse an AST by calling functions recursively, we have to
protect the parser by limiting the depth of an AST.
|
|
|
|
|
|
|
|
| |
Code generated by pigeon includes many exported symbols which should not
be used by any other code other than the parser itself. To prevent them
from being misused, we used to hide them by editing the generated code
with sed. This commit removes the unreliable sed trick by putting
generated code to internal package.
|
|
|
|
|
|
|
| |
In addition to changes required to move DataTypeEncode and
DataTypeDecode to use TypeNode interface, this commit also unifies the
meaning of 'Size' field in 'FixedBytesTypeNode'. It always counts the
length in bytes now.
|
| |
|
|
|
|
|
|
| |
These symbols are allowed in Microsoft SQL or PostgreSQL, but the SQL
standard doesn't mention them. It is still possible to use these symbols
as identifiers by putting them in double quotes.
|
|
|
|
|
| |
The size of table in db and column/index/sequence in a table is bounded
by uint8. Define types for better readability.
|
|
|
|
| |
Catch the error reported by fmt.Fprintf and report it to the caller.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Now all AST nodes should have position information recorded during
parsing. These fields are intended to be used to report errors and make
debugging easier. However, precise location of each token is currently
unavailable. It can be done in the future if it becomes necessary.
To make it easier to traverse an AST, GetChildren is modified to skip
nil nodes in the output. This means callers of GetChildren don't have
to check for nil in returned slices.
AST printer is modified to print the position and the corresponding
source code token. A few special handling for interfaces are removed
because reflection works better for structs.
|
|
|
|
|
|
|
| |
Since all nodes must be declared as pointers to satisfy the interface,
it is no longer meaningful to use value receivers. It should make the
code look more consistent and reduce the amount of memory copying
during function calls because these structs takes at least 8 bytes.
|
|
|
|
|
|
| |
Since our 'Node' interface includes methods which must be implemented
with pointer receivers, all AST nodes are now referenced with pointers
and the '*' pointer indicator is no longer useful.
|
|
|
|
|
|
|
|
|
|
|
|
| |
This commit implements isAddress function to allow a number literal to
be considered as an address literal. Since Solidity only allows '0x' to
be written in lower case, we remove the handling of upper case '0X' to
keep the behavior in sync with Solidity.
In addition to isAddress implementation, this commit also removes
'String' methods from AST nodes to prevent them from implementing the
builtin 'Stringer' interface. Therefore, our AST printer is now able to
print struct fields of value nodes instead of only one string.
|
|
|
|
|
|
|
|
|
| |
In order to make our AST easier and safer to use, all declarations with
empty interface type are now removed.
This changes also makes it possible to traverse the AST without using
reflection or understanding what each type means because all AST nodes
have at least one common interface.
|
|
|
|
| |
Return error.Error to reveal more information about returned error.
|
|
|
|
|
|
| |
* dex: remove file that should not be committed
* add file to .gitignore
|
| |
|
|
|
|
|
| |
To cover the pitfall of decimal.fromString, we need to add leading 0 at
'^\.[0-9]+' case.
|
| |
|
|
|
|
|
| |
The data range is deterministic for specific type, `GetMinMax` is
helper function to generate min, max value for clients.
|
| |
|
| |
|
|
|
|
|
| |
Modify Tuple.Data.Value type from *big.Int to interface{}
and remove Max, Min.
|
|
|
|
|
|
|
| |
After reconstructing commits, we move shared interfaces and params as
first runtime implementation. In this commit we define OP codes, runtime
flow and entrypoint, and basic operand structs and minor helper
components.
|
|
|
|
| |
Implement schema struct and handle its rlp serialization.
|
|
|
|
|
|
|
|
| |
Add encoder/decoder to convert between decimal and bytes. Also handle
issues below.
* Signed & Unsigned
* Padding
* Floating point of fixed
|
|
|
|
|
| |
Implement encode & decode function to convert between type node and
2-bytes type described on spec.
|
|
|
|
|
| |
It is now possible to write AST dump to a writer other than stdout and
use indent string other than 2 spaces.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Our parser is able to process queries with invalid UTF-8, provided that
it is compatible with ASCII. Since doing so requires encoding the input
before passing to pigeon, Parse* functions generated by pigeon are
unexported because they should not be used directly.
Escape sequences in string literals and identifiers are now recognized.
In addition to escape sequences supported by solidity, we support \U
similar to the one supported by Go to allow users to specify non-BMP
Unicode code point without using multiple \x escapes.
AST printer is modified to quote non-printable characters in strings to
prevent control characters from messing up the terminal.
|
|
|
|
|
|
| |
Instead of ignoring errors, errors returned from external functions are
normalized and reported to users. Errors which should be impossible to
occur are converted to panic calls.
|
|
|
|
|
|
|
| |
There are some changes in print ast utility.
1. instead of using optional interface to get detail, use reflect
2. implement a `print` field tag for printer switching detail mode or
not
|
|
|
|
|
|
|
|
| |
In order to avoid putting too many different things in single package
and allow other projects to reuse the syntax tree and the parser, these
two components are moved to different packages and all nodes used in AST
are now exported. A lot of comments are added in this commit to pass
golint checks.
|
|
|
|
|
|
| |
This tool is good enough to format our sqlvm grammar file. It is not
guaranteed to work for all valid pigeon files, and it only process
multi-line Go code blocks.
|
|
|
|
|
|
|
|
|
| |
Add sql language parser prototyping along with
1. grammar file implemented with github.com/mna/pigeon
2. ast node struct definition
3. simple parser test which only test if error existed
4. ast printer utility for visualizing parsing result
|
| |
|
|
|
|
|
| |
Extract stateDB and contract out from core/vm/evm to core/vm,
such that other vm type can use the common modules.
|
|
|
|
|
| |
For support other vm types, this pr modified the core/vm file
structures.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
* core, rawdb, dex: improve gov state for syncing
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
* test: run smoke test on ganache
* Update build/setup_recovery_env.sh
Co-Authored-By: Jsying <sonic@dexon.org>
* Update build/setup_recovery_env.sh
Co-Authored-By: Jsying <sonic@dexon.org>
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Move panic call to immediate location of the error to prevent
accidententaly panic on other conditions.
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
| |
* core: vm: prevent setting owner to blackhole
* core: vm: same for transferNodeOwner
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
* vendor: sync to latest core
* core: implmenet dkg success
* cmd: govtool: add DKGSuccess
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
* vendor: sync to latest core
* core: dkg private key db
|
| |
|
| |
|
|
|
|
|
| |
By storing array offset in the original DKGMasterPublicKeyProposed map,
we can locate MPK by proposer ID easily.
|
| |
|
| |
|
|
|
|
|
|
| |
* vendor: sync to latest core
* dex: remove time alignment when force sync
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Include serveral DEXON specific fixes.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Cache GPK so one can not slow the chain down with the ProposeCRS method
call.
|
|
|
|
|
| |
Since deserializing DKG related items are extremely slow (takes about 3
seconds for 100 items), we cache it in the governance interface.
|
| |
|
|
|
|
|
|
| |
* dex: remove node table
Node table is not so useful, go back to rely on kademlia
* p2p: fix direct dial still have resolve delay
|
|
|
|
|
| |
* core: vm: fineFailStopDKG if MPK not registered
* prevent on-chain randomness
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Send non-finalized blocks to notary set only
* Update randomness field for blocks in cache upon receiving agreement
result
* Filter AgreementResult by its position
* Avoid overwriting finalized blocks with non-finalized ones
* Add blocks to finalized cache when pulling
* Update to finalized cache when we have corresponding element in
non-finalized one.
|
| |
|
| |
|
|
|
|
|
| |
* p2p/discover: bump failure counter only if no nodes were provided
* p2p: more aggressive dial strategy for direct dial
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
* vendor: sync to latest core
* dex, core: fix conflict
x
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
A node is now quailified only if it has no pending fine and staked >=
minstake.
|
| |
|
| |
|
|
|
|
|
| |
* dex: rebuild connection if dkg reset
* core: vm: fix governance contract
|
|
|
|
|
|
| |
* core: vm: update set size on node info change
* fix typo
|
|
|
|
|
|
|
|
| |
* vendor: sync to latest core
* core: merge notarySet and dkgSet
* dex: optimize network traffic for finalized block
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* dex: backport f6193ad
* dex/downloader: backport accc0fa accc0fab 174083c3
* dex: backport 434dd5b
* dex: backport 42a914a 0983d02
* dex: backport 48b70ec 31b3334 and some modification
* dex/downloader: backport 5f251a6
* dex/downloader: backport 81c3dc7
* dex, dex/downloader: fix typos
|
| |
|
|
|
|
|
|
| |
* dex: don't panic when we don't have gov state peer requested
* dex: use correct head block
Since we are fast syncing, we probably don't have body, receipt, state
|
| |
|
|
|
|
|
| |
To discourage DKG set from prolonging the round indefinitely, we set the
block reward of the extended round to 0. The gas fee is send to the
DEXON governance owner for safe keeping and later used by the foundation.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
This reverts commit 3ca44e556bd9561b0c6c64c7d3a4f95726c78be8.
|
| |
|
|
|
|
| |
Start blockproposer only after fast sync is completed (received
ChainHead event), so watchcat is not falsely triggered.
|
|
|
|
|
|
|
|
|
|
| |
Our network topology is different from ethereum, the nodes in notary set will
connect each other directly. So there is a waste for flooding tx msgs
in notary set. And nodes in notary set are more likely to propose block
successfully, it is not useful to broadcast tx msgs to non notary set
nodes.
This PR will increase some tx confirm latency, but can reduce waste tx
msgs a lot.
|
|
|
|
|
|
|
|
| |
* vendor: sync to latest core
* core/vm: remove addDKG functions
* core: fix conflict
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
| |
Since a qualified node might fail stopped, we need to remove them from
qualified nodes to maintain network integrity. We do this by inspect the
previous round to see if there are dead nodes. A dead node is a notary
set node that does not propose any block in the previous round. We
disqualify them by fining them so their staked value is 1 wei below
minStake. This make them unqualified for being notary set in the follow
on rounds.
|
| |
|
|
|
| |
also modify some debug log
|
| |
|