/macosx-10.10/IOPCIFamily-239.1.2/ |
H A D | rballoc.c | 184 struct vtd_rblock * prior = NULL; local 201 prior = next; 210 if (prior) 212 next = RB_NEXT(vtd_rbaddr_list, &bf->rbaddr_list, prior); 213 if (addr != prior->end) 215 prior = NULL; 219 // coalesce to end of prior 220 addr = prior->start; 225 if (!prior) 228 prior 275 struct vtd_rblock * prior = NULL; local 357 struct vtd_rblock * prior = RB_ROOT(&bf->rbaddr_list); local [all...] |
/macosx-10.10/ruby-106/ruby/ext/tk/lib/tkextlib/tcllib/ |
H A D | chatwidget.rb | 87 cmd, prior = tk_split_simplelist(hook) 88 [procedure(cmd), number(prior)] 93 def hook_add(type, *args, &blk) # args -> [prior, cmd], [prior], [cmd] 96 if prior = args.shift 97 if !prior.kind_of?(Numeric) 98 cmd = prior 99 if (prior = args.shift) && !prior.kind_of?(Numeric) # error 100 args.unshift(prior) [all...] |
/macosx-10.10/emacs-93/emacs/lisp/term/ |
H A D | AT386.el | 49 (define-key AT386-keypad-map "V" [prior]) ;; PgUp
|
H A D | lk201.el | 14 (define-key function-key-map "\e[5~" [prior])
|
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | MachineLoopInfo.cpp | 53 MachineBasicBlock *PriorMBB = prior(MachineFunction::iterator(TopMBB)); 57 PriorMBB = prior(MachineFunction::iterator(TopMBB)); 66 if (BotMBB != prior(End)) {
|
H A D | CodePlacementOpt.cpp | 136 MachineFunction::iterator OldBeginPrior = prior(Begin); 137 MachineFunction::iterator OldEndPrior = prior(End); 141 prior(Begin)->updateTerminator(); 159 HasAnalyzableTerminator(prior(MachineFunction::iterator(TopMBB)))) { 174 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(Pred)))) 187 MachineFunction::iterator Prior = prior(Begin); 209 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(Prior)))) 211 // Ok, the block prior to Begin will be moved along with the rest. 261 !HasFallthrough(prior(MachineFunction::iterator(TopMBB))) && 275 if (InsertPt != MF.begin() && HasAnalyzableTerminator(prior(InsertP [all...] |
H A D | LatencyPriorityQueue.cpp | 127 if (Best != prior(Queue.end())) 136 if (I != prior(Queue.end()))
|
H A D | RegisterScavenging.cpp | 370 MachineBasicBlock::iterator II = prior(I); 375 II = prior(UseMI); 379 ScavengeRestore = prior(UseMI);
|
H A D | MachineBlockPlacement.cpp | 498 BB = *llvm::prior(Chain.end()); 502 assert(*llvm::prior(Chain.end()) == BB); 533 BB = *llvm::prior(Chain.end()); 638 if (*I != *llvm::prior(Chain.end())) 742 (!PredChain || *PI == *llvm::prior(PredChain->end()))) { 752 MachineBasicBlock *Bottom = *llvm::prior(LoopChain.end()); 980 MachineBasicBlock *PrevBB = llvm::prior(MachineFunction::iterator(*BI)); 1053 MachineBasicBlock *LayoutPred = *llvm::prior(BI);
|
H A D | SlotIndexes.cpp | 132 IndexList::iterator startItr = prior(curItr);
|
H A D | Spiller.cpp | 138 MachineInstr *loadInstr(prior(miItr));
|
/macosx-10.10/CPANInternal-159.1/IO-SessionData-1.03/lib/IO/ |
H A D | SessionSet.pm | 104 my $prior = defined $self->{$select}->exists($handle); 105 if (defined $act && $act != $prior) { 112 return $prior;
|
/macosx-10.10/ruby-106/ruby/ext/tk/lib/tkextlib/tkDND/ |
H A D | tkdnd.rb | 101 #def dnd_bindtarget(type, event, cmd=Proc.new, prior=50, *args) 103 # if prior.kind_of?(Numeric) 106 # prior) 109 # install_bind_for_event_class(DND_Subst, cmd, prior, *args)) 121 prior = 50 122 prior = args.shift unless args.empty? 125 if prior.kind_of?(Numeric) 128 prior) 131 install_bind_for_event_class(DND_Subst, cmd, prior, *args)) 149 #def dnd_bindsource(type, cmd=Proc.new, prior [all...] |
/macosx-10.10/emacs-93/emacs/lisp/emulation/ |
H A D | edt-lk201.el | 55 ("SELECT" . [select]) ("PREVIOUS" . [prior]) ("NEXT" . [next])
|
H A D | edt-pc.el | 84 ("FIND" . [insert]) ("INSERT" . [home]) ("REMOVE" . [prior])
|
/macosx-10.10/ruby-106/ruby/lib/rexml/validation/ |
H A D | relaxng.rb | 268 @prior = @previous.pop 269 return @prior.next( event ) 280 return [ @prior.expected, @events[0] ].flatten if @current == 0 302 @prior = @previous.pop 303 return @prior.next( event ) if @current == 0 309 return [ @prior.expected, @events[0] ].flatten if @current == 0
|
/macosx-10.10/llvmCore-3425.0.34/lib/Support/Windows/ |
H A D | Process.inc | 46 // GetNativeSystemInfo. However, this interface is not present prior
|
H A D | DynamicLibrary.inc | 51 // Ignore VC++ runtimes prior to 7.1. Somehow some of them get loaded
|
/macosx-10.10/ICU-531.30/icuSources/common/unicode/ |
H A D | icuplug.h | 323 * @param prior pass in 'NULL' to get the first (most recent) plug, 324 * otherwise pass the value returned on a prior call to uplug_nextPlug 329 uplug_nextPlug(UPlugData *prior);
|
/macosx-10.10/llvmCore-3425.0.34/lib/Target/ARM/ |
H A D | ARMHazardRecognizer.cpp | 54 I = llvm::prior(I);
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/ADT/ |
H A D | STLExtras.h | 145 // next/prior - These functions unlike std::advance do not modify the 150 // prior(myIt) returns copy of myIt decremented once 151 // prior(myIt, n) returns copy of myIt decremented n times 167 inline ItTy prior(ItTy it, Dist n) function in namespace:llvm 174 inline ItTy prior(ItTy it) function in namespace:llvm
|
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
H A D | LoopInfo.cpp | 430 Loop *Subloop = *llvm::prior(Unloop->end()); 431 Unloop->removeChildLoop(llvm::prior(Unloop->end())); 555 LI.addTopLevelLoop(Unloop->removeChildLoop(llvm::prior(Unloop->end())));
|
/macosx-10.10/emacs-93/emacs/lisp/ |
H A D | echistory.el | 84 (define-key electric-history-map [prior] 'scroll-down)
|
/macosx-10.10/llvmCore-3425.0.34/tools/llvm-objdump/ |
H A D | MCFunction.cpp | 97 spe = llvm::prior(Splits.end()); spi != spe; ++spi) {
|
/macosx-10.10/CPANInternal-159.1/Tree-Simple-VisitorFactory-0.10/lib/Tree/Simple/Visitor/ |
H A D | FromNestedHash.pm | 126 This method accepts a CODE reference as its C<$filter_function> argument and throws an exception if it is not a code reference. This code reference is used to filter the tree nodes as they are created, the C<$filter_function> is passed the node value extracted from the hash prior to it being inserted into the tree being built. The C<$filter_function> is expected to return the value desired for inclusion into the tree. 144 The tree is validated prior being accepted, if it fails validation an execption will be thrown. The rules are as follows;
|