Package com.asakusafw.compiler.flow.stage.StageModel

Examples of com.asakusafw.compiler.flow.stage.StageModel.Fragment

212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
            // rendezvous
            for (ReduceUnit unit : reduceUnits) {
                if (unit.canCombine() == false) {
                    continue;
                }
                Fragment first = unit.getFragments().get(0);
                SimpleName rendezvousName = names.create("combine");
                rendezvousNames.put(first, rendezvousName);
                fields.add(factory.newFieldDeclaration(
                        null,
                        new AttributeBuilder(factory)
                            .Private()
                            .toAttributes(),
                        importer.toType(first.getCompiled().getQualifiedName()),
                        rendezvousName,
                        null));
            }
            return fields;
        }
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
259
260
                segments.put(segment.getPort(), segment);
            }

            // rendezvous
            for (Map.Entry<Fragment, SimpleName> entry : rendezvousNames.entrySet()) {
                Fragment fragment = entry.getKey();
                Type rendezvousType = importer.toType(fragment.getCompiled().getQualifiedName());
                List<Expression> arguments = Lists.create();
                for (FlowElementInput input : fragment.getInputPorts()) {
                    Segment segment = segments.get(input);
                    assert segment != null;
                    SimpleName shuffleName = shuffleNames.get(segment);
                    assert shuffleName != null;
                    arguments.add(new ExpressionBuilder(factory, factory.newThis())
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
233
                if (saw.contains(node)) {
                    continue;
                }
                saw.add(node);
                graph.addNode(node);
                Fragment fragment = (Fragment) node.getValue();
                for (FlowElementInput input : fragment.getInputPorts()) {
                    for (FlowElementOutput pred : input.getOpposites()) {
                        List<FragmentNode> sources = nodes.get(pred);
                        if (sources == null) {
                            continue;
                        }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
        environment.getOptions().setEnableCombiner(combine);
        List<StageModel> stages = compile(SummarizeFlowTrivial.class);
        StageModel stage = stages.get(0);
        Assume.assumeThat(stage.getReduceUnits().size(), is(1));
        ReduceUnit reduce = stage.getReduceUnits().get(0);
        Fragment fragment = reduce.getFragments().get(0);
        Name name = fragment.getCompiled().getQualifiedName();

        ClassLoader loader = start();
        PortMapper mapper = new PortMapper(fragment);
        MockResult<ExSummarized> result = mapper.create("out");

        @SuppressWarnings("unchecked")
        Rendezvous<Writable> f = (Rendezvous<Writable>) create(loader, name, mapper.toArguments());

        Segment segment = stage.getShuffleModel().findSegment(fragment.getInputPorts().get(0));
        SegmentedWritable value = createShuffleValue(loader, stage);

        ExSummarized ex1 = new ExSummarized();
        ex1.setCount(1);
        f.begin();
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
     * 自明な構造を持つテスト。
     */
    @Test
    public void trivial() {
        List<StageModel> stages = compile(SplitFlowTrivial.class);
        Fragment fragment = stages.get(0).getMapUnits().get(0).getFragments().get(0);
        Name name = fragment.getCompiled().getQualifiedName();

        ClassLoader loader = start();
        PortMapper mapper = new PortMapper(fragment);
        MockResult<Ex1> r1 = mapper.create("ex1");
        MockResult<Ex2> r2 = mapper.create("ex2");
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
        assert fragments != null;
        assert fgraph != null;
        Map<FlowBlock.Input, Graph<Fragment>> streams = new LinkedHashMap<FlowBlock.Input, Graph<Fragment>>();
        for (FlowBlock.Input blockInput : block.getBlockInputs()) {
            FlowElementInput input = blockInput.getElementPort();
            Fragment head = fragments.get(input.getOwner());
            Graph<Fragment> subgraph = createSubgraph(head, fgraph);
            streams.put(blockInput, subgraph);
        }
        List<MapUnit> results = Lists.create();
        for (Map.Entry<FlowBlock.Input, Graph<Fragment>> entry : streams.entrySet()) {
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
        }

        Map<FlowElement, Graph<Fragment>> streams = Maps.create();

        for (FlowElement element : inputGroups.keySet()) {
            Fragment head = fragments.get(element);
            Graph<Fragment> subgraph = createSubgraph(head, fgraph);
            streams.put(element, subgraph);
        }
        List<ReduceUnit> results = Lists.create();
        for (Map.Entry<FlowElement, Graph<Fragment>> entry : streams.entrySet()) {
View Full Code Here
347
348
349
350
351
352
353
354
355
356
357
        Graph<Fragment> result = Graphs.newInstance();
        for (Fragment fragment : fragments.values()) {
            result.addNode(fragment);
            for (FlowElementOutput output : fragment.getOutputPorts()) {
                for (FlowElementInput next : output.getOpposites()) {
                    Fragment successor = fragments.get(next.getOwner());
                    assert successor != null;
                    result.addEdge(fragment, successor);
                }
            }
        }
View Full Code Here
363
364
365
366
367
368
369
370
371
372
373
            Set<FlowElement> startElements) {
        assert context != null;
        assert startElements != null;
        Map<FlowElement, Fragment> results = Maps.create();
        for (FlowElement element : startElements) {
            Fragment fragment = getFragment(context, element, startElements);
            assert results.containsKey(element) == false;
            results.put(element, fragment);
        }
        return results;
    }
View Full Code Here
400
401
402
403
404
405
406
            if (startElements.contains(next)) {
                break;
            }
            current = next;
        }
        return new Fragment(context.getNextFragmentNumber(), factors, resources);
    }
View Full Code Here
TOP

Related Classes of com.asakusafw.compiler.flow.stage.StageModel.Fragment

  • com.asakusafw.compiler.flow.processor.BranchFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.CoGroupFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.ConvertFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.ExtendFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.ExtractFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.GroupSortFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.LoggingFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.ProjectFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.RestructureFlowProcessorTest
  • com.asakusafw.compiler.flow.processor.SplitFlowProcessorTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.