003 File Manager
Current Path:
/usr/src/contrib/llvm-project/clang/lib/AST/Interp
usr
/
src
/
contrib
/
llvm-project
/
clang
/
lib
/
AST
/
Interp
/
📁
..
📄
Boolean.h
(4.12 KB)
📄
ByteCodeEmitter.cpp
(5.38 KB)
📄
ByteCodeEmitter.h
(3.13 KB)
📄
ByteCodeExprGen.cpp
(16.6 KB)
📄
ByteCodeExprGen.h
(10.2 KB)
📄
ByteCodeGenError.cpp
(483 B)
📄
ByteCodeGenError.h
(1.36 KB)
📄
ByteCodeStmtGen.cpp
(7.21 KB)
📄
ByteCodeStmtGen.h
(2.39 KB)
📄
Context.cpp
(3.28 KB)
📄
Context.h
(2.39 KB)
📄
Descriptor.cpp
(10.31 KB)
📄
Descriptor.h
(7.82 KB)
📄
Disasm.cpp
(1.95 KB)
📄
EvalEmitter.cpp
(7.6 KB)
📄
EvalEmitter.h
(3.7 KB)
📄
Frame.cpp
(464 B)
📄
Frame.h
(1.28 KB)
📄
Function.cpp
(1.73 KB)
📄
Function.h
(4.91 KB)
📄
Integral.h
(8.38 KB)
📄
Interp.cpp
(11.54 KB)
📄
Interp.h
(30.64 KB)
📄
InterpBlock.cpp
(1.91 KB)
📄
InterpBlock.h
(4.11 KB)
📄
InterpFrame.cpp
(5.32 KB)
📄
InterpFrame.h
(4.54 KB)
📄
InterpStack.cpp
(1.81 KB)
📄
InterpStack.h
(3.43 KB)
📄
InterpState.cpp
(2.03 KB)
📄
InterpState.h
(3.29 KB)
📄
Opcode.h
(817 B)
📄
Opcodes.td
(11.02 KB)
📄
Pointer.cpp
(4.97 KB)
📄
Pointer.h
(11.08 KB)
📄
PrimType.cpp
(648 B)
📄
PrimType.h
(4.66 KB)
📄
Program.cpp
(11.29 KB)
📄
Program.h
(6.66 KB)
📄
Record.cpp
(1.54 KB)
📄
Record.h
(3.76 KB)
📄
Source.cpp
(1.15 KB)
📄
Source.h
(3.25 KB)
📄
State.cpp
(5.34 KB)
📄
State.h
(4.01 KB)
Editing: InterpStack.cpp
//===--- InterpStack.cpp - Stack implementation for the VM ------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// #include <cassert> #include <cstdlib> #include "InterpStack.h" using namespace clang; using namespace clang::interp; InterpStack::~InterpStack() { clear(); } void InterpStack::clear() { if (Chunk && Chunk->Next) free(Chunk->Next); if (Chunk) free(Chunk); Chunk = nullptr; StackSize = 0; } void *InterpStack::grow(size_t Size) { assert(Size < ChunkSize - sizeof(StackChunk) && "Object too large"); if (!Chunk || sizeof(StackChunk) + Chunk->size() + Size > ChunkSize) { if (Chunk && Chunk->Next) { Chunk = Chunk->Next; } else { StackChunk *Next = new (malloc(ChunkSize)) StackChunk(Chunk); if (Chunk) Chunk->Next = Next; Chunk = Next; } } auto *Object = reinterpret_cast<void *>(Chunk->End); Chunk->End += Size; StackSize += Size; return Object; } void *InterpStack::peek(size_t Size) { assert(Chunk && "Stack is empty!"); StackChunk *Ptr = Chunk; while (Size > Ptr->size()) { Size -= Ptr->size(); Ptr = Ptr->Prev; assert(Ptr && "Offset too large"); } return reinterpret_cast<void *>(Ptr->End - Size); } void InterpStack::shrink(size_t Size) { assert(Chunk && "Chunk is empty!"); while (Size > Chunk->size()) { Size -= Chunk->size(); if (Chunk->Next) { free(Chunk->Next); Chunk->Next = nullptr; } Chunk->End = Chunk->start(); Chunk = Chunk->Prev; assert(Chunk && "Offset too large"); } Chunk->End -= Size; StackSize -= Size; }
Upload File
Create Folder