Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • libcfa/src/concurrency/future.hfa

    rdb19e1d rbf55f32  
    8888                if ( s.clause_status == 0p ) // poke in result so that woken threads do not need to reacquire any locks
    8989                    copy_T( result, *(((future_node(T) &)s).my_result) );
    90 
     90               
    9191                wake_one( waiters, s );
    9292            }
     
    146146            }
    147147            unlock( lock );
    148 
     148           
    149149            return [ret_val, false];
    150150        }
     
    154154
    155155            // check if we can complete operation. If so race to establish winner in special OR case
    156             if ( !s.park_counter && state != FUTURE_EMPTY ) {
     156            if ( !s.park_counter && state != FUTURE_EMPTY ) { 
    157157                if ( !__make_select_node_available( s ) ) { // we didn't win the race so give up on registering
    158158                    unlock( lock );
     
    180180            return false;
    181181        }
    182 
     182               
    183183        bool on_selected( future(T) & this, select_node & node ) { return true; }
    184184        }
Note: See TracChangeset for help on using the changeset viewer.