/barrelfish-2018-10-04/tools/usbboot/ |
H A D | misc.c | 32 void sdelay(unsigned long loops) argument 35 "bne 1b":"=r" (loops):"0"(loops));
|
/barrelfish-2018-10-04/tools/usbboot/include/aboot/ |
H A D | aboot.h | 57 void sdelay(unsigned long loops);
|
/barrelfish-2018-10-04/lib/tommath/etc/ |
H A D | makefile | 1 CFLAGS += -Wall -W -Wshadow -O3 -fomit-frame-pointer -funroll-loops -I../
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | makefile.cygwin_dll | 8 CFLAGS += -I./ -Wall -W -Wshadow -O3 -funroll-loops -mno-cygwin 51 cd mtest ; $(CC) -O3 -fomit-frame-pointer -funroll-loops mtest.c -o mtest -s
|
H A D | makefile.shared | 13 CFLAGS += -O3 -funroll-loops
|
H A D | makefile | 17 CFLAGS += -O3 -funroll-loops
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/ |
H A D | yoyo1.pl | 17 Wrong algorithm, therefore subset(S, ground_list) loops on backtracking. \n\
|
/barrelfish-2018-10-04/include/vm/ |
H A D | vm_radix.c | 487 int loops = 0; local 513 KASSERT(++loops < 1000, 514 ("vm_radix_lookup_ge: too many loops")); 598 int loops = 0; local 627 KASSERT(++loops < 1000, 628 ("vm_radix_lookup_le: too many loops"));
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/threads/ |
H A D | netware.bat | 10 rem "mttest.nlm -thread 20 -loops 10 -CAfile \openssl\apps\server.pem >mttest.out 2>mttest.err"
|
/barrelfish-2018-10-04/lib/libc/resolv/ |
H A D | res_send.c | 434 int done = 0, loops = 0; local 455 if (++loops < 42) /*doug adams*/ 520 int done = 0, loops = 0; local 537 if (++loops < 42) /*doug adams*/
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsstyle.tex | 68 \item When possible, use do-loops instead of recursion. 77 \item The final code should not use failure-loops\index{failure loop}; they are
|
H A D | umslanguage.tex | 234 \index{loops} 369 writing nested loops). Each element of \about{List} takes a value 482 Finally, do-loops can be used as a control structure in grammar rules as well: 676 Now for some examples of nested loops. 907 Array notation is especially useful within loops.
|
H A D | umsintro.tex | 231 %e.g., when avoiding infinite loops, to increase efficiency
|
H A D | umsdeveltools.tex | 440 detailed description of logical loops.
|
H A D | umsflags.tex | 54 top-level loops.
|
H A D | umsmacros.tex | 517 do-loops need not be enclosed in curly brackets.
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | xahcid.tex | 59 interrupt was triggered by the \ac{hba}, the handler loops over all ports and
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | programanalysis.tex | 162 measurement. \See{See section \ref{sec:loops} for more information on 163 logical loops}
|
H A D | modelling.tex | 290 \item[Use only structural recursion and loops]
|
H A D | eprolog.tex | 78 \label{sec:loops} 146 writing nested loops).
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | listut.pl | 148 % (But not nmembers(-,+,-), it loops.)
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 709 Note that we can put as many parallel operations into a {\it do} loop as we want, they are all executed inside one big loop. We can of course also nest {\it do} loops so that one loop is executed inside another loop. 788 Again, we present two implementations. The first uses nested {\it foreacharg}\index{foreacharg, nested} {\it do} loops to perform some operation $q$ on each element of an array. The second uses nested {\it for}\index{for}\index{loop} loops to iterate over all index combinations $I$ and $J$. This second variant is more complex, and should be used only if we require the index values $I$ and $J$ as well as the matrix element $X$. 822 Note the strange way in which parameters $M$, $I$ and $Matrix$ are passed through the nested {\it for} loops with {\it param} arguments. But if we do not do this, then the variable $Matrix$ outside and inside the {\it do} loop are unrelated. 1368 The implementation uses nested {\it foreach} {\it do} loops to create each combination of elements once. The {\it fromto} accumulators are used to collect the result list. 1459 This concept can also be implemented with nested {\it do} loops. The recursive version seems more natural. 1943 \item When possible, use do loops instead of recursion. 1948 \item The final code should not use failure-loops\index{failure loop}; they are acceptable for debugging or testing purposes. 2068 \section{Do loops} 2070 Do loops\inde [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ |
H A D | makeengines.com | 140 $! Set up two loops, one that keeps track of the engines,
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | propia.pl | 309 % optimisation, but can cut off some infinite loops in case the Goal
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | events.pl | 114 % Avoid loops by recursive calls due to macros: 933 exit0(-1) % to avoids loops in error 152 in exit/1
|