| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/ |
| H A D | merge_test.cpp | 344 if(curr_count.tri > 0) in coincident_counts()
353 if(curr_count.tet > 0) in coincident_counts()
362 if(curr_count.hex > 0) in coincident_counts()
796 curr_count.print(); in process_td_auto_merge()
872 curr_count.print(); in process_td_auto_merge()
892 curr_count.print(); in process_mo_auto_merge()
947 curr_count.print(); in process_mo_auto_merge()
967 curr_count.print(); in process_bu_auto_merge()
1011 curr_count.print(); in process_bu_auto_merge()
1030 curr_count.print(); in process_merge()
[all …]
|
| /dports/games/xataxx/xataxx/ |
| H A D | board.c | 350 int best_count,oplayer,curr_count; variable
357 curr_count++; in evaluate()
359 curr_count++; in evaluate()
361 curr_count++; in evaluate()
363 curr_count++; in evaluate()
365 curr_count++; in evaluate()
367 curr_count++; in evaluate()
369 curr_count++; in evaluate()
371 curr_count++; in evaluate()
372 if (curr_count > best_count) { in evaluate()
[all …]
|
| /dports/net/samba412/samba-4.12.15/lib/util/ |
| H A D | sys_rw.c | 155 size_t curr_count = count; in sys_pread_full() local
165 while (curr_count != 0) { in sys_pread_full()
168 curr_count, in sys_pread_full()
179 if (ret > curr_count) { in sys_pread_full()
185 curr_count -= ret; in sys_pread_full()
217 size_t curr_count = count; in sys_pwrite_full() local
227 while (curr_count != 0) { in sys_pwrite_full()
230 curr_count, in sys_pwrite_full()
242 if (ret > curr_count) { in sys_pwrite_full()
248 curr_count -= ret; in sys_pwrite_full()
|
| /dports/devel/openocd/openocd-0.11.0/contrib/loaders/flash/cc26xx/ |
| H A D | flashloader.c | 96 uint32_t curr_count; in flashloader_program_with_retain() local
102 curr_count = byte_count; in flashloader_program_with_retain()
104 curr_count -= (address + byte_count) % FLASH_ERASE_SIZE; in flashloader_program_with_retain()
110 memcpy(&g_retain_buf[sec_offset], &src[src_offset], curr_count); in flashloader_program_with_retain()
118 address += curr_count; in flashloader_program_with_retain()
120 byte_count -= curr_count; in flashloader_program_with_retain()
121 src_offset += curr_count; in flashloader_program_with_retain()
|
| /dports/net/mpich/mpich-3.4.3/src/mpi/coll/iallgatherv/ |
| H A D | iallgatherv_intra_sched_brucks.c | 16 int incoming_count, curr_count; in MPIR_Iallgatherv_intra_sched_brucks() local
60 curr_count = recvcounts[rank]; in MPIR_Iallgatherv_intra_sched_brucks()
71 mpi_errno = MPIR_Sched_send(tmp_buf, curr_count * recvtype_sz, MPI_BYTE, dst, comm_ptr, s); in MPIR_Iallgatherv_intra_sched_brucks()
74 mpi_errno = MPIR_Sched_recv(((char *) tmp_buf + curr_count * recvtype_sz), in MPIR_Iallgatherv_intra_sched_brucks()
80 curr_count += incoming_count; in MPIR_Iallgatherv_intra_sched_brucks()
97 mpi_errno = MPIR_Sched_recv(((char *) tmp_buf + curr_count * recvtype_sz), in MPIR_Iallgatherv_intra_sched_brucks()
98 (total_count - curr_count) * recvtype_sz, MPI_BYTE, in MPIR_Iallgatherv_intra_sched_brucks()
|
| /dports/biology/bedtools/bedtools2-2.30.0/src/utils/VectorOps/ |
| H A D | VectorOps.cpp | 167 int curr_count = 0; in GetMode() local
177 if (curr_count > max_count) in GetMode()
179 max_count = curr_count; in GetMode()
182 curr_count = 1; in GetMode()
184 else { curr_count++; } in GetMode()
188 if (curr_count > max_count) in GetMode()
198 int curr_count = 0; in GetAntiMode() local
208 if (curr_count < min_count) in GetAntiMode()
213 curr_count = 1; in GetAntiMode()
215 else { curr_count++; } in GetAntiMode()
[all …]
|
| /dports/multimedia/kvazaar/kvazaar-2.1.0/rdcost-weight-tool/ |
| H A D | rdcost_do_avg.py | 12 curr_count = 0
25 curr_count += 1
29 if (curr_count > 0):
30 curr_avgs = tuple(curr_sum / curr_count for curr_sum in curr_sums)
|
| /dports/devel/grpc/grpc-1.42.0/src/core/lib/iomgr/executor/ |
| H A D | mpmcqueue.cc | 105 int curr_count = count_.load(std::memory_order_relaxed); in Put() local
107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()
109 Node* new_chunk = AllocateNodes(curr_count); in Put()
117 new_chunk[curr_count - 1].next = queue_head_; in Put()
119 queue_head_->prev = &new_chunk[curr_count - 1]; in Put()
130 if (curr_count == 0) { in Put()
136 count_.store(curr_count + 1, std::memory_order_relaxed); in Put()
|
| /dports/devel/grpc130/grpc-1.30.2/src/core/lib/iomgr/executor/ |
| H A D | mpmcqueue.cc | 105 int curr_count = count_.Load(MemoryOrder::RELAXED); in Put() local
107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()
109 Node* new_chunk = AllocateNodes(curr_count); in Put()
118 new_chunk[curr_count - 1].next = queue_head_; in Put()
120 queue_head_->prev = &new_chunk[curr_count - 1]; in Put()
131 if (curr_count == 0) { in Put()
137 count_.Store(curr_count + 1, MemoryOrder::RELAXED); in Put()
|
| /dports/devel/grpc134/grpc-1.34.1/src/core/lib/iomgr/executor/ |
| H A D | mpmcqueue.cc | 105 int curr_count = count_.Load(MemoryOrder::RELAXED); in Put() local
107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()
109 Node* new_chunk = AllocateNodes(curr_count); in Put()
118 new_chunk[curr_count - 1].next = queue_head_; in Put()
120 queue_head_->prev = &new_chunk[curr_count - 1]; in Put()
131 if (curr_count == 0) { in Put()
137 count_.Store(curr_count + 1, MemoryOrder::RELAXED); in Put()
|
| /dports/devel/pecl-grpc/grpc-1.42.0/src/core/lib/iomgr/executor/ |
| H A D | mpmcqueue.cc | 105 int curr_count = count_.load(std::memory_order_relaxed); in Put() local
107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()
109 Node* new_chunk = AllocateNodes(curr_count); in Put()
117 new_chunk[curr_count - 1].next = queue_head_; in Put()
119 queue_head_->prev = &new_chunk[curr_count - 1]; in Put()
130 if (curr_count == 0) { in Put()
136 count_.store(curr_count + 1, std::memory_order_relaxed); in Put()
|
| /dports/devel/py-grpcio/grpcio-1.43.0/src/core/lib/iomgr/executor/ |
| H A D | mpmcqueue.cc | 105 int curr_count = count_.load(std::memory_order_relaxed); in Put() local
107 if (queue_tail_ == queue_head_ && curr_count != 0) { in Put()
109 Node* new_chunk = AllocateNodes(curr_count); in Put()
117 new_chunk[curr_count - 1].next = queue_head_; in Put()
119 queue_head_->prev = &new_chunk[curr_count - 1]; in Put()
130 if (curr_count == 0) { in Put()
136 count_.store(curr_count + 1, std::memory_order_relaxed); in Put()
|
| /dports/net/mpich/mpich-3.4.3/src/mpi/coll/iscatter/ |
| H A D | iscatter_intra_sched_binomial.c | 11 MPI_Aint curr_count; member
19 MPIR_Get_count_impl(&ss->status, MPI_BYTE, &ss->curr_count); in get_count()
27 ss->send_subtree_count = ss->curr_count - ss->sendcount * mask; in calc_send_count_root()
35 ss->send_subtree_count = ss->curr_count - ss->nbytes * mask; in calc_send_count_non_root()
42 ss->curr_count -= ss->send_subtree_count; in calc_curr_count()
106 ss->curr_count = 0; in MPIR_Iscatter_intra_sched_binomial()
144 ss->curr_count = ss->nbytes * comm_size; in MPIR_Iscatter_intra_sched_binomial()
146 ss->curr_count = sendcount * comm_size; in MPIR_Iscatter_intra_sched_binomial()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Minkowski_sum_2/ |
| H A D | Union_of_cycles_2.h | 132 int curr_count; in _construct_arrangement() local
137 curr_count = f_curr->data(); in _construct_arrangement()
150 next_count = curr_count + _boundary_count (he->twin()); in _construct_arrangement()
157 curr_count + _boundary_count (he->twin())); in _construct_arrangement()
176 next_count = curr_count + _boundary_count (he->twin()); in _construct_arrangement()
183 curr_count + _boundary_count (he->twin())); in _construct_arrangement()
|
| /dports/science/libint/libint-release-1-2-1-15-gb349524/src/bin/libint/ |
| H A D | emit_hrr_build.c | 56 int curr_count,curr_subfunction; in emit_hrr_build() local
130 curr_count = 0; in emit_hrr_build()
193 curr_count++; in emit_hrr_build()
194 if (split == 1 && curr_count == subbatch_length) { in emit_hrr_build()
195 curr_count = 0; in emit_hrr_build()
276 curr_count = 0; in emit_hrr_build()
349 curr_count++; in emit_hrr_build()
350 if (split == 1 && curr_count == subbatch_length) { in emit_hrr_build()
351 curr_count = 0; in emit_hrr_build()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/geometry/index/example/ |
| H A D | benchmark2.cpp | 42 for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step ) in main() local
46 for (; val_i < curr_count ; ++val_i ) in main()
|