| /freebsd-14.2/sys/ufs/ffs/ |
| H A D | softdep.h | 210 struct worklist { struct 293 struct worklist pd_list; /* page buffer */ 396 struct worklist sm_list; /* cylgrp buffer */ 426 struct worklist nb_list; /* See comment above. */ 608 struct worklist fw_list; /* Delayed worklist. */ 632 struct worklist fd_list; /* Delayed worklist. */ 742 struct worklist dm_list; /* delayed worklist */ 878 struct worklist jn_list; /* See lists above. */ 959 struct worklist jd_list; /* See above for lists. */ 974 struct worklist js_list; /* b_deps link for journal */ [all …]
|
| H A D | ffs_softdep.c | 841 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *, 990 struct worklist *item, in worklist_insert() 1078 struct worklist *wkn; in jwork_move() 1079 struct worklist *wk; in jwork_move() 1108 struct worklist *wk; in jwork_insert() 1896 struct worklist *wk; in process_worklist_item() 2240 struct worklist *wk; in pagedep_lookup() 3623 struct worklist *wk; in softdep_process_journal() 3882 struct worklist *wk; in complete_jseg() 5412 struct worklist *wk; in bmsafemap_lookup() [all …]
|
| H A D | ffs_alloc.c | 2695 LIST_SWAP(dephd, &blkelm->dephd, worklist, wk_list); in ffs_blkfree()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CFGReachabilityAnalysis.cpp | 43 SmallVector<const CFGBlock *, 11> worklist; in mapReachability() local 51 worklist.push_back(Dst); in mapReachability() 54 while (!worklist.empty()) { in mapReachability() 55 const CFGBlock *block = worklist.pop_back_val(); in mapReachability() 73 worklist.push_back(*i); in mapReachability()
|
| H A D | LiveVariables.cpp | 539 BackwardDataflowWorklist worklist(*cfg, AC); in computeLiveness() local 544 worklist.enqueueBlock(B); in computeLiveness() 547 while (const CFGBlock *block = worklist.dequeue()) { in computeLiveness() 572 worklist.enqueuePredecessors(block); in computeLiveness()
|
| H A D | UninitializedValues.cpp | 937 ForwardDataflowWorklist worklist(cfg, ac); in runUninitializedVariablesAnalysis() local 939 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis() 944 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis() 952 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
|
| /freebsd-14.2/contrib/llvm-project/lld/COFF/ |
| H A D | MarkLive.cpp | 29 SmallVector<SectionChunk *, 256> worklist; in markLive() local 37 worklist.push_back(sc); in markLive() 43 worklist.push_back(c); in markLive() 59 while (!worklist.empty()) { in markLive() 60 SectionChunk *sc = worklist.pop_back_val(); in markLive()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyLowerRefTypesIntPtrConv.cpp | 61 std::set<Instruction *> worklist; in runOnFunction() local 78 worklist.insert(&*I); in runOnFunction() 82 for (Instruction *I : worklist) in runOnFunction() 85 return !worklist.empty(); in runOnFunction()
|
| /freebsd-14.2/contrib/llvm-project/lld/MachO/ |
| H A D | MarkLive.cpp | 71 SmallVector<WorklistEntry *, 256> worklist; member in lld::macho::MarkLiveImpl 83 worklist.push_back(makeEntry(s, prev)); in enqueue() 149 while (!worklist.empty()) { in markTransitively() 150 WorklistEntry *entry = worklist.pop_back_val(); in markTransitively() 197 } while (!worklist.empty()); in markTransitively()
|
| /freebsd-14.2/lib/libthr/thread/ |
| H A D | thr_list.c | 100 TAILQ_HEAD(, pthread) worklist; in _thr_gc() 102 TAILQ_INIT(&worklist); in _thr_gc() 113 TAILQ_INSERT_HEAD(&worklist, td, gcle); in _thr_gc() 117 while ((td = TAILQ_FIRST(&worklist)) != NULL) { in _thr_gc() 118 TAILQ_REMOVE(&worklist, td, gcle); in _thr_gc()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | DeadStoresChecker.cpp | 87 SmallVector<const CFGBlock*, 10> worklist; in computeReachableBlocks() local 88 worklist.push_back(&cfg.getEntry()); in computeReachableBlocks() 90 while (!worklist.empty()) { in computeReachableBlocks() 91 const CFGBlock *block = worklist.pop_back_val(); in computeReachableBlocks() 99 worklist.push_back(succ); in computeReachableBlocks()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIFixSGPRCopies.cpp | 794 SetVector<const MachineInstr *> worklist; in processPHINode() local 797 worklist.insert(&MI); in processPHINode() 801 while (!worklist.empty()) { in processPHINode() 802 const MachineInstr *Instr = worklist.pop_back_val(); in processPHINode() 812 worklist.insert(UseMI); in processPHINode() 894 SIInstrWorklist worklist; in lowerSpecialCase() local 895 worklist.insert(&MI); in lowerSpecialCase() 896 TII->moveToVALU(worklist, MDT); in lowerSpecialCase()
|
| /freebsd-14.2/sys/geom/bde/ |
| H A D | g_bde_work.c | 121 TAILQ_INSERT_TAIL(&sc->worklist, wp, list); in g_bde_new_work() 133 TAILQ_REMOVE(&sc->worklist, wp, list); in g_bde_delete_work() 298 TAILQ_FOREACH(wp2, &sc->worklist, list) { in g_bde_release_keysector() 576 TAILQ_FOREACH_SAFE(wp, &sc->worklist, list, twp) { in g_bde_worker()
|
| H A D | g_bde.h | 137 TAILQ_HEAD(, g_bde_work) worklist;
|
| H A D | g_bde.c | 187 TAILQ_INIT(&sc->worklist); in g_bde_create_geom()
|
| /freebsd-14.2/contrib/bsnmp/lib/ |
| H A D | snmpclient.c | 110 TAILQ_HEAD(worklist, work); 118 struct worklist worklist; member 152 while ((w = TAILQ_FIRST(&work->worklist)) != NULL) { in table_free() 153 TAILQ_REMOVE(&work->worklist, w, link); in table_free() 192 w = TAILQ_FIRST(&work->worklist); in table_find() 331 w1 = TAILQ_FIRST(&work->worklist); in table_find() 340 TAILQ_INSERT_TAIL(&work->worklist, w, link); in table_find() 575 TAILQ_INIT(&work.worklist); in snmp_table_fetch() 725 TAILQ_INIT(&work->worklist); in snmp_table_fetch_async()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyValueInfo.cpp | 298 std::vector<BasicBlock*> worklist; in threadEdgeImpl() local 299 worklist.push_back(OldSucc); in threadEdgeImpl() 311 while (!worklist.empty()) { in threadEdgeImpl() 312 BasicBlock *ToUpdate = worklist.back(); in threadEdgeImpl() 313 worklist.pop_back(); in threadEdgeImpl() 336 llvm::append_range(worklist, successors(ToUpdate)); in threadEdgeImpl()
|
| /freebsd-14.2/usr.sbin/newsyslog/ |
| H A D | newsyslog.c | 303 struct cflist *worklist; in main() local 317 worklist = get_worklist(argv); in main() 323 while (!STAILQ_EMPTY(worklist)) { in main() 324 p = STAILQ_FIRST(worklist); in main() 325 STAILQ_REMOVE_HEAD(worklist, cf_nextp); in main()
|
| /freebsd-14.2/sys/sys/ |
| H A D | buf.h | 58 LIST_HEAD(workhead, worklist);
|
| /freebsd-14.2/sys/kern/ |
| H A D | kern_sig.c | 668 sigqueue_t worklist; in sigqueue_delete_set_proc() local 673 sigqueue_init(&worklist, NULL); in sigqueue_delete_set_proc() 674 sigqueue_move_set(&p->p_sigqueue, &worklist, set); in sigqueue_delete_set_proc() 677 sigqueue_move_set(&td0->td_sigqueue, &worklist, set); in sigqueue_delete_set_proc() 679 sigqueue_flush(&worklist); in sigqueue_delete_set_proc()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 5356 SmallVector<Value *, 8> worklist; in optimizeMemoryInst() local 5358 worklist.push_back(Addr); in optimizeMemoryInst() 5370 while (!worklist.empty()) { in optimizeMemoryInst() 5371 Value *V = worklist.pop_back_val(); in optimizeMemoryInst() 5387 append_range(worklist, P->incoming_values()); in optimizeMemoryInst() 5393 worklist.push_back(SI->getFalseValue()); in optimizeMemoryInst() 5394 worklist.push_back(SI->getTrueValue()); in optimizeMemoryInst()
|