headers/private/debug/DebugLooper.h

59

JobList* fJobs;

headers/private/debugger/util/Worker.h

210

JobTable fJobs;

headers/private/print/Jobs.h

105

BObjectList<Job> fJobs;

headers/private/print/Jobs.h

137

int32 CountJobs() const { return fJobs.CountItems(); }

headers/private/print/Jobs.h

138

Job* JobAt(int i) const { return fJobs.ItemAt(i); }

src/kits/debug/DebugLooper.cpp

137

fJobs(NULL),

src/kits/debug/DebugLooper.cpp

160

if (fJobs == NULL) {

src/kits/debug/DebugLooper.cpp

161

fJobs = new(std::nothrow) JobList;

src/kits/debug/DebugLooper.cpp

162

if (fJobs == NULL)

src/kits/debug/DebugLooper.cpp

282

bool handledJobs = fJobs->Head() != NULL;

src/kits/debug/DebugLooper.cpp

283

while (Job* job = fJobs->RemoveHead())

src/kits/debug/DebugLooper.cpp

343

fJobs->Add(job);

src/kits/debugger/util/Worker.cpp

256

error = fJobs.Init();

src/kits/debugger/util/Worker.cpp

288

Job* job = fJobs.Clear(true);

src/kits/debugger/util/Worker.cpp

324

fJobs.Insert(job);

src/kits/debugger/util/Worker.cpp

339

Job* job = fJobs.Lookup(key);

src/kits/debugger/util/Worker.cpp

351

return fJobs.Lookup(key);

src/kits/debugger/util/Worker.cpp

378

return !fJobs.IsEmpty();

src/kits/debugger/util/Worker.cpp

387

Job* job = fJobs.Lookup(key);

src/kits/debugger/util/Worker.cpp

400

if (Job* job = fJobs.Lookup(key))

src/kits/debugger/util/Worker.cpp

414

Job* job = fJobs.Lookup(key);

src/kits/debugger/util/Worker.cpp

546

fJobs.Remove(job);

src/kits/debugger/util/Worker.cpp

586

fJobs.Remove(job);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1317

if (fJobs == NULL || fSolver == NULL)

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1320

int problemCount = solver_solve(fSolver, fJobs);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1338

for (int i = 0; i < fJobs->count; i += 2)

src/kits/package/solver/libsolv/LibsolvSolver.cpp

1339

fJobs->elements[i] |= solverMode;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

180

fJobs(NULL),

src/kits/package/solver/libsolv/LibsolvSolver.cpp

334

return _GetFoundPackages(*fJobs, flags, _packages);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

423

queue_push2(fJobs, SOLVER_SOLVABLE_ALL, 0);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

434

for (int i = 0; i < fJobs->count; i += 2) {

src/kits/package/solver/libsolv/LibsolvSolver.cpp

436

if (pool_isemptyupdatejob(fPool, fJobs->elements[i],

src/kits/package/solver/libsolv/LibsolvSolver.cpp

437

fJobs->elements[i + 1])) {

src/kits/package/solver/libsolv/LibsolvSolver.cpp

438

fJobs->elements[i] &= ~SOLVER_JOBMASK;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

439

fJobs->elements[i] |= SOLVER_INSTALL;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

462

queue_push2(fJobs, SOLVER_SOLVABLE_ALL, 0);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

488

queue_push2(fJobs, SOLVER_SOLVABLE_ALL, 0);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

525

if (fSolver == NULL || fJobs == NULL)

src/kits/package/solver/libsolv/LibsolvSolver.cpp

533

solver_take_solution(fSolver, problem->Id(), solution->Id(), fJobs);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

643

fJobs = new(std::nothrow) SolvQueue;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

644

return fJobs != NULL ? B_OK : B_NO_MEMORY;;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

697

delete fJobs;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

698

fJobs = NULL;

src/kits/package/solver/libsolv/LibsolvSolver.cpp

847

queue_push2(fJobs, SOLVER_SOLVABLE, solvableId);

src/kits/package/solver/libsolv/LibsolvSolver.cpp

889

queue_push(fJobs, matchingPackages.elements[j]);

src/kits/package/solver/libsolv/LibsolvSolver.h

131

SolvQueue* fJobs;

src/kits/print/Jobs.cpp

172

fJobs.AddItem(job);

src/kits/print/Jobs.cpp

184

for (int i = 0; i < fJobs.CountItems(); i ++) {

src/kits/print/Jobs.cpp

185

Job* job = fJobs.ItemAt(i);

src/kits/print/Jobs.cpp

195

fJobs.SortItems(AscendingByTime);

src/kits/print/Jobs.cpp

204

fJobs.RemoveItem(job);

src/kits/print/Jobs.cpp

229

fJobs.SortItems(AscendingByTime);

src/kits/print/Jobs.cpp

249

for (int i = 0; i < fJobs.CountItems(); i ++) {

src/kits/print/Jobs.cpp

250

Job* job = fJobs.ItemAt(i);

src/kits/print/Jobs.cpp

257

for (int i = 0; i < fJobs.CountItems(); i ++) {

src/kits/print/Jobs.cpp

258

Job* job = fJobs.ItemAt(i);

src/kits/storage/disk_device/DiskDeviceJobQueue.cpp

23

: fJobs(20)

src/kits/storage/disk_device/DiskDeviceJobQueue.cpp

41

return fJobs.AddItem(job) ? B_OK : B_NO_MEMORY;

src/kits/storage/disk_device/DiskDeviceJobQueue.cpp

49

int32 count = fJobs.CountItems();

src/kits/storage/disk_device/DiskDeviceJobQueue.cpp

51

DiskDeviceJob* job = fJobs.ItemAt(i);

src/kits/storage/disk_device/DiskDeviceJobQueue.h

30

JobList fJobs;

src/servers/launch/LaunchDaemon.cpp

1224

for (JobMap::iterator iterator = fJobs.begin(); iterator != fJobs.end();

src/servers/launch/LaunchDaemon.cpp

1266

JobMap::const_iterator iterator = fJobs.begin();

src/servers/launch/LaunchDaemon.cpp

1267

for (; iterator != fJobs.end(); iterator++) {

src/servers/launch/LaunchDaemon.cpp

1511

for (JobMap::iterator iterator = fJobs.begin();

src/servers/launch/LaunchDaemon.cpp

1512

iterator != fJobs.end();) {

src/servers/launch/LaunchDaemon.cpp

1517

fJobs.erase(remove);

src/servers/launch/LaunchDaemon.cpp

1633

fJobs.insert(std::make_pair(job->Title(), job));

src/servers/launch/LaunchDaemon.cpp

1644

for (JobMap::iterator iterator = fJobs.begin(); iterator != fJobs.end();) {

src/servers/launch/LaunchDaemon.cpp

1674

fJobs.erase(remove);

src/servers/launch/LaunchDaemon.cpp

1701

for (JobMap::iterator iterator = fJobs.begin(); iterator != fJobs.end();

src/servers/launch/LaunchDaemon.cpp

1718

for (JobMap::reverse_iterator iterator = fJobs.rbegin();

src/servers/launch/LaunchDaemon.cpp

1719

iterator != fJobs.rend(); iterator++) {

src/servers/launch/LaunchDaemon.cpp

1968

for (JobMap::iterator iterator = fJobs.begin(); iterator != fJobs.end();

src/servers/launch/LaunchDaemon.cpp

237

JobMap fJobs;

src/servers/launch/LaunchDaemon.cpp

395

JobMap::const_iterator found = fJobs.find(BString(name).ToLower());

src/servers/launch/LaunchDaemon.cpp

396

if (found != fJobs.end())

src/servers/launch/LaunchDaemon.cpp

800

for (JobMap::iterator iterator = fJobs.begin();

src/servers/launch/LaunchDaemon.cpp

801

iterator != fJobs.end();) {

src/servers/launch/LaunchDaemon.cpp

809

fJobs.insert(std::make_pair(copy->Name(), copy));

src/servers/package/JobQueue.cpp

110

for (JobList::Iterator it = fJobs.GetIterator(); Job* job = it.Next();) {

src/servers/package/JobQueue.cpp

22

fJobs(),

src/servers/package/JobQueue.cpp

32

while (Job* job = fJobs.RemoveHead())

src/servers/package/JobQueue.cpp

79

fJobs.Add(job);

src/servers/package/JobQueue.cpp

93

Job* job = fJobs.RemoveHead();

src/servers/package/JobQueue.h

43

JobList fJobs;