Home
last modified time | relevance | path

Searched refs:lru_ (Results 1 – 5 of 5) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/
Dtask_manager.cc46 lru_.Append(*task); in CreateAsyncTask()
69 for (Task &tk : lru_) { in join_all()
100 …auto tk = std::find_if(tm.lru_.begin(), tm.lru_.end(), [id](const Task &tk) { return tk.id_ == id;… in FindMe()
101 if (tk != tm.lru_.end()) { in FindMe()
116 lru_(&Task::node), in TaskManager()
174 lru_.Remove(watchdog_); in DoServiceStart()
239 auto it = std::find(lru_.begin(), lru_.end(), *p); in ReturnFreeTask()
240 if (it != lru_.end()) { in ReturnFreeTask()
241 lru_.Remove(p); in ReturnFreeTask()
Dtask_manager.h115 List<Task> lru_; variable
Dbtree_impl.tpp417 : leaf_nodes_(&LeafNode::link_), all_(&BaseNode::lru_), root_(nullptr), acquire_lock_(true) {
423 …: alloc_(alloc), leaf_nodes_(&LeafNode::link_), all_(&BaseNode::lru_), root_(nullptr), acquire_loc…
433 t = n->lru_.next;
Dbtree.h176 Node<BaseNode> lru_;
DREADME.md196 List<Task> lru_;
201 …up. At the TaskManager level, all Task objects from all the TaskGroups are linked in the lru_ list.
378 List<Task> lru_;