/macosx-10.10/groff-38/groff/src/roff/troff/ |
H A D | node.h | 50 struct node { struct 51 node *next; 52 node *last; 57 node(); 58 node(node *); 59 node(node *, statem *, int); 60 node *add_char(charinfo *, environment *, hunits *, int *, node ** 116 inline node::node() function in class:node 121 inline node::node(node *n) function in class:node 126 inline node::node(node *n, statem *s, int divlevel) function in class:node [all...] |
/macosx-10.10/tidy-15.15/tidy/src/ |
H A D | clean.c | 62 static Node* CleanNode( TidyDocImpl* doc, Node *node ); 64 static void RenameElem( Node* node, TidyTagId tid ) argument 67 MemFree( node->element ); 68 node->element = TY_(tmbstrdup)( dict->name ); 69 node->tag = dict; 322 Add class="foo" to node 324 static void AddClass( TidyDocImpl* doc, Node* node, ctmbstr classname ) argument 326 AttVal *classattr = TY_(AttrGetById)(node, TidyAttr_CLASS);; 335 TY_(AddAttribute)( doc, node, "class", classname ); 338 void TY_(AddStyleAsClass)( TidyDocImpl* doc, Node *node, ctmbst argument 354 Style2Rule( TidyDocImpl* doc, Node *node) argument 491 Node* node = TY_(FindBody)(doc); local 513 Node *node, *head, *body; local 564 FixNodeLinks(Node *node) argument 586 StripOnlyChild(TidyDocImpl* doc, Node *node) argument 608 Node *node, *parent = element->parent; local 666 AddStyleProperty(TidyDocImpl* doc, Node *node, ctmbstr property ) argument 692 MergeClasses(TidyDocImpl* doc, Node *node, Node *child) argument 737 MergeStyles(TidyDocImpl* doc, Node *node, Node *child) argument 833 AddFontFace( TidyDocImpl* doc, Node *node, ctmbstr face ) argument 840 AddFontSize( TidyDocImpl* doc, Node* node, ctmbstr size ) argument 872 AddFontColor( TidyDocImpl* doc, Node *node, ctmbstr color) argument 880 AddAlign( TidyDocImpl* doc, Node *node, ctmbstr align ) argument 899 AddFontStyles( TidyDocImpl* doc, Node *node, AttVal *av) argument 956 Dir2Div( TidyDocImpl* doc, Node *node, Node **ARG_UNUSED(pnode)) argument 995 Center2Div( TidyDocImpl* doc, Node *node, Node **pnode) argument 1040 CopyAttrs( TidyDocImpl* doc, Node *node, Node *child) argument 1089 MergeNestedElements( TidyDocImpl* doc, TidyTagId Id, TidyTriState state, Node *node, Node **ARG_UNUSED(pnode)) argument 1120 NestedList( TidyDocImpl* doc, Node *node, Node **pnode ) argument 1235 BlockStyle( TidyDocImpl* doc, Node *node, Node **ARG_UNUSED(pnode) ) argument 1282 InlineStyle( TidyDocImpl* doc, Node *node, Node **ARG_UNUSED(pnode) ) argument 1331 Font2Span( TidyDocImpl* doc, Node *node, Node **pnode ) argument 1517 HasOneChild(Node *node) argument 1717 Node *node, *prev = NULL, *content; local 1758 NormalizeSpaces(Lexer *lexer, Node *node) argument 1791 NoMargins(Node *node) argument 1845 CleanWord2000( TidyDocImpl* doc, Node *node) argument 2032 Node *node, *head; local 2066 Node *node, *next, *head = NULL, *body = NULL; local 2232 DropComments(TidyDocImpl* doc, Node* node) argument 2255 DropFontElements(TidyDocImpl* doc, Node* node, Node **ARG_UNUSED(pnode)) argument 2277 WbrToSpace(TidyDocImpl* doc, Node* node) argument 2338 DowngradeTypography(TidyDocImpl* doc, Node* node) argument 2393 ReplacePreformattedSpaces(TidyDocImpl* doc, Node* node) argument 2415 ConvertCDATANodes(TidyDocImpl* doc, Node* node) argument 2440 FixLanguageInformation(TidyDocImpl* doc, Node* node, Bool wantXmlLang, Bool wantLang) argument 2518 FixAnchors(TidyDocImpl* doc, Node *node, Bool wantName, Bool wantId) argument [all...] |
H A D | clean.h | 16 void TY_(FixNodeLinks)(Node *node); 20 /* Add class="foo" to 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); [all...] |
/macosx-10.10/WebCore-7600.1.25/xml/ |
H A D | XPathStep.cpp | 61 // Evaluate predicates as part of node test if possible to avoid building unnecessary NodeSets. 63 // This optimization can be applied to predicates that are not context node list sensitive, or to first predicate that is only context position sensitive, e.g. foo[position() mod 2 = 0]. 94 // Optimize the common case of "//" AKA /descendant-or-self::node()/child::NodeTest to /descendant::NodeTest. 132 // Check predicates that couldn't be merged into node test. 141 Node* node = nodes[j]; local 143 evaluationContext.node = node; 147 newNodes.append(node); 169 inline bool nodeMatchesBasicTest(Node& node, Step::Axis axis, const Step::NodeTest& nodeTest) argument 173 return node 225 nodeMatches(Node& node, Step::Axis axis, const Step::NodeTest& nodeTest) argument 269 Element* node = static_cast<Attr&>(context).ownerElement(); local 273 ContainerNode* node = context.parentNode(); local 279 Node* node = &context; local 311 Node* node = static_cast<Attr&>(context).ownerElement(); local 330 Node* node; local 391 Node* node = &context; local [all...] |
/macosx-10.10/ruby-106/ruby/lib/rexml/formatters/ |
H A D | default.rb | 14 # Writes the node to some output. 16 # node:: 17 # The node to write 21 def write( node, output ) 22 case node 25 if node.xml_decl.encoding != 'UTF-8' && !output.kind_of?(Output) 26 output = Output.new( output, node.xml_decl.encoding ) 28 write_document( node, output ) 31 write_element( node, output ) 35 node [all...] |
/macosx-10.10/postfix-255/postfix/src/postconf/ |
H A D | postconf_node.c | 5 /* low-level parameter node support 42 /* const char *pcf_convert_param_node(mode, name, node) 45 /* PCF_PARAM_NODE *node; 49 /* PCF_RAW_PARAMETER(node) 50 /* const PCF_PARAM_NODE *node; 61 /* pcf_make_param_node() creates a node for the global parameter 62 /* table. This node provides a parameter default value, and a 69 /* parameter node represents a "raw parameter". The value of 108 /* .IP node 142 /* pcf_make_param_node - make node fo 147 PCF_PARAM_NODE *node; local 158 pcf_convert_param_node(int mode, const char *name, PCF_PARAM_NODE *node) argument [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGVirtualRegisterAllocationPhase.cpp | 57 Node* node = block->at(indexInBlock); local 59 if (!node->shouldGenerate()) 62 switch (node->op()) { 68 ASSERT(!node->child1()->hasResult()); 74 // First, call use on all of the current node's children, then 75 // allocate a VirtualRegister for this node. We do so in this 77 // VirtualRegister is freed, then it may be reused for node. 78 if (node->flags() & NodeHasVarArgs) { 79 for (unsigned childIdx = node->firstChild(); childIdx < node [all...] |
H A D | DFGAbstractInterpreterInlines.h | 55 Node* node, AbstractValue& value) 59 if (childConst.toBoolean(m_codeBlock->globalObjectFor(node->origin.semantic)->globalExec())) 68 if (!structure->masqueradesAsUndefined(m_codeBlock->globalObjectFor(node->origin.semantic)) 77 bool AbstractInterpreter<AbstractStateType>::startExecuting(Node* node) argument 84 node->setCanExit(false); 86 return node->shouldGenerate(); 96 void AbstractInterpreter<AbstractStateType>::executeEdges(Node* node) argument 98 DFG_NODE_DO_TO_CHILDREN(m_graph, node, filterEdgeByUse); 114 void AbstractInterpreter<AbstractStateType>::verifyEdges(Node* node) argument 116 DFG_NODE_DO_TO_CHILDREN(m_graph, node, verifyEdg 54 booleanResult( Node* node, AbstractValue& value) argument 120 executeEffects(unsigned clobberLimit, Node* node) argument 1923 Node* node = m_state.block()->at(indexInBlock); local 1932 execute(Node* node) argument 2006 Node* node = *iter; local 2014 Node* node = m_state.block()->at(i); local [all...] |
H A D | DFGDCEPhase.cpp | 71 Node* node = block->at(indexInBlock); local 72 DFG_NODE_DO_TO_CHILDREN(m_graph, node, findTypeCheckRoot); 73 if (!(node->flags() & NodeMustGenerate)) 75 if (!node->postfixRef()) 76 m_worklist.append(node); 82 Node* node = m_worklist.last(); local 84 ASSERT(node->shouldGenerate()); // It should not be on the worklist unless it's ref'ed. 85 DFG_NODE_DO_TO_CHILDREN(m_graph, node, countEdge); 96 Node* node = block->at(nodeIndex); local 97 if (node 138 countNode(Node* node) argument 190 Node* node = block->at(indexInBlock); local 239 eliminateIrrelevantPhantomChildren(Node* node) argument 254 Node* node = variables[i]; local [all...] |
H A D | DFGClobberize.cpp | 35 bool doesWrites(Graph& graph, Node* node) argument 39 clobberize(graph, node, addRead, addWrite); 43 bool writesOverlap(Graph& graph, Node* node, AbstractHeap heap) argument 47 clobberize(graph, node, addRead, addWrite);
|
/macosx-10.10/WebCore-7600.1.25/bindings/js/ |
H A D | JSNodeCustom.h | 39 inline JSC::JSValue toJS(JSC::ExecState* exec, JSDOMGlobalObject* globalObject, Node* node) argument 41 if (!node) 45 if (auto* wrapper = node->wrapper()) 48 if (auto* wrapper = getOutOfLineCachedWrapper(globalObject, node)) 52 return createWrapper(exec, globalObject, node); 55 // In the C++ DOM, a node tree survives as long as there is a reference to its 56 // root. In the JavaScript DOM, a node tree survives as long as there is a 57 // reference to any node in the tree. To model the JavaScript DOM on top of 71 inline void* root(Node* node) argument 73 if (node 81 root(Node& node) argument [all...] |
H A D | JSXPathResultCustom.cpp | 38 for (auto& node : value.toNodeSet()) 39 visitor.addOpaqueRoot(root(node.get()));
|
/macosx-10.10/WebKit2-7600.1.25/WebProcess/WebPage/CoordinatedGraphics/ |
H A D | WebPageCoordinatedGraphics.cpp | 52 Node* node = result.innerNode(); local 54 if (!node) 57 IntRect zoomableArea = node->pixelSnappedBoundingBox(); 60 bool found = !node->isTextNode() && !node->isShadowRoot(); 63 if (!found && !node->parentNode()) 67 // NB: A parent is considered a better candidate iff the node is 69 if (found && (!node->parentNode() || node->parentNode()->childNodeCount() != 1)) 72 node [all...] |
/macosx-10.10/ICU-531.30/icuSources/common/ |
H A D | ucharstrie.cpp | 35 int32_t node; local 36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? 37 valueResult(node) : USTRINGTRIE_NO_VALUE; 83 int32_t node=*pos; local 84 if(node&kValueIsFinal) { 90 // int32_t delta=readValue(pos, node); 92 if(node<kMinTwoUnitValueLead) { 93 delta=node; 94 } else if(node<kThreeUnitValueLead) { 95 delta=((node 113 int32_t node=*pos; local 123 int32_t node=*pos++; local 164 int32_t node; local 195 int32_t node; local 215 int32_t node; local 233 int32_t node=*pos++; local 296 int32_t node=*pos++; local 322 int32_t node=*pos++; local 373 int32_t node=*pos++; local [all...] |
H A D | bytestrie.cpp | 72 int32_t node; local 73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ? 74 valueResult(node) : USTRINGTRIE_NO_VALUE; 102 int32_t node=*pos; local 103 U_ASSERT(node>=kMinValueLead); 104 if(node&kValueIsFinal) { 110 // int32_t delta=readValue(pos, node>>1); 111 node>>=1; 113 if(node<kMinTwoByteValueLead) { 114 delta=node 140 int32_t node=*pos; local 151 int32_t node=*pos++; local 395 int32_t node=*pos++; local [all...] |
/macosx-10.10/WebCore-7600.1.25/html/shadow/ |
H A D | InsertionPoint.h | 78 inline bool isInsertionPoint(const Node& node) { return node.isInsertionPoint(); } argument 82 inline bool isActiveInsertionPoint(const Node* node) argument 84 return node && node->isInsertionPoint() && toInsertionPoint(node)->isActive(); 87 inline Node* parentNodeForDistribution(const Node* node) argument 89 ASSERT(node); 91 if (Node* parent = node->parentNode()) { 100 inline Element* parentElementForDistribution(const Node* node) argument 110 shadowRootOfParentForDistribution(const Node* node) argument 121 hasShadowRootOrActiveInsertionPointParent(const Node& node) argument [all...] |
/macosx-10.10/apache-793/httpd/modules/ldap/ |
H A D | util_ldap_cache.c | 36 util_url_node_t *node = n; local 37 return util_ald_hash_string(1, node->url); 51 util_url_node_t *node = util_ald_alloc(cache, sizeof *node); local 53 if (node) { 54 if (!(node->url = util_ald_strdup(cache, n->url))) { 55 util_ald_free(cache, node); 58 node->search_cache = n->search_cache; 59 node->compare_cache = n->compare_cache; 60 node 70 util_url_node_t *node = n; local 81 util_url_node_t *node = n; local 135 util_search_node_t *node = n; local 149 util_search_node_t *node = c; local 201 util_search_node_t *node = n; local 220 util_search_node_t *node = n; local 240 util_compare_node_t *node = n; local 257 util_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local 279 util_compare_node_t *node = n; local 290 util_compare_node_t *node = n; local 345 util_dn_compare_node_t *node = n; local 360 util_dn_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local 377 util_dn_compare_node_t *node = n; local 385 util_dn_compare_node_t *node = n; local [all...] |
/macosx-10.10/emacs-93/emacs/lisp/emacs-lisp/ |
H A D | ewoc.el | 40 ;; to merge the elib-wrapper and the elib-node structures into ewoc-node 45 ;; elib-node ==> ewoc--node 47 ;; tin ==> ewoc--node 77 ;; A `ewoc--node' is an object that contains one element. There are 78 ;; functions in this package that given an ewoc--node extract the data, or 79 ;; give the next or previous ewoc--node. (All ewoc--nodes are linked together 80 ;; in a doubly linked list. The `previous' ewoc--node is the one that appears 82 ;; an ewoc--node excep [all...] |
/macosx-10.10/WebCore-7600.1.25/dom/ |
H A D | ContainerNodeAlgorithms.cpp | 32 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerNode& node) argument 34 ChildNodesLazySnapshot snapshot(node); 39 if (node.inDocument() && child->parentNode() == &node) 43 if (!node.isElementNode()) 46 if (RefPtr<ShadowRoot> root = toElement(node).shadowRoot()) { 47 if (node.inDocument() && root->hostElement() == &node) 52 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoTree(ContainerNode& node) argument 54 for (Node* child = node 63 notifyDescendantRemovedFromDocument(ContainerNode& node) argument 86 notifyDescendantRemovedFromTree(ContainerNode& node) argument 101 assertConnectedSubrameCountIsConsistent(ContainerNode& node) argument [all...] |
H A D | NodeWithIndex.h | 33 // For use when you want to get the index for a node repeatedly and 37 explicit NodeWithIndex(Node* node) argument 38 : m_node(node) 41 ASSERT(node); 44 Node* node() const { return m_node; } function in class:WebCore::NodeWithIndex
|
/macosx-10.10/webdavfs-367/mount.tproj/ |
H A D | webdav_cache.c | 57 * existing node), it will be removed from the main tree and inserted as a child 58 * of this "fake" node_entry. URLs cannot be created for children of this node 60 * Nodes are freed (using nodecache_free_nodes()) only when they are children of this node. 78 struct node_entry *node, 83 struct node_entry *node, 86 struct node_entry *node, 91 struct node_entry *node); 93 struct node_entry *node, 102 struct node_entry **node); 105 struct node_entry *node, 128 internal_add_attributes( struct node_entry *node, uid_t uid, struct webdav_stat_attr *statp, char *appledoubleheader) argument 166 nodecache_add_attributes( struct node_entry *node, uid_t uid, struct webdav_stat_attr *statp, char *appledoubleheader) argument 186 internal_remove_attributes( struct node_entry *node, int remove_appledoubleheader) argument 205 nodecache_remove_attributes( struct node_entry *node) argument 221 internal_node_appledoubleheader_valid( struct node_entry *node, uid_t uid) argument 237 node_appledoubleheader_valid( struct node_entry *node, uid_t uid) argument 254 node_attributes_valid( struct node_entry *node, uid_t uid) argument 312 struct node_entry *node; local 328 struct node_entry *node; local 422 struct node_entry *node; local 451 internal_add_file_cache( struct node_entry *node, int fd) argument 512 nodecache_add_file_cache( struct node_entry *node, int fd) argument 529 internal_remove_file_cache(struct node_entry *node) argument 572 nodecache_remove_file_cache(struct node_entry *node) argument 657 internal_get_node( struct node_entry *parent, size_t name_length, const char *name, int make_entry, int client_created, webdav_filetype_t node_type, struct node_entry **node) argument 777 nodecache_get_node( struct node_entry *parent, size_t name_length, const char *name, int make_entry, int client_created, webdav_filetype_t node_type, struct node_entry **node) argument 805 struct node_entry *node; local 862 internal_move_node( struct node_entry *node, struct node_entry *new_parent, size_t new_name_length, char *new_name) argument 917 nodecache_move_node( struct node_entry *node, struct node_entry *new_parent, size_t new_name_length, char *new_name) argument 937 delete_node_tree( struct node_entry *node, int recursive) argument 983 nodecache_delete_node( struct node_entry *node, int recursive) argument 1004 struct node_entry *node; local 1042 struct node_entry *node; local 1203 nodecache_get_path_from_node( struct node_entry *node, bool *pathHasRedirection, char **path) argument 1418 struct node_entry *node; local [all...] |
/macosx-10.10/libxml2-26/libxml2/python/tests/ |
H A D | xpathret.py | 17 # test returning a node set works as expected 21 node = mydoc.newDocText(str) 22 parent.addChild(node) 35 node = res[0] variable 36 if node.name != 'p': 39 node = node.children variable 40 if node.type != 'text': 43 if node.content != 'hello':
|
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/python/tests/ |
H A D | xpathret.py | 17 # test returning a node set works as expected 21 node = mydoc.newDocText(str) 22 parent.addChild(node) 35 node = res[0] variable 36 if node.name != 'p': 39 node = node.children variable 40 if node.type != 'text': 43 if node.content != 'hello':
|
/macosx-10.10/zsh-61/zsh/Src/ |
H A D | linklist.c | 74 * for (LinkNode node = firstnode(list); node; incnode(node)) { 75 * // Access/manipulate the node using macros (see zsh.h) 79 * for (LinkNode node = lastnode(list); node != &list->node; decnode(node)) { 86 * while (node && node ! 131 insertlinknode(LinkList list, LinkNode node, void *dat) argument 149 zinsertlinknode(LinkList list, LinkNode node, void *dat) argument 169 uinsertlinknode(LinkList list, LinkNode node, LinkNode new) argument 209 LinkNode node; local 230 LinkNode node; local 285 LinkNode node, next; local 330 LinkNode node; local 355 LinkNode node; local 372 LinkNode node; local [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/offlineasm/ |
H A D | mips.rb | 168 def lowerMIPSCondBranch(list, condOp, node) 169 if node.operands.size == 2 170 list << Instruction.new(node.codeOrigin, 172 [node.operands[0], MIPS_ZERO_REG, node.operands[-1]], 173 node.annotation) 174 elsif node.operands.size == 3 175 tmp = Tmp.new(node.codeOrigin, :gpr) 176 list << Instruction.new(node.codeOrigin, 178 [node [all...] |