| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
| |
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.
|
| |
|
|
|
| |
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.
|
| |
|
|
|
| |
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.
|
| | |
|
| |
|
|
|
|
|
|
| |
* 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.
|
| | |
|
| | |
|
| |
|
|
| |
Coinbase address is the owner address of the node.
|
| | |
|
| |
|
|
| |
Add two maps to check the uniqueness of DKGMasterPublicKey and DKGComplaints to
prevent malicious actors from spamming it.
|
| | |
|
| |
|
|
|
|
| |
* vendor: sync to latest core
* core: check dkg reset
|
| | |
|
| |
|
|
|
| |
Fill in dmoment as genesis block timestamp. This allow us to remove
dMoment check from protocol handshake since genesis block hash itself
will protect us against different dMoment.
|
| |
|
|
|
|
|
|
|
| |
* dex: implement recovery mechanism
The DEXON recovery protocol allows us to use the Ethereum blockchain as a
fallback consensus chain to coordinate recovery.
* fix
|
| | |
|
| | |
|
| |
|
|
|
| |
Since the VM might be called from different source (downloader, RPC,
etc.). We need to make the call state separate. Modify the calling
sequence so a new oracle contract instance is used on each run.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
The current delegation mechanism are prone to unstaking attack. i.e. a
malicious attacker could unstake a small amount from a lot of node it
staked before and make them unqualified, which leads to potential
failure of the network.
Since DEXON does not use consensus like DPoS, node is required to have
at least MinStake in order to become a node. Voting mechanism is not
required in our system since qualified node does not depends on the
number of votes. Instead of managing the delegation mechanism in
governance contract, we should let the owner manage the delegation and
reward distribution mechanism on their own.
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
| |
Also remove app_test.go because of the refactor bojie@ is working on.
|
| |
|
|
|
|
| |
* params: Update config
* Update taipei to 30 nodes setup
|
| |
|
|
|
|
| |
There are two keys in the system: one is the owner's key which is used
for stake / unstake. The other is the node key which is used for DKG
related operations. We need to allow them to be different so fund
renmains safe even if the the node key is lost.
|
| | |
|
| |
|
|
|
| |
* vendor: sync to latest core
* fix for single chain
|
| |
|
|
|
|
| |
* Add Yilan network
* Fixup: remove dummy log
|
| |
|
|
|
|
|
|
|
|
| |
* core/vm: update abi
* core/vm: add MinGasPrice to gov
* params: Add MinGasPrice to Config
* dex: SuggestPrice from Governance
* test: add minGasPrice to genesis.json
* core: check underpriced tx
* dex: verify with gas price
|
| |
|
| |
So that other contract can call oracle contract.
|
| | |
|
| |
|
|
|
|
| |
* change default sync_core.sh
* vendor: sync to latest core
* core: Remove K, Phi and NumChain
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* vm: Update gov abi
* vm: Add DKGResetCount to state helper
* vm: add getter
* vm: Add DKGReset event
* vm: Add resetDKG method
* vm: check resetDKG criteria
* vm: Add new CRS
* vm: add helper pop2DByteArray
* vm: emit event
* vm: Add CoreMock to GovernanceContract
* vm: bug fix
* add test for resetDKG
* vm: Add test
* fix test
* Modify mock interface
|
| |
|
| |
The ci test in /tests will use origin evm logic.
|
| |
|
|
|
|
| |
* core/vm: add delegatorAddr to withdrawn event
* core/vm: update gov abi
* core/vm: add NodeRemoved event
|
| | |
|
| | |
|
| |
|
|
| |
To prevent attacker from sending TX through a intermediate contract.
Always use the original tx sender's adddress and nonce.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
The original algorithm used for calculating algorithm is vulnerable to
cross context re-entry attack. Example as follows:
contract B {
event Value(uint256 value);
uint256 public value;
function call() public {
value = rand;
emit Value(value);
}
}
contract A {
function randTwice(address bAddr) public {
B b = B(bAddr);
b.call.gas(100000)();
b.call.gas(100000)();
}
}
The two `b.call` will result in the same randomness value. This commit
fix the issue by recording a called index used to store how many times
opRand is called, and use it as argument to the Keccak call.
|
| |
|
|
| |
Instead of having BP to send a tx to register the round height, just
modify the state when finalizing block.
|
| |
|
|
|
|
|
|
| |
(#168)
Refactor GenerateDexonChain function, move governance tx logic to
the user of GenerateDexonChain (testchain_test.go) and move fake node set
code to FakeDexcon.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
| |
Using only state root and receipt root as witness data can not protect
other fields in block header, ex: bloom, difficulty, gas limit, gas
used...
So that everyone can manipulate these fields to create as many valid blocks
at the same height as he want. Although this will not effect the state,
one can spam us when syncing.
Using block hash as witness data can solve this.
|
| | |
|
| |
|
|
|
|
| |
* vendor: sync to latest core
* param: Update config
* core: update genesis alloc
|
| |
|
|
|
|
|
|
| |
* app: fix reward bug with empty block
* make block generation consistent
* revert change to dmoment in genesis.json
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
| |
Add totalSupply and totalStaked in the governance contract for the
preperation of DEXON cryptoeconomics 4.0.
Also removed the unstaked variable in node info and improve tests for
delegate/undeleate.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
(#118)
|
| | |
|
| | |
|
| |
|
|
|
|
|
| |
When starts a bp node to sync with the network, bc.chainLastHeight map
may not be initialized yet.
Just return error if we can not get chain last height when preparing
payload and verify block.
|
| |
|
|
| |
Let roundHeightMap be corret whenever we starting a bp node.
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
| |
* core/vm: Add Fined field to nodeInfo.
* core/vm: Add PayFine to Governance
* Not qualify if staked-fine < minStake()
* Add test for fine
* Update genesis hash
|
| |
|
|
|
|
|
|
|
| |
* core: types: add database/sql support for BlockNonce
* common: add database/sql support with Big
New Big type is declared to let big.Int support database/sql by
implementing Scan() and Value() on new type.
|
| |
|
|
|
|
|
| |
Merging these commits in DEXON consensus core:
- https://github.com/dexon-foundation/dexon-consensus/commit/dce509a13ef5873b9cae3c1cabdb97e219b6fb7d
- https://github.com/dexon-foundation/dexon-consensus/commit/6d1c1aeea0d3e75d10cbb2712c68b4c422ba8ba6
- https://github.com/dexon-foundation/dexon-consensus/commit/c1ed57c4abaf1f4758e52f082bb7114ad00c8b39
|
| |
|
|
|
|
| |
* core/types: SigCache with a limited size
* minor tweaks
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* dex, internal: block proposer syncing (first iteration)
* core: find block from db if not in memory
This fix handles stopping proposing and then restarting
* core: no need to reorg when reset
Dexon will not fork. This commit also fix when a block confirm but
its parent is not in db yet, during restarting proposing.
* dex: always accept NewBlockMsg, NewBlockHashesMsg
We need to accept NewBlockMsg, NewBlockHashesMsg to sync current block with
other peers in block proposer mode when syncing lattice data. It's a waste
when the node is synced and start proposing.
Todo: control msg processing on/off more granular, accept NewBlockMsg,
NewBlockHashesMsg when syncing, but stop when synced.
|
| |
|
|
|
|
| |
* core/vm: Add DKGMPKReady
* param: update GenesisHash
* vendor: sync to latest core
|
| | |
|
| |
|
|
| |
Remove duplicate declaration of WitnessData and remove the TxHash field
in witness data since it does not need to be witnessed.
|
| |
|
|
|
| |
Only allow a user to withdraw funds after a certain lockup
period. This way, the fund of a bad actor could be confiscated before he
could escape.
|
| | |
|
| |
|
|
|
|
| |
- Implement new methods in db to cache DKG
private key.
- Implement new methods in db to cache compaction
chain tip.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
- Broadcasting blocks at chain head event is not correct when the full
node is not running in block proposer mode. Introduce NewFinalizedBlockEvent,
this event is post by the full node which runs in block proposer mode when a
block is witnessed and resulting in some blocks are considered finalized.
- Non block proposer node will still broadcast blocks
at the following moment (same as ethereum):
1. a sync with a peer is terminated successfully
2. a block passes the fetcher's header check during inserting blocks
3. a block is successfully inserted by fetcher
- Don't trigger a sync when we are not behind other peers more than
acceptable distance. Fetcher is able to cover this.
|
| |
|
|
|
|
| |
* Timeout on prepare payload
* Leave 2 CPU for others
* Add hardLimit and softLimit to PreparePayload
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Add a new testnet named Taipei.
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
| |
Also rename InsertChain2, insertChain2, InsertHeaderChain2,
ValidateHeaderChain2
|
| |
|
|
|
|
|
|
|
|
|
| |
We need governance state to verify block's signature (randomness),
but in ethereum fast sync mode, eth downloader only downloads the whole
state of pivot block, so we don't have governance state to verify the
downloaded block that is before pivot block if we don't processing
transaction.
To avoid running transactions, dex downloader also downloads the
governance state (merkle proof and storage) at snapshot height of each round,
so that we can verify blocks in fast sync mode.
|
| | |
|
| | |
|
| |
|
|
|
| |
From the go trace result, the bottleneck hides in the lock of
StoreTxCache. To improve this, we update the cache in a batched fassion.
|
| |
|
|
|
|
|
| |
* dex: Add a tx queue in broadcast
* Modify queue parameter
* Priority select all messages except tx
* Batch process TouchSenders
|
| | |
|
| |
|
|
|
| |
Since we use -1 to represent the offset of empty value, we should make
the return type int256 instead of uint256.
|
| |
|
|
|
| |
Implement delegate/undelegate function to allow others to delegate it's
fund to stake on a node. Also added governance contract tests.
|
| | |
|
| |
|
|
|
|
| |
Fix gas calculation in governance contract.
Correctly register round height when processing pending blocks. We
should register the mapping when we get the pending block instead of
waiting for block confirmation.
|
| | |
|
| |
|
|
|
| |
InsertChain() need to record the correct roundHeight mapping in order to
process snapshotRoundHeight() governance method correctly.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
| |
Remove custom Dexon validator by adding a new `ValidateWitnessData`
method into the validator interface. This allow us to properly detect
know blocks. This also allow other gdex "light" client to sync
compaction chain. Also, setup a standalone RPC node for handling RPC
reqeusts.
|
| |
|
| |
No need to store round 0, it's already pushed in genesis block
|
| | |
|
| |
|
|
|
|
| |
* Add Transactions.TouchSenders that calculates sender and update cache
* Use TouchSenders to fill the caches
|
| |
|
|
|
| |
* vendor: sync consensus core
* core: validate DKG set with correct nodeset in round-2
|
| |
|
|
|
|
|
| |
* core: vm: add an EVM benchmark
* core: vm: optimize stack allocation and instruction for calculating 2^n
* Add DEXONBet bench
|
| |
|
|
|
|
|
| |
* core: push height of round 0 in genesis block
* vm: fix governance dispatch method name mismatch with abi
also rename RoundHeightLoc to roundHeightLoc
|
| |
|
|
| |
We need to return the correct pending nonce (include those in the tx
pool). Also, StateAndHeaderByNumber is also fixed to use pending block.
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Make ToBlock() compatible with legacy ethereum code so we can run tests
normally.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
round change
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
We do not need ethereum Rinkeby network in our system, remove it.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
| |
DEXON has a built-in on chain random oracle that allow one to retrieve a
random variable. Add a new opcode `RAND` to load the random variable
onto the stack.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
