OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:AstNode
(Results
1 - 15
of
15
) sorted by null
/system/tools/aidl/
ast_cpp.h
36
class
AstNode
{
38
AstNode
() = default;
39
virtual ~
AstNode
() = default;
41
}; // class
AstNode
43
class Declaration : public
AstNode
{
101
class ArgList : public
AstNode
{
106
explicit ArgList(std::vector<std::unique_ptr<
AstNode
>> arg_list);
113
std::vector<std::unique_ptr<
AstNode
>> arguments_;
197
void AddStatement(std::unique_ptr<
AstNode
> statement);
198
void AddStatement(
AstNode
* statement); // Takes ownershi
[
all
...]
ast_cpp_unittest.cpp
95
void CompareGeneratedCode(const
AstNode
& node,
160
std::vector<unique_ptr<
AstNode
>> args;
179
block.AddStatement(unique_ptr<
AstNode
>(new Statement("foo")));
180
block.AddStatement(unique_ptr<
AstNode
>(new Statement("bar")));
227
case2->AddStatement(unique_ptr<
AstNode
>{new Statement{"baz"}});
229
case1->AddStatement(unique_ptr<
AstNode
>{new Statement{"foo"}});
230
case1->AddStatement(unique_ptr<
AstNode
>{new Statement{"bar"}});
ast_cpp.cpp
113
ArgList::ArgList(std::vector<std::unique_ptr<
AstNode
>> arg_list)
211
void StatementBlock::AddStatement(unique_ptr<
AstNode
> statement) {
215
void StatementBlock::AddStatement(
AstNode
* statement) {
222
statements_.push_back(unique_ptr<
AstNode
>(new Statement(expression_str)));
224
statements_.push_back(unique_ptr<
AstNode
>(
322
Assignment::Assignment(const std::string& left,
AstNode
* right)
346
IfStatement::IfStatement(
AstNode
* expression, bool invert_expression)
362
Statement::Statement(unique_ptr<
AstNode
> expression)
365
Statement::Statement(
AstNode
* expression) : expression_(expression) {}
375
Comparison::Comparison(
AstNode
* lhs, const string& comparison, AstNode* rhs
[
all
...]
generate_cpp.cpp
66
unique_ptr<
AstNode
> BreakOnStatusNotOk() {
71
return unique_ptr<
AstNode
>(ret);
74
unique_ptr<
AstNode
> GotoErrorOnBadStatus() {
79
return unique_ptr<
AstNode
>(ret);
83
unique_ptr<
AstNode
> ReturnOnStatusNotOk() {
88
return unique_ptr<
AstNode
>(ret);
473
vector<unique_ptr<
AstNode
>> status_args;
/external/v8/src/ast/
prettyprinter.h
33
void Find(
AstNode
* node, bool print = false);
62
const char* Print(
AstNode
* node);
68
static void PrintOut(Isolate* isolate,
AstNode
* node);
84
void PrintIndentedVisit(const char* s,
AstNode
* node);
ast-traversal-visitor.h
31
explicit AstTraversalVisitor(Isolate* isolate,
AstNode
* root = nullptr);
32
explicit AstTraversalVisitor(uintptr_t stack_limit,
AstNode
* root = nullptr);
39
bool VisitNode(
AstNode
* node) { return true; }
57
AstNode
* root_;
93
AstNode
* root)
100
AstNode
* root)
ast.h
185
class
AstNode
: public ZoneObject {
225
AstNode
(int position, NodeType type)
230
class Statement : public
AstNode
{
236
Statement(int position, NodeType type) :
AstNode
(position, type) {}
238
static const uint8_t kNextBitFieldIndex =
AstNode
::kNextBitFieldIndex;
289
class Expression : public
AstNode
{
362
: public BitField<uint16_t,
AstNode
::kNextBitFieldIndex, 9> {};
366
:
AstNode
(pos, type), base_id_(BailoutId::None().ToInt()) {
512
class Declaration : public
AstNode
{
521
:
AstNode
(pos, type), proxy_(proxy), scope_(scope), next_(nullptr) {
[
all
...]
ast.cc
51
void
AstNode
::Print() { Print(Isolate::Current()); }
53
void
AstNode
::Print(Isolate* isolate) {
64
IterationStatement*
AstNode
::AsIterationStatement() {
72
BreakableStatement*
AstNode
::AsBreakableStatement() {
81
MaterializedLiteral*
AstNode
::AsMaterializedLiteral() {
[
all
...]
prettyprinter.cc
37
void CallPrinter::Find(
AstNode
* node, bool print) {
453
const char* AstPrinter::Print(
AstNode
* node) {
641
void AstPrinter::PrintIndentedVisit(const char* s,
AstNode
* node) {
664
void AstPrinter::PrintOut(Isolate* isolate,
AstNode
* node) {
[
all
...]
/external/v8/src/asmjs/
asm-typer.h
87
AsmType* TypeOf(
AstNode
* node) const;
221
void AddUseAsm(const
AstNode
& node) { use_asm_.AddNewElement(node); }
222
void AddGlobal(const
AstNode
& node) { globals_.AddNewElement(node); }
223
void AddFunction(const
AstNode
& node) { functions_.AddNewElement(node); }
224
void AddTable(const
AstNode
& node) { tables_.AddNewElement(node); }
225
void AddExport(const
AstNode
& node) { exports_.AddNewElement(node); }
234
void AddNewElement(const
AstNode
& node);
253
void SetTypeOf(
AstNode
* node, AsmType* type);
400
std::unordered_map<
AstNode
*, AsmType*> module_node_types_;
401
std::unordered_map<
AstNode
*, AsmType*> function_node_types_
[
all
...]
asm-typer.cc
73
using v8::internal::
AstNode
;
128
const
AstNode
& node) {
463
void AsmTyper::SetTypeOf(
AstNode
* node, AsmType* type) {
498
AsmType* AsmTyper::TypeOf(
AstNode
* node) const {
[
all
...]
/external/v8/src/compiler/
ast-loop-assignment-analyzer.h
67
void VisitIfNotNull(
AstNode
* node) {
/prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit-core-js/2.14/
htmlunit-core-js-2.14.jar
/prebuilts/tools/common/m2/repository/org/mozilla/rhino/1.7R3/
rhino-1.7R3.jar
/external/v8/src/parsing/
parser.h
413
void RecurseIntoSubpattern(
AstNode
* pattern, Expression* value) {
[
all
...]
Completed in 77 milliseconds