Home
last modified time | relevance | path

Searched refs:hash_map (Results 1 – 25 of 87) sorted by relevance

1234

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dhash-map.h39 class GTY((user)) hash_map in class()
134 explicit hash_map (size_t n = default_hash_map_size, bool ggc = false, in class()
143 explicit hash_map (const hash_map &h, bool ggc = false, in class()
151 static hash_map *create_ggc (size_t size = default_hash_map_size, in class()
155 hash_map *map = ggc_alloc<hash_map> (); in class()
156 new (map) hash_map (size, true, true, gather_mem_stats PASS_MEM_STAT); in class()
292 template<typename T, typename U, typename V> friend void gt_ggc_mx (hash_map<T, U, V> *); in class()
293 template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<T, U, V> *); in class()
294 …template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<T, U, V> *, gt_pointe… in class()
295 template<typename T, typename U, typename V> friend void gt_cleare_cache (hash_map<T, U, V> *); in class()
[all …]
H A Dipa-icf.h171 typedef hash_map<sem_usage_hash, auto_vec<sem_item *> > ref_map;
201 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
205 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
221 void update_hash_by_addr_refs (hash_map <symtab_node *,
226 void update_hash_by_local_refs (hash_map <symtab_node *,
288 bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
305 static hash_map<const_tree, hashval_t> m_type_hash_cache;
322 hash_map <symtab_node *, sem_item *> &ignored_nodes);
325 hash_map <symtab_node *, sem_item *> &ignored_nodes);
428 hash_map <symtab_node *, sem_item *> &ignored_nodes);
[all …]
H A Dtree-inline.h68 hash_map<tree, tree> *decl_map;
88 hash_map<void *, void *> *eh_map;
156 hash_map<tree, tree> *debug_map;
160 hash_map<dependence_hash, unsigned short> *dependence_map;
H A Dtree-affine.h82 void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **);
84 hash_map<tree, name_expansion *> **);
86 void free_affine_expand_cache (hash_map<tree, name_expansion *> **);
H A Dexcept.h204 hash_map<gimple *, int> *GTY(()) throw_stmt_table;
248 extern hash_map<void *, void *> *duplicate_eh_regions
291 extern hash_map<gimple *, int> *get_eh_throw_stmt_table (struct function *);
292 extern void set_eh_throw_stmt_table (function *, hash_map<gimple *, int> *);
H A Dipa-icf-gimple.h256 hash_map <edge, edge> m_edge_map;
259 hash_map <const_tree, const_tree> m_decl_map;
262 hash_map <const_tree, int> m_label_bb_map;
H A Dprint-rtl.h154 hash_map<const_rtx, int> m_rtx_occurrence_count;
155 hash_map<const_rtx, int> m_rtx_reuse_ids;
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dhash-map.h39 class GTY((user)) hash_map in class()
134 explicit hash_map (size_t n = default_hash_map_size, bool ggc = false, in class()
143 explicit hash_map (const hash_map &h, bool ggc = false, in class()
151 static hash_map *create_ggc (size_t size = default_hash_map_size, in class()
155 hash_map *map = ggc_alloc<hash_map> (); in class()
156 new (map) hash_map (size, true, true, gather_mem_stats PASS_MEM_STAT); in class()
292 template<typename T, typename U, typename V> friend void gt_ggc_mx (hash_map<T, U, V> *); in class()
293 template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<T, U, V> *); in class()
294 …template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<T, U, V> *, gt_pointe… in class()
295 template<typename T, typename U, typename V> friend void gt_cleare_cache (hash_map<T, U, V> *); in class()
[all …]
H A Dipa-icf.h171 typedef hash_map<sem_usage_hash, auto_vec<sem_item *> > ref_map;
201 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
205 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
221 void update_hash_by_addr_refs (hash_map <symtab_node *,
226 void update_hash_by_local_refs (hash_map <symtab_node *,
288 bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
305 static hash_map<const_tree, hashval_t> m_type_hash_cache;
322 hash_map <symtab_node *, sem_item *> &ignored_nodes);
325 hash_map <symtab_node *, sem_item *> &ignored_nodes);
428 hash_map <symtab_node *, sem_item *> &ignored_nodes);
[all …]
H A Dtree-inline.h68 hash_map<tree, tree> *decl_map;
88 hash_map<void *, void *> *eh_map;
156 hash_map<tree, tree> *debug_map;
160 hash_map<dependence_hash, unsigned short> *dependence_map;
H A Dtree-affine.h82 void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **);
84 hash_map<tree, name_expansion *> **);
86 void free_affine_expand_cache (hash_map<tree, name_expansion *> **);
H A Dexcept.h204 hash_map<gimple *, int> *GTY(()) throw_stmt_table;
248 extern hash_map<void *, void *> *duplicate_eh_regions
291 extern hash_map<gimple *, int> *get_eh_throw_stmt_table (struct function *);
292 extern void set_eh_throw_stmt_table (function *, hash_map<gimple *, int> *);
H A Dipa-icf-gimple.h256 hash_map <edge, edge> m_edge_map;
259 hash_map <const_tree, const_tree> m_decl_map;
262 hash_map <const_tree, int> m_label_bb_map;
H A Dprint-rtl.h154 hash_map<const_rtx, int> m_rtx_occurrence_count;
155 hash_map<const_rtx, int> m_rtx_reuse_ids;
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/ext/
H A Dhash_map2 //===-------------------------- hash_map ----------------------------------===//
16 hash_map synopsis
23 class hash_map
43 explicit hash_map(size_type n = 193, const hasher& hf = hasher(),
47 hash_map(InputIterator f, InputIterator l,
51 hash_map(const hash_map&);
52 ~hash_map();
53 hash_map& operator=(const hash_map&);
75 void swap(hash_map&);
97 void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/ext/
H A Dhash_map2 //===-------------------------- hash_map ----------------------------------===//
16 hash_map synopsis
23 class hash_map
43 explicit hash_map(size_type n = 193, const hasher& hf = hasher(),
47 hash_map(InputIterator f, InputIterator l,
51 hash_map(const hash_map&);
52 ~hash_map();
53 hash_map& operator=(const hash_map&);
75 void swap(hash_map&);
97 void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/backward/
H A Dhash_map51 /** @file backward/hash_map
83 class hash_map
124 hash_map()
128 hash_map(size_type __n)
131 hash_map(size_type __n, const hasher& __hf)
134 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
139 hash_map(_InputIterator __f, _InputIterator __l)
144 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
149 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
155 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/backward/
H A Dhash_map51 /** @file backward/hash_map
83 class hash_map
124 hash_map()
128 hash_map(size_type __n)
131 hash_map(size_type __n, const hasher& __hf)
134 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
139 hash_map(_InputIterator __f, _InputIterator __l)
144 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
149 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
155 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/
H A Dhash_map51 /** @file backward/hash_map
83 class hash_map
124 hash_map()
128 hash_map(size_type __n)
131 hash_map(size_type __n, const hasher& __hf)
134 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
139 hash_map(_InputIterator __f, _InputIterator __l)
144 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
149 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
155 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/
H A Dhash_map51 /** @file backward/hash_map
83 class hash_map
124 hash_map()
128 hash_map(size_type __n)
131 hash_map(size_type __n, const hasher& __hf)
134 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
139 hash_map(_InputIterator __f, _InputIterator __l)
144 hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
149 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
155 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
/OK3568_Linux_fs/kernel/samples/bpf/
H A Dmap_perf_test_kern.c24 } hash_map SEC(".maps");
112 bpf_map_update_elem(&hash_map, &key, &init_val, BPF_ANY); in SYSCALL()
113 value = bpf_map_lookup_elem(&hash_map, &key); in SYSCALL()
115 bpf_map_delete_elem(&hash_map, &key); in SYSCALL()
272 value = bpf_map_lookup_elem(&hash_map, &key); in SYSCALL()
H A Dsockex2_kern.c198 } hash_map SEC(".maps");
211 value = bpf_map_lookup_elem(&hash_map, &key); in bpf_prog2()
218 bpf_map_update_elem(&hash_map, &key, &val, BPF_ANY); in bpf_prog2()
H A Dsockex3_kern.c123 } hash_map SEC(".maps");
130 value = bpf_map_lookup_elem(&hash_map, &key); in update_stats()
137 bpf_map_update_elem(&hash_map, &key, &val, BPF_ANY); in update_stats()
/OK3568_Linux_fs/kernel/tools/testing/selftests/bpf/progs/
H A Dfreplace_attach_probe.c21 } hash_map SEC(".maps");
29 val = bpf_map_lookup_elem(&hash_map, &key); in new_handle_kprobe()
H A Dtest_map_lock.c19 } hash_map SEC(".maps");
41 val = bpf_map_lookup_elem(&hash_map, &key); in bpf_map_lock_test()

1234