/barrelfish-2018-10-04/lib/lwip2/src/apps/socket_examples/ |
H A D | socket_examples.c | 48 #define INIT_FDSETS(sets) do { \ 49 memset((sets)->buf1, 0xab, 8); \ 50 memset((sets)->buf2, 0xab, 8); \ 51 memset((sets)->buf3, 0xab, 8); \ 52 memset((sets)->buf4, 0xab, 8); \ 55 #define CHECK_FDSETS(sets) do { \ 56 LWIP_ASSERT("buf1 fail", !memcmp((sets)->buf1, cmpbuf, 8)); \ 57 LWIP_ASSERT("buf2 fail", !memcmp((sets)->buf2, cmpbuf, 8)); \ 58 LWIP_ASSERT("buf3 fail", !memcmp((sets)->buf3, cmpbuf, 8)); \ 59 LWIP_ASSERT("buf4 fail", !memcmp((sets) 77 fdsets sets; local [all...] |
/barrelfish-2018-10-04/lib/libc/regex/ |
H A D | regfree.c | 74 if (g->sets != NULL) { 76 free(g->sets[i].ranges); 77 free(g->sets[i].wides); 78 free(g->sets[i].types); 80 free((char *)g->sets);
|
H A D | regex2.h | 169 cset *sets; /* -> cset [ncsets] */ member in struct:re_guts
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/rxspencer/ |
H A D | regfree.c | 30 if (g->sets != NULL) 31 free((char *)g->sets);
|
H A D | regcomp.c | 137 g->sets = NULL; 642 if (nch(p, cs) == 1) { /* optimize singleton sets */ 1013 if (p->g->sets == NULL) 1014 p->g->sets = (cset *)malloc(nc * sizeof(cset)); 1016 p->g->sets = (cset *)realloc((char *)p->g->sets, 1025 p->g->sets[i].ptr = p->g->setbits + css*(i/CHAR_BIT); 1027 if (p->g->sets != NULL && p->g->setbits != NULL) 1037 assert(p->g->sets != NULL); /* xxx */ 1038 cs = &p->g->sets[n [all...] |
H A D | regex2.h | 71 * Structure for [] character-set representation. Character sets are 75 * simplifies testing whether two sets could be identical. 109 cset *sets; /* -> cset [ncsets] */ member in struct:re_guts
|
/barrelfish-2018-10-04/tools/fastmodels/ |
H A D | cache.c | 79 int sets= FIELD(13, 15, ccsidr) + 1, local 84 int setbits= log2i(sets), 88 for(int s= 0; s < sets; s++) {
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | cardinal_comments.pl | 36 :-comment(desc, html("Cardinal is a sets constraints library with especial inferences 37 on sets cardinality and other optional set functions (minimum and maximum for 38 sets of integers, and union for sets of sets.) 43 solved if constraint reasoning prunes search space when the sets are not fully 46 Many complex relations between sets can be expressed with constraints such as set 48 operators as intersection, union or difference of sets. Also, as it is often the 50 function of one or more sets (e.g. the cardinality of a set). For instance, the 52 for satisfaction problems, some sets, althoug [all...] |
H A D | intervals.pl | 33 This file defines predicates for set algebra on sets of integers. 44 I call the sets of intervals I-sets. Their representation has these 57 makes the I-sets more efficient to process. 61 This enforces a unique representation, prohibiting I-sets 88 recursive call, the sets grow smaller - either because a whole interval 108 We also use the ordering and disjointness of intervals within I-sets to 135 (3) Disjointness of intervals within I-sets. 146 (4) Ordering of intervals within I-sets. 150 When new I-sets ar [all...] |
H A D | cardinal_union.pl | 161 % SetAny is the union of all sets in (SetsList \/ SetIn). 164 % counted. All sets are ordered lists. 177 % All sets in SetsList contained in GlbUVar+PossUVar constitute NewPoss and are united 179 % All sets are ordered lists. 198 % SetAny is the union of all sets in (SetsList \/ SetIn). All sets are ordered lists. 199 % Sets in SetsList must be completely inside Glb+Poss. Move is a list of sets of elements 218 % counted. All sets are ordered lists. 242 % Singles are the resulting elements with count=1. All sets are ordered lists. 266 % Used to update union poss. All sets ar [all...] |
H A D | cardinal_util.pl | 55 % All sets are ordered lists. 65 % SetAny is the union of all sets in (SetsList \/ SetIn). All sets are ordered lists. 76 % SetAny is the union of Set1 with Set2. All sets are ordered lists. 89 % cardinality of SetAny. All sets are ordered lists. 106 % SetBoth is the intersection of Set1 with Set2. All sets are ordered lists. 119 % cardinality of SetBoth. All sets are ordered lists. 135 % Set1But2 is Set1 without Set2. All sets are ordered lists. 150 % NewSet is Set without WithoutSet. All sets are ordered lists. 163 % cardinality of NewSet. All sets ar [all...] |
H A D | flat.pl | 32 to write N different sets of predicates to handle N different 68 % sets
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | fdsets.tex | 36 of finite sets of integers. Unlike {\em conjunto}, it cannot deal with 37 sets elements that are not integers. On the other hand, fd_sets is usually 38 faster for integer sets than conjunto. 44 (Ground) integer sets are simply sorted, duplicate-free lists of integers e.g. 50 are not sets in the sense of this library. 77 The predicates to declare sets are: 85 Sets is a list of N sets containing numbers between Min and Max 152 Set3 is the difference of the integer sets Set1 and Set2 156 The integer sets Set1 and Set2 are disjoint 164 Set3 is the intersection of the integer sets Set [all...] |
H A D | extconjunto.tex | 44 that contain herbrand terms as well as ground sets. Modules that use 75 of elements of D. Thus they are both ground sets. S is then called a 95 \begin{quote} A composition of set domain variables or ground sets together 116 sets : $Glb_s .. Lub_s $ 195 term {\bf S1}. If the two terms are ground sets it just checks the 209 {\em Lsets} is a list of set variables or ground sets. {\em S} is a 210 set term which is the union of all these sets. If {\em S} is a free 212 from the union of the domains or ground sets in {\em Lsets}. 217 {\em Lsets} is a list of set variables of ground sets. All the sets ar [all...] |
H A D | introduction.tex | 102 \eclipse\ offers constraint solving over the domain of finite sets of 104 to reason about sets and set cardinality \cite{gervet}\footnote{ 106 is generally less efficient, but implements sets of symbolic elements as 107 well as integer sets}.
|
/barrelfish-2018-10-04/usr/skb/octopus/ |
H A D | skiplist.c | 294 * \brief Compute the intersection of multiple sets on-the-fly by 297 * \param sets Array of pointer to the lists we want to intersect. 304 char* skip_intersect(struct skip_list** sets, size_t set_count, char* next) argument 314 qsort(sets, set_count, sizeof(struct skip_list*), compare_entry_count); 317 state[i] = sets[i]->header; 327 struct skip_list* set = sets[j]; 347 // continue checking other sets 392 struct skip_set* sets[3] = { ss, ss2, ss3 }; local 395 while( (next = skip_intersect(sets, 3, next)) != NULL) { 399 while( (next = skip_intersect(sets, [all...] |
H A D | predicates.c | 162 static struct skip_list** sets = NULL; local 181 free(sets); 188 sets = malloc(sizeof(struct skip_list*) * elems); 205 sets[i] = sl; 211 next = skip_intersect(sets, elems, next); 416 static struct bitfield** sets = NULL; local 441 free(sets); 448 sets = calloc(elems+1, sizeof(struct bitfield*)); 449 sets[0] = no_attr_bf; 462 sets[elem [all...] |
/barrelfish-2018-10-04/kernel/include/arch/armv7/ |
H A D | cache.h | 80 size_t sets= y + 1; local 87 for(size_t s= 0; s < sets; s++) {
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | setsolver.tex | 35 \index{finite sets} 37 of finite sets of integers. 38 Modelling with sets is useful for problems where one is not 48 In the context of the {\em ic_sets} library, (ground) integer sets are 55 are not sets in the sense of this library. 89 Sets is a list of N sets containing numbers between Min and Max 117 over sets. 142 Possible constraints between two sets are equality, inclusion/subset 167 \index{sameset/2@\texttt{sameset/2}!ic_sets} The sets Set1 and Set2 are equal 169 \index{disjoint/2@\texttt{disjoint/2}!ic_sets} The integer sets Set [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | ordset.pl | 30 % In this module, sets are represented by ordered lists with no 51 In this module, sets are represented by ordered lists with no 233 fail_if:"Fails if the sets are not comparable", 238 = The sets are identical (in the sense of ==/2) 274 summary:"Checks whether two sets are disjoint", 277 Succeeds when the two ordered sets have no element in common. 343 summary:"Checks whether two sets have a non-empty intersection", 346 Succeeds when the two ordered sets have at least one element 368 summary:"Computes the intersection of two sets", 372 and Set2, provided that Set1 and Set2 are ordered sets [all...] |
/barrelfish-2018-10-04/lib/cpuid/ |
H A D | cpuid_amd.c | 220 ci->sets = (ci->size / ci->linesize) / ci->associativity; 265 /* the the number of sets */ 266 ci->sets = reg.ecx + 1; 269 ci->size = (size_t)ci->linesize * ci->sets; 273 ci->size = (size_t)ci->linesize * ci->sets * ci->associativity;
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_make_overlap_bivs.pl | 95 set_up_biv sets up a Bivalued Variable between the two tasks, if necessary. 147 This sets the bivalued variable as soon as the bounds on the task start times 164 This sets up the propagation from start time and duration tentative 197 This sets to boolean Bool to True if the constraint Cons succeeds and to
|
H A D | make_overlap_bivs.pl | 95 set_up_biv sets up a Bivalued Variable between the two tasks, if necessary. 147 This sets the bivalued variable as soon as the bounds on the task start times 164 This sets up the propagation from start time and duration tentative 197 This sets to boolean Bool to True if the constraint Cons succeeds and to
|
/barrelfish-2018-10-04/include/cpuid/ |
H A D | cpuid.h | 192 uint32_t sets; ///< number of sets member in struct:cpuid_cacheinfo
|
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | conjunto.pl | 73 defined from the union of the domains or known sets appearing in Lsets. 141 disjoint. If both terms are known sets, it checks the empty 203 elements for the labeling of weighted sets. 457 only over the upper and lower bound sets of values of the set domain and 458 makes sure that these sets of values are consistent with those of other 582 set term Sterm1. If both terms are known sets, this constraint checks
|