Searched refs:plan (Results 1 - 14 of 14) sorted by relevance

/frameworks/base/telephony/java/android/telephony/
H A DSubscriptionPlan.java40 * Description of a billing relationship plan between a carrier and a specific
166 /** Return the short title of this plan. */
171 /** Return the short summary of this plan. */
220 private final SubscriptionPlan plan; field in class:SubscriptionPlan.Builder
224 plan = new SubscriptionPlan(new RecurrenceRule(start, end, period));
231 * @param start The exact time at which the plan starts.
232 * @param end The exact time at which the plan ends.
247 * When the given period is set to exactly one month, the plan will
250 * before this day, the plan will recur on the last possible instant of
253 * @param start The exact time at which the plan start
[all...]
/frameworks/base/packages/SystemUI/shared/src/com/android/systemui/shared/recents/model/
H A DRecentsTaskLoader.java144 /** Preloads recents tasks using the specified plan to store the output. */
145 public synchronized void preloadTasks(RecentsTaskLoadPlan plan, int runningTaskId) { argument
146 preloadTasks(plan, runningTaskId, ActivityManagerWrapper.getInstance().getCurrentUserId());
149 /** Preloads recents tasks using the specified plan to store the output. */
150 public synchronized void preloadTasks(RecentsTaskLoadPlan plan, int runningTaskId, argument
154 plan.preloadPlan(new PreloadOptions(), this, runningTaskId, currentUserId);
161 public synchronized void loadTasks(RecentsTaskLoadPlan plan, Options opts) { argument
173 plan.executePlan(opts, this);
/frameworks/base/packages/SystemUI/src/com/android/systemui/recents/
H A DRecentsImpl.java156 RecentsTaskLoadPlan plan = new RecentsTaskLoadPlan(mContext);
157 loader.preloadTasks(plan, -1);
158 TaskStack stack = plan.getTaskStack();
171 mBackgroundLayoutAlgorithm.update(plan.getTaskStack(), EMPTY_SET, launchState,
184 loader.loadTasks(plan, launchOpts);
314 // We can use a new plan since the caches will be the same.
316 RecentsTaskLoadPlan plan = new RecentsTaskLoadPlan(mContext);
317 loader.preloadTasks(plan, -1);
322 loader.loadTasks(plan, launchOpts);
507 // Preload only the raw task list into a new load plan (whic
[all...]
/frameworks/base/tests/net/java/com/android/server/net/
H A DNetworkStatsCollectionTest.java284 // No plan
303 for (SubscriptionPlan plan : plans) {
308 history = getHistory(emptyCollection, plan, TIME_A, TIME_C);
312 history = getHistory(collection, plan, TIME_A, TIME_C); i = 0;
340 history = getHistory(collection, plan, TIME_B - HOUR_IN_MILLIS,
349 // Lower anchor in the middle of plan
354 final SubscriptionPlan plan = SubscriptionPlan.Builder
360 history = getHistory(emptyCollection, plan, TIME_A, TIME_C);
364 history = getHistory(collection, plan, TIME_A, TIME_C); i = 0;
395 history = getHistory(collection, plan, TIME_
[all...]
/frameworks/ml/nn/runtime/
H A DExecutionPlan.cpp131 ExecutionStep::ExecutionStep(ExecutionPlan* plan, uint32_t stepIndex, argument
133 : mPlan(plan), mIndex(stepIndex), mSubModel(), mDevice(device) {}
485 const ExecutionPlan* plan,
489 mPlan(plan), mExecutionBuilder(executionBuilder),
767 uint32_t preference, ExecutionPlan* plan) const {
789 plan->becomeSingleStep(nullptr /* CPU */, this);
790 return plan->finish(this, preference);
811 plan->becomeSingleStep(cpu ? nullptr : devices[bestDeviceIndex], this);
812 return plan->finish(this, preference);
857 std::shared_ptr<ExecutionStep> step = plan
484 Controller( const ExecutionPlan* plan, const ExecutionBuilder* executionBuilder, std::shared_ptr<const SubModelInputsAndOutputsType> subModelInputsAndOutputs, uint32_t totalSizeOfTemporaries) argument
[all...]
H A DExecutionBuilder.cpp244 const ExecutionPlan* plan,
249 int n = plan->fallback(controller, &executor);
268 const ExecutionPlan* plan,
272 VLOG(EXECUTION) << "ExecutionBuilder::startCompute (from plan, iteratively)";
276 int n = plan->next(controller, &executor);
294 if (cpuFallbackPartial(executionBuilder, plan, controller, executionCallback)) {
298 // Either successfully executed entire plan on
311 if (cpuFallbackPartial(executionBuilder, plan, controller, executionCallback)) {
315 // Either successfully executed entire plan on
348 // TODO: Remove the non-plan
243 cpuFallbackPartial(const ExecutionBuilder* executionBuilder, const ExecutionPlan* plan, std::shared_ptr<ExecutionPlan::Controller> controller, const sp<ExecutionCallback>& executionCallback) argument
267 asyncStartComputePartitioned(const ExecutionBuilder* executionBuilder, const ExecutionPlan* plan, std::shared_ptr<ExecutionPlan::Controller> controller, bool allowFallback, const sp<ExecutionCallback>& executionCallback) argument
[all...]
H A DModelBuilder.h85 uint32_t preference, ExecutionPlan* plan) const;
H A DExecutionPlan.h17 // Classes used to plan how to execute a model across multiple devices.
47 ExecutionStep(ExecutionPlan* plan,
105 uint32_t mIndex; // index of step within plan
184 Controller(const ExecutionPlan* plan, const ExecutionBuilder* executionBuilder,
258 // executed the plan.
/frameworks/ml/nn/runtime/test/
H A DTestPartitioning.cpp335 ExecutePreference preference, ExecutionPlan* plan) {
337 devices, static_cast<uint32_t>(preference), plan);
794 // for example, verify that each step within the plan has the
892 ExecutionPlan plan; local
893 ASSERT_EQ(model.partitionTheWork(devices, ExecutePreference::PREFER_LOW_POWER, &plan),
895 ASSERT_EQ(plan.forTest_getKind(), ExecutionPlan::Kind::COMPOUND);
896 const auto& steps = plan.forTest_compoundGetSteps();
996 // so there should be no execution plan.
1004 // have an execution plan), discover the dimensionless
1035 // for example, verify that each step within the plan ha
334 partitionTheWork(const std::vector<std::shared_ptr<Device>>& devices, ExecutePreference preference, ExecutionPlan* plan) argument
1044 ExecutionPlan plan; local
[all...]
H A DTestPartitioningRandom.cpp969 const ExecutionPlan& plan = c2->getExecutionPlan(); local
970 switch (plan.forTest_getKind()) {
972 std::cout << "plan: simple" << std::endl;
975 const auto& steps = plan.forTest_compoundGetSteps();
980 std::cout << "plan: compound, " << steps.size() << " steps over "
989 std::cout << "Unexpected plan kind: "
990 << static_cast<unsigned>(plan.forTest_getKind());
/frameworks/compile/libbcc/tools/bcc/
H A DMain.cpp171 std::string plan = optList[i]; local
172 unsigned found = plan.find(':');
174 std::string name = plan.substr(0, found);
178 std::istringstream iss(plan.substr(found + 1));
/frameworks/base/services/core/java/com/android/server/net/
H A DNetworkPolicyManagerService.java297 * No opportunistic quota could be calculated from user data plan or data settings.
325 private static final String TAG_SUBSCRIPTION_PLAN = "subscription-plan";
1182 // far past the plan limits.
1909 final SubscriptionPlan plan = getPrimarySubscriptionPlanLocked(subId);
1910 if (plan == null) continue;
1913 final long limitBytes = plan.getDataLimitBytes();
1924 final Range<ZonedDateTime> cycle = plan.cycleIterator().next();
2048 final SubscriptionPlan plan = plans[0];
2049 policy.cycleRule = plan.getCycleRule();
2050 final long planLimitBytes = plan
[all...]
H A DNetworkStatsService.java683 SubscriptionPlan plan = null;
686 if (LOGD) Slog.d(TAG, "Resolving plan for " + template);
689 plan = LocalServices.getService(NetworkPolicyManagerInternal.class)
694 if (LOGD) Slog.d(TAG, "Resolved to plan " + plan);
696 return plan;
/frameworks/base/services/tests/servicestests/src/com/android/server/
H A DNetworkPolicyManagerServiceTest.java1030 // Define simple data plan
1031 final SubscriptionPlan plan = buildMonthlyDataPlan(
1033 mService.setSubscriptionPlans(TEST_SUB_ID, new SubscriptionPlan[] { plan },
1135 // Define simple data plan which gives us effectively 60MB/day
1136 final SubscriptionPlan plan = buildMonthlyDataPlan(
1138 mService.setSubscriptionPlans(TEST_SUB_ID, new SubscriptionPlan[] { plan },
1531 // No data plan
1545 // Limited data plan
1547 final SubscriptionPlan plan = buildMonthlyDataPlan(
1550 mService.setSubscriptionPlans(TEST_SUB_ID, new SubscriptionPlan[]{plan},
[all...]

Completed in 1891 milliseconds