Lines Matching defs:in_edges
185 /* Admin information for chaining. 'in_edges' is a set of the
191 blocks. The 'in_edges' contain slightly more info, enough
194 'in_edges' entries of all blocks we're patched through to, in
252 This means in turn that B's in_edges set can list A more than
262 times in its in_edges. To make things simpler, we then
269 and in_edges sets really do have both have set semantics.
273 and B.in_edges = { (A,42), (A,87) } (in any order)
276 mapping between P.out_edges and Q.in_edges.
278 InEdgeArr in_edges;
789 InEdgeArr__add(&to_tte->in_edges, &ie);
846 n = InEdgeArr__size(&here_tte->in_edges);
848 InEdge* ie = InEdgeArr__index(&here_tte->in_edges, i);
872 // Find the corresponding entry in the "to" node's in_edges,
875 m = InEdgeArr__size(&to_tte->in_edges);
878 InEdge* ie = InEdgeArr__index(&to_tte->in_edges, j);
884 InEdgeArr__deleteIndex(&to_tte->in_edges, j);
887 InEdgeArr__makeEmpty(&here_tte->in_edges);
