Searched refs:Node (Results 76 - 100 of 454) sorted by relevance

1234567891011>>

/macosx-10.10.1/ruby-106/ruby/test/ripper/
H A Ddummyparser.rb7 class Node class
16 "#{@name}(#{Node.trim_nil(@children).map {|n| n.to_s }.join(',')})"
77 Node.new('void')
81 Node.new('ref', name)
85 Node.new('valias', a, b)
89 Node.new('aliaserr', a)
139 Node.new('block', params, code)
176 Node.new('assoc', a, b)
180 Node.new('assocs', *assoc_list)
184 Node
[all...]
/macosx-10.10.1/WebKit2-7600.1.25/WebProcess/ios/
H A DWebVideoFullscreenManager.h45 class Node;
60 bool supportsFullscreen(const WebCore::Node*) const;
61 void enterFullscreenForNode(WebCore::Node*);
62 void exitFullscreenForNode(WebCore::Node*);
88 RefPtr<WebCore::Node> m_node;
/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/
H A DDFGByteCodeParser.cpp176 void emitFunctionChecks(const CallLinkStatus&, Node* callTarget, int registerOffset, CodeSpecializationKind);
179 bool handleInlining(Node* callTargetNode, int resultOperand, const CallLinkStatus&, int registerOffset, int argumentCountIncludingThis, unsigned nextOffset, CodeSpecializationKind);
184 Node* handlePutByOffset(Node* base, unsigned identifier, PropertyOffset, Node* value);
185 Node* handleGetByOffset(SpeculatedType, Node* base, unsigned identifierNumber, PropertyOffset);
187 int destinationOperand, SpeculatedType, Node* base, unsigned identifierNumber,
190 int destinationOperand, SpeculatedType, Node* base, unsigned identifierNumber,
193 Node* bas
[all...]
H A DDFGCPSRethreadingPhase.cpp85 Node* node = block->at(fromIndex++);
132 ALWAYS_INLINE Node* addPhiSilently(BasicBlock* block, const NodeOrigin& origin, VariableAccessData* variable)
134 Node* result = m_graph.addNode(SpecNone, Phi, origin, OpInfo(variable));
140 ALWAYS_INLINE Node* addPhi(BasicBlock* block, const NodeOrigin& origin, VariableAccessData* variable, size_t index)
142 Node* result = addPhiSilently(block, origin, variable);
148 ALWAYS_INLINE Node* addPhi(const NodeOrigin& origin, VariableAccessData* variable, size_t index)
154 void canonicalizeGetLocalFor(Node* node, VariableAccessData* variable, size_t idx)
158 if (Node* otherNode = m_block->variablesAtTail.atFor<operandKind>(idx)) {
214 Node* phi = addPhi<operandKind>(node->origin, variable, idx);
220 void canonicalizeGetLocal(Node* nod
[all...]
H A DDFGEdge.h40 explicit Edge(Node* node = 0, UseKind useKind = UntypedUse, ProofStatus proofStatus = NeedsCheck, KillStatus killStatus = DoesNotKill)
51 Node* node() const { return bitwise_cast<Node*>(m_encodedWord >> shift()); }
53 Node* node() const { return m_node; }
56 Node& operator*() const { return *node(); }
57 Node* operator->() const { return node(); }
59 void setNode(Node* node)
191 return PtrHash<Node*>::hash(m_node) + m_encodedWord;
201 static uintptr_t makeWord(Node* node, UseKind useKind, ProofStatus proofStatus, KillStatus killStatus)
217 Node* m_nod
[all...]
H A DDFGEdgeDominates.h46 void operator()(Node*, Edge edge)
65 inline bool edgesDominate(Graph& graph, Node* node, BasicBlock* block)
H A DDFGLivenessAnalysisPhase.cpp95 Node* node = block->at(nodeIndex);
117 Node* phi = node->phi();
144 void addChildUse(Node*, Edge& edge)
155 HashSet<Node*> m_live;
/macosx-10.10.1/Security-57031.1.35/securityd/src/
H A Dstructure.h43 template <class Base, class Glob> class Node;
52 // Repeat after me: "Everything that matters is a Node."
69 // Do not inherit directly from NodeCore; use Node<> (below).
72 template <class Base, class Glob> friend class Node;
127 // Call a member on each reference of a Node<> object.
143 // Find a reference of a Node<> object that satisfies a simple "method returns value"
166 class Node : public NodeCore { class in inherits:NodeCore
190 class PerConnection : public Node<PerConnection, PerProcess> {
198 class PerProcess : public U32HandleObject, public Node<PerProcess, PerSession> {
206 class PerSession : public Node<PerSessio
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/
H A DEquivalenceClasses.h225 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node;
243 const ECValue *Node; member in class:llvm::EquivalenceClasses::member_iterator
251 explicit member_iterator(const ECValue *N) : Node(N) {}
252 member_iterator(const member_iterator &I) : Node(I.Node) {}
255 assert(Node != 0 && "Dereferencing end()!");
256 return Node->getData();
261 assert(Node != 0 && "++'d off the end of the list!");
262 Node
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/MBlaze/
H A DMBlazeISelDAGToDAG.cpp189 SDNode* MBlazeDAGToDAGISel::Select(SDNode *Node) { argument
190 unsigned Opcode = Node->getOpcode();
191 DebugLoc dl = Node->getDebugLoc();
194 if (Node->isMachineOpcode())
210 int FI = dyn_cast<FrameIndexSDNode>(Node)->getIndex();
211 EVT VT = Node->getValueType(0);
214 if (Node->hasOneUse())
215 return CurDAG->SelectNodeTo(Node, Opc, VT, TFI, imm);
226 SDValue Chain = Node->getOperand(0);
227 SDValue Callee = Node
[all...]
/macosx-10.10.1/swig-12/Source/Modules/
H A Dallocate.cxx31 static int check_implemented(Node *n) {
59 Node *inclass;
65 int function_is_defined_in_bases(Node *n, Node *bases) {
80 Node *b = Getitem(bases, i);
81 Node *base = firstChild(b);
85 Node *extend = firstChild(base);
95 Node *usingdecl = firstChild(base);
116 Node *b = Getitem(bases, j);
124 int function_is_defined_in_bases_seek(Node *
[all...]
H A Dcffi.cxx33 virtual int top(Node *n);
34 virtual int functionWrapper(Node *n);
35 virtual int variableWrapper(Node *n);
36 virtual int constantWrapper(Node *n);
37 // virtual int classDeclaration(Node *n);
38 virtual int enumDeclaration(Node *n);
39 virtual int typedefHandler(Node *n);
42 virtual int constructorHandler(Node *n);
43 virtual int destructorHandler(Node *n);
44 virtual int memberfunctionHandler(Node *
[all...]
/macosx-10.10.1/tidy-15.15/tidy/src/
H A Dclean.c62 static Node* CleanNode( TidyDocImpl* doc, Node *node );
64 static void RenameElem( Node* node, TidyTagId tid )
324 static void AddClass( TidyDocImpl* doc, Node* node, ctmbstr classname )
338 void TY_(AddStyleAsClass)( TidyDocImpl* doc, Node *node, ctmbstr stylevalue )
354 static void Style2Rule( TidyDocImpl* doc, Node *node)
413 static void CleanBodyAttrs( TidyDocImpl* doc, Node* body )
491 Node* node = TY_(FindBody)(doc);
513 Node *node, *head, *body;
564 void TY_(FixNodeLinks)(Node *nod
[all...]
H A Dpprint.h88 void TY_(PPrintTree)( TidyDocImpl* doc, uint mode, uint indent, Node *node );
90 void TY_(PPrintXMLTree)( TidyDocImpl* doc, uint mode, uint indent, Node *node );
/macosx-10.10.1/swig-12/Source/Swig/
H A Dtree.c61 * Swig_print_node(Node *n)
64 void Swig_print_node(Node *obj) {
66 Node *cobj;
127 void appendChild(Node *node, Node *chd) {
128 Node *lc;
154 void prependChild(Node *node, Node *chd) {
155 Node *fc;
178 void removeNode(Node *
[all...]
/macosx-10.10.1/awk-20/src/
H A Dawk.h131 /* Node: parse tree is made of nodes, with Cell's at bottom */
133 typedef struct Node { struct
135 struct Node *nnext;
138 struct Node *narg[1]; /* variable: actual size set by calling malloc */
139 } Node; typedef in typeref:struct:Node
141 #define NIL ((Node *) 0)
143 extern Node *winner;
144 extern Node *nullstat;
145 extern Node *nullnode;
213 Node *n
[all...]
H A Dawkgram.y30 void checkdup(Node *list, Cell *item);
33 Node *beginloc = 0;
34 Node *endloc = 0;
38 Node *arglist = 0; /* list of args for current function */
42 Node *p;
99 winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }
206 | ppattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedfa($3, 0)); }
209 $$ = op3($2, NIL, $1, (Node*)makedfa(strnode($3), 0));
211 $$ = op3($2, (Node *)1, $1, $3); }
233 | pattern MATCHOP reg_expr { $$ = op3($2, NIL, $1, (Node*)makedf
[all...]
/macosx-10.10.1/tcl-105/tcl_ext/xotcl/xotcl/library/xml/
H A Dxml.xotcl21 my set currentElement [Node create [self]::T]
49 # Simple Node tree
51 Class Node
52 Node instproc reset {} {
56 Node instproc print {} {
61 Node instproc insert {xoclass elementclass args} {
66 Node instproc insertElement {tag args} {
69 Node instproc insertText {text} {
74 Class Element -superclass Node -parameter {
91 Class Text -superclass Node
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Support/
H A DDAGDeltaAlgorithm.cpp83 pred_iterator_ty pred_begin(change_ty Node) { argument
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
87 pred_iterator_ty pred_end(change_ty Node) { argument
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
92 pred_closure_iterator_ty pred_closure_begin(change_ty Node) { argument
93 assert(PredClosure.count(Node) && "Invalid node!");
94 return PredClosure[Node].begin();
96 pred_closure_iterator_ty pred_closure_end(change_ty Node) { argument
101 succ_begin(change_ty Node) argument
105 succ_end(change_ty Node) argument
110 succ_closure_begin(change_ty Node) argument
114 succ_closure_end(change_ty Node) argument
[all...]
/macosx-10.10.1/ruby-106/ruby/
H A Dregparse.h277 } Node; typedef in typeref:struct:_Node
280 #define NULL_NODE ((Node* )0)
310 Node* mem_nodes_static[SCANENV_MEMNODES_SIZE];
311 Node** mem_nodes_dynamic;
340 extern void onig_reduce_nested_quantifier P_((Node* pnode, Node* cnode));
341 extern void onig_node_conv_to_str_node P_((Node* node, int raw));
342 extern int onig_node_str_cat P_((Node* node, const UChar* s, const UChar* end));
343 extern int onig_node_str_set P_((Node* node, const UChar* s, const UChar* end));
344 extern void onig_node_free P_((Node* nod
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/common/
H A Dstringtriebuilder.cpp72 Node *root=makeNode(0, elementsLength, 0, errorCode);
205 StringTrieBuilder::Node *
220 Node *node;
227 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode);
242 Node *subNode=makeBranchSubNode(start, limit, unitIndex, length, errorCode);
257 StringTrieBuilder::Node *
264 Node *lessThan[kMaxSplitBranchLevels];
306 Node *node=registerNode(listNode, errorCode);
316 StringTrieBuilder::Node *
317 StringTrieBuilder::registerNode(Node *newNod
[all...]
/macosx-10.10.1/JavaScriptCore-7600.1.17/API/tests/
H A DNodeList.c30 extern NodeList* NodeList_new(Node* parentNode)
53 extern Node* NodeList_item(NodeList* nodeList, unsigned index)
/macosx-10.10.1/ruby-106/ruby/ext/psych/lib/psych/nodes/
H A Ddocument.rb11 class Document < Psych::Nodes::Node
H A Dmapping.rb14 class Mapping < Psych::Nodes::Node
H A Dsequence.rb40 class Sequence < Psych::Nodes::Node

Completed in 189 milliseconds

1234567891011>>