| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcglyph.h | 87 * If it returns NULL, you should create a new node, then call
150 FTC_NodeRec node; member in struct:FTC_GNodeRec_
179 FTC_GNode_Init( FTC_GNode node,
180 FT_UInt gindex, /* glyph index for node */
185 /* returns TRUE iff the query's glyph index correspond to the node; */
196 /* call this function to clear a node's family -- this is necessary */
204 FTC_GNode_Done( FTC_GNode node,
281 gindex, query, node, error ) \
301 FTC_CACHE_LOOKUP_CMP( cache, nodecmp, hash, query, node, error ); \
312 gindex, query, node, error )
[all...] |
| /external/chromium_org/third_party/libwebp/utils/ |
| huffman.c | 30 static void TreeNodeInit(HuffmanTreeNode* const node) {
31 node->children_ = -1; // means: 'unassigned so far'
34 static int NodeIsEmpty(const HuffmanTreeNode* const node) {
35 return (node->children_ < 0);
43 HuffmanTreeNode* const node) {
45 node->children_ = (int)(children - node);
46 assert(children - node == (int)(children - node));
192 HuffmanTreeNode* node = tree->root_ local
[all...] |
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| valid.h | 87 /* Node analysis stack used when validating within entities */
88 xmlNodePtr node; /* Current parsed Node */ member in struct:_xmlValidCtxt
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_function_detect_recursion.cpp | 147 void *node; local
149 node = ralloc_size(ctx, size);
150 assert(node != NULL);
152 return node;
157 static void operator delete(void *node)
159 ralloc_free(node);
225 call_node *node = new(mem_ctx) call_node; local
226 node->func = target;
227 this->current->callees.push_tail(node);
231 node = new(mem_ctx) call_node
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| shared.c | 361 struct simple_node *node; local
364 foreach_s(node, temp, & shared->SyncObjects) {
365 _mesa_unref_sync_object(ctx, (struct gl_sync_object *) node);
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| hash_table.c | 35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...] |
| /external/chromium_org/third_party/openssl/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)
448 X509_POLICY_NODE *node; local
507 X509_POLICY_NODE *node; local
590 X509_POLICY_NODE *node, *anyptr; local
637 X509_POLICY_NODE *node; local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| inttree.c | 100 /* INPUTS: the node to rotate on */
164 /* INPUTS: node to rotate on */
227 /* INPUTS: z is the node to insert */
273 /* INPUTS: x is the node to start from*/
295 /* Before calling InsertNode the node x should have its key set */
302 /* OUTPUT: This function returns a pointer to the newly inserted node */
303 /* which is guarunteed to be valid until this node is deleted. */
310 /* EFFECTS: Creates a node node which contains the appropriate key and */
377 /* INPUTS: x is the node we want the succesor of *
498 struct IntervalTreeNode *node; member in struct:nodeent
[all...] |
| /external/chromium_org/tools/grit/grit/node/ |
| message.py | 12 from grit.node import base
99 Returns the concatenation of the parent's node first_id and
100 this node's offset if it has one, otherwise just call the
104 # we search for the first grouping node in the parents' list
105 # to take care of the case where the first parent is an <if> node
107 import grit.node.empty namespace
109 grit.node.empty.GroupingNode):
164 '''Sets this node's clique from a tclib.Message instance.
229 '''Constructs a new message node that is a child of 'parent', with the
236 node = MessageNode(
[all...] |
| /external/chromium_org/tools/grit/grit/tool/ |
| rc2grd.py | 15 import grit.node.empty namespace
16 from grit.node import include
17 from grit.node import structure
18 from grit.node import message
210 grit.node.base.Node subclass
238 assert (isinstance(includes, grit.node.empty.IncludesNode) and
239 isinstance(structures, grit.node.empty.StructuresNode) and
240 isinstance(messages, grit.node.empty.MessagesNode))
268 def AddIncludes(self, rctext, node)
[all...] |
| /external/chromium_org/ui/accessibility/ |
| ax_tree.cc | 17 std::string TreeToStringHelper(AXNode* node, int indent) {
19 result += node->data().ToString() + "\n";
20 for (int i = 0; i < node->child_count(); ++i)
21 result += TreeToStringHelper(node->ChildAtIndex(i), indent + 1);
84 AXNode* node = GetFromId(update.node_id_to_clear); local
85 if (!node) {
90 if (node == root_) {
94 for (int i = 0; i < node->child_count(); ++i)
95 DestroyNodeAndSubtree(node->ChildAtIndex(i));
97 node->SwapChildren(children)
118 AXNode* node = GetFromId(update.nodes[i].id); local
155 AXNode* node = GetFromId(src.id); local
[all...] |
| /external/chromium_org/ui/base/models/ |
| tree_node_model.h | 25 // TreeNodes own their children, so that deleting a node deletes all
31 // if you directly invoke set_title on a node it does not notify the observer,
48 // that corresponds to the type of the node. When subclassing use your class
52 // type parameter: a value type that is associated with the node.
56 // want to associate a value with each node, then use TreeNodeWithValue.
73 // Adds |node| as a child of this node, at |index|.
74 virtual void Add(NodeType* node, int index) {
75 DCHECK(node);
78 // If |node| has a parent, remove it from its parent
274 DCHECK(node); variable
288 DCHECK(node); variable
290 NotifyObserverTreeNodeChanged(node); variable
[all...] |
| /external/chromium_org/v8/src/ |
| splay-tree-inl.h | 25 // If the tree is empty, insert the new node.
26 root_ = new(allocator_) Node(key, Config::NoValue());
28 // Splay on the key to move the last node on the search path
37 // Insert the new node.
38 Node* node = new(allocator_) Node(key, Config::NoValue()); local
39 InsertInternal(cmp, node);
47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
285 Node* node = nodes_to_visit[pos++]; local
[all...] |
| /external/clang/test/SemaTemplate/ |
| instantiate-member-class.cpp | 66 struct node;
67 static node *Head;
68 struct node { struct in struct:test1::Registry
69 node(int v) { Head = this; } function in struct:test1::Registry::node
73 Registry<int>::node node(0);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepotbase.h | 23 template <class Node, int kReservedBits, int kTabSizeLog>
26 typedef typename Node::args_type args_type;
27 typedef typename Node::handle_type handle_type;
36 static Node *find(Node *s, args_type args, u32 hash);
37 static Node *lock(atomic_uintptr_t *p);
38 static void unlock(atomic_uintptr_t *p, Node *s);
48 atomic_uintptr_t tab[kTabSize]; // Hash table of Node's.
56 template <class Node, int kReservedBits, int kTabSizeLog>
57 Node *StackDepotBase<Node, kReservedBits, kTabSizeLog>::find(Node *s
103 Node *node = find(s, args, h); local
[all...] |
| /external/deqp/framework/common/ |
| tcuTestExecutor.cpp | 54 // Create the root node.
236 // Get full path to node.
243 nodePath += iter.node->getName();
246 // Handle the node.
248 DE_ASSERT(iter.node != DE_NULL);
249 TestNode* node = iter.node; local
250 bool isLeaf = isTestNodeTypeExecutable(node->getNodeType());
263 // Enter node.
265 switch (node->getNodeType()
[all...] |
| tcuTestExecutor.hpp | 96 : node (DE_NULL)
103 : node (node_)
119 node->getChildren(children);
131 TestNode* node; member in struct:tcu::TestExecutor::NodeIter
|
| /external/droiddriver/src/com/google/android/droiddriver/uiautomation/ |
| UiAutomationElement.java | 52 private final AccessibilityNodeInfo node; field in class:UiAutomationElement
67 protected UiAutomationElement(UiAutomationContext context, AccessibilityNodeInfo node,
69 this.node = Preconditions.checkNotNull(node);
74 put(attribs, Attribute.PACKAGE, charSequenceToString(node.getPackageName()));
75 put(attribs, Attribute.CLASS, charSequenceToString(node.getClassName()));
76 put(attribs, Attribute.TEXT, charSequenceToString(node.getText()));
77 put(attribs, Attribute.CONTENT_DESC, charSequenceToString(node.getContentDescription()));
78 put(attribs, Attribute.RESOURCE_ID, charSequenceToString(node.getViewIdResourceName()));
79 put(attribs, Attribute.CHECKABLE, node.isCheckable())
[all...] |
| /external/freetype/src/cache/ |
| ftcbasic.c | 217 /* we must call this function to avoid this node from appearing
285 FTC_Node node = 0; /* make compiler happy */ local
326 node,
332 &node );
336 *aglyph = FTC_INODE( node )->glyph;
340 *anode = node;
341 node->ref_count++;
361 FTC_Node node = 0; /* make compiler happy */ local
394 node,
398 *aglyph = FTC_INODE( node )->glyph
473 FTC_Node node = 0; \/* make compiler happy *\/ local
551 FTC_Node node = 0; \/* make compiler happy *\/ local
[all...] |
| ftccache.c | 42 /***** CACHE NODE DEFINITIONS *****/
47 /* add a new node to the head of the manager's circular MRU list */
49 ftc_node_mru_link( FTC_Node node,
56 (FTC_MruNode)node );
61 /* remove a node from the manager's MRU list */
63 ftc_node_mru_unlink( FTC_Node node,
70 (FTC_MruNode)node );
77 /* move a node to the head of the manager's MRU list */
79 ftc_node_mru_up( FTC_Node node,
83 (FTC_MruNode)node );
117 FTC_Node node, *pnode; local
232 FTC_Node node = *pnode; local
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; local
450 FTC_Node node; local
490 FTC_Node node; local
581 FTC_Node node = *pnode; local
603 FTC_Node node; local
[all...] |
| ftccmap.c | 39 /* For now, the implementation is very basic: Each node maps a range of */
48 /* number of glyph indices / character code per node */
51 /* compute a query/node hash */
69 /* the cmap cache node */
72 FTC_NodeRec node; member in struct:FTC_CMapNodeRec_
75 FT_UInt32 first; /* first character in node */
102 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
106 FT_FREE( node );
110 /* initialize a new cmap node */
120 FTC_CMapNode node = NULL local
159 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
185 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
242 FTC_Node node; local
[all...] |
| ftcglyph.h | 87 * If it returns NULL, you should create a new node, then call
150 FTC_NodeRec node; member in struct:FTC_GNodeRec_
179 FTC_GNode_Init( FTC_GNode node,
180 FT_UInt gindex, /* glyph index for node */
185 /* returns TRUE iff the query's glyph index correspond to the node; */
196 /* call this function to clear a node's family -- this is necessary */
204 FTC_GNode_Done( FTC_GNode node,
281 gindex, query, node, error ) \
301 FTC_CACHE_LOOKUP_CMP( cache, nodecmp, hash, query, node, error ); \
312 gindex, query, node, error )
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BstTesting.java | 51 SimpleNode node = (SimpleNode) obj; local
52 return getKey().equals(node.getKey())
53 && Objects.equal(childOrNull(LEFT), node.childOrNull(LEFT))
54 && Objects.equal(childOrNull(RIGHT), node.childOrNull(RIGHT));
162 SimpleNode node = new SimpleNode('a', null, null); local
163 tester.setDefault(BstNode.class, node);
168 tester.setDefault(BstPath.class, pathFactory.initialPath(node));
169 tester.setDefault(BstInOrderPath.class, pathFactory.initialPath(node));
|
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| TemplateTranslator.java | 39 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
40 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand;
41 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
42 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
43 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
44 import com.google.clearsilver.jsilver.syntax.node.AEachCommand;
45 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand;
46 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
47 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand;
48 import com.google.clearsilver.jsilver.syntax.node.AHardLincludeCommand
[all...] |
| /external/libselinux/src/ |
| stringrep.c | 38 struct discover_class_node *node = discover_class_cache; local
40 for (; node != NULL && strcmp(s,node->name) != 0; node = node->next);
42 return node;
47 struct discover_class_node *node = discover_class_cache; local
49 for (; node != NULL && c != node->value; node = node->next)
63 struct discover_class_node *node; local
183 struct discover_class_node *node; local
200 struct discover_class_node *node; local
217 struct discover_class_node *node; local
230 struct discover_class_node *node; local
[all...] |
