Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for CreateAlternativeSubgraphPass (0.26 sec)

  1. tensorflow/compiler/mlir/lite/experimental/tac/transforms/passes.h

        bool skip_raise_cpu_ops = false, bool ignore_inference_type = false);
    
    // Create an instance of the AlternativeSubgraphPass.
    std::unique_ptr<OperationPass<ModuleOp>> CreateAlternativeSubgraphPass(
        llvm::ArrayRef<std::string> device_specs);
    
    // Create an instance of ComputeCostPass.
    std::unique_ptr<OperationPass<ModuleOp>> CreateComputeCostPass();
    
    // Create an instance of PickSubgraphsPass.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri May 19 19:32:06 UTC 2023
    - 3.1K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/lite/experimental/tac/tac_module.cc

      pass_manager->addPass(mlir::TFL::tac::CreateFoldConstantsToSubgraphPass(
          /*fold_all_constants=*/false));
      pass_manager->addPass(
          mlir::TFL::tac::CreateAlternativeSubgraphPass(device_specs));
      if (options_.legalize_to_tflite_ops) {
        // After we creat the alternative subgraph, we can still do canonicalization
        // legalization & other optimizations as long as we're not inlining the
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Jun 08 01:19:25 UTC 2023
    - 5.6K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/lite/experimental/tac/transforms/get_alternative_subgraph.cc

      for (auto func : funcs_to_be_processed) {
        GetAlternativeGraphForFunc(device_specs, func, module, &builder);
      }
    }
    
    }  // namespace
    
    std::unique_ptr<OperationPass<ModuleOp>> CreateAlternativeSubgraphPass(
        llvm::ArrayRef<std::string> device_specs) {
      return std::make_unique<AlternativeSubgraphPass>(device_specs);
    }
    
    static PassRegistration<AlternativeSubgraphPass> pass;
    
    }  // namespace tac
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Jun 06 03:08:33 UTC 2023
    - 12.3K bytes
    - Viewed (0)
Back to top