/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGBasicBlock.h | 59 Node*& at(size_t i) { return m_nodes[i]; } 60 Node* at(size_t i) const { return m_nodes[i]; } 61 Node*& operator[](size_t i) { return at(i); } 62 Node* operator[](size_t i) const { return at(i); } 63 Node* last() const { return at(size() - 1); } 67 void append(Node* node) { m_nodes.append(node); } 68 void insertBeforeLast(Node* node) 75 Node* node(size_t i) const 83 bool isInPhis(Node* node) const; 84 bool isInBlock(Node* myNod [all...] |
H A D | DFGAtTailAbstractState.cpp | 42 void AtTailAbstractState::createValueForNode(Node* node) 47 AbstractValue& AtTailAbstractState::forNode(Node* node) 49 HashMap<Node*, AbstractValue>::iterator iter = m_block->ssa->valuesAtTail.find(node);
|
H A D | DFGClobberize.cpp | 35 bool doesWrites(Graph& graph, Node* node) 43 bool writesOverlap(Graph& graph, Node* node, AbstractHeap heap)
|
H A D | DFGEdgeUsesStructure.h | 42 void operator()(Node*, Edge edge) 53 inline bool edgesUseStructure(Graph& graph, Node* node)
|
H A D | DFGClobberSet.h | 39 struct Node; 111 void addReads(Graph&, Node*, ClobberSet&); 112 void addWrites(Graph&, Node*, ClobberSet&); 113 void addReadsAndWrites(Graph&, Node*, ClobberSet& reads, ClobberSet& writes); 115 bool readsOverlap(Graph&, Node*, ClobberSet&); 116 bool writesOverlap(Graph&, Node*, ClobberSet&);
|
H A D | DFGCSEPhase.cpp | 72 Node* node = block->at(i); 92 Node* node = block->at(i); 127 Node* pureCSE(Node* node) 134 Node* otherNode = m_currentBlock->at(i); 164 Node* constantCSE(Node* node) 167 Node* otherNode = m_currentBlock->at(i); 179 Node* weakConstantCSE(Node* nod [all...] |
H A D | DFGInsertionSet.h | 37 typedef WTF::Insertion<Node*> Insertion; 46 Node* insert(const Insertion& insertion) 53 Node* insert(size_t index, Node* element) 59 Node* insertNode(size_t index, SpeculatedType type, Params... params) 64 Node* insertConstant( 74 Node* insertConstant(
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.h | 41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo, 48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, 51 void CreateVirtualRegisters(SDNode *Node, MachineInstr *MI, 88 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 95 void EmitCopyToRegClassNode(SDNode *Node, 100 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 106 static unsigned CountResults(SDNode *Node); 115 void EmitNode(SDNode *Node, bool IsClone, bool IsCloned, argument 117 if (Node->isMachineOpcode()) 118 EmitMachineNode(Node, IsClon [all...] |
H A D | LegalizeDAG.cpp | 69 void LegalizeOp(SDNode *Node); 73 void LegalizeLoadOps(SDNode *Node); 74 void LegalizeStoreOps(SDNode *Node); 96 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned); 101 SDNode *Node, bool isSigned); 102 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32, 105 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned, 111 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results); 114 SDValue ExpandBUILD_VECTOR(SDNode *Node); 115 SDValue ExpandSCALAR_TO_VECTOR(SDNode *Node); 695 LegalizeStoreOps(SDNode *Node) argument [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/ |
H A D | stringtriebuilder.h | 93 class Node; 97 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode); 99 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, 153 Node *registerNode(Node *newNode, UErrorCode &errorCode); 164 Node *registerFinalValue(int32_t value, UErrorCode &errorCode); 175 * NULL Node pointers can be safely passed into other Nodes because 176 * they call the static Node::hashCode() which checks for a NULL pointer first. 180 * a Node pointer, or before setting a new UErrorCode. 189 class Node class in class:StringTrieBuilder 191 Node(int32_t initialHash) : hash(initialHash), offset(0) {} function in class:StringTrieBuilder::Node [all...] |
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | Bag.h | 34 class Node { class in class:WTF::Bag 38 Node* m_next; 50 Node* current = m_head; 58 Node* newNode = new Node; 94 Node* m_node; 109 Node* m_head;
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/heap/ |
H A D | HandleSet.cpp | 56 Node* node = newBlock->nodeAtIndex(i); 57 new (NotNull, node) Node; 64 Node* end = m_strongList.end(); 65 for (Node* node = m_strongList.begin(); node != end; node = node->next()) { 78 Node* node = toNode(slot); 82 SentinelLinkedList<Node>::remove(node); 97 Node* end = m_strongList.end(); 98 for (Node* node = m_strongList.begin(); node != end; node = node->next()) { 107 bool HandleSet::isLiveNode(Node* node)
|
H A D | HandleSet.h | 87 typedef HandleNode Node; typedef in class:JSC::HandleSet 88 static HandleSlot toHandle(Node*); 89 static Node* toNode(HandleSlot); 94 bool isLiveNode(Node*); 100 SentinelLinkedList<Node> m_strongList; 101 SentinelLinkedList<Node> m_immediateList; 102 SinglyLinkedList<Node> m_freeList; 115 inline HandleSlot HandleSet::toHandle(HandleSet::Node* node) 120 inline HandleSet::Node* HandleSet::toNode(HandleSlot handle) 122 return reinterpret_cast<HandleSet::Node*>(handl [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Support/ |
H A D | GraphWriter.h | 65 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { argument 66 child_iterator EI = GTraits::child_begin(Node); 67 child_iterator EE = GTraits::child_end(Node); 71 std::string label = DTraits.getEdgeSourceLabel(Node, EI); 143 bool isNodeHidden(NodeType &Node) { argument 144 return isNodeHidden(&Node); 147 bool isNodeHidden(NodeType *const *Node) { argument 148 return isNodeHidden(*Node); 151 bool isNodeHidden(NodeType *Node) { argument 152 return DTraits.isNodeHidden(Node); 155 writeNode(NodeType& Node) argument 159 writeNode(NodeType *const *Node) argument 163 writeNode(NodeType *Node) argument 226 writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) argument [all...] |
H A D | YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 60 class Node; 92 void printError(Node *N, const Twine &Msg); 105 class Node { class in namespace:llvm::yaml 116 Node(unsigned int Type, OwningPtr<Document>&, StringRef Anchor); 128 Node *parseBlockNode(); 136 static inline bool classof(const Node *) { return true; } 154 virtual ~Node() {} 165 class NullNode : public Node { 167 NullNode(OwningPtr<Document> &D) : Node(NK_Nul [all...] |
/macosx-10.10.1/JavaScriptCore-7600.1.17/ftl/ |
H A D | FTLJSCall.h | 40 struct Node; 48 JSCall(unsigned stackmapID, DFG::Node*); 62 DFG::Node* m_node;
|
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | RegionIterator.h | 50 PointerIntPair<NodeType*, 2, enum ItMode> Node; member in class:llvm::RNSuccIterator 58 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 59 Node.setInt(ItRgEnd); 62 NodeType* getNode() const{ return Node.getPointer(); } 65 bool isRegionMode() const { return Node.getInt() != ItBB; } 78 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 93 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB), 108 : Node(node, node->isSubRegion() ? ItRgEnd : ItBB), 114 return Node.getInt() == x.Node 170 NodeType* Node; member in class:llvm::RNSuccIterator 249 succ_begin(NodeType* Node) argument 254 succ_end(NodeType* Node) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/bin_search_tree_/ |
H A D | cond_dtor_entry_dealtor.hpp | 67 typename Allocator::template rebind<Node>::other().
|
H A D | node_iterators.hpp | 59 Node, \ 65 template<typename Node, 76 Node>::other::pointer 97 typedef typename Node::metadata_type metadata_type; 165 Node, \ 170 // Node iterator. 171 template<typename Node, 183 Node>::other::pointer
|
/macosx-10.10.1/ruby-106/ruby/ext/psych/lib/psych/nodes/ |
H A D | alias.rb | 8 class Alias < Psych::Nodes::Node
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/API/tests/ |
H A D | minidom.js | 43 print("Node is " + Node); 44 for (var p in Node) 45 print(p + ": " + Node[p]); 47 node = new Node(); 52 child1 = new Node(); 53 child2 = new Node(); 54 child3 = new Node(); 104 shouldBe("node instanceof Node", true); 105 shouldBe("new Object() instanceof Node", fals [all...] |
/macosx-10.10.1/WebKit2-7600.1.25/WebProcess/InjectedBundle/DOM/ |
H A D | InjectedBundleNodeHandle.h | 38 class Node; 50 static PassRefPtr<InjectedBundleNodeHandle> getOrCreate(WebCore::Node*); 54 WebCore::Node* coreNode() const; 78 static PassRefPtr<InjectedBundleNodeHandle> create(WebCore::Node*); 79 InjectedBundleNodeHandle(WebCore::Node*); 81 RefPtr<WebCore::Node> m_node;
|
/macosx-10.10.1/llvmCore-3425.0.34/lib/Target/MSP430/ |
H A D | MSP430ISelDAGToDAG.cpp | 384 SDNode *MSP430DAGToDAGISel::Select(SDNode *Node) { argument 385 DebugLoc dl = Node->getDebugLoc(); 387 // Dump information about the Node being selected 389 DEBUG(Node->dump(CurDAG)); 393 if (Node->isMachineOpcode()) { 395 Node->dump(CurDAG); 401 switch (Node->getOpcode()) { 404 assert(Node->getValueType(0) == MVT::i16); 405 int FI = cast<FrameIndexSDNode>(Node)->getIndex(); 407 if (Node [all...] |
/macosx-10.10.1/WebInspectorUI-7600.1.17/UserInterface/Models/ |
H A D | DOMSearchMatchObject.js | 85 case Node.ELEMENT_NODE: 88 case Node.TEXT_NODE: 91 case Node.COMMENT_NODE: 94 case Node.DOCUMENT_TYPE_NODE: 97 case Node.CDATA_SECTION_NODE: 110 case Node.ELEMENT_NODE: 121 case Node.TEXT_NODE: 124 case Node.COMMENT_NODE: 127 case Node.DOCUMENT_TYPE_NODE: 141 case Node [all...] |
/macosx-10.10.1/swig-12/Source/Modules/ |
H A D | contract.cxx | 38 String *make_expression(String *s, Node *n); 41 Hash *ContractSplit(Node *n); 42 int emit_contract(Node *n, int method); 43 int cDeclaration(Node *n); 44 int constructorDeclaration(Node *n); 45 int externDeclaration(Node *n); 46 int extendDirective(Node *n); 47 int importDirective(Node *n); 48 int includeDirective(Node *n); 49 int namespaceDeclaration(Node * [all...] |