| /dports/emulators/mednafen/mednafen/src/gb/ |
| H A D | gfx.cpp | 139 uint8 tile_b = 0; in DrawBG() local
147 tile_b = bank1[tile_pattern_address]; in DrawBG()
150 tile_b = bank0[tile_pattern_address]; in DrawBG()
155 tile_b = gbInvertTab[tile_b]; in DrawBG()
160 c += ((tile_b & bx) ? 2 : 0); in DrawBG()
267 uint8 tile_b = 0; in DrawBG() local
275 tile_b = bank1[tile_pattern_address]; in DrawBG()
278 tile_b = bank0[tile_pattern_address]; in DrawBG()
283 tile_b = gbInvertTab[tile_b]; in DrawBG()
288 c += ((tile_b & bx) != 0 ? 2 : 0); in DrawBG()
|
| /dports/emulators/vba/VisualBoyAdvance-1.7.2/src/gb/ |
| H A D | gbGfx.cpp | 127 u8 tile_b = 0; in gbRenderLine() local
135 tile_b = bank1[tile_pattern_address]; in gbRenderLine()
138 tile_b = bank0[tile_pattern_address]; in gbRenderLine()
143 tile_b = gbInvertTab[tile_b]; in gbRenderLine()
148 c += ((tile_b & bx) ? 2 : 0); in gbRenderLine()
252 u8 tile_b = 0; in gbRenderLine() local
260 tile_b = bank1[tile_pattern_address]; in gbRenderLine()
263 tile_b = bank0[tile_pattern_address]; in gbRenderLine()
268 tile_b = gbInvertTab[tile_b]; in gbRenderLine()
273 c += ((tile_b & bx) != 0 ? 2 : 0); in gbRenderLine()
|
| /dports/emulators/visualboyadvance-m/visualboyadvance-m-VBA-M_Beta_2/src/gb/ |
| H A D | gbGfx.cpp | 114 u8 tile_b = 0; in gbRenderLine() local
122 tile_b = bank1[tile_pattern_address]; in gbRenderLine()
125 tile_b = bank0[tile_pattern_address]; in gbRenderLine()
130 tile_b = gbInvertTab[tile_b]; in gbRenderLine()
135 c += ((tile_b & bx) ? 2 : 0); in gbRenderLine()
312 u8 tile_b = 0; in gbRenderLine() local
320 tile_b = bank1[tile_pattern_address]; in gbRenderLine()
323 tile_b = bank0[tile_pattern_address]; in gbRenderLine()
328 tile_b = gbInvertTab[tile_b]; in gbRenderLine()
333 c += ((tile_b & bx) != 0 ? 2 : 0); in gbRenderLine()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/compute/algorithm/ |
| H A D | includes.hpp | 126 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
132 tile_a.begin()+1, tile_b.begin()+1); in includes()
134 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
138 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
145 tile_b.begin(), result.begin()); in includes()
|
| H A D | set_intersection.hpp | 129 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
135 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
137 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
141 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
151 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| H A D | set_difference.hpp | 141 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
147 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
149 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
153 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
163 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| H A D | set_symmetric_difference.hpp | 152 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_symmetric_difference() local
158 tile_a.begin()+1, tile_b.begin()+1); in set_symmetric_difference()
160 fill_n(tile_b.begin(), 1, 0, queue); in set_symmetric_difference()
164 fill_n(tile_b.end()-1, 1, count2, queue); in set_symmetric_difference()
174 tile_a.end(), tile_b.begin(), in set_symmetric_difference()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| H A D | set_difference.hpp | 150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
156 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
158 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
162 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| H A D | set_intersection.hpp | 138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
144 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
146 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
150 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| H A D | set_difference.hpp | 150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
156 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
158 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
162 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| H A D | set_intersection.hpp | 138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
144 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
146 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
150 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in generate_n()
139 tile_a.begin()+1, tile_b.begin()+1); in generate_n()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in generate_n()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in generate_n()
152 tile_b.begin(), result.begin()); in generate_n()
|
| H A D | set_intersection.hpp | 138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
144 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
146 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
150 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| H A D | set_difference.hpp | 150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
156 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
158 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
162 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| H A D | set_intersection.hpp | 138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
144 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
146 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
150 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| H A D | set_difference.hpp | 150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
156 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
158 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
162 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| H A D | set_difference.hpp | 150 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_difference() local
156 tile_a.begin()+1, tile_b.begin()+1); in set_difference()
158 fill_n(tile_b.begin(), 1, 0, queue); in set_difference()
162 fill_n(tile_b.end()-1, 1, count2, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
|
| H A D | set_intersection.hpp | 138 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in set_intersection() local
144 tile_a.begin()+1, tile_b.begin()+1); in set_intersection()
146 fill_n(tile_b.begin(), 1, 0, queue); in set_intersection()
150 fill_n(tile_b.end()-1, 1, count2, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/compute/algorithm/ |
| H A D | includes.hpp | 133 vector<uint_> tile_b((count1+count2+tile_size-1)/tile_size+1, queue.get_context()); in includes() local
139 tile_a.begin()+1, tile_b.begin()+1); in includes()
141 fill_n(tile_b.begin(), 1, uint_(0), queue); in includes()
145 fill_n(tile_b.end()-1, 1, static_cast<uint_>(count2), queue); in includes()
152 tile_b.begin(), result.begin()); in includes()
|