if (dataQueue) {
if (!dataQueue->initWithCapacity(size)) {
dataQueue->release();
- dataQueue = 0;
+ dataQueue = NULL;
}
}
if (dataQueue) {
if (!dataQueue->initWithEntries(numEntries, entrySize)) {
dataQueue->release();
- dataQueue = 0;
+ dataQueue = NULL;
}
}
((IODataQueueInternal *)notifyMsg)->queueSize = size;
dataQueue = (IODataQueueMemory *)IOMallocAligned(allocSize, PAGE_SIZE);
- if (dataQueue == 0) {
+ if (dataQueue == NULL) {
return false;
}
bzero(dataQueue, allocSize);
entry = (IODataQueueEntry *)((UInt8 *)dataQueue->queue + tail);
entry->size = dataSize;
- memcpy(&entry->data, data, dataSize);
+ __nochk_memcpy(&entry->data, data, dataSize);
// The tail can be out of bound when the size of the new entry
// exactly matches the available space at the end of the queue.
((IODataQueueEntry *)((UInt8 *)dataQueue->queue + tail))->size = dataSize;
}
- memcpy(&dataQueue->queue->data, data, dataSize);
+ __nochk_memcpy(&dataQueue->queue->data, data, dataSize);
newTail = entrySize;
} else {
return false; // queue is full
entry = (IODataQueueEntry *)((UInt8 *)dataQueue->queue + tail);
entry->size = dataSize;
- memcpy(&entry->data, data, dataSize);
+ __nochk_memcpy(&entry->data, data, dataSize);
newTail = tail + entrySize;
} else {
return false; // queue is full
IOMemoryDescriptor *
IODataQueue::getMemoryDescriptor()
{
- IOMemoryDescriptor *descriptor = 0;
+ IOMemoryDescriptor *descriptor = NULL;
UInt32 queueSize;
queueSize = ((IODataQueueInternal *) notifyMsg)->queueSize;
- if (dataQueue != 0) {
+ if (dataQueue != NULL) {
descriptor = IOMemoryDescriptor::withAddress(dataQueue, queueSize + DATA_QUEUE_MEMORY_HEADER_SIZE, kIODirectionOutIn);
}