| /src/tests/usr.bin/xlint/lint1/ |
| gcc_init_compound_literal.c | 32 struct node { struct
34 struct node *left;
35 struct node *right;
43 static const struct node guess = {
45 &(struct node){
47 &(struct node){
52 &(struct node){
|
| /src/external/gpl2/mkhybrid/dist/libhfs_iso/ |
| node.h | 20 void n_init(node *, btree *, int, int);
22 int n_new(node *);
23 void n_free(node *);
25 void n_compact(node *);
26 int n_search(node *, unsigned char *);
29 int n_split(node *, unsigned char *, int *);
31 void n_insertx(node *, unsigned char *, int);
32 int n_insert(node *, unsigned char *, int *);
34 int n_merge(node *, node *, unsigned char *, int *)
[all...] |
| btree.h | 20 int bt_getnode(node *);
21 int bt_putnode(node *);
28 int bt_insertx(node *, unsigned char *, int *);
31 int bt_deletex(node *, unsigned char *, unsigned char *, int *);
34 int bt_search(btree *, unsigned char *, node *);
|
| /src/external/gpl2/dtc/dist/tests/ |
| overlay_overlay_bypath.dts | 13 &{/test-node} {
18 &{/test-node} {
23 &{/test-node} {
27 /* Test that we add a new node (by phandle) */
28 &{/test-node} {
29 new-node {
35 local: new-local-node {
44 &{/test-node} {
45 sub-test-node {
|
| overlay_overlay_local_merge.dts | 13 parent: new-node {
20 new-merged-node {
26 new-root-node {
27 new-root-node-property;
|
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/hlist/ |
| cds_hlist_add_head_rcu.c | 20 int value; /* Node content */
21 struct cds_hlist_node node; /* Linked-list chaining */ member in struct:mynode
30 struct mynode *node; local
37 node = malloc(sizeof(*node));
38 if (!node) {
42 node->value = values[i];
43 cds_hlist_add_head_rcu(&node->node, &mylist);
51 cds_hlist_for_each_entry_2(node, &mylist, node)
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/list/ |
| cds_list_add_rcu.c | 20 int value; /* Node content */
21 struct cds_list_head node; /* Linked-list chaining */ member in struct:mynode
30 struct mynode *node; local
37 node = malloc(sizeof(*node));
38 if (!node) {
42 node->value = values[i];
43 cds_list_add_rcu(&node->node, &mylist);
51 cds_list_for_each_entry(node, &mylist, node)
[all...] |
| cds_list_add_tail_rcu.c | 20 int value; /* Node content */
21 struct cds_list_head node; /* Linked-list chaining */ member in struct:mynode
30 struct mynode *node; local
37 node = malloc(sizeof(*node));
38 if (!node) {
42 node->value = values[i];
43 cds_list_add_tail_rcu(&node->node, &mylist);
51 cds_list_for_each_entry(node, &mylist, node)
[all...] |
| cds_list_replace_rcu.c | 6 * This example shows how to replace a node within a linked-list safely
20 int value; /* Node content */
21 struct cds_list_head node; /* Linked-list chaining */ member in struct:mynode
28 struct mynode *node = caa_container_of(head, struct mynode, rcu_head); local
30 free(node);
39 struct mynode *node, *n; local
46 node = malloc(sizeof(*node));
47 if (!node) {
51 node->value = values[i]
[all...] |
| /src/bin/sh/ |
| show.h | 37 union node;
38 void showtree(union node *);
42 void trargstr(union node *);
|
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/lfstack/ |
| cds_lfs_pop_blocking.c | 19 int value; /* Node content */
20 struct cds_lfs_node node; /* Chaining in stack */ member in struct:mynode
36 struct mynode *node; local
38 node = malloc(sizeof(*node));
39 if (!node) {
44 cds_lfs_node_init(&node->node);
45 node->value = values[i];
46 cds_lfs_push(&mystack, &node->node)
55 struct mynode *node; local
[all...] |
| cds_lfs_pop_all_blocking.c | 19 int value; /* Node content */
20 struct cds_lfs_node node; /* Chaining in stack */ member in struct:mynode
38 struct mynode *node; local
40 node = malloc(sizeof(*node));
41 if (!node) {
46 cds_lfs_node_init(&node->node);
47 node->value = values[i];
48 cds_lfs_push(&mystack, &node->node)
64 struct mynode *node = local
[all...] |
| cds_lfs_push.c | 19 int value; /* Node content */
20 struct cds_lfs_node node; /* Chaining in stack */ member in struct:mynode
38 struct mynode *node; local
40 node = malloc(sizeof(*node));
41 if (!node) {
46 cds_lfs_node_init(&node->node);
47 node->value = values[i];
48 cds_lfs_push(&mystack, &node->node)
58 struct mynode *node = local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/wfcqueue/ |
| cds_wfcq_dequeue.c | 19 int value; /* Node content */
20 struct cds_wfcq_node node; /* Chaining in queue */ member in struct:mynode
37 struct mynode *node; local
39 node = malloc(sizeof(*node));
40 if (!node) {
45 cds_wfcq_node_init(&node->node);
46 node->value = values[i];
48 &node->node)
58 struct mynode *node; local
[all...] |
| cds_wfcq_enqueue.c | 19 int value; /* Node content */
20 struct cds_wfcq_node node; /* Chaining in queue */ member in struct:mynode
38 struct mynode *node; local
40 node = malloc(sizeof(*node));
41 if (!node) {
46 cds_wfcq_node_init(&node->node);
47 node->value = values[i];
49 &node->node)
58 struct mynode *node = local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/wfstack/ |
| cds_wfs_pop.c | 19 int value; /* Node content */
20 struct cds_wfs_node node; /* Chaining in stack */ member in struct:mynode
36 struct mynode *node; local
38 node = malloc(sizeof(*node));
39 if (!node) {
44 cds_wfs_node_init(&node->node);
45 node->value = values[i];
46 cds_wfs_push(&mystack, &node->node)
55 struct mynode *node; local
[all...] |
| cds_wfs_pop_all_blocking.c | 19 int value; /* Node content */
20 struct cds_wfs_node node; /* Chaining in stack */ member in struct:mynode
38 struct mynode *node; local
40 node = malloc(sizeof(*node));
41 if (!node) {
46 cds_wfs_node_init(&node->node);
47 node->value = values[i];
48 cds_wfs_push(&mystack, &node->node)
64 struct mynode *node = local
[all...] |
| cds_wfs_push.c | 19 int value; /* Node content */
20 struct cds_wfs_node node; /* Chaining in stack */ member in struct:mynode
38 struct mynode *node; local
40 node = malloc(sizeof(*node));
41 if (!node) {
46 cds_wfs_node_init(&node->node);
47 node->value = values[i];
48 cds_wfs_push(&mystack, &node->node)
58 struct mynode *node = local
[all...] |
| /src/usr.sbin/autofs/ |
| common.h | 52 struct node { struct
53 TAILQ_ENTRY(node) n_next;
54 TAILQ_HEAD(nodehead, node) n_children;
55 struct node *n_parent;
83 struct node *node_new_root(void);
84 struct node *node_new(struct node *, char *, char *, char *, const char *,
86 struct node *node_new_map(struct node *, char *, char *, char *,
88 struct node *node_find(struct node *, const char *mountpoint)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-visibility.cc | 90 /* Return true when NODE cannot be local. Worker for cgraph_local_node_p. */
93 non_local_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
95 return !(node->only_called_directly_or_aliased_p ()
98 && !node->thunk
99 && node->definition
100 && !DECL_EXTERNAL (node->decl)
101 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (node->decl))
102 && !node->externally_visible
103 && !node->used_from_other_partition
104 && !node->in_other_partitio
620 struct cgraph_node *node; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-visibility.cc | 90 /* Return true when NODE cannot be local. Worker for cgraph_local_node_p. */
93 non_local_p (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
95 return !(node->only_called_directly_or_aliased_p ()
98 && !node->thunk
99 && node->definition
100 && !DECL_EXTERNAL (node->decl)
101 && !lookup_attribute ("noipa", DECL_ATTRIBUTES (node->decl))
102 && !node->externally_visible
103 && !node->used_from_other_partition
104 && !node->in_other_partitio
619 struct cgraph_node *node; local
[all...] |
| /src/usr.sbin/makefs/cd9660/ |
| cd9660_archimedes.c | 74 * Add "ARCHIMEDES" metadata to a node if that seems appropriate.
80 archimedes_convert_node(cd9660node *node)
87 if (node->su_tail_data != NULL)
91 len = strlen(node->node->name);
94 if (len >= 4 && node->node->name[len-4] == ',')
96 type = strtoul(node->node->name + len - 3, NULL, 16);
97 if (type == -1 && node->node->name[0] != '!'
[all...] |
| /src/external/bsd/kyua-cli/dist/utils/config/ |
| nodes_test.cpp | 45 /// Typed leaf node that specializes the validate() method.
61 /// Set node that specializes the validate() method.
85 config::bool_node node; local
86 node.set(true);
87 config::detail::base_node* raw_copy = node.deep_copy();
91 ATF_REQUIRE(node.value());
100 config::bool_node node; local
101 ATF_REQUIRE(!node.is_set());
102 node.set(false);
103 ATF_REQUIRE( node.is_set())
110 config::bool_node node; local
123 config::bool_node node; local
137 config::bool_node node; local
150 config::bool_node node; local
161 config::bool_node node; local
172 config::bool_node node; local
181 config::bool_node node; local
192 config::int_node node; local
207 config::int_node node; local
217 config::int_node node; local
230 config::int_node node; local
244 config::int_node node; local
260 config::int_node node; local
271 config::int_node node; local
282 config::int_node node; local
291 config::int_node node; local
302 config::string_node node; local
317 config::string_node node; local
327 config::string_node node; local
340 config::string_node node; local
354 config::string_node node; local
370 config::bool_node node; local
381 config::string_node node; local
392 config::string_node node; local
404 config::strings_set_node node; local
425 config::strings_set_node node; local
438 config::strings_set_node node; local
451 config::strings_set_node node; local
474 config::strings_set_node node; local
485 validation_node node; local
495 validation_node node; local
505 set_validation_node node; local
520 set_validation_node node; local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/rculfhash/ |
| cds_lfht_add_replace.c | 9 * We use a "seqnum" field to show which node is staying in the hash
26 int value; /* Node content */
27 int seqnum; /* Our node sequence number */
28 struct cds_lfht_node node; /* Chaining in hash table */ member in struct:mynode
35 struct mynode *node = local
36 caa_container_of(ht_node, struct mynode, node);
39 return *key == node->value;
45 struct mynode *node = caa_container_of(head, struct mynode, rcu_head); local
47 free(node);
59 struct mynode *node; local
[all...] |
| cds_lfht_add_unique.c | 7 * table. We use a "seqnum" field to show which node is staying in the
24 int value; /* Node content */
25 int seqnum; /* Our node sequence number */
26 struct cds_lfht_node node; /* Chaining in hash table */ member in struct:mynode
32 struct mynode *node = local
33 caa_container_of(ht_node, struct mynode, node);
36 return *key == node->value;
48 struct mynode *node; local
78 node = malloc(sizeof(*node));
[all...] |
