Searched refs:fJobs (Results 1 - 13 of 13) sorted by relevance
| /haiku/src/kits/storage/disk_device/ |
| H A D | DiskDeviceJobQueue.cpp | 23 : fJobs(20, true)
41 return fJobs.AddItem(job) ? B_OK : B_NO_MEMORY;
49 int32 count = fJobs.CountItems();
51 DiskDeviceJob* job = fJobs.ItemAt(i);
|
| H A D | DiskDeviceJobQueue.h | 30 JobList fJobs; member in class:BPrivate::DiskDeviceJobQueue
|
| /haiku/src/servers/package/ |
| H A D | JobQueue.cpp | 22 fJobs(),
32 while (Job* job = fJobs.RemoveHead())
79 fJobs.Add(job);
93 Job* job = fJobs.RemoveHead();
110 for (JobList::Iterator it = fJobs.GetIterator(); Job* job = it.Next();) {
|
| H A D | JobQueue.h | 43 JobList fJobs; member in class:JobQueue
|
| /haiku/src/kits/print/ |
| H A D | Jobs.cpp | 172 fJobs.AddItem(job);
184 for (int i = 0; i < fJobs.CountItems(); i ++) {
185 Job* job = fJobs.ItemAt(i);
195 fJobs.SortItems(AscendingByTime);
204 fJobs.RemoveItem(job);
229 fJobs.SortItems(AscendingByTime);
236 , fJobs()
249 for (int i = 0; i < fJobs.CountItems(); i ++) {
250 Job* job = fJobs.ItemAt(i);
257 for (int i = 0; i < fJobs
[all...] |
| /haiku/src/kits/debugger/util/ |
| H A D | Worker.cpp | 256 error = fJobs.Init();
288 Job* job = fJobs.Clear(true);
324 fJobs.Insert(job);
339 Job* job = fJobs.Lookup(key);
351 return fJobs.Lookup(key);
378 return !fJobs.IsEmpty();
387 Job* job = fJobs.Lookup(key);
400 if (Job* job = fJobs.Lookup(key))
414 Job* job = fJobs.Lookup(key);
539 fJobs
[all...] |
| /haiku/src/kits/debug/ |
| H A D | DebugLooper.cpp | 137 fJobs(NULL),
160 if (fJobs == NULL) {
161 fJobs = new(std::nothrow) JobList;
162 if (fJobs == NULL)
282 bool handledJobs = fJobs->Head() != NULL;
283 while (Job* job = fJobs->RemoveHead())
343 fJobs->Add(job);
|
| /haiku/headers/private/print/ |
| H A D | Jobs.h | 105 BObjectList<Job> fJobs; member in class:Folder
137 int32 CountJobs() const { return fJobs.CountItems(); }
138 Job* JobAt(int i) const { return fJobs.ItemAt(i); }
|
| /haiku/headers/private/debug/ |
| H A D | DebugLooper.h | 59 JobList* fJobs; member in class:BDebugLooper
|
| /haiku/src/kits/package/solver/libsolv/ |
| H A D | LibsolvSolver.cpp | 180 fJobs(NULL),
334 return _GetFoundPackages(*fJobs, flags, _packages);
423 queue_push2(fJobs, SOLVER_SOLVABLE_ALL, 0);
434 for (int i = 0; i < fJobs->count; i += 2) {
436 if (pool_isemptyupdatejob(fPool, fJobs->elements[i],
437 fJobs->elements[i + 1])) {
438 fJobs->elements[i] &= ~SOLVER_JOBMASK;
439 fJobs->elements[i] |= SOLVER_INSTALL;
462 queue_push2(fJobs, SOLVER_SOLVABLE_ALL, 0);
488 queue_push2(fJobs, SOLVER_SOLVABLE_AL
[all...] |
| H A D | LibsolvSolver.h | 131 SolvQueue* fJobs; member in class:LibsolvSolver
|
| /haiku/src/servers/launch/ |
| H A D | LaunchDaemon.cpp | 237 JobMap fJobs; member in class:LaunchDaemon
395 JobMap::const_iterator found = fJobs.find(BString(name).ToLower());
396 if (found != fJobs.end())
800 for (JobMap::iterator iterator = fJobs.begin();
801 iterator != fJobs.end();) {
809 fJobs.insert(std::make_pair(copy->Name(), copy));
1224 for (JobMap::iterator iterator = fJobs.begin(); iterator != fJobs.end();
1266 JobMap::const_iterator iterator = fJobs.begin();
1267 for (; iterator != fJobs
[all...] |
| /haiku/headers/private/debugger/util/ |
| H A D | Worker.h | 210 JobTable fJobs; member in class:Worker
|
Completed in 92 milliseconds