Searched refs:enqueue (Results 1 - 25 of 40) sorted by relevance

12

/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/sched/
H A Dtst.enqueue.d32 sched:::enqueue
38 sched:::enqueue
44 sched:::enqueue
/freebsd-9.3-release/contrib/ntp/tests/ntpd/
H A Dntp_prio_q.c67 enqueue(q, e_ptr);
99 enqueue(q, e1_ptr);
100 enqueue(q, e2_ptr);
101 enqueue(q, e3_ptr);
106 enqueue(q, e1_ptr);
112 enqueue(q, e3_ptr);
113 enqueue(q, e2_ptr);
144 enqueue(q, e3_ptr);
145 enqueue(q, e5_ptr);
146 enqueue(
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DWorkList.h67 virtual void enqueue(const WorkListUnit& U) = 0;
69 void enqueue(ExplodedNode *N, const CFGBlock *B, unsigned idx) { function in class:clang::ento::WorkList
70 enqueue(WorkListUnit(N, CurrentCounter, B, idx));
73 void enqueue(ExplodedNode *N) { function in class:clang::ento::WorkList
75 enqueue(WorkListUnit(N, CurrentCounter));
H A DCoreEngine.h169 void enqueue(ExplodedNodeSet &Set);
173 void enqueue(ExplodedNodeSet &Set, const CFGBlock *Block, unsigned Idx);
175 /// \brief enqueue the nodes corresponding to the end of function onto the
/freebsd-9.3-release/sys/sys/
H A Dtaskqueue.h60 taskqueue_enqueue_fn enqueue,
118 #define TASKQUEUE_DEFINE(name, enqueue, context, init) \
126 taskqueue_create(#name, M_WAITOK, (enqueue), (context)); \
142 #define TASKQUEUE_FAST_DEFINE(name, enqueue, context, init) \
150 taskqueue_create_fast(#name, M_WAITOK, (enqueue), \
165 * These queues are serviced by software interrupt handlers. To enqueue
173 * This queue is serviced by a kernel thread. To enqueue a task, call
187 taskqueue_enqueue_fn enqueue,
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp50 virtual void enqueue(const WorkListUnit& U) { function in class:__anon3499::DFS
78 virtual void enqueue(const WorkListUnit& U) { function in class:__anon3499::BFS
116 virtual void enqueue(const WorkListUnit& U) { function in class:__anon3500::BFSBlockDFSContents
303 // This path is done. Don't enqueue any more nodes.
319 enqueue(dstNodes);
461 enqueue(Dst);
473 enqueue(Dst);
507 if (IsNew) WList->enqueue(Node);
519 WList->enqueue(N, Block, Idx);
526 WList->enqueue(
569 void CoreEngine::enqueue(ExplodedNodeSet &Set) { function in class:CoreEngine
576 void CoreEngine::enqueue(ExplodedNodeSet &Set, function in class:CoreEngine
[all...]
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DRegAllocBase.h57 /// live range splitting. They must also override enqueue/dequeue to provide an
83 /// enqueue - Add VirtReg to the priority queue of unassigned registers.
84 virtual void enqueue(LiveInterval *LI) = 0;
H A DRegAllocBase.cpp77 enqueue(&LIS->getInterval(Reg));
143 enqueue(SplitVirtReg);
H A DRegAllocBasic.cpp92 virtual void enqueue(LiveInterval *LI) { function in class:__anon2166::RABasic
/freebsd-9.3-release/contrib/ntp/ntpd/
H A Dntp_prio_q.c149 queue *enqueue( function
221 enqueue(q1, dequeue(q2));
H A Dntpsim.c156 enqueue(event_queue, event(0, BEEP));
157 enqueue(event_queue, event(simulation.sim_time + 1.0, TIMER));
244 enqueue(event_queue,
359 enqueue(event_queue, e);
455 enqueue(recv_queue, rbuf);
472 enqueue(event_queue, event(e->time + simulation.beep_delay, BEEP));
/freebsd-9.3-release/usr.bin/grep/
H A Dqueue.c57 enqueue(struct str *x) function
H A Dgrep.h146 void enqueue(struct str *x);
/freebsd-9.3-release/contrib/ntp/include/
H A Dntp_prio_q.h49 queue *enqueue(queue *my_queue, void *my_node);
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowSolver.h35 /// enqueue - Add a block to the worklist. Blocks already on the
37 void enqueue(const CFGBlock *B) { function in class:clang::DataflowWorkListTy
212 WorkList.enqueue(&**I);
221 WorkList.enqueue(&**I);
327 WorkList.enqueue(TargetBlock);
331 WorkList.enqueue(TargetBlock);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/
H A DReachableCode.cpp44 void enqueue(const CFGBlock *block);
57 void DeadCodeScan::enqueue(const CFGBlock *block) { function in class:DeadCodeScan
126 enqueue(Start);
144 enqueue(predBlock);
/freebsd-9.3-release/sys/netpfil/ipfw/
H A Ddn_sched.h68 * enqueue enqueue packet 'm' on scheduler 's', queue 'q'.
73 * scheduler will normally enqueue m into q, it is ok
115 * need to call the enqueue function. In this case,
116 * the callback should eventually call enqueue() passing
123 int (*enqueue)(struct dn_sch_inst *, struct dn_queue *, member in struct:dn_alg
H A Ddn_sched_fifo.c61 * re-enqueue from an existing scheduler, which we should
108 _SI( .enqueue = ) fifo_enqueue,
H A Ddn_sched_prio.c213 _SI( .enqueue = ) prio_enqueue,
H A Ddn_sched_rr.c293 _SI( .enqueue = ) rr_enqueue,
/freebsd-9.3-release/sys/kern/
H A Dsubr_taskqueue.c112 taskqueue_enqueue_fn enqueue, void *context,
123 queue->tq_enqueue = enqueue;
134 taskqueue_enqueue_fn enqueue, void *context)
136 return _taskqueue_create(name, mflags, enqueue, context,
572 taskqueue_enqueue_fn enqueue, void *context)
574 return _taskqueue_create(name, mflags, enqueue, context,
111 _taskqueue_create(const char *name __unused, int mflags, taskqueue_enqueue_fn enqueue, void *context, int mtxflags, const char *mtxname) argument
133 taskqueue_create(const char *name, int mflags, taskqueue_enqueue_fn enqueue, void *context) argument
571 taskqueue_create_fast(const char *name, int mflags, taskqueue_enqueue_fn enqueue, void *context) argument
/freebsd-9.3-release/sys/netpfil/ipfw/test/
H A Ddn_test.h146 void *enqueue, *dequeue; member in struct:dn_alg
H A Dmain.c7 * iteration, decides whether we can enqueue and/or dequeue.
44 struct mbuf *tosend; /* packet to send -- also flag to enqueue */
120 enqueue(struct cfg_s *c, void *_m) function
161 if (enqueue(c, m)) {
163 ND("loop %d enqueue fail", i );
165 ND("enqueue ok");
442 c->enq = p->enqueue;
/freebsd-9.3-release/contrib/ncurses/ncurses/tinfo/
H A Dcomp_parse.c66 enqueue(ENTRY * ep) function
150 enqueue(&thisentry);
/freebsd-9.3-release/gnu/usr.bin/grep/
H A Dkwset.c284 enqueue (struct tree *tree, struct trie **last) function
288 enqueue(tree->llink, last);
289 enqueue(tree->rlink, last);
426 enqueue(curr->links, &last);

Completed in 137 milliseconds

12