Searched refs:DATA_QUEUE_ENTRY_HEADER_SIZE (Results 1 - 3 of 3) sorted by relevance

/xnu-2422.115.4/iokit/Kernel/
H A DIOSharedDataQueue.cpp167 if ((headOffset > UINT32_MAX - DATA_QUEUE_ENTRY_HEADER_SIZE) ||
168 (headOffset + DATA_QUEUE_ENTRY_HEADER_SIZE > queueSize) ||
169 (headOffset + DATA_QUEUE_ENTRY_HEADER_SIZE > UINT32_MAX - headSize) ||
170 (headOffset + headSize + DATA_QUEUE_ENTRY_HEADER_SIZE > queueSize)) {
187 const UInt32 entrySize = dataSize + DATA_QUEUE_ENTRY_HEADER_SIZE;
191 if (dataSize > UINT32_MAX - DATA_QUEUE_ENTRY_HEADER_SIZE) {
227 if ( ( getQueueSize() - tail ) >= DATA_QUEUE_ENTRY_HEADER_SIZE )
293 if ((headOffset > UINT32_MAX - DATA_QUEUE_ENTRY_HEADER_SIZE) ||
294 (headOffset + DATA_QUEUE_ENTRY_HEADER_SIZE > queueSize) ||
296 (headOffset + DATA_QUEUE_ENTRY_HEADER_SIZE > UINT32_MA
[all...]
H A DIODataQueue.cpp107 // Checking overflow for (numEntries + 1)*(entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE):
108 // check (entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE)
109 if ((entrySize > UINT32_MAX - DATA_QUEUE_ENTRY_HEADER_SIZE) ||
112 // check (numEntries + 1)*(entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE)
113 (entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE > UINT32_MAX/(numEntries+1))) {
117 return (initWithCapacity((numEntries + 1) * (DATA_QUEUE_ENTRY_HEADER_SIZE + entrySize)));
135 const UInt32 entrySize = dataSize + DATA_QUEUE_ENTRY_HEADER_SIZE;
139 if (dataSize > UINT32_MAX - DATA_QUEUE_ENTRY_HEADER_SIZE) {
175 if ( ( dataQueue->queueSize - tail ) >= DATA_QUEUE_ENTRY_HEADER_SIZE )
/xnu-2422.115.4/iokit/IOKit/
H A DIODataQueueShared.h77 * @defined DATA_QUEUE_ENTRY_HEADER_SIZE Represents the size of the data queue entry header independent of the actual size of the data in the entry. This is the overhead of each entry in the queue. The total size of an entry is equal to this value plus the size stored in the entry's size field (in IODataQueueEntry).
79 #define DATA_QUEUE_ENTRY_HEADER_SIZE (sizeof(IODataQueueEntry) - 4) macro

Completed in 31 milliseconds