/seL4-l4v-master/l4v/tools/c-parser/testfiles/ |
H A D | jiraver881.c | 10 int first, second; member in struct:two_int 29 t.first = f(); 42 return (struct two_int) { .first = f() };
|
/seL4-l4v-master/HOL4/examples/muddy/muddyC/buddy/src/ |
H A D | tree.c | 53 int low = t->first; 55 for (n=t->first ; n<=t->last ; n++) 59 for (n=t->first ; n<=t->last ; n++) 70 t->first = t->last = -1; 93 int first, int last, int fixed, int id) 95 if (first < 0 || last < 0 || last < first) 103 t->first = first; 105 t->seq = NEW(int,last-first 92 bddtree_addrange_rec(BddTree *t, BddTree *prev, int first, int last, int fixed, int id) argument 189 bddtree_addrange(BddTree *t, int first, int last, int fixed,int id) argument [all...] |
H A D | bddtree.h | 43 int first, last; /* First and last variable in this block */ member in struct:s_BddTree 45 int *seq; /* Sequence of first...last in the current order */
|
H A D | reorder.c | 171 BddTree *this=t, *first=t; local 191 if (first == this) 192 first = this->prev; 205 return first; 211 BddTree *this, *first=t; local 238 if (first == this) 239 first = this->prev; 253 return first; 260 static BddTree *reorder_swapwin3(BddTree *this, BddTree **first) argument 279 *first 396 BddTree *this=t, *first=t; local 426 BddTree *this=t, *first=t; local 488 int first = 1; local 680 BddTree *first=t; local 2143 int first, last; local 2168 bdd_intaddvarblock(int first, int last, int fixed) argument [all...] |
H A D | bddio.c | 57 int first; member in struct:s_LoadHash 257 int first; local 265 first = 1; 271 if (!first) 273 first = 0; 467 the nodes used by the BDD. Each set consists of first the node 516 lh_table[n].first = -1; 572 lh_table[pos].next = lh_table[hash].first; 573 lh_table[hash].first = pos; 582 int hash = lh_table[key % lh_nodenum].first; [all...] |
/seL4-l4v-master/HOL4/examples/muddy/muddyC/buddy/examples/calculator/ |
H A D | hashtbl.cxx | 37 table[freepos].next = table[h].first; 38 table[h].first = freepos; 48 int p = table[hashval(id)].first; 66 int p = table[hashval(id)].first; 88 int next = table[h].first; 96 table[h].first = table[next].next; 144 table[n].first = -1; 148 table[n].first = -1; 157 table[n].next = table[h].first; 158 table[h].first [all...] |
H A D | hashtbl.h | 29 int first; member in class:hashElement
|
H A D | slist.h | 175 ~SList(void) { for (ite x=first() ; x.more() ; x++) delete &(*x); } 180 ite first(void) const { return ite(voidSList::head); } function in class:SList 186 { for (ite x=l.first() ; x.more() ; x++) append(*x); } 192 { for (ite x=first() ; x.more() ; x++) delete &(*x); voidSList::eraseAll();} 194 { for (ite x=first() ; x.more() ; x++) f(*x); }
|
/seL4-l4v-master/HOL4/examples/acl2/tests/inputs/ |
H A D | apply-total-order.lisp | 20 (or (equal a (first x)) 25 ((equal a (first x)) 27 (t (cons (first x) 32 ((equal a (first x)) x) 33 ((<< a (first x)) (cons a x)) 34 (t (cons (first x) 39 (and (<< (first x) (second x)) 44 (and (not (memberp (first x) (rest x))) 84 (<< y (first x)) 86 (<< y (first (dro [all...] |
H A D | summary.lisp | 68 (or (equal a (first x)) 73 (and (memberp (first x) y) 78 ((memberp (first x) y) 79 (cons (first x) (set-intersect (rest x) y))) 84 ((memberp (first x) y) 86 (t (cons (first x) (set-union (rest x) y))))) 118 (ltl-formulap (first f)) 121 (and (memberp (first f) '(~ X F G)) 134 (restricted-formulap (first f) v-list) 136 ((equal (len f) 2) (and (memberp (first [all...] |
H A D | test2.lisp | 13 (equal (first (foo x)) ; macro call
|
H A D | sets.lisp | 22 (and (memberp (first x) y) 27 ((memberp (first x) y) 28 (cons (first x) (set-intersect (rest x) y))) 33 ((memberp (first x) y) 35 (t (cons (first x) (set-union (rest x) y)))))
|
H A D | circuits.lisp | 34 (set-union (find-variables (first equation)) 36 ((and (equal (len equation) 2) (equal (first equation) '~)) 49 (and (consp (<- equations (first vars))) 67 (cons (-> (first states) v T) 72 (cons (-> (first states) v nil) 87 (if (equal (<- st (first vars)) T) 88 (cons (first vars) 95 (-> label (first states) 96 (label-fn-of-st (first states) vars))))) 105 (case (first equatio [all...] |
H A D | ltl.lisp | 72 (ltl-formulap (first f)) 75 (and (memberp (first f) '(~ X F G)) 88 (restricted-formulap (first f) v-list) 90 ((equal (len f) 2) (and (memberp (first f) '(~ X F G)) 108 ((equal (len f) 3) (set-union (create-restricted-var-set (first f)) 190 (and (subset (<- (transition m) (first states))
|
/seL4-l4v-master/HOL4/src/tactictoe/src/ |
H A D | tacticToe.sig | 20 first tactics on the list are applied first *)
|
/seL4-l4v-master/HOL4/tools/mlyacc/src/ |
H A D | look.sml | 68 (2) if the first element of the remaining rhs is 149 (* first: maps a nonterminal to its first-set. Get all the starters of 153 fun first nt = function 157 val first = nontermMemo(first) value 163 | (NONTERM nt,r) => TermSet.union(first nt,r)) 173 in {nullable = nullable, first = prefix}
|
/seL4-l4v-master/isabelle/src/Tools/Metis/src/ |
H A D | Subst.sig | 10 (* A type of first order logic substitutions. *) 50 (* Applying a substitution to a first order logic term. *) 108 (* Matching for first order logic terms. *) 114 (* Unification for first order logic terms. *)
|
/seL4-l4v-master/l4v/isabelle/src/Tools/Metis/src/ |
H A D | Subst.sig | 10 (* A type of first order logic substitutions. *) 50 (* Applying a substitution to a first order logic term. *) 108 (* Matching for first order logic terms. *) 114 (* Unification for first order logic terms. *)
|
/seL4-l4v-master/HOL4/examples/PSL/1.1/official-semantics/ |
H A D | RewritesScript.sml | 70 * Strongly on first posedge. 78 * Weakly on first posedge. 79 * On first posedge, if there is a posedge: [!c W (c /\ f)]
|
/seL4-l4v-master/HOL4/src/coalgebras/ |
H A D | pathScript.sml | 54 val first_def = Define`first (p:('a,'b) path) = FST (fromPath p)`; 58 toPath (x, LCONS (r, first p) (SND (fromPath p)))`; 105 ``(!x. first (stopped_at x : ('a,'b) path) = x) /\ 106 (!x r p. first (pcons x r p : ('a,'b) path) = x)``, 126 if SND (fromPath p) = LNIL then first p 154 (first p = first q)` THEN 183 ?r q1' q2'. (ll3 = LCONS (r, first q1') (SND (fromPath q1'))) /\ 184 (ll4 = LCONS (r, first q2') (SND (fromPath q2'))) /\ 233 ``!p. first (pma [all...] |
/seL4-l4v-master/isabelle/src/Pure/Isar/ |
H A D | parse.scala | 25 if (!filter_proper || in.atEnd || in.first.is_proper) in 38 Success(if (in.atEnd) pos.position() else pos.position(in.first), in) 52 val token = in.first
|
/seL4-l4v-master/l4v/isabelle/src/Pure/Isar/ |
H A D | parse.scala | 25 if (!filter_proper || in.atEnd || in.first.is_proper) in 38 Success(if (in.atEnd) pos.position() else pos.position(in.first), in) 52 val token = in.first
|
/seL4-l4v-master/HOL4/examples/l3-machine-code/m0/decompiler/ |
H A D | m0_decomp_demoScript.sml | 9 mov r3, r0 ; first address
|
/seL4-l4v-master/HOL4/src/portableML/poly/ |
H A D | Susp.sig | 15 The first time the suspension is forced, the expression e will be
|
/seL4-l4v-master/isabelle/src/Pure/Concurrent/ |
H A D | standard_thread.scala | 54 first: Boolean, delay: => Time, log: Logger, event: => Unit) 73 case Some(request) => if (first) false else { request.cancel; true } 101 // delayed event after first invocation
|