| /external/webkit/WebCore/xml/ |
| XPathPredicate.cpp | 34 #include "Node.h"
113 // If both objects to be compared are node-sets, then the comparison will be true if and only if
114 // there is a node in the first node-set and a node in the second node-set such that the result of
124 // If one object to be compared is a node-set and the other is a number, then the comparison will be true
125 // if and only if there is a node in the node-set such that the result of performing the comparison on the number
126 // to be compared and on the result of converting the string-value of that node to a number using the number function is true
245 Node* node = rhsNodes[i]; local
[all...] |
| XPathStep.cpp | 59 // Evaluate predicates as part of node test if possible to avoid building unnecessary NodeSets.
61 // 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].
85 // Optimize the common case of "//" AKA /descendant-or-self::node()/child::NodeTest to /descendant::NodeTest.
114 void Step::evaluate(Node* context, NodeSet& nodes) const
121 // Check predicates that couldn't be merged into node test.
130 Node* node = nodes[j]; local
132 evaluationContext.node = node;
136 newNodes.append(node);
[all...] |
| XSLTUnicodeSort.cpp | 47 SOFT_LINK(libxslt, xsltEvalAttrValueTemplate, xmlChar*, (xsltTransformContextPtr ctxt, xmlNodePtr node, const xmlChar *name, const xmlChar *ns), (ctxt, node, name, ns))
51 void xsltTransformErrorTrampoline(xsltTransformContextPtr context, xsltStylesheetPtr style, xmlNodePtr node, const char* message, ...)
61 xsltTransformErrorPointer(context, style, node, "%s", messageWithArgs);
88 xmlNodePtr node; local
170 /* Shell's sort of node-set */
278 node = list->nodeTab[j];
280 list->nodeTab[j + incr] = node;
|
| /external/webkit/WebKit/android/nav/ |
| CachedHistory.cpp | 44 void CachedHistory::addToVisited(const CachedNode* node, CachedFrame::Direction direction)
47 mVisited[0].mNode = node;
51 bool CachedHistory::checkVisited(const CachedNode* node, CachedFrame::Direction direction) const
53 // if the direction is unchanged and we've already visited this node, don't visit it again
58 index++; // compare with last direction, previous to last node (where the arrow took us from)
59 if (node == mVisited[index].mNode)
156 const CachedNode* node = visit.mNode; local
157 int index = root != NULL && root->CachedFrame::mDebug.validate(node) ?
158 node->index() : -1;
159 DUMP_NAV_LOGD(" // { 0x%p (%d), %s },\n", node, index, direction(visit.mDirection))
[all...] |
| /frameworks/base/core/tests/coretests/src/android/pim/vcard/test_utils/ |
| PropertyNode.java | 127 PropertyNode node = (PropertyNode)obj; local
129 if (propName == null || !propName.equals(node.propName)) {
131 } else if (!paramMap_TYPE.equals(node.paramMap_TYPE)) {
133 } else if (!paramMap_TYPE.equals(node.paramMap_TYPE)) {
135 } else if (!propGroupSet.equals(node.propGroupSet)) {
139 if (propValue_bytes != null && Arrays.equals(propValue_bytes, node.propValue_bytes)) {
142 if (!propValue.equals(node.propValue)) {
150 return (propValue_vector.equals(node.propValue_vector) ||
152 node.propValue_vector.size() == 1);
|
| /hardware/msm7k/libgralloc/ |
| allocator.cpp | 49 chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign); local
50 mList.insertHead(node);
|
| /hardware/msm7k/libgralloc-qsd8k/ |
| allocator.cpp | 49 chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign); local
50 mList.insertHead(node);
|
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| NamedNodeMapImpl.java | 24 import org.w3c.dom.Node;
58 NodeImpl node = list.get(i); local
59 if (node.matchesName(name, false)) {
69 NodeImpl node = list.get(i); local
70 if (node.matchesNameNS(namespaceURI, localName, false)) {
78 public Node getNamedItem(String name) {
84 public Node getNamedItemNS(String namespaceURI, String localName) {
90 public Node item(int index) {
94 public Node removeNamedItem(String name) throws DOMException {
104 public Node removeNamedItemNS(String namespaceURI, String localName
[all...] |
| /libcore/luni/src/main/java/org/apache/xpath/functions/ |
| FuncId.java | 50 * @param nodeSet Node set where the nodes will be added to.
80 int node = dtm.getElementById(ref); local
82 if (DTM.NULL != node)
83 nodeSet.addNodeInDocOrder(node, xctxt);
|
| /libcore/luni/src/test/java/tests/xml/ |
| SimpleBuilderTest.java | 28 import org.w3c.dom.Node;
50 private String getTextContent(Node node) {
51 String result = (node instanceof Text ? ((Text) node).getData() : "");
53 Node child = node.getFirstChild();
107 Node node = list.item(i); local
109 if (node instanceof ProcessingInstruction)
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| tree-dump.h | 34 /* Information about a node to be dumped. */
38 /* The index for the node. */
40 /* Nonzero if the node is a binfo. */
48 /* The queued tree node. */
49 splay_tree_node node; member in struct:dump_queue
50 /* The next node in the queue. */
61 /* The original node. */
62 const_tree node; member in struct:dump_info
65 /* The next unused node index. */
69 /* The first node in the queue of nodes to be written out. *
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| tree-dump.h | 34 /* Information about a node to be dumped. */
38 /* The index for the node. */
40 /* Nonzero if the node is a binfo. */
48 /* The queued tree node. */
49 splay_tree_node node; member in struct:dump_queue
50 /* The next node in the queue. */
61 /* The original node. */
62 const_tree node; member in struct:dump_info
65 /* The next unused node index. */
69 /* The first node in the queue of nodes to be written out. *
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 89 typedef typename base_type::node node; typedef in class:__gnu_pbds::detail::binomial_heap_base_
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockNamedNodeMap.java | 21 import org.w3c.dom.Node;
29 private final HashMap<String, HashMap<String, Node>> mNodeMap =
30 new HashMap<String, HashMap<String, Node>>();
33 private final ArrayList<Node> mNodeList = new ArrayList<Node>();
36 MockXmlNode node = new MockXmlNode(namespace, localName, value); local
43 HashMap<String, Node> map = mNodeMap.get(namespace);
45 map = new HashMap<String, Node>();
50 map.put(localName, node);
51 mNodeList.add(node);
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| CaptureRenderer.java | 25 private ViewNode node; field in class:CaptureRenderer
28 CaptureRenderer(ImageIcon icon, ViewNode node) {
30 this.node = node;
38 if (node.hasMargins) {
39 d.width += node.marginLeft + node.marginRight;
40 d.height += node.marginTop + node.marginBottom;
65 if ((node.paddingBottom | node.paddingLeft
[all...] |
| /system/core/libcutils/ |
| config_utils.c | 28 cnode *node; local
30 node = calloc(sizeof(cnode), 1);
31 if(node) {
32 node->name = name ? name : "";
33 node->value = value ? value : "";
36 return node;
41 cnode *node, *match = NULL; local
44 for(node = root->first_child; node; node = node->next
53 cnode *node; local
69 cnode *node; local
87 cnode *node; local
97 cnode *node; local
264 cnode *node; local
[all...] |
| dir_hash.c | 150 struct list *node = malloc(sizeof(struct list)); local
152 if (name == NULL || node == NULL) {
161 free(node);
167 node->name = name;
168 node->next = list;
169 list = node;
|
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 141 for (ViewNode node : root.children) {
142 updateIndices(node);
154 private static void loadProperties(ViewNode node, String data) {
168 node.properties.add(property);
169 node.namedProperties.put(property.name, property);
177 Collections.sort(node.properties, new Comparator<ViewNode.Property>() {
183 node.decode();
|
| /frameworks/base/core/java/android/content/ |
| ContentService.java | 185 ObserverCall(ObserverNode node, IContentObserver observer,
187 mNode = node;
532 // If this is the leaf node add the observer
545 ObserverNode node = mChildren.get(i); local
546 if (node.mName.equals(segment)) {
547 node.addObserverLocked(uri, index + 1, observer, notifyForDescendents, observersLock);
553 ObserverNode node = new ObserverNode(segment); local
554 mChildren.add(node);
555 node.addObserverLocked(uri, index + 1, observer, notifyForDescendents, observersLock);
612 // This is the leaf node, notify all observer
622 ObserverNode node = mChildren.get(i); local
[all...] |
| /bionic/libc/kernel/arch-sh/asm/ |
| clock.h | 33 struct list_head node; member in struct:clk
|
| /external/bison/src/ |
| LR0.c | 63 state_list *node = xmalloc (sizeof *node); local
70 node->next = NULL;
71 node->state = s;
74 first_state = node;
76 last_state->next = node;
77 last_state = node;
|
| /external/chromium/net/disk_cache/ |
| mem_backend_impl.cc | 194 MemEntryImpl* node = next; local
197 if (node->GetLastUsed() < initial_time)
200 if (node->GetLastUsed() < end_time)
201 node->Doom();
238 MemEntryImpl* node = rankings_.GetNext(current); local
241 while (node && node->type() != MemEntryImpl::kParentEntry) {
242 node = rankings_.GetNext(node);
244 *next_entry = node;
272 MemEntryImpl* node = next; local
[all...] |
| /external/libxml2/include/libxml/ |
| valid.h | 87 /* Node analysis stack used when validating within entities */
88 xmlNodePtr node; /* Current parsed Node */ member in struct:_xmlValidCtxt
|
| /external/openssl/crypto/x509v3/ |
| pcy_tree.c | 74 X509_POLICY_NODE *node, int indent)
77 || !(node->data->flags & POLICY_DATA_FLAG_MAP_MASK))
82 STACK_OF(ASN1_OBJECT) *pset = node->data->expected_policy_set;
100 X509_POLICY_NODE *node; local
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
117 X509_POLICY_NODE_print(err, node, 2);
118 expected_print(err, plev, node, 2);
119 BIO_printf(err, " Flags: %x\n", node->data->flags);
314 X509_POLICY_NODE *node; local
319 node = sk_X509_POLICY_NODE_value(last->nodes, i)
449 X509_POLICY_NODE *node; local
508 X509_POLICY_NODE *node; local
591 X509_POLICY_NODE *node, *anyptr; local
638 X509_POLICY_NODE *node; local
[all...] |
| /external/oprofile/libdb/ |
| db_manage.c | 53 * return the number of bytes used by hash table, node table and header.
93 /* rebuild the hash table, node zero is never used. This works
94 * because layout of file is node table then hash table,
95 * sizeof(node) > sizeof(bucket) and when we grow table we
114 odb_node_t * node = &data->node_base[pos]; local
115 size_t index = odb_do_hash(data, node->key);
116 node->next = data->hash_base[index];
221 /* Calculate nr node allowing a sanity check later */
241 /* file already exist, sanity check nr node */
|
