/macosx-10.10/BerkeleyDB-21/db/test/ |
H A D | rep063.tcl | 171 # appropriate values when the winner is determined. 204 set winner 1 206 setpriority pri $nclients $winner 0 1 208 $qdir $m $elector $nsites $nvotes $nclients $winner 0 test.db 212 # client 2 to be the winner. The env handles of client 0 and 1 221 # Call this proc to make the winner have a larger LSN than the 222 # other 2 remaining clients, and reopen the winner as a client. 224 rep063_movelsn_reopen $method envlist $env_cmd($winner) $winner $largs 232 set winner [all...] |
H A D | rep020.tcl | 129 # Pick winner and elector randomly. 130 set winner [berkdb random_int 0 [expr $nclients - 1]] 131 setpriority pri $nclients $winner 134 $msg $elector $nsites $nvotes $nclients $winner 1 test.db 154 # Make sure we don't pick the closed client as the winner, 162 set winner [berkdb random_int 0 [expr $nclients - 1]] 163 setpriority pri $nclients $winner 166 $msg $elector $nsites $nvotes $nclients $winner 1 test.db 198 set winner 2 202 setpriority pri $nclients $winner [all...] |
H A D | rep016.tcl | 172 # appropriate values when the winner is determined. 197 set winner 0 198 setpriority pri $nclients $winner 200 $qdir $m $elector $nsites $nvotes $nclients $winner 1 test.db 213 set winner [rep016_selectwinner $nsites $nvotes $nclients] 214 setpriority pri $nclients $winner 216 $qdir $m $elector $nsites $nvotes $nclients $winner 1 test.db 229 set winner [rep016_selectwinner $nsites $n $n] 230 setpriority pri $nclients $winner 232 $qdir $m $elector $nsites $n $n $winner [all...] |
H A D | rep022.tcl | 133 # Make client 0 be the winner, and let it stay master. 141 set winner 0 142 setpriority pri $nclients $winner 145 $qdir $msg $elector $nsites $nvotes $nclients $winner 0 test.db 190 # Make last client be the winner, and let it stay master. 203 set winner 4 204 setpriority pri $nclients $winner 2 207 $qdir $msg $elector $nsites $nvotes $nclients $winner 0 test.db 261 # winner, since it should have a high enough LSN to win. 265 set winner [all...] |
H A D | rep026.tcl | 174 # Make the winner the crashing client, since the 177 set winner $elector 179 setpriority pri $nclients $winner 182 $msg $elector $nsites $nvotes $nclients $winner 0 test.db 233 $msg $elector2 $nsites $nvotes $nclients $winner 1 test.db
|
H A D | rep078.tcl | 174 set winner 0 175 setpriority pri $nsites $winner 184 $elector 0 $nvotes $nsites $winner 0 NULL
|
H A D | rep079.tcl | 236 set winner 0 237 setpriority pri $nsites $winner 248 $elector 0 $nvotes $nsites $winner 0 NULL
|
H A D | rep005.tcl | 168 winner lsn_lose elist logset} { 173 upvar $winner win 197 # Select winner. We want to test biggest LSN wins, and secondarily 209 # Easy case, if we have a master, the winner must be the 284 # be the next winner as well since it'll have the
|
H A D | rep069.tcl | 214 # Indicate failure with winner = -2. 223 set winner -2 234 $qdir $m $elector $nsites $nvotes $nclients $winner \
|
H A D | rep067.tcl | 177 winner lsn_lose elist quorum logset} { 182 upvar $winner win 221 # Select winner. We want to test biggest LSN wins, and secondarily 233 # Easy case, if we have a master, the winner must be the 316 # be the next winner as well since it'll have the
|
H A D | reputils.tcl | 1014 proc setpriority { priority nclients winner {start 0} {upgrade 0} } { 1019 if { $i == $winner } { 1048 # win The expected winner of the election. 1049 # reopen Should the new master (i.e. winner) be closed 1054 # ignore Should the winner ignore its own election? 1055 # If ignore is 1, the winner is not made master. 1136 expected winner is $win (eid [expr $win + 2])" 1202 # Find env id of winner. 1218 # Make sure it's the expected winner.
|
/macosx-10.10/emacs-93/emacs/lisp/ |
H A D | winner.el | 0 ;;; winner.el --- Restore old window configurations 33 ;; `winner-undo'. By default this one is bound to the key sequence 35 ;; press ctrl-c right (calling `winner-redo'). Even though it uses 36 ;; some features of Emacs20.3, winner.el should also work with 49 (defmacro winner-active-region () 54 (defsetf winner-active-region () (store) 60 (defalias 'winner-edges 62 (defalias 'winner-window-list 72 (defgroup winner nil function 81 (defcustom winner [all...] |
/macosx-10.10/BerkeleyDB-21/db/rep/ |
H A D | rep_elect.c | 21 * real winner's vote may be in the last half. 26 #define I_HAVE_WON(rep, winner) \ 27 ((rep)->votes >= (rep)->nvotes && winner == (rep)->eid) 323 * votes to pick a winner and if so, to send out a vote to 324 * the winner. 341 send_vote = rep->winner; 347 if (rep->winner == rep->eid) { 381 * our vote to the winner, and wait longer. The 382 * reason is that the winner may be "behind" us 384 * down, the winner wil [all...] |
H A D | rep_stat.c | 97 stats->st_election_cur_winner = rep->winner; 356 __db_dl(env, "Election winner", 360 __db_msg(env, "%lu/%lu\tMaximum LSN of election winner", 490 STAT_LONG("Current winner", rep->winner);
|
/macosx-10.10/ICU-531.30/icuSources/i18n/ |
H A D | nfrs.cpp | 532 int32_t winner = 0; local 556 winner = i; 569 if ((unsigned)(winner + 1) < rules.size() && 570 rules[winner + 1]->getBaseValue() == rules[winner]->getBaseValue()) { 571 double n = ((double)rules[winner]->getBaseValue()) * number; 573 ++winner; 578 return rules[winner];
|
/macosx-10.10/WebCore-7600.1.25/html/parser/ |
H A D | HTMLSrcsetParser.cpp | 265 unsigned winner = i; local 269 winner = i; 271 return imageCandidates[winner];
|
/macosx-10.10/WebCore-7600.1.25/page/ |
H A D | FocusController.cpp | 425 Element* winner = nullptr; local 431 winner = &element; 436 return winner; 443 Element* winner = nullptr; local 450 winner = &element; 454 return winner; 475 if (Element* winner = findElementWithExactTabIndex(nextInScope(start), tabIndex, event, FocusDirectionForward)) 476 return winner; 486 if (Element* winner = nextElementWithGreaterTabIndex(scope.rootNode(), start ? adjustedTabIndex(*start, *event) : 0, *event)) 487 return winner; [all...] |
/macosx-10.10/CPANInternal-159.1/Class-C3-XS-0.13/ |
H A D | XS.xs | 216 SV* winner = NULL; 228 if(!winner) { 231 /* if we haven't found a winner for this round yet, 234 seqhead is our new winner, and is added to the 241 winner = newSVsv(cand); 242 av_push(retval, winner); 243 /* note however that even when we find a winner, 246 if(!sv_cmp(seqhead, winner)) { 247 /* Once we have a winner (including the iteration 249 for any seq which had the winner a [all...] |
/macosx-10.10/awk-20/src/ |
H A D | main.c | 167 run(winner);
|
H A D | awk.h | 143 extern Node *winner;
|
H A D | awkgram.y | 99 winner = (Node *)stat3(PROGRAM, beginloc, $1, endloc); }
|
/macosx-10.10/ppp-786.1.1/Helpers/vpnd/ |
H A D | vpnoptions.h | 135 short int winner; member in struct:__anon11989
|
/macosx-10.10/emacs-93/emacs/lisp/erc/ |
H A D | erc-track.el | 362 winner) 363 (while (and substrings (not winner)) 372 (setq winner candidate))) 373 (setq result (cons winner result))))
|
/macosx-10.10/ppp-786.1.1/Helpers/pppd/ |
H A D | options.c | 931 mainopt->winner = opt - mainopt; 969 opt->winner = -1; 1137 && opt->winner != (short int) -1) 1138 print_option(opt + opt->winner, opt, printer, arg);
|
/macosx-10.10/BerkeleyDB-21/db/dbinc/ |
H A D | rep.h | 276 int winner; /* Current winner EID. */ member in struct:__rep
|