/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGDisassembler.h | 57 void setForNode(Node* node, MacroAssembler::Label label) 91 void dumpDisassembly(PrintStream&, const char* prefix, LinkBuffer&, MacroAssembler::Label& previousLabel, MacroAssembler::Label currentLabel, Node* context); 97 HashMap<Node*, MacroAssembler::Label> m_labelForNode;
|
H A D | DFGIntegerCheckCombiningPhase.cpp | 72 static RangeKey arrayBounds(Edge edge, Node* key) 85 return m_kind + m_source.hash() + PtrHash<Node*>::hash(m_key); 113 Node* m_key; 196 Node* node = block->at(nodeIndex); 226 Node* node = block->at(nodeIndex); 252 Node* minNode; 253 Node* maxNode; 307 RangeKeyAndAddend rangeKeyAndAddend(Node* node) 324 Node* key = node->child2().node(); 366 Node* insertAd [all...] |
H A D | DFGSSALoweringPhase.cpp | 84 Node* length = m_insertionSet.insertNode( 107 Node* length = m_insertionSet.insertNode( 119 Node* m_node;
|
H A D | DFGMinifiedNode.cpp | 36 MinifiedNode MinifiedNode::fromNode(Node* node)
|
H A D | DFGOSRExitBase.h | 37 struct Node;
|
H A D | DFGValidate.cpp | 84 V_EQUAL((virtualRegisterForLocal(i), root), static_cast<Node*>(0), root->variablesAtHead.local(i)); 100 Node* node = block->node(i); 185 Node* node = block->node(i); 193 Node* node = block->at(i); 198 Node* node = block->at(i); 229 HashMap<Node*, unsigned> m_myRefCounts; 230 HashSet<Node*> m_acceptableNodes; 239 HashSet<Node*> phisInThisBlock; 240 HashSet<Node*> nodesInThisBlock; 243 Node* nod [all...] |
H A D | DFGGenerationInfo.h | 61 void initConstant(Node* node, uint32_t useCount) 72 void initGPR(Node* node, uint32_t useCount, GPRReg gpr, DataFormat format) 85 void initInt32(Node* node, uint32_t useCount, GPRReg gpr) 89 void initInt52(Node* node, uint32_t useCount, GPRReg reg, DataFormat format) 94 void initInt52(Node* node, uint32_t useCount, GPRReg reg) 98 void initStrictInt52(Node* node, uint32_t useCount, GPRReg reg) 103 void initJSValue(Node* node, uint32_t useCount, GPRReg gpr, DataFormat format = DataFormatJS) 109 void initJSValue(Node* node, uint32_t useCount, GPRReg tagGPR, GPRReg payloadGPR, DataFormat format = DataFormatJS) 125 void initCell(Node* node, uint32_t useCount, GPRReg gpr) 129 void initBoolean(Node* nod [all...] |
H A D | DFGInvalidationPointInjectionPhase.cpp | 85 void handle(unsigned nodeIndex, Node* node) 96 void insertInvalidationCheck(unsigned nodeIndex, Node* node)
|
H A D | DFGMinifiedNode.h | 37 struct Node; 57 static MinifiedNode fromNode(Node*);
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | SDNodeDbgValue.h | 41 SDNode *Node; // valid for expressions member in struct:llvm::SDDbgValue::__anon10005::__anon10006 58 u.s.Node = N; 84 SDNode *getSDNode() { assert (kind==SDNODE); return u.s.Node; }
|
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/ |
H A D | bytestriebuilder.h | 150 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode); 151 virtual UBool operator==(const Node &other) const; 158 virtual Node *createLinearMatchNode(int32_t i, int32_t byteIndex, int32_t length, 159 Node *nextNode) const;
|
H A D | ucharstriebuilder.h | 154 UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode); 155 virtual UBool operator==(const Node &other) const; 162 virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, 163 Node *nextNode) const;
|
/macosx-10.10.1/ruby-106/ruby/ext/psych/lib/psych/nodes/ |
H A D | scalar.rb | 7 class Scalar < Psych::Nodes::Node
|
/macosx-10.10.1/tidy-15.15/tidy/src/ |
H A D | forward.h | 59 typedef struct _Node Node; typedef in typeref:struct:_Node
|
H A D | tidy-int.h | 35 Node root; /* This MUST remain the first declared 94 Node* tidyNodeToImpl( TidyNode tnod ); 95 TidyNode tidyImplToNode( Node* node ); 107 #define tidyNodeToImpl( tnod ) ((Node*)(tnod))
|
H A D | istack.c | 39 static Bool IsNodePushable( Node *node ) 69 void TY_(PushInline)( TidyDocImpl* doc, Node *node ) 135 void TY_(PopInline)( TidyDocImpl* doc, Node *node ) 162 Bool TY_(IsPushed)( TidyDocImpl* doc, Node *node ) 179 Bool TY_(IsPushedLast)( TidyDocImpl* doc, Node *element, Node *node ) 212 int TY_(InlineDup)( TidyDocImpl* doc, Node* node ) 236 Node *TY_(InsertedToken)( TidyDocImpl* doc ) 239 Node *node;
|
/macosx-10.10.1/libauto-186/ |
H A D | auto_gdb_interface.cpp | 181 struct Node; 182 typedef std::vector<Node *, AuxAllocator<Node *> > NodeVector; 183 typedef std::deque<Node *, AuxAllocator<Node *> > NodeQueue; 184 typedef __gnu_cxx::hash_map<void *, Node*, AuxPointerHash, AuxPointerEqual, AuxAllocator<void *> > NodeSet; 185 typedef __gnu_cxx::hash_map<Node *, auto_memory_reference_t, AuxPointerHash, AuxPointerEqual, AuxAllocator<Node *> > NodeRefMap; // Node * -> auto_memory_reference_t 188 // Node 195 struct Node { struct in class:Auto::GDBRootFinder 204 Node(void *address) : _address(address), _target(NULL), _references(), _color(White), _is_thread_local(0), _is_retained(0) {} function in struct:Auto::GDBRootFinder::Node [all...] |
/macosx-10.10.1/dyld-353.2.1/launch-cache/ |
H A D | MachOTrie.hpp | 38 Edge(const char* s, struct Node* n) : fSubString(s), fChild(n) { } 41 struct Node* fChild; 45 struct Node struct in namespace:mach_o::trie 47 Node(const char* s) : fCummulativeString(s), fAddress(0), fFlags(0), function in struct:mach_o::trie::Node 50 ~Node() { } 79 Node* bNode = new Node(bNodeCummStr); 80 Node* cNode = e.fChild; 97 Node* newNode = new Node(strdu [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/Support/ |
H A D | FoldingSet.cpp | 192 static FoldingSetImpl::Node *GetNextPtr(void *NextInBucketPtr) { 197 return static_cast<FoldingSetImpl::Node*>(NextInBucketPtr); 264 while (Node *NodeInBucket = GetNextPtr(Probe)) { 283 FoldingSetImpl::Node 293 while (Node *NodeInBucket = GetNextPtr(Probe)) { 309 void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { 338 bool FoldingSetImpl::RemoveNode(Node *N) { 352 if (Node *NodeInBucket = GetNextPtr(Ptr)) { 376 /// GetOrInsertNode - If there is an existing simple Node exactly 379 FoldingSetImpl::Node *FoldingSetImp [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | FoldingSet.h | 130 /// Node - This class is used to maintain the singly linked bucket list in 133 class Node { class in class:llvm::FoldingSetImpl 140 Node() : NextInFoldingSetBucket(0) {} function in class:llvm::FoldingSetImpl::Node 152 bool RemoveNode(Node *N); 154 /// GetOrInsertNode - If there is an existing simple Node exactly 157 Node *GetOrInsertNode(Node *N); 162 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos); 167 void InsertNode(Node *N, void *InsertPos); 171 void InsertNode(Node * [all...] |
/macosx-10.10.1/WebKit-7600.1.25/mac/WebCoreSupport/ |
H A D | WebContextMenuClient.h | 36 class Node; 70 bool clientFloatRectForNode(WebCore::Node&, WebCore::FloatRect&) const;
|
/macosx-10.10.1/WebKit2-7600.1.25/WebProcess/InjectedBundle/ |
H A D | InjectedBundlePageEditorClient.h | 44 class Node; 58 bool shouldInsertNode(WebPage*, WebCore::Node*, WebCore::Range* rangeToReplace, WebCore::EditorInsertAction);
|
/macosx-10.10.1/WebKit2-7600.1.25/WebProcess/WebPage/ |
H A D | TapHighlightController.h | 36 class Node; 50 void highlight(WebCore::Node*);
|
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/pat_trie_/ |
H A D | point_iterators.hpp | 60 Node, \ 70 Node, \ 80 Node, \ 90 Node, \ 100 class Node, 112 Node>::other::pointer 358 class Node, 371 Node>::other::pointer
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/ |
H A D | TypeBasedAliasAnalysis.cpp | 80 const MDNode *Node; member in class:__anon9914::TBAANode 83 TBAANode() : Node(0) {} 84 explicit TBAANode(const MDNode *N) : Node(N) {} 87 const MDNode *getNode() const { return Node; } 91 if (Node->getNumOperands() < 2) 93 MDNode *P = dyn_cast_or_null<MDNode>(Node->getOperand(1)); 104 if (Node->getNumOperands() < 3) 106 ConstantInt *CI = dyn_cast<ConstantInt>(Node->getOperand(2));
|