Searched refs:worklist (Results 1 - 19 of 19) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/lld/COFF/
H A DMarkLive.cpp26 // We build up a worklist of sections which have been marked as live. We only
27 // push into the worklist when we discover an unmarked section, and we mark
29 SmallVector<SectionChunk *, 256> worklist; local
37 worklist.push_back(sc);
43 worklist.push_back(c);
59 while (!worklist.empty()) {
60 SectionChunk *sc = worklist.pop_back_val();
61 assert(sc->live && "We mark as live when pushing onto the worklist!");
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp43 SmallVector<const CFGBlock *, 11> worklist; local
51 worklist.push_back(Dst);
54 while (!worklist.empty()) {
55 const CFGBlock *block = worklist.pop_back_val();
69 // Add the predecessors to the worklist.
73 worklist.push_back(*i);
H A DLiveVariables.cpp508 // Construct the dataflow worklist. Enqueue the exit block as the
510 BackwardDataflowWorklist worklist(*cfg, AC);
516 worklist.enqueueBlock(block);
539 while (const CFGBlock *block = worklist.dequeue()) {
564 worklist.enqueuePredecessors(block);
H A DUninitializedValues.cpp935 ForwardDataflowWorklist worklist(cfg, ac);
937 worklist.enqueueSuccessors(&cfg.getEntry());
942 while (const CFGBlock *block = worklist.dequeue()) {
950 worklist.enqueueSuccessors(block);
/freebsd-13-stable/sys/ufs/ffs/
H A Dsoftdep.h89 * the old name must be added to the worklist to do the necessary
102 * The INPROGRESS flag marks worklist structures that are still on the
103 * worklist, but are being considered for action by some process.
111 * onto a worklist.
202 /* LIST_HEAD(workhead, worklist); -- declared in buf.h */
205 * Each request can be linked onto a work queue through its worklist structure.
208 * worklist is needed in the structure, then a wk_data field must be added
211 struct worklist { struct
212 LIST_ENTRY(worklist) wk_list; /* list of work requests */
219 LIST_ENTRY(worklist) wk_al
[all...]
H A Dffs_softdep.c809 static struct jnewblk *cancel_newblk(struct newblk *, struct worklist *,
898 static struct worklist *jnewblk_merge(struct worklist *, struct worklist *,
936 static void add_to_worklist(struct worklist *, int);
937 static void wake_worklist(struct worklist *);
938 static void wait_worklist(struct worklist *, char *);
939 static void remove_from_worklist(struct worklist *);
949 static void add_to_journal(struct worklist *);
950 static void remove_from_journal(struct worklist *);
[all...]
H A Dffs_alloc.c2666 LIST_SWAP(dephd, &blkelm->dephd, worklist, wk_list);
/freebsd-13-stable/lib/libthr/thread/
H A Dthr_list.c102 TAILQ_HEAD(, pthread) worklist;
104 TAILQ_INIT(&worklist);
115 TAILQ_INSERT_HEAD(&worklist, td, gcle);
119 while ((td = TAILQ_FIRST(&worklist)) != NULL) {
120 TAILQ_REMOVE(&worklist, td, gcle);
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp86 SmallVector<const CFGBlock*, 10> worklist;
87 worklist.push_back(&cfg.getEntry());
89 while (!worklist.empty()) {
90 const CFGBlock *block = worklist.pop_back_val();
98 worklist.push_back(succ);
/freebsd-13-stable/sys/geom/bde/
H A Dg_bde.h134 TAILQ_HEAD(, g_bde_work) worklist; member in struct:g_bde_softc
H A Dg_bde_work.c123 TAILQ_INSERT_TAIL(&sc->worklist, wp, list);
135 TAILQ_REMOVE(&sc->worklist, wp, list);
300 TAILQ_FOREACH(wp2, &sc->worklist, list) {
578 TAILQ_FOREACH_SAFE(wp, &sc->worklist, list, twp) {
H A Dg_bde.c189 TAILQ_INIT(&sc->worklist);
/freebsd-13-stable/contrib/bsnmp/lib/
H A Dsnmpclient.c110 TAILQ_HEAD(worklist, work);
118 struct worklist worklist; member in struct:tabwork
141 * Free the entire table and work list. If table is NULL only the worklist
152 while ((w = TAILQ_FIRST(&work->worklist)) != NULL) {
153 TAILQ_REMOVE(&work->worklist, w, link);
192 w = TAILQ_FIRST(&work->worklist);
331 w1 = TAILQ_FIRST(&work->worklist);
340 TAILQ_INSERT_TAIL(&work->worklist, w, link);
575 TAILQ_INIT(&work.worklist);
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIFixSGPRCopies.cpp767 SetVector<const MachineInstr *> worklist;
770 worklist.insert(&MI);
772 while (!worklist.empty()) {
773 const MachineInstr *Instr = worklist.pop_back_val();
787 worklist.insert(UseMI);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyValueInfo.cpp46 // This is the number of worklist items we will process to try to discover an
276 std::vector<BasicBlock*> worklist; local
277 worklist.push_back(OldSucc);
285 // Use a worklist to perform a depth-first search of OldSucc's successors.
289 while (!worklist.empty()) {
290 BasicBlock *ToUpdate = worklist.back();
291 worklist.pop_back();
314 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
/freebsd-13-stable/sys/sys/
H A Dbuf.h59 LIST_HEAD(workhead, worklist);
/freebsd-13-stable/usr.sbin/newsyslog/
H A Dnewsyslog.c305 struct cflist *worklist; local
319 worklist = get_worklist(argv);
325 while (!STAILQ_EMPTY(worklist)) {
326 p = STAILQ_FIRST(worklist);
327 STAILQ_REMOVE_HEAD(worklist, cf_nextp);
859 * and adds them to the filelist. Then return the worklist.
885 * then create a new worklist which has only those files in
949 * add a worklist item based on the default entry.
968 /* And finally, return a worklist which matches the given files. */
974 * which match those glob-entries onto the worklist
[all...]
/freebsd-13-stable/sys/kern/
H A Dkern_sig.c565 sigqueue_t worklist; local
570 sigqueue_init(&worklist, NULL);
571 sigqueue_move_set(&p->p_sigqueue, &worklist, set);
574 sigqueue_move_set(&td0->td_sigqueue, &worklist, set);
576 sigqueue_flush(&worklist);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp4892 SmallVector<Value*, 8> worklist; local
4894 worklist.push_back(Addr);
4896 // Use a worklist to iteratively look through PHI and select nodes, and
4906 while (!worklist.empty()) {
4907 Value *V = worklist.back();
4908 worklist.pop_back();
4925 worklist.push_back(IncValue);
4931 worklist.push_back(SI->getFalseValue());
4932 worklist.push_back(SI->getTrueValue());

Completed in 184 milliseconds