Package com.facebook.presto.sql.planner.plan

Examples of com.facebook.presto.sql.planner.plan.PlanNodeId

334
335
336
337
338
339
340
341
342
343
344
345
        // don't update maxAcknowledgedSplit until the end because task sources may not
        // be in sorted order and if we updated early we could skip splits
        long newMaxAcknowledgedSplit = maxAcknowledgedSplit;

        for (TaskSource source : sources) {
            PlanNodeId sourceId = source.getPlanNodeId();
            if (sourceId.equals(partitionedSourceId)) {
                // partitioned split
                ImmutableList.Builder<DriverSplitRunner> runners = ImmutableList.builder();
                for (ScheduledSplit scheduledSplit : source.getSplits()) {
                    // only add a split if we have not already scheduled it
                    if (scheduledSplit.getSequenceId() > maxAcknowledgedSplit) {
View Full Code Here
461
462
463
464
465
466
467
468
469
470
471
            errorCount.set(0);
            errorsSinceLastSuccess.clear();

            // remove acknowledged splits, which frees memory
            for (TaskSource source : sources) {
                PlanNodeId planNodeId = source.getPlanNodeId();
                for (ScheduledSplit split : source.getSplits()) {
                    pendingSplits.remove(planNodeId, split);
                }
            }
View Full Code Here
635
636
637
638
639
640
641
        return new ColumnHandle(DualConnector.CONNECTOR_ID, new DualColumnHandle(name));
    }

    private static PlanNodeId newId()
    {
        return new PlanNodeId(UUID.randomUUID().toString());
    }
View Full Code Here
462
463
464
465
466
467
468
469
470
471
472
            errorCount.set(0);
            errorsSinceLastSuccess.clear();

            // remove acknowledged splits, which frees memory
            for (TaskSource source : sources) {
                PlanNodeId planNodeId = source.getPlanNodeId();
                for (ScheduledSplit split : source.getSplits()) {
                    pendingSplits.remove(planNodeId, split);
                }
            }
View Full Code Here
334
335
336
337
338
339
340
341
342
343
344
345
        // don't update maxAcknowledgedSplit until the end because task sources may not
        // be in sorted order and if we updated early we could skip splits
        long newMaxAcknowledgedSplit = maxAcknowledgedSplit;

        for (TaskSource source : sources) {
            PlanNodeId sourceId = source.getPlanNodeId();
            if (sourceId.equals(partitionedSourceId)) {
                // partitioned split
                ImmutableList.Builder<DriverSplitRunner> runners = ImmutableList.builder();
                for (ScheduledSplit scheduledSplit : source.getSplits()) {
                    // only add a split if we have not already scheduled it
                    if (scheduledSplit.getSequenceId() > maxAcknowledgedSplit) {
View Full Code Here
324
325
326
327
328
329
330
331
332
333
334
335
        // don't update maxAcknowledgedSplit until the end because task sources may not
        // be in sorted order and if we updated early we could skip splits
        long newMaxAcknowledgedSplit = maxAcknowledgedSplit;

        for (TaskSource source : sources) {
            PlanNodeId sourceId = source.getPlanNodeId();
            if (sourceId.equals(partitionedSourceId)) {
                // partitioned split
                for (final ScheduledSplit scheduledSplit : source.getSplits()) {
                    // only add a split if we have not already scheduled it
                    if (scheduledSplit.getSequenceId() > maxAcknowledgedSplit) {
                        // create a new driver for the split
View Full Code Here
461
462
463
464
465
466
467
468
469
470
471
            errorCount.set(0);
            errorsSinceLastSuccess.clear();

            // remove acknowledged splits, which frees memory
            for (TaskSource source : sources) {
                PlanNodeId planNodeId = source.getPlanNodeId();
                for (ScheduledSplit split : source.getSplits()) {
                    pendingSplits.remove(planNodeId, split);
                }
            }
View Full Code Here
280
281
282
283
284
285
286
287
288
289
            return null;
        }

        private void verifyUniqueId(PlanNode node)
        {
            PlanNodeId id = node.getId();
            Preconditions.checkArgument(!nodesById.containsKey(id), "Duplicate node id found %s between %s and %s", node.getId(), node, nodesById.get(id));

            nodesById.put(id, node);
        }
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
    private final ConcurrentMap<PlanNodeId, TaskSource> sources = new ConcurrentHashMap<>();

    public synchronized void updateSource(TaskSource source)
    {
        // does this driver have an operator for the specified source?
        PlanNodeId sourceId = source.getPlanNodeId();
        if (!sourceOperators.containsKey(sourceId)) {
            return;
        }

        // create new source
View Full Code Here
19
20
21
22
23
24
25
{
    private int nextId = 0;

    public PlanNodeId getNextId()
    {
        return new PlanNodeId(Integer.toString(nextId++));
    }
View Full Code Here
TOP

Related Classes of com.facebook.presto.sql.planner.plan.PlanNodeId

  • com.facebook.presto.execution.MockRemoteTaskFactory
  • com.facebook.presto.execution.SqlTaskExecution
  • com.facebook.presto.execution.TestSqlStageExecution
  • com.facebook.presto.execution.TestSqlTaskExecution
  • com.facebook.presto.execution.TestSqlTaskManager
  • com.facebook.presto.operator.Driver
  • com.facebook.presto.operator.index.IndexLoader
  • com.facebook.presto.operator.index.IndexLoader$IndexSnapshotLoader
  • com.facebook.presto.operator.TestDriver
  • com.facebook.presto.operator.TestExchangeOperator
    • 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.