/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/testsuite/libffi.call/ |
H A D | testclosure.c | 48 cls_struct_type0.size = 0;
|
H A D | uninitialized.c | 29 ts1_type.size = 0;
|
/seL4-l4v-10.1.1/isabelle/src/Tools/Metis/src/ |
H A D | Subst.sml | 25 fun size (Subst m) = NameMap.size m; function 59 if NameMap.size m = NameMap.size m' then sub else Subst m' 94 if NameMap.size m = NameMap.size m' then sub else Subst m' 103 if NameMap.size m = NameMap.size m' then sub else Subst m'
|
H A D | Subsume.sml | 98 fun size (Subsume {empty, unit, nonunit = {clauses,...}}) = function 99 length empty + LiteralNet.size unit + IntMap.size clauses; 118 val id_length = (nextId, LiteralSet.size cl') 145 if IntMap.size clauses = IntMap.size clauses' then nonunit 160 fun toString subsume = "Subsume{" ^ Int.toString (size subsume) ^ "}"; 274 genSubsumes pred subsume (SOME (LiteralSet.size cl)) cl; 331 if LiteralSet.size cl' > LiteralSet.size c [all...] |
H A D | Waiting.sml | 55 fun size (Waiting {clauses,...}) = Heap.size clauses; function 59 (fn w => "Waiting{" ^ Int.toString (size w) ^ "}") 90 val N = {size = Model.size M} 149 Real.fromInt (NameSet.size (LiteralSet.freeVars cl) + 1); 151 fun clauseLiterals cl = Real.fromInt (LiteralSet.size cl);
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Metis/src/ |
H A D | Subst.sml | 25 fun size (Subst m) = NameMap.size m; function 59 if NameMap.size m = NameMap.size m' then sub else Subst m' 94 if NameMap.size m = NameMap.size m' then sub else Subst m' 103 if NameMap.size m = NameMap.size m' then sub else Subst m'
|
H A D | Subsume.sml | 98 fun size (Subsume {empty, unit, nonunit = {clauses,...}}) = function 99 length empty + LiteralNet.size unit + IntMap.size clauses; 118 val id_length = (nextId, LiteralSet.size cl') 145 if IntMap.size clauses = IntMap.size clauses' then nonunit 160 fun toString subsume = "Subsume{" ^ Int.toString (size subsume) ^ "}"; 274 genSubsumes pred subsume (SOME (LiteralSet.size cl)) cl; 331 if LiteralSet.size cl' > LiteralSet.size c [all...] |
H A D | Waiting.sml | 55 fun size (Waiting {clauses,...}) = Heap.size clauses; function 59 (fn w => "Waiting{" ^ Int.toString (size w) ^ "}") 90 val N = {size = Model.size M} 149 Real.fromInt (NameSet.size (LiteralSet.freeVars cl) + 1); 151 fun clauseLiterals cl = Real.fromInt (LiteralSet.size cl);
|
/seL4-l4v-10.1.1/seL4/include/arch/x86/arch/kernel/ |
H A D | multiboot.h | 30 uint32_t size; member in struct:multiboot_mmap
|
/seL4-l4v-10.1.1/seL4/src/plat/spike/machine/ |
H A D | fdt.c | 172 uint64_t base, size; local 174 value = fdt_get_size (node->parent, value, &size); 176 base, base + size 178 printf("Failed to add physical memory region %llu-%llu\n", (unsigned long long)base, (unsigned long long)(base + size));
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/s390/ |
H A D | sysv.S | 113 .size ffi_call_SYSV,.ffi_call_SYSV_end-ffi_call_SYSV 152 .size ffi_closure_SYSV,.ffi_closure_SYSV_end-ffi_closure_SYSV 165 .uleb128 0x1 # Augmentation size 178 .uleb128 0x0 # Augmentation size 217 .uleb128 0x0 # Augmentation size 317 .size ffi_call_SYSV,.ffi_call_SYSV_end-ffi_call_SYSV 350 .size ffi_closure_SYSV,.ffi_closure_SYSV_end-ffi_closure_SYSV 364 .uleb128 0x1 # Augmentation size 377 .uleb128 0x0 # Augmentation size 416 .uleb128 0x0 # Augmentation size [all...] |
/seL4-l4v-10.1.1/HOL4/src/portableML/poly/ |
H A D | Intset.sml | 34 * they keep the size of the tree in the node, giving a constant 35 * time size operation. 72 fun size E = 0 function 73 | size (T(_,n,_,_)) = n 75 (*fun N(v,l,r) = T(v,1+size(l)+size(r),l,r)*) 108 let val rln = size rl 109 val rrn = size rr 115 let val lln = size ll 116 val lrn = size l [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/mips/ |
H A D | ffi.c | 123 z = (*p_arg)->size; 129 /* The size of a pointer depends on the ABI */ 190 memcpy(argp, *p_argv, (*p_arg)->size); 258 *loc += e->size; 261 *loc += e->size; 284 if (arg->size > 16) 287 if (arg->size > 8) 603 ecif.rvalue = alloca(cif->rtype->size); 626 if (cif->rtype->type == FFI_TYPE_STRUCT && cif->rtype->size < 16) 647 memcpy(ecif.rvalue, rvalue_copy + copy_offset, cif->rtype->size); [all...] |
/seL4-l4v-10.1.1/HOL4/examples/elliptic/ |
H A D | Map.sml | 28 {size : int, 56 T {size = 1, priority = randomPriority (), 77 | checkSizes (T {size,left,right,...}) = 81 val () = if l + 1 + r = size then () else raise Error "wrong size" 83 size 144 | treeSize (T {size = s, ...}) = s; 146 fun size (Map (_,tree)) = treeSize tree; function 149 T {size = treeSize l + 1 + treeSize r, priority = p, 229 if treeSize l2 + treeSize r2 = #size x 337 val {size = s1, priority = p1, value 369 val {size = s1, left = l1, key = k1, right = r1, ...} = x1 value 370 and {size = s2, ...} = x2 value 394 val {size = s1, left = l1, key = k1, right = r1, ...} = x1 value 395 and {size = s2, ...} = x2 value [all...] |
/seL4-l4v-10.1.1/HOL4/examples/lambda/other-models/ |
H A D | gmtermScript.sml | 56 ["LAM", "VAR", "CON", "@@", "FV", "SUB", "ABS", "size"] 410 size of a term 413 val size_def = Define`size t = nc$size (from_term t)`; 417 ``(size (VAR s) = 1) /\ 418 (size (t @@ u) = size t + size u + 1) /\ 419 (size (LAM v t) = size [all...] |
/seL4-l4v-10.1.1/HOL4/tools/Holmake/ |
H A D | Holmake_types.sml | 36 string (slice(ss, 0, SOME(Int.min(size ss, 10))))) 59 val acc = if size normal > 0 then LIT (string normal) :: acc 69 if size rest = 0 then List.rev acc 79 if size rest > 0 andalso sub(rest,0) = #"\n" andalso 136 if size bslashes mod 2 = 0 then ok 137 else if size spaces > 0 then 138 slice(ss, 0, SOME (size ok + 1)) 148 if size ss2 = 0 then concat (List.rev (ss1::acc)) 180 splitAt(rest, size rest - 1) 189 if size s [all...] |
/seL4-l4v-10.1.1/HOL4/examples/muddy/muddyC/buddy/src/ |
H A D | bddop.c | 271 The default is a fixed cache size determined at 2363 double size=1; local 2368 size = pow(2.0, (double)LEVEL(r)); 2370 return size * satcount_rec(r); 2395 double size, s; local 2405 size = 0; 2409 size += s * satcount_rec(LOWp(node)); 2413 size += s * satcount_rec(HIGHp(node)); 2417 entry->r.dres = size; 2419 return size; 2444 double size; local 2479 double size, s1,s2; local 2645 double size; local [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/ |
H A D | pexport.cpp | 76 size_t lower = 0, upper = pMap.size(); 81 ASSERT(middle < pMap.size()); 277 fprintf(exportFile, "Objects\t%" PRI_SIZET "\n", pMap.size()); 361 POLYUNSIGNED size = defaultSize; 362 if (size <= objWords) 363 size = objWords+1; 364 size_t iSpace = size*sizeof(PolyWord); 499 ASSERT(gMem.pSpaces.size() == 0); 500 ASSERT(gMem.eSpaces.size() == 0); 581 /* Add in the size o [all...] |
H A D | exporter.cpp | 142 ASSERT(gMem.eSpaces.size() == 0); 146 // want to use a smaller size because they are retained after we save 151 graveYard = new GraveYard[gMem.pSpaces.size()]; 155 Log("SAVE: Unable to allocate graveyard, size: %lu.\n", gMem.pSpaces.size()); 166 POLYUNSIGNED size = (space->top-space->bottom)/4; local 168 defaultNoOverSize += size; 170 defaultMutSize += size; 172 defaultCodeSize += size; 174 defaultImmSize += size; 198 POLYUNSIGNED size = space->allocatedSpace(); local 215 POLYUNSIGNED size = space->spaceSize(); local [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/basis/ |
H A D | PrettyPrinter.sml | 78 val size = FixedInt.fromInt(String.size st) value 80 if size <= spaceLeft 81 then SOME(spaceLeft-size) 121 the total size. *) 151 doPrint(rest, 0, left - FixedInt.fromInt(size s)) 182 ( stream st; FixedInt.max(spaceLeft- FixedInt.fromInt(String.size st), 0) )
|
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/MLCompiler/ |
H A D | Pretty.sml | 155 val size = String.size (projPrettyString p) value 157 if size <= spaceLeft 158 then SOME(spaceLeft-size) 193 the total size. *) 223 doPrint(rest, left-size s) 246 stream st; Int.max(spaceLeft-String.size st, 0) 287 if Substring.size b = 0 (* No newline. *) 308 val (spaces, nextTab) = findTab(size f, tabs)
|
/seL4-l4v-10.1.1/HOL4/examples/l3-machine-code/lib/ |
H A D | L3.sml | 84 if String.size s = 1 then String.sub (s, 0) else raise Domain 116 val size = IntInf.fromInt o String.size value
|
/seL4-l4v-10.1.1/HOL4/examples/machine-code/just-in-time/ |
H A D | export_codeLib.sml | 44 fun fill c d n s = if size s < n then fill c d n (c ^ s ^ d) else s 67 val o2 = "\t/* " ^ fill "" " " (size l1) l2 ^ " */\n" 68 val o3 = "\t/* " ^ fill "" " " (size l1) l3 ^ " */\n"
|
/seL4-l4v-10.1.1/HOL4/examples/machine-code/lisp/ |
H A D | export_codeLib.sml | 44 fun fill c d n s = if size s < n then fill c d n (c ^ s ^ d) else s 67 val o2 = "\t/* " ^ fill "" " " (size l1) l2 ^ " */\n" 68 val o3 = "\t/* " ^ fill "" " " (size l1) l3 ^ " */\n"
|
/seL4-l4v-10.1.1/HOL4/examples/theorem-prover/lisp-runtime/implementation/ |
H A D | export_codeLib.sml | 49 fun fill c d n s = if size s < n then fill c d n (c ^ s ^ d) else s 72 val o2 = "\t/* " ^ fill "" " " (size l1) l2 ^ " */\n" 73 val o3 = "\t/* " ^ fill "" " " (size l1) l3 ^ " */\n"
|