File: NstPatcher.cpp

package info (click to toggle)
libretro-nestopia 1.52.0%2B20230102.gitcb1e24e-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 12,960 kB
  • sloc: cpp: 107,513; xml: 27,221; python: 1,329; ansic: 772; makefile: 634
file content (197 lines) | stat: -rw-r--r-- 4,407 bytes parent folder | download | duplicates (8)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
////////////////////////////////////////////////////////////////////////////////////////
//
// Nestopia - NES/Famicom emulator written in C++
//
// Copyright (C) 2003-2008 Martin Freij
//
// This file is part of Nestopia.
//
// Nestopia is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Nestopia 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Nestopia; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//
////////////////////////////////////////////////////////////////////////////////////////

#include <new>
#include "NstVector.hpp"
#include "NstPatcher.hpp"
#include "NstPatcherIps.hpp"
#include "NstPatcherUps.hpp"

namespace Nes
{
	namespace Core
	{
		#ifdef NST_MSVC_OPTIMIZE
		#pragma optimize("s", on)
		#endif

		Patcher::Patcher(bool b)
		:
		ips            (NULL),
		ups            (NULL),
		bypassChecksum (b)
		{
		}

		Patcher::~Patcher()
		{
			Destroy();
		}

		void Patcher::Destroy()
		{
			delete ips;
			ips = NULL;

			delete ups;
			ups = NULL;
		}

		#ifdef NST_MSVC_OPTIMIZE
		#pragma optimize("", on)
		#endif

		Result Patcher::Load(std::istream& stream)
		{
			Destroy();

			if (Ips::IsIps( stream ))
			{
				ips = new (std::nothrow) Ips;
				return ips ? ips->Load( stream ) : RESULT_ERR_OUT_OF_MEMORY;
			}

			if (Ups::IsUps( stream ))
			{
				ups = new (std::nothrow) Ups;
				return ups ? ups->Load( stream, bypassChecksum ) : RESULT_ERR_OUT_OF_MEMORY;
			}

			return RESULT_ERR_INVALID_FILE;
		}

		Result Patcher::Load(std::istream& patchStream,std::istream& srcStream)
		{
			Result result = Load( patchStream );

			if (NES_SUCCEEDED(result))
			{
				result = Test( srcStream );

				if (NES_FAILED(result))
					Destroy();
			}

			return result;
		}

		Result Patcher::Save(std::ostream& stream) const
		{
			return
			(
				ips ? ips->Save( stream ) :
				ups ? ups->Save( stream ) : RESULT_ERR_NOT_READY
			);
		}

		Result Patcher::Test(std::istream& stream) const
		{
			return
			(
				ips ? ips->Test( stream ) :
				ups ? ups->Test( stream, bypassChecksum ) : RESULT_ERR_NOT_READY
			);
		}

		Result Patcher::Test(const Block* const blocks,const uint numBlocks) const
		{
			NST_ASSERT( blocks || !numBlocks );

			if (numBlocks > 1)
			{
				Vector<byte> buffer;

				try
				{
					dword size = 0;

					for (uint i=0; i < numBlocks; ++i)
						size += blocks[i].size;

					buffer.Reserve( size );
				}
				catch (...)
				{
					return RESULT_ERR_OUT_OF_MEMORY;
				}

				for (uint i=0; i < numBlocks; ++i)
					buffer.Append( blocks[i].data, blocks[i].size );

				return Test( buffer.Begin(), buffer.Size() );
			}
			else
			{
				return Test( blocks ? blocks->data : NULL, blocks ? blocks->size : 0 );
			}
		}

		Result Patcher::Test(const byte* const data,const dword size) const
		{
			return
			(
				ips ? ips->Test( data, size ) :
				ups ? ups->Test( data, size, bypassChecksum ) : RESULT_ERR_NOT_READY
			);
		}

		bool Patcher::Patch(const byte* const src,byte* const dst,const dword size,const dword offset) const
		{
			return
			(
				ips ? ips->Patch( src, dst, size, offset ) :
				ups ? ups->Patch( src, dst, size, offset ) : false
			);
		}

		Result Patcher::Create(const Type type,const byte* const src,const byte* const dst,const dword length)
		{
			Destroy();

			switch (type)
			{
				case IPS:

					ips = new (std::nothrow) Ips;
					return ips ? ips->Create( src, dst, length ) : RESULT_ERR_OUT_OF_MEMORY;

				case UPS:

					ups = new (std::nothrow) Ups;
					return ups ? ups->Create( src, dst, length ) : RESULT_ERR_OUT_OF_MEMORY;
			}

			return RESULT_ERR_UNSUPPORTED;
		}

		bool Patcher::Empty() const
		{
			return
			(
				ips ? ips->Empty() :
				ups ? ups->Empty() : true
			);
		}
	}
}