HomeSort by relevance Sort by last modified time
    Searched refs:work_list (Results 1 - 7 of 7) sorted by null

  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/
cfa.h 50 /// Returns true if a block with @p id is found in the @p work_list vector
52 /// @param[in] work_list Set of blocks visited in the the depth first traversal
56 /// @return true if the edge work_list.back().block->id() => id is a back-edge
58 const std::vector<block_info>& work_list, uint32_t id);
129 template<class BB> bool CFA<BB>::FindInWorkList(const vector<block_info>& work_list,
131 for (const auto b : work_list) {
144 /// NOTE: work_list is the sequence of nodes from the root node to the node
146 vector<block_info> work_list; local
147 work_list.reserve(10);
149 work_list.push_back({ entry, begin(*successor_func(entry)) })
    [all...]
  /frameworks/compile/mclinker/lib/LD/
GarbageCollection.cpp 290 WorkListTy work_list; local
295 work_list.push(*entry_it);
297 // add section from the work_list to the referencedSections until every
299 while (!work_list.empty()) {
300 const LDSection* sect = work_list.front();
301 work_list.pop();
319 work_list.push(*it);
  /external/fio/
workqueue.c 109 flist_add_tail(&work->list, &sw->work_list);
164 if (flist_empty(&sw->work_list)) {
180 if (!flist_empty(&sw->work_list))
198 flist_splice_init(&sw->work_list, &local_list);
276 INIT_FLIST_HEAD(&sw->work_list);
workqueue.h 14 struct flist_head work_list; member in struct:submit_worker
  /art/tools/veridex/
flow_analysis.cc 183 std::vector<uint32_t> work_list; local
184 work_list.push_back(0);
189 while (!work_list.empty()) {
190 uint32_t dex_pc = work_list.back();
191 work_list.pop_back();
206 work_list.push_back(branch_dex_pc);
  /art/runtime/verifier/
reg_type_test.cc     [all...]
  /external/v8/src/regexp/
jsregexp.cc     [all...]

Completed in 4107 milliseconds