Searched refs:nodes (Results 1 - 25 of 153) sorted by relevance

1234567

/seL4-l4v-10.1.1/seL4/src/smp/
H A Dlock.c24 big_kernel_lock.node_owners[i].node = &big_kernel_lock.nodes[i];
28 big_kernel_lock.nodes[CONFIG_MAX_NUM_NODES].value = CLHState_Granted;
29 big_kernel_lock.head = &big_kernel_lock.nodes[CONFIG_MAX_NUM_NODES];
/seL4-l4v-10.1.1/graph-refine/graph-to-graph/
H A Ddot_utils.py21 nodes = {}
31 if [x for x in p.nodes[n].get_conts() if x not in ns and not x == 'Err']:
33 nodes[n] = pydot.Node(n_cap,color="blue")
35 nodes[n] = pydot.Node(n_cap)
36 for n in nodes:
37 graph.add_node(nodes[n])
40 conts = p.nodes[n].get_conts()
43 graph.add_edge(pydot.Edge(nodes[n],nodes[c]))
53 nodes
[all...]
H A Dcall_graph_utils.py18 call_node_indexes = [x for x in g.nodes if g.nodes[x].kind == 'Call']
19 call_targs = [g.nodes[x].get_args()[0] for x in call_node_indexes]
48 nodes = {}
66 nodes[f] = pydot.Node(f)
67 graph.add_node(nodes[f])
73 if ff not in nodes:
74 nodes[ff] = pydot.Node(ff,Nodestyle="dotted")
75 graph.add_node(nodes[ff])
76 assert nodes[
[all...]
H A Daddr_utils.py15 ret = [n for n in p.nodes if isCall(p.nodes[n])]
17 ret = [n for n in ret if p.nodes[n].fname in fs]
H A Dimm_utils.py145 #determine, for all imm nodes, the number of edges going into them
147 nodes = imm_fun.imm_nodes
148 nodes[imm_fun.imm_entry].n_edges_to = 1
149 for n in nodes:
150 node = nodes[n]
154 nodes[e.targ].n_edges_to += 1
155 nodes[e.targ].edges_to.append(n)
157 nodes[node.call_edge.targ].n_edges_to += 1
158 nodes[node.call_edge.targ].edges_to.append(n)
160 if node.call_ret_edge.targ not in nodes
[all...]
H A Delf_correlate.py268 if isCall(p.nodes[p_n]):
279 if not isCall(self.f_problems[cont_f].nodes[cont_n]):
292 fname = self.f_problems[f].nodes[p_n].fname
333 #print 'f %s, p.nodes: %d' % (f,len(p.nodes) )
344 for p_n in p.nodes:
371 for p_n in p.nodes:
390 if isCall(p.nodes[p_n]):
443 p_node = p.nodes[p_n]
504 next_addrs = p.nodes[call_p
[all...]
/seL4-l4v-10.1.1/HOL4/tools/mlyacc/src/
H A Dgraph.sml46 nodes: core list,nodeArray : core array}
48 val nodes = fn ({nodes,...} : graph) => nodes value
49 val shift = fn ({edges,nodes,...} : graph) => fn a as (i,sym) =>
64 fun add_goto ((symbol,a),(nodes,edges,future,num)) =
65 case find(CORE (a,0),nodes)
69 in (insert(core,nodes),edge::edges,
74 in (nodes,edge::edges,future,num)
76 fun f (nodes,node_lis
86 let val (nodes,edges,future,num) = value
107 val nodes = nodes g value
[all...]
/seL4-l4v-10.1.1/graph-refine/
H A Dproblem.py30 self.nodes = {}
50 return 'FAILED %s (size %05d)' % (self.name, len(self.nodes))
70 self.nodes = {}
73 self.nodes[n] = fun.nodes[n]
80 self.next_node_name = max (self.nodes.keys () + [2]) + 1
94 check_no_symbols ([fun.nodes[n] for n in ns])
101 self.nodes[node_renames[n]] = syntax.copy_rename (
102 fun.nodes[n], (vs, node_renames))
149 for node in self.nodes
[all...]
H A Dlogic.py627 def compute_preds (nodes):
628 preds = dict_list ([(c, n) for n in nodes
629 for c in nodes[n].get_conts ()],
630 keys = nodes)
647 def compute_var_flows (nodes, outputs, preds, override_lvals_rvals = {}):
651 for (n, node) in nodes.iteritems ():
675 for n in nodes:
690 def cont_with_conds (nodes, n, conds):
692 if n not in nodes or nodes[
[all...]
H A Dpseudo_compile.py308 max_node = max (function.nodes.keys () + [2])
326 for n in function.nodes:
327 node = function.nodes[n]
346 for node in func.nodes.itervalues ():
376 for (n, node) in func.nodes.items ():
377 func.nodes[n] = node.subst_exprs (subst_expr,
380 def nodes_symbols (nodes):
385 for node in nodes:
392 for node in func.nodes.itervalues ()])
404 def combine_duplicate_nodes (nodes)
[all...]
H A Dstack_logic.py164 for n in p.nodes:
165 if p.nodes[n].kind != 'Call':
167 if get_asm_callable (p.nodes[n].fname):
272 if preserves_sp (rep.p.nodes[n_vc[0]].fname)]
317 for n in p.nodes:
320 elif p.nodes[n].kind != 'Call':
322 ps = pseudo_node_lvals_rvals (p.nodes[n])
510 ns = [n for n in p.nodes if p.node_tags[n][0] == tag]
514 for ptr in (stack_virtualise_node (p.nodes[n], None))[0]]))
541 (_, node) = stack_virtualise_node (p.nodes[
[all...]
H A Dc_rodata.py17 for (kind, ptr, v, m) in p.nodes[n].get_mem_accesses ()
/seL4-l4v-10.1.1/isabelle/src/Tools/Graphview/
H A Dpopups.scala30 nodes: List[Graph_Display.Node], reverse: Boolean, caption: String, edges: Boolean) =
35 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, false, false)))
41 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, true, true)))
47 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, false, true)))
53 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, true, false)))
59 from <- nodes.iterator
H A Dtree_panel.scala4 Tree view on graph nodes.
69 private var nodes = List.empty[Graph_Display.Node]
106 tooltip = "Selection of nodes via regular expression"
126 (for { (node, i) <- nodes.iterator.zipWithIndex if selection_filter(node) }
154 if (new_nodes != nodes) {
157 nodes = new_nodes
160 for (node <- nodes) root.add(new DefaultMutableTreeNode(node))
/seL4-l4v-10.1.1/l4v/isabelle/src/Tools/Graphview/
H A Dpopups.scala30 nodes: List[Graph_Display.Node], reverse: Boolean, caption: String, edges: Boolean) =
35 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, false, false)))
41 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, true, true)))
47 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, false, true)))
53 add_mutator(Mutator.make(graphview, Mutator.Node_List(nodes, reverse, true, false)))
59 from <- nodes.iterator
H A Dtree_panel.scala4 Tree view on graph nodes.
69 private var nodes = List.empty[Graph_Display.Node]
106 tooltip = "Selection of nodes via regular expression"
126 (for { (node, i) <- nodes.iterator.zipWithIndex if selection_filter(node) }
154 if (new_nodes != nodes) {
157 nodes = new_nodes
160 for (node <- nodes) root.add(new DefaultMutableTreeNode(node))
/seL4-l4v-10.1.1/isabelle/src/Pure/System/
H A Dnuma.scala4 Support for Non-Uniform Memory Access of separate CPU nodes.
12 /* available nodes */
14 def nodes(): List[Int] =
43 /* shuffling of CPU nodes */
48 if (nodes().length < 2) Some("no NUMA nodes available")
54 case Some(s) => progress.echo_warning("Shuffling of CPU nodes is disabled: " + s); false
61 private val available = nodes().zipWithIndex
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/System/
H A Dnuma.scala4 Support for Non-Uniform Memory Access of separate CPU nodes.
12 /* available nodes */
14 def nodes(): List[Int] =
43 /* shuffling of CPU nodes */
48 if (nodes().length < 2) Some("no NUMA nodes available")
54 case Some(s) => progress.echo_warning("Shuffling of CPU nodes is disabled: " + s); false
61 private val available = nodes().zipWithIndex
/seL4-l4v-10.1.1/l4v/proof/infoflow/tools/
H A Dauthority2infoflow-CaML.ml105 (* nodes g returns the list of all nodes in the graph g *)
108 let rec nodes g =
125 in unite (map (add_selfedge authorities) (nodes g));;
143 is_in_such (nodes g) (fun a -> is_in g (a,ASyncSend,x) || is_in g (a,SyncSend,x) || is_in g (a,Reset,x))
151 is_in_such (nodes g) h)
158 is_in_such (nodes g) h)
173 in simp_list (subjectReads_aux g l (nodes g) ac)
192 is_in_such (nodes g) f
195 let ep_list = those_is_in_such2 (nodes
[all...]
/seL4-l4v-10.1.1/HOL4/tools/Holmake/
H A DHM_DepGraph.sml60 type t = { nodes : (node, string nodeInfo) Map.dict,
72 val empty = { nodes = Map.mkDict node_compare,
75 fun fupd_nodes f {nodes, target_map, command_map} =
76 {nodes = f nodes, target_map = target_map, command_map = command_map}
83 fun size (g : t) = Map.numItems (#nodes g)
84 fun peeknode (g:t) n = Map.peek(#nodes g, n)
121 ({ nodes = Map.insert(#nodes g,n,nI),
146 (* relying on invariant that all nodes u
[all...]
/seL4-l4v-10.1.1/isabelle/src/Pure/Thy/
H A Dthy_syntax.scala75 var nodes = previous.nodes
80 val node = nodes(name)
89 nodes += (name -> node1)
95 val syntax_changed = nodes.descendants(syntax_changed0.toList)
98 val node = nodes(name)
106 header.imports.map(p => resources.session_base.node_syntax(nodes, p._1)))
111 nodes += (name -> node.update_syntax(syntax))
114 (syntax_changed, nodes, doc_edits.toList)
305 doc_blobs.get(name) orElse previous.nodes(nam
[all...]
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Thy/
H A Dthy_syntax.scala75 var nodes = previous.nodes
80 val node = nodes(name)
89 nodes += (name -> node1)
95 val syntax_changed = nodes.descendants(syntax_changed0.toList)
98 val node = nodes(name)
106 header.imports.map(p => resources.session_base.node_syntax(nodes, p._1)))
111 nodes += (name -> node.update_syntax(syntax))
114 (syntax_changed, nodes, doc_edits.toList)
305 doc_blobs.get(name) orElse previous.nodes(nam
[all...]
/seL4-l4v-10.1.1/HOL4/src/search/
H A DdirGraphScript.sml25 (* from nodes to a finite number of children, i.e., of type 'a -> 'a list *)
34 `REACH_LIST G nodes y = ?x. MEM x nodes /\ y IN REACH G x`;
37 (* Removing a set of nodes ex from G. *)
/seL4-l4v-10.1.1/HOL4/src/metis/
H A DmlibSolver.sml132 (* mlibSolver nodes must construct themselves from the following form. *)
142 (* mlibSolver nodes also incorporate a name. *)
169 (* This allows us to hierarchically arrange solver nodes. *)
220 fun sched nodes =
221 (chatting 3 andalso chat (stat false nodes);
223 (chatting 1 andalso chat "?\n"; S.CONS (NONE, fn () => sched nodes))
225 case choose_subnode nodes of
229 val Subnode {name, used, solns, cost} = List.nth (nodes,n)
241 val nodes = update_nth (K node) n nodes value
[all...]
H A DmlibSolver.sig35 (* mlibSolver nodes must construct themselves from the following form. *)
43 (* mlibSolver nodes also incorporate a name. *)
60 (* This allows us to hierarchically arrange solver nodes. *)

Completed in 98 milliseconds

1234567