/freebsd/sys/ufs/ffs/ |
H A D | softdep.h | 208 struct worklist { struct 209 LIST_ENTRY(worklist) wk_list; /* list of work requests */ 213 LIST_ENTRY(worklist) wk_all; /* list of deps of this type */ argument 291 struct worklist pd_list; /* page buffer */ 351 struct worklist id_list; /* buffer holding inode block */ 394 struct worklist sm_list; /* cylgrp buffer */ 424 struct worklist nb_list; /* See comment above. */ 497 struct worklist ir_list; /* buffer holding indirect block */ 555 struct worklist ff_list; /* id_inowait or delayed worklist */ 557 struct worklist *ff_jdep; /* Associated journal entry. */ [all …]
|
H A D | ffs_softdep.c | 750 static struct jnewblk *cancel_newblk(struct newblk *, struct worklist *, 839 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *, 877 static void add_to_worklist(struct worklist *, int); 878 static void wake_worklist(struct worklist *); 879 static void wait_worklist(struct worklist *, char *); 880 static void remove_from_worklist(struct worklist *); 890 static void add_to_journal(struct worklist *); 891 static void remove_from_journal(struct worklist *); [all...] |
H A D | ffs_alloc.c | 2711 LIST_SWAP(dephd, &blkelm->dephd, worklist, wk_list); in ffs_blkfree()
|
/freebsd/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/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/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/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/lib/libthr/thread/ |
H A D | thr_list.c | 99 TAILQ_HEAD(, pthread) worklist; in _thr_gc() 101 TAILQ_INIT(&worklist); in _thr_gc() 112 TAILQ_INSERT_HEAD(&worklist, td, gcle); in _thr_gc() 116 while ((td = TAILQ_FIRST(&worklist)) != NULL) { in _thr_gc() 117 TAILQ_REMOVE(&worklist, td, gcle); in _thr_gc()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIFixSGPRCopies.cpp | 792 SetVector<const MachineInstr *> worklist; in processPHINode() local 795 worklist.insert(&MI); in processPHINode() 799 while (!worklist.empty()) { in processPHINode() 800 const MachineInstr *Instr = worklist.pop_back_val(); in processPHINode() 810 worklist.insert(UseMI); in processPHINode() 892 SIInstrWorklist worklist; in lowerSpecialCase() local 893 worklist.insert(&MI); in lowerSpecialCase() 894 TII->moveToVALU(worklist, MDT); in lowerSpecialCase()
|
/freebsd/sys/geom/bde/ |
H A D | g_bde_work.c |
|
H A D | g_bde.h |
|
H A D | g_bde.c |
|
/freebsd/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/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 300 std::vector<BasicBlock*> worklist; in threadEdgeImpl() local 301 worklist.push_back(OldSucc); in threadEdgeImpl() 313 while (!worklist.empty()) { in threadEdgeImpl() 314 BasicBlock *ToUpdate = worklist.back(); in threadEdgeImpl() 315 worklist.pop_back(); in threadEdgeImpl() 338 llvm::append_range(worklist, successors(ToUpdate)); in threadEdgeImpl()
|
/freebsd/usr.sbin/newsyslog/ |
H A D | newsyslog.c | 327 struct cflist *worklist; in main() local 341 worklist = get_worklist(argv); in main() 347 while (!STAILQ_EMPTY(worklist)) { in main() 348 p = STAILQ_FIRST(worklist); in main() 349 STAILQ_REMOVE_HEAD(worklist, cf_nextp); in main()
|
/freebsd/sys/sys/ |
H A D | buf.h | 56 LIST_HEAD(workhead, worklist);
|
/freebsd/sys/kern/ |
H A D | kern_sig.c | 676 sigqueue_t worklist; in sigqueue_delete_set_proc() local 681 sigqueue_init(&worklist, NULL); in sigqueue_delete_set_proc() 682 sigqueue_move_set(&p->p_sigqueue, &worklist, set); in sigqueue_delete_set_proc() 685 sigqueue_move_set(&td0->td_sigqueue, &worklist, set); in sigqueue_delete_set_proc() 687 sigqueue_flush(&worklist); in sigqueue_delete_set_proc()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 5460 SmallVector<Value *, 8> worklist; in optimizeMemoryInst() local 5462 worklist.push_back(Addr); in optimizeMemoryInst() 5474 while (!worklist.empty()) { in optimizeMemoryInst() 5475 Value *V = worklist.pop_back_val(); in optimizeMemoryInst() 5491 append_range(worklist, P->incoming_values()); in optimizeMemoryInst() 5497 worklist.push_back(SI->getFalseValue()); in optimizeMemoryInst() 5498 worklist.push_back(SI->getTrueValue()); in optimizeMemoryInst()
|