| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/analysis/ |
| DepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 public void inStart(Start node)
12 defaultIn(node);
15 public void outStart(Start node)
17 defaultOut(node);
20 public void defaultIn(@SuppressWarnings("unused") Node node)
25 public void defaultOut(@SuppressWarnings("unused") Node node)
31 public void caseStart(Start node)
[all...] |
| ReversedDepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 public void inStart(Start node)
12 defaultIn(node);
15 public void outStart(Start node)
17 defaultOut(node);
20 public void defaultIn(@SuppressWarnings("unused") Node node)
25 public void defaultOut(@SuppressWarnings("unused") Node node)
31 public void caseStart(Start node)
[all...] |
| AnalysisAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 private Hashtable<Node,Object> in;
11 private Hashtable<Node,Object> out;
13 public Object getIn(Node node)
20 return this.in.get(node);
23 public void setIn(Node node, Object o)
27 this.in = new Hashtable<Node,Object>(1);
32 this.in.put(node, o)
[all...] |
| Analysis.java | 5 import com.google.clearsilver.jsilver.syntax.node.*;
9 Object getIn(Node node);
10 void setIn(Node node, Object o);
11 Object getOut(Node node);
12 void setOut(Node node, Object o);
14 void caseStart(Start node);
[all...] |
| /external/javassist/src/main/javassist/bytecode/annotation/ |
| MemberValueVisitor.java | 25 public void visitAnnotationMemberValue(AnnotationMemberValue node);
26 public void visitArrayMemberValue(ArrayMemberValue node);
27 public void visitBooleanMemberValue(BooleanMemberValue node);
28 public void visitByteMemberValue(ByteMemberValue node);
29 public void visitCharMemberValue(CharMemberValue node);
30 public void visitDoubleMemberValue(DoubleMemberValue node);
31 public void visitEnumMemberValue(EnumMemberValue node);
32 public void visitFloatMemberValue(FloatMemberValue node);
33 public void visitIntegerMemberValue(IntegerMemberValue node);
34 public void visitLongMemberValue(LongMemberValue node);
[all...] |
| /external/qemu/ |
| aio.c | 39 QLIST_ENTRY(AioHandler) node;
44 AioHandler *node; local
46 QLIST_FOREACH(node, &aio_handlers, node) {
47 if (node->fd == fd)
48 if (!node->deleted)
49 return node;
62 AioHandler *node; local
64 node = find_aio_handler(fd);
68 if (node) {
103 AioHandler *node; local
125 AioHandler *node; local
158 AioHandler *node; local
[all...] |
| aio-android.c | 40 QLIST_ENTRY(AioHandler) node;
45 AioHandler *node; local
47 QLIST_FOREACH(node, &aio_handlers, node) {
48 if (node->fd == fd)
49 if (!node->deleted)
50 return node;
63 AioHandler *node; local
65 node = find_aio_handler(fd);
69 if (node) {
104 AioHandler *node; local
126 AioHandler *node; local
162 AioHandler *node; local
[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/sh/ |
| redir.h | 42 union node;
43 void redirect(union node *, int);
|
| nodes.h | 36 union node *ch1;
37 union node *ch2;
44 union node *args;
45 union node *redirect;
58 union node *n;
59 union node *redirect;
65 union node *test;
66 union node *ifpart;
67 union node *elsepart;
73 union node *args
134 union node { union
[all...] |
| /external/webkit/Source/JavaScriptCore/API/tests/ |
| Node.c | 26 #include "Node.h"
30 Node* Node_new(void)
32 Node* node = (Node*)malloc(sizeof(Node)); local
33 node->refCount = 0;
34 node->nodeType = "Node";
35 node->childNodesTail = NULL
[all...] |
| /external/chromium/net/disk_cache/ |
| mem_rankings.cc | 16 void MemRankings::Insert(MemEntryImpl* node) {
18 head_->set_prev(node);
21 tail_ = node;
23 node->set_prev(NULL);
24 node->set_next(head_);
25 head_ = node;
28 void MemRankings::Remove(MemEntryImpl* node) {
29 MemEntryImpl* prev = node->prev();
30 MemEntryImpl* next = node->next();
32 if (head_ == node)
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| DoublyLinkedList.h | 31 template <typename Node> class DoublyLinkedList {
37 Node* head();
39 void append(Node*);
40 void remove(Node*);
43 Node* m_head;
44 Node* m_tail;
47 template <typename Node> inline DoublyLinkedList<Node>::DoublyLinkedList()
53 template <typename Node> inline bool DoublyLinkedList<Node>::isEmpty(
[all...] |
| /external/skia/third_party/glu/libtess/ |
| dict.c | 70 DictNode *node; local
72 for( node = dict->head.next; node != &dict->head; node = node->next ) {
73 memFree( node );
79 DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
84 node = node->prev;
85 } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key))
110 DictNode *node = &dict->head; local
[all...] |
| /external/webkit/Source/WebCore/xml/ |
| XMLSerializer.cpp | 29 String XMLSerializer::serializeToString(Node* node, ExceptionCode& ec)
31 if (!node)
34 if (!node->document()) {
37 // with it. It should be the only type of node where this is possible.
38 ASSERT(node->nodeType() == Node::DOCUMENT_TYPE_NODE);
44 return createMarkup(node);
|
| /tools/motodev/src/plugins/db.core/src/com/motorolamobility/studio/android/db/core/ui/ |
| AbstractLoadingNodeJob.java | 22 * Caller must implement the run method with all logic to load the node children.
23 * There's no need to take care of loading node and/or setting the node loading flag.
28 protected ITreeNode node = null;
field in class:AbstractLoadingNodeJob
30 public AbstractLoadingNodeJob(String name, ITreeNode node)
33 this.node = node;
38 * @return the node
42 return node;
|
| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGGraph.cpp | 46 Node& node = at(nodeIndex); local
47 NodeType op = node.op;
49 unsigned refCount = node.refCount;
52 bool mustGenerate = node.mustGenerate();
63 // not including the 'mustGenerate' ref. If the node is
65 // (3) The virtual register slot assigned to this node.
68 // @# - a NodeIndex referencing a prior node in the graph.
73 printf("% 4d:\t<%c%u:%u>\t%s(", (int)nodeIndex, mustGenerate ? '!' : ' ', refCount, node.virtualRegister, dfgOpNames[op & NodeIdMask]);
74 if (node.child1 != NoNode
140 Node& node = at(op); local
160 Node& node = at(op); local
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| NodeIterator.cpp | 39 NodeIterator::NodePointer::NodePointer(PassRefPtr<Node> n, bool b)
40 : node(n)
47 node.clear();
50 bool NodeIterator::NodePointer::moveToNext(Node* root)
52 if (!node)
58 node = node->traverseNextNode(root);
59 return node;
62 bool NodeIterator::NodePointer::moveToPrevious(Node* root)
64 if (!node)
180 Node* node = removedNode->traverseNextNode(root()); local
209 Node* node = removedNode->traversePreviousNode(root()); local
[all...] |
| TreeWalker.cpp | 36 TreeWalker::TreeWalker(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
42 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec)
44 if (!node) {
48 m_current = node;
51 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node)
53 m_current = node;
57 Node* TreeWalker::parentNode(ScriptState* state
59 RefPtr<Node> node = m_current; local
141 RefPtr<Node> node = m_current; local
178 RefPtr<Node> node = m_current; local
215 RefPtr<Node> node = m_current; local
254 RefPtr<Node> node = m_current; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/interpreter/ |
| ExpressionEvaluator.java | 23 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
24 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
25 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
26 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
27 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
28 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
30 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
31 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
32 import com.google.clearsilver.jsilver.syntax.node.AGteExpression
[all...] |
| /external/jmonkeyengine/engine/src/niftygui/com/jme3/niftygui/ |
| SoundHandleJme.java | 43 private AudioNode node; field in class:SoundHandleJme
48 public SoundHandleJme(AudioRenderer ar, AudioNode node){
49 if (ar == null || node == null)
52 this.node = node;
74 if (node != null){
75 node.stop();
78 node = new AudioNode(am, fileName, true);
79 node.setPositional(false);
80 node.setVolume(volume)
[all...] |
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
| RemoveTree.cpp | 30 void RemoveTree::visitSymbol(TIntermSymbol* node)
32 delete node;
35 bool RemoveTree::visitBinary(Visit visit, TIntermBinary* node)
37 delete node;
42 bool RemoveTree::visitUnary(Visit visit, TIntermUnary* node)
44 delete node;
49 bool RemoveTree::visitAggregate(Visit visit, TIntermAggregate* node)
51 delete node;
56 bool RemoveTree::visitSelection(Visit visit, TIntermSelection* node)
58 delete node;
[all...] |
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityList.cpp | 77 Node* node = m_renderer->node();
85 return node && node->hasTagName(ulTag);
97 Node* node = m_renderer->node();
98 return node && node->hasTagName(olTag);
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| AddressListParserVisitor.java | 7 public Object visit(SimpleNode node, Object data);
8 public Object visit(ASTaddress_list node, Object data);
9 public Object visit(ASTaddress node, Object data);
10 public Object visit(ASTmailbox node, Object data);
11 public Object visit(ASTname_addr node, Object data);
12 public Object visit(ASTgroup_body node, Object data);
13 public Object visit(ASTangle_addr node, Object data);
14 public Object visit(ASTroute node, Object data);
15 public Object visit(ASTphrase node, Object data);
16 public Object visit(ASTaddr_spec node, Object data)
[all...] |
| /system/core/include/cutils/ |
| list.h | 32 #define node_to_item(node, container, member) \
33 (container *) (((char*) (node)) - offsetof(container, member))
41 #define list_for_each(node, list) \
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \
45 for (node = (list)->prev; node != (list); node = node->prev
[all...] |
