Searched refs:Queue (Results 26 - 44 of 44) sorted by relevance

12

/freebsd-10.0-release/sys/dev/isp/
H A DDriverManual.txt152 of 64 byte fixed size Queue Entries to receive normal initiator mode
350 DMA addresses for any command may in fact consume more Request Queue
365 of the Request Queue entry can contain a non-zero handle identifier so
366 that at a later point in time in reading either a Response Queue entry
401 scenario, an interrupt occurs, and present on the Response Queue is a
411 Queue and handled very much like an initiator mode command (i.e., calling
415 to the initial 'response' again onto the Response Queue, whereupon the
/freebsd-10.0-release/contrib/sendmail/src/
H A Dcontrol.c370 free = freediskspace(Queue[qgrp]->qg_qdir, &bsize);
H A Dmain.c1940 usrerr("Queue group %s unknown", queuegroup);
1978 for (j = 0; j < Queue[qgrp]->qg_numqueues; j++)
2225 for (i = 0; i < NumQueue && Queue[i] != NULL;
2227 Queue[i]->qg_nextrun = (time_t) -1;
2228 Queue[qgrp]->qg_nextrun = 0;
2234 (void) run_work_group(Queue[qgrp]->qg_wgrp,
2242 sm_setproctitle(true, CurEnv, "Queue control");
2402 for (i = 0; i < NumQueue && Queue[i] != NULL;
2404 Queue[i]->qg_nextrun = (time_t) -1;
2405 Queue[qgr
[all...]
H A Dsrvrsmtp.c3093 usrerr("459 4.5.4 Queue %s unknown",
3097 for (i = 0; i < NumQueue && Queue[i] != NULL;
3099 Queue[i]->qg_nextrun = (time_t) -1;
3100 Queue[qgrp]->qg_nextrun = 0;
3101 ok = run_work_group(Queue[qgrp]->qg_wgrp,
3238 "Send Queue=");
H A Dsendmail.h503 ** Queue group definition structure.
531 short qg_index; /* queue number internally, index in Queue[] */
1979 ** Queue related items
2028 /* Queue Run Limitations */
2065 EXTERN QUEUEGRP *Queue[MAXQUEUEGROUPS + 1]; /* queue groups */ variable
H A Dconf.c3401 if (pickqdir(Queue[i], msize, e) < 0)
/freebsd-10.0-release/sys/dev/msk/
H A Dif_mskreg.h507 #define B3_RI_WTO_R1 0x0190 /* 8 bit WR Timeout Queue R1 (TO0) */
508 #define B3_RI_WTO_XA1 0x0191 /* 8 bit WR Timeout Queue XA1 (TO1) */
509 #define B3_RI_WTO_XS1 0x0192 /* 8 bit WR Timeout Queue XS1 (TO2) */
510 #define B3_RI_RTO_R1 0x0193 /* 8 bit RD Timeout Queue R1 (TO3) */
511 #define B3_RI_RTO_XA1 0x0194 /* 8 bit RD Timeout Queue XA1 (TO4) */
512 #define B3_RI_RTO_XS1 0x0195 /* 8 bit RD Timeout Queue XS1 (TO5) */
513 #define B3_RI_WTO_R2 0x0196 /* 8 bit WR Timeout Queue R2 (TO6) */
514 #define B3_RI_WTO_XA2 0x0197 /* 8 bit WR Timeout Queue XA2 (TO7) */
515 #define B3_RI_WTO_XS2 0x0198 /* 8 bit WR Timeout Queue XS2 (TO8) */
516 #define B3_RI_RTO_R2 0x0199 /* 8 bit RD Timeout Queue R
[all...]
/freebsd-10.0-release/usr.sbin/ppp/
H A Dipcp.c495 memset(ipcp->Queue, '\0', sizeof ipcp->Queue);
1435 for (q = ipcp->Queue; q < ipcp->Queue + IPCP_QUEUES(ipcp); q++)
1462 queue = ipcp->Queue + IPCP_QUEUES(ipcp) - 1;
1479 } while (queue-- != ipcp->Queue);
H A Dmp.c265 memset(mp->link.Queue, '\0', sizeof mp->link.Queue);
334 memset(mp->link.Queue, '\0', sizeof mp->link.Queue);
H A Dphysical.c183 memset(p->link.Queue, '\0', sizeof p->link.Queue);
593 memset(p->link.Queue, '\0', sizeof p->link.Queue);
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1622 std::vector<SUnit*> Queue;
1698 bool empty() const { return Queue.empty(); }
1703 Queue.push_back(U);
1707 assert(!Queue.empty() && "Queue is empty!");
1709 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(),
1711 if (I != prior(Queue.end()))
1712 std::swap(*I, Queue.back());
1713 Queue
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaLookup.cpp1312 SmallVector<NamespaceDecl*, 8> Queue; local
1319 Queue.push_back(ND);
1332 while (!Queue.empty()) {
1333 NamespaceDecl *ND = Queue.back();
1334 Queue.pop_back();
1368 Queue.push_back(Nom);
1971 SmallVector<const Type *, 16> Queue; local
2043 Queue.push_back(Arg->getTypePtr());
2064 // Queue up the class type into which this points.
2065 Queue
[all...]
H A DSemaAccess.cpp285 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack local
313 Queue.push_back(RD);
316 if (Queue.empty()) break;
318 Derived = Queue.back();
319 Queue.pop_back();
H A DSemaDeclCXX.cpp1203 SmallVector<const CXXRecordDecl*, 8> Queue; local
1221 Queue.push_back(Base);
1224 if (Queue.empty())
1227 Current = Queue.back();
1228 Queue.pop_back();
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp82 std::priority_queue<std::pair<unsigned, unsigned> > Queue; member in class:__anon2201::RAGreedy
419 Queue.push(std::make_pair(Prio, ~Reg));
423 if (Queue.empty())
425 LiveInterval *LI = &LIS->getInterval(~Queue.top().second);
426 Queue.pop();
H A DMachineScheduler.cpp313 for (unsigned i = 0, e = Queue.size(); i < e; ++i)
314 dbgs() << Queue[i]->NodeNum << " ";
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/
H A DExprConstant.cpp5217 SmallVector<Job, 16> Queue;
5241 while (!Queue.empty())
5285 Queue.resize(Queue.size()+1);
5286 Queue.back().E = E;
5287 Queue.back().Kind = Job::AnyExprKind;
5524 Job &job = Queue.back();
5537 Queue.pop_back();
5545 Queue.pop_back();
5561 Queue
[all...]
/freebsd-10.0-release/sys/dev/mps/mpi/
H A Dmpi2_history.txt276 * depth for the Reply Descriptor Post Queue.
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DSROA.cpp3082 /// Queue of pointer uses to analyze and potentially rewrite.
3083 SmallVector<Use *, 8> Queue;
3101 while (!Queue.empty()) {
3102 U = Queue.pop_back_val();
3115 Queue.push_back(&UI.getUse());

Completed in 409 milliseconds

12