| /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 *);
893 static void softdep_process_journal(struct mount *, struct worklist *, int);
912 static int jwait(struct worklist *, int);
[all …]
|
| H A D | ffs_alloc.c | 2711 LIST_SWAP(dephd, &blkelm->dephd, worklist, wk_list); in ffs_blkfree()
|
| /freebsd/crypto/krb5/src/ccapi/server/win/ |
| H A D | WorkQueue.cpp | 34 WorkList worklist; variable
37 return worklist.initialize(); in worklist_initialize()
41 return worklist.cleanup(); in worklist_cleanup()
45 worklist.wait(); in worklist_wait()
50 return worklist.isEmpty() ? TRUE : FALSE; in worklist_isEmpty()
57 return worklist.add(new WorkItem(stream, pipe, rpcmsg, serverStartTime) ); in worklist_add()
65 cc_int32 err = worklist.remove(&item); in worklist_remove()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CFGReachabilityAnalysis.cpp | 42 SmallVector<const CFGBlock *, 11> worklist; in mapReachability() local
50 worklist.push_back(Dst); in mapReachability()
53 while (!worklist.empty()) { in mapReachability()
54 const CFGBlock *block = worklist.pop_back_val(); in mapReachability()
72 worklist.push_back(*i); in mapReachability()
|
| H A D | LiveVariables.cpp | 576 BackwardDataflowWorklist worklist(*cfg, AC); in computeLiveness() local
581 worklist.enqueueBlock(B); in computeLiveness()
584 while (const CFGBlock *block = worklist.dequeue()) { in computeLiveness()
609 worklist.enqueuePredecessors(block); in computeLiveness()
|
| H A D | UninitializedValues.cpp | 940 ForwardDataflowWorklist worklist(cfg, ac); in runUninitializedVariablesAnalysis() local
942 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
947 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis()
955 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
|
| /freebsd/contrib/llvm-project/lld/COFF/ |
| H A D | MarkLive.cpp | 27 SmallVector<SectionChunk *, 256> worklist; in markLive() local
35 worklist.push_back(sc); in markLive()
41 worklist.push_back(c); in markLive()
67 while (!worklist.empty()) { in markLive()
68 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
77 worklist.insert(&*I); in runOnFunction()
81 for (Instruction *I : worklist) in runOnFunction()
84 return !worklist.empty(); in runOnFunction()
|
| /freebsd/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/contrib/llvm-project/lld/MachO/ |
| H A D | MarkLive.cpp | 69 SmallVector<WorklistEntry *, 256> worklist; member in lld::macho::MarkLiveImpl
81 worklist.push_back(makeEntry(s, prev)); in enqueue()
147 while (!worklist.empty()) { in markTransitively()
148 WorklistEntry *entry = worklist.pop_back_val(); in markTransitively()
195 } while (!worklist.empty()); in markTransitively()
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | DWARFDebugInfoEntry.cpp | 287 static bool GetAttributes(llvm::SmallVectorImpl<DWARFDIE> &worklist, in GetAttributes() argument
290 assert(!worklist.empty() && "Need at least one DIE to visit."); in GetAttributes()
294 DWARFDIE current = worklist.pop_back_val(); in GetAttributes()
339 worklist.push_back(spec_die); in GetAttributes()
363 llvm::SmallVector<DWARFDIE, 3> worklist; in GetAttributes() local
364 worklist.emplace_back(cu, this); in GetAttributes()
373 if (!::GetAttributes(worklist, seen, attributes)) { in GetAttributes()
377 } while (!worklist.empty() && recurse == Recurse::yes); in GetAttributes()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | DeadStoresChecker.cpp | 86 SmallVector<const CFGBlock*, 10> worklist; in computeReachableBlocks() local
87 worklist.push_back(&cfg.getEntry()); in computeReachableBlocks()
89 while (!worklist.empty()) { in computeReachableBlocks()
90 const CFGBlock *block = worklist.pop_back_val(); in computeReachableBlocks()
98 worklist.push_back(succ); in computeReachableBlocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIFixSGPRCopies.cpp | 809 SetVector<const MachineInstr *> worklist; in processPHINode() local
812 worklist.insert(&MI); in processPHINode()
816 while (!worklist.empty()) { in processPHINode()
817 const MachineInstr *Instr = worklist.pop_back_val(); in processPHINode()
827 worklist.insert(UseMI); in processPHINode()
908 SIInstrWorklist worklist; in lowerSpecialCase() local
909 worklist.insert(&MI); in lowerSpecialCase()
910 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 | 248 std::vector<BasicBlock*> worklist; in threadEdgeImpl() local
249 worklist.push_back(OldSucc); in threadEdgeImpl()
261 while (!worklist.empty()) { in threadEdgeImpl()
262 BasicBlock *ToUpdate = worklist.back(); in threadEdgeImpl()
263 worklist.pop_back(); in threadEdgeImpl()
286 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 | 57 LIST_HEAD(workhead, worklist);
|
| /freebsd/sys/kern/ |
| H A D | kern_sig.c | 667 sigqueue_t worklist; in sigqueue_delete_set_proc() local
672 sigqueue_init(&worklist, NULL); in sigqueue_delete_set_proc()
673 sigqueue_move_set(&p->p_sigqueue, &worklist, set); in sigqueue_delete_set_proc()
676 sigqueue_move_set(&td0->td_sigqueue, &worklist, set); in sigqueue_delete_set_proc()
678 sigqueue_flush(&worklist); in sigqueue_delete_set_proc()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 5832 SmallVector<Value *, 8> worklist; in optimizeMemoryInst() local
5834 worklist.push_back(Addr); in optimizeMemoryInst()
5846 while (!worklist.empty()) { in optimizeMemoryInst()
5847 Value *V = worklist.pop_back_val(); in optimizeMemoryInst()
5863 append_range(worklist, P->incoming_values()); in optimizeMemoryInst()
5869 worklist.push_back(SI->getFalseValue()); in optimizeMemoryInst()
5870 worklist.push_back(SI->getTrueValue()); in optimizeMemoryInst()
|