summaryrefslogtreecommitdiffstats
path: root/WebCore/platform/ArrayImpl.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'WebCore/platform/ArrayImpl.cpp')
-rw-r--r--WebCore/platform/ArrayImpl.cpp145
1 files changed, 0 insertions, 145 deletions
diff --git a/WebCore/platform/ArrayImpl.cpp b/WebCore/platform/ArrayImpl.cpp
deleted file mode 100644
index 330120f..0000000
--- a/WebCore/platform/ArrayImpl.cpp
+++ /dev/null
@@ -1,145 +0,0 @@
-/*
- * Copyright (C) 2004 Apple Computer, Inc. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
- * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
- * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-#include "config.h"
-#include "ArrayImpl.h"
-
-#include <limits>
-#include <new>
-#include <stddef.h>
-#include <string.h>
-
-namespace WebCore {
-
-ArrayImpl::ArrayPrivate::ArrayPrivate(size_t pItemSize, size_t pNumItems) :
- numItems(pNumItems),
- itemSize(pItemSize),
- data(pNumItems > 0 ? static_cast<char *>(fastMalloc(itemSize * numItems)) : NULL)
-{
-}
-
-ArrayImpl::ArrayPrivate::~ArrayPrivate()
-{
- fastFree(data);
-}
-
-
-ArrayImpl::ArrayImpl(size_t itemSize, size_t numItems) :
- d(new ArrayPrivate(itemSize, numItems))
-{
-}
-
-ArrayImpl::ArrayImpl(const ArrayImpl &a) :
- d(a.d)
-{
-}
-
-ArrayImpl::~ArrayImpl()
-{
-}
-
-ArrayImpl &ArrayImpl::operator=(const ArrayImpl &a)
-{
- d = a.d;
- return *this;
-}
-
-void *ArrayImpl::data() const
-{
- return d->data;
-}
-
-bool ArrayImpl::resize(size_t newSize)
-{
- if (newSize != d->numItems) {
- char *newData;
-
- if (newSize != 0) {
- size_t maxSize = std::numeric_limits<size_t>::max() / d->itemSize;
- if (newSize > maxSize)
- return false;
- newData = static_cast<char *>(fastRealloc(d->data, newSize * d->itemSize));
- if (!newData)
- return false;
- } else {
- newData = 0;
- fastFree(d->data);
- }
-
- d->data = newData;
- d->numItems = newSize;
- }
-
- return true;
-}
-
-void ArrayImpl::duplicate(const void *data, size_t newSize)
-{
- if (data == NULL) {
- newSize = 0;
- }
-
- if (!d->hasOneRef())
- d = new ArrayPrivate(d->itemSize, newSize);
-
- if (d->numItems != newSize) {
- resize(newSize);
- }
-
- memcpy(d->data, data, newSize * d->itemSize);
-}
-
-void ArrayImpl::detach()
-{
- if (!d->hasOneRef())
- duplicate(d->data, d->numItems);
-}
-
-bool ArrayImpl::fill(const void *item, int numItems)
-{
- if (numItems == -1) {
- numItems = d->numItems;
- }
-
- if ((unsigned)numItems != d->numItems) {
- if (!resize(numItems)) {
- return false;
- }
- }
-
- for (int i = 0; i < numItems; i++) {
- memcpy(&d->data[i * d->itemSize], item, d->itemSize);
- }
-
- return true;
-}
-
-bool ArrayImpl::operator==(const ArrayImpl &a) const
-{
- return d->numItems == a.d->numItems && d->itemSize == a.d->itemSize
- && (d->data == a.d->data || memcmp(d->data, a.d->data, d->itemSize*d->numItems) == 0);
-}
-
-}