/dports/devel/boost-docs/boost_1_72_0/libs/sort/test/ |
H A D | float_sort_test.cpp | 45 static const unsigned input_count = 1000000; variable 73 for (unsigned u = 0; u < input_count; ++u) { in float_test() 89 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in float_test() 92 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in float_test() 95 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 98 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 99 for (size_t i = 0; i < input_count; i += 2) base_vec[i] *= -1; in float_test() 105 for (unsigned u = 0; u < input_count; ++u) { in double_test() 122 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in double_test() 125 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in double_test() [all …]
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/sort/test/ |
H A D | float_sort_test.cpp | 45 static const unsigned input_count = 1000000; variable 73 for (unsigned u = 0; u < input_count; ++u) { in float_test() 89 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in float_test() 92 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in float_test() 95 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 98 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 99 for (size_t i = 0; i < input_count; i += 2) base_vec[i] *= -1; in float_test() 105 for (unsigned u = 0; u < input_count; ++u) { in double_test() 122 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in double_test() 125 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in double_test() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/sort/test/ |
H A D | float_sort_test.cpp | 45 static const unsigned input_count = 1000000; variable 73 for (unsigned u = 0; u < input_count; ++u) { in float_test() 89 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in float_test() 92 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in float_test() 95 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 98 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 99 for (size_t i = 0; i < input_count; i += 2) base_vec[i] *= -1; in float_test() 105 for (unsigned u = 0; u < input_count; ++u) { in double_test() 122 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in double_test() 125 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in double_test() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/libs/sort/test/ |
H A D | float_sort_test.cpp | 45 static const unsigned input_count = 1000000; variable 73 for (unsigned u = 0; u < input_count; ++u) { in float_test() 89 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in float_test() 92 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in float_test() 95 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 98 for (size_t i = 0; i < input_count; ++i) base_vec.push_back(i); in float_test() 99 for (size_t i = 0; i < input_count; i += 2) base_vec[i] *= -1; in float_test() 105 for (unsigned u = 0; u < input_count; ++u) { in double_test() 122 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(i - input_count); in double_test() 125 for (int i = 0; i < (int)input_count; ++i) base_vec.push_back(input_count - i); in double_test() [all …]
|
/dports/lang/v8/v8-9.6.180.12/src/compiler/ |
H A D | node.cc | 62 DCHECK_GE(input_count, 0); in NewImpl() 70 for (int i = 0; i < input_count; i++) { in NewImpl() 77 if (input_count > kMaxInlineCapacity) { in NewImpl() 80 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in NewImpl() 90 outline->count_ = input_count; in NewImpl() 98 int capacity = std::max(1, input_count); in NewImpl() 117 CHECK_IMPLIES(input_count > 0, in NewImpl() 137 int const input_count = node->InputCount(); in Clone() local 171 int const input_count = InputCount(); in AppendInput() local 192 *GetInputPtr(input_count) = new_to; in AppendInput() [all …]
|
H A D | common-operator.cc | 590 #define CACHED_END(input_count) \ argument 591 EndOperator<input_count> kEnd##input_count##Operator; 631 EffectPhiOperator<input_count> kEffectPhi##input_count##Operator; 657 #define CACHED_LOOP(input_count) \ argument 658 LoopOperator<input_count> kLoop##input_count##Operator; 671 MergeOperator<input_count> kMerge##input_count##Operator; 853 StateValuesOperator<input_count> kStateValues##input_count##Operator; 878 #define CACHED_END(input_count) \ in COMMON_CACHED_OP_LIST() argument 879 case input_count: \ in COMMON_CACHED_OP_LIST() 1068 #define CACHED_LOOP(input_count) \ in Loop() argument [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/ |
H A D | node.cc | 62 DCHECK_GE(input_count, 0); in NewImpl() 70 for (int i = 0; i < input_count; i++) { in NewImpl() 77 if (input_count > kMaxInlineCapacity) { in NewImpl() 80 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in NewImpl() 90 outline->count_ = input_count; in NewImpl() 98 int capacity = std::max(1, input_count); in NewImpl() 117 CHECK_IMPLIES(input_count > 0, in NewImpl() 137 int const input_count = node->InputCount(); in Clone() local 171 int const input_count = InputCount(); in AppendInput() local 192 *GetInputPtr(input_count) = new_to; in AppendInput() [all …]
|
/dports/science/minc2/minc-release-2.2.00/progs/mincreshape/ |
H A D | copy_data.c | 117 long *input_count); 125 long *input_count, 583 long *input_count) in truncate_input_vectors() argument 589 if (input_count == NULL) return; in truncate_input_vectors() 594 last = first + input_count[idim]; in truncate_input_vectors() 605 input_count[idim] = last - first; in truncate_input_vectors() 645 if (reshape_info->input_count[idim] > 0) in translate_output_to_input() 687 output_count[odim] = input_count[idim]; in translate_input_to_output() 689 if (reshape_info->input_count[idim] > 0) in translate_input_to_output() 757 total_size *= input_count[idim]; in copy_the_chunk() [all …]
|
/dports/comms/mgetty+sendfax/mgetty-1.1.37/voice/libvoice/ |
H A D | read.c | 14 static int input_count = 0; variable 91 if (input_pos >= input_count) in voice_read_byte() 93 input_count = read(voice_fd, input_buffer, sizeof(input_buffer)); in voice_read_byte() 95 if (input_count < 0) in voice_read_byte() 98 if (input_count == 0) in voice_read_byte() 110 if (input_pos < input_count) in voice_check_for_input() 113 input_count = read(voice_fd, input_buffer, sizeof(input_buffer)); in voice_check_for_input() 115 if (input_count <= 0) in voice_check_for_input()
|
/dports/lang/v8/v8-9.6.180.12/test/unittests/compiler/ |
H A D | value-numbering-reducer-unittest.cc | 85 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F() 86 const TestOperator op1(static_cast<Operator::Opcode>(input_count), in TEST_F() 87 Operator::kIdempotent, input_count, 1); in TEST_F() 88 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F() 92 const TestOperator op2(static_cast<Operator::Opcode>(input_count), in TEST_F() 93 Operator::kIdempotent, input_count, 1); in TEST_F() 94 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); in TEST_F() 110 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F() 111 const TestOperator op1(1, Operator::kIdempotent, input_count, 1); in TEST_F() 112 Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F() [all …]
|
H A D | dead-code-elimination-unittest.cc | 152 for (int i = 0; i < input_count; ++i) { in TEST_F() 156 graph()->NewNode(common()->End(input_count), input_count, inputs)); in TEST_F() 170 for (int i = 0; i < input_count; ++i) { in TEST_F() 174 graph()->NewNode(common()->Merge(input_count), input_count, inputs)); in TEST_F() 241 for (int i = 1; i < input_count; ++i) { in TEST_F() 245 graph()->NewNode(common()->Loop(input_count), input_count, inputs)); in TEST_F() 255 for (int i = 0; i < input_count; ++i) { in TEST_F() 259 graph()->NewNode(common()->Loop(input_count), input_count, inputs)); in TEST_F() 333 common()->Phi(rep, input_count), input_count + 1, inputs)); in TEST_F() 348 for (int i = 0; i < input_count; ++i) { in TEST_F() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/ |
H A D | node.cc | 56 DCHECK_GE(input_count, 0); in New() 64 for (int i = 0; i < input_count; i++) { in New() 71 if (input_count > kMaxInlineCapacity) { in New() 74 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in New() 83 outline->count_ = input_count; in New() 91 int capacity = std::max(1, input_count); in New() 109 CHECK_IMPLIES(input_count > 0, in New() 125 int const input_count = node->InputCount(); in Clone() local 159 int const input_count = InputCount(); in AppendInput() local 180 *GetInputPtr(input_count) = new_to; in AppendInput() [all …]
|
H A D | common-operator.cc | 643 #define CACHED_END(input_count) \ argument 644 EndOperator<input_count> kEnd##input_count##Operator; 685 EffectPhiOperator<input_count> kEffectPhi##input_count##Operator; 711 #define CACHED_LOOP(input_count) \ argument 712 LoopOperator<input_count> kLoop##input_count##Operator; 725 MergeOperator<input_count> kMerge##input_count##Operator; 885 StateValuesOperator<input_count> kStateValues##input_count##Operator; 910 #define CACHED_END(input_count) \ in COMMON_CACHED_OP_LIST() argument 911 case input_count: \ in COMMON_CACHED_OP_LIST() 1090 #define CACHED_LOOP(input_count) \ in Loop() argument [all …]
|
/dports/www/node10/node-v10.24.1/deps/v8/src/compiler/ |
H A D | node.cc | 61 for (int i = 0; i < input_count; i++) { in New() 69 if (input_count > kMaxInlineCapacity) { in New() 72 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in New() 81 outline->count_ = input_count; in New() 88 int capacity = input_count; in New() 91 capacity = std::min(input_count + 3, max); in New() 120 int const input_count = node->InputCount(); in Clone() local 153 int input_count = InputCount(); in AppendInput() local 165 if (input_count >= outline->capacity_) { in AppendInput() 174 *GetInputPtr(input_count) = new_to; in AppendInput() [all …]
|
/dports/www/node10/node-v10.24.1/deps/v8/src/compiler/ia32/ |
H A D | instruction-selector-ia32.cc | 287 size_t input_count = 0; in VisitLoad() local 319 size_t input_count = 0; in VisitStore() local 392 size_t input_count = 0; in VisitStore() local 424 size_t input_count = 0; in VisitBinop() local 559 size_t input_count = 0; in EmitLea() local 1069 size_t input_count = 0; in VisitCompareWithMemoryOperand() local 1555 size_t input_count = 0; in VisitWord32AtomicStore() local 1598 size_t input_count = 0; in VisitWord32AtomicExchange() local 1648 size_t input_count = 0; in VisitWord32AtomicCompareExchange() local 1695 size_t input_count = 0; in VisitWord32AtomicBinaryOperation() local [all …]
|
/dports/audio/jack/jack2-eaedec353489f26617221d66f80fd2503953c663/windows/winmme/ |
H A D | JackWinMMEDriver.cpp | 147 int input_count = 0; in Open() local 182 input_ports[input_count] = in Open() 190 input_count++; in Open() 215 jack_log("JackWinMMEDriver::Open - input_count %d", input_count); in Open() 218 if (! JackMidiDriver::Open(capturing, playing, input_count, in Open() 235 for (int i = 0; i < input_count; i++) { in Open() 280 int input_count = 0; in Start() local 285 for (; input_count < fCaptureChannels; input_count++) { in Start() 286 if (! input_ports[input_count]->Start()) { in Start() 314 for (int i = 0; i < input_count; i++) { in Start()
|
/dports/games/libretro-beetle_bsnes/beetle-bsnes-libretro-b65ded5bde278c18af538c687db9b72c995b220a/mednafen/sound/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/audio/libgme/game-music-emu-0.6.1/gme/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/games/zdoom/zdoom-2.8.1/game-music-emu/gme/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/emulators/mednafen/mednafen/src/sound/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/games/SRB2/SRB2-SRB2_release_2.2.9/libs/gme/gme/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/multimedia/audacious-plugins/audacious-plugins-4.1/src/console/ |
H A D | Fir_Resampler.cc | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/audio/zmusic/ZMusic-1.1.8/thirdparty/game-music-emu/gme/ |
H A D | Fir_Resampler.cpp | 143 blargg_long input_count = 0; in input_needed() local 149 input_count += step + (skip & 1) * stereo; in input_needed() 159 long input_extra = input_count - (write_pos - &buf [(width_ - 1) * stereo]); in input_needed() 165 int Fir_Resampler_::avail_( blargg_long input_count ) const in avail_() 167 int cycle_count = input_count / input_per_cycle; in avail_() 169 input_count -= cycle_count * input_per_cycle; in avail_() 173 while ( input_count >= 0 ) in avail_() 175 input_count -= step + (skip & 1) * stereo; in avail_()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/compiler/backend/arm/ |
H A D | instruction-selector-arm.cc | 267 size_t input_count = 0; in VisitBinop() local 286 input_count++; in VisitBinop() 292 input_count++; in VisitBinop() 389 size_t input_count = 2; in EmitLoad() local 399 input_count = 1; in EmitLoad() 414 input_count = 3; in EmitLoad() 436 input_count = 4; in EmitStore() 542 size_t input_count = 2; in VisitLoadTransform() local 731 input_count++; in VisitUnalignedLoad() 1833 input_count++; in VisitWordCompare() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/compiler/backend/arm/ |
H A D | instruction-selector-arm.cc | 267 size_t input_count = 0; in VisitBinop() local 286 input_count++; in VisitBinop() 292 input_count++; in VisitBinop() 389 size_t input_count = 2; in EmitLoad() local 400 input_count = 1; in EmitLoad() 415 input_count = 3; in EmitLoad() 437 input_count = 4; in EmitStore() 549 size_t input_count = 2; in VisitLoadTransform() local 743 input_count++; in VisitUnalignedLoad() 1855 input_count++; in VisitWordCompare() [all …]
|