| /external/cmockery/cmockery_0_1_2/src/ |
| cmockery.c | 50 // Doubly linked list node.
64 ListNode node; // Node within list of all allocated blocks. member in struct:MallocBlockInfo
117 static ListNode* list_initialize(ListNode * const node);
122 ListNode * const node, const CleanupListValue cleanup_value,
125 ListNode * const node, const CleanupListValue cleanup_value,
309 // Initialize a list node.
310 static ListNode* list_initialize(ListNode * const node) {
311 node->value = NULL;
312 node->next = node
1345 const ListNode *node; local
1369 const ListNode *node; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| profile.c | 147 #define CHECK_MAGIC(node) \
148 if ((node)->magic != PROF_MAGIC_NODE) \
184 (struct profile_node *node);
196 struct profile_node **node);
690 struct profile_node *node; local
833 profile_add_node(state->current_section, tag, value, &node);
835 node->final = 1;
1036 * Each node may represent either a relation or a section header.
1047 * Free a node, and any children
1049 void profile_free_node(struct profile_node *node)
1276 struct profile_node *node; member in struct:profile_iterator
[all...] |
| /external/fio/ |
| goptions.c | 135 GNode *child, *node; local
140 node = g_node_find(gopt_dep_tree, G_IN_ORDER, G_TRAVERSE_ALL, parent);
141 child = g_node_first_child(node);
1610 GNode *node, *nparent; local
[all...] |
| /external/flac/libFLAC/ |
| metadata_iterators.c | 972 FLAC__Metadata_Node *node, *next; local
1039 const FLAC__Metadata_Node *node; local
1134 FLAC__Metadata_Node *node; local
1175 FLAC__Metadata_Node *node; local
1282 FLAC__Metadata_Node *node; local
1350 FLAC__Metadata_Node *node; local
1402 const FLAC__Metadata_Node *node; local
1461 const FLAC__Metadata_Node *node; local
1685 const FLAC__Metadata_Node *node; local
1785 const FLAC__Metadata_Node *node; local
1797 FLAC__Metadata_Node *node; local
1809 FLAC__Metadata_Node *node, *save; local
1937 FLAC__Metadata_Node *node; local
1962 FLAC__Metadata_Node *node; local
[all...] |
| /external/freetype/src/base/ |
| ftobjs.c | 2046 FT_ListNode node = NULL; local
2376 FT_ListNode node; local
2421 FT_ListNode node = 0; local
2479 FT_ListNode node; local
3905 FT_ListNode node = NULL; local
3952 FT_ListNode node; local
4001 FT_ListNode node; local
4059 FT_ListNode node = 0; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| tznames_impl.cpp | 145 // We defer actually building the TextTrieMap node structure until the first time a
180 fNodes[0].clear(); // Init root node.
197 CharacterNode *node = fNodes; local
200 node = addChildNode(node, keyBuffer[index], status);
202 node->addValue(value, fValueDeleter, status);
208 return FALSE; // We use 16-bit node indexes.
255 // Insert a new child node with c in sorted order.
256 CharacterNode *node = fNodes + fNodesCount; local
257 node->clear()
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| Parser.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
107 List<Node> ign = null;
114 ign = new LinkedList<Node>();
859 Start node = new Start(node1, node2); local
860 return node;
[all...] |
| /external/libsepol/src/ |
| expand.c | 1704 avtab_ptr_t node; local
1758 avtab_ptr_t node; local
1867 avtab_ptr_t node; local
3197 avtab_ptr_t node; local
3328 avtab_ptr_t node; local
3444 avtab_ptr_t node; local
[all...] |
| link.c | 1663 ebitmap_node_t *node; local
1995 ebitmap_node_t *node; local
[all...] |
| services.c | 830 avtab_ptr_t node; local
867 for (node =
869 node != NULL;
870 node =
871 avtab_search_node_next(node, avkey.specified)) {
872 if (node->key.specified == AVTAB_ALLOWED)
873 avd->allowed |= node->datum.data;
874 else if (node->key.specified ==
876 avd->auditallow |= node->datum.data;
877 else if (node->key.specified == AVTAB_AUDITDENY
1232 avtab_ptr_t node; local
[all...] |
| /external/libxml2/ |
| catalog.c | 235 * @node: the context node
242 xmlCatalogErr(xmlCatalogEntryPtr catal, xmlNodePtr node, int error,
246 __xmlRaiseError(NULL, NULL, NULL, catal, node, XML_FROM_CATALOG,
534 * @cgroup: group node for group members
541 xmlNodePtr node; local
560 node = xmlNewDocNode(doc, ns, BAD_CAST "nextCatalog", NULL);
561 xmlSetProp(node, BAD_CAST "catalog", cur->value);
562 xmlAddChild(catalog, node);
567 node = xmlNewDocNode(doc, ns, BAD_CAST "group", NULL)
[all...] |
| valid.c | 132 * @node: the node raising the error
142 xmlNodePtr node, xmlParserErrors error,
163 __xmlRaiseError(schannel, channel, data, pctxt, node, XML_FROM_VALID, error,
175 * @node: the node raising the error
185 xmlNodePtr node, xmlParserErrors error,
206 __xmlRaiseError(schannel, channel, data, pctxt, node, XML_FROM_VALID, error,
216 * @node: the node raising the erro
268 xmlNodePtr node; \/* pointer to the current node *\/ member in struct:_xmlValidState
353 xmlNodePtr node; \/* pointer to the current node in the list *\/ member in struct:_xmlValidState
[all...] |
| xmllint.c | 2076 xmlNodePtr node; local
2470 xmlNodePtr node; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/bench/ |
| numa.c | 190 OPT_CALLBACK('M', "memnodes", NULL, "node[,node2,...nodeN]",
283 static void bind_to_memnode(int node)
288 if (node == -1)
292 nodemask = 1L << node;
295 dprintf("binding to node %d, mask: %016lx => %d\n", node, nodemask, ret);
559 dprintf("got NODE list: {%s}\n", p0.node_list_str);
597 /* Single NODE specified: */
600 /* NODE range specified (for example: "5-11"): */
631 printf("\n# NOTE: ignoring bind NODEs starting at NODE#%d\n", bind_node)
815 int node; local
899 int node; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ |
| builtin-kvm.c | 689 struct rb_node *node = rb_first(result); local
691 if (!node)
694 rb_erase(node, result);
695 return container_of(node, struct kvm_event, rb);
1171 list_for_each_entry(pos, &evlist->entries, node) {
[all...] |
| builtin-sched.c | 90 struct rb_node node; member in struct:work_atoms
786 struct rb_node *node = root->rb_node; local
789 while (node) {
793 atoms = container_of(node, struct work_atoms, node);
797 node = node->rb_left;
799 node = node->rb_right;
818 this = container_of(*new, struct work_atoms, node);
1249 struct rb_node *node; local
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/ui/browsers/ |
| hists.c | 76 static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
81 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
101 static int callchain_node__count_rows(struct callchain_node *node)
107 list_for_each_entry(chain, &node->val, list) {
113 n += callchain_node__count_rows_rb_tree(node);
124 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); local
125 n += callchain_node__count_rows(node);
143 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
145 struct rb_node *nd = rb_first(&node->rb_root);
147 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd))
181 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); local
264 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); local
423 struct rb_node *node; local
572 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); local
1003 struct rb_node *node; local
1099 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ra.cpp | 615 class RIG_Node : public Graph::Node
643 uint16_t degreeLimit; // if deg < degLimit, node is trivially colourable
713 GCRA::RIG_Node::RIG_Node() : Node(NULL), next(this), prev(this)
809 // add val's definitions to rep and extend the live interval of its RIG node
979 GCRA::RIG_Node::addInterference(RIG_Node *node)
981 this->degree += relDegree[node->colors][colors];
982 node->degree += relDegree[colors][node->colors];
984 this->attach(node, Graph::Edge::CROSS);
988 GCRA::RIG_Node::addRegPreference(RIG_Node *node)
1066 RIG_Node *node = *it; local
1248 RIG_Node *node = &nodes[stack.top()]; local
[all...] |
| /external/mesa3d/src/glsl/ |
| ast.h | 37 * \defgroup AST Abstract syntax tree node definitions
56 void *node; local
58 node = rzalloc_size(ctx, size);
59 assert(node != NULL);
61 return node;
72 * Print an AST node in something approximating the original GLSL code
77 * Convert the AST node to the high-level intermediate representation
83 * Retrieve the source location of an AST node
85 * This function is primarily used to get the source position of an AST node
104 * Set the source location of an AST node from a parser locatio
345 void *node; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| ir_to_mesa.cpp | 157 void *node; local
159 node = rzalloc_size(ctx, size);
160 assert(node != NULL);
162 return node;
[all...] |
| /external/opencv/cv/src/ |
| mycvHaarDetectObjects.cpp | 80 MyCvHidHaarTreeNode* node; member in struct:MyCvHidHaarClassifier
292 hid_classifier->node = haar_node_ptr;
297 MyCvHidHaarTreeNode* node = hid_classifier->node + l; local
299 memset( node, -1, sizeof(*node) );
300 node->threshold = (int)((classifier->threshold[l]) * 65536.0);
301 node->left = classifier->left[l];
302 node->right = classifier->right[l];
307 memset( &(node->feature.rect[2]), 0, sizeof(node->feature.rect[2]) )
410 MyCvHidHaarTreeNode* node = classifier->node + idx; local
561 MyCvHidHaarTreeNode* node = classifier->node; local
573 MyCvHidHaarTreeNode* node = classifier->node; local
[all...] |
| /external/opencv/cxcore/include/ |
| cxcore.h | 264 (returns the first node or NULL if the array is empty) */
268 // returns next sparse array node (or NULL if there is no more nodes)
271 if( mat_iterator->node->next )
272 return mat_iterator->node = mat_iterator->node->next;
278 CvSparseNode* node = (CvSparseNode*)mat_iterator->mat->hashtable[idx]; local
279 if( node )
282 return mat_iterator->node = node;
377 in case of sparse arrays it deletes the specified node */
1448 const void* node; member in struct:CvTreeNodeIterator
1722 CVAPI(const char*) cvGetFileNodeName( const CvFileNode* node ); variable
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2641 CvPTreeNode node = { 0, 0, 0 }; local
2659 CvPTreeNode* node = (CvPTreeNode*)(reader0.ptr); local
2725 CvPTreeNode* node = (CvPTreeNode*)reader.ptr; local
3795 void* node = cvNextTreeNode( &iterator ); local
3831 CvTreeNode* node = (CvTreeNode*)_node; local
3858 CvTreeNode* node = (CvTreeNode*)_node; local
3920 CvTreeNode* node; local
3969 CvTreeNode* node; local
[all...] |
| /external/openssl/apps/ |
| apps.c | 2464 X509_POLICY_NODE *node; local
[all...] |
| /external/openssl/crypto/x509/ |
| x509_vfy.h | 556 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node);
559 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node); variable
561 X509_policy_node_get0_parent(const X509_POLICY_NODE *node);
|
