e17aef9467
Modify the implementation of MemTracker: 1. Simplify a lot of useless logic; 2. Added MemTrackerTaskPool, as the ancestor of all query and import trackers, This is used to track the local memory usage of all tasks executing; 3. Add cosume/release cache, trigger a cosume/release when the memory accumulation exceeds the parameter mem_tracker_consume_min_size_bytes; 4. Add a new memory leak detection mode (Experimental feature), throw an exception when the remaining statistical value is greater than the specified range when the MemTracker is destructed, and print the accurate statistical value in HTTP, the parameter memory_leak_detection 5. Added Virtual MemTracker, cosume/release will not sync to parent. It will be used when introducing TCMalloc Hook to record memory later, to record the specified memory independently; 6. Modify the GC logic, register the buffer cached in DiskIoMgr as a GC function, and add other GC functions later; 7. Change the global root node from Root MemTracker to Process MemTracker, and remove Process MemTracker in exec_env; 8. Modify the macro that detects whether the memory has reached the upper limit, modify the parameters and default behavior of creating MemTracker, modify the error message format in mem_limit_exceeded, extend and apply transfer_to, remove Metric in MemTracker, etc.; Modify where MemTracker is used: 1. MemPool adds a constructor to create a temporary tracker to avoid a lot of redundant code; 2. Added trackers for global objects such as ChunkAllocator and StorageEngine; 3. Added more fine-grained trackers such as ExprContext; 4. RuntimeState removes FragmentMemTracker, that is, PlanFragmentExecutor mem_tracker, which was previously used for independent statistical scan process memory, and replaces it with _scanner_mem_tracker in OlapScanNode; 5. MemTracker is no longer recorded in ReservationTracker, and ReservationTracker will be removed later;
121 lines
3.8 KiB
C++
121 lines
3.8 KiB
C++
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
#ifndef DORIS_BE_SRC_RUNTIME_RESULT_CACHE_H
|
|
#define DORIS_BE_SRC_RUNTIME_RESULT_CACHE_H
|
|
|
|
#include <cassert>
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <exception>
|
|
#include <iostream>
|
|
#include <list>
|
|
#include <map>
|
|
#include <mutex>
|
|
#include <shared_mutex>
|
|
#include <thread>
|
|
|
|
#include "common/config.h"
|
|
#include "runtime/cache/cache_utils.h"
|
|
#include "runtime/cache/result_node.h"
|
|
#include "runtime/mem_pool.h"
|
|
#include "runtime/row_batch.h"
|
|
#include "runtime/tuple_row.h"
|
|
|
|
namespace doris {
|
|
|
|
typedef std::unordered_map<UniqueId, ResultNode*> ResultNodeMap;
|
|
|
|
// a doubly linked list class, point to result node
|
|
class ResultNodeList {
|
|
public:
|
|
ResultNodeList() : _head(nullptr), _tail(nullptr), _node_count(0) {}
|
|
virtual ~ResultNodeList() {}
|
|
|
|
ResultNode* new_node(const UniqueId& sql_key) { return new ResultNode(sql_key); }
|
|
|
|
void delete_node(ResultNode** node);
|
|
|
|
ResultNode* pop();
|
|
void move_tail(ResultNode* node);
|
|
//Just remove node from link, do not delete node
|
|
void remove(ResultNode* node);
|
|
void push_back(ResultNode* node);
|
|
void clear();
|
|
|
|
ResultNode* get_head() const { return _head; }
|
|
|
|
ResultNode* get_tail() const { return _tail; }
|
|
|
|
size_t get_node_count() const { return _node_count; }
|
|
|
|
private:
|
|
ResultNode* _head;
|
|
ResultNode* _tail;
|
|
size_t _node_count;
|
|
};
|
|
|
|
/**
|
|
* Cache results of query, including the entire result set or the result set of divided partitions.
|
|
* Two data structures, one is unordered_map and the other is a doubly linked list, corresponding to a result node.
|
|
* If the cache is hit, the node will be moved to the end of the linked list.
|
|
* If the cache is cleared, nodes that are expired or have not been accessed for a long time will be cleared.
|
|
*/
|
|
class ResultCache {
|
|
public:
|
|
ResultCache(int32 max_size, int32 elasticity_size) {
|
|
_max_size = max_size * 1024 * 1024;
|
|
_elasticity_size = elasticity_size * 1024 * 1024;
|
|
_cache_size = 0;
|
|
_node_count = 0;
|
|
_partition_count = 0;
|
|
}
|
|
|
|
virtual ~ResultCache() {}
|
|
void update(const PUpdateCacheRequest* request, PCacheResponse* response);
|
|
void fetch(const PFetchCacheRequest* request, PFetchCacheResult* result);
|
|
bool contains(const UniqueId& sql_key);
|
|
void clear(const PClearCacheRequest* request, PCacheResponse* response);
|
|
|
|
size_t get_cache_size() { return _cache_size; }
|
|
|
|
private:
|
|
void prune();
|
|
void remove(ResultNode* result_node);
|
|
void update_monitor();
|
|
|
|
//At the same time, multithreaded reading
|
|
//Single thread updating and cleaning(only single be, Fe is not affected)
|
|
mutable std::shared_mutex _cache_mtx;
|
|
ResultNodeMap _node_map;
|
|
//List of result nodes corresponding to SqlKey,last recently used at the tail
|
|
ResultNodeList _node_list;
|
|
size_t _cache_size;
|
|
size_t _max_size;
|
|
double _elasticity_size;
|
|
size_t _node_count;
|
|
size_t _partition_count;
|
|
|
|
private:
|
|
ResultCache();
|
|
ResultCache(const ResultCache&);
|
|
const ResultCache& operator=(const ResultCache&);
|
|
};
|
|
|
|
} // namespace doris
|
|
#endif
|