mirror of
				https://github.com/ton-blockchain/ton
				synced 2025-03-09 15:40:10 +00:00 
			
		
		
		
	* Rename chunk to piece in MerkleTree for consistency * Refactor PeerManager * Make PeerState thread-safe * Download torrent by hash * First version of storage daemon * Download torrents partially * Improve storing and loading torrent state in DB * Rewrite MerkleTree * "Remove torrent" in storage daemon * Process errors, fix bugs in storage * Move TonlibClientWrapper from rldp-http-proxy to tonlib * Initial version of storage provider * Move interaction with contracts to smc-util * Improve TonlibClientWrapper interface * Various improvements in storage provider * Fix TorrentCreator.cpp * Improve interface for partial download * Client mode in storage-daemon * Improve interface of storage-daemon-cli * Fix calculating speed, show peers in storage-daemon * Use permanent adnl id in storage daemon * Fix sending large "storage.addUpdate" messages * Improve printing torrents in cli * Update tlo * Fix RldpSender::on_ack * Update storage provider * Add "address" parameter to get-provider-params * Allow client to close storage contract * Limit torrent description * Add more logs to storage provider * smc.forget tonlib method * Use smc.forget in storage daemon * Optimize sending messages in smc-util.cpp * Fix verbosity, remove excessive logs * Json output in storage-daemon-cli * Update storage provider contracts * Fix rldp2 acks * Change verbosity of logs in rldp2 * Update help and output of commands and in storage-daemon-cli Co-authored-by: SpyCheese <mikle98@yandex.ru>
		
			
				
	
	
		
			103 lines
		
	
	
	
		
			2.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			103 lines
		
	
	
	
		
			2.4 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/Slice.h"
 | |
| #include "td/utils/logging.h"
 | |
| 
 | |
| namespace td {
 | |
| struct Bitset {
 | |
|  public:
 | |
|   td::Slice as_slice() const {
 | |
|     return td::Slice(bits_).substr(0, (bits_size_ + 7) / 8);
 | |
|   }
 | |
|   bool get(size_t offset) const {
 | |
|     auto i = offset / 8;
 | |
|     if (i >= bits_.size()) {
 | |
|       return false;
 | |
|     }
 | |
|     auto bit_i = offset % 8;
 | |
|     return (bits_[i] & (1 << bit_i)) != 0;
 | |
|   }
 | |
| 
 | |
|   void reserve(size_t offset) {
 | |
|     auto i = offset / 8;
 | |
|     if (i >= bits_.size()) {
 | |
|       bits_.resize(i + 1);
 | |
|     }
 | |
|   }
 | |
| 
 | |
|   bool set_one(size_t offset) {
 | |
|     auto i = offset / 8;
 | |
|     auto bit_i = offset % 8;
 | |
|     bits_size_ = std::max(bits_size_, offset + 1);
 | |
|     if (i >= bits_.size()) {
 | |
|       bits_.resize(std::max(i + 1, bits_.size() * 2));
 | |
|     }
 | |
|     auto mask = 1 << bit_i;
 | |
|     if ((bits_[i] & mask) == 0) {
 | |
|       bits_[i] |= (char)mask;
 | |
|       count_++;
 | |
|       return true;
 | |
|     }
 | |
|     return false;
 | |
|   }
 | |
| 
 | |
|   bool set_zero(size_t offset) {
 | |
|     auto i = offset / 8;
 | |
|     if (i >= bits_.size()) {
 | |
|       return false;
 | |
|     }
 | |
|     auto bit_i = offset % 8;
 | |
|     auto mask = 1 << bit_i;
 | |
|     if (bits_[i] & mask) {
 | |
|       bits_[i] &= (char)~mask;
 | |
|       count_--;
 | |
|       return true;
 | |
|     }
 | |
|     return false;
 | |
|   }
 | |
| 
 | |
|   size_t ones_count() const {
 | |
|     return count_;
 | |
|   }
 | |
| 
 | |
|   void set_raw(std::string bits) {
 | |
|     bits_ = std::move(bits);
 | |
|     bits_size_ = 0;
 | |
|     count_ = 0;
 | |
|     for (size_t n = size(), i = 0; i < n; i++) {
 | |
|       if (get(i)) {
 | |
|         count_++;
 | |
|         bits_size_ = i + 1;
 | |
|       }
 | |
|     }
 | |
|   }
 | |
| 
 | |
|   size_t size() const {
 | |
|     return bits_.size() * 8;
 | |
|   }
 | |
| 
 | |
|  private:
 | |
|   std::string bits_;
 | |
|   size_t bits_size_{0};
 | |
|   size_t count_{0};
 | |
| };
 | |
| }  // namespace td
 |