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

/freebsd-current/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.cpp537 // Construct the dataflow worklist. Enqueue the exit block as the
539 BackwardDataflowWorklist worklist(*cfg, AC);
544 worklist.enqueueBlock(B);
547 while (const CFGBlock *block = worklist.dequeue()) {
572 worklist.enqueuePredecessors(block);
H A DUninitializedValues.cpp937 ForwardDataflowWorklist worklist(cfg, ac);
939 worklist.enqueueSuccessors(&cfg.getEntry());
944 while (const CFGBlock *block = worklist.dequeue()) {
952 worklist.enqueueSuccessors(block);
/freebsd-current/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-current/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLowerRefTypesIntPtrConv.cpp61 std::set<Instruction *> worklist; local
78 worklist.insert(&*I);
82 for (Instruction *I : worklist)
85 return !worklist.empty();
/freebsd-current/sys/ufs/ffs/
H A Dsoftdep.h86 * the old name must be added to the worklist to do the necessary
99 * The INPROGRESS flag marks worklist structures that are still on the
100 * worklist, but are being considered for action by some process.
108 * onto a worklist.
199 /* LIST_HEAD(workhead, worklist); -- declared in buf.h */
202 * Each request can be linked onto a work queue through its worklist structure.
205 * worklist is needed in the structure, then a wk_data field must be added
208 struct worklist { struct
209 LIST_ENTRY(worklist) wk_list; /* list of work requests */
213 LIST_ENTRY(worklist) wk_al
[all...]
H A Dffs_softdep.c750 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 Dffs_alloc.c2693 LIST_SWAP(dephd, &blkelm->dephd, worklist, wk_list);
/freebsd-current/contrib/llvm-project/lld/MachO/
H A DMarkLive.cpp66 // We build up a worklist of sections which have been marked as live. We
67 // only push into the worklist when we discover an unmarked section, and we
70 // ConcatInputSections in our worklist.
71 SmallVector<WorklistEntry *, 256> worklist; member in class:lld::macho::MarkLiveImpl
83 worklist.push_back(makeEntry(s, prev));
149 while (!worklist.empty()) {
150 WorklistEntry *entry = worklist.pop_back_val();
151 // Entries that get placed onto the worklist always contain
154 // those entries should never be pushed onto the worklist.
156 assert(isec->live && "We mark as live when pushing onto the worklist!");
[all...]
/freebsd-current/lib/libthr/thread/
H A Dthr_list.c99 TAILQ_HEAD(, pthread) worklist;
101 TAILQ_INIT(&worklist);
112 TAILQ_INSERT_HEAD(&worklist, td, gcle);
116 while ((td = TAILQ_FIRST(&worklist)) != NULL) {
117 TAILQ_REMOVE(&worklist, td, gcle);
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp87 SmallVector<const CFGBlock*, 10> worklist;
88 worklist.push_back(&cfg.getEntry());
90 while (!worklist.empty()) {
91 const CFGBlock *block = worklist.pop_back_val();
99 worklist.push_back(succ);
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIFixSGPRCopies.cpp794 SetVector<const MachineInstr *> worklist;
797 worklist.insert(&MI);
801 while (!worklist.empty()) {
802 const MachineInstr *Instr = worklist.pop_back_val();
812 worklist.insert(UseMI);
894 SIInstrWorklist worklist;
895 worklist.insert(&MI);
896 TII->moveToVALU(worklist, MDT);
1019 // in the Copies worklist.
/freebsd-current/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-current/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyValueInfo.cpp47 // This is the number of worklist items we will process to try to discover an
298 std::vector<BasicBlock*> worklist; local
299 worklist.push_back(OldSucc);
307 // Use a worklist to perform a depth-first search of OldSucc's successors.
311 while (!worklist.empty()) {
312 BasicBlock *ToUpdate = worklist.back();
313 worklist.pop_back();
336 llvm::append_range(worklist, successors(ToUpdate));
438 // push additional values to the worklist and return nullopt. If
1564 // As the worklist onl
[all...]
/freebsd-current/sys/sys/
H A Dbuf.h56 LIST_HEAD(workhead, worklist);
/freebsd-current/usr.sbin/newsyslog/
H A Dnewsyslog.c326 struct cflist *worklist; local
340 worklist = get_worklist(argv);
346 while (!STAILQ_EMPTY(worklist)) {
347 p = STAILQ_FIRST(worklist);
348 STAILQ_REMOVE_HEAD(worklist, cf_nextp);
939 * and adds them to the filelist. Then return the worklist.
965 * then create a new worklist which has only those files in
1029 * add a worklist item based on the default entry.
1048 /* And finally, return a worklist which matches the given files. */
1054 * which match those glob-entries onto the worklist
[all...]
/freebsd-current/sys/kern/
H A Dkern_sig.c666 sigqueue_t worklist; local
671 sigqueue_init(&worklist, NULL);
672 sigqueue_move_set(&p->p_sigqueue, &worklist, set);
675 sigqueue_move_set(&td0->td_sigqueue, &worklist, set);
677 sigqueue_flush(&worklist);
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp375 /// FreshBBs is like worklist, it collected the updated BBs which need
5356 SmallVector<Value *, 8> worklist; local
5358 worklist.push_back(Addr);
5360 // Use a worklist to iteratively look through PHI and select nodes, and
5370 while (!worklist.empty()) {
5371 Value *V = worklist.pop_back_val();
5387 append_range(worklist, P->incoming_values());
5393 worklist.push_back(SI->getFalseValue());
5394 worklist.push_back(SI->getTrueValue());

Completed in 380 milliseconds