Home
last modified time | relevance | path

Searched refs:rg (Results 1 – 25 of 43) sorted by relevance

12

/freebsd/contrib/elftoolchain/libdwarf/
H A Dlibdwarf_ranges.c33 uint64_t off, Dwarf_Ranges *rg, Dwarf_Unsigned *cnt) in _dwarf_ranges_parse() argument
44 if (rg != NULL) { in _dwarf_ranges_parse()
45 rg[i].dwr_addr1 = start; in _dwarf_ranges_parse()
46 rg[i].dwr_addr2 = end; in _dwarf_ranges_parse()
48 rg[i].dwr_type = DW_RANGES_END; in _dwarf_ranges_parse()
51 rg[i].dwr_type = DW_RANGES_ADDRESS_SELECTION; in _dwarf_ranges_parse()
53 rg[i].dwr_type = DW_RANGES_ENTRY; in _dwarf_ranges_parse()
/freebsd/sys/contrib/device-tree/src/arm64/rockchip/
H A Drk3566-anbernic-rg-arc-s.dts8 #include "rk3566-anbernic-rg-arc.dtsi"
12 compatible = "anbernic,rg-arc-s", "rockchip,rk3566";
H A Drk3566-anbernic-rg-arc-d.dts8 #include "rk3566-anbernic-rg-arc.dtsi"
12 compatible = "anbernic,rg-arc-d", "rockchip,rk3566";
H A Drk3566-anbernic-rg-arc.dtsi111 compatible = "anbernic,rg-arc-panel", "sitronix,st7701";
/freebsd/contrib/llvm-project/libcxx/include/
H A Dvector47 constexpr vector(from_range_t, R&& rg, const Allocator& = Allocator()); // C++23
63 constexpr void assign_range(R&& rg); // C++23
109 constexpr void append_range(R&& rg); // C++23
119 constexpr iterator insert_range(const_iterator position, R&& rg); // C++23
179 constexpr vector(from_range_t, R&& rg, const Allocator& = Allocator());
194 constexpr void assign_range(R&& rg); // C++23
235 constexpr void append_range(R&& rg); // C++23
244 constexpr iterator insert_range(const_iterator position, R&& rg); // C++23
H A Dstack45 template<container-compatible-range<T> R> stack(from_range_t, R&& rg); // since C++23
54 stack(from_range_t, R&& rg, const Alloc&); // since C++23
64 void push_range(R&& rg); // C++23
H A Dqueue46 template<container-compatible-range<T> R> queue(from_range_t, R&& rg); // since C++23
60 queue(from_range_t, R&& rg, const Alloc&); // since C++23
73 void push_range(R&& rg); // C++23
158 priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); // since C++23
182 priority_queue(from_range_t, R&& rg, const Compare&, const Alloc&); // since C++23
184 priority_queue(from_range_t, R&& rg, const Alloc&); // since C++23
197 void push_range(R&& rg); // C++23
H A Dunordered_set64 unordered_set(from_range_t, R&& rg, size_type n = see below,
87 unordered_set(from_range_t, R&& rg, size_type n, const allocator_type& a)
88 : unordered_set(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
90 unordered_set(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
91 : unordered_set(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
129 void insert_range(R&& rg); // C++23
312 unordered_multiset(from_range_t, R&& rg, size_type n = see below,
335 unordered_multiset(from_range_t, R&& rg, size_type n, const allocator_type& a)
336 … : unordered_multiset(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
338 … unordered_multiset(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
[all …]
H A Dset60 …set(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
76 set(from_range_t, R&& rg, const Allocator& a))
77 : set(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
123 void insert_range(R&& rg); // C++23
304 multiset(from_range_t, R&& rg,
321 multiset(from_range_t, R&& rg, const Allocator& a))
322 : multiset(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
368 void insert_range(R&& rg); // C++23
H A Dunordered_map63 unordered_map(from_range_t, R&& rg, size_type n = see below,
91 unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a)
92 : unordered_map(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
94 unordered_map(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
95 : unordered_map(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
137 void insert_range(R&& rg); // C++23
350 unordered_multimap(from_range_t, R&& rg, size_type n = see below,
377 unordered_multimap(from_range_t, R&& rg, size_type n, const allocator_type& a)
378 … : unordered_multimap(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
380 … unordered_multimap(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
[all …]
H A Dmap74 …map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
89 map(from_range_t, R&& rg, const Allocator& a))
90 : map(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
147 void insert_range(R&& rg); // C++23
358 multimap(from_range_t, R&& rg,
375 multimap(from_range_t, R&& rg, const Allocator& a))
376 : multimap(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
426 void insert_range(R&& rg); // C++23
/freebsd/sys/netgraph/netflow/
H A Dnetflow_v9.c241 struct netflow_v9_record_general rg; in export9_add() local
265 struct netflow_v9_record_ipv4_tcp *rec = &rg.rec.v4_tcp; in export9_add()
296 struct netflow_v9_record_ipv6_tcp *rec = &rg.rec.v6_tcp; in export9_add()
350 if (m_append(m, len, (void *)&rg.rec) != 1) in export9_add()
/freebsd/share/doc/smm/07.lpd/
H A Dspell.ok46 rg
/freebsd/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_cg.c474 int rg; in dt_cg_typecast() local
484 rg = dt_regset_alloc(drp); in dt_cg_typecast()
490 dt_cg_setx(dlp, rg, n); in dt_cg_typecast()
492 instr = DIF_INSTR_FMT(DIF_OP_SLL, src->dn_reg, rg, dst->dn_reg); in dt_cg_typecast()
497 dst->dn_reg, rg, dst->dn_reg); in dt_cg_typecast()
501 dt_cg_setx(dlp, rg, s); in dt_cg_typecast()
503 dst->dn_reg, rg, dst->dn_reg); in dt_cg_typecast()
506 dt_cg_setx(dlp, rg, n - s); in dt_cg_typecast()
508 dst->dn_reg, rg, dst->dn_reg); in dt_cg_typecast()
515 dt_cg_setx(dlp, rg, n); in dt_cg_typecast()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dunordered_set64 unordered_set(from_range_t, R&& rg, size_type n = see below,
87 unordered_set(from_range_t, R&& rg, size_type n, const allocator_type& a)
88 : unordered_set(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
90 unordered_set(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
91 : unordered_set(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
129 void insert_range(R&& rg); // C++23
312 unordered_multiset(from_range_t, R&& rg, size_type n = see below,
335 unordered_multiset(from_range_t, R&& rg, size_type n, const allocator_type& a)
336 … : unordered_multiset(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
338 … unordered_multiset(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
[all …]
H A Dqueue46 template<container-compatible-range<T> R> queue(from_range_t, R&& rg); // since C++23
60 queue(from_range_t, R&& rg, const Alloc&); // since C++23
73 void push_range(R&& rg); // C++23
158 priority_queue(from_range_t, R&& rg, const Compare& x = Compare()); // since C++23
182 priority_queue(from_range_t, R&& rg, const Compare&, const Alloc&); // since C++23
184 priority_queue(from_range_t, R&& rg, const Alloc&); // since C++23
197 void push_range(R&& rg); // C++23
H A Dstack45 template<container-compatible-range<T> R> stack(from_range_t, R&& rg); // since C++23
54 stack(from_range_t, R&& rg, const Alloc&); // since C++23
64 void push_range(R&& rg); // C++23
H A Dset60 …set(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
76 set(from_range_t, R&& rg, const Allocator& a))
77 : set(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
123 void insert_range(R&& rg); // C++23
304 multiset(from_range_t, R&& rg,
321 multiset(from_range_t, R&& rg, const Allocator& a))
322 : multiset(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
368 void insert_range(R&& rg); // C++23
H A Dunordered_map63 unordered_map(from_range_t, R&& rg, size_type n = see below,
91 unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a)
92 : unordered_map(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
94 unordered_map(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
95 : unordered_map(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
137 void insert_range(R&& rg); // C++23
350 unordered_multimap(from_range_t, R&& rg, size_type n = see below,
377 unordered_multimap(from_range_t, R&& rg, size_type n, const allocator_type& a)
378 … : unordered_multimap(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
380 … unordered_multimap(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
[all …]
H A Dmap74 …map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++…
89 map(from_range_t, R&& rg, const Allocator& a))
90 : map(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
147 void insert_range(R&& rg); // C++23
358 multimap(from_range_t, R&& rg,
375 multimap(from_range_t, R&& rg, const Allocator& a))
376 : multimap(from_range, std::forward<R>(rg), Compare(), a) { } // C++23
426 void insert_range(R&& rg); // C++23
/freebsd/sys/contrib/zstd/programs/
H A Dzstdgrep.1.md16 Note that modern `grep` alternatives such as `ripgrep` (`rg`(1)) support `zstd`-compressed files ou…
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h178 bitmap_t rg = bitmap[rgoff]; in bitmap_full()
180 return (rg == 0); in bitmap_full()
179 bitmap_t rg = bitmap[rgoff]; bitmap_full() local
/freebsd/contrib/openpam/
H A DCREDITS38 Jörg Sonnenberger <joerg@britannica.bec.de>
/freebsd/contrib/mandoc/
H A Dpredefs.in48 PREDEF("R", "\\(rg")
/freebsd/secure/caroot/trusted/
H A DBJCA_Global_Root_CA2.pem60 sVF/BvDRgh9Obl+rg/xI1LCRMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQD

12