Searched refs:visited (Results 1 - 25 of 28) sorted by relevance

12

/freebsd-current/contrib/llvm-project/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp44 llvm::BitVector visited(analyzed.size());
57 if (visited[block->getBlockID()])
59 visited[block->getBlockID()] = true;
/freebsd-current/crypto/openssl/crypto/
H A Dprovider_conf.c84 STACK_OF(OPENSSL_CSTRING) *visited)
100 * been visited. If it has, then we have a recursive lookup
104 for (i = 0; i < sk_OPENSSL_CSTRING_num(visited); i++) {
105 if (sk_OPENSSL_CSTRING_value(visited, i) == value) {
112 * We've not visited this node yet, so record it on the stack
114 if (!sk_OPENSSL_CSTRING_push(visited, value))
127 sk_OPENSSL_CSTRING_pop(visited);
133 sectconf->value, cnf, visited);
135 sk_OPENSSL_CSTRING_pop(visited);
139 sk_OPENSSL_CSTRING_pop(visited);
80 provider_conf_params_internal(OSSL_PROVIDER *prov, OSSL_PROVIDER_INFO *provinfo, const char *name, const char *value, const CONF *cnf, STACK_OF(OPENSSL_CSTRING) *visited) argument
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp233 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument
246 unsigned oldSize = visited.size();
247 visited.insert(N);
248 if (visited.size() != oldSize) {
253 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
267 DenseSet<SDNode *> visited; local
269 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
272 setSubgraphColorHelper(N, "blue", visited, 0, printed);
274 setSubgraphColorHelper(N, "green", visited, 0, printed);
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp9 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
10 // post-analysis to determine what was never visited.
43 CFGBlocksSet &visited);
52 CFGBlocksSet reachable, visited; local
105 if (!visited.count(CB->getBlockID()))
106 FindUnreachableEntryPoints(CB, reachable, visited);
179 CFGBlocksSet &visited) {
180 visited.insert(CB->getBlockID());
190 if (!visited.count(PredBlock->getBlockID()))
191 // If we haven't previously visited th
177 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h112 &visited = t2; local
114 visited.clear();
115 visited.setBit(from);
118 if (visited.setBit(idx))
121 return targets.intersectsWith(visited);
H A Dsanitizer_deadlock_detector2.cpp60 bool visited[kMaxMutex]; member in struct:__sanitizer::DDPhysicalThread
358 internal_memset(pt->visited, 0, sizeof(pt->visited));
373 if (pt->visited[link.id])
379 pt->visited[link.id] = true;
/freebsd-current/contrib/llvm-project/lldb/source/Symbol/
H A DTypeSystem.cpp217 llvm::DenseSet<TypeSystem *> visited;
219 if (visited.count(pair.second.get()))
221 visited.insert(pair.second.get());
248 llvm::DenseSet<TypeSystem *> visited;
251 if (!type_system || visited.count(type_system))
253 visited.insert(type_system);
/freebsd-current/contrib/llvm-project/lldb/bindings/interface/
H A DSBValueExtensions.i145 visited = set()
147 while not end_of_list_test(item) and not item.GetValueAsUnsigned() in visited:
148 visited.add(item.GetValueAsUnsigned())
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h164 SmallPtrSet<BlockT *, 32> visited; local
180 if (visited.insert(currentBB).second) {
198 if (visited.count(childBB) == 0) {
205 // If all children are visited or there is any child then pop this block
H A DRegionInfoImpl.h259 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const {
262 visited->insert(BB);
267 if (Succ != exit && visited->find(Succ) == visited->end())
268 verifyWalk(Succ, visited);
280 std::set<BlockT *> visited;
281 verifyWalk(getEntry(), &visited); local
/freebsd-current/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dnup.c79 unsigned visited; member in struct:dnup_node
135 u->visited = 0; /* cleanup */
202 /* Check if remote port has already been visited */
203 if (!rem_u->visited) {
206 rem_u->visited = 1;
247 /* Go over all remote nodes and rank them (if not already visited) */
343 u->visited = 0;
H A Dosm_ucast_updn.c79 unsigned visited; member in struct:updn_node
140 u->visited = 0; /* cleanup */
191 /* Check if remote port has already been visited */
192 if (!rem_u->visited) {
195 rem_u->visited = 1;
236 /* Go over all remote nodes and rank them (if not already visited) */
H A Dosm_ucast_dfsssp.c126 uint8_t visited; /* needed to traverse the binary tree */ member in struct:cdg_node
173 node->visited = 0;
688 current->visited = 1;
693 if (current->left && !current->left->visited) {
695 } else if (current->right && !current->right->visited) {
699 current->left->visited = 0;
701 current->right->visited = 0;
711 current->visited = 0;
713 current->left->visited = 0;
715 current->right->visited
[all...]
/freebsd-current/sys/kern/
H A Dkern_dump.c397 bool visited; member in struct:__anon525
425 progress_track[i].visited = false;
454 if (!progress_track[i].visited) {
455 progress_track[i].visited = true;
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DProgramState.cpp545 bool wasVisited = !visited.insert(val.getCVData()).second;
567 bool wasVisited = !visited.insert(SubSym).second;
602 bool wasVisited = !visited.insert(R).second;
/freebsd-current/contrib/ntp/sntp/libevent/test/
H A Dregress.c3223 struct foreach_helper visited[5];
3229 visited[i].count = 0;
3230 visited[i].ev = NULL;
3231 ev[i] = event_new(base, -1, 0, timeout_cb, &visited[i]);
3246 tt_int_op(1, ==, visited[0].count);
3247 tt_int_op(1, ==, visited[1].count);
3248 tt_int_op(1, ==, visited[2].count);
3249 tt_int_op(1, ==, visited[3].count);
3250 tt_ptr_op(ev[0], ==, visited[0].ev);
3251 tt_ptr_op(ev[1], ==, visited[
[all...]
/freebsd-current/contrib/libevent/test/
H A Dregress.c3223 struct foreach_helper visited[5];
3229 visited[i].count = 0;
3230 visited[i].ev = NULL;
3231 ev[i] = event_new(base, -1, 0, timeout_cb, &visited[i]);
3246 tt_int_op(1, ==, visited[0].count);
3247 tt_int_op(1, ==, visited[1].count);
3248 tt_int_op(1, ==, visited[2].count);
3249 tt_int_op(1, ==, visited[3].count);
3250 tt_ptr_op(ev[0], ==, visited[0].ev);
3251 tt_ptr_op(ev[1], ==, visited[
[all...]
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h270 DenseSet<const GCOVBlock *> visited; member in class:llvm::GCOVFunction
/freebsd-current/usr.bin/gprof/
H A Darcs.c37 int visited; variable
509 printf("%s visited %d, viable %d, newcycle %d, oldcycle %d\n",
510 "[doarcs]" , visited , viable , newcycle , oldcycle);
524 visited++;
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Dspa_log_spacemap.c820 uint64_t visited = 0; local
860 visited++;
862 ASSERT3U(avl_numnodes(&spa->spa_metaslabs_by_flushed), >=, visited);
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DTypePromotion.cpp125 IRPromoter(LLVMContext &C, unsigned Width, SetVector<Value *> &visited, argument
129 : Ctx(C), PromotedWidth(Width), Visited(visited), Sources(sources),
159 // being visited.
674 // Promote visited instructions, mutating their types in place.
795 // if it was already visited, or if we don't need to explore it (e.g.
825 // If we've already visited this value from somewhere, bail now because
844 // Visit operands of any instruction visited.
/freebsd-current/share/mk/
H A Dbsd.subdir.mk5 # specified directory will be visited and the target made. There is
/freebsd-current/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramState.h315 // visited.
908 VisitedItems visited; member in class:clang::ento::ScanReachableSymbols
/freebsd-current/contrib/llvm-project/clang/lib/Sema/
H A DSemaLookup.cpp101 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon789::UnqualUsingDirectiveSet
133 // A given context is only every visited once, so it is important
134 // that contexts be visited from the inside out in order to get
137 if (!visited.insert(DC).second)
148 if (!visited.insert(NS).second)
163 if (SemaRef.isVisible(UD) && visited.insert(NS).second) {
3045 // Add the class itself. If we've already transitively visited this class,
3987 /// The declaration contexts we have already visited.
3993 /// Determine whether we have already visited this context
/freebsd-current/contrib/llvm-project/llvm/lib/ProfileData/
H A DGCOV.cpp385 // If GCOV_ARC_ON_TREE edges do form a tree, visited is not needed;
387 if (u.i == 0 && !visited.insert(&u.v).second) {
491 // Ignore saturated arcs (cycleCount has been reduced to 0) and visited

Completed in 399 milliseconds

12