| /system/core/sdcard/ |
| D | fuse.h | 104 struct node { struct
109 * The inode number for this FUSE node. Note that this isn't stable across argument
120 struct node *next; /* per-dir sibling list */ argument
121 struct node *child; /* first contained file by this dir */ argument
122 struct node *parent; /* containing directory */ argument
124 size_t namelen;
125 char *name;
131 char *actual_name;
155 struct node root; argument
|
| D | fuse.cpp | 46 static void acquire_node_locked(struct node* node) in acquire_node_locked()
55 static void release_node_locked(struct node* node) in release_node_locked()
77 static void add_node_to_parent_locked(struct node *node, struct node *parent) { in add_node_to_parent_locked()
84 static void remove_node_from_parent_locked(struct node* node) in remove_node_from_parent_locked()
107 static ssize_t get_node_path_locked(struct node* node, char* buf, size_t bufsize) { in get_node_path_locked()
183 const struct stat *s, const struct node* node) { in attr_from_stat()
245 struct node *node) { in derive_permissions_locked()
300 struct node *node; in derive_permissions_recursive_locked() local
335 const struct fuse_in_header *hdr, const struct node* node, int mode) { in check_caller_access_to_node()
342 struct node *node; in create_node_locked() local
[all …]
|
| /system/libufdt/ |
| D | ufdt_node.c | 44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { in ufdt_node_destruct()
85 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name_len()
94 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name()
100 const struct ufdt_node *node, const char *name, int len) { in ufdt_node_get_property_by_name_len()
110 struct ufdt_node *ufdt_node_get_property_by_name(const struct ufdt_node *node, in ufdt_node_get_property_by_name()
115 char *ufdt_node_get_fdt_prop_data(const struct ufdt_node *node, int *out_len) { in ufdt_node_get_fdt_prop_data()
126 char *ufdt_node_get_fdt_prop_data_by_name_len(const struct ufdt_node *node, in ufdt_node_get_fdt_prop_data_by_name_len()
133 char *ufdt_node_get_fdt_prop_data_by_name(const struct ufdt_node *node, in ufdt_node_get_fdt_prop_data_by_name()
147 uint32_t ufdt_node_get_phandle(const struct ufdt_node *node) { in ufdt_node_get_phandle()
162 struct ufdt_node *ufdt_node_get_node_by_path_len(const struct ufdt_node *node, in ufdt_node_get_node_by_path_len()
[all …]
|
| D | ufdt_node_pool.c | 134 void *node) { in _ufdt_node_pool_block_free()
189 void *node = _ufdt_node_pool_block_alloc(block); in ufdt_node_pool_alloc() local
201 struct ufdt_node_pool *pool, void *node) { in _ufdt_node_pool_search_block()
218 void ufdt_node_pool_free(struct ufdt_node_pool *pool, void *node) { in ufdt_node_pool_free()
|
| /system/bt/osi/src/ |
| D | list.cc | 55 for (const list_node_t* node = list_begin(list); node != list_end(list); in list_contains() local
94 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_insert_after() local
109 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_prepend() local
123 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_append() local
151 for (list_node_t *prev = list->head, *node = list->head->next; node; in list_remove() local
164 for (list_node_t* node = list->head; node;) in list_clear() local
176 for (list_node_t* node = list->head; node;) { in list_foreach() local
194 list_node_t* list_next(const list_node_t* node) { in list_next()
199 void* list_node(const list_node_t* node) { in list_node()
204 static list_node_t* list_free_node_(list_t* list, list_node_t* node) { in list_free_node_()
|
| D | config.cc | 113 for (const list_node_t* node = list_begin(src->sections); in config_new_clone() local
231 for (const list_node_t* node = list_begin(sec->entries); in config_set_string() local
278 const config_section_node_t* node) { in config_section_next()
283 const char* config_section_name(const config_section_node_t* node) { in config_section_name()
336 for (const list_node_t* node = list_begin(config->sections); in config_save() local
490 for (const list_node_t* node = list_begin(config->sections); in section_find() local
521 for (const list_node_t* node = list_begin(sec->entries); in entry_find() local
|
| /system/libufdt/include/ |
| D | ufdt_types.h | 23 #define for_each(it, node) \ argument
28 #define for_each_child(it, node) \ argument
33 #define for_each_prop(it, node) \ argument
36 #define for_each_node(it, node) \ argument
45 #define ufdt_node_name(node) \ argument
50 #define ufdt_node_tag(node) \ argument
71 struct ufdt_node *node; member
|
| /system/core/libcutils/ |
| D | config_utils.c | 28 cnode *node; in config_node() local
41 cnode *node, *match = NULL; in config_find() local
53 cnode *node; in _config_create() local
69 cnode *node; in config_bool() local
87 cnode *node; in config_str() local
97 cnode *node; in config_set() local
245 static int parse_block(cstate *cs, cnode *node) in parse_block()
264 cnode *node; in parse_expr() local
|
| /system/core/libcutils/include_vndk/cutils/ |
| D | list.h | 32 #define node_to_item(node, container, member) \ argument
41 #define list_for_each(node, list) \ argument
44 #define list_for_each_reverse(node, list) \ argument
47 #define list_for_each_safe(node, n, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
|
| /system/core/libcutils/include/cutils/ |
| D | list.h | 32 #define node_to_item(node, container, member) \ argument
41 #define list_for_each(node, list) \ argument
44 #define list_for_each_reverse(node, list) \ argument
47 #define list_for_each_safe(node, n, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
|
| /system/extras/ioshark/ |
| D | compile_ioshark.h | 45 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size()
54 files_db_add_to_size(void *node, u_int64_t size_incr) in files_db_add_to_size()
60 files_db_get_fileno(void *node) in files_db_get_fileno()
66 files_db_get_filename(void *node) in files_db_get_filename()
|
| D | ioshark_bench.h | 68 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size()
77 files_db_update_filename(void *node, char *filename) in files_db_update_filename()
83 files_db_get_fileno(void *node) in files_db_get_fileno()
89 files_db_get_fd(void *node) in files_db_get_fd()
95 files_db_get_filename(void *node) in files_db_get_filename()
101 files_db_readonly(void *node) in files_db_readonly()
|
| /system/bt/btif/src/ |
| D | btif_uid.cc | 47 uid_set_node_t* node = set->head; in uid_set_destroy() local
60 uid_set_node_t* node = set->head; in uid_set_find_or_create_node() local
78 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); in uid_set_add_tx() local
86 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); in uid_set_add_rx() local
95 uid_set_node_t* node = set->head; in uid_set_read_and_clear() local
|
| D | btif_profile_queue.cc | 79 for (const list_node_t* node = list_begin(connect_queue); in queue_int_add() local
121 const list_node_t* node = list_begin(connect_queue); in queue_int_cleanup() local
167 connect_node_t node; in btif_queue_connect() local
|
| /system/core/liblog/ |
| D | logger.h | 36 struct listnode* node; member
41 struct listnode node; member
59 struct listnode node; member
101 struct listnode node; member
111 struct listnode node; member
118 struct listnode node; member
|
| D | local_logger.c | 96 struct listnode node; member
160 struct listnode* node; in LogBufferClear() local
198 struct listnode* node = log->last[logId]; in LogBufferLog() local
348 struct listnode* node; in writeToLocalNode() local
383 struct listnode* node; in writeToLocalRead() local
435 struct listnode* node = writeToLocalNode(logger_list, transp); in writeToLocalPoll() local
466 struct listnode *node, *n; in writeToLocalClear() local
|
| D | logger_read.c | 58 struct listnode* node; in init_transport_context() local
298 struct listnode* node = list_head(&logger_list_internal->transport); in android_logger_open() local
480 struct listnode* node = list_head(&logger_list_internal->transport); in android_logger_list_free() local
492 struct listnode* node = list_head(&logger_list_internal->logger); in android_logger_list_free() local
|
| /system/sepolicy/prebuilts/api/26.0/public/ |
| D | net.te | 2 type node, node_type; type
|
| /system/sepolicy/public/ |
| D | net.te | 2 type node, node_type; type
|
| /system/media/camera/docs/ |
| D | metadata_helpers.py | 77 def find_unique_entries(node): argument
107 def path_name(node): argument
211 def has_descendants_with_enums(node): argument
224 def get_children_by_throwing_away_kind(node, member='entries'): argument
837 def javadoc_crossref_filter(node): argument
912 def ndkdoc_crossref_filter(node): argument
|
| D | metadata_helpers_test.py | 137 def filter_test(node): argument
|
| /system/update_engine/payload_generator/ |
| D | topological_sort.cc | 33 Vertex::Index node) { in TopologicalSortVisit()
|
| /system/core/libmemunreachable/ |
| D | LinkedList.h | 28 void insert(LinkedList<T>& node) { in insert()
|
| /system/chre/core/tests/ |
| D | memory_manager_test.cc | 27 struct node { struct
28 node *next;
|
| /system/extras/simpleperf/scripts/ |
| D | report.py | 59 def add_child(self, node): argument
247 def display_call_tree(self, tree, parent_id, node, indent): argument
|