mirror of
				https://github.com/ton-blockchain/ton
				synced 2025-03-09 15:40:10 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			74 lines
		
	
	
	
		
			2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			74 lines
		
	
	
	
		
			2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|     This file is part of TON Blockchain Library.
 | |
| 
 | |
|     TON Blockchain Library is free software: you can redistribute it and/or modify
 | |
|     it under the terms of the GNU Lesser General Public License as published by
 | |
|     the Free Software Foundation, either version 2 of the License, or
 | |
|     (at your option) any later version.
 | |
| 
 | |
|     TON Blockchain Library is distributed in the hope that it will be useful,
 | |
|     but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
|     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
|     GNU Lesser General Public License for more details.
 | |
| 
 | |
|     You should have received a copy of the GNU Lesser General Public License
 | |
|     along with TON Blockchain Library.  If not, see <http://www.gnu.org/licenses/>.
 | |
| 
 | |
|     Copyright 2017-2020 Telegram Systems LLP
 | |
| */
 | |
| 
 | |
| #pragma once
 | |
| #include "td/utils/buffer.h"
 | |
| #include "td/utils/common.h"
 | |
| #include "td/utils/optional.h"
 | |
| 
 | |
| #include "td/actor/actor.h"
 | |
| 
 | |
| #include <map>
 | |
| 
 | |
| #include "LoadSpeed.h"
 | |
| 
 | |
| namespace ton {
 | |
| using PeerId = td::uint64;
 | |
| using PartId = td::uint32;
 | |
| 
 | |
| struct PeerState {
 | |
|   struct State {
 | |
|     bool will_upload{false};
 | |
|     bool want_download{false};
 | |
|     auto key() const {
 | |
|       return std::tie(will_upload, want_download);
 | |
|     }
 | |
|     bool operator==(const State &other) const {
 | |
|       return key() == other.key();
 | |
|     }
 | |
|   };
 | |
|   State node_state_;
 | |
|   td::optional<State> peer_state_;
 | |
|   bool peer_online_{false};
 | |
| 
 | |
|   struct Part {
 | |
|     td::BufferSlice proof;
 | |
|     td::BufferSlice data;
 | |
|   };
 | |
|   std::map<PartId, td::optional<td::Result<Part>>> node_queries_;
 | |
|   std::map<PartId, td::optional<td::Result<Part>>> peer_queries_;
 | |
| 
 | |
|   // Peer -> Node
 | |
|   // update are added to this vector, so reader will be able to process all changes
 | |
|   std::vector<PartId> peer_ready_parts_;
 | |
| 
 | |
|   // Node -> Peer
 | |
|   // writer writes all new parts to this vector. This state will be eventually synchornized with a peer
 | |
|   std::vector<PartId> node_ready_parts_;
 | |
| 
 | |
|   td::actor::ActorId<> node;
 | |
|   td::actor::ActorId<> peer;
 | |
| 
 | |
|   LoadSpeed upload;
 | |
|   LoadSpeed download;
 | |
| 
 | |
|   void notify_node();
 | |
|   void notify_peer();
 | |
| };
 | |
| }  // namespace ton
 |