/haiku-fatelf/src/add-ons/tracker/zipomatic/ |
H A D | GenericThread.h | 13 int32 priority = B_NORMAL_PRIORITY,
|
H A D | GenericThread.cpp | 15 GenericThread::GenericThread(const char* thread_name, int32 priority, argument 19 fThreadId(spawn_thread(_ThreadFunction, thread_name, priority, this)), 388 return threadInfo.priority;
|
/haiku-fatelf/src/libs/compat/freebsd_network/ |
H A D | taskqueue.c | 136 _taskqueue_start_threads(struct taskqueue **taskQueue, int count, int priority, argument 166 priority, tq); 189 taskqueue_start_threads(struct taskqueue **taskQueue, int count, int priority, argument 207 result = _taskqueue_start_threads(taskQueue, count, priority, name);
|
/haiku-fatelf/src/system/kernel/device_manager/ |
H A D | IOSchedulerSimple.h | 49 int32 priority) const;
|
/haiku-fatelf/headers/os/app/ |
H A D | Looper.h | 32 int32 priority = B_NORMAL_PRIORITY, 125 BLooper(int32 priority, port_id port, 136 void _InitData(const char* name, int32 priority, int32 capacity);
|
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/functional/threads/pi_test/ |
H A D | pitest-1.c | 10 * one. TFs are used to keep busy these CPUs, which have priority 3. A 11 * TL thread with lower priority 1 is created, which locks a mutex and 12 * does workload. A TB thread with higher priority 4 is created and try 13 * to lock TL's mutex. A TP thread with priority 2 is created to reflect the 14 * priority change of TL. Main thread has the highest priority 6, which will 17 * priority 5. 26 * 4. Create 1 TB thread to lock the mutex. TL's priority will boost to 27 * TB's priority, which will cause TP having no chance to run. 28 * 5. TB timeout from the lock, TL's priority wil 58 int priority; member in struct:thread_param [all...] |
H A D | pitest-5.c | 11 * one. TFs are used to keep busy these CPUs, which have priority 3. A 12 * TL thread with lower priority 1 is created, which locks a mutex and 13 * does workload. A TB thread with higher priority 4 is created and try 14 * to lock TL's mutex. A TP thread with priority 2 is created to reflect the 15 * priority change of TL. Main thread has the highest priority 6, which will 18 * with priority 5. 27 * 4. Create 1 TB thread to lock the mutex. TL's priority will boost to 28 * TB's priority, which will cause TP having no chance to run. 29 * 5. TL will unlock the mutex, TL's priority wil 59 int priority; member in struct:thread_param [all...] |
H A D | pitest-6.c | 11 * one. TFs are used to keep busy these CPUs, which have priority 3. A 12 * TL thread with lower priority 1 is created, which locks a mutex and 13 * does workload. A TB thread with higher priority 4 is created and try 14 * to lock TL's mutex. A TP thread with priority 2 is created to reflect the 15 * priority change of TL. Main thread has the highest priority 6, which will 18 * priority 5. 27 * 4. Create 1 TB thread to lock the mutex. TL's priority will boost to 28 * TB's priority, which will cause TP having no chance to run. 29 * 5. Set TB's prioirty to 1, TL's priority wil 57 int priority; member in struct:thread_param [all...] |
H A D | pitest-2.c | 11 * one. TFs are used to keep busy these CPUs, which have priority 3. A 12 * TL thread with lower priority 1 is created, which locks a mutex and 13 * does workload. One TB1 and one TB2 thread with higher priority 4, 6 are 14 * created and try to lock TL's mutex. One TP1 and one TP2 thread with priority 15 * 2, 5 are created to reflect the priority change of TL. Main thread 16 * has the highest priority 8, which will control the running steps of 18 * another thread to collect the sample data with priority 7. 27 * 4. Create 1 TB1 thread with higher priority than TP1 to lock the mutex. 28 * TL's priority will boost to TB1's priority, whic 59 int priority; member in struct:thread_param [all...] |
H A D | pitest-3.c | 11 * one. TFs are used to keep busy these CPUs, which have priority 3. A 12 * TL thread with lower priority 1 is created, which locks 2 mutex and 13 * does workload. A TB1 thread with high priority 4 is created and try 14 * to lock mutex1 of TL. A TB2 thread with high priority 6 is created and 15 * try to lock mutex2 of TL. TL's priority should boost to TB2's priority. 17 * priority change of TL, P(TP1)<P(TB1)<P(TP2)<P(TB2), P(TH) stands for 18 * the priority of TH thread. Main thread has the highest priority 8, 21 * the sample data with priority 60 int priority; member in struct:thread_param [all...] |
H A D | pitest-4.c | 11 * one. TFs are used to keep busy these CPUs, which have priority 4. A 12 * TL thread with priority 1 is created, which locks mutex1 and 13 * does workload. A TB1 thread with higher priority 2 is created and try 15 * with high priority 5 is created and try to lock mutex2 of TB1. Then TB's 16 * priority will boost to TB2's, and TL's priority will boost to TB1's. 18 * priority change of TL, P(TB1)<P(TL)<P(TP)<P(TB2), P(TH) stands for 19 * the priority of TH thread. Main thread has the highest priority 8, 22 * the sample data with priority 61 int priority; member in struct:thread_param [all...] |
/haiku-fatelf/src/bin/gdb/opcodes/ |
H A D | ia64-opc.c | 354 priority. */ 471 short priority = -1; 484 priority = ia64_dis_names[disent].priority; 487 && priority > found_priority) 504 found_priority = priority; 463 short priority = -1; local
|
/haiku-fatelf/src/kits/app/ |
H A D | Looper.cpp | 108 BLooper::BLooper(const char* name, int32 priority, int32 portCapacity) argument 111 _InitData(name, priority, portCapacity); 180 int32 priority; local 181 if (data->FindInt32("_prio", &priority) != B_OK) 182 priority = B_NORMAL_PRIORITY; 184 _InitData(Name(), priority, portCapacity); local 212 status = data->AddInt32("_prio", threadInfo.priority); 811 BLooper::BLooper(int32 priority, port_id port, const char* name) argument 815 _InitData(name, priority, B_LOOPER_PORT_DEFAULT_CAPACITY); 933 BLooper::_InitData(const char *name, int32 priority, int3 argument [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/partitioning_systems/ |
H A D | PartitioningSystemsTest.cpp | 151 float priority = moduleInfo->identify_partition(fd, data, &cookie); local 153 printf("%s: %g\n", name, priority); 155 if (priority >= 0) {
|
/haiku-fatelf/src/add-ons/media/plugins/avi_reader/libOpenDML/ |
H A D | avi.h | 78 uint16 priority; member in struct:avi_stream_header
|
/haiku-fatelf/src/apps/processcontroller/ |
H A D | ThreadBarMenu.cpp | 121 PriorityMenu* prio = new PriorityMenu(info.thread, info.priority);
|
/haiku-fatelf/src/bin/ |
H A D | renice.c | 24 /usr/sbin/renice [-n increment] [-p] [-g | -u] ID ... /usr/sbin/renice priority [-p] pid ... [-g pgrp ...] [-u user ...] 37 prio is locked into one pid, then the priority. 50 // returns an equivalent UNIX priority for a given BeOS priority. 58 // returns an equivalent BeOS priority for a given UNIX priority. 72 prio = thinfo.priority; 99 prio = NZERO; // default UNIX priority for nice 146 puts(" -n : adds increment to the current priority instead of assigning it");
|
/haiku-fatelf/src/preferences/mail/ |
H A D | DNSQuery.h | 16 uint16 priority; member in struct:mx_record
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/ |
H A D | stub.c | 159 spawn_thread(thread_func func, const char *name, int32 priority, void *data) argument
|
/haiku-fatelf/headers/private/locale/ |
H A D | LocaleRosterData.h | 131 const BString& path, uint8 priority);
|
/haiku-fatelf/src/system/kernel/vm/ |
H A D | VMCache.cpp | 1055 VMCache::SetMinimalCommitment(off_t commitment, int priority) argument 1072 status = Commit(commitment, priority); 1089 VMCache::Resize(off_t newSize, int priority) argument 1097 status_t status = Commit(newSize - virtual_base, priority); 1192 VMCache::Commit(off_t size, int priority) argument 1466 int priority) 1470 if (priority >= VM_PRIORITY_VIP) 1565 VMCacheFactory::CreateNullCache(int priority, VMCache*& _cache) argument 1569 if (priority >= VM_PRIORITY_VIP) 1464 CreateAnonymousCache(VMCache*& _cache, bool canOvercommit, int32 numPrecommittedPages, int32 numGuardPages, bool swappable, int priority) argument
|
/haiku-fatelf/src/kits/package/ |
H A D | RepositoryInfo.cpp | 32 const char* BRepositoryInfo::kPriorityField = "priority"; 193 = get_driver_parameter(settingsHandle, "priority", NULL, NULL); 311 BRepositoryInfo::SetPriority(uint8 priority) argument 313 fPriority = priority;
|
/haiku-fatelf/src/servers/registrar/mime/ |
H A D | CreateAppMetaMimeThread.cpp | 35 int32 priority, Database *database, BMessenger managerMessenger, 37 : MimeUpdateThread(name, priority, database, managerMessenger, root, 34 CreateAppMetaMimeThread(const char *name, int32 priority, Database *database, BMessenger managerMessenger, const entry_ref *root, bool recursive, int32 force, BMessage *replyee) argument
|
H A D | UpdateMimeInfoThread.cpp | 71 UpdateMimeInfoThread::UpdateMimeInfoThread(const char *name, int32 priority, argument 74 : MimeUpdateThread(name, priority, database, managerMessenger, root,
|
/haiku-fatelf/src/tests/system/kernel/unit/ |
H A D | TestContext.cpp | 116 int32 priority, void* arg) 122 thread_id thread = spawn_kernel_thread(_ThreadEntry, name, priority, 115 SpawnThread(thread_func function, const char* name, int32 priority, void* arg) argument
|