/barrelfish-2018-10-04/lib/libc/stdlib/ |
H A D | getopt.c | 64 static char *place = EMSG; /* option letter processing */ local 67 if (optreset || *place == 0) { /* update scanning pointer */ 69 place = nargv[optind]; 70 if (optind >= nargc || *place++ != '-') { 72 place = EMSG; 75 optopt = *place++; 76 if (optopt == '-' && *place == 0) { 79 place = EMSG; 85 place = EMSG; 91 optopt = *place [all...] |
H A D | getopt_long.c | 107 static char *place = EMSG; /* option letter processing */ variable 202 current_argv = place; 391 if (optreset || !*place) { /* update scanning pointer */ 394 place = EMSG; 411 if (*(place = nargv[optind]) != '-' || 413 place[1] == '\0') { 415 (place[1] == '\0' && strchr(options, '-') == NULL)) { 417 place = EMSG; /* found non-option */ 453 if (place[1] != '\0' && *++place [all...] |
/barrelfish-2018-10-04/lib/skb/ |
H A D | skb_snprintf.c | 65 * put the ifdef for HAVE_VA_COPY in one place rather than in lots of 588 int place = 0; local 613 convert[place++] = 617 } while(uvalue && (place < 20)); 618 if (place == 20) place--; 619 convert[place] = 0; 621 zpadlen = max - place; 622 spadlen = min - MAX (max, place) - (signvalue ? 1 : 0); 633 printf("zpad: %d, spad: %d, min: %d, max: %d, place [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bio/ |
H A D | b_print.c | 488 int place = 0; local 512 convert[place++] = 516 } while (uvalue && (place < (int)sizeof(convert))); 517 if (place == sizeof(convert)) 518 place--; 519 convert[place] = 0; 521 zpadlen = max - place; 522 spadlen = min - OSSL_MAX(max, place) - (signvalue ? 1 : 0) - strlen(prefix); 558 while (place > 0) 559 doapr_outch(sbuffer, buffer, currlen, maxlen, convert[--place]); [all...] |
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | db_partitions.pl | 9 %% 1.: Create NUMANode-sized partitions and place multiple partitions
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/grace/ |
H A D | queens.pl | 24 % The N-queens puzzle. We have to place N queens on an NxN chess boards
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/project/ |
H A D | organisation.tex | 110 a contribution. Some spam filters are in place. The owner 179 A nighly build routine in in place. 192 This all takes place in /usr/local/eclipse/rotds
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | occur.pl | 4 % Purpose: routines for checking number/place of occurrence
|
H A D | trees.pl | 158 % order in the tree goes all over the place.
|
H A D | applic.pl | 94 % cut in the suggested place will produce a tail-recursive version.
|
H A D | xml_generation.pl | 216 * place of ', because browsers don't recognize it in HTML.
|
/barrelfish-2018-10-04/doc/013-capability-mgmt/ |
H A D | type_system.tex | 140 \arg Slot in destination CNode cap to place copy into 158 \arg CNode address to place copy into relative to destination cspace. 159 \arg Slot in CNode cap to place copy into. 179 \arg Address of CNode cap in destination cspcae to place retyped caps into. 859 \arg CSpace address of the CNode the place the created capability in 861 \arg Slot number to place the capability in
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | queues.pl | 11 % The work of producing them in the first place and of
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | gc.tex | 148 The only place that is available 267 can be updated in its proper place.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | programanalysis.tex | 260 coverage) can be used in place of the normal \verb+compile/1+ 282 The default behaviour of the \verb+ccompile/1+ predicate is to place
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | ppc-mont.pl | 299 Lcopy: ; copy or in-place refresh
|
H A D | ppc64-mont.pl | 195 slwi $tp,$num,2 ; place for {an}p_{lh}[num], i.e. 4*num 196 add $tp,$tp,$num ; place for tp[num+1] 878 Lcopy: ; copy or in-place refresh
|
H A D | sparcv9-mont.pl | 280 ld [$ap+%o7],%o0 ! copy or in-place refresh
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | fat.tex | 50 To generate 8.3 filenames in the first place, we have adapted various
|
/barrelfish-2018-10-04/doc/018-Practical-guide/ |
H A D | readme.tex | 184 binaries to the right place for you, eg
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsmemory.tex | 194 to the place where the choice was made, the old state will be restored 328 triggering performs badly. It should then be inserted in a place
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn.tex | 1070 To multiply by the polynomial $g(x) = x$ all you have todo is shift the digits of the basis left one place. The 1078 This will multiply $a$ in place by $x^b$ which is equivalent to shifting the digits left $b$ places and inserting zeroes 1085 This will divide $a$ in place by $x^b$ and discard the remainder. This function cannot fail as it performs the operations 1086 in place and no new digits are required to complete it. 1319 This will reduce $a$ in place modulo $b$ with the precomputed $\mu$ value in $c$. $a$ must be in the range 1392 This reduces $a$ in place modulo $m$ with the pre--computed value $mp$. $a$ must be in the range 1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted 1544 This will reduce $a$ in place modulo $n$ with the pre--computed value $d$. From my experience this routine is
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probing_tests.pl | 213 take place no sooner than the time point with ID 3 plus 10 minutes.
|
H A D | probing_tests.pl | 211 take place no sooner than the time point with ID 3 plus 10 minutes.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | repair.tex | 100 place of the variables. If a variable has no tentative value 101 a variable is returned in its place.
|