| /third_party/node/deps/v8/src/objects/ |
| H A D | source-text-module.h | 176 UnorderedModuleSet* visited);
|
| H A D | source-text-module.cc | 541 UnorderedModuleSet* visited) { in FetchStarExports()
546 bool cycle = !visited->insert(module).second; in FetchStarExports()
571 visited); in FetchStarExports()
538 FetchStarExports(Isolate* isolate, Handle<SourceTextModule> module, Zone* zone, UnorderedModuleSet* visited) FetchStarExports() argument
|
| /third_party/mesa3d/src/freedreno/ir3/ |
| H A D | ir3_ra.c | 332 * can move them appropriately. If all predecessors have been visited
333 * before this block is visited then we don't need to fill this out. This
338 /* True if the block has been visited and "renames" is complete.
340 bool visited; member
1932 if (!pred_state->visited) in handle_live_in()
2095 if (!pred_state->visited) in insert_live_in_move()
2158 /* If not all predecessors are visited, insert live-in regs so that in insert_live_in_moves()
2163 if (!ctx->blocks[ctx->block->predecessors[i]->index].visited) { in insert_live_in_moves()
2189 if (!succ_state->visited) in insert_live_out_move()
2317 ctx->blocks[block->index].visited in handle_block()
[all...] |
| /third_party/python/Lib/urllib/ |
| H A D | request.py | 733 # .redirect_dict has a key url if url was previously visited.
735 visited = new.redirect_dict = req.redirect_dict
736 if (visited.get(newurl, 0) >= self.max_repeats or
737 len(visited) >= self.max_redirections):
741 visited = new.redirect_dict = req.redirect_dict = {}
742 visited[newurl] = visited.get(newurl, 0) + 1
|
| /third_party/node/lib/internal/ |
| H A D | url.js | 295 const visited = new SafeMap();
306 const keyIdx = visited.get(typedKey);
310 visited.set(typedKey, ArrayPrototypePush(this[searchParams],
|
| /third_party/skia/src/gpu/ops/ |
| H A D | AAHairLinePathRenderer.cpp | 798 bool visited = false; variable
802 visited = true;
806 if (!visited) {
|
| /third_party/node/deps/v8/src/heap/cppgc-js/ |
| H A D | cpp-snapshot.cc | 106 EmbedderNode* node, bool visited) in StateBase()
111 visited_(visited) { in StateBase()
299 // Root states are always visited, visible, and have a node attached. in RootState()
785 // Avoid traversing into already visited subgraphs and just update the state in VisitForVisibility()
105 StateBase(const void* key, size_t state_count, Visibility visibility, EmbedderNode* node, bool visited) StateBase() argument
|
| /third_party/node/deps/v8/src/regexp/ |
| H A D | regexp-nodes.h | 43 visited(false), in NodeInfo()
92 bool visited : 1; member
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | TypePromotion.cpp | 130 SetVector<Value*> &visited, SetVector<Value*> &sources, in IRPromoter()
133 Ctx(C), OrigTy(Ty), PromotedWidth(Width), Visited(visited), in IRPromoter()
164 // being visited.
707 // Promote visited instructions, mutating their types in place. in Mutate()
828 // if it was already visited, or if we don't need to explore it (e.g. in TryToPromote()
858 // If we've already visited this value from somewhere, bail now because in TryToPromote()
877 // Visit operands of any instruction visited. in TryToPromote()
129 IRPromoter(LLVMContext &C, IntegerType *Ty, unsigned Width, SetVector<Value*> &visited, SetVector<Value*> &sources, SetVector<Instruction*> &sinks, SmallVectorImpl<Instruction*> &wrap) IRPromoter() argument
|
| /third_party/skia/third_party/externals/spirv-tools/source/val/ |
| H A D | validation_state.cpp | 1088 std::set<uint32_t> visited; in ComputeFunctionToEntryPointMapping() local
1093 if (!visited.insert(called_func_id).second) continue; in ComputeFunctionToEntryPointMapping()
1111 std::set<uint32_t> visited; in ComputeRecursiveEntryPoints() local
1121 if (!visited.insert(called_func_id).second) continue; in ComputeRecursiveEntryPoints()
|
| H A D | validate_cfg.cpp | 466 std::unordered_set<const BasicBlock*> visited; in FindCaseFallThrough() local
475 if (!visited.insert(block).second) continue; in FindCaseFallThrough()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| H A D | fuzzer_util.cpp | 1933 std::unordered_set<uint32_t> visited; in NewTerminatorPreservesDominationRules() local
1937 visited.insert(block); in NewTerminatorPreservesDominationRules()
1940 [&positions, &visited, &dominator_analysis, block, &q](uint32_t id) { in NewTerminatorPreservesDominationRules()
1954 if (!visited.count(id)) { in NewTerminatorPreservesDominationRules()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| H A D | fuzzer_util.cpp | 1933 std::unordered_set<uint32_t> visited; in NewTerminatorPreservesDominationRules() local
1937 visited.insert(block); in NewTerminatorPreservesDominationRules()
1940 [&positions, &visited, &dominator_analysis, block, &q](uint32_t id) { in NewTerminatorPreservesDominationRules()
1954 if (!visited.count(id)) { in NewTerminatorPreservesDominationRules()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/ |
| H A D | validation_state.cpp | 1088 std::set<uint32_t> visited; in ComputeFunctionToEntryPointMapping() local
1093 if (!visited.insert(called_func_id).second) continue; in ComputeFunctionToEntryPointMapping()
1111 std::set<uint32_t> visited; in ComputeRecursiveEntryPoints() local
1121 if (!visited.insert(called_func_id).second) continue; in ComputeRecursiveEntryPoints()
|
| H A D | validate_cfg.cpp | 466 std::unordered_set<const BasicBlock*> visited; in FindCaseFallThrough() local
475 if (!visited.insert(block).second) continue; in FindCaseFallThrough()
|
| /third_party/spirv-tools/source/fuzz/ |
| H A D | fuzzer_util.cpp | 1942 std::unordered_set<uint32_t> visited; in NewTerminatorPreservesDominationRules() local
1946 visited.insert(block); in NewTerminatorPreservesDominationRules()
1949 [&positions, &visited, &dominator_analysis, block, &q](uint32_t id) { in NewTerminatorPreservesDominationRules()
1963 if (!visited.count(id)) { in NewTerminatorPreservesDominationRules()
|
| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | symbol.h | 216 unsigned char visited:1; member
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_graph.cpp | 88 visited(0), in Node()
429 // erase visited in findLightestPathWeight()
|
| H A D | nv50_ir_lowering_nvc0.cpp | 440 std::unordered_set<const BasicBlock *> visited; in findFirstUses() local
441 findFirstUsesBB(minGPR, maxGPR, texi->next, texi, uses, visited); in findFirstUses()
448 std::unordered_set<const BasicBlock *> &visited) in findFirstUsesBB()
454 // the full thing. So only mark a bb as visited if we processed it from the in findFirstUsesBB()
457 if (visited.find(bb) != visited.end()) in findFirstUsesBB()
459 visited.insert(bb); in findFirstUsesBB()
489 texi, uses, visited); in findFirstUsesBB()
445 findFirstUsesBB( int minGPR, int maxGPR, Instruction *start, const Instruction *texi, std::list<TexUse> &uses, std::unordered_set<const BasicBlock *> &visited) findFirstUsesBB() argument
|
| /third_party/skia/src/pathops/ |
| H A D | SkOpSegment.h | 413 bool visited() { in visited() function in SkOpSegment
|
| /third_party/spirv-tools/source/val/ |
| H A D | validation_state.cpp | 1380 std::set<uint32_t> visited; in ComputeFunctionToEntryPointMapping() local
1385 if (!visited.insert(called_func_id).second) continue; in ComputeFunctionToEntryPointMapping()
1403 std::set<uint32_t> visited; in ComputeRecursiveEntryPoints() local
1413 if (!visited.insert(called_func_id).second) continue; in ComputeRecursiveEntryPoints()
|
| H A D | validate_cfg.cpp | 472 std::unordered_set<const BasicBlock*> visited; in FindCaseFallThrough() local
481 if (!visited.insert(block).second) continue; in FindCaseFallThrough()
|
| /third_party/mesa3d/src/compiler/spirv/ |
| H A D | vtn_cfg.c | 329 if (cse->visited) in vtn_order_case()
332 cse->visited = true; in vtn_order_case()
344 * visited before anything that falls through to it. in vtn_order_case()
|
| H A D | vtn_private.h | 214 bool visited; member
|
| /third_party/node/tools/ |
| H A D | test.py | 1705 visited = set()
1708 if key in visited:
1710 visited.add(key)
|