Searched refs:available (Results 1 - 25 of 29) sorted by relevance

12

/haiku/headers/private/kernel/util/
H A DRadixBitmap.h46 int32 available; // available slots under us if we are not a leaf member in union:radix_node::__anon1101
/haiku/src/servers/launch/
H A DNetworkWatcher.h17 virtual void NetworkAvailabilityChanged(bool available) = 0;
H A DEvents.cpp156 virtual void NetworkAvailabilityChanged(bool available);
668 NetworkAvailableEvent::NetworkAvailabilityChanged(bool available) argument
670 if (available)
/haiku/src/add-ons/kernel/generic/tty/
H A Dline_buffer.cpp83 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 Dring_buffer.cpp42 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 DRadixBitmap.cpp126 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 Ddescriptors.h61 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 Dpacket_buffer.cpp61 size_t available = ring_buffer_readable(buffer->buffer); local
66 return available;
/haiku/headers/private/kernel/arch/x86/64/
H A Ddescriptors.h39 uint32 available : 1; member in struct:segment_descriptor
/haiku/src/apps/webpositive/tabview/
H A DTabManager.h61 void SetCloseButtonsAvailable(bool available);
H A DTabManager.cpp391 void SetCloseButtonsAvailable(bool available) argument
393 fCloseButtonsAvailable = available;
922 TabManager::SetCloseButtonsAvailable(bool available) argument
924 if (available == fController->CloseButtonsAvailable())
926 fController->SetCloseButtonsAvailable(available);
/haiku/src/libs/libc++/
H A Dstring.cpp361 size_type available = s.size(); local
364 int status = sprintf_like(&s[0], available + 1, fmt, a);
368 if ( used <= available )
373 available = used; // Assume this is advice of how much space we need.
376 available = available * 2 + 1;
377 s.resize(available);
/haiku/src/kits/media/
H A DRealtimeAlloc.cpp64 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/drivers/input/usb_hid/
H A DHIDWriter.cpp244 size_t available = fBufferAllocated - fBufferUsed;
245 if (length > available) {
/haiku/src/add-ons/kernel/network/stack/
H A Dnet_socket.cpp562 int available = (int)socket_read_avail(socket); local
563 if (available < 0)
564 return available;
568 || user_memcpy(data, &available, sizeof(available))
573 *(int*)data = available;
902 ssize_t available = socket_read_avail(socket); local
903 if ((ssize_t)socket->receive.low_water_mark <= available
904 || available < B_OK)
910 ssize_t available local
[all...]
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A DVirtioQueue.cpp362 uint16 available = fRing.avail->idx & (fRingSize - 1); local
363 fRing.avail->ring[available] = index;
/haiku/src/add-ons/kernel/bus_managers/acpi/
H A DNamespaceDump.cpp57 size_t available = device->buffer->WritableAmount(); local
58 if (space <= available)
/haiku/src/system/kernel/fs/
H A Dfifo.cpp405 // Wait until enough space in the buffer is available.
478 // wait until data are available
1097 int available = (int)inode->BytesAvailable(); local
1102 || user_memcpy(buffer, &available, sizeof(available))
1107 *(int*)buffer = available;
/haiku/src/system/libroot/posix/malloc_debug/
H A Dheap.cpp1061 // free pages available
1978 size_t available = info->size - B_PAGE_SIZE
1981 if (available >= newSize) {
1982 // there is enough room available for the newSize
1986 "%ld available -> new address: %p\n", newSize, area,
1987 available, newAddress));
1995 size_t available = info->size - ((addr_t)info->allocation_base variable
1998 if (available >= newSize) {
1999 // there is enough room available for the newSize
2001 "%ld available\
[all...]
/haiku/src/build/libbe/app/
H A DMessage.cpp1205 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/src/add-ons/kernel/network/protocols/tcp/
H A DTCPEndpoint.cpp831 // wait until enough space is available
896 ssize_t available; local
899 available = fSendQueue.Free();
901 available = 0;
903 available = EPIPE;
905 TRACE("SendAvailable(): %" B_PRIdSSIZE, available);
907 return available;
990 // available. So we actually check if there is data, and if so,
1000 TRACE(" ReadData(): %" B_PRIuSIZE " are available.",
1789 // - signal the user that urgent data is available (SIGUR
[all...]
/haiku/
H A Dconfigure87 available, they will be used to store hashes for
91 even if they are available.
642 echo "Error: Neither sha256sum nor sha256 seem to be available!" >&2
844 echo "Mac Ports is available at: http://www.macports.org/"
/haiku/src/kits/app/
H A DMessage.cpp1605 ssize_t available = MAX_DATA_PREALLOCATION / 2; local
1606 ssize_t size = fHeader->data_size + available;
1615 fDataAvailable = available;
1761 ssize_t available = MAX_FIELD_PREALLOCATION / 2; local
1762 size = (fHeader->field_count + available) * sizeof(field_header);
1770 fFieldsAvailable = available;
2367 // Flag as available
/haiku/src/apps/bootmanager/
H A Dbootman.S249 ; use code available in stage 1
358 ; Use code available in stage 2
/haiku/src/system/libnetwork/netresolv/isc/
H A Dctl_srvr.c73 available = 0, initializing, writing, reading, reading_data, enumerator in enum:state
152 "available", "initializing", "writing", "reading",
459 sess->state = available;

Completed in 362 milliseconds

12