/barrelfish-2018-10-04/include/arch/aarch64/machine/ |
H A D | asm.h | 50 .set alias,sym
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/asn1/ |
H A D | x_name.c | 203 entry->set = i; 260 int i, set = -1; local 265 if(entry->set != set) { 271 set = entry->set; 322 int i, set = -1, ret = 0; local 341 if(entry->set != set) 348 set [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/ |
H A D | ViewletArray.java | 132 elements.set(i, createSubArray(subSize, subFixity, getViewable(), viewletFactory, subLocation)); 183 * returns the Viewlet. The newViewlet's elementReference is set based on 318 elements.set(((Integer) index.get(0)).intValue() - 1, data); 334 abstract void set(int index, Object element); method in class:ViewletArray.Elements 356 void set(int index, Object element) method in class:ViewletArray.FixedElements 392 void set(int index, Object element) method in class:ViewletArray.FlexibleElements 394 elements.set(index, element); 420 * is get or set.
|
H A D | GanttViewer.java | 211 newIndex.set(0,new Integer(-1)); 237 index.set(0,new Integer(-1)); 238 index.set(1,integerI); 270 index.set(0,integerI); 272 index.set(1,new Integer(1)); 303 * Actualy set the amount by which the display should be stretched 335 index.set(0,new Integer(-1));
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | mips3-mont.pl | 55 .set noat 56 .set reorder 62 .set noreorder 72 .set reorder 120 .set noreorder 148 .set reorder 208 .set noreorder 239 .set reorder 270 .set noreorder 321 .set reorde [all...] |
H A D | alpha-mont.pl | 53 .set noat 54 .set noreorder 72 .set reorder 112 .set noreorder 142 .set reorder 199 .set noreorder 234 .set reorder 307 .set noreorder
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | ordset.pl | 28 % Purpose: Ordered set manipulation utilities 36 % set operations can be done in time proportional to the Sum of the 38 % set routines, such as member/2, length/2,, select/3 can be used 46 :- comment(summary, "Ordered set manipulation utilities"). 52 duplicates. Thus the set {c,r,a,f,t} would be [a,c,f,r,t]. The 57 set operations can be done in time proportional to the Sum of 59 unordered set routines, such as member/2, length/2, select/3 62 The implementation allows nonground set elements. The only problem 63 with this is that a set can lose its set propert [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/viewers/ |
H A D | GanttTaskViewletType.java | 97 index2.set(0, new Integer(1)); 103 index2.set(0, new Integer(2)); 108 index2.set(0, new Integer(3)); 113 // set the custom renderer 131 // set background color 133 // set filled, if a color has been specified 211 index2.set(0, new Integer(1)); 219 index2.set(0, new Integer(2)); 233 index2.set(0, new Integer(3));
|
/barrelfish-2018-10-04/lib/libc/resolv/ |
H A D | res_init.c | 144 * there will have precedence. Otherwise, the server address is set to 294 * to still have a search list, and anyone to set the 360 /* set search list */ 852 res_setservers(res_state statp, const union res_sockaddr_union *set, int cnt) { argument 864 switch (set->sin.sin_family) { 866 size = sizeof(set->sin); 869 &set->sin, size); 872 &set->sin, size); 880 size = sizeof(set->sin6); 883 &set 903 res_getservers(res_state statp, union res_sockaddr_union *set, int cnt) argument [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | changeset.pl | 26 % Description: Predicates to efficiently compute the set of 78 The priority of the monitor should be set up such that is is lower than 80 that get appended to ChangeStream represent exactly the set of variables 138 Store = set(Empty), 154 Store = set(Empty), 174 Store = set(Old), 179 Store = set(Old), 186 Store = set(Changes),
|
H A D | ic_make_overlap_bivs.pl | 36 In principle a bivalued variable is set up between each pair of tasks. 37 This variable will be set to the amount of resource used by the second 39 If not, the variable will be set to zero. The sum of these variables 98 is set up, (since the value would be zero). If the tasks do 99 overlap, the bivalued variable is set to the amount of resource needed by the 212 summary: "Make a set of overlap bivalued variables for a set of tasks. 213 Introduce a set of 'bivalued sum' variables, equal to the sum of the binaries at
|
H A D | make_overlap_bivs.pl | 36 In principle a bivalued variable is set up between each pair of tasks. 37 This variable will be set to the amount of resource used by the second 39 If not, the variable will be set to zero. The sum of these variables 98 is set up, (since the value would be zero). If the tasks do 99 overlap, the bivalued variable is set to the amount of resource needed by the 212 summary: "Make a set of overlap bivalued variables for a set of tasks. 213 Introduce a set of 'bivalued sum' variables, equal to the sum of the binaries at
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ms/ |
H A D | 32all.bat | 0 set OPTS=no-asm
|
H A D | speed32.bat | 0 set makefile=ms\nt.mak
|
H A D | test.bat | 3 set test=..\ms 4 set opath=%PATH% 6 set OPENSSL_CONF=..\apps\openssl.cnf 78 set SSL_TEST=ssltest -key keyU.ss -cert certU.ss -c_key keyU.ss -c_cert certU.ss -CAfile certCA.ss
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509/ |
H A D | x509_req.c | 202 else if(sk_ASN1_TYPE_num(attr->value.set)) 203 ext = sk_ASN1_TYPE_value(attr->value.set, 0); 233 if(!(attr->value.set = sk_ASN1_TYPE_new_null())) goto err; 234 if(!sk_ASN1_TYPE_push(attr->value.set, at)) goto err;
|
/barrelfish-2018-10-04/usr/boot_perfmon/ |
H A D | internal.h | 37 extern struct coreset *set;
|
H A D | main.c | 33 for (int i = 0; i < coreset_count(set); i++) {
|
/barrelfish-2018-10-04/lib/compiler-rt/builtins/ |
H A D | fp_mul_impl.inc | 57 // normal number. Renormalize one or both of a and b, and set scale to 64 // denormal path it was already set by normalize( ), but setting it twice
|
/barrelfish-2018-10-04/usr/monitor/include/ |
H A D | capsend.h | 29 coreid_t *set; member in struct:capsend_destset
|
/barrelfish-2018-10-04/usr/tests/octopus/ |
H A D | d2bench1.c | 3 * \brief Benchmark get/set throughput. 28 * Usage: d2bench1 <#clients> <get|set> 65 else if (strcmp(argv[2], "set") == 0) { 67 cl->call_seq.set(cl, record, SET_DEFAULT, NOP_TRIGGER, false, &reply, &tid, &error_code); 69 //DEBUG_ERR(error_code, "set record");
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | s_lists.pl | 55 s_included/2, set/1, s_insertion/3, s_delta/3, s_card/2, 65 % s_included/2, set/1, s_insertion/3, s_delta/3, s_card/2, 96 :- mode set(++). 97 set(s_(_)) ?- true. 174 /* computes the weight of a ground set by summing up its elements
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | intervals.pl | 33 This file defines predicates for set algebra on sets of integers. 35 Each set is to be thought of as the union of disjoint intervals, and is 41 that 10--9 (corresponding to the null set) is not a valid interval, and 47 (1) [] is an I-set. 49 (2) [ I ] is an I-set, for any interval I. 51 (3) [ I1, I2, ... In ] is an I-set if: 76 not be a valid I-set). 83 I-set. 94 the tail of 'iset_union' are set unions. The operation [H|T] on an 95 I-set correspond [all...] |
/barrelfish-2018-10-04/tools/fof/ |
H A D | Introduction.tex | 13 To achieve this goal, Filet-o-Fish defines a set of 17 structures, arrays, etc. Altogether, this set of combinators defines 32 defines the set of legal expressions of a language, the semantics
|
/barrelfish-2018-10-04/lib/libc/db/hash/ |
H A D | hash_bigkey.c | 314 * This will set bpp to the buffer header of the last page of the big pair. 445 collect_data(HTAB *hashp, BUFHEAD *bufp, int len, int set) argument 464 if (set) { 483 collect_data(hashp, xbp, len + mylen, set)) < 1)) 498 __big_keydata(HTAB *hashp, BUFHEAD *bufp, DBT *key, DBT *val, int set) argument 500 key->size = (size_t)collect_key(hashp, bufp, 0, val, set); 512 collect_key(HTAB *hashp, BUFHEAD *bufp, int len, DBT *val, int set) argument 530 if (__big_return(hashp, bufp, 1, val, set)) 535 collect_key(hashp, xbp, totlen, val, set)) < 1)) 609 * Finally, set th [all...] |