Searched refs:nodes (Results 76 - 100 of 103) sorted by relevance

12345

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/
H A Dxpath.c71 * non-element nodes; actually it will speed up comparison only if
936 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
1821 * look out for namespace nodes in the node-set.
2776 * This stamps all the element nodes with the document order
2826 * Compare two nodes w.r.t document order
2972 * Compare two nodes w.r.t document order.
2973 * This one is optimized for handling of non-element nodes.
3059 * TODO: why do we return 1 for namespace nodes?
3115 * adjacent non-element nodes around.
3303 * the namespace nodes ar
4396 xmlXPathDistinctSorted(xmlNodeSetPtr nodes) argument
4436 xmlXPathDistinct(xmlNodeSetPtr nodes) argument
4486 xmlXPathNodeLeadingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4524 xmlXPathNodeLeading(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4588 xmlXPathNodeTrailingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4626 xmlXPathNodeTrailing(xmlNodeSetPtr nodes, xmlNodePtr node) argument
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/libxml2-2.7.2/
H A Dxpath.c71 * non-element nodes; actually it will speed up comparison only if
937 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
1822 * look out for namespace nodes in the node-set.
2787 * This stamps all the element nodes with the document order
2837 * Compare two nodes w.r.t document order
2985 * Compare two nodes w.r.t document order.
2986 * This one is optimized for handling of non-element nodes.
3073 * TODO: why do we return 1 for namespace nodes?
3129 * adjacent non-element nodes around.
3317 * the namespace nodes ar
4421 xmlXPathDistinctSorted(xmlNodeSetPtr nodes) argument
4463 xmlXPathDistinct(xmlNodeSetPtr nodes) argument
4513 xmlXPathNodeLeadingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4553 xmlXPathNodeLeading(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4617 xmlXPathNodeTrailingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4658 xmlXPathNodeTrailing(xmlNodeSetPtr nodes, xmlNodePtr node) argument
[all...]
H A Dtestapi.c2187 int legacy; /* whether to allow deprecated elements (YES is faster here for Element nodes) */
5346 xmlNodeSetPtr nodes; /* the nodes set to be included in the canonized image or NULL if all document nodes should be included */ local
5365 nodes = gen_xmlNodeSetPtr(n_nodes, 1);
5371 ret_val = xmlC14NDocDumpMemory(doc, nodes, exclusive, inclusive_ns_prefixes, with_comments, doc_txt_ptr);
5375 des_xmlNodeSetPtr(n_nodes, nodes, 1);
5415 xmlNodeSetPtr nodes; /* the nodes set to be included in the canonized image or NULL if all document nodes shoul local
5491 xmlNodeSetPtr nodes; /* the nodes set to be included in the canonized image or NULL if all document nodes should be included */ local
46915 xmlNodeSetPtr nodes; /* a node-set */ local
46949 xmlNodeSetPtr nodes; /* a node-set, sorted by document order */ local
48463 xmlNodeSetPtr nodes; /* a node-set */ local
48504 xmlNodeSetPtr nodes; /* a node-set, sorted by document order */ local
48861 xmlNodeSetPtr nodes; /* a node-set */ local
48902 xmlNodeSetPtr nodes; /* a node-set, sorted by document order */ local
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/libxml/
H A Dxpath.c71 * non-element nodes; actually it will speed up comparison only if
936 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
1821 * look out for namespace nodes in the node-set.
2776 * This stamps all the element nodes with the document order
2826 * Compare two nodes w.r.t document order
2972 * Compare two nodes w.r.t document order.
2973 * This one is optimized for handling of non-element nodes.
3059 * TODO: why do we return 1 for namespace nodes?
3115 * adjacent non-element nodes around.
3303 * the namespace nodes ar
4396 xmlXPathDistinctSorted(xmlNodeSetPtr nodes) argument
4436 xmlXPathDistinct(xmlNodeSetPtr nodes) argument
4486 xmlXPathNodeLeadingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4524 xmlXPathNodeLeading(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4588 xmlXPathNodeTrailingSorted(xmlNodeSetPtr nodes, xmlNodePtr node) argument
4626 xmlXPathNodeTrailing(xmlNodeSetPtr nodes, xmlNodePtr node) argument
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/sound/pci/hda/
H A Dhda_codec.c125 * snd_hda_get_sub_nodes - get the range of sub nodes
130 * Parse the NID and store the start NID of its sub-nodes.
131 * Returns the number of sub-nodes.
444 * look for an AFG and MFG nodes
1348 int nodes; local
1353 nodes = snd_hda_get_sub_nodes(codec, fg, &nid_start);
1354 for (nid = nid_start; nid < nodes + nid_start; nid++) {
2175 int nodes; local
2186 nodes = snd_hda_get_sub_nodes(codec, codec->afg, &nid_start);
2187 for (nid = nid_start; nid < nodes
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/openssl/apps/
H A Dreq.c103 * -nodes - no des encryption
163 int nodes=0,kludge=0,newhdr=0,subject=0,pubkey=0; local
357 else if (strcmp(*argv,"-nodes") == 0)
358 nodes=1;
441 BIO_printf(bio_err," -nodes don't encrypt the output key\n");
746 if (nodes) cipher=NULL;
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/apps/
H A Dreq.c115 * -nodes - no des encryption
180 int nodes=0,kludge=0,newhdr=0,subject=0,pubkey=0; local
423 else if (strcmp(*argv,"-nodes") == 0)
424 nodes=1;
509 BIO_printf(bio_err," -nodes don't encrypt the output key\n");
840 if (nodes) cipher=NULL;
H A Dapps.c2297 STACK_OF(X509_POLICY_NODE) *nodes)
2302 if (nodes)
2305 for (i = 0; i < sk_X509_POLICY_NODE_num(nodes); i++)
2307 node = sk_X509_POLICY_NODE_value(nodes, i);
2296 nodes_print(BIO *out, const char *name, STACK_OF(X509_POLICY_NODE) *nodes) argument
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/jffs2/
H A Dreadinode.c154 /* We only check the data CRC of unchecked nodes */
204 * This function is used when we read an inode. Data nodes arrive in
205 * arbitrary order -- they may be older or newer than the nodes which
227 Note that such nodes won't be REF_UNCHECKED since there are no data to
292 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */
304 dbg_readinode("Done killing overlapped nodes\n");
423 we add nodes to the real fragtree, as long as they don't overlap. And
424 having thrown away the majority of overlapped nodes as we went, there
425 really shouldn't be many sets of nodes which do overlap. If we start at
426 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
H A Dnodelist.h79 scan the nodes which are listed for it and build up a proper map of
80 which nodes are currently valid. JFFSv1 always used to keep that whole
130 /* flash_offset & 3 always has to be zero, because nodes are
144 copied. If you need to do anything different to GC inode-less nodes, then
151 dirent nodes) would take more space than this does. We also keep
163 struct jffs2_raw_node_ref *nodes; member in struct:jffs2_inode_cache
216 we're actually building up the original map of which nodes go where,
H A Dnodelist.c216 /* Skip all the nodes which are completed before this one starts */
379 /* If we now share a page with other nodes, mark either previous
559 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
647 ref->next_in_ino = ic->nodes;
648 ic->nodes = ref;
711 /* Calculate totlen from surrounding nodes or eraseblock */
H A Dnodemgmt.c21 * jffs2_reserve_space - request physical space to write nodes to flash
73 * of nodes.
90 * don't know, if unchecked size contains obsoleted nodes, which could give us some
92 * of nodes.
402 * Should only be used to report nodes for which space has been allocated
419 /* Allow non-obsolete nodes only to be added at the end of c->nextblock,
420 if c->nextblock is set. Note that wbuf.c will file obsolete nodes
503 function without actually obliterating any nodes or freeing
571 obliterate nodes that look obsolete. If they weren't
672 obsolete dirent nodes t
[all...]
H A Dgc.c186 finished checking all its nodes */
244 printk(KERN_WARNING "eep. End of raw list while still supposedly nodes to GC\n");
310 We can just copy any pristine nodes, but have
343 the alloc_sem() (for marking nodes invalid) so we must
387 the only valid nodes in the block, followed by erasure,
389 held _all_ the nodes of that inode.... never been seen but
482 frag->node->raw = f->inocache->nodes;
814 /* On a medium where we can't actually mark nodes obsolete
837 for (raw = f->inocache->nodes; raw != (void *)f->inocache; raw = raw->next_in_ino) {
1091 circles dirtying the nodes i
[all...]
H A Dwrite.c35 f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache;
H A Dscan.c257 printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n");
890 /* We can't summarise nodes we don't grok */
940 ic->nodes = (void *)ic;
H A Dwbuf.c151 /* It has to have had some nodes or we couldn't be here */
223 /* Recover from failure to write wbuf. Recover the nodes up to the
269 /* All nodes were obsolete. Nothing to recover. */
270 D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n"));
283 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n",
325 /* It wasn't. Go on and try to recover nodes complete in the wbuf */
327 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n",
440 struct jffs2_raw_node_ref **p = &ic->nodes;
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/flac-1.2.1/src/libFLAC/
H A Dmetadata_iterators.c905 unsigned nodes; member in struct:FLAC__Metadata_Chain
964 chain->nodes = 0;
1007 chain->nodes++;
1028 chain->nodes--;
1068 iterator->chain->nodes++;
1095 iterator->chain->nodes++;
1815 * the small number of nodes that we deal with.
1817 for(i = 0, node = chain->head; i < chain->nodes; i++) {
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/include/acpi/
H A Daclocal.h123 /* Owner IDs are used to track namespace nodes for selective deletion */
902 u32 nodes; member in struct:acpi_integrity_info
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/ocfs2/cluster/
H A Dheartbeat.c632 /* dead nodes only come to life after some number of
654 /* We want to be sure that all nodes agree on the
677 /* live nodes only go dead after enough consequtive missed
716 static int o2hb_highest_node(unsigned long *nodes, argument
723 while ((node = find_next_bit(nodes, numbits, node + 1)) != -1) {
748 mlog(ML_NOTICE, "ocfs2_heartbeat: no configured nodes found!\n");
752 /* No sense in reading the slots of nodes that don't exist
932 * get a map of all nodes that are heartbeating in any regions
937 * can trust that they don't miss nodes coming to the party */
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/include/linux/
H A Dsyscalls.h527 const int __user *nodes,
532 const int __user *nodes,
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/kernel/
H A Dcompat.c967 const int __user *nodes,
982 return sys_move_pages(pid, nr_pages, pages, nodes, status, flags);
965 compat_sys_move_pages(pid_t pid, unsigned long nr_pages, compat_uptr_t __user *pages32, const int __user *nodes, int __user *status, int flags) argument
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/iproute2/doc/
H A Dapi-ip6-flowlabels.tex76 so that intermediate nodes will be able to invalidate flow state before
H A Dip-tunnels.tex400 if multicast routing is supported in surrounding network, all GRE nodes
H A Dip-cref.tex392 from other nodes on the network.
413 nodes. Broadcasting is a particular case of multicasting, where the multicast
414 group consists of all nodes on the link. It is important to emphasize
1076 information about paths to other networked nodes.
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/ieee1394/
H A Draw1394.c611 khl->nodes = hi->host->node_count;

Completed in 561 milliseconds

12345