Searched defs:node (Results 1 - 25 of 41) sorted by relevance

12

/PHP_TRUNK/ext/mbstring/oniguruma/
H A Dregtrav.c35 capture_tree_traverse(OnigCaptureTreeNode* node, int at, argument
41 if (node == (OnigCaptureTreeNode* )0)
45 r = (*callback_func)(node->group, node->beg, node->end,
50 for (i = 0; i < node->num_childs; i++) {
51 r = capture_tree_traverse(node->childs[i], at,
57 r = (*callback_func)(node->group, node->beg, node
[all...]
/PHP_TRUNK/ext/xmlrpc/libxmlrpc/
H A Dqueue.h32 } node ; typedef in typeref:struct:nodeptr
38 node *head, *tail, *cursor;
44 node *loc ;
85 #define Q_Iter_Next_F(qi) (qi ? (q_iter)((node*)qi)->next : NULL)
86 #define Q_Iter_Prev_F(qi) (qi ? (q_iter)((node*)qi)->prev : NULL)
87 #define Q_Iter_Get_F(qi) (qi ? ((node*)qi)->data : NULL)
H A Dxml_to_dandarpc.c171 xml_element* DANDARPC_to_xml_element_worker(XMLRPC_REQUEST request, XMLRPC_VALUE node) { argument
174 if(node) {
176 const char* id = XMLRPC_GetValueID(node);
177 XMLRPC_VALUE_TYPE type = XMLRPC_GetValueType(node);
205 simplestring_addn(&elem_val->text, XMLRPC_GetValueString(node), XMLRPC_GetValueStringLen(node));
209 snprintf(buf, BUF_SIZE, "%i", XMLRPC_GetValueInt(node));
214 snprintf(buf, BUF_SIZE, "%i", XMLRPC_GetValueBoolean(node));
219 snprintf(buf, BUF_SIZE, "%f", XMLRPC_GetValueDouble(node));
224 simplestring_add(&elem_val->text, XMLRPC_GetValueDateTime_ISO8601(node));
275 DANDARPC_VALUE_to_xml_element(XMLRPC_VALUE node) argument
[all...]
H A Dxml_to_soap.c107 static const char* get_array_soap_type(XMLRPC_VALUE node) { argument
110 XMLRPC_VALUE xIter = XMLRPC_VectorRewind(node);
115 xIter = XMLRPC_VectorNext(node);
128 xIter = XMLRPC_VectorNext(node);
168 /* determines whether a node is a fault or not, and of which type:
173 static inline int get_fault_type(XMLRPC_VALUE node) { argument
174 if (XMLRPC_VectorGetValueWithID(node, TOKEN_XMLRPC_FAULTCODE) &&
175 XMLRPC_VectorGetValueWithID(node, TOKEN_XMLRPC_FAULTSTRING)) {
178 else if (XMLRPC_VectorGetValueWithID(node, TOKEN_SOAP_FAULTCODE) &&
179 XMLRPC_VectorGetValueWithID(node, TOKEN_SOAP_FAULTSTRIN
191 gen_fault_xmlrpc(XMLRPC_VALUE node, xml_element* el_target) argument
434 SOAP_to_xml_element_worker(XMLRPC_REQUEST request, XMLRPC_VALUE node) argument
577 SOAP_VALUE_to_xml_element(XMLRPC_VALUE node) argument
[all...]
H A Dxml_to_xmlrpc.c189 xml_element* XMLRPC_to_xml_element_worker(XMLRPC_VALUE current_vector, XMLRPC_VALUE node, argument
193 if (node) {
195 XMLRPC_VALUE_TYPE type = XMLRPC_GetValueType(node);
196 XMLRPC_VECTOR_TYPE vtype = XMLRPC_GetVectorType(node);
204 int bIsFault = (vtype == xmlrpc_vector_struct && XMLRPC_VectorGetValueWithID(node, ELEM_FAULTCODE));
206 xml_element* next_el = XMLRPC_to_xml_element_worker(NULL, node, request_type, depth + 1);
217 simplestring_addn(&elem_val->text, XMLRPC_GetValueString(node), XMLRPC_GetValueStringLen(node));
221 snprintf(buf, BUF_SIZE, "%i", XMLRPC_GetValueInt(node));
226 snprintf(buf, BUF_SIZE, "%i", XMLRPC_GetValueBoolean(node));
367 XMLRPC_VALUE_to_xml_element(XMLRPC_VALUE node) argument
[all...]
/PHP_TRUNK/ext/dom/
H A Dcharacterdata.c158 xmlNodePtr node; local
167 DOM_GET_OBJ(node, id, xmlNodePtr, intern);
169 cur = xmlNodeGetContent(node);
240 xmlNodePtr node; local
251 DOM_GET_OBJ(node, id, xmlNodePtr, intern);
253 cur = xmlNodeGetContent(node);
270 xmlNodeSetContent(node, first);
271 xmlNodeAddContent(node, (xmlChar *) arg);
272 xmlNodeAddContent(node, second);
289 xmlNodePtr node; local
344 xmlNodePtr node; local
[all...]
H A Ddom_iterators.c35 xmlNode *node; member in struct:_nodeIterator
52 if(priv->node == NULL) {
53 priv->node = (xmlNode *)payload;
93 iter->node = NULL;
95 nodep = iter->node;
166 xmlNodePtr curnode = (xmlNodePtr)((php_libxml_node_ptr *)intern->ptr)->node;
206 curnode = (xmlNodePtr)((php_libxml_node_ptr *)intern->ptr)->node;
H A Ddomimplementation.c156 zval *node = NULL; local
167 if (zend_parse_parameters(ZEND_NUM_ARGS(), "|ssO", &uri, &uri_len, &name, &name_len, &node, dom_documenttype_class_entry) == FAILURE) {
171 if (node != NULL) {
172 DOM_GET_OBJ(doctype, node, xmlDtdPtr, doctobj);
H A Dnode.c296 /* Access to Element node is implemented as a convience method */
334 /* Access to Element node is implemented as a convience method */
591 URL: http://www.w3.org/TR/2003/WD-DOM-Level-3-Core-20030226/DOM3-Core.html#core-node-ownerDoc
870 xmlNodePtr newchild, node; local
888 node = newchild;
889 while (node != NULL) {
890 node->parent = nodep;
891 if (node->doc != nodep->doc) {
892 xmlSetTreeDoc(node, nodep->doc);
893 if (node
919 zval *id, *node, *ref = NULL; local
1168 zval *id, *node; local
1219 zval *id, *node; local
1349 xmlNode *n, *node; local
1489 zval *id, *node; local
[all...]
H A Delement.c529 zval *id, *node; local
535 if (zend_parse_method_parameters(ZEND_NUM_ARGS(), getThis(), "OO", &id, dom_element_class_entry, &node, dom_attr_class_entry) == FAILURE) {
546 DOM_GET_OBJ(attrp, node, xmlAttrPtr, attrobj);
549 php_error_docref(NULL, E_WARNING, "Attribute node is required");
561 ((php_libxml_node_ptr *)oldobj->ptr)->node == (xmlNodePtr) attrp)
595 zval *id, *node; local
601 if (zend_parse_method_parameters(ZEND_NUM_ARGS(), getThis(), "OO", &id, dom_element_class_entry, &node, dom_attr_class_entry) == FAILURE) {
612 DOM_GET_OBJ(attrp, node, xmlAttrPtr, attrobj);
954 zval *id, *node; local
961 if (zend_parse_method_parameters(ZEND_NUM_ARGS(), getThis(), "OO", &id, dom_element_class_entry, &node, dom_attr_class_entr
1212 zval *id, *node; local
[all...]
H A Dentityreference.c52 xmlNode *node; local
68 node = xmlNewReference(NULL, (xmlChar *) name);
70 if (!node) {
81 php_libxml_increment_node_ptr((php_libxml_node_object *)intern, node, (void *)intern);
H A Dtext.c103 xmlNodePtr node; local
106 node = dom_object_get_node(obj);
108 if (node == NULL) {
113 /* Find starting text node */
114 while (node->prev && ((node->prev->type == XML_TEXT_NODE) || (node->prev->type == XML_CDATA_SECTION_NODE))) {
115 node = node->prev;
119 while (node
146 xmlNodePtr node; local
204 xmlNodePtr node; local
[all...]
H A Dxpath.c140 xmlNodePtr node = obj->nodesetval->nodeTab[j]; local
143 if (node->type == XML_NAMESPACE_DECL) {
147 nsparent = node->_private;
148 curns = xmlNewNs(NULL, node->name, NULL);
149 if (node->children) {
150 curns->prefix = xmlStrdup((xmlChar *) node->children);
152 if (node->children) {
153 node = xmlNewDocNode(node->doc, NULL, (xmlChar *) node
441 xmlNodePtr node = nodesetp->nodeTab[i]; local
[all...]
/PHP_TRUNK/ext/soap/
H A Dphp_schema.c986 void schema_min_max(xmlNodePtr node, sdlContentModelPtr model) argument
988 xmlAttrPtr attr = get_attribute(node->properties, "minOccurs");
996 attr = get_attribute(node->properties, "maxOccurs");
H A Dphp_xml.c42 static void cleanup_xml_node(xmlNodePtr node) argument
47 trav = node->children;
185 xmlNsPtr attr_find_ns(xmlAttrPtr node) argument
187 if (node->ns) {
188 return node->ns;
189 } else if (node->parent->ns) {
190 return node->parent->ns;
192 return xmlSearchNs(node->doc, node->parent, NULL);
196 xmlNsPtr node_find_ns(xmlNodePtr node) argument
205 attr_is_equal_ex(xmlAttrPtr node, char *name, char *ns) argument
221 node_is_equal_ex(xmlNodePtr node, char *name, char *ns) argument
238 get_attribute_ex(xmlAttrPtr node, char *name, char *ns) argument
249 get_node_ex(xmlNodePtr node, char *name, char *ns) argument
260 get_node_recurisve_ex(xmlNodePtr node, char *name, char *ns) argument
276 get_node_with_attribute_ex(xmlNodePtr node, char *name, char *name_ns, char *attribute, char *value, char *attr_ns) argument
297 get_node_with_attribute_recursive_ex(xmlNodePtr node, char *name, char *name_ns, char *attribute, char *value, char *attr_ns) argument
[all...]
/PHP_TRUNK/ext/interbase/
H A Dibase_events.c46 ibase_event **node; local
54 for (node = &event->link->event_head; *node != event; node = &(*node)->event_next);
55 *node = event->event_next;
/PHP_TRUNK/ext/xsl/
H A Dxsltprocessor.c254 xmlNodePtr node = obj->nodesetval->nodeTab[j]; local
257 if (node->type == XML_NAMESPACE_DECL) {
261 nsparent = node->_private;
262 curns = xmlNewNs(NULL, node->name, NULL);
263 if (node->children) {
264 curns->prefix = xmlStrdup((char *)node->children);
266 if (node->children) {
267 node = xmlNewDocNode(node->doc, NULL, (char *) node
477 xmlNodePtr node = NULL; local
[all...]
/PHP_TRUNK/ext/libxml/
H A Dphp_libxml.h75 xmlNodePtr node; member in struct:_php_libxml_node_ptr
81 php_libxml_node_ptr *node; member in struct:_php_libxml_node_object
96 PHP_LIBXML_API int php_libxml_increment_node_ptr(php_libxml_node_object *object, xmlNodePtr node, void *private_data);
102 /* When an explicit freeing of node and children is required */
103 PHP_LIBXML_API void php_libxml_node_free_resource(xmlNodePtr node);
104 /* When object dtor is called as node may still be referenced */
/PHP_TRUNK/ext/simplexml/
H A Dphp_simplexml.h61 php_libxml_node_ptr *node; member in struct:__anon49
H A Dsxe.c104 if (intern != NULL && intern->node != NULL) {
105 curnode = (xmlNodePtr)((php_libxml_node_ptr *)intern->node)->node;
134 xmlNodePtr node; local
145 GET_NODE(child, node);
146 if (node) {
147 node = node->children;
149 while (node && node
[all...]
/PHP_TRUNK/ext/xmlreader/
H A Dphp_xmlreader.c657 Return namespaceURI for associated prefix on current node */
760 Moves the position of the current instance to the node that contains the current Attribute node. */
768 Moves the position of the current instance to the first attribute associated with the current node. */
776 Moves the position of the current instance to the next attribute associated with the current node. */
784 Moves the position of the current instance to the next node in the stream. */
808 Moves the position of the current instance to the next node in the stream. */
915 Reads the contents of the current node, including child nodes and markup. */
923 Reads the contents of the current node, including child nodes and markup. */
931 Reads the contents of an element or a text node a
1127 xmlNode *node, *nodec; local
[all...]
/PHP_TRUNK/Zend/
H A Dzend_generators.h34 * The solution to this problem is a doubly-linked tree, which all Generators referenced in maintain a reference to. It should be impossible to avoid walking the tree in all cases. This way, we only need tree walks from leaf to root in case where some part of the `yield from` chain is passed to another `yield from`. (Update of leaf node pointer and list of multi-children nodes needed when leaf gets a child in direct path from leaf to root node.) But only in that case, which should be a fairly rare case (which is then possible, but not totally cheap).
35 * The root of the tree is then the currently executed Generator. The subnodes of the tree (all except the root node) are all Generators which do `yield from`. Each node of the tree knows a pointer to one leaf descendant node. Each node with multiple children needs a list of all leaf descendant nodes paired with pointers to their respective child node. (The stack is determined by leaf node pointers) Nodes with only one child just don't need a list, there it is enough to just have a pointer to the child node. Further, leaf nodes store a pointer to the root node
87 zend_generator_node node; member in struct:_zend_generator
[all...]
H A Dzend_generators.c188 static zend_generator *zend_generator_get_child(zend_generator_node *node, zend_generator *leaf);
200 if (generator->node.children > 4) {
201 zend_hash_destroy(&generator->node.child.ht);
210 if (generator->node.children == 0) {
211 zend_generator *root = generator->node.ptr.root, *next;
213 next = zend_generator_get_child(&root->node, generator);
234 /* By default we have a tree of only one node */
235 generator->node.parent = NULL;
236 generator->node.children = 0;
237 generator->node
330 zend_generator_get_child(zend_generator_node *node, zend_generator *leaf) argument
355 zend_generator_search_multi_children_node(zend_generator_node *node) argument
363 zend_generator_add_single_child(zend_generator_node *node, zend_generator *child, zend_generator *leaf) argument
[all...]
H A Dzend_ast.c49 ZEND_API zend_ast *zend_ast_create_znode(znode *node) { argument
56 ast->node = *node;
1144 /* 1 child node */
/PHP_TRUNK/ext/opcache/
H A Dzend_persist.c211 zend_ast *node; local
216 node = (zend_ast *) copy;
226 node = (zend_ast *) copy;
229 node = zend_accel_memdup(ast, sizeof(zend_ast) - sizeof(zend_ast *) + sizeof(zend_ast *) * children);
231 if (node->child[i]) {
232 node->child[i] = zend_persist_ast(node->child[i]);
238 return node;

Completed in 31 milliseconds

12