good morning!!!!

Skip to content
Snippets Groups Projects
  1. Sep 14, 2020
    • Zsolt Felföldi's avatar
      les, les/lespay/server: refactor client pool (#21236) · 4996fce2
      Zsolt Felföldi authored
      
      * les, les/lespay/server: refactor client pool
      
      * les: use ns.Operation and sub calls where needed
      
      * les: fixed tests
      
      * les: removed active/inactive logic from peerSet
      
      * les: removed active/inactive peer logic
      
      * les: fixed linter warnings
      
      * les: fixed more linter errors and added missing metrics
      
      * les: addressed comments
      
      * cmd/geth: fixed TestPriorityClient
      
      * les: simplified clientPool state machine
      
      * les/lespay/server: do not use goroutine for balance callbacks
      
      * internal/web3ext: fix addBalance required parameters
      
      * les: removed freeCapacity, always connect at minCapacity initially
      
      * les: only allow capacity change with priority status
      
      Co-authored-by: default avatarrjl493456442 <garyrong0905@gmail.com>
      4996fce2
    • Felix Lange's avatar
      rlp: add SplitUint64 (#21563) · f7112cc1
      Felix Lange authored
      This can be useful when working with raw RLP data.
      f7112cc1
    • Julian Koh's avatar
    • Zsolt Felföldi's avatar
      p2p/nodestate: ensure correct callback order (#21436) · 4eb92969
      Zsolt Felföldi authored
      This PR adds an extra guarantee to NodeStateMachine: it ensures that all
      immediate effects of a certain change are processed before any subsequent
      effects of any of the immediate effects on the same node. In the original
      version, if a cascaded change caused a subscription callback to be called
      multiple times for the same node then these calls might have happened in a
      wrong chronological order.
      
      For example:
      
      - a subscription to flag0 changes flag1 and flag2
      - a subscription to flag1 changes flag3
      - a subscription to flag1, flag2 and flag3 was called in the following order:
      
         [flag1] -> [flag1, flag3]
         [] -> [flag1]
         [flag1, flag3] -> [flag1, flag2, flag3]
      
      This happened because the tree of changes was traversed in a "depth-first
      order". Now it is traversed in a "breadth-first order"; each node has a
      FIFO queue for pending callbacks and each triggered subscription callback
      is added to the end of the list. The already existing guarantees are
      retained; no SetState or SetField returns until the callback queue of the
      node is empty again. Just like before, it is the responsibility of the
      state machine design to ensure that infinite state loops are not possible.
      Multiple changes affecting the same node can still happen simultaneously;
      in this case the changes can be interleaved in the FIFO of the node but the
      correct order is still guaranteed.
      
      A new unit test is also added to verify callback order in the above scenario.
      4eb92969
  2. Sep 13, 2020
  3. Sep 11, 2020
  4. Sep 10, 2020
  5. Sep 09, 2020
  6. Sep 08, 2020
  7. Sep 07, 2020
  8. Sep 02, 2020
  9. Sep 01, 2020
  10. Aug 28, 2020
  11. Aug 27, 2020
  12. Aug 26, 2020
Loading