WebKit/Source/JavaScriptCore/runtime/BufferMemoryHandle.cpp at main · WebKit/WebKit · GitHub

History

316 lines (272 loc) · 11.4 KB

Raw

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

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

* 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 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 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 "BufferMemoryHandle.h"

#include "JSWebAssemblyInstance.h"

#include "Options.h"

#include "WasmFaultSignalHandler.h"

#include <cstring>

#include <mutex>

#include <wtf/DataLog.h>

#include <wtf/FastMalloc.h>

#include <wtf/Lock.h>

#include <wtf/NeverDestroyed.h>

#include <wtf/OSAllocator.h>

#include <wtf/Platform.h>

#include <wtf/PrintStream.h>

#include <wtf/TZoneMallocInlines.h>

#include <wtf/Vector.h>

WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN

namespace JSC {

// FIXME: We could be smarter about memset / mmap / madvise. https://bugs.webkit.org/show_bug.cgi?id=170343

// FIXME: Give up some of the cached fast memories if the GC determines it's easy to get them back, and they haven't been used in a while. https://bugs.webkit.org/show_bug.cgi?id=170773

// FIXME: Limit slow memory size. https://bugs.webkit.org/show_bug.cgi?id=170825

WTF_MAKE_TZONE_ALLOCATED_IMPL(BufferMemoryHandle);

WTF_MAKE_TZONE_ALLOCATED_IMPL(BufferMemoryManager);

BufferMemoryManager::BufferMemoryManager()

: m_maxFastMemoryCount(Options::maxNumWasmFastMemories())

{ }

size_t BufferMemoryHandle::fastMappedRedzoneBytes()

{

return static_cast<size_t>(PageCount::pageSize) * Options::wasmFastMemoryRedzonePages();

}

size_t BufferMemoryHandle::fastMappedBytes()

{

// Signaling memory is memory32 only, and reserves memory32's whole address range up front. A

// 32-bit process cannot reserve its entire address space, so it never uses this mode, and the

// range does not fit its size_t either.

#if CPU(ADDRESS32)

RELEASE_ASSERT_NOT_REACHED();

return 0;

#else

return PageCount::maxMemory32Bytes + fastMappedRedzoneBytes();

#endif

}

void BufferMemoryResult::dump(PrintStream& out) const

{

out.print("{basePtr = ", RawPointer(basePtr), ", kind = ", kind, "}");

}

BufferMemoryResult BufferMemoryManager::tryAllocateFastMemory()

{

BufferMemoryResult result = [&] {

Locker locker { m_lock };

if (m_fastMemories.size() >= m_maxFastMemoryCount)

return BufferMemoryResult(nullptr, BufferMemoryResult::Kind::SyncTryToReclaimMemory);

void* result = Gigacage::tryAllocateZeroedVirtualPages(Gigacage::Primitive, BufferMemoryHandle::fastMappedBytes());

if (!result)

return BufferMemoryResult(nullptr, BufferMemoryResult::Kind::SyncTryToReclaimMemory);

m_fastMemories.append(result);

return BufferMemoryResult(

result,

m_fastMemories.size() >= m_maxFastMemoryCount / 2 ? BufferMemoryResult::Kind::SuccessAndNotifyMemoryPressure : BufferMemoryResult::Kind::Success);

}();

dataLogLnIf(Options::logWasmMemory(), "Allocated virtual: ", result, "; state: ", *this);

return result;

}

void BufferMemoryManager::freeFastMemory(void* basePtr)

{

Locker locker { m_lock };

Gigacage::freeVirtualPages(Gigacage::Primitive, basePtr, BufferMemoryHandle::fastMappedBytes());

m_fastMemories.removeFirst(basePtr);

}

dataLogLnIf(Options::logWasmMemory(), "Freed virtual; state: ", *this);

}

BufferMemoryResult BufferMemoryManager::tryAllocateGrowableBoundsCheckingMemory(size_t mappedCapacity)

{

BufferMemoryResult result = [&] {

Locker locker { m_lock };

void* result = Gigacage::tryAllocateZeroedVirtualPages(Gigacage::Primitive, mappedCapacity);

if (!result)

return BufferMemoryResult(nullptr, BufferMemoryResult::Kind::SyncTryToReclaimMemory);

m_growableBoundsCheckingMemories.insert(std::make_pair(std::bit_cast<uintptr_t>(result), mappedCapacity));

return BufferMemoryResult(result, BufferMemoryResult::Kind::Success);

}();

dataLogLnIf(Options::logWasmMemory(), "Allocated virtual: ", result, "; state: ", *this);

return result;

}

void BufferMemoryManager::freeGrowableBoundsCheckingMemory(void* basePtr, size_t mappedCapacity)

{

Locker locker { m_lock };

Gigacage::freeVirtualPages(Gigacage::Primitive, basePtr, mappedCapacity);

m_growableBoundsCheckingMemories.erase(std::make_pair(std::bit_cast<uintptr_t>(basePtr), mappedCapacity));

}

dataLogLnIf(Options::logWasmMemory(), "Freed virtual; state: ", *this);

}

bool BufferMemoryManager::isInGrowableOrFastMemory(void* address)

{

// NOTE: This can be called from a signal handler, but only after we proved that we're in JIT code or IPInt code.

Locker locker { m_lock };

for (void* memory : m_fastMemories) {

char* start = static_cast<char*>(memory);

if (start <= address && address <= start + BufferMemoryHandle::fastMappedBytes())

return true;

}

uintptr_t addressValue = std::bit_cast<uintptr_t>(address);

auto iterator = std::upper_bound(m_growableBoundsCheckingMemories.begin(), m_growableBoundsCheckingMemories.end(), std::make_pair(addressValue, 0),

[](std::pair<uintptr_t, size_t> a, std::pair<uintptr_t, size_t> b) {

return (a.first + a.second) < (b.first + b.second);

});

if (iterator != m_growableBoundsCheckingMemories.end()) {

// Since we never have overlapped range in m_growableBoundsCheckingMemories, just checking one lower-bound range is enough.

if (iterator->first <= addressValue && addressValue < (iterator->first + iterator->second))

return true;

}

return false;

}

// FIXME: Ideally, bmalloc would have this kind of mechanism. Then, we would just forward to that

// mechanism here.

BufferMemoryResult::Kind BufferMemoryManager::tryAllocatePhysicalBytes(size_t bytes)

{

BufferMemoryResult::Kind result = [&] {

Locker locker { m_lock };

if (m_physicalBytes + bytes > memoryLimit())

return BufferMemoryResult::Kind::SyncTryToReclaimMemory;

m_physicalBytes += bytes;

if (m_physicalBytes >= memoryLimit() / 2)

return BufferMemoryResult::Kind::SuccessAndNotifyMemoryPressure;

return BufferMemoryResult::Kind::Success;

}();

dataLogLnIf(Options::logWasmMemory(), "Allocated physical: ", bytes, ", ", result, "; state: ", *this);

return result;

}

void BufferMemoryManager::freePhysicalBytes(size_t bytes)

{

Locker locker { m_lock };

m_physicalBytes -= bytes;

}

dataLogLnIf(Options::logWasmMemory(), "Freed physical: ", bytes, "; state: ", *this);

}

void BufferMemoryManager::dump(PrintStream& out) const

{

out.print("fast memories = ", m_fastMemories.size(), "/", m_maxFastMemoryCount, ", bytes = ", m_physicalBytes, "/", memoryLimit());

}

BufferMemoryManager& BufferMemoryManager::singleton()

{

static std::once_flag onceFlag;

static LazyNeverDestroyed<BufferMemoryManager> manager;

std::call_once(onceFlag, []{

manager.construct();

});

return manager.get();

}

BufferMemoryHandle::BufferMemoryHandle(void* memory, size_t size, size_t mappedCapacity, PageCount initial, PageCount maximum, MemorySharingMode sharingMode, MemoryMode mode)

: m_sharingMode(sharingMode)

, m_mode(mode)

, m_memory(memory)

, m_size(size)

, m_mappedCapacity(mappedCapacity)

, m_initial(initial)

, m_maximum(maximum)

{

if (sharingMode == MemorySharingMode::Default && mode == MemoryMode::BoundsChecking)

ASSERT(mappedCapacity == size);

else {

#if ENABLE(WEBASSEMBLY)

Wasm::activateSignalingMemory();

#endif

}

void* BufferMemoryHandle::nullBasePointer()

{

static void* result = nullptr;

static std::once_flag onceKey;

std::call_once(onceKey, [&]() {

#if GIGACAGE_ENABLED

if (Gigacage::isEnabled(Gigacage::Primitive)) {

result = Gigacage::basePtr(Gigacage::Primitive);

return;

}

#endif

result = fastAlignedMalloc(PageCount::pageSize, PageCount::pageSize);

WTF::fastDecommitAlignedMemory(result, PageCount::pageSize);

});

return result;

}

BufferMemoryHandle::~BufferMemoryHandle()

{

if (m_memory) {

void* memory = this->memory();

BufferMemoryManager::singleton().freePhysicalBytes(m_size);

switch (m_mode) {

case MemoryMode::Signaling: {

// nullBasePointer's zero-sized memory is not used for MemoryMode::Signaling.

constexpr bool readable = true;

constexpr bool writable = true;

OSAllocator::protect(memory, BufferMemoryHandle::fastMappedBytes(), readable, writable);

BufferMemoryManager::singleton().freeFastMemory(memory);

break;

}

case MemoryMode::BoundsChecking: {

switch (m_sharingMode) {

case MemorySharingMode::Default: {

if (memory == nullBasePointer() && !m_size)

return;

Gigacage::freeVirtualPages(Gigacage::Primitive, memory, m_size);

break;

}

case MemorySharingMode::Shared: {

if (memory == nullBasePointer() && !m_mappedCapacity) {

ASSERT(!m_size);

return;

}

constexpr bool readable = true;

constexpr bool writable = true;

OSAllocator::protect(memory, m_mappedCapacity, readable, writable);

BufferMemoryManager::singleton().freeGrowableBoundsCheckingMemory(memory, m_mappedCapacity);

break;

}

break;

}

// FIXME: ARM64E clang has a bug and inlining this function makes optimizer run forever.

// For now, putting NEVER_INLINE to suppress inlining of this.

NEVER_INLINE void* BufferMemoryHandle::memory() const

{

ASSERT(m_memory.getMayBeNull() == m_memory.getUnsafe());

return m_memory.getMayBeNull();

}

#if ENABLE(WEBASSEMBLY)

void BufferMemoryHandle::transferAnchors(BufferMemoryHandle& newHandle)

{

RELEASE_ASSERT(sharingMode() == MemorySharingMode::Default); // This function should be usable only when this handle is not shared with the other thread.

std::scoped_lock locker(m_lock, newHandle.m_lock); // Locks are automatically ordered.

newHandle.m_anchors = std::exchange(m_anchors, { });

}

void BufferMemoryHandle::registerInstance(JSWebAssemblyInstance& instance)

{

Locker locker { m_lock };

RefPtr anchor = instance.anchor();

RELEASE_ASSERT(anchor);

m_anchors.add(*anchor);

}

#endif

} // namespace JSC

WTF_ALLOW_UNSAFE_BUFFER_USAGE_END

WebKit/Source/JavaScriptCore/runtime/BufferMemoryHandle.cpp at main · WebKit/WebKit · GitHub

Uh oh!

Expand file tree

Breadcrumbs

BufferMemoryHandle.cpp

Latest commit

History

Breadcrumbs

BufferMemoryHandle.cpp

File metadata and controls