| /dports/www/aria2/aria2-1.36.0/src/ |
| H A D | LibgnutlsTLSSession.cc | 187 else if (rv_ == GNUTLS_E_AGAIN || rv_ == GNUTLS_E_INTERRUPTED) { in closeConnection()
206 if (rv_ >= 0) { in writeData()
207 ssize_t ret = rv_; in writeData()
208 rv_ = 0; in writeData()
211 else if (rv_ == GNUTLS_E_AGAIN || rv_ == GNUTLS_E_INTERRUPTED) { in writeData()
224 if (rv_ >= 0) { in readData()
225 ssize_t ret = rv_; in readData()
226 rv_ = 0; in readData()
229 else if (rv_ == GNUTLS_E_AGAIN || rv_ == GNUTLS_E_INTERRUPTED) { in readData()
246 if (rv_ == GNUTLS_E_AGAIN || rv_ == GNUTLS_E_INTERRUPTED) { in tlsConnect()
[all …]
|
| H A D | LibsslTLSSession.cc | 81 if (rv_ == 0) { in init()
131 if (rv_ <= 0) { in writeData()
140 ssize_t ret = rv_; in writeData()
141 rv_ = 1; in writeData()
150 if (rv_ <= 0) { in readData()
155 if (rv_ == 0) { in readData()
166 ssize_t ret = rv_; in readData()
167 rv_ = 1; in readData()
180 if (rv_ <= 0) { in handshake()
337 if (rv_ <= 0) { in getLastErrorString()
[all …]
|
| /dports/math/fxt/fxt/src/comb/ |
| H A D | combination-rec.h | 20 ulong *rv_; // combination: k elements 0<=x[j]<k in increasing order variable
40 rv_ = new ulong[k_+1]; in comb_rec()
41 ++rv_; in comb_rec()
42 rv_[-1] = -1UL; in comb_rec()
47 --rv_; in ~comb_rec()
48 delete [] rv_; in ~comb_rec()
62 { ::print_set(bla, rv_, k_); }
65 { print_set_as_deltaset(bla, rv_, k_, n_); }
|
| H A D | ksubset-twoclose.h | 18 ulong *rv_; // record of visits in graph (delta set)
32 rv_ = new ulong[n_]; in ksubset_twoclose()
40 delete [] rv_; in ~ksubset_twoclose()
65 if ( n0 ) { rv_[d]=0; next_rec(d, n1-0, n0-1, d&1); } in next_rec()
66 if ( n1 ) { rv_[d]=1; next_rec(d, n1-1, n0-0, q); } in next_rec()
70 if ( n1 ) { rv_[d]=1; next_rec(d, n1-1, n0-0, q); } in next_rec()
71 if ( n0 ) { rv_[d]=0; next_rec(d, n1-0, n0-1, d&1); } in next_rec()
|
| H A D | ksubset-rec.h | 19 ulong *rv_; // record of visits in graph (list of elements in subset) variable
35 rv_ = new ulong[n_+1]; in ksubset_rec()
36 ++rv_; in ksubset_rec()
37 rv_[-1] = -1UL; in ksubset_rec()
42 --rv_; in ~ksubset_rec()
43 delete [] rv_; in ~ksubset_rec()
|
| H A D | combination-rec.cc | 31 ulong rv1 = rv_[d-1]; // left neighbor in next_rec()
57 rv_[d] = x; in next_rec()
68 rv_[d] = x; in next_rec()
84 rv_[d] = x; in next_rec()
|
| /dports/databases/galera/galera-release_25.3.35/galerautils/src/ |
| H A D | gu_vector.hpp | 65 Vector() : rv_() {} in Vector()
67 Vector(const Vector& other) : rv_() in Vector()
69 rv_().assign(other().begin(), other().end()); in Vector()
82 ContainerType& operator() () { return rv_.container(); } in operator ()()
83 const ContainerType& operator() () const { return rv_.container(); } in operator ()()
85 ContainerType* operator-> () { return rv_.operator->(); } in operator ->()
86 const ContainerType* operator-> () const { return rv_.operator->(); } in operator ->()
105 return (rv_.reserved_buffer() != &rv_.container()[0]); in in_heap()
110 ReservedContainer<ContainerType, capacity> rv_; member in gu::Vector
|
| /dports/math/fxt/fxt/src/graph/ |
| H A D | digraph-paths.cc | 20 rv_ = new ulong[ng_]; in digraph_paths()
31 delete [] rv_; in ~digraph_paths()
52 ulong p0 = rv_[0]; // first node visited in path_is_cycle()
53 ulong p = rv_[ng_-1]; // last node visited in path_is_cycle()
71 if ( qq_[rv_[k]] - 1 ) return k+1; in test_lucky_path()
84 bool ha = graph().has_edge(rv_[ns-1], p); in mark()
87 rv_[ns] = p; in mark()
103 ulong pk = rv_[k]; in print_turns()
109 ulong pn = rv_[k+1]; in print_turns()
|
| H A D | digraph-paths.h | 19 ulong *rv_; // Record of Visits: rv[k] == node visited at step k variable
61 { ::print_path(rv_, ng_); } in print_path()
65 { ::print_bin_path(rv_, ng_, ngbits_); } in print_bin_path()
69 { ::print_bin_horiz_path(rv_, ng_, ngbits_); } in print_bin_horiz_path()
|
| H A D | search-digraph-cond.cc | 26 for (ulong k=0; k<ng_; ++k) cout << " " << setw(2) << rv_[k]; in all_cond_paths()
56 rv_[ns] = p; // record position in next_cond_path()
61 for (ulong k=0; k<ns; ++k) cout << rv_[k] << " "; in next_cond_path()
89 rv_[ns] = t; // for cfunc() in next_cond_path()
|
| /dports/math/fxt/fxt/src/graph/attic/ |
| H A D | debruijngraph.h | 57 ulong *rv_; // Record of Visits: rv[k] == node visited at step k variable
72 rv_ = new ulong[ng_]; in debruijn_cycles()
82 delete [] rv_; in ~debruijn_cycles()
99 ulong k0 = rv_[0]; // first node visited in path_is_cycle()
100 ulong k = rv_[ng_-1]; // last node visited in path_is_cycle()
109 { ::print_path(rv_, ng_); } in print_path()
112 { ::print_bin_path(rv_, ng_, ngbits_); } in print_bin_path()
115 { ::print_bin_horiz_path(rv_, ng_, ngbits_); } in print_bin_horiz_path()
|
| /dports/cad/opencascade/opencascade-7.6.0/tests/lowalgos/bvh/ |
| H A D | bug30655_1 | 13 QABVH_ShapeSelect rv_$v b $v -void
19 checknbshapes rv_$v -ref [nbshapes r_$v]
20 checkprops rv_$v -equal r_$v
26 QABVH_ShapeSelect rv_$e b $e -void
32 checknbshapes rv_$e -ref [nbshapes r_$e]
33 checkprops rv_$e -equal r_$e
39 QABVH_ShapeSelect rv_$f b $f -void
45 checknbshapes rv_$f -ref [nbshapes r_$f]
46 checkprops rv_$f -equal r_$f
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/net/tools/quic/ |
| H A D | synchronous_host_resolver.cc | 51 int rv_; member in net::__anon94e24be40111::ResolverThread
57 : SimpleThread("resolver_thread"), rv_(ERR_UNEXPECTED) {} in ResolverThread()
78 rv_ = request->Start(base::BindOnce(&ResolverThread::OnResolutionComplete, in Run()
82 if (rv_ == ERR_IO_PENDING) { in Run()
87 if (rv_ == OK) { in Run()
97 return rv_; in Resolve()
101 rv_ = rv; in OnResolutionComplete()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/net/tools/quic/ |
| H A D | synchronous_host_resolver.cc | 51 int rv_; member in net::__anoncf45f8e90111::ResolverThread
57 : SimpleThread("resolver_thread"), rv_(ERR_UNEXPECTED) {} in ResolverThread()
78 rv_ = request->Start(base::BindOnce(&ResolverThread::OnResolutionComplete, in Run()
82 if (rv_ == ERR_IO_PENDING) { in Run()
87 if (rv_ == OK) { in Run()
97 return rv_; in Resolve()
101 rv_ = rv; in OnResolutionComplete()
|
| /dports/databases/galera26/galera-release_26.4.10/galerautils/src/ |
| H A D | gu_vector.hpp | 74 Vector() : rv_() {} in Vector()
76 Vector(const Vector& other) : rv_() in Vector()
78 rv_().assign(other().begin(), other().end()); in Vector()
120 return (rv_.reserved_buffer() != &rv_.container()[0]); in in_heap()
125 ReservedContainer<ContainerType, capacity> rv_; member in gu::Vector
127 ContainerType& container() { return rv_.container(); } in container()
128 const ContainerType& container() const { return rv_.container(); } in container()
|
| /dports/math/fxt/fxt/demo/graph/ |
| H A D | graph-acgray-demo.cc | 27 const ulong *rv = dp.rv_; in pfunc()
49 if ( ns<2 ) return (dp.rv_[1] < cf_mt); // avoid track-reflected solutions in cfunc_ac()
50 ulong p = dp.rv_[ns], p1 = dp.rv_[ns-1], p2 = dp.rv_[ns-2]; in cfunc_ac()
|
| H A D | graph-perm-doubly-adjacent-gray-demo.cc | 94 const ulong x = dp.rv_[k]; in pfunc_permgray()
105 const ulong x1 = dp.rv_[k]; in pfunc_permgray()
106 const ulong x2 = dp.rv_[k + dp.ng_/2]; in pfunc_permgray()
117 const ulong *rv = dp.rv_; in pfunc_permgray()
162 ulong p0 = N * dp.rv_[ns], p2 = N * dp.rv_[1]; in cfunc_adj()
169 ulong p0 = N * dp.rv_[ns], p2 = N * dp.rv_[ns-2]; in cfunc_adj()
|
| H A D | graph-macgray-demo.cc | 28 const ulong *rv = dp.rv_; in pfunc()
51 ulong p = dp.rv_[ns], p1 = dp.rv_[ns-1], p2 = dp.rv_[ns-2]; in cfunc_mac()
|
| H A D | graph-monotonicgray-demo.cc | 38 const ulong *rv = dp.rv_; in pfunc_monotonic()
56 const ulong *rv = dp.rv_; in pfunc_all()
80 return ( bc_tab[dp.rv_[ns]] == bc_mon[ns] ); in cfunc_monotonic()
162 p = dp.rv_[ns-1]; in main()
167 print_bin_path(dp.rv_, ns, n); in main()
|
| H A D | graph-lyndon-gray-demo.cc | 38 const ulong *rv = dp.rv_; in print()
100 ulong p = dp.rv_[ns], p1 = dp.rv_[ns-1]; in cfunc_rot0()
111 ulong p = dp.rv_[ns], p2 = dp.rv_[ns-2]; in cfunc_monotonic()
|
| /dports/databases/iowow/iowow-1.4.13/src/utils/ |
| H A D | iwutils.h | 313 #define IW_CMP(rv_, vp1_, vp1sz_, vp2_, vp2sz_) \ argument
315 (rv_) = 0; \
318 (rv_) = (int) (((const uint8_t*) (vp1_))[i] - ((const uint8_t*) (vp2_))[i]); \
319 if (rv_) { \
323 if ((rv_) == 0) (rv_) = (vp1sz_) - (vp2sz_); \
328 #define IW_CMP2(rv_, vp1_, vp1sz_, vp2_, vp2sz_) \ argument
330 (rv_) = 0; \
333 (rv_) = (int) (((const uint8_t*) (vp1_))[i] - ((const uint8_t*) (vp2_))[i]); \
334 if (rv_) { \
|
| /dports/science/elk/elk-7.2.42/src/ |
| H A D | testcheck.f90 | 81 read(91,*,err=10) k,rv_
85 t1=abs(rv_-rv)
86 t2=abs(rv_)*tol
87 if ((t1.gt.t2).and.(abs(rv_).gt.1.d-4)) then
92 rv_
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/net/socket/ |
| H A D | udp_socket_posix_unittest.cc | 180 rv_ = 0; in ResetWriteCallback()
185 rv_ = rv; in OnWriteComplete()
225 int rv_; member in net::test::UDPSocketPosixTest
383 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
419 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
438 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
481 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
525 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
589 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
603 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/net/socket/ |
| H A D | udp_socket_posix_unittest.cc | 180 rv_ = 0; in ResetWriteCallback()
185 rv_ = rv; in OnWriteComplete()
225 int rv_; member in net::test::UDPSocketPosixTest
383 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
419 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
438 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
481 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
525 EXPECT_EQ(rv_, lengths_[0]); in TEST_F()
589 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
603 EXPECT_EQ(rv_, total_lengths_); in TEST_F()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/brip/ |
| H A D | brip_rect_mask.h | 94 if (dv>rv_||dv<-rv_) return 0; in operator()
95 return current_mask_[dv+rv_][du+ru_]; in operator()
104 int ru_, rv_; variable
|