Line data    Source code

       1             : #include "fd_pack_rebate_sum.h"
       2             : #include "fd_pack.h"
       3             : #include "../../util/fd_hash32.h"
       4             : #if FD_HAS_AVX
       5             : #include "../../util/simd/fd_avx.h"
       6             : #endif
       7             : 
       8             : static const fd_acct_addr_t null_addr = { 0 };
       9             : 
      10             : #define MAP_NAME        rmap
      11           0 : #define MAP_T           fd_pack_rebate_entry_t
      12           0 : #define MAP_LG_SLOT_CNT 13
      13           0 : #define MAP_KEY_T       fd_acct_addr_t
      14           0 : #define MAP_KEY_NULL    null_addr
      15             : #if FD_HAS_AVX
      16           0 : # define MAP_KEY_INVAL(k)      _mm256_testz_si256( wb_ldu( (k).b ), wb_ldu( (k).b ) )
      17             : #else
      18             : # define MAP_KEY_INVAL(k)      MAP_KEY_EQUAL(k, null_addr)
      19             : #endif
      20           0 : #define MAP_KEY_EQUAL(k0,k1)   (!memcmp((k0).b,(k1).b, FD_TXN_ACCT_ADDR_SZ))
      21             : #define MAP_KEY_EQUAL_IS_SLOW  1
      22             : #define MAP_MEMOIZE            0
      23           0 : #define MAP_KEY_HASH(key,seed) ((uint)fd_hash32( (key).b, (seed) ))
      24           0 : #define MAP_MOVE(d,s)          (__extension__({ FD_LOG_CRIT(( "Tried to move a map value" )); (d)=(s); }))
      25             : 
      26             : #include "../../util/tmpl/fd_map_dynamic.c"
      27             : 
      28             : FD_STATIC_ASSERT( (1UL<<MAP_LG_SLOT_CNT)==8192UL, map_slot_cnt );
      29             : 
      30             : void *
      31             : fd_pack_rebate_sum_new( void * mem,
      32           0 :                         ulong  seed ) {
      33           0 :   fd_pack_rebate_sum_t * s = (fd_pack_rebate_sum_t *)mem;
      34             : 
      35           0 :   s->total_cost_rebate        = 0UL;
      36           0 :   s->vote_cost_rebate         = 0UL;
      37           0 :   s->data_bytes_rebate        = 0UL;
      38           0 :   s->microblock_cnt_rebate    = 0UL;
      39           0 :   s->alloc_rebate             = 0UL;
      40           0 :   s->ib_result                = 0;
      41           0 :   s->writer_cnt               = 0U;
      42             : 
      43           0 :   s->map = rmap_join( rmap_new( s->map_mem, MAP_LG_SLOT_CNT, seed ) );
      44           0 :   FD_TEST( s->map );
      45             : 
      46             :   /* Not a good place to put this, but there's not really a better place
      47             :      for it either.  The compiler should eliminate it. */
      48           0 :   FD_TEST( rmap_align()==FD_PACK_REBATE_SUM_MAP_ALIGN );
      49           0 :   FD_TEST( rmap_footprint( MAP_LG_SLOT_CNT )==FD_PACK_REBATE_SUM_MAP_FOOTPRINT );
      50           0 :   return mem;
      51           0 : }
      52             : 
      53             : 
      54           0 : #define HEADROOM (FD_PACK_REBATE_SUM_CAPACITY-FD_PACK_REBATE_MAX_ENTRIES)
      55             : 
      56             : ulong
      57             : fd_pack_rebate_sum_add_txn( fd_pack_rebate_sum_t         * s,
      58             :                             fd_txn_p_t     const         * txns,
      59             :                             fd_acct_addr_t const * const * adtl_writable,
      60           0 :                             ulong                          txn_cnt ) {
      61             :   /* See end of function for this equation */
      62           0 :   if( FD_UNLIKELY( txn_cnt==0UL ) ) return (ulong)((fd_int_max( 0, (int)s->writer_cnt - (int)HEADROOM ) + (int)FD_PACK_REBATE_MAX_ENTRIES-1) / (int)FD_PACK_REBATE_MAX_ENTRIES);
      63             : 
      64           0 :   int is_initializer_bundle = 1;
      65           0 :   int ib_success            = 1;
      66           0 :   int any_in_block          = 0;
      67             : 
      68           0 :   for( ulong i=0UL; i<txn_cnt; i++ ) {
      69           0 :     fd_txn_p_t const * txn = txns+i;
      70           0 :     ulong rebated_cus   = txn->execle_cu.rebated_cus;
      71           0 :     int   in_block      = !!(txn->flags & FD_TXN_P_FLAGS_EXECUTE_SUCCESS);
      72             : 
      73             :     /* For IB purposes, treat AlreadyProcessed (7) as success.  If one
      74             :        transaction is an initializer bundle, they all must be, so it's
      75             :        unclear if the first line should be an |= or an &=, but &= seems
      76             :        more right. */
      77           0 :     is_initializer_bundle &= !!(txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
      78           0 :     ib_success            &= in_block | ((txn->flags&FD_TXN_P_FLAGS_RESULT_MASK)==(7U<<24));
      79           0 :     any_in_block          |= in_block;
      80             : 
      81           0 :     s->total_cost_rebate += rebated_cus;
      82           0 :     s->vote_cost_rebate  += fd_ulong_if( txn->flags & FD_TXN_P_FLAGS_IS_SIMPLE_VOTE, rebated_cus,     0UL );
      83           0 :     s->data_bytes_rebate += fd_ulong_if( !in_block,                                  txn->payload_sz, 0UL );
      84           0 :     s->alloc_rebate      += fd_ulong_if( !in_block,                                  txn->pack_alloc, 0UL );
      85             : 
      86           0 :     if( FD_UNLIKELY( rebated_cus==0UL ) ) continue;
      87             : 
      88           0 :     fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( TXN(txn), txn->payload );
      89           0 :     for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( TXN(txn), FD_TXN_ACCT_CAT_WRITABLE & FD_TXN_ACCT_CAT_IMM );
      90           0 :         iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
      91             : 
      92           0 :       ulong j=fd_txn_acct_iter_idx( iter );
      93             : 
      94           0 :       fd_pack_rebate_entry_t * in_table = rmap_query( s->map, accts[j], NULL );
      95           0 :       if( FD_UNLIKELY( !in_table ) ) {
      96           0 :         in_table = rmap_insert( s->map, accts[j] );
      97           0 :         in_table->rebate_cus = 0UL;
      98           0 :         s->inserted[ s->writer_cnt++ ] = in_table;
      99           0 :       }
     100           0 :       in_table->rebate_cus += rebated_cus;
     101           0 :     }
     102             :     /* ALT accounts are pre-resolved by resolv_tile and passed via
     103             :        fd_txn_e_t, so we always rebate even if bank sanitization
     104             :        failed (e.g. due to LUT deactivation).  If adtl_writable[i] is
     105             :        NULL, we do not rebate ALT accounts. */
     106           0 :     accts = adtl_writable[i];
     107           0 :     if( FD_LIKELY( accts ) ) {
     108           0 :       for( ulong j=0UL; j<(ulong)TXN(txn)->addr_table_adtl_writable_cnt; j++ ) {
     109           0 :         fd_pack_rebate_entry_t * in_table = rmap_query( s->map, accts[j], NULL );
     110           0 :         if( FD_UNLIKELY( !in_table ) ) {
     111           0 :           in_table = rmap_insert( s->map, accts[j] );
     112           0 :           in_table->rebate_cus = 0UL;
     113           0 :           s->inserted[ s->writer_cnt++ ] = in_table;
     114           0 :         }
     115           0 :         in_table->rebate_cus += rebated_cus;
     116           0 :       }
     117           0 :     }
     118           0 :     FD_TEST( s->writer_cnt<=FD_PACK_REBATE_SUM_CAPACITY );
     119           0 :   }
     120             : 
     121           0 :   int is_bundle = txns->flags & FD_TXN_P_FLAGS_BUNDLE; /* can't mix bundle and non-bundle */
     122           0 :   ulong microblock_cnt_rebate = fd_ulong_if( any_in_block, 0UL, fd_ulong_if( is_bundle, txn_cnt, 1UL ) );
     123           0 :   s->microblock_cnt_rebate += microblock_cnt_rebate;
     124           0 :   s->data_bytes_rebate     += microblock_cnt_rebate*48UL; /* microblock headers */
     125             : 
     126           0 :   if( FD_UNLIKELY( is_initializer_bundle & (s->ib_result!=-1) ) ) { /* if in -1 state, stay. Shouldn't be possible */
     127           0 :     s->ib_result = fd_int_if( ib_success, 1, -1 );
     128           0 :   }
     129             : 
     130             :   /* We want to make sure that we have enough capacity to insert
     131             :      FD_PACK_REBATE_MAX_ENTRIES addresses without hitting
     132             :      FD_PACK_REBATE_SUM_CAPACITY.  Thus, if x is the current value of
     133             :      writer_cnt, we need to call report at least y times to ensure
     134             :                         x-y*FD_PACK_REBATE_MAX_ENTRIES <= HEADROOM
     135             :                                y >= (x-HEADROOM)/FD_PACK_REBATE_MAX_ENTRIES
     136             :      but y is an integer, so
     137             :      y >= ceiling( (x-HEADROOM)/FD_PACK_REBATE_MAX_ENTRIES ) */
     138           0 :   return (ulong)((fd_int_max( 0, (int)s->writer_cnt - (int)HEADROOM ) + (int)FD_PACK_REBATE_MAX_ENTRIES-1) / (int)FD_PACK_REBATE_MAX_ENTRIES);
     139           0 : }
     140             : 
     141             : 
     142             : ulong
     143             : fd_pack_rebate_sum_report( fd_pack_rebate_sum_t * s,
     144           0 :                            fd_pack_rebate_t     * out ) {
     145           0 :   if( FD_UNLIKELY( (s->ib_result==0) & (s->total_cost_rebate==0UL) & (s->writer_cnt==0U) ) ) return 0UL;
     146           0 :   out->total_cost_rebate       = s->total_cost_rebate;          s->total_cost_rebate       = 0UL;
     147           0 :   out->vote_cost_rebate        = s->vote_cost_rebate;           s->vote_cost_rebate        = 0UL;
     148           0 :   out->data_bytes_rebate       = s->data_bytes_rebate;          s->data_bytes_rebate       = 0UL;
     149           0 :   out->microblock_cnt_rebate   = s->microblock_cnt_rebate;      s->microblock_cnt_rebate   = 0UL;
     150           0 :   out->alloc_rebate            = s->alloc_rebate;               s->alloc_rebate            = 0UL;
     151           0 :   out->ib_result               = s->ib_result;                  s->ib_result               = 0;
     152             : 
     153           0 :   out->writer_cnt = 0U;
     154           0 :   ulong writer_cnt = fd_ulong_min( s->writer_cnt, FD_PACK_REBATE_MAX_ENTRIES );
     155           0 :   for( ulong i=0UL; i<writer_cnt; i++ ) {
     156           0 :     fd_pack_rebate_entry_t * e = s->inserted[ --(s->writer_cnt) ];
     157           0 :     out->writer_rebates[ out->writer_cnt++ ] = *e;
     158           0 :     rmap_remove( s->map, e );
     159           0 :   }
     160             : 
     161           0 :   return sizeof(*out)-sizeof(fd_pack_rebate_entry_t)+(out->writer_cnt)*sizeof(fd_pack_rebate_entry_t);
     162           0 : }
     163             : 
     164             : void
     165           0 : fd_pack_rebate_sum_clear( fd_pack_rebate_sum_t * s ) {
     166           0 :   s->total_cost_rebate       = 0UL;
     167           0 :   s->vote_cost_rebate        = 0UL;
     168           0 :   s->data_bytes_rebate       = 0UL;
     169           0 :   s->microblock_cnt_rebate   = 0UL;
     170           0 :   s->alloc_rebate            = 0UL;
     171           0 :   s->ib_result               = 0;
     172             : 
     173           0 :   ulong writer_cnt = s->writer_cnt;
     174           0 :   for( ulong i=0UL; i<writer_cnt; i++ ) {
     175           0 :     fd_pack_rebate_entry_t * e = s->inserted[ --(s->writer_cnt) ];
     176           0 :     rmap_remove( s->map, e );
     177           0 :   }
     178           0 : }