Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 586) sorted by relevance

12345678910>>...24

/minix3/minix/lib/libvtreefs/
H A Dinode.c19 #define CHECK_INODE(node) \ argument
21 assert(node >= &inode[0] && node < &inode[nr_inodes]); \
22 assert((unsigned int)(node - &inode[0]) == node->i_num);\
23 assert(node == &inode[0] || node->i_parent != NULL || \
24 (node->i_flags & I_DELETED)); \
34 struct inode *node; local
71 node = &inode[i];
72 node->i_num = i;
73 node->i_name = NULL;
74 node->i_parent = NULL;
[all …]
H A Dstadir.c13 struct inode *node; in fs_stat() local
16 if ((node = find_inode(ino_nr)) == NULL) in fs_stat()
20 buf->st_mode = node->i_stat.mode; in fs_stat()
21 buf->st_nlink = !is_inode_deleted(node); in fs_stat()
22 buf->st_uid = node->i_stat.uid; in fs_stat()
23 buf->st_gid = node->i_stat.gid; in fs_stat()
24 buf->st_rdev = (dev_t) node->i_stat.dev; in fs_stat()
25 buf->st_size = node->i_stat.size; in fs_stat()
28 if (S_ISLNK(node->i_stat.mode) && vtreefs_hooks->rdlink_hook != NULL) { in fs_stat()
29 r = vtreefs_hooks->rdlink_hook(node, path, sizeof(path), in fs_stat()
[all …]
/minix3/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes_test.cpp85 config::bool_node node; in ATF_TEST_CASE_BODY() local
86 node.set(true); in ATF_TEST_CASE_BODY()
87 config::detail::base_node* raw_copy = node.deep_copy(); in ATF_TEST_CASE_BODY()
91 ATF_REQUIRE(node.value()); in ATF_TEST_CASE_BODY()
100 config::bool_node node; in ATF_TEST_CASE_BODY() local
101 ATF_REQUIRE(!node.is_set()); in ATF_TEST_CASE_BODY()
102 node.set(false); in ATF_TEST_CASE_BODY()
103 ATF_REQUIRE( node.is_set()); in ATF_TEST_CASE_BODY()
110 config::bool_node node; in ATF_TEST_CASE_BODY() local
111 node.set(false); in ATF_TEST_CASE_BODY()
[all …]
/minix3/minix/net/lwip/
H A Drttree.c51 rttree_precompute(struct rttree * tree __unused, struct rttree_node * node) in rttree_precompute() argument
54 node->rtn_byte = RTTREE_BITS_TO_BYTE(node->rtn_bits); in rttree_precompute()
55 node->rtn_shift = RTTREE_BITS_TO_SHIFT(node->rtn_bits); in rttree_precompute()
82 rttree_side(const struct rttree * tree, const struct rttree_node * node, in rttree_side() argument
86 return (((const uint8_t *)addr)[node->rtn_byte] >> in rttree_side()
87 node->rtn_shift) & 1; in rttree_side()
173 rttree_add_free(struct rttree * tree, struct rttree_node * node) in rttree_add_free() argument
176 node->rtn_child[0] = NULL; in rttree_add_free()
177 if ((node->rtn_child[1] = tree->rtt_free) != NULL) in rttree_add_free()
178 node->rtn_child[1]->rtn_child[0] = node; in rttree_add_free()
[all …]
/minix3/external/bsd/bind/dist/lib/isc/
H A Dradix.c229 isc_radix_node_t *node; in isc_radix_process() local
233 RADIX_WALK(radix->head, node) { in isc_radix_process()
234 func(node->prefix, node->data); in isc_radix_process()
243 isc_radix_node_t *node; in isc_radix_search() local
261 node = radix->head; in isc_radix_search()
265 while (node->bit < bitlen) { in isc_radix_search()
266 if (node->prefix) in isc_radix_search()
267 stack[cnt++] = node; in isc_radix_search()
269 if (BIT_TEST(addr[node->bit >> 3], 0x80 >> (node->bit & 0x07))) in isc_radix_search()
270 node = node->r; in isc_radix_search()
[all …]
/minix3/minix/servers/mib/
H A Dtree.c37 struct mib_node *node; in mib_find() local
49 node = &parent->node_scptr[id]; in mib_find()
51 if (node->node_flags != 0) { in mib_find()
55 return node; in mib_find()
92 int id, const struct mib_node * node) in mib_copyout_node() argument
107 scn.sysctl_flags = SYSCTL_VERSION | (node->node_flags & in mib_copyout_node()
110 strlcpy(scn.sysctl_name, node->node_name, sizeof(scn.sysctl_name)); in mib_copyout_node()
111 scn.sysctl_ver = node->node_ver; in mib_copyout_node()
112 scn.sysctl_size = node->node_size; in mib_copyout_node()
115 visible = (!(node->node_flags & CTLFLAG_PRIVATE) || mib_authed(call)); in mib_copyout_node()
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/Target/SystemZ/
H A DSystemZOperators.td180 def z_scmp : PatFrag<(ops node:$a, node:$b), (z_icmp node:$a, node:$b, imm), [{
184 def z_ucmp : PatFrag<(ops node:$a, node:$b), (z_icmp node:$a, node:$b, imm), [{
190 def z_tm_reg : PatFrag<(ops node:$a, node:$b), (z_tm node:$a, node:$b, imm)>;
191 def z_tm_mem : PatFrag<(ops node:$a, node:$b), (z_tm node:$a, node:$b, 0)>;
194 def sext8 : PatFrag<(ops node:$src), (sext_inreg node:$src, i8)>;
195 def sext16 : PatFrag<(ops node:$src), (sext_inreg node:$src, i16)>;
196 def sext32 : PatFrag<(ops node:$src), (sext (i32 node:$src))>;
199 def zext8 : PatFrag<(ops node:$src), (and node:$src, 0xff)>;
200 def zext16 : PatFrag<(ops node:$src), (and node:$src, 0xffff)>;
201 def zext32 : PatFrag<(ops node:$src), (zext (i32 node:$src))>;
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td80 // DAG node.
288 def node;
552 // node is matched.
571 /// DAG, from a single node to multiple nested other fragments.
629 def not : PatFrag<(ops node:$in), (xor node:$in, -1)>;
630 def vnot : PatFrag<(ops node:$in), (xor node:$in, immAllOnesV)>;
631 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
641 def unindexedload : PatFrag<(ops node:$ptr), (ld node:$ptr), [{
644 def load : PatFrag<(ops node:$ptr), (unindexedload node:$ptr), [{
649 def extload : PatFrag<(ops node:$ptr), (unindexedload node:$ptr), [{
[all …]
/minix3/usr.sbin/makefs/cd9660/
H A Diso9660_rrip.c56 cd9660_susp_initialize(iso9660_disk *diskStructure, cd9660node *node, in cd9660_susp_initialize() argument
63 assert(node != NULL); in cd9660_susp_initialize()
65 if (!(node->type & CD9660_TYPE_DOT) && in cd9660_susp_initialize()
66 !(node->type & CD9660_TYPE_DOTDOT)) in cd9660_susp_initialize()
67 TAILQ_INIT(&(node->head)); in cd9660_susp_initialize()
68 if (node->dot_record != 0) in cd9660_susp_initialize()
69 TAILQ_INIT(&(node->dot_record->head)); in cd9660_susp_initialize()
70 if (node->dot_dot_record != 0) in cd9660_susp_initialize()
71 TAILQ_INIT(&(node->dot_dot_record->head)); in cd9660_susp_initialize()
74 if ((r = cd9660_susp_initialize_node(diskStructure, node)) < 0) in cd9660_susp_initialize()
[all …]
H A Dcd9660_archimedes.c80 archimedes_convert_node(cd9660node *node) in archimedes_convert_node() argument
87 if (node->su_tail_data != NULL) in archimedes_convert_node()
91 len = strlen(node->node->name); in archimedes_convert_node()
94 if (len >= 4 && node->node->name[len-4] == ',') in archimedes_convert_node()
96 type = strtoul(node->node->name + len - 3, NULL, 16); in archimedes_convert_node()
97 if (type == -1 && node->node->name[0] != '!') in archimedes_convert_node()
104 stamp = riscos_date(node->node->inode->st.st_mtime); in archimedes_convert_node()
110 arc->cdfs_attr = node->node->name[0] == '!' ? CDFS_PLING : 0; in archimedes_convert_node()
111 node->su_tail_data = (void *)arc; in archimedes_convert_node()
112 node->su_tail_size = sizeof(*arc); in archimedes_convert_node()
[all …]
/minix3/external/bsd/bind/dist/lib/dns/
H A Drbt.c153 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left,
158 serialize_nodes(FILE *file, dns_rbtnode_t *node, uintptr_t parent,
167 getparent(dns_rbtnode_t *node, file_header_t *header) { in getparent() argument
168 char *adjusted_address = (char *)(node->parent); in getparent()
169 adjusted_address += node->parent_is_relative * (uintptr_t)header; in getparent()
175 getleft(dns_rbtnode_t *node, file_header_t *header) { in getleft() argument
176 char *adjusted_address = (char *)(node->left); in getleft()
177 adjusted_address += node->left_is_relative * (uintptr_t)header; in getleft()
183 getright(dns_rbtnode_t *node, file_header_t *header) { in getright() argument
184 char *adjusted_address = (char *)(node->right); in getright()
[all …]
H A Dcompress.c66 dns_compressnode_t *node; in dns_compress_invalidate() local
74 node = cctx->table[i]; in dns_compress_invalidate()
76 if (node->count < DNS_COMPRESS_INITIALNODES) in dns_compress_invalidate()
78 isc_mem_put(cctx->mctx, node, sizeof(*node)); in dns_compress_invalidate()
122 #define NODENAME(node, name) \ argument
124 (name)->length = (node)->r.length; \
125 (name)->labels = (node)->labels; \
126 (name)->ndata = (node)->r.base; \
140 dns_compressnode_t *node = NULL; in dns_compress_findglobal() local
160 for (node = cctx->table[hash]; node != NULL; node = node->next) in dns_compress_findglobal()
[all …]
/minix3/external/bsd/bind/dist/lib/dns/include/dns/
H A Drbt.h155 typedef isc_result_t (*dns_rbtfindcallback_t)(dns_rbtnode_t *node,
410 dns_rbtnode_t **node, dns_rbtnodechain_t *chain,
557 dns_rbt_deletenode(dns_rbt_t *rbt, dns_rbtnode_t *node, isc_boolean_t recurse);
591 dns_rbt_namefromnode(dns_rbtnode_t *node, dns_name_t *name);
617 dns_rbt_fullnamefromnode(dns_rbtnode_t *node, dns_name_t *name);
637 dns_rbt_formatnodename(dns_rbtnode_t *node, char *printname,
809 dns__rbtnode_getdistance(dns_rbtnode_t *node);
866 dns_name_t *origin, dns_rbtnode_t **node);
1033 #define dns_rbtnode_refinit(node, n) \ argument
1035 isc_refcount_init(&(node)->references, (n)); \
[all …]
/minix3/crypto/external/bsd/libsaslc/dist/src/
H A Ddict.c134 saslc__dict_list_node_destroy(saslc__dict_node_t *node) in saslc__dict_list_node_destroy() argument
137 free(node->key); in saslc__dict_list_node_destroy()
139 explicit_memset(node->value, 0, node->value_len); in saslc__dict_list_node_destroy()
140 free(node->value); in saslc__dict_list_node_destroy()
141 LIST_REMOVE(node, nodes); in saslc__dict_list_node_destroy()
142 free(node); in saslc__dict_list_node_destroy()
154 saslc__dict_node_t *node; in saslc__dict_get_node_by_key() local
157 LIST_FOREACH(node, dict, nodes) { in saslc__dict_get_node_by_key()
158 if (strcmp(node->key, key) == 0) in saslc__dict_get_node_by_key()
159 return node; in saslc__dict_get_node_by_key()
[all …]
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/InstMerge/
H A Dld_hoist_st_sink.ll6 %struct.node = type { i64, %struct.node*, %struct.node*, %struct.node*, i64, %struct.arc*, i64, i64…
9 define i64 @foo(%struct.node* nocapture readonly %r) nounwind {
11 %node.0.in16 = getelementptr inbounds %struct.node* %r, i64 0, i32 2
12 %node.017 = load %struct.node** %node.0.in16, align 8
13 %tobool18 = icmp eq %struct.node* %node.017, null
22 %node.020 = phi %struct.node* [ %node.0, %if.end ], [ %node.017, %while.body.preheader ]
24 %orientation = getelementptr inbounds %struct.node* %node.020, i64 0, i32 4
30 %a = getelementptr inbounds %struct.node* %node.020, i64 0, i32 5
36 %pred = getelementptr inbounds %struct.node* %node.020, i64 0, i32 1
37 ; CHECK-NOT: load %struct.node**
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/Target/X86/
H A DX86InstrFragmentsSIMD.td18 def load_mmx : PatFrag<(ops node:$ptr), (x86mmx (load node:$ptr))>;
19 def bc_mmx : PatFrag<(ops node:$in), (x86mmx (bitconvert node:$in))>;
326 def loadv4f32 : PatFrag<(ops node:$ptr), (v4f32 (load node:$ptr))>;
327 def loadv2f64 : PatFrag<(ops node:$ptr), (v2f64 (load node:$ptr))>;
328 def loadv2i64 : PatFrag<(ops node:$ptr), (v2i64 (load node:$ptr))>;
332 def loadv8f32 : PatFrag<(ops node:$ptr), (v8f32 (load node:$ptr))>;
333 def loadv4f64 : PatFrag<(ops node:$ptr), (v4f64 (load node:$ptr))>;
334 def loadv4i64 : PatFrag<(ops node:$ptr), (v4i64 (load node:$ptr))>;
337 def loadv16f32 : PatFrag<(ops node:$ptr), (v16f32 (load node:$ptr))>;
338 def loadv8f64 : PatFrag<(ops node:$ptr), (v8f64 (load node:$ptr))>;
[all …]
/minix3/minix/fs/procfs/
H A Dtree.c33 check_owner(struct inode * node, int slot) in check_owner() argument
39 get_inode_stat(node, &stat); in check_owner()
74 dir_is_pid(struct inode *node) in dir_is_pid() argument
77 return (get_parent_inode(node) == get_root_inode() && in dir_is_pid()
78 get_inode_index(node) != NO_INDEX); in dir_is_pid()
155 struct inode *root, *node; in construct_pid_dirs() local
166 node = get_inode_by_index(root, i); in construct_pid_dirs()
167 if (node == NULL) in construct_pid_dirs()
175 delete_inode(node); in construct_pid_dirs()
188 if (pid != (pid_t)get_inode_cbdata(node) || in construct_pid_dirs()
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/Target/R600/
H A DAMDGPUInstructions.td160 (ops node:$ptr), (op node:$ptr)
164 (ops node:$value, node:$ptr), (op node:$value, node:$ptr)
173 def global_store : PatFrag<(ops node:$val, node:$ptr),
174 (store node:$val, node:$ptr), [{
179 def global_load : PatFrag<(ops node:$ptr), (load node:$ptr), [{
184 def constant_load : PatFrag<(ops node:$ptr), (load node:$ptr), [{
188 def az_extload : PatFrag<(ops node:$ptr), (unindexedload node:$ptr), [{
194 def az_extloadi8 : PatFrag<(ops node:$ptr), (az_extload node:$ptr), [{
198 def az_extloadi8_global : PatFrag<(ops node:$ptr), (az_extloadi8 node:$ptr), [{
202 def sextloadi8_global : PatFrag<(ops node:$ptr), (sextloadi8 node:$ptr), [{
[all …]
/minix3/tests/crypto/libcrypto/conf/
H A Dd_conf.out17 node 0 -> 4
18 node 1 -> 1
19 node 2 -> 1
20 node 3 -> 4
21 node 4 -> 0
22 node 5 -> 2
23 node 6 -> 1
24 node 7 -> 1
25 node 8 -> 6
26 node 9 -> 2
[all …]
/minix3/usr.bin/ctags/
H A Dtree.c101 add_node(NODE *node, NODE *cur_node) in add_node() argument
105 dif = strcmp(node->entry, cur_node->entry); in add_node()
107 if (node->file == cur_node->file) { in add_node()
109 …Duplicate entry in file %s, line %d: %s\nSecond entry ignored\n", node->file, lineno, node->entry); in add_node()
114 … "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entr… in add_node()
119 add_node(node, cur_node->left); in add_node()
121 cur_node->left = node; in add_node()
124 add_node(node, cur_node->right); in add_node()
126 cur_node->right = node; in add_node()
131 free_tree(NODE *node) in free_tree() argument
[all …]
H A Dprint.c105 put_entries(NODE *node) in put_entries() argument
108 if (node->left) in put_entries()
109 put_entries(node->left); in put_entries()
112 node->entry, node->file, (node->lno + 63) / 64); in put_entries()
115 node->entry, node->lno, node->file, node->pat); in put_entries()
118 node->entry, node->file, searchar, node->pat, searchar); in put_entries()
119 if (node->right) in put_entries()
120 put_entries(node->right); in put_entries()
/minix3/lib/libc/stdlib/
H A D_env.c118 env_tree_compare_key(void *ctx, const void *node, const void *key) in env_tree_compare_key() argument
120 return env_tree_compare_nodes(ctx, node, in env_tree_compare_key()
158 env_node_t *node; in __freeenvvar() local
161 node = rb_tree_find_node(&env_tree, envvar); in __freeenvvar()
162 if (node != NULL) { in __freeenvvar()
163 rb_tree_remove_node(&env_tree, node); in __freeenvvar()
164 free(node); in __freeenvvar()
175 env_node_t *node; in __allocenvvar() local
177 node = malloc(sizeof(*node) + length); in __allocenvvar()
178 if (node != NULL) { in __allocenvvar()
[all …]
/minix3/external/bsd/bind/dist/lib/dns/tests/
H A Drbt_test.c303 dns_rbtnode_t *node = NULL; in ATF_TC_BODY() local
321 &node, &chain, 0, NULL, NULL); in ATF_TC_BODY()
324 while (node != NULL) { in ATF_TC_BODY()
325 const size_t *distance = (const size_t *) node->data; in ATF_TC_BODY()
328 dns__rbtnode_getdistance(node)); in ATF_TC_BODY()
332 dns_rbtnodechain_current(&chain, NULL, NULL, &node); in ATF_TC_BODY()
501 insert_helper(dns_rbt_t *rbt, const char *namestr, dns_rbtnode_t **node) { in insert_helper() argument
508 return (dns_rbt_addnode(rbt, name, node)); in insert_helper()
512 compare_labelsequences(dns_rbtnode_t *node, const char *labelstr) { in compare_labelsequences() argument
519 dns_rbt_namefromnode(node, &name); in compare_labelsequences()
[all …]
/minix3/external/public-domain/xz/dist/src/liblzma/common/
H A Dindex.c73 index_tree_node node; member
109 index_tree_node node; member
194 index_tree_node_end(index_tree_node *node, const lzma_allocator *allocator, in index_tree_node_end() argument
195 void (*free_func)(void *node, const lzma_allocator *allocator)) in index_tree_node_end() argument
199 if (node->left != NULL) in index_tree_node_end()
200 index_tree_node_end(node->left, allocator, free_func); in index_tree_node_end()
202 if (node->right != NULL) in index_tree_node_end()
203 index_tree_node_end(node->right, allocator, free_func); in index_tree_node_end()
206 free_func(node, allocator); in index_tree_node_end()
208 lzma_free(node, allocator); in index_tree_node_end()
[all …]
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/GlobalOpt/
H A D2009-01-13-phi-user.ll5 %struct.node = type { %struct.node*, i32 }
6 @head = internal global %struct.node* null ; <%struct.node**> [#uses=2]
7 @node = internal global %struct.node { %struct.node* null, i32 42 }, align 16 ; <%struct.node*> [#…
11 store %struct.node* @node, %struct.node** @head, align 8
15 %0 = getelementptr %struct.node* %t.0, i64 0, i32 1 ; <i32*> [#uses=1]
17 %2 = getelementptr %struct.node* %t.0, i64 0, i32 0 ; <%struct.node**> [#uses=1]
22 %t.0.in = phi %struct.node** [ @head, %entry ], [ %2, %bb ] ; <%struct.node**> [#uses=1]
23 %t.0 = load %struct.node** %t.0.in ; <%struct.node*> [#uses=3]
24 %3 = icmp eq %struct.node* %t.0, null ; <i1> [#uses=1]

12345678910>>...24