Searched refs:node (Results 51 - 75 of 1044) sorted by relevance

1234567891011>>

/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/config/sh/
H A Dsymbian-c.c112 tree node = *pnode;
117 if (!DECL_P (node))
128 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
141 if (TREE_CODE (node) == VAR_DECL)
143 if (DECL_INITIAL (node))
146 node);
152 DECL_EXTERNAL (node) = 1;
155 if (current_function_decl != NULL_TREE && ! TREE_STATIC (node))
156 TREE_PUBLIC (node)
111 tree node = *pnode; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/
H A Dpr18241-1.c19 struct radix_tree_node *node, **slot; member in struct:radix_tree_path
26 static inline void tag_clear(struct radix_tree_node *node, int tag, int offset) argument
37 addr = &node->tags[tag][0];
55 pathp->node = 0;
66 pathp[1].node = *pathp[0].slot;
68 (pathp[1].node->slots + offset);
81 tag_clear(pathp[0].node, tag, pathp[0].offset);
83 if (pathp[0].node->tags[tag][idx])
87 } while (pathp[0].node);
95 struct radix_tree_node node; local
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/
H A Dpr18241-1.c19 struct radix_tree_node *node, **slot; member in struct:radix_tree_path
26 static inline void tag_clear(struct radix_tree_node *node, int tag, int offset) argument
33 addr = &node->tags[tag][0];
51 pathp->node = 0;
62 pathp[1].node = *pathp[0].slot;
64 (pathp[1].node->slots + offset);
77 tag_clear(pathp[0].node, tag, pathp[0].offset);
79 if (pathp[0].node->tags[tag][idx])
83 } while (pathp[0].node);
91 struct radix_tree_node node; local
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/x509v3/
H A Dpcy_lib.c135 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) argument
137 if (!node)
139 return node->data->valid_policy;
143 int X509_policy_node_get_critical(const X509_POLICY_NODE *node)
145 if (node_critical(node))
152 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node)
154 if (!node)
156 return node->data->qualifier_set;
160 X509_policy_node_get0_parent(const X509_POLICY_NODE *node) argument
162 if (!node)
[all...]
H A Dpcy_node.c98 X509_POLICY_NODE *node; local
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
103 if (node->parent == parent)
105 if (!OBJ_cmp(node->data->valid_policy, id))
106 return node;
117 X509_POLICY_NODE *node; local
118 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
119 if (!node)
121 node->data = data;
122 node
165 policy_node_free(X509_POLICY_NODE *node) argument
174 policy_node_match(const X509_POLICY_LEVEL *lvl, const X509_POLICY_NODE *node, const ASN1_OBJECT *oid) argument
[all...]
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/
H A Drf_evenodd_dagfuncs.h41 int rf_RegularPEFunc(RF_DagNode_t * node);
42 int rf_RegularONEFunc(RF_DagNode_t * node);
43 int rf_SimpleONEFunc(RF_DagNode_t * node);
44 void rf_RegularESubroutine(RF_DagNode_t * node, char *ebuf);
45 int rf_RegularEFunc(RF_DagNode_t * node);
46 void rf_DegrESubroutine(RF_DagNode_t * node, char *ebuf);
47 int rf_Degraded_100_EOFunc(RF_DagNode_t * node);
54 int rf_RecoveryEFunc(RF_DagNode_t * node);
55 int rf_EO_DegradedWriteEFunc(RF_DagNode_t * node);
59 int rf_EvenOddDoubleRecoveryFunc(RF_DagNode_t * node);
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/libiberty/
H A Dfibheap.c63 /* Create a new fibonacci heap node. */
67 fibnode_t node;
69 node = (fibnode_t) xcalloc (1, sizeof *node);
70 node->left = node;
71 node->right = node;
73 return node;
101 fibnode_t node;
66 fibnode_t node; local
100 fibnode_t node; local
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
240 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
247 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
256 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
327 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
346 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
403 fibheap_link(fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t node, fibnode_t parent) argument
417 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
466 fibnode_remove(fibnode_t node) argument
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libiberty/
H A Dfibheap.c63 /* Create a new fibonacci heap node. */
67 fibnode_t node;
69 node = (fibnode_t) xcalloc (1, sizeof *node);
70 node->left = node;
71 node->right = node;
73 return node;
101 fibnode_t node;
66 fibnode_t node; local
100 fibnode_t node; local
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
240 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
247 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
256 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
327 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
346 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
403 fibheap_link(fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t node, fibnode_t parent) argument
417 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
466 fibnode_remove(fibnode_t node) argument
[all...]
/netbsd-6-1-5-RELEASE/sys/dev/
H A Dkeylock.c54 const struct sysctlnode *node = NULL; variable in typeref:struct:sysctlnode
61 sysctl_createv(clog, 0, NULL, &node,
68 if (node == NULL)
71 sysctl_createv(clog, 0, &node, NULL,
77 sysctl_createv(clog, 0, &node, NULL,
83 sysctl_createv(clog, 0, &node, NULL,
89 sysctl_createv(clog, 0, &node, NULL,
169 struct sysctlnode node; local
172 node = *rnode;
173 node
182 struct sysctlnode node; local
195 struct sysctlnode node; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/libiberty/
H A Dfibheap.c63 /* Create a new fibonacci heap node. */
67 fibnode_t node;
69 node = (fibnode_t) xcalloc (1, sizeof *node);
70 node->left = node;
71 node->right = node;
73 return node;
101 fibnode_t node;
66 fibnode_t node; local
100 fibnode_t node; local
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
240 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
247 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
256 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
327 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
346 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
403 fibheap_link(fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t node, fibnode_t parent) argument
417 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
466 fibnode_remove(fibnode_t node) argument
[all...]
/netbsd-6-1-5-RELEASE/usr.bin/ctags/
H A Dtree.c58 * enter a new node in the tree
101 add_node(NODE *node, NODE *cur_node) argument
105 dif = strcmp(node->entry, cur_node->entry);
107 if (node->file == cur_node->file) {
109 fprintf(stderr, "Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry);
114 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
119 add_node(node, cur_node->left);
121 cur_node->left = node;
131 free_tree(NODE *node) argument
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libiberty/
H A Dfibheap.c63 /* Create a new fibonacci heap node. */
67 fibnode_t node;
69 node = (fibnode_t) xcalloc (1, sizeof *node);
70 node->left = node;
71 node->right = node;
73 return node;
101 fibnode_t node;
66 fibnode_t node; local
100 fibnode_t node; local
198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument
237 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument
244 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument
253 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument
319 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument
338 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument
395 fibheap_link(fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t node, fibnode_t parent) argument
409 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument
458 fibnode_remove(fibnode_t node) argument
[all...]
/netbsd-6-1-5-RELEASE/sys/arch/ofppc/ofppc/
H A Dcpu.c91 int node; local
96 node = OF_finddevice("/cpus");
97 if (node != -1) {
98 for (node = OF_child(node); node != 0; node = OF_peer(node)) {
102 l = OF_getprop(node, "reg", &cpunum, sizeof(cpunum));
115 int node; local
149 cpu_OFprintcacheinfo(int node) argument
173 int node, cpu=-1; local
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/
H A Dcgraphunit.c166 struct cgraph_node *node; local
182 node = cgraph_node (fndecl);
183 node->local.disregard_inline_limits = 1;
184 cgraph_mark_reachable_node (node);
321 cgraph_decide_is_function_needed (struct cgraph_node *node, tree decl) argument
324 if (node->local.externally_visible)
345 if (node->needed)
357 || (!optimize && !node->local.disregard_inline_limits
359 && !node->origin))
383 struct cgraph_node *node; local
455 cgraph_reset_node(struct cgraph_node *node) argument
490 cgraph_lower_function(struct cgraph_node *node) argument
511 struct cgraph_node *node = cgraph_node (decl); local
551 struct cgraph_node *node = cgraph_node (decl); local
558 verify_cgraph_node(struct cgraph_node *node) argument
813 struct cgraph_node *node; local
839 cgraph_analyze_function(struct cgraph_node *node) argument
892 struct cgraph_node *node; local
949 struct cgraph_node *node, *next; local
1114 struct cgraph_node *node; local
1363 assemble_thunk(struct cgraph_node *node) argument
1542 cgraph_expand_function(struct cgraph_node *node) argument
1613 struct cgraph_node *node; local
1756 struct cgraph_node *node; local
1909 struct cgraph_node *node; local
2154 save_inline_function_body(struct cgraph_node *node) argument
2220 cgraph_materialize_clone(struct cgraph_node *node) argument
2311 struct cgraph_node *node; local
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/bind/dist/lib/dns/
H A Drbt.c81 #define PARENT(node) ((node)->parent)
82 #define LEFT(node) ((node)->left)
83 #define RIGHT(node) ((node)->right)
84 #define DOWN(node) ((node)->down)
85 #define DATA(node) ((node)
169 Name(dns_rbtnode_t *node) argument
183 find_up(dns_rbtnode_t *node) argument
344 move_chain_to_last(dns_rbtnodechain_t *chain, dns_rbtnode_t *node) argument
653 dns_rbtnode_t *node; local
681 dns_rbt_findnode(dns_rbt_t *rbt, dns_name_t *name, dns_name_t *foundname, dns_rbtnode_t **node, dns_rbtnodechain_t *chain, unsigned int options, dns_rbtfindcallback_t callback, void *callback_arg) argument
1186 dns_rbtnode_t *node = NULL; local
1208 dns_rbtnode_t *node = NULL; local
1280 dns_rbt_deletenode(dns_rbt_t *rbt, dns_rbtnode_t *node, isc_boolean_t recurse) argument
1364 dns_rbt_namefromnode(dns_rbtnode_t *node, dns_name_t *name) argument
1374 dns_rbt_fullnamefromnode(dns_rbtnode_t *node, dns_name_t *name) argument
1401 dns_rbt_formatnodename(dns_rbtnode_t *node, char *printname, unsigned int size) argument
1424 dns_rbtnode_t *node; local
1496 hash_add_node(dns_rbt_t *rbt, dns_rbtnode_t *node, dns_name_t *name) argument
1527 dns_rbtnode_t *node; local
1560 hash_node(dns_rbt_t *rbt, dns_rbtnode_t *node, dns_name_t *name) argument
1571 unhash_node(dns_rbt_t *rbt, dns_rbtnode_t *node) argument
1595 rotate_left(dns_rbtnode_t *node, dns_rbtnode_t **rootp) argument
1628 rotate_right(dns_rbtnode_t *node, dns_rbtnode_t **rootp) argument
1665 dns_rbt_addonlevel(dns_rbtnode_t *node, dns_rbtnode_t *current, int order, dns_rbtnode_t **rootp) argument
2019 dns_rbt_deletetree(dns_rbt_t *rbt, dns_rbtnode_t *node) argument
2066 dns_rbtnode_t *node = *nodep; local
2125 dns_rbt_printnodename(dns_rbtnode_t *node) argument
2224 dns_rbtnodechain_current(dns_rbtnodechain_t *chain, dns_name_t *name, dns_name_t *origin, dns_rbtnode_t **node) argument
[all...]
H A Diptable.c70 isc_radix_node_t *node = NULL; local
78 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
84 /* If a node already contains data, don't overwrite it */
90 if (node->data[0] == NULL)
91 node->data[0] = &dns_iptable_pos;
92 if (node->data[1] == NULL)
93 node->data[1] = &dns_iptable_pos;
95 if (node->data[0] == NULL)
96 node->data[0] = &dns_iptable_neg;
97 if (node
121 isc_radix_node_t *node, *new_node; local
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/roken/
H A Dtsearch-test.c19 struct node { struct
41 return strcmp(((const struct node *) node1)->string,
42 ((const struct node *) node2)->string);
50 const struct node *p = *(const struct node **) ptr;
66 struct node *t, *p, tests[] = {
81 p = (struct node *)rk_tfind((void *)t, (void **)&rootnode,
89 /* Put node into the tree. */
90 p = (struct node *) rk_tsearch((void *)t, (void **)&rootnode,
103 p = (struct node *) rk_tfin
[all...]
/netbsd-6-1-5-RELEASE/sys/dev/ic/
H A Dath_netbsd.c116 struct sysctlnode node; local
120 node = *rnode;
121 sc = (struct ath_softc *)node.sysctl_data;
123 node.sysctl_data = &slottime;
124 error = sysctl_lookup(SYSCTLFN_CALL(&node));
134 struct sysctlnode node; local
138 node = *rnode;
139 sc = (struct ath_softc *)node.sysctl_data;
141 node.sysctl_data = &acktimeout;
142 error = sysctl_lookup(SYSCTLFN_CALL(&node));
152 struct sysctlnode node; local
170 struct sysctlnode node; local
199 struct sysctlnode node; local
218 struct sysctlnode node; local
239 struct sysctlnode node; local
258 struct sysctlnode node; local
278 struct sysctlnode node; local
296 struct sysctlnode node; local
314 struct sysctlnode node; local
332 struct sysctlnode node; local
351 struct sysctlnode node; local
369 struct sysctlnode node; local
[all...]
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/cmd/zpool/
H A Dzpool_iter.c78 zpool_node_t *node = safe_malloc(sizeof (zpool_node_t)); local
81 node->zn_handle = zhp;
82 uu_avl_node_init(node, &node->zn_avlnode, zlp->zl_pool);
83 if (uu_avl_find(zlp->zl_avl, node, NULL, &idx) == NULL) {
87 free(node);
90 uu_avl_insert(zlp->zl_avl, node, idx);
93 free(node);
165 zpool_node_t *node, *next_node; local
168 for (node
185 zpool_node_t search, *node; local
202 zpool_node_t *node; local
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/info/
H A Dnodemenu.c29 /* Return a line describing the format of a node information line. */
50 format_node_info (NODE *node) argument
59 if (node->parent)
61 parent = filename_non_directory (node->parent);
63 parent = node->parent;
68 containing_file = node->filename;
71 sprintf (line_buffer, "* %s::", node->nodename);
87 sprintf (line_buffer, "* (%s)%s::", file, node->nodename);
95 for (i = 0; i < node->nodelen; i++)
96 if (node
136 NODE *node; local
229 NODE *node; local
309 NODE *node; local
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/
H A Dtree-pretty-print.c52 #define NIY do_niy(buffer,node)
66 do_niy (pretty_printer *buffer, tree node) argument
71 pp_string (buffer, tree_code_name[(int) TREE_CODE (node)]);
73 if (EXPR_P (node))
75 len = TREE_CODE_LENGTH (TREE_CODE (node));
79 dump_generic_node (buffer, TREE_OPERAND (node, i), 2, 0, false);
151 /* Dump the name of a _DECL node and its DECL_UID if TDF_UID is set
155 dump_decl_name (pretty_printer *buffer, tree node, int flags) argument
157 if (DECL_NAME (node))
158 pp_tree_identifier (buffer, DECL_NAME (node));
178 dump_function_name(pretty_printer *buffer, tree node) argument
190 dump_function_declaration(pretty_printer *buffer, tree node, int spc, int flags) argument
255 dump_generic_node(pretty_printer *buffer, tree node, int spc, int flags, bool is_stmt) argument
1653 print_struct_decl(pretty_printer *buffer, tree node, int spc, int flags) argument
2007 print_call_name(pretty_printer *buffer, tree node) argument
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/bind/dist/lib/isc/
H A Dradix.c163 * if func is supplied, it will be called as func(node->data)
164 * before deleting the node
223 * func will be called as func(node->prefix, node->data)
228 isc_radix_node_t *node; local
232 RADIX_WALK(radix->head, node) {
233 func(node->prefix, node->data);
242 isc_radix_node_t *node; local
260 node
307 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
616 isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node) argument
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/ntp/dist/lib/isc/
H A Dradix.c163 * if func is supplied, it will be called as func(node->data)
164 * before deleting the node
223 * func will be called as func(node->prefix, node->data)
228 isc_radix_node_t *node; local
232 RADIX_WALK(radix->head, node) {
233 func(node->prefix, node->data);
242 isc_radix_node_t *node; local
260 node
307 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
616 isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node) argument
[all...]
/netbsd-6-1-5-RELEASE/usr.sbin/mrouted/
H A Dcallout.c93 struct timeout_q *ptr, *node, *prev; local
100 /* create a node */
101 node = (struct timeout_q *)malloc(sizeof(struct timeout_q));
102 if (node == 0) {
107 node->func = action;
108 node->data = data;
109 node->time = delay;
110 node->next = 0;
111 node->id = ++id;
115 /* insert node i
[all...]
/netbsd-6-1-5-RELEASE/lib/libc/uuid/
H A Duuid_from_string.c83 &u->clock_seq_hi_and_reserved, &u->clock_seq_low, &u->node[0],
84 &u->node[1], &u->node[2], &u->node[3], &u->node[4], &u->node[5]);

Completed in 403 milliseconds

1234567891011>>