Home
last modified time | relevance | path

Searched refs:pair (Results 1 – 25 of 429) sorted by relevance

12345678910>>...18

/dragonfly/contrib/xz/src/xz/
H A Dfile_io.c586 pair->src_fd = open(pair->src_name, flags); in io_open_src_real()
657 if (stat(pair->src_name, &pair->src_st)) in io_open_src_real()
660 if (fstat(pair->src_fd, &pair->src_st)) in io_open_src_real()
814 io_unlink(pair->src_name, &pair->src_st); in io_close_src()
852 pair->dest_name = suffix_get_dest_name(pair->src_name); in io_open_dest_real()
895 pair->dest_fd = open(pair->dest_name, flags, mode); in io_open_dest_real()
908 if (fstat(pair->dest_fd, &pair->dest_st)) { in io_open_dest_real()
1035 io_unlink(pair->dest_name, &pair->dest_st); in io_close_dest()
1043 io_unlink(pair->dest_name, &pair->dest_st); in io_close_dest()
1064 if (lseek(pair->dest_fd, pair->dest_pending_sparse - 1, in io_close()
[all …]
H A Dcoder.c435 coder_init(file_pair *pair) in coder_init() argument
631 coder_normal(file_pair *pair) in coder_normal() argument
703 if (pair->src_eof) { in coder_normal()
723 if (coder_write_output(pair)) in coder_normal()
739 pair->flush_needed = false; in coder_normal()
789 pair, &in_buf, 1); in coder_normal()
798 assert(pair->src_eof); in coder_normal()
846 coder_passthru(file_pair *pair) in coder_passthru() argument
876 if (pair == NULL) in coder_run()
913 = pair->src_st.st_size <= 0 in coder_run()
[all …]
H A Dlist.c152 if (pair->src_st.st_size <= 0) { in parse_indexes()
159 pair->src_name); in parse_indexes()
179 off_t pos = pair->src_st.st_size; in parse_indexes()
205 if (io_pread(pair, &buf, in parse_indexes()
600 if (parse_check_value(pair, iter)) in parse_details()
694 pair->src_name, in print_info_basic()
959 pair, &iter, &bhi, xfi)) in print_info_robot()
1162 if (pair == NULL) in list_file()
1166 if (!parse_indexes(&xfi, pair)) { in list_file()
1179 fail = print_info_adv(&xfi, pair); in list_file()
[all …]
H A Dfile_io.h104 extern bool io_open_dest(file_pair *pair);
114 extern void io_close(file_pair *pair, bool success);
126 extern size_t io_read(file_pair *pair, io_buf *buf, size_t size);
139 extern void io_fix_src_pos(file_pair *pair, size_t rewind_size);
155 extern bool io_pread(file_pair *pair, io_buf *buf, size_t size, off_t pos);
166 extern bool io_write(file_pair *pair, const io_buf *buf, size_t size);
/dragonfly/contrib/ncurses/ncurses/base/
H A Dnew_pair.c78 pair = list[pair].prev; in prev_len()
91 pair = list[pair].next; in next_len()
232 list[list[pair].next].prev = pair; in _nc_set_color_pair()
259 int pair; in NCURSES_SP_NAME() local
263 pair = -1; in NCURSES_SP_NAME()
277 for (pair = hint + 1; pair < SP_PARM->_pair_alloc; pair++) { in NCURSES_SP_NAME()
288 pair = -1; in NCURSES_SP_NAME()
294 for (pair = 1; pair <= hint; pair++) { in NCURSES_SP_NAME()
305 pair = ERR; in NCURSES_SP_NAME()
314 pair = ERR; in NCURSES_SP_NAME()
[all …]
H A Dlib_color.c576 ReservePairs(sp, pair); in _nc_init_pair()
638 || (pair < 1)) { in _nc_init_pair()
652 _nc_change_pair(sp, pair); in _nc_init_pair()
670 (int) pair, in _nc_init_pair()
676 pair, in _nc_init_pair()
929 (int) pair, in _nc_pair_content()
939 ReservePairs(sp, pair); in _nc_pair_content()
956 (int) pair, in _nc_pair_content()
989 int pair, in NCURSES_SP_NAME()
1077 pair, in _nc_do_color()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/
H A Dstl_pair.h88 struct pair in _GLIBCXX_VISIBILITY() struct
110 pair(const pair<_U1, _U2>& __p) in _GLIBCXX_VISIBILITY() argument
116 constexpr pair(const pair<_U1, _U2>& __p) in _GLIBCXX_VISIBILITY() function
119 constexpr pair(const pair&) = default; in _GLIBCXX_VISIBILITY()
120 constexpr pair(pair&&) = default; in _GLIBCXX_VISIBILITY()
142 constexpr pair(pair<_U1, _U2>&& __p) in _GLIBCXX_VISIBILITY() function
149 pair& in _GLIBCXX_VISIBILITY()
157 pair& in _GLIBCXX_VISIBILITY()
168 pair& in _GLIBCXX_VISIBILITY()
177 pair& in _GLIBCXX_VISIBILITY()
[all …]
H A Dunordered_map.h42 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
48 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, in _GLIBCXX_VISIBILITY()
49 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
57 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
89 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) in _GLIBCXX_VISIBILITY()
115 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
121 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
123 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
130 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
132 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/
H A Dstl_pair.h276 pair(const pair<_U1, _U2>& __p) in _GLIBCXX_VISIBILITY()
291 constexpr pair(const pair<_U1, _U2>& __p) in _GLIBCXX_VISIBILITY()
300 explicit constexpr pair(const pair<_U1, _U2>& __p) in _GLIBCXX_VISIBILITY()
303 constexpr pair(const pair&) = default; in _GLIBCXX_VISIBILITY()
304 constexpr pair(pair&&) = default; in _GLIBCXX_VISIBILITY()
360 constexpr pair(pair<_U1, _U2>&& __p) in _GLIBCXX_VISIBILITY()
370 explicit constexpr pair(pair<_U1, _U2>&& __p) in _GLIBCXX_VISIBILITY()
377 pair& in _GLIBCXX_VISIBILITY()
388 pair& in _GLIBCXX_VISIBILITY()
495 swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/std/
H A Dutility143 /// Partial specialization for std::pair
148 /// Partial specialization for std::pair
150 struct tuple_size<std::pair<_Tp1, _Tp2>>
153 /// Partial specialization for std::pair
158 /// Partial specialization for std::pair
240 get(pair<_Tp, _Up>& __p) noexcept
245 get(const pair<_Tp, _Up>& __p) noexcept
250 get(pair<_Tp, _Up>&& __p) noexcept
260 get(pair<_Up, _Tp>& __p) noexcept
265 get(const pair<_Up, _Tp>& __p) noexcept
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/tr1/
H A Dutility50 // Various functions which give std::pair a tuple-like interface.
52 struct tuple_size<std::pair<_Tp1, _Tp2> >
57 tuple_size<std::pair<_Tp1, _Tp2> >::value;
60 struct tuple_element<0, std::pair<_Tp1, _Tp2> >
64 struct tuple_element<1, std::pair<_Tp1, _Tp2> >
74 static _Tp1& __get(std::pair<_Tp1, _Tp2>& __pair)
78 static const _Tp1& __const_get(const std::pair<_Tp1, _Tp2>& __pair)
86 static _Tp2& __get(std::pair<_Tp1, _Tp2>& __pair)
95 inline typename tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&
96 get(std::pair<_Tp1, _Tp2>& __in)
[all …]
H A Dunordered_map.h41 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
44 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, in _GLIBCXX_VISIBILITY()
45 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
52 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
83 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) in _GLIBCXX_VISIBILITY()
90 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
93 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
95 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
101 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
103 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/tr1/
H A Dutility51 // Various functions which give std::pair a tuple-like interface.
53 struct tuple_size<std::pair<_Tp1, _Tp2> >
58 tuple_size<std::pair<_Tp1, _Tp2> >::value;
61 struct tuple_element<0, std::pair<_Tp1, _Tp2> >
65 struct tuple_element<1, std::pair<_Tp1, _Tp2> >
75 static _Tp1& __get(std::pair<_Tp1, _Tp2>& __pair)
79 static const _Tp1& __const_get(const std::pair<_Tp1, _Tp2>& __pair)
87 static _Tp2& __get(std::pair<_Tp1, _Tp2>& __pair)
96 inline typename tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&
97 get(std::pair<_Tp1, _Tp2>& __in)
[all …]
H A Dunordered_map.h41 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
44 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, in _GLIBCXX_VISIBILITY()
45 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
52 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
83 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) in _GLIBCXX_VISIBILITY()
90 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, in _GLIBCXX_VISIBILITY()
93 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
95 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
101 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, in _GLIBCXX_VISIBILITY()
103 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/std/
H A Dutility65 * Components deemed generally useful. Includes pair, tuple,
90 struct tuple_size<std::pair<_Tp1, _Tp2>>
94 struct tuple_element<0, std::pair<_Tp1, _Tp2>>
98 struct tuple_element<1, std::pair<_Tp1, _Tp2>>
109 __get(std::pair<_Tp1, _Tp2>& __pair) noexcept
114 __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept
128 __get(std::pair<_Tp1, _Tp2>& __pair) noexcept
133 __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept
144 get(std::pair<_Tp1, _Tp2>& __in) noexcept
149 get(std::pair<_Tp1, _Tp2>&& __in) noexcept
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dgcse-common.c41 modify_pair pair; in canon_list_insert() local
60 pair.dest = dest; in canon_list_insert()
61 pair.dest_addr = dest_addr; in canon_list_insert()
64 canon_mem_list[bb].safe_push (pair); in canon_list_insert()
167 modify_pair *pair; in compute_transp() local
170 FOR_EACH_VEC_ELT_REVERSE (list, ix, pair) in compute_transp()
172 rtx dest = pair->dest; in compute_transp()
173 rtx dest_addr = pair->dest_addr; in compute_transp()
/dragonfly/contrib/ncurses/ncurses/trace/
H A Dlib_tracedmp.c140 int pair = GetPair(win->_line[n].text[j]); in NCURSES_EXPORT() local
141 if (pair >= 52) in NCURSES_EXPORT()
143 else if (pair >= 36) in NCURSES_EXPORT()
144 ep[j] = (char) (pair + 'A'); in NCURSES_EXPORT()
145 else if (pair >= 10) in NCURSES_EXPORT()
146 ep[j] = (char) (pair + 'a'); in NCURSES_EXPORT()
147 else if (pair >= 1) in NCURSES_EXPORT()
148 ep[j] = (char) (pair + '0'); in NCURSES_EXPORT()
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/parallel/
H A Dfind.h59 inline std::pair<_RAIter1, _RAIter2>
96 std::pair<_RAIter1, _RAIter2>
153 return std::pair<_RAIter1, _RAIter2>(__begin1 + __result, in __find_template()
184 std::pair<_RAIter1, _RAIter2>
204 std::pair<_RAIter1, _RAIter2> in __find_template()
239 std::pair<_RAIter1, _RAIter2> __local_result; in __find_template()
284 std::pair<_RAIter1, _RAIter2>(__begin1 + __result, in __find_template()
314 std::pair<_RAIter1, _RAIter2>
332 std::pair<_RAIter1, _RAIter2> in __find_template()
363 std::pair<_RAIter1, _RAIter2> __local_result; in __find_template()
[all …]
H A Dalgobase.h53 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
60 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
68 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
75 pair<_RAIter1, _RAIter2> in _GLIBCXX_VISIBILITY()
94 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
108 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
120 inline pair<_InputIterator1, _InputIterator2> in _GLIBCXX_VISIBILITY()
129 inline pair<_InputIterator1, _InputIterator2> in _GLIBCXX_VISIBILITY()
142 inline pair<_IIter1, _IIter2> in _GLIBCXX_VISIBILITY()
153 pair<_RAIter1, _RAIter2> in _GLIBCXX_VISIBILITY()
[all …]
H A Dmultiseq_selection.h54 : public std::binary_function<std::pair<_T1, _T2>,
55 std::pair<_T1, _T2>, bool>
64 operator()(const std::pair<_T1, _T2>& __p1, in operator()
65 const std::pair<_T1, _T2>& __p2) const in operator()
89 operator()(const std::pair<_T1, _T2>& __p1, in operator()
90 const std::pair<_T1, _T2>& __p2) const in operator()
454 std::vector<std::pair<_Tp, _SeqNumber> > __sample;
518 std::priority_queue<std::pair<_Tp, _SeqNumber>,
519 std::vector<std::pair<_Tp, _SeqNumber> >,
544 std::priority_queue<std::pair<_Tp, _SeqNumber>,
[all …]
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/parallel/
H A Dfind.h59 inline std::pair<_RAIter1, _RAIter2>
96 std::pair<_RAIter1, _RAIter2>
153 return std::pair<_RAIter1, _RAIter2>(__begin1 + __result, in __find_template()
184 std::pair<_RAIter1, _RAIter2>
204 std::pair<_RAIter1, _RAIter2> in __find_template()
239 std::pair<_RAIter1, _RAIter2> __local_result; in __find_template()
284 std::pair<_RAIter1, _RAIter2>(__begin1 + __result, in __find_template()
314 std::pair<_RAIter1, _RAIter2>
332 std::pair<_RAIter1, _RAIter2> in __find_template()
363 std::pair<_RAIter1, _RAIter2> __local_result; in __find_template()
[all …]
H A Dmultiseq_selection.h54 : public std::binary_function<std::pair<_T1, _T2>,
55 std::pair<_T1, _T2>, bool>
64 operator()(const std::pair<_T1, _T2>& __p1, in operator()
65 const std::pair<_T1, _T2>& __p2) const in operator()
89 operator()(const std::pair<_T1, _T2>& __p1, in operator()
90 const std::pair<_T1, _T2>& __p2) const in operator()
454 std::vector<std::pair<_Tp, _SeqNumber> > __sample;
518 std::priority_queue<std::pair<_Tp, _SeqNumber>,
519 std::vector<std::pair<_Tp, _SeqNumber> >,
544 std::priority_queue<std::pair<_Tp, _SeqNumber>,
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/debug/
H A Dmap.h236 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
255 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
266 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
276 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
279 std::pair<_Base_iterator, bool> __res in _GLIBCXX_VISIBILITY()
342 pair<iterator, bool> in _GLIBCXX_VISIBILITY()
351 pair<iterator, bool> in _GLIBCXX_VISIBILITY()
381 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
390 std::pair<iterator, bool> in _GLIBCXX_VISIBILITY()
634 std::pair<iterator,iterator> in _GLIBCXX_VISIBILITY()
[all …]
/dragonfly/contrib/ncurses/ncurses/tty/
H A Dlib_vidattr.c96 TR(TRACE_ATTRS, ("old pair = %d -- new pair = %d", old_pair, pair)); \
97 if ((pair != old_pair) \
98 || (fix_pair0 && (pair == 0)) \
102 (short) pair, \
115 int pair; in NCURSES_EXPORT() local
221 pair = PairNumber(newmode); in NCURSES_EXPORT()
230 SetColorsIf(((pair == 0) && !fix_pair0), PreviousAttr); in NCURSES_EXPORT()
256 SetColorsIf((pair != 0) || fix_pair0, PreviousAttr); in NCURSES_EXPORT()
283 SetColorsIf((pair != 0) || fix_pair0, PreviousAttr); in NCURSES_EXPORT()
307 SetColorsIf((pair != 0) || fix_pair0, PreviousAttr); in NCURSES_EXPORT()
/dragonfly/contrib/ncurses/ncurses/
H A Dnew_pair.h105 #define ValidPair(sp,pair) \ argument
106 ((sp != 0) && (pair >= 0) && (pair < sp->_pair_limit) && sp->_coloron)
115 #define _nc_reset_color_pair(sp, pair, data) /* nothing */ argument
116 #define _nc_set_color_pair(sp, pair, mode) /* nothing */ argument

12345678910>>...18