Line data    Source code

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