| /haiku/headers/private/kernel/util/ |
| H A D | RadixBitmap.h | 46 int32 available; // available slots under us if we are not a leaf member in union:radix_node::__anon1101
|
| /haiku/src/servers/launch/ |
| H A D | NetworkWatcher.h | 17 virtual void NetworkAvailabilityChanged(bool available) = 0;
|
| H A D | Events.cpp | 156 virtual void NetworkAvailabilityChanged(bool available);
668 NetworkAvailableEvent::NetworkAvailabilityChanged(bool available) argument
670 if (available)
|
| /haiku/src/add-ons/kernel/generic/tty/ |
| H A D | line_buffer.cpp | 83 size_t available = buffer.in; local
85 if (length > available)
86 length = available;
94 for (size_t i = 0; i < available; i++) {
|
| /haiku/src/system/kernel/util/ |
| H A D | ring_buffer.cpp | 42 int32 available = buffer->in; local
44 if (length > available)
45 length = available;
244 size_t available = buffer->in; local
246 if (offset >= available || length == 0)
249 if (offset + length > available)
250 length = available - offset;
|
| H A D | RadixBitmap.cpp | 126 node->u.available = big_hint;
238 node->u.available -= count;
239 if (node->big_hint > node->u.available)
240 node->big_hint = node->u.available;
288 node->u.available += count;
|
| /haiku/headers/private/kernel/arch/x86/32/ |
| H A D | descriptors.h | 61 uint32 available : 1; // 20 member in struct:segment_descriptor
132 desc->available = 0; // system available bit is currently not used
154 desc->available = 0; // system available bit is currently not used
|
| /haiku/src/add-ons/kernel/bus_managers/ps2/ |
| H A D | packet_buffer.cpp | 61 size_t available = ring_buffer_readable(buffer->buffer); local
66 return available;
|
| /haiku/headers/private/kernel/arch/x86/64/ |
| H A D | descriptors.h | 39 uint32 available : 1; member in struct:segment_descriptor
|
| /haiku/src/apps/webpositive/tabview/ |
| H A D | TabManager.h | 64 void SetCloseButtonsAvailable(bool available);
|
| H A D | TabManager.cpp | 401 void SetCloseButtonsAvailable(bool available) argument
403 fCloseButtonsAvailable = available;
931 TabManager::SetCloseButtonsAvailable(bool available) argument
933 if (available == fController->CloseButtonsAvailable())
935 fController->SetCloseButtonsAvailable(available);
|
| /haiku/src/kits/media/ |
| H A D | RealtimeAlloc.cpp | 64 size_t available; member in struct:rtm_pool
220 available += freedChunk->CompleteSize();
301 pool->available = pool->max_size - FreeChunk::NextOffset();
354 if (size > pool->available) {
389 pool->available -= size + sizeof(size_t);
509 return pool->available;
|
| /haiku/src/add-ons/kernel/network/stack/ |
| H A D | net_socket.cpp | 485 int available = (int)socket_read_avail(socket); local
486 if (available < 0)
487 available = 0;
491 || user_memcpy(data, &available, sizeof(available))
496 *(int*)data = available;
830 ssize_t available = socket_read_avail(socket); local
831 if ((ssize_t)socket->receive.low_water_mark <= available
832 || available < B_OK)
841 ssize_t available local
[all...] |
| /haiku/src/add-ons/kernel/drivers/input/hid_shared/ |
| H A D | HIDWriter.cpp | 244 size_t available = fBufferAllocated - fBufferUsed;
245 if (length > available) {
|
| /haiku/src/add-ons/kernel/bus_managers/virtio/ |
| H A D | VirtioQueue.cpp | 364 uint16 available = fRing.avail->idx & (fRingSize - 1); local
365 fRing.avail->ring[available] = index;
|
| /haiku/src/add-ons/kernel/bus_managers/acpi/ |
| H A D | NamespaceDump.cpp | 57 size_t available = device->buffer->WritableAmount(); local
58 if (space <= available)
|
| /haiku/src/system/kernel/fs/ |
| H A D | fifo.cpp | 405 // Wait until enough space in the buffer is available.
478 // wait until data are available
1093 int available = (int)inode->BytesAvailable(); local
1098 || user_memcpy(buffer, &available, sizeof(available))
1103 *(int*)buffer = available;
|
| /haiku/src/build/libbe/app/ |
| H A D | Message.cpp | 1205 ssize_t available = MAX_DATA_PREALLOCATION / 2; local
1206 ssize_t size = fHeader->data_size + available;
1214 fDataAvailable = available;
1355 ssize_t available = MAX_FIELD_PREALLOCATION / 2; local
1356 size = (fHeader->field_count + available) * sizeof(field_header);
1364 fFieldsAvailable = available;
|
| /haiku/ |
| H A D | configure | 90 available, they will be used to store hashes for
94 even if they are available.
673 echo "Error: Neither sha256sum nor sha256 seem to be available!" >&2
897 echo "Mac Ports is available at: http://www.macports.org/"
|
| /haiku/src/system/libroot/posix/malloc_debug/ |
| H A D | heap.cpp | 1064 // free pages available
1987 size_t available = info->size - B_PAGE_SIZE
1990 if (available >= newSize) {
1991 // there is enough room available for the newSize
1996 "%" B_PRIuSIZE " available -> new address: %p\n",
1997 newSize, area, available, newAddress));
2005 size_t available = info->size - ((addr_t)info->allocation_base variable
2008 if (available >= newSize) {
2009 // there is enough room available for the newSize
2012 "%" B_PRIuSIZE " available\
[all...] |
| /haiku/src/add-ons/kernel/network/protocols/tcp/ |
| H A D | TCPEndpoint.cpp | 843 // wait until enough space is available
903 ssize_t available; local
906 available = fSendQueue.Free();
908 available = 0;
910 available = EPIPE;
912 TRACE("SendAvailable(): %" B_PRIdSSIZE, available);
914 return available;
1008 // available. So we actually check if there is data, and if so,
1018 TRACE(" ReadData(): %" B_PRIuSIZE " are available.",
1816 // - signal the user that urgent data is available (SIGUR
[all...] |
| /haiku/src/apps/bootmanager/ |
| H A D | bootman.S | 253 ; use code available in stage 1
362 ; Use code available in stage 2
|
| /haiku/src/kits/app/ |
| H A D | Message.cpp | 1613 ssize_t available = MAX_DATA_PREALLOCATION / 2; local
1614 ssize_t size = fHeader->data_size + available;
1623 fDataAvailable = available;
1769 ssize_t available = MAX_FIELD_PREALLOCATION / 2; local
1770 size = (fHeader->field_count + available) * sizeof(field_header);
1778 fFieldsAvailable = available;
2375 // Flag as available
|
| /haiku/src/add-ons/kernel/file_systems/layers/write_overlay/ |
| H A D | write_overlay.cpp | 2316 // TODO: maybe calculate based on available ram
2317 off_t available = 1024 * 1024 * 100 / info->block_size; local
2318 info->total_blocks += available;
2319 info->free_blocks += available;
|
| /haiku/src/system/kernel/ |
| H A D | heap.cpp | 1454 // free pages available
1517 // suggest growing if there is less than 20% of a grow size available
1917 // try public memory, there might be something available
1930 // no memory available
2446 size_t available = info->size - ((addr_t)info->allocation_base local
2449 if (available >= newSize) {
2450 // there is enough room available for the newSize
2452 "available\n", newSize, area, available));
|