/seL4-l4v-10.1.1/seL4/src/arch/x86/machine/ |
H A D | cpu_identification.c | 62 struct family_model original) 70 if (original.family != 0x0F) { 71 ci->display.family = original.family; 73 ci->display.family = ci->display.extended_family + original.family; 77 * original family_ID value read from CPUID.EAX, like: 78 * if (original->family == 0x06 || original->family == 0x0F) { 96 ci->display.model = (ci->display.extended_model << 4u) + original.model; 98 ci->display.model = original.model; 104 struct family_model original) 61 x86_cpuid_intel_identity_initialize(cpu_identity_t *ci, struct family_model original) argument 103 x86_cpuid_amd_identity_initialize(cpu_identity_t *ci, struct family_model original) argument 126 struct family_model original; local [all...] |
/seL4-l4v-10.1.1/graph-refine/graph-to-graph/wcet_scripts/ |
H A D | unspecified_pre_cond.py | 22 original = open(original_name) variable 26 line = original.readline() 33 next_line = original.readline() 40 original.close()
|
/seL4-l4v-10.1.1/HOL4/src/parse/ |
H A D | GrammarSpecials.sml | 15 fun mk_fakeconst_name {original,fake} = let 21 (fake, original) 31 SOME (fake, original) => SOME{fake = fake, original = original} 60 mk_fakeconst_name {original = SOME {Thy = "case magic", Name = nm}, 66 SOME {original = SOME{Thy="case magic",Name},fake="case"} => SOME Name
|
H A D | GrammarSpecials.sig | 14 {original : KernelSig.kernelname option, fake : string} -> string 16 string -> {original : KernelSig.kernelname option, fake : string} option
|
/seL4-l4v-10.1.1/isabelle/src/Pure/General/ |
H A D | completion.scala | 24 original: String, 39 if (res1.range != res2.range || res1.original != res2.original) result1 42 Some(Result(res1.range, res1.original, false, items)) 49 original: String, 204 original: String): Option[Completion.Result] = 211 if xname1 != original 221 List(original, xname1).map(Token.explode(Keyword.Keywords.empty, _)) match { 227 Item(range, original, full_name, description, replacement, 0, true) 231 else Some(Result(range, original, name [all...] |
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/General/ |
H A D | completion.scala | 24 original: String, 39 if (res1.range != res2.range || res1.original != res2.original) result1 42 Some(Result(res1.range, res1.original, false, items)) 49 original: String, 204 original: String): Option[Completion.Result] = 211 if xname1 != original 221 List(original, xname1).map(Token.explode(Keyword.Keywords.empty, _)) match { 227 Item(range, original, full_name, description, replacement, 0, true) 231 else Some(Result(range, original, name [all...] |
/seL4-l4v-10.1.1/HOL4/src/prekernel/ |
H A D | Feedback.sml | 194 fun register_alias_trace {original, alias} = 195 if original = alias then 196 WARN "register_alias_trace" "original and alias are equal; doing nothing" 198 case find_record original of 200 ("Original trace: \""^original^"\" doesn't exist") 208 val record_alias = Binarymap.insert(!trace_map, original, TR rcd) 209 val mk_alias = Binarymap.insert(record_alias, alias, ALIAS original) 214 if a = original then ()
|
H A D | Feedback.sig | 46 val register_alias_trace : {original:string,alias:string} -> unit
|
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/src/ |
H A D | shrink.sml | 51 * a list which maps each original entry to an equivalence 53 class for the nth entry in the original entry list. 111 Let the original entry list be E. We map E to a list of a pairs 115 We then sort EP on the original entries. The second elements in the 120 the original list and a list SE of integers which gives the
|
/seL4-l4v-10.1.1/HOL4/src/integer/ |
H A D | IntDP_Munge.sig | 42 is "equivalent" to the original (but with possible extra
|
/seL4-l4v-10.1.1/isabelle/src/Pure/Thy/ |
H A D | bibtex.scala | 191 original <- rendering.model.get_text(r) 192 original1 <- Completion.clean_name(Library.perhaps_unquote(original)) 207 Completion.Item(r, original, full_name, description, replacement, 0, false) 209 } yield Completion.Result(r, original, false, items)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Thy/ |
H A D | bibtex.scala | 191 original <- rendering.model.get_text(r) 192 original1 <- Completion.clean_name(Library.perhaps_unquote(original)) 207 Completion.Item(r, original, full_name, description, replacement, 0, false) 209 } yield Completion.Result(r, original, false, items)
|
/seL4-l4v-10.1.1/HOL4/src/HolQbf/ |
H A D | selftest.sml | 40 die "Term read not alpha-equivalent to original term."
|
/seL4-l4v-10.1.1/HOL4/src/simp/src/ |
H A D | Travrules.sml | 6 * Based loosely on original HOL rewriting by
|
/seL4-l4v-10.1.1/HOL4/src/tfl/examples/sorting/ |
H A D | partitionScript.sml | 64 Everything in the partitions occurs in the original list, and
|
/seL4-l4v-10.1.1/HOL4/Manual/Description/ |
H A D | preface.tex | 49 the intention that other logics eventually be tried in place of the original 55 The original \LCF\ was implemented at Edinburgh in the early 1970's, and is now 67 released (in 1988), after the original \HOL\ system had been in use
|
/seL4-l4v-10.1.1/HOL4/Manual/LaTeX/ |
H A D | ack.tex | 85 The original document design used \LaTeX\ macros supplied by Elsa 89 Avra Cohn (in whose garden the original object resides). John Van 102 This research environment was wonderfully productive for many of the system's authors, and we all owe Mike an enormous debt for both the original work on \HOL, and for the way he and his group supported our own development as researchers and \HOL{} hackers.
|
/seL4-l4v-10.1.1/HOL4/Manual/Logic/ |
H A D | preface.tex | 50 other logics eventually be tried in place of the original logic. The 56 The original \LCF\ was implemented at Edinburgh in the early 1970's, and is now 68 released (in 1988), after the original \HOL\ system had been in use
|
/seL4-l4v-10.1.1/seL4/manual/parts/ |
H A D | cspace.tex | 86 the original and a different guard (see 92 capability has the same badge and guard as the original. 100 original copy remaining. 154 capabilities may be manufactured from this original capability, using 183 only \emph{original} capabilities support derivation invocations, but 222 are the original capability to the respective object, both are 225 Ordinary original capabilities can have one level of derived 230 The original \obj{Endpoint} or \emph{Notification} capability will be unbadged. Using 233 an original capability (the ``original badge [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/CodeTree/ |
H A D | CODETREE_CODEGEN_CONSTANT_FUNCTIONS.sml | 252 fun codeGenerate(original, nLocals, debugArgs) = 270 val resultCode = mapCodetree (cgFuns context) original 310 val newProps = extractProps original
|
/seL4-l4v-10.1.1/HOL4/polyml/basis/ |
H A D | PolyMLException.sml | 53 it is often better to preserve the original location. We need to add
|
H A D | PrettyPrinter.sml | 20 (* This is a complete rewrite of the original pretty printer. The original
|
/seL4-l4v-10.1.1/isabelle/src/Tools/jEdit/src/ |
H A D | completion_popup.scala | 196 case Some(text) if text == item.original => 203 (0 until Character.codePointCount(item.original, 0, item.original.length)) 461 case Some(text) if text == item.original =>
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/jEdit/src/ |
H A D | completion_popup.scala | 196 case Some(text) if text == item.original => 203 (0 until Character.codePointCount(item.original, 0, item.original.length)) 461 case Some(text) if text == item.original =>
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/ |
H A D | basicio.cpp | 6 Portions of this code are derived from the original stream io 706 /* Remember our original position, seek to the end, then seek back. */ 707 long original = seekStream(taskData, strm, 0L, SEEK_CUR); 709 if (seekStream(taskData, strm, original, SEEK_SET) != original) 711 return Make_fixed_precision(taskData, endOfStream-original); 1562 /* Remember our original position, seek to the end, then seek back. */ 1563 long original = seekStream(taskData, str, 0L, SEEK_CUR); 1565 if (seekStream(taskData, str, original, SEEK_SET) != original) [all...] |