1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395
|
/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2016, Hewlett Packard Enterprise Development LP
Copyright (C) 2018 - 2019, Advanced Micro Devices, Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name(s) of the copyright holder(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef BLIS_RNTM_H
#define BLIS_RNTM_H
// Runtime object type (defined in bli_type_defs.h)
/*
typedef struct rntm_s
{
bool auto_factor;
dim_t num_threads;
dim_t* thrloop;
bool pack_a;
bool pack_b;
bool l3_sup;
pool_t* sba_pool;
pba_t* pba;
} rntm_t;
*/
//
// -- rntm_t query (public API) ------------------------------------------------
//
BLIS_INLINE bool bli_rntm_auto_factor( rntm_t* rntm )
{
return rntm->auto_factor;
}
BLIS_INLINE dim_t bli_rntm_num_threads( rntm_t* rntm )
{
return rntm->num_threads;
}
BLIS_INLINE dim_t bli_rntm_ways_for( bszid_t bszid, rntm_t* rntm )
{
return rntm->thrloop[ bszid ];
}
BLIS_INLINE dim_t bli_rntm_jc_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_NC, rntm );
}
BLIS_INLINE dim_t bli_rntm_pc_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_KC, rntm );
}
BLIS_INLINE dim_t bli_rntm_ic_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_MC, rntm );
}
BLIS_INLINE dim_t bli_rntm_jr_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_NR, rntm );
}
BLIS_INLINE dim_t bli_rntm_ir_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_MR, rntm );
}
BLIS_INLINE dim_t bli_rntm_pr_ways( rntm_t* rntm )
{
return bli_rntm_ways_for( BLIS_KR, rntm );
}
BLIS_INLINE bool bli_rntm_pack_a( rntm_t* rntm )
{
return ( bool )( rntm->pack_a );
}
BLIS_INLINE bool bli_rntm_pack_b( rntm_t* rntm )
{
return ( bool )( rntm->pack_b );
}
BLIS_INLINE bool bli_rntm_l3_sup( rntm_t* rntm )
{
return rntm->l3_sup;
}
//
// -- rntm_t query (internal use only) -----------------------------------------
//
BLIS_INLINE pool_t* bli_rntm_sba_pool( rntm_t* rntm )
{
return rntm->sba_pool;
}
BLIS_INLINE pba_t* bli_rntm_pba( rntm_t* rntm )
{
return rntm->pba;
}
#if 0
BLIS_INLINE dim_t bli_rntm_equals( rntm_t* rntm1, rntm_t* rntm2 )
{
const bool nt = bli_rntm_num_threads( rntm1 ) == bli_rntm_num_threads( rntm2 );
const bool jc = bli_rntm_jc_ways( rntm1 ) == bli_rntm_jc_ways( rntm2 );
const bool pc = bli_rntm_pc_ways( rntm1 ) == bli_rntm_pc_ways( rntm2 );
const bool ic = bli_rntm_ic_ways( rntm1 ) == bli_rntm_ic_ways( rntm2 );
const bool jr = bli_rntm_jr_ways( rntm1 ) == bli_rntm_jr_ways( rntm2 );
const bool ir = bli_rntm_ir_ways( rntm1 ) == bli_rntm_ir_ways( rntm2 );
const bool pr = bli_rntm_pr_ways( rntm1 ) == bli_rntm_pr_ways( rntm2 );
if ( nt && jc && pc && ic && jr && ir && pr ) return TRUE;
else return FALSE;
}
#endif
//
// -- rntm_t modification (internal use only) ----------------------------------
//
BLIS_INLINE void bli_rntm_set_auto_factor_only( bool auto_factor, rntm_t* rntm )
{
rntm->auto_factor = auto_factor;
}
BLIS_INLINE void bli_rntm_set_num_threads_only( dim_t nt, rntm_t* rntm )
{
rntm->num_threads = nt;
}
BLIS_INLINE void bli_rntm_set_ways_for_only( bszid_t loop, dim_t n_ways, rntm_t* rntm )
{
rntm->thrloop[ loop ] = n_ways;
}
BLIS_INLINE void bli_rntm_set_jc_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_NC, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_pc_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_KC, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_ic_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_MC, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_jr_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_NR, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_ir_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_MR, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_pr_ways_only( dim_t ways, rntm_t* rntm )
{
bli_rntm_set_ways_for_only( BLIS_KR, ways, rntm );
}
BLIS_INLINE void bli_rntm_set_ways_only( dim_t jc, dim_t pc, dim_t ic, dim_t jr, dim_t ir, rntm_t* rntm )
{
// Record the number of ways of parallelism per loop.
bli_rntm_set_jc_ways_only( jc, rntm );
bli_rntm_set_pc_ways_only( pc, rntm );
bli_rntm_set_ic_ways_only( ic, rntm );
bli_rntm_set_jr_ways_only( jr, rntm );
bli_rntm_set_ir_ways_only( ir, rntm );
bli_rntm_set_pr_ways_only( 1, rntm );
}
BLIS_INLINE void bli_rntm_set_sba_pool( pool_t* sba_pool, rntm_t* rntm )
{
rntm->sba_pool = sba_pool;
}
BLIS_INLINE void bli_rntm_set_pba( pba_t* pba, rntm_t* rntm )
{
rntm->pba = pba;
}
BLIS_INLINE void bli_rntm_clear_num_threads_only( rntm_t* rntm )
{
bli_rntm_set_num_threads_only( -1, rntm );
}
BLIS_INLINE void bli_rntm_clear_ways_only( rntm_t* rntm )
{
bli_rntm_set_ways_only( -1, -1, -1, -1, -1, rntm );
}
BLIS_INLINE void bli_rntm_clear_sba_pool( rntm_t* rntm )
{
bli_rntm_set_sba_pool( NULL, rntm );
}
BLIS_INLINE void bli_rntm_clear_pba( rntm_t* rntm )
{
bli_rntm_set_pba( NULL, rntm );
}
//
// -- rntm_t modification (public API) -----------------------------------------
//
BLIS_INLINE void bli_rntm_set_num_threads( dim_t nt, rntm_t* rntm )
{
// Record the total number of threads to use.
bli_rntm_set_num_threads_only( nt, rntm );
// Set the individual ways of parallelism to default states.
bli_rntm_clear_ways_only( rntm );
}
BLIS_INLINE void bli_rntm_set_ways( dim_t jc, dim_t pc, dim_t ic, dim_t jr, dim_t ir, rntm_t* rntm )
{
// Record the number of ways of parallelism per loop.
bli_rntm_set_jc_ways_only( jc, rntm );
bli_rntm_set_pc_ways_only( pc, rntm );
bli_rntm_set_ic_ways_only( ic, rntm );
bli_rntm_set_jr_ways_only( jr, rntm );
bli_rntm_set_ir_ways_only( ir, rntm );
bli_rntm_set_pr_ways_only( 1, rntm );
// Set the num_threads field to a default state.
bli_rntm_clear_num_threads_only( rntm );
}
BLIS_INLINE void bli_rntm_set_pack_a( bool pack_a, rntm_t* rntm )
{
// Set the bool indicating whether matrix A should be packed.
rntm->pack_a = pack_a;
}
BLIS_INLINE void bli_rntm_set_pack_b( bool pack_b, rntm_t* rntm )
{
// Set the bool indicating whether matrix B should be packed.
rntm->pack_b = pack_b;
}
BLIS_INLINE void bli_rntm_set_l3_sup( bool l3_sup, rntm_t* rntm )
{
// Set the bool indicating whether level-3 sup handling is enabled.
rntm->l3_sup = l3_sup;
}
BLIS_INLINE void bli_rntm_enable_l3_sup( rntm_t* rntm )
{
bli_rntm_set_l3_sup( TRUE, rntm );
}
BLIS_INLINE void bli_rntm_disable_l3_sup( rntm_t* rntm )
{
bli_rntm_set_l3_sup( FALSE, rntm );
}
//
// -- rntm_t modification (internal use only) ----------------------------------
//
BLIS_INLINE void bli_rntm_clear_pack_a( rntm_t* rntm )
{
bli_rntm_set_pack_a( FALSE, rntm );
}
BLIS_INLINE void bli_rntm_clear_pack_b( rntm_t* rntm )
{
bli_rntm_set_pack_b( FALSE, rntm );
}
BLIS_INLINE void bli_rntm_clear_l3_sup( rntm_t* rntm )
{
bli_rntm_set_l3_sup( TRUE, rntm );
}
//
// -- rntm_t initialization ----------------------------------------------------
//
// NOTE: Initialization is not necessary as long the user calls at least ONE
// of the public "set" accessors, each of which guarantees that the rntm_t
// will be in a good state upon return.
#define BLIS_RNTM_INITIALIZER \
{ \
.auto_factor = TRUE, \
.num_threads = -1, \
.thrloop = { -1, -1, -1, -1, -1, -1 }, \
.pack_a = FALSE, \
.pack_b = FALSE, \
.l3_sup = TRUE, \
.sba_pool = NULL, \
.pba = NULL, \
} \
BLIS_INLINE void bli_rntm_init( rntm_t* rntm )
{
bli_rntm_set_auto_factor_only( TRUE, rntm );
bli_rntm_clear_num_threads_only( rntm );
bli_rntm_clear_ways_only( rntm );
bli_rntm_clear_pack_a( rntm );
bli_rntm_clear_pack_b( rntm );
bli_rntm_clear_l3_sup( rntm );
bli_rntm_clear_sba_pool( rntm );
bli_rntm_clear_pba( rntm );
}
// -- rntm_t total thread calculation ------------------------------------------
BLIS_INLINE dim_t bli_rntm_calc_num_threads
(
rntm_t* restrict rntm
)
{
dim_t n_threads;
n_threads = bli_rntm_ways_for( BLIS_NC, rntm );
n_threads *= bli_rntm_ways_for( BLIS_KC, rntm );
n_threads *= bli_rntm_ways_for( BLIS_MC, rntm );
n_threads *= bli_rntm_ways_for( BLIS_NR, rntm );
n_threads *= bli_rntm_ways_for( BLIS_MR, rntm );
return n_threads;
}
// -----------------------------------------------------------------------------
// Function prototypes
BLIS_EXPORT_BLIS void bli_rntm_init_from_global( rntm_t* rntm );
BLIS_EXPORT_BLIS void bli_rntm_set_ways_for_op
(
opid_t l3_op,
side_t side,
dim_t m,
dim_t n,
dim_t k,
rntm_t* rntm
);
void bli_rntm_set_ways_from_rntm
(
dim_t m,
dim_t n,
dim_t k,
rntm_t* rntm
);
void bli_rntm_set_ways_from_rntm_sup
(
dim_t m,
dim_t n,
dim_t k,
rntm_t* rntm
);
void bli_rntm_print
(
rntm_t* rntm
);
dim_t bli_rntm_calc_num_threads_in
(
bszid_t* restrict bszid_cur,
rntm_t* restrict rntm
);
#endif
|