Searched refs:Node (Results 1 - 25 of 454) sorted by relevance

1234567891011>>

/macosx-10.10.1/JavaScriptCore-7600.1.17/API/tests/
H A DNode.h29 typedef struct __Node Node; typedef in typeref:struct:__Node
33 Node* node;
43 extern Node* Node_new(void);
44 extern void Node_ref(Node* node);
45 extern void Node_deref(Node* node);
46 extern void Node_appendChild(Node* node, Node* child);
47 extern void Node_removeChild(Node* node, Node* child);
48 extern void Node_replaceChild(Node* nod
[all...]
H A DNodeList.h29 #include "Node.h"
33 Node* parentNode;
36 extern NodeList* NodeList_new(Node* parentNode);
38 extern Node* NodeList_item(NodeList*, unsigned);
H A DNode.c26 #include "Node.h"
30 Node* Node_new(void)
32 Node* node = (Node*)malloc(sizeof(Node));
34 node->nodeType = "Node";
40 void Node_appendChild(Node* node, Node* child)
49 void Node_removeChild(Node* node, Node* chil
[all...]
/macosx-10.10.1/awk-20/src/
H A Dproto.h27 extern int constnode(Node *);
28 extern char *strnode(Node *);
29 extern Node *notnull(Node *);
44 extern void penter(Node *);
45 extern void freetr(Node *);
50 extern void cfoll(fa *, Node *);
51 extern int first(Node *);
52 extern void follow(Node *);
57 extern Node *repars
[all...]
H A Dparse.c32 Node *nodealloc(int n)
34 Node *x;
36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *));
44 Node *exptostat(Node *a)
50 Node *node1(int a, Node *b)
52 Node *
[all...]
/macosx-10.10.1/tidy-15.15/tidy/experimental/
H A DTidyNodeIter.h11 Node *testNode;
26 Node *pTop, *pCurrent;
29 TidyNodeIter *newTidyNodeIter( Node *pStart );
39 Node *nextTidyNode( TidyNodeIter *pIter );
42 setCurrentNode( TidyNodeIter *pThis, Node *newCurr )
51 void setCurrentNode( TidyNodeIter *pThis, Node *newCurr );
/macosx-10.10.1/WTF-7600.1.24/wtf/
H A DSinglyLinkedList.h31 template <typename Node> class SinglyLinkedList {
37 void push(Node*);
38 Node* pop();
41 Node* m_head;
44 template <typename Node> inline SinglyLinkedList<Node>::SinglyLinkedList()
49 template <typename Node> inline bool SinglyLinkedList<Node>::isEmpty()
54 template <typename Node> inline void SinglyLinkedList<Node>
[all...]
/macosx-10.10.1/tidy-15.15/tidy/src/
H A Dparser.h19 Bool TY_(CheckNodeIntegrity)(Node *node);
27 Bool TY_(IsNewNode)(Node *node);
29 void TY_(CoerceNode)(TidyDocImpl* doc, Node *node, TidyTagId tid, Bool obsolete, Bool expected);
32 Node *TY_(RemoveNode)(Node *node);
35 Node *TY_(DiscardElement)( TidyDocImpl* doc, Node *element);
39 void TY_(InsertNodeAtStart)(Node *element, Node *node);
43 void TY_(InsertNodeAtEnd)(Node *elemen
[all...]
H A Dclean.h16 void TY_(FixNodeLinks)(Node *node);
22 void TY_(AddStyleAsClass)( TidyDocImpl* doc, Node *node, ctmbstr stylevalue );
23 void TY_(AddStyleProperty)(TidyDocImpl* doc, Node *node, ctmbstr property );
28 void TY_(NestedEmphasis)( TidyDocImpl* doc, Node* node );
31 void TY_(EmFromI)( TidyDocImpl* doc, Node* node );
40 void TY_(List2BQ)( TidyDocImpl* doc, Node* node );
47 void TY_(BQ2Div)( TidyDocImpl* doc, Node* node );
50 void TY_(DropSections)( TidyDocImpl* doc, Node* node );
60 void TY_(CleanWord2000)( TidyDocImpl* doc, Node *node);
65 void TY_(BumpObject)( TidyDocImpl* doc, Node *htm
[all...]
H A Dlexer.h258 Node* asp;
259 Node* php;
297 Node* parent; /* tree structure */
298 Node* prev;
299 Node* next;
300 Node* content;
301 Node* last;
362 Node* token; /* last token returned by GetToken() */
363 Node* itoken; /* last duplicate inline returned by GetToken() */
364 Node* roo
[all...]
/macosx-10.10.1/IOFireWireFamily-456/IOFireWireLib.CFPlugInProj/
H A DIOFireWireLibCoalesceTree.h29 struct Node struct in class:IOFireWireLib::CoalesceTree
31 Node* left ;
32 Node* right ;
49 void DeleteNode(Node* inNode) ;
50 void CoalesceRange(const IOVirtualRange& inRange, Node* inNode) ;
51 const UInt32 GetCount(Node* inNode) const ;
52 void GetCoalesceList(IOVirtualRange* outRanges, Node* inNode, UInt32* pIndex) const ;
56 Node * mTop ;
/macosx-10.10.1/swig-12/Source/Modules/
H A Dswigmod.h60 virtual int emit_one(Node *n);
61 virtual int emit_children(Node *n);
62 virtual int defaultHandler(Node *n);
65 virtual int top(Node *n) = 0;
69 virtual int applyDirective(Node *n);
70 virtual int clearDirective(Node *n);
71 virtual int constantDirective(Node *n);
72 virtual int extendDirective(Node *n);
73 virtual int fragmentDirective(Node *n);
74 virtual int importDirective(Node *
[all...]
H A Dutils.cxx14 int is_public(Node *n) {
19 int is_private(Node *n) {
24 int is_protected(Node *n) {
29 static int is_member_director_helper(Node *parentnode, Node *member) {
39 int is_member_director(Node *parentnode, Node *member) {
47 int is_member_director(Node *member) {
53 int is_non_virtual_protected_access(Node *n) {
64 void clean_overloaded(Node *
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/
H A DMachinePassRegistry.cpp36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) { argument
37 Node->setNext(List);
38 List = Node;
39 if (Listener) Listener->NotifyAdd(Node->getName(),
40 Node->getCtor(),
41 Node->getDescription());
47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) { argument
49 if (*I == Node) {
50 if (Listener) Listener->NotifyRemove(Node->getName());
/macosx-10.10.1/swig-12/Source/Swig/
H A Dswigtree.h34 extern int checkAttribute(Node *obj, const_String_or_char_ptr name, const_String_or_char_ptr value);
35 extern void appendChild(Node *node, Node *child);
36 extern void prependChild(Node *node, Node *child);
37 extern void removeNode(Node *node);
38 extern Node *copyNode(Node *node);
40 /* Node restoration/restore functions */
42 extern void Swig_require(const char *ns, Node *nod
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/
H A DSDNodeOrdering.h36 void add(const SDNode *Node, unsigned NewOrder) { argument
37 unsigned &OldOrder = OrderMap[Node];
41 void remove(const SDNode *Node) { argument
42 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node);
49 unsigned getOrder(const SDNode *Node) { argument
50 return OrderMap[Node];
H A DScheduleDAGSDNodes.h55 static bool isPassiveNode(SDNode *Node) { argument
56 if (isa<ConstantSDNode>(Node)) return true;
57 if (isa<ConstantFPSDNode>(Node)) return true;
58 if (isa<RegisterSDNode>(Node)) return true;
59 if (isa<RegisterMaskSDNode>(Node)) return true;
60 if (isa<GlobalAddressSDNode>(Node)) return true;
61 if (isa<BasicBlockSDNode>(Node)) return true;
62 if (isa<FrameIndexSDNode>(Node)) return true;
63 if (isa<ConstantPoolSDNode>(Node)) return true;
64 if (isa<TargetIndexSDNode>(Node)) retur
134 const SDNode *Node; member in class:llvm::ScheduleDAGSDNodes::RegDefIter
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/unittests/ADT/
H A DilistTest.cpp19 struct Node : ilist_node<Node> { struct in namespace:__anon10547
22 Node() {} function in struct:__anon10547::Node
23 Node(int _Value) : Value(_Value) {} function in struct:__anon10547::Node
27 ilist<Node> List;
28 List.push_back(Node(1));
33 List.push_back(Node(2));
38 const ilist<Node> &ConstList = List;
/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/
H A DDFGStoreBarrierElisionPhase.cpp61 bool couldCauseGC(Node* node)
66 bool allocatesFreshObject(Node* node)
81 void noticeFreshObject(HashSet<Node*>& dontNeedBarriers, Node* node)
87 Node* getBaseOfStore(Node* barrierNode)
93 bool shouldBeElided(HashSet<Node*>& dontNeedBarriers, Node* node)
99 void elideBarrier(Node* node)
105 void handleNode(HashSet<Node*>
[all...]
H A DDFGBasicBlockInlines.h37 Node* BasicBlock::appendNode(Graph& graph, SpeculatedType type, Params... params)
39 Node* result = graph.addNode(type, params...);
45 Node* BasicBlock::appendNonTerminal(Graph& graph, SpeculatedType type, Params... params)
47 Node* result = graph.addNode(type, params...);
H A DDFGAvailability.h36 struct Node;
46 explicit Availability(Node* node)
58 Availability(Node* node, FlushedAt flushedAt)
74 Availability withNode(Node* node) const
89 Node* node() const
117 static Node* mergeNodes(Node* a, Node* b)
128 static Node* unavailableMarker()
130 return bitwise_cast<Node*>(static_cas
[all...]
H A DDFGNodeAllocator.h36 typedef Allocator<Node> NodeAllocator;
42 ASSERT_UNUSED(size, size == sizeof(JSC::DFG::Node));
/macosx-10.10.1/WebKit2-7600.1.25/WebProcess/InjectedBundle/API/mac/
H A DWKDOMInternals.mm33 #import <WebCore/Node.h>
50 DOMCache<WebCore::Node*, WKDOMNode *>& WKDOMNodeCache()
52 static NeverDestroyed<DOMCache<WebCore::Node*, WKDOMNode *>> cache;
62 // -- Node and classes derived from Node. --
64 static Class WKDOMNodeClass(WebCore::Node* impl)
67 case WebCore::Node::ELEMENT_NODE:
69 case WebCore::Node::DOCUMENT_NODE:
71 case WebCore::Node::TEXT_NODE:
73 case WebCore::Node
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/
H A DCFGPrinter.h35 static std::string getSimpleNodeLabel(const BasicBlock *Node, argument
37 if (!Node->getName().empty())
38 return Node->getName().str();
43 WriteAsOperand(OS, Node, false);
47 static std::string getCompleteNodeLabel(const BasicBlock *Node, argument
52 if (Node->getName().empty()) {
53 WriteAsOperand(OS, Node, false);
57 OS << *Node; local
75 std::string getNodeLabel(const BasicBlock *Node, argument
78 return getSimpleNodeLabel(Node, Grap
83 getEdgeSourceLabel(const BasicBlock *Node, succ_const_iterator I) argument
[all...]
/macosx-10.10.1/swig-12/Source/CParse/
H A Dcparse.h47 extern Node *Swig_cparse(File *);
54 extern void cparse_normalize_void(Node *);
60 extern int Swig_cparse_template_expand(Node *n, String *rname, ParmList *tparms, Symtab *tscope);
61 extern Node *Swig_cparse_template_locate(String *name, ParmList *tparms, Symtab *tscope);
67 #define SWIG_WARN_NODE_BEGIN(Node) \
69 String *wrnfilter = Node ? Getattr(Node,"feature:warnfilter") : 0; \
71 #define SWIG_WARN_NODE_END(Node) \

Completed in 242 milliseconds

1234567891011>>