Searched refs:priority (Results 101 - 125 of 161) sorted by relevance

1234567

/haiku/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp153 float priority = moduleInfo->identify_partition(fd, data, &cookie); local
155 printf("%s: %g\n", name, priority);
157 if (priority >= 0) {
/haiku/src/preferences/mail/
H A DDNSQuery.h16 uint16 priority; member in struct:mx_record
H A DDNSQuery.cpp370 mxRec->priority, mxRec->serverName.String());
461 buffer.ReadUint16(mxRecord->priority);
/haiku/headers/private/locale/
H A DLocaleRosterData.h132 const BString& path, uint8 priority);
/haiku/src/libs/compat/freebsd_network/compat/sys/
H A Dparam.h17 #include <sys/priority.h>
/haiku/src/bin/
H A Drenice.c24 /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");
H A Dps.c105 threadInfo.priority, (threadInfo.user_time / 1000),
/haiku/src/apps/processcontroller/
H A DThreadBarMenu.cpp107 PriorityMenu* prio = new PriorityMenu(info.thread, info.priority);
/haiku/src/tests/system/kernel/unit/
H A DTestContext.cpp116 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
H A DTestContext.h51 const char* name, int32 priority,
/haiku/src/kits/package/solver/
H A DSolverRepository.cpp239 BSolverRepository::SetPriority(int32 priority) argument
241 fPriority = priority;
/haiku/src/bin/pkgman/
H A Dcommand_resolve_dependencies.cpp37 " %command% <package> ... <repository> [ <priority> ] ...\n"
41 "Usage: %program% %command% <package> ... <repository> [ <priority> ] ...\n"
58 " <priority>\n"
59 " Can follow a <repository> to specify the priority of that\n"
60 " repository. The default priority is 0.\n"
189 long priority = strtol(repositoryDirectories[i + 1], &end, 0); local
191 repository->SetPriority((uint8)priority);
/haiku/src/system/kernel/device_manager/
H A Dlegacy_drivers.cpp103 int32 priority; member in struct:__anon1::legacy_driver
589 int32 priority = get_priority(path); local
609 //dprintf("new driver has priority %ld, old %ld\n", priority, driver->priority);
610 if (priority >= driver->priority) {
642 driver->priority = priority;
732 else if (get_priority(event->path) >= driver->priority)
[all...]
/haiku/src/apps/debuganalyzer/model_loader/
H A DModelLoader.cpp983 if (thread->priority == 0)
992 if (thread->priority == 0)
1065 thread->priority = event->priority;
1084 // This really only happens when the thread priority is changed
1091 if (thread->priority == 0)
1236 // TODO: The priority is missing from the system_profiler_thread_added
1239 info->priority = 0;
1241 info->priority = B_NORMAL_PRIORITY;
/haiku/headers/os/media/
H A DMediaEventLooper.h83 // NOTE: Use the priority constants from OS.h or suggest_thread_priority
84 // from scheduler.h. The passed priority will be clamped to be in range 5
86 status_t SetPriority(int32 priority);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/
H A Dkernel_emu.h79 long priority, void *arg);
/haiku/src/servers/syslog_daemon/
H A Dsyslog_output.cpp132 int facility = SYSLOG_FACILITY_INDEX(message.priority);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dbeos_kernel_emu.cpp400 long priority, void *arg)
403 priority, arg);
399 spawn_kernel_thread(thread_entry function, const char *threadName, long priority, void *arg) argument
/haiku/src/kits/storage/mime/
H A DAssociatedTypes.cpp116 float priority = fMimeSniffer->GuessMimeType(filename, &mimeType); local
117 if (priority >= 0) {
/haiku/src/kits/package/
H A DRepositoryInfo.cpp37 const char* const BRepositoryInfo::kPriorityField = "priority";
244 BRepositoryInfo::SetPriority(uint8 priority) argument
246 fPriority = priority;
381 "priority", NULL, NULL);
/haiku/src/system/kernel/disk_device_manager/
H A DKDiskDeviceManager.cpp1408 // find the disk system that returns the best priority for this partition
1421 float priority = diskSystem->Identify(partition, &cookie); local
1423 TRACE(" returned: %g\n", priority);
1425 if (priority >= 0 && priority > bestPriority) {
1431 bestPriority = priority;
1437 if (priority >= 0)
/haiku/src/system/kernel/vm/
H A DVMAnonymousCache.cpp583 VMAnonymousCache::Resize(off_t newSize, int priority) argument
592 return VMCache::Resize(newSize, priority);
597 VMAnonymousCache::Rebase(off_t newBase, int priority) argument
605 return VMCache::Rebase(newBase, priority);
720 VMAnonymousCache::Commit(off_t size, int priority) argument
737 return _Commit(size, priority);
993 int priority = aspace == VMAddressSpace::Kernel() local
995 if (vm_try_reserve_memory(B_PAGE_SIZE, priority, 0) != B_OK) {
1145 VMAnonymousCache::_Commit(off_t size, int priority) argument
1196 if (vm_try_reserve_memory(toReserve, priority, 100000
[all...]
/haiku/src/apps/webpositive/
H A DURLInputGroup.cpp44 int32 matchPos, int32 matchLen, int32 priority)
47 fPriority(priority)
85 int32 priority = INT_MAX; local
96 priority--;
98 priority = INT_MAX;
101 choiceText, matchPos, pattern.Length(), priority));
43 URLChoice(const BString& choiceText, const BString& displayText, int32 matchPos, int32 matchLen, int32 priority) argument
/haiku/src/libs/compat/freebsd_network/
H A Dfbsd_subr_taskqueue.c106 int priority, task_fn_t func, void *context)
109 TASK_INIT(&timeout_task->t, priority, func, context);
212 * Optimise the case when all tasks have the same priority.
105 _timeout_task_init(struct taskqueue *queue, struct timeout_task *timeout_task, int priority, task_fn_t func, void *context) argument
/haiku/src/system/kernel/
H A Dsignal.cpp73 int32 priority; member in struct:__anon174
139 {"CONTINUE_THREAD", 0} // priority must be <= that of SIGSTOP
334 return kSignalInfos[fNumber].priority;
372 /*! Of the signals in \a nonBlocked returns the priority of that with the
373 highest priority.
375 \return The priority of the highest priority non-blocked signal, or, if all
405 // queue according to priority
406 int32 priority = signal->Priority(); local
410 if (priority > otherSigna
527 int32 priority = kSignalInfos[signal].priority; local
[all...]

Completed in 264 milliseconds

1234567