/seL4-l4v-10.1.1/graph-refine/graph-to-graph/chronos/ |
H A D | emitter.py | 65 size = 4 112 for addr in xrange (first_addr, last_addr + size, size): 118 self.emitNop(addr, size) 135 (size,value) = ef.literals[addr] 136 self.imm_f.write('v %s %s %d\n'% (hex(addr),value,size)) 149 def emitNop(self, addr, size): 150 s = 'i %s %d startbb edges end nop _ _' % (hex(addr), size) 176 #all insts are of size 4
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/nios2/ |
H A D | sysv.S | 87 .size ffi_call_sysv, .-ffi_call_sysv 135 .size ffi_closure_sysv, .-ffi_closure_sysv
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/powerpc/ |
H A D | ffi.c | 81 can write r3 and r4 to memory without worrying about struct size. 97 ecif.rvalue = alloca (cif->rtype->size); 108 unsigned int rsize = cif->rtype->size; 110 /* The SYSV ABI returns a structure of up to 4 bytes in size 117 /* The SYSV ABI returns a structure of up to 8 bytes in size 119 structure of up to 8 bytes in size left-padded in r3. */
|
H A D | linux64.S | 54 .size ffi_call_LINUX64,24 206 .size ffi_call_LINUX64,.-ffi_call_LINUX64 209 .size ffi_call_LINUX64,.-.L.ffi_call_LINUX64 211 .size .ffi_call_LINUX64,.-.ffi_call_LINUX64 225 .uleb128 0x1 # Augmentation size 238 .uleb128 0x0 # Augmentation size
|
/seL4-l4v-10.1.1/isabelle/src/Tools/Metis/src/ |
H A D | PortableMosml.sml | 133 val sizeP = size p 134 and sizeS = size s 150 val sizeP = size p 151 and sizeS = size s
|
H A D | Units.sig | 23 val size : units -> int value
|
H A D | Heap.sml | 37 fun size (Heap (_, n, _)) = n; function 39 fun null h = size h = 0; 75 "Heap[" ^ (if null h then "" else Int.toString (size h)) ^ "]";
|
H A D | KeyMap.sml | 59 {size : int, 83 | T (Node {size,left,right,...}) => 88 val () = if l + 1 + r = size then () else raise Bug "wrong size" 90 size 158 fun nodeSize (Node {size = x, ...}) = x; 167 val size = treeSize left + 1 + treeSize right value 170 {size = size, 219 val size value 484 val size = size - 1 value 501 val size = size - 1 value 851 val size = size - 1 value 870 val size = size - 1 value 1049 fun size (Map tree) = treeSize tree; function [all...] |
H A D | Map.sml | 51 {size : int, 75 | T (Node {size,left,right,...}) => 80 val () = if l + 1 + r = size then () else raise Bug "wrong size" 82 size 150 fun nodeSize (Node {size = x, ...}) = x; 159 val size = treeSize left + 1 + treeSize right value 162 {size = size, 211 val size value 476 val size = size - 1 value 493 val size = size - 1 value 843 val size = size - 1 value 862 val size = size - 1 value 1041 fun size (Map (_,tree)) = treeSize tree; function [all...] |
H A D | Model.sml | 71 (* Model size. *) 74 type size = {size : int}; type 77 (* A model of size N has integer elements 0...N-1. *) 84 fun incrementElement {size = N} i = 91 fun elementListSpace {size = N} arity = 96 fun elementListIndex {size = N} = 110 type fixedFunction = size -> element list -> element option; 112 type fixedRelation = size -> element list -> bool option; 380 fun modN {size 952 fun size (Model {size = N, ...}) = N; function [all...] |
/seL4-l4v-10.1.1/HOL4/polyml/basis/ |
H A D | ForeignConstants.sml | 32 val (size: word, align: word, _, _) = (* Just get the first two fields. *) value 35 {size=size, align=align} 63 (* Minimum argument size. *)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Metis/src/ |
H A D | PortableMosml.sml | 133 val sizeP = size p 134 and sizeS = size s 150 val sizeP = size p 151 and sizeS = size s
|
H A D | Units.sig | 23 val size : units -> int value
|
H A D | Heap.sml | 37 fun size (Heap (_, n, _)) = n; function 39 fun null h = size h = 0; 75 "Heap[" ^ (if null h then "" else Int.toString (size h)) ^ "]";
|
H A D | KeyMap.sml | 59 {size : int, 83 | T (Node {size,left,right,...}) => 88 val () = if l + 1 + r = size then () else raise Bug "wrong size" 90 size 158 fun nodeSize (Node {size = x, ...}) = x; 167 val size = treeSize left + 1 + treeSize right value 170 {size = size, 219 val size value 484 val size = size - 1 value 501 val size = size - 1 value 851 val size = size - 1 value 870 val size = size - 1 value 1049 fun size (Map tree) = treeSize tree; function [all...] |
H A D | Map.sml | 51 {size : int, 75 | T (Node {size,left,right,...}) => 80 val () = if l + 1 + r = size then () else raise Bug "wrong size" 82 size 150 fun nodeSize (Node {size = x, ...}) = x; 159 val size = treeSize left + 1 + treeSize right value 162 {size = size, 211 val size value 476 val size = size - 1 value 493 val size = size - 1 value 843 val size = size - 1 value 862 val size = size - 1 value 1041 fun size (Map (_,tree)) = treeSize tree; function [all...] |
H A D | Model.sml | 71 (* Model size. *) 74 type size = {size : int}; type 77 (* A model of size N has integer elements 0...N-1. *) 84 fun incrementElement {size = N} i = 91 fun elementListSpace {size = N} arity = 96 fun elementListIndex {size = N} = 110 type fixedFunction = size -> element list -> element option; 112 type fixedRelation = size -> element list -> bool option; 380 fun modN {size 952 fun size (Model {size = N, ...}) = N; function [all...] |
/seL4-l4v-10.1.1/HOL4/src/metis/ |
H A D | mlibLiteralnet.sml | 43 fun pos ((pos, _ ), _ ) = T.size pos; 44 fun neg ((_, neg), _ ) = T.size neg; 48 fun size l = truth l + falsity l + pos l + neg l; function
|
H A D | mlibModel.sig | 14 (* Note: a model of size N has integer elements 0...N-1 *) 28 type parameters = {size : int, fix : fix} 38 val size : model -> int value
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/ |
H A D | memmgr.h | 139 bool InitSpace(POLYUNSIGNED size, bool mut); 209 LocalMemSpace *CreateAllocationSpace(POLYUNSIGNED size); 211 LocalMemSpace *NewLocalSpace(POLYUNSIGNED size, bool mut); 228 CodeSpace *NewCodeSpace(POLYUNSIGNED size); 241 StackSpace *NewStackSpace(POLYUNSIGNED size); 251 PermanentMemSpace *NewExportSpace(POLYUNSIGNED size, bool mut, bool noOv, bool code); 361 // The default size in words when creating new segments. 367 // The current sizes of the allocation space and the total heap size.
|
/seL4-l4v-10.1.1/seL4/libsel4/tools/ |
H A D | bitfield_gen.py | 42 # Isabelle word size suffixes for return value names 1184 def field_mask_proof(base, base_bits, sign_extend, high, size): 1188 return "NOT (mask %d)" % (base_bits - size) 1190 return "(mask %d << %d)" % (size, base_bits - size) 1192 return "mask %d" % size 1225 # Ensure that block sizes and tag size & position match for 1239 union_size = ref.size 1240 elif union_size != ref.size: 1383 offset, size, hig [all...] |
/seL4-l4v-10.1.1/seL4/manual/tools/libsel4_tools/ |
H A D | bitfield_gen.py | 42 # Isabelle word size suffixes for return value names 1184 def field_mask_proof(base, base_bits, sign_extend, high, size): 1188 return "NOT (mask %d)" % (base_bits - size) 1190 return "(mask %d << %d)" % (size, base_bits - size) 1192 return "mask %d" % size 1225 # Ensure that block sizes and tag size & position match for 1239 union_size = ref.size 1240 elif union_size != ref.size: 1383 offset, size, hig [all...] |
/seL4-l4v-10.1.1/seL4/tools/ |
H A D | bitfield_gen.py | 42 # Isabelle word size suffixes for return value names 1184 def field_mask_proof(base, base_bits, sign_extend, high, size): 1188 return "NOT (mask %d)" % (base_bits - size) 1190 return "(mask %d << %d)" % (size, base_bits - size) 1192 return "mask %d" % size 1225 # Ensure that block sizes and tag size & position match for 1239 union_size = ref.size 1240 elif union_size != ref.size: 1383 offset, size, hig [all...] |
/seL4-l4v-10.1.1/HOL4/Manual/Tools/ |
H A D | polyscripter.sml | 48 val sz = size s 101 val term = if size noNLsfx = 0 then "" else "\n" 115 if Substring.size r <> 0 then 120 if Substring.size r <> 0 then 133 | SOME (sfx,rep) => SOME (String.substring(s, 0, size s - size sfx) ^ rep) 157 if size sn <> 0 andalso string rest = " subgoals" then SOME (string p) 165 String.extract(s, 0, SOME (size s - (size sfx + 1))) ^ "\n" 182 if size csf [all...] |
/seL4-l4v-10.1.1/HOL4/examples/l3-machine-code/lib/ |
H A D | FP64.sml | 20 val size = 8 * bytes value 24 ( IntInf.toInt (BitsN.size w) = size orelse 25 raise Fail ("fromBits: not " ^ Int.toString size ^ "-bit word") 92 val sign_bit = BitsN.#>> (BitsN.B (1, IntInf.fromInt size), 1)
|