195 lines
7.1 KiB
C
195 lines
7.1 KiB
C
/*
|
|
* Copyright 2012 Piotr Caban for CodeWeavers
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <windef.h>
|
|
#include <winbase.h>
|
|
#include "wine/test.h"
|
|
|
|
struct __Container_proxy;
|
|
|
|
typedef struct {
|
|
struct __Container_proxy *proxy;
|
|
} _Container_base12;
|
|
|
|
typedef struct __Iterator_base12 {
|
|
struct __Container_proxy *proxy;
|
|
struct __Iterator_base12 *next;
|
|
} _Iterator_base12;
|
|
|
|
typedef struct __Container_proxy {
|
|
const _Container_base12 *cont;
|
|
_Iterator_base12 *head;
|
|
} _Container_proxy;
|
|
|
|
#undef __thiscall
|
|
#ifdef __i386__
|
|
#define __thiscall __stdcall
|
|
#else
|
|
#define __thiscall __cdecl
|
|
#endif
|
|
|
|
static _Container_base12* (__thiscall *p__Container_base12_copy_ctor)(_Container_base12*, _Container_base12*);
|
|
static _Container_base12* (__thiscall *p__Container_base12_ctor)(_Container_base12*);
|
|
static void (__thiscall *p__Container_base12__Orphan_all)(_Container_base12*);
|
|
static void (__thiscall *p__Container_base12_dtor)(_Container_base12*);
|
|
static _Iterator_base12** (__thiscall *p__Container_base12__Getpfirst)(_Container_base12*);
|
|
static void (__thiscall *p__Container_base12__Swap_all)(_Container_base12*, _Container_base12*);
|
|
|
|
/* Emulate a __thiscall */
|
|
#ifdef __i386__
|
|
|
|
#include "pshpack1.h"
|
|
struct thiscall_thunk
|
|
{
|
|
BYTE pop_eax; /* popl %eax (ret addr) */
|
|
BYTE pop_edx; /* popl %edx (func) */
|
|
BYTE pop_ecx; /* popl %ecx (this) */
|
|
BYTE push_eax; /* pushl %eax */
|
|
WORD jmp_edx; /* jmp *%edx */
|
|
};
|
|
#include "poppack.h"
|
|
|
|
static void * (WINAPI *call_thiscall_func1)( void *func, void *this );
|
|
static void * (WINAPI *call_thiscall_func2)( void *func, void *this, const void *a );
|
|
|
|
static void init_thiscall_thunk(void)
|
|
{
|
|
struct thiscall_thunk *thunk = VirtualAlloc( NULL, sizeof(*thunk),
|
|
MEM_COMMIT, PAGE_EXECUTE_READWRITE );
|
|
thunk->pop_eax = 0x58; /* popl %eax */
|
|
thunk->pop_edx = 0x5a; /* popl %edx */
|
|
thunk->pop_ecx = 0x59; /* popl %ecx */
|
|
thunk->push_eax = 0x50; /* pushl %eax */
|
|
thunk->jmp_edx = 0xe2ff; /* jmp *%edx */
|
|
call_thiscall_func1 = (void *)thunk;
|
|
call_thiscall_func2 = (void *)thunk;
|
|
}
|
|
|
|
#define call_func1(func,_this) call_thiscall_func1(func,_this)
|
|
#define call_func2(func,_this,a) call_thiscall_func2(func,_this,(const void*)a)
|
|
|
|
#else
|
|
|
|
#define init_thiscall_thunk()
|
|
#define call_func1(func,_this) func(_this)
|
|
#define call_func2(func,_this,a) func(_this,a)
|
|
|
|
#endif /* __i386__ */
|
|
|
|
#define SETNOFAIL(x,y) x = (void*)GetProcAddress(msvcp,y)
|
|
#define SET(x,y) do { SETNOFAIL(x,y); ok(x != NULL, "Export '%s' not found\n", y); } while(0)
|
|
static BOOL init(void)
|
|
{
|
|
HMODULE msvcp = LoadLibraryA("msvcp100.dll");
|
|
if(!msvcp) {
|
|
win_skip("msvcp100.dll not installed\n");
|
|
return FALSE;
|
|
}
|
|
|
|
if(sizeof(void*) == 8) { /* 64-bit initialization */
|
|
SET(p__Container_base12_copy_ctor, "??0_Container_base12@std@@QEAA@AEBU01@@Z");
|
|
SET(p__Container_base12_ctor, "??0_Container_base12@std@@QEAA@XZ");
|
|
SET(p__Container_base12__Orphan_all, "?_Orphan_all@_Container_base12@std@@QEAAXXZ");
|
|
SET(p__Container_base12_dtor, "??1_Container_base12@std@@QEAA@XZ");
|
|
SET(p__Container_base12__Getpfirst, "?_Getpfirst@_Container_base12@std@@QEBAPEAPEAU_Iterator_base12@2@XZ");
|
|
SET(p__Container_base12__Swap_all, "?_Swap_all@_Container_base12@std@@QEAAXAEAU12@@Z");
|
|
}else {
|
|
SET(p__Container_base12_copy_ctor, "??0_Container_base12@std@@QAE@ABU01@@Z");
|
|
SET(p__Container_base12_ctor, "??0_Container_base12@std@@QAE@XZ");
|
|
SET(p__Container_base12__Orphan_all, "?_Orphan_all@_Container_base12@std@@QAEXXZ");
|
|
SET(p__Container_base12_dtor, "??1_Container_base12@std@@QAE@XZ");
|
|
SET(p__Container_base12__Getpfirst, "?_Getpfirst@_Container_base12@std@@QBEPAPAU_Iterator_base12@2@XZ");
|
|
SET(p__Container_base12__Swap_all, "?_Swap_all@_Container_base12@std@@QAEXAAU12@@Z");
|
|
}
|
|
|
|
init_thiscall_thunk();
|
|
return TRUE;
|
|
}
|
|
|
|
static void test__Container_base12(void)
|
|
{
|
|
_Container_base12 c1, c2;
|
|
_Iterator_base12 i1, i2, **pi;
|
|
_Container_proxy p1, p2;
|
|
|
|
call_func1(p__Container_base12_ctor, &c1);
|
|
ok(c1.proxy == NULL, "c1.proxy != NULL\n");
|
|
|
|
p1.cont = NULL;
|
|
p1.head = NULL;
|
|
c1.proxy = &p1;
|
|
call_func2(p__Container_base12_copy_ctor, &c2, &c1);
|
|
ok(c1.proxy == &p1, "c1.proxy = %p, expected %p\n", c1.proxy, &p1);
|
|
ok(c2.proxy == NULL, "c2.proxy != NULL\n");
|
|
|
|
p1.head = &i1;
|
|
i1.proxy = &p1;
|
|
i1.next = &i2;
|
|
i2.proxy = &p1;
|
|
i2.next = NULL;
|
|
pi = call_func1(p__Container_base12__Getpfirst, &c1);
|
|
ok(pi == &p1.head, "pi = %p, expected %p\n", pi, &p1.head);
|
|
pi = call_func1(p__Container_base12__Getpfirst, &c2);
|
|
ok(pi == NULL, "pi != NULL\n");
|
|
|
|
p1.cont = &c1;
|
|
call_func1(p__Container_base12_dtor, &c1);
|
|
ok(p1.cont == &c1, "p1.cont = %p, expected %p\n", p1.cont, &c1);
|
|
ok(p1.head == &i1, "p1.head = %p, expected %p\n", p1.head, &i1);
|
|
ok(i1.proxy == &p1, "i1.proxy = %p, expected %p\n", i1.proxy, &p1);
|
|
ok(i1.next == &i2, "i1.next = %p, expected %p\n", i1.next, &i2);
|
|
ok(i2.proxy == &p1, "i2.proxy = %p, expected %p\n", i2.proxy, &p1);
|
|
ok(i2.next == NULL, "i2.next != NULL\n");
|
|
|
|
call_func1(p__Container_base12__Orphan_all, &c1);
|
|
ok(p1.cont == &c1, "p1.cont = %p, expected %p\n", p1.cont, &c1);
|
|
ok(p1.head == &i1, "p1.head = %p, expected %p\n", p1.head, &i1);
|
|
ok(i1.proxy == &p1, "i1.proxy = %p, expected %p\n", i1.proxy, &p1);
|
|
ok(i1.next == &i2, "i1.next = %p, expected %p\n", i1.next, &i2);
|
|
ok(i2.proxy == &p1, "i2.proxy = %p, expected %p\n", i2.proxy, &p1);
|
|
ok(i2.next == NULL, "i2.next != NULL\n");
|
|
|
|
c2.proxy = NULL;
|
|
call_func2(p__Container_base12__Swap_all, &c1, &c2);
|
|
ok(c1.proxy == NULL, "c1.proxy != NULL\n");
|
|
ok(c2.proxy == &p1, "c2.proxy = %p, expected %p\n", c2.proxy, &p2);
|
|
ok(p1.cont == &c2, "p1.cont = %p, expected %p\n", p1.cont, &c2);
|
|
|
|
c1.proxy = &p2;
|
|
p2.cont = (void*)0xdeadbeef;
|
|
p2.head = (void*)0xdeadbeef;
|
|
p1.head = &i1;
|
|
call_func2(p__Container_base12__Swap_all, &c1, &c2);
|
|
ok(c1.proxy == &p1, "c1.proxt = %p, expected %p\n", c1.proxy, &p1);
|
|
ok(p1.cont == &c1, "p1.cont = %p, expected %p\n", p1.cont, &c1);
|
|
ok(p1.head == &i1, "p1.head = %p, expected %p\n", p1.head, &i1);
|
|
ok(c2.proxy == &p2, "c2.proxy = %p, expected %p\n", c2.proxy, &p2);
|
|
ok(p2.cont == &c2, "p2.cont = %p, expected %p\n", p2.cont, &c2);
|
|
ok(p2.head == (void*)0xdeadbeef, "p2.head = %p, expected 0xdeadbeef\n", p2.head);
|
|
}
|
|
|
|
START_TEST(misc)
|
|
{
|
|
if(!init())
|
|
return;
|
|
|
|
test__Container_base12();
|
|
}
|