| /external/v8/test/cctest/compiler/ |
| graph-builder-tester.h | 193 return MakeNode(op, 0, static_cast<Node**>(NULL));
196 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); }
200 return MakeNode(op, arraysize(buffer), buffer);
205 return MakeNode(op, arraysize(buffer), buffer);
210 return MakeNode(op, arraysize(buffer), buffer);
216 return MakeNode(op, arraysize(buffer), buffer);
222 return MakeNode(op, arraysize(nodes), nodes);
227 return MakeNode(op, value_input_count, value_inputs);
236 Node* MakeNode(const Operator* op, int value_input_count,
|
| test-branch-combine.cc | 312 Node* cond = w.MakeNode(m, a, b);
337 Node* cond = w.MakeNode(m, a, b);
436 Node* cond = cmp.MakeNode(&m, a, b);
|
| codegen-tester.h | 447 Node* MakeNode(RawMachineAssemblerTester<int32_t>* m, Node* a, Node* b) {
|
| /development/testrunner/ |
| make_tree.py | 24 class MakeNode(object):
50 child = MakeNode(current_seg, self)
80 class MakeTree(MakeNode):
|
| /external/v8/src/compiler/ |
| raw-machine-assembler.cc | 98 Node* ret = MakeNode(common()->Return(), 1, &value);
107 Node* ret = MakeNode(common()->Return(2), 2, values);
116 Node* ret = MakeNode(common()->Return(3), 3, values);
215 Node* tail_call = MakeNode(common()->TailCall(desc), input_count, buffer);
237 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
261 Node* tail_call = MakeNode(common()->TailCall(desc), arraysize(nodes), nodes);
362 Node* node = MakeNode(op, input_count, inputs);
368 Node* RawMachineAssembler::MakeNode(const Operator* op, int input_count,
|
| bytecode-graph-builder.h | 68 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete);
73 return MakeNode(op, arraysize(buffer), buffer, false);
78 return MakeNode(op, arraysize(buffer), buffer, false);
83 return MakeNode(op, arraysize(buffer), buffer, false);
88 return MakeNode(op, arraysize(buffer), buffer, false);
111 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| ast-graph-builder.h | 172 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete);
176 return MakeNode(op, 1, &n1, false);
181 return MakeNode(op, arraysize(buffer), buffer, false);
186 return MakeNode(op, arraysize(buffer), buffer, false);
191 return MakeNode(op, arraysize(buffer), buffer, false);
197 return MakeNode(op, arraysize(buffer), buffer, false);
203 return MakeNode(op, arraysize(nodes), nodes, false);
208 return MakeNode(op, value_input_count, value_inputs, incomplete);
222 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs,
|
| bytecode-graph-builder.cc | [all...] |
| raw-machine-assembler.h | 652 Node* MakeNode(const Operator* op, int input_count, Node** inputs);
|
| ast-graph-builder.cc | [all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRDebugEventProxy.h | 108 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| ANTLRDebugEventListener.h | 263 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRDebugEventProxy.h | 108 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| ANTLRDebugEventListener.h | 263 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRDebugEventProxy.h | 108 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| ANTLRDebugEventListener.h | 263 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRDebugEventProxy.h | 108 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| ANTLRTreeAdaptor.m | 132 - (id) makeNode:(id<ANTLRBaseTree>)newRoot parentOf:(id<ANTLRBaseTree>)oldRoot
|
| ANTLRDebugEventListener.h | 263 - (void) makeNode:(unsigned)newRootHash parentOf:(unsigned)oldRootHash;
|
| /external/icu/icu4c/source/common/ |
| stringtriebuilder.cpp | 72 Node *root=makeNode(0, elementsLength, 0, errorCode);
206 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) {
227 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode);
295 listNode->add(unit, makeNode(start, i, unitIndex+1, errorCode));
304 listNode->add(unit, makeNode(start, limit, unitIndex+1, errorCode));
|
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 97 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
|
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| jdepend-2.9.jar | |
| /prebuilts/tools/common/m2/repository/org/beanshell/bsh/2.0b4/ |
| bsh-2.0b4.jar | |
