| /external/webkit/WebCore/page/ |
| Frame.cpp | 432 static_cast<HTMLTableCellElement*>(cellAboveRenderer->node());
437 for (Node* n = aboveCell->firstChild(); n; n = n->traverseNextNode(aboveCell)) {
476 // walk backwards in the node tree, until another element, or form, or end of tree
478 Node* n;
582 ASSERT(!s.base().node() || s.base().node()->document() == document());
583 ASSERT(!s.extent().node() || s.extent().node()->document() == document());
584 ASSERT(!s.start().node() || s.start().node()->document() == document())
937 Node* node = selection()->selection().visibleStart().deepEquivalent().node(); local
1756 Node* node = result.innerNode(); local
[all...] |
| /external/webkit/WebCore/rendering/ |
| RenderBlockLineLayout.cpp | 630 Node* node = o->node(); local
635 if (node && node->isTextNode() &&
636 !static_cast<Text*>(node)->containsOnlyWhitespace()) {
637 int length = static_cast<Text*>(node)->length();
642 (!node->parent()->hasTagName(HTMLNames::aTag) &&
643 !node->parent()->hasTagName(HTMLNames::liTag))))
[all...] |
| RenderObject.h | 143 // Anonymous objects should pass the document as their node, and they will then automatically be
145 RenderObject(Node*);
247 static RenderObject* createObject(Node*, RenderStyle*);
372 bool isInlineContinuation() const { return (node() ? node()->renderer() != this : false) && isRenderInline(); }
423 Node* node() const { return m_isAnonymous ? 0 : m_node; } function in class:WebCore::RenderObject
425 void setNode(Node* node) { m_node = node; }
[all...] |
| SVGRootInlineBox.cpp | 1025 Node* node = flowBox->renderer()->node(); local
1474 Node* node = text->node()->parent(); local
[all...] |
| /external/webkit/WebKit/android/jni/ |
| WebCoreFrameBridge.cpp | 1411 WebCore::Node* node = form->firstItem(); local
1444 WebCore::Node* node = form->firstItem(); local
1490 WebCore::Node* node = form->firstItem(); local
[all...] |
| /external/webkit/WebKit/android/nav/ |
| CachedRoot.cpp | 689 // see if there's a middle node
690 // if the middle node is in the visited list,
785 const CachedNode* node = findBestAt(rect, &best, &inside, &directHit, local
787 DBG_NAV_LOGD("node=%d (%p)", node == NULL ? 0 : node->index(),
788 node == NULL ? NULL : node->nodePointer());
789 if (node == NULL) {
790 node = findBestHitAt(rect, framePtr, x, y)
841 const CachedNode* node = findAt(rect, &frame, &fx, &fy, true); local
1143 CachedNode* node = const_cast<CachedNode*>(best->mNode); local
1213 const CachedNode* node = frame->document(); local
[all...] |
| /external/webkit/WebKit/chromium/src/ |
| WebFrameImpl.cpp | 216 // Just got a null node, we can forge ahead!
401 for (Node* child = children->firstItem(); child; child = children->nextItem()) {
534 Node* node = xpathResult->iterateNext(ec);
536 if (!node || !node->isFrameOwnerElement())
539 static_cast<HTMLFrameOwnerElement*>(node);
560 Node* node = forms->item(i); local
562 if (node)
1868 Node* node = textPiece->startContainer(exception); local
[all...] |
| /frameworks/base/core/java/com/google/android/util/ |
| AbstractMessageParser.java | 1360 TrieNode node = children.get(key); local
[all...] |
| /frameworks/base/media/libstagefright/ |
| OMXCodec.cpp | 487 IOMX::node_id node = 0; local
503 LOGV("Attempting to allocate OMX node '%s'", componentName);
522 status_t err = omx->allocateNode(componentName, observer, &node);
524 LOGV("Successfully allocated OMX node '%s'", componentName);
527 omx, node, quirks,
3662 IOMX::node_id node; local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 119 * (predecessor, node, successor) in order to detect when and how
125 * marking a pointer, they splice in another node that can be
133 * because any search need only read ahead one more node than
138 * algorithm of changing the next-pointer of a deleted node so
140 * changing the pointer to point to a different node, not by
150 * similar to typical lazy-deletion schemes. If a node's value is
163 * Here's the sequence of events for a deletion of node n with
172 * the node consider this mapping to exist. However, other
176 * 2. CAS n's next pointer to point to a new marker node.
193 * thread noticed during a traversal a node with null value an
524 final Node<K,V> node; field in class:ConcurrentSkipListMap.Index
[all...] |
| /libcore/luni/src/main/java/org/apache/xalan/templates/ |
| StylesheetRoot.java | 91 m_selectDefault = new XPath("node()", this, this, XPath.SELECT, errorListener);
743 * Get an "xsl:template" property by node match. This looks in the imports as
748 * @param targetNode non-null reference of node that the template must match.
749 * @param mode qualified name of the node, or null.
770 * Get an "xsl:template" property by node match. This looks in the imports as
775 * @param targetNode non-null reference of node that the template must match.
776 * @param mode qualified name of the node, or null.
1027 * Get the default template for a root node.
1029 * @return The default template for a root node.
1045 * Get the default template for a root node
1169 ElemTemplateElement node = (ElemTemplateElement) v.elementAt(lo); local
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBase.java | 50 // node of a DTM.
51 /** The identity of the root node. */
56 * node index.
60 /** The expanded names, one array element for each node. */
63 /** First child values, one array element for each node. */
66 /** Next sibling values, one array element for each node. */
69 /** Previous sibling values, one array element for each node. */
72 /** Previous sibling values, one array element for each node. */
90 /** The default block size of the node arrays */
93 /** The number of blocks for the node arrays *
1157 int node = makeNodeIdentity(nodeHandle); local
1190 int node = _firstch(parent); local
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
| SAX2DTM2.java | 69 * Iterator that returns all immediate children of a given node
80 * or set current node to END, to indicate request-not-honored?
82 * @param node Sets the root of the iteration.
86 public DTMAxisIterator setStartNode(int node)
89 if (node == DTMDefaultBase.ROOTNODE)
90 node = getDocument();
93 _startNode = node;
94 _currentNode = (node == DTM.NULL) ? DTM.NULL
95 : _firstch2(makeNodeIdentity(node));
104 * Get the next node in the iteration
112 int node = _currentNode; local
268 int node = _currentNode; local
313 int node = _currentNode; local
375 final int node = _startNode; local
477 int node = _currentNode; local
536 final int node = _currentNode; local
599 final int node = _currentNode; local
690 final int node = _currentNode; local
727 int node = _currentNode; local
763 int node = _currentNode; local
983 int node = _currentNode; local
1116 int node = _currentNode; local
1169 int node; local
1577 int node = _currentNode; local
1665 int node = _currentNode; local
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/engine/ |
| ndbdic.c | 100 static NJ_INT16 search_yomi_node(NJ_UINT8 operation, NJ_UINT8 *node,
552 NJ_UINT8 *root, *now, *node, *node_mid; local
580 node = NULL;
611 node = root;
757 node = now;
766 node = now;
793 now = node;
796 if ((node == NULL) || !(NODE_DATA_EXIST(node))) {
799 (node != NULL))
1541 NJ_UINT8 *root, *now, *node, *node_mid; local
2255 NJ_UINT8 *node; local
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
| nj_lib.h | 120 NJ_UINT8 *node; member in struct:__anon11175
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| cpplib.h | 209 node; member in union:cpp_token_u
553 /* The structure of a node in the hash table. The hash table has
561 diagnostic may be required for this node. Currently this only
564 /* Hash node flags. */
575 /* Different flavors of hash node. */
600 #define HT_NODE(NODE) ((ht_identifier *) (NODE))
601 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident)
602 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| cpplib.h | 209 node; member in union:cpp_token_u
553 /* The structure of a node in the hash table. The hash table has
561 diagnostic may be required for this node. Currently this only
564 /* Hash node flags. */
575 /* Different flavors of hash node. */
600 #define HT_NODE(NODE) ((ht_identifier *) (NODE))
601 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident)
602 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| LayoutCanvas.java | 81 import org.w3c.dom.Node;
732 * Creates or updates the node proxy for this canvas view info.
1305 Node node = key == null ? null : key.getXmlNode(); local
1423 Node node = key.getXmlNode(); local
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| ScreenViewer.java | 73 private ViewNode node; field in class:ScreenViewer
242 void select(ViewNode node) {
243 this.node = node;
581 if (node != null) {
584 ViewNode p = node.parent;
589 s.drawRect(node.left, node.top, node.width - 1, node.height - 1)
[all...] |
| /system/core/adb/ |
| sysdeps_win32.c | 1266 static void fdevent_plist_enqueue(fdevent *node);
1267 static void fdevent_plist_remove(fdevent *node)
1366 EventHook node = *pnode; local
1381 EventHook node; local
1413 EventHook node = *pnode; local
1642 fdevent *node = list->next; local
[all...] |
| /bionic/libc/kernel/common/linux/ |
| blkdev.h | 348 int node; member in struct:request_queue
|
| /development/ndk/platforms/android-3/include/linux/ |
| blkdev.h | 348 int node; member in struct:request_queue
|
| /external/bluetooth/glib/gobject/ |
| gtype.c | 179 static inline GTypeFundamentalInfo* type_node_fundamental_info_I (TypeNode *node);
180 static void type_add_flags_W (TypeNode *node,
182 static void type_data_make_W (TypeNode *node,
185 static inline void type_data_ref_Wm (TypeNode *node);
186 static inline void type_data_unref_WmREC (TypeNode *node,
190 static inline gpointer type_get_qdata_L (TypeNode *node,
192 static inline void type_set_qdata_W (TypeNode *node,
198 TypeNode *node);
200 TypeNode *node);
201 static gboolean type_node_is_a_L (TypeNode *node,
386 TypeNode *node; local
490 TypeNode *node; local
590 TypeNode *node = lookup_type_node_I (type); local
870 TypeNode *node = NULL; local
886 TypeNode *node = lookup_type_node_I (instance_type); local
1426 TypeNode *node = lookup_type_node_I (prerequisite); local
1579 InstanceRealClass key, *node; local
1597 InstanceRealClass key, *node; local
1631 TypeNode *node; local
1692 TypeNode *node; local
2084 TypeNode *node = lookup_type_node_I (type); local
2345 TypeNode *node; local
2455 TypeNode *pnode, *node; local
2510 TypeNode *pnode, *node; local
2561 TypeNode *node = lookup_type_node_I (instance_type); local
2585 TypeNode *node; local
2621 TypeNode *node; local
2680 TypeNode *node; local
2708 TypeNode *node; local
2739 TypeNode *node; local
2767 TypeNode *node; local
2803 TypeNode *node; local
2839 TypeNode *node; local
2882 TypeNode *node; local
2936 TypeNode *node; local
2985 TypeNode *node; local
3016 TypeNode *node; local
3048 TypeNode *node; local
3068 TypeNode *node; local
3117 TypeNode *node; local
3136 TypeNode *node; local
3163 TypeNode *node; local
3244 TypeNode *node, *iface_node; local
3268 TypeNode *node; local
3311 TypeNode *node; local
3399 TypeNode *node; local
3465 TypeNode *node; local
3513 TypeNode *node; local
3541 TypeNode *node; local
3587 TypeNode *node; local
3611 TypeNode *node; local
3678 TypeNode *node = lookup_type_node_I (type_id); local
3687 TypeNode *node, *iface; local
3704 TypeNode *node, *iface; local
3725 TypeNode *node, *iface; local
3758 TypeNode *node, *iface; local
3802 TypeNode *node = lookup_type_node_I (type_instance->g_class->g_type); local
3823 TypeNode *node; local
3895 TypeNode *node = lookup_type_node_I (type); local
3981 TypeNode *node; local
4143 TypeNode *node = lookup_type_node_I (instance_type); local
[all...] |
| /external/genext2fs/ |
| genext2fs.c | 919 /* find the one with the most free blocks and allocate node there */
1255 inode *node; local
1368 inode *node; local
1380 inode *node; local
[all...] |
| /external/kernel-headers/original/linux/ |
| blkdev.h | 419 int node; member in struct:request_queue
|
