/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_prime_rabin_miller_trials.c | 21 } sizes[] = { variable in typeref:struct:__anon1398 37 for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) { 38 if (sizes[x].k == size) { 39 return sizes[x].t; 40 } else if (sizes[x].k > size) { 41 return (x == 0) ? sizes[0].t : sizes[x - 1].t; 44 return sizes[x-1].t + 1;
|
/barrelfish-2018-10-04/lib/tommath/etc/ |
H A D | 2kprime.c | 5 int sizes[] = {256, 512, 768, 1024, 1536, 2048, 3072, 4096}; variable 19 for (x = 0; x < (int)(sizeof(sizes) / sizeof(sizes[0])); x++) { 21 mp_2expt(&q, sizes[x]); 31 printf("No primes of size %d found\n", sizes[x]); 65 ++sizes[x]; 70 printf("\n\n%d-bits (k = %lu) = %s\n", sizes[x], z, buf); 71 fprintf(out, "%d-bits (k = %lu) = %s\n", sizes[x], z, buf); fflush(out);
|
H A D | drprime.c | 4 int sizes[] = { 1+256/DIGIT_BIT, 1+512/DIGIT_BIT, 1+768/DIGIT_BIT, 1+1024/DIGIT_BIT, 1+2048/DIGIT_BIT, 1+4096/DIGIT_BIT }; variable 16 for (x = 0; x < (int)(sizeof(sizes)/sizeof(sizes[0])); x++) { 18 printf("Seeking a %d-bit safe prime\n", sizes[x] * DIGIT_BIT); 19 mp_grow(&a, sizes[x]); 21 for (y = 1; y < sizes[x]; y++) { 27 a.used = sizes[x]; 46 printf("Error not DR modulus\n"); sizes[x] += 1; goto top;
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/ |
H A D | bnspeed.c | 165 static int sizes[NUM_SIZES]={128,256,512,1024,2048}; variable 166 /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */ 193 BN_rand(a,sizes[i],1,0); 196 BN_rand(b,sizes[j],1,0); 201 printf("mul %4d x %4d -> %8.3fms\n",sizes[i],sizes[j],tm*1000.0/num); 209 BN_rand(a,sizes[i],1,0); 214 printf("sqr %4d x %4d -> %8.3fms\n",sizes[i],sizes[i],tm*1000.0/num); 221 BN_rand(a,sizes[ [all...] |
H A D | expspeed.c | 194 static int sizes[NUM_SIZES]={128,256,512,1024,2048,4096,8192}; variable 196 /*static int sizes[NUM_SIZES]={59,179,299,419,539}; */ 245 if (!BN_generate_prime(c,sizes[i],0,ADD,REM,genprime_cb,NULL)) goto err; 254 if (!BN_pseudo_rand(a,sizes[i],1,0)) goto err; 256 if (!BN_pseudo_rand(b,sizes[i],1,0)) goto err; 259 if (!BN_pseudo_rand(c,sizes[i],1,1)) goto err; 328 sizes[i],sizes[i],sizes[i],tm*1000.0/num,tm*mul_c[i]/num, num);
|
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/ |
H A D | VisualizerBinPacking.java | 30 * sizes (integers) and bins (dvars)
43 int[] sizes = visualState.argumentIntArray("sizes");
62 fixed += sizes[j];
64 possible += sizes[j];
81 int[] sizes = visualState.argumentIntArray("sizes");
92 for(int i=1;i<sizes.length;i++){
93 required += sizes[i];
101 profile[items[j].getIntValue()] += sizes[ [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | ecoptions.tex | 46 The sizes in bytes of the stacks can be varied. They will be rounded to 49 default to very large sizes (128MB), where real memory or space in the 59 The sizes in bytes of the private and shared heaps. Normally these are 63 at fixed addresses and in that case these sizes determine the maximum
|
H A D | dbi.tex | 242 \subsection{Specifying buffer sizes in templates} 244 Prolog terms, strings and atoms can have variable sizes, but when they are 270 but the second one defines some sizes for the different elements in the
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | emu_util.c | 76 * allocate Prolog stacks with the given sizes and initialize 85 uword sizes[4]; local 93 sizes[0] = ec_options.globalsize; 94 sizes[1] = 0; 95 sizes[2] = ec_options.localsize; 96 sizes[3] = 0; 102 alloc_stack_pairs( 4, names, sizes, stacks);
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsbugs.tex | 49 \item The stack and heap sizes have virtual memory limits which can be
|
H A D | umscmdlineopts.tex | 122 \notation{eclipse} for setting stack sizes.
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | edge_finder.c | 70 long *sizes; /* [ntasks], only nsizes used */ member in struct:__anon1771 74 long nsizes; /* number of valid entries in sizes[] */ 83 #define Size(j) (ef->sizes[j]) 112 free(ef->sizes); 168 ef->sizes = (long *) malloc(n*sizeof(long)); 236 /* we have more sizes than ever: need a bigger array for G */
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | define.pl | 61 * :- define(sizes, [A, B, C], (A is m_MAX, B is A // 2, C is B - 1)).
|
H A D | ordset.pl | 37 % argument sizes rather than their Product. Some of the unordered 58 the argument sizes rather than their Product. Some of the
|
/barrelfish-2018-10-04/kernel/ |
H A D | paging_generic.c | 408 #error setup page sizes for arch
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | setsolver.tex | 402 Write a predicate which, given a list of sizes of items and a list of 407 Try it out with 5 items of sizes 20, 34, 9, 12 and 19, into 3 buckets of 408 sizes 60, 20 and 20.
|
H A D | search.tex | 163 typical sizes of search spaces. 218 Since search space sizes grow exponentially with problem size, 377 space sizes, the number of possible search space traversal orderings, 550 strategies on various problem sizes. 576 %sizes of all the (remaining) variable's domains:
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | fat.tex | 7 cells. The data area is split into clusters with sizes a multiple of the
|
H A D | blockdevfs.tex | 72 attached disk drives and report their sizes.
|
/barrelfish-2018-10-04/lib/dmalloc/ |
H A D | dmalloc.c | 48 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes) 49 8 or 16 bytes (if 8byte sizes) 1156 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); 1159 chunks with sizes indicated in the "sizes" array. It returns 1193 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) }; 1195 if (independent_comalloc(3, sizes, chunks) == 0) 1308 control the sizes of incremental increases of this space by 1398 size_t sizes[], void* chunks[]); 2259 /* ------------------- Chunks sizes an 5031 ialloc(mstate m, size_t n_elements, size_t* sizes, int opts, void* chunks[]) argument 5371 dlindependent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]) argument 5894 mspace_independent_comalloc(mspace msp, size_t n_elements, size_t sizes[], void* chunks[]) argument [all...] |
/barrelfish-2018-10-04/lib/tommath/pre_gen/ |
H A D | mpi.c | 6035 } sizes[] = { variable in typeref:struct:__anon1401 6051 for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) { 6052 if (sizes[x].k == size) { 6053 return sizes[x].t; 6054 } else if (sizes[x].k > size) { 6055 return (x == 0) ? sizes[0].t : sizes[x - 1].t; 6058 return sizes[x-1].t + 1; 8779 /* find sizes, w [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/ |
H A D | tkeclipse.tcl | 113 # allow floats -- useful for sizes specified in gigabytes 1207 balloonhelp .tkecl.pane.__h1 "Press and drag left mouse to adjust Results and Output window sizes"
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | bags.pl | 56 intersection linear in the sizes of their arguments.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | gc.tex | 79 offset from PP. The active sizes of environments can be determined
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | bridge_postorder_sorted_sum.pl | 14 % the bridges Sz variable contains therefore the sum of the requesting sizes of
|