Searched refs:new_node (Results 1 - 14 of 14) sorted by relevance
/seL4-l4v-10.1.1/l4v/tools/autocorres/experiments/alloc-proof/ |
H A D | alloc_lite.c | 119 struct mem_node *new_node = (struct mem_node *)(desired_end + 1); local 120 new_node->size = node_end - desired_end; 121 new_node->next = current->next; 122 current->next = new_node;
|
/seL4-l4v-10.1.1/l4v/tools/autocorres/tests/examples/ |
H A D | alloc.c | 102 struct mem_node *new_node = (struct mem_node *)(desired_end + 1); local 103 new_node->size = node_end - desired_end; 104 new_node->next = current->next; 105 current->next = new_node;
|
/seL4-l4v-10.1.1/isabelle/src/Pure/General/ |
H A D | graph_display.scala | 50 case (g, ((ident, (_, content)), _)) => g.new_node(node(ident), content)
|
H A D | graph.scala | 27 (empty[Key, A](ord) /: entries) { case (graph, ((x, info), _)) => graph.new_node(x, info) } 158 def new_node(x: Key, info: A): Graph[Key, A] = 165 if (defined(x)) this else new_node(x, info)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/General/ |
H A D | graph_display.scala | 50 case (g, ((ident, (_, content)), _)) => g.new_node(node(ident), content)
|
H A D | graph.scala | 27 (empty[Key, A](ord) /: entries) { case (graph, ((x, info), _)) => graph.new_node(x, info) } 158 def new_node(x: Key, info: A): Graph[Key, A] = 165 if (defined(x)) this else new_node(x, info)
|
/seL4-l4v-10.1.1/HOL4/src/portableML/ |
H A D | Graph.sml | 45 val new_node: key * 'a -> 'a T -> 'a T (*exn DUP*) value 200 fun new_node (x, info) (Graph tab) = function 251 |> foldl' (new_node o fst) entries
|
/seL4-l4v-10.1.1/HOL4/src/portableML/poly/concurrent/ |
H A D | Task_Queue.sml | 310 val jobs' = jobs |> Task_Graph.new_node (task, Running thread); 320 val jobs' = jobs |> Task_Graph.new_node (task, Passive abort); 328 |> Task_Graph.new_node (task, Job [job])
|
/seL4-l4v-10.1.1/isabelle/src/Pure/Thy/ |
H A D | export_theory.scala | 51 (Graph.string[Theory] /: thys) { case (g, thy) => g.new_node(thy.name, thy) }
|
H A D | sessions.scala | 622 else graph.new_node(info.name, info)
|
/seL4-l4v-10.1.1/isabelle/src/Tools/Graphview/ |
H A D | layout.scala | 137 ((graph /: dummies)(_.new_node(_, dummy_info)).del_edge(v1, v2) /:
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Thy/ |
H A D | export_theory.scala | 51 (Graph.string[Theory] /: thys) { case (g, thy) => g.new_node(thy.name, thy) }
|
H A D | sessions.scala | 622 else graph.new_node(info.name, info)
|
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Graphview/ |
H A D | layout.scala | 137 ((graph /: dummies)(_.new_node(_, dummy_info)).del_edge(v1, v2) /:
|
Completed in 143 milliseconds