mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
271 lines
7.0 KiB
C++
271 lines
7.0 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
* http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
* for the specific language governing rights and limitations under the
|
|
* License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Jeff Walden <jwalden+code@mit.edu>.
|
|
* Portions created by the Initial Developer are Copyright (C) 2007
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
|
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
#include "TestHarness.h"
|
|
|
|
#include "nsIPipe.h"
|
|
#include "nsIMemory.h"
|
|
|
|
/** NS_NewPipe2 reimplemented, because it's not exported by XPCOM */
|
|
nsresult TP_NewPipe2(nsIAsyncInputStream** input,
|
|
nsIAsyncOutputStream** output,
|
|
PRBool nonBlockingInput,
|
|
PRBool nonBlockingOutput,
|
|
PRUint32 segmentSize,
|
|
PRUint32 segmentCount,
|
|
nsIMemory* segmentAlloc)
|
|
{
|
|
nsCOMPtr<nsIPipe> pipe = do_CreateInstance("@mozilla.org/pipe;1");
|
|
if (!pipe)
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
|
|
nsresult rv = pipe->Init(nonBlockingInput,
|
|
nonBlockingOutput,
|
|
segmentSize,
|
|
segmentCount,
|
|
segmentAlloc);
|
|
|
|
if (NS_FAILED(rv))
|
|
return rv;
|
|
|
|
pipe->GetInputStream(input);
|
|
pipe->GetOutputStream(output);
|
|
return NS_OK;
|
|
}
|
|
|
|
/**
|
|
* Allocator can allocate exactly count * size bytes, stored at mMemory;
|
|
* immediately after the end of this is a byte-map of 0/1 values indicating
|
|
* which <size>-byte locations in mMemory are empty and which are filled.
|
|
* Pretty stupid, but enough to test bug 394692.
|
|
*/
|
|
class BackwardsAllocator : public nsIMemory
|
|
{
|
|
public:
|
|
BackwardsAllocator()
|
|
: mMemory(0),
|
|
mIndex(0xFFFFFFFF),
|
|
mCount(0xFFFFFFFF),
|
|
mSize(0)
|
|
{ }
|
|
~BackwardsAllocator()
|
|
{
|
|
delete [] mMemory;
|
|
}
|
|
|
|
nsresult Init(PRUint32 count, size_t size);
|
|
|
|
NS_DECL_ISUPPORTS
|
|
NS_DECL_NSIMEMORY
|
|
|
|
private:
|
|
PRUint32 previous(PRUint32 i)
|
|
{
|
|
if (i == 0)
|
|
return mCount - 1;
|
|
return i - 1;
|
|
}
|
|
|
|
private:
|
|
PRUint8* mMemory;
|
|
PRUint32 mIndex;
|
|
PRUint32 mCount;
|
|
size_t mSize;
|
|
};
|
|
|
|
NS_IMPL_ISUPPORTS1(BackwardsAllocator, nsIMemory)
|
|
|
|
nsresult BackwardsAllocator::Init(PRUint32 count, size_t size)
|
|
{
|
|
if (mMemory)
|
|
{
|
|
fail("allocator already initialized!");
|
|
return NS_ERROR_ALREADY_INITIALIZED;
|
|
}
|
|
|
|
mMemory = new PRUint8[count * size + count];
|
|
if (!mMemory)
|
|
{
|
|
fail("failed to allocate mMemory!");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
memset(mMemory, 0, count * size + count);
|
|
|
|
mIndex = 0;
|
|
mCount = count;
|
|
mSize = size;
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMETHODIMP_(void*) BackwardsAllocator::Alloc(size_t size)
|
|
{
|
|
if (size != mSize)
|
|
{
|
|
NS_ERROR("umm, why would this be reached for this test?");
|
|
return NULL;
|
|
}
|
|
|
|
PRUint32 index = mIndex;
|
|
|
|
while ((index = previous(index)) != mIndex)
|
|
{
|
|
if (mMemory[mSize * mCount + index] == 1)
|
|
continue;
|
|
mMemory[mSize * mCount + index] = 1;
|
|
mIndex = index;
|
|
return &mMemory[mSize * index];
|
|
}
|
|
|
|
NS_ERROR("shouldn't reach here in this test");
|
|
return NULL;
|
|
}
|
|
|
|
NS_IMETHODIMP_(void*) BackwardsAllocator::Realloc(void* ptr, size_t newSize)
|
|
{
|
|
NS_ERROR("shouldn't reach here in this test");
|
|
return NULL;
|
|
}
|
|
|
|
NS_IMETHODIMP_(void) BackwardsAllocator::Free(void* ptr)
|
|
{
|
|
PRUint8* p = static_cast<PRUint8*>(ptr);
|
|
if (p)
|
|
mMemory[mCount * mSize + (p - mMemory) / mSize] = 0;
|
|
}
|
|
|
|
NS_IMETHODIMP BackwardsAllocator::HeapMinimize(PRBool immediate)
|
|
{
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMETHODIMP BackwardsAllocator::IsLowMemory(PRBool* retval)
|
|
{
|
|
*retval = PR_FALSE;
|
|
return NS_OK;
|
|
}
|
|
|
|
|
|
nsresult TestBackwardsAllocator()
|
|
{
|
|
const PRUint32 SEGMENT_COUNT = 10;
|
|
const PRUint32 SEGMENT_SIZE = 10;
|
|
|
|
nsRefPtr<BackwardsAllocator> allocator = new BackwardsAllocator();
|
|
if (!allocator)
|
|
{
|
|
fail("Allocation of BackwardsAllocator failed!");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
nsresult rv = allocator->Init(SEGMENT_COUNT, SEGMENT_SIZE);
|
|
if (NS_FAILED(rv))
|
|
return rv;
|
|
|
|
nsCOMPtr<nsIAsyncInputStream> input;
|
|
nsCOMPtr<nsIAsyncOutputStream> output;
|
|
rv = TP_NewPipe2(getter_AddRefs(input),
|
|
getter_AddRefs(output),
|
|
PR_FALSE,
|
|
PR_FALSE,
|
|
SEGMENT_SIZE, SEGMENT_COUNT, allocator);
|
|
if (NS_FAILED(rv))
|
|
{
|
|
fail("TP_NewPipe2 failed: %x", rv);
|
|
return rv;
|
|
}
|
|
|
|
const PRUint32 BUFFER_LENGTH = 100;
|
|
const char written[] =
|
|
"0123456789"
|
|
"1123456789"
|
|
"2123456789"
|
|
"3123456789"
|
|
"4123456789"
|
|
"5123456789"
|
|
"6123456789"
|
|
"7123456789"
|
|
"8123456789"
|
|
"9123456789"; // not just a memset, to ensure the allocator works correctly
|
|
if (sizeof(written) < BUFFER_LENGTH)
|
|
{
|
|
fail("test error with string size");
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
PRUint32 writeCount;
|
|
rv = output->Write(written, BUFFER_LENGTH, &writeCount);
|
|
if (NS_FAILED(rv) || writeCount != BUFFER_LENGTH)
|
|
{
|
|
fail("writing %d bytes (wrote %d bytes) to output failed: %x",
|
|
BUFFER_LENGTH, writeCount, rv);
|
|
return rv;
|
|
}
|
|
|
|
char read[BUFFER_LENGTH];
|
|
PRUint32 readCount;
|
|
rv = input->Read(read, BUFFER_LENGTH, &readCount);
|
|
if (NS_FAILED(rv) || readCount != BUFFER_LENGTH)
|
|
{
|
|
fail("reading %d bytes (got %d bytes) from input failed: %x",
|
|
BUFFER_LENGTH, readCount, rv);
|
|
return rv;
|
|
}
|
|
|
|
if (0 != memcmp(written, read, BUFFER_LENGTH))
|
|
{
|
|
fail("didn't read the written data correctly!");
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
passed("TestBackwardsAllocator");
|
|
return NS_OK;
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
ScopedXPCOM xpcom("nsPipe");
|
|
if (xpcom.failed())
|
|
return 1;
|
|
|
|
int rv = 0;
|
|
|
|
if (NS_FAILED(TestBackwardsAllocator()))
|
|
rv = 1;
|
|
|
|
return rv;
|
|
}
|