61   inline MaxPoolMicrokernelTester& pooling_elements(size_t pooling_elements) {  in pooling_elements()  argument
62     assert(pooling_elements != 0);  in pooling_elements()
63     this->pooling_elements_ = pooling_elements;  in pooling_elements()
67   inline size_t pooling_elements() const {  in pooling_elements()  function
72     if (pooling_elements() <= primary_pooling_tile()) {  in packed_pooling_elements()
75 …return (pooling_elements() - primary_pooling_tile()) % incremental_pooling_tile() == 0 ? pooling_e…  in packed_pooling_elements()
177       for (size_t i = 0; i < (output_pixels() - 1) * step() + pooling_elements(); i++) {  in Test()
181         indirect_input.begin() + (output_pixels() - 1) * step() + pooling_elements(), rng);  in Test()
191           for (size_t p = 0; p < pooling_elements(); p++) {  in Test()
201       maxpool(output_pixels(), pooling_elements(), channels(),  in Test()
212             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
216             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
220             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
244       for (size_t i = 0; i < (output_pixels() - 1) * step() + pooling_elements(); i++) {  in Test()
248         indirect_input.begin() + (output_pixels() - 1) * step() + pooling_elements(), rng);  in Test()
258           for (size_t p = 0; p < pooling_elements(); p++) {  in Test()
268       maxpool(output_pixels(), pooling_elements(), channels(),  in Test()
279             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
283             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
287             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
302       ((output_pixels() - 1) * step() + pooling_elements()) * channels());  in Test()
310       for (size_t i = 0; i < (output_pixels() - 1) * step() + pooling_elements(); i++) {  in Test()
314         indirect_input.begin() + (output_pixels() - 1) * step() + pooling_elements(), rng);  in Test()
320           for (size_t p = 0; p < pooling_elements(); p++) {  in Test()
352       maxpool(output_pixels(), pooling_elements(), channels(),  in Test()
363             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
367             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
371             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
385       ((output_pixels() - 1) * step() + pooling_elements()) * channels());  in Test()
393       for (size_t i = 0; i < (output_pixels() - 1) * step() + pooling_elements(); i++) {  in Test()
397         indirect_input.begin() + (output_pixels() - 1) * step() + pooling_elements(), rng);  in Test()
403           for (size_t p = 0; p < pooling_elements(); p++) {  in Test()
428       maxpool(output_pixels(), pooling_elements(), channels(),  in Test()
439             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
443             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()
447             << ", pooling elements = " << pooling_elements() << ", step = " << step()  in Test()