Searched refs:candidate (Results 1 - 25 of 32) sorted by relevance

12

/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/server/
H A DLockable.cpp57 while (LockerCandidate* candidate = fLockerCandidates.First()) {
58 fLockerCandidates.Remove(candidate);
59 candidate->Unblock(false);
84 if (LockerCandidate* candidate = fLockerCandidates.First()) {
85 fLockerCandidates.Remove(candidate);
86 fLockOwner = candidate->GetThread();
88 candidate->Unblock(true);
102 Lockable::QueueLockerCandidate(LockerCandidate* candidate) argument
104 if (!candidate)
107 fLockerCandidates.Insert(candidate);
[all...]
H A DLockable.h38 LockerCandidate* candidate);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/server/
H A DLockable.cpp57 while (LockerCandidate* candidate = fLockerCandidates.GetFirst()) {
58 fLockerCandidates.Remove(candidate);
59 candidate->Unblock(false);
84 if (LockerCandidate* candidate = fLockerCandidates.GetFirst()) {
85 fLockerCandidates.Remove(candidate);
86 fLockOwner = candidate->GetThread();
88 candidate->Unblock(true);
102 Lockable::QueueLockerCandidate(LockerCandidate* candidate) argument
104 if (!candidate)
107 fLockerCandidates.Insert(candidate);
[all...]
H A DLockable.h37 LockerCandidate* candidate);
/haiku-fatelf/src/bin/coreutils/lib/
H A Dhash.c436 is_prime (size_t candidate) argument
441 while (square < candidate && (candidate % divisor))
448 return (candidate % divisor ? true : false);
455 next_prime (size_t candidate) argument
458 if (candidate < 10)
459 candidate = 10;
462 candidate |= 1;
464 while (SIZE_MAX != candidate && !is_prime (candidate))
536 compute_bucket_size(size_t candidate, const Hash_tuning *tuning) argument
586 hash_initialize(size_t candidate, const Hash_tuning *tuning, Hash_hasher hasher, Hash_comparator comparator, Hash_data_freer data_freer) argument
945 hash_rehash(Hash_table *table, size_t candidate) argument
1058 float candidate = local
1136 size_t candidate = local
[all...]
/haiku-fatelf/src/servers/app/stackandtile/
H A DStacking.cpp72 SATWindow* candidate = stackAndTile->GetSATWindow(window); local
73 if (!candidate)
75 if (!parent->StackWindow(candidate))
102 SATWindow* candidate = stackAndTile->GetSATWindow(window); local
103 if (!candidate)
105 if (!group->RemoveWindow(candidate, false))
185 SATWindow* candidate = stackAndTile->GetSATWindow(window); local
186 if (!candidate)
193 reply.Attach<bool>(area->WindowList().HasItem(candidate));
234 // use the upper edge of the candidate windo
[all...]
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dhash.c434 is_prime (size_t candidate) argument
439 while (square < candidate && (candidate % divisor))
446 return (candidate % divisor ? true : false);
453 next_prime (size_t candidate) argument
456 if (candidate < 10)
457 candidate = 10;
460 candidate |= 1;
462 while (!is_prime (candidate))
463 candidate
537 hash_initialize(size_t candidate, const Hash_tuning *tuning, Hash_hasher hasher, Hash_comparator comparator, Hash_data_freer data_freer) argument
818 hash_rehash(Hash_table *table, size_t candidate) argument
959 float candidate = local
1009 size_t candidate = local
[all...]
/haiku-fatelf/src/bin/coreutils/src/
H A Dstdbuf.c154 char *candidate = file_name_concat (dir, arg, NULL); local
155 if (access (candidate, X_OK) == 0)
157 program_path = dir_name (candidate);
158 free (candidate);
161 free (candidate);
/haiku-fatelf/src/system/kernel/
H A Dguarded_heap.cpp293 bool candidate = true; local
297 candidate = false;
302 if (!candidate)
587 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL;
588 candidate = candidate->next) {
590 if (address < candidate->base)
592 if (address >= candidate->base + candidate
[all...]
/haiku-fatelf/src/servers/app/drawing/
H A DBitmapHWInterface.h42 virtual status_t ProposeMode(display_mode* candidate,
H A DViewHWInterface.h42 virtual status_t ProposeMode(display_mode* candidate,
H A DBitmapHWInterface.cpp137 BitmapHWInterface::ProposeMode(display_mode* candidate, const display_mode* low, argument
H A DDWindowHWInterface.h47 virtual status_t ProposeMode(display_mode* candidate,
H A DHWInterface.h94 virtual status_t ProposeMode(display_mode* candidate,
H A DAccelerantHWInterface.h44 virtual status_t ProposeMode(display_mode* candidate,
H A DAccelerantHWInterface.cpp838 AccelerantHWInterface::ProposeMode(display_mode* candidate, argument
841 if (candidate == NULL || _low == NULL || _high == NULL)
854 return fAccProposeDisplayMode(candidate, &low, &high);
H A DViewHWInterface.cpp698 ViewHWInterface::ProposeMode(display_mode* candidate, const display_mode* low, argument
/haiku-fatelf/src/system/libroot/posix/malloc_debug/
H A Dguarded_heap.cpp284 bool candidate = true; local
288 candidate = false;
293 if (!candidate)
668 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL;
669 candidate = candidate->next) {
671 if ((addr_t)address < candidate->base)
673 if ((addr_t)address >= candidate->base + candidate
[all...]
/haiku-fatelf/src/servers/app/drawing/html5/
H A DHTML5HWInterface.h53 virtual status_t ProposeMode(display_mode* candidate,
H A DHTML5HWInterface.cpp480 HTML5HWInterface::ProposeMode(display_mode* candidate, const display_mode* low, argument
/haiku-fatelf/src/servers/app/drawing/remote/
H A DRemoteHWInterface.h50 virtual status_t ProposeMode(display_mode* candidate,
/haiku-fatelf/src/bin/bash/
H A Djobs.c2690 int candidate; local
2707 candidate = NO_JOB;
2710 candidate = job_last_stopped (js.j_current);
2712 if (candidate != NO_JOB)
2714 js.j_previous = candidate;
2726 candidate = RUNNING (js.j_current) ? job_last_running (js.j_current)
2729 if (candidate != NO_JOB)
2731 js.j_previous = candidate;
2750 int candidate; local
2753 candidate
[all...]
/haiku-fatelf/src/add-ons/kernel/network/stack/
H A Droutes.cpp148 net_route_private* candidate = NULL; local
172 if (candidate == NULL) {
173 TRACE(" found candidate: %s, flags %lx\n", AddressString(
175 candidate = route;
186 return candidate;
/haiku-fatelf/src/bin/gdb/gdb/
H A Dcompleter.c319 candidate completion. The loop below removes that leading
/haiku-fatelf/src/system/kernel/debug/
H A Dtracing.cpp1738 tracing_is_entry_valid(AbstractTraceEntry* candidate, bigtime_t entryTime)
1741 if (!sTracingMetaData->IsInBuffer(candidate, sizeof(*candidate)))
1753 if (abstract != candidate && abstract->Time() > entryTime)
1756 return candidate->Time() == entryTime;

Completed in 215 milliseconds

12