| /external/tensorflow/tensorflow/contrib/cloud/python/ops/ |
| bigquery_reader_ops.py | 50 # Populate a queue with the BigQuery Table partitions.
51 queue = tf.train.string_input_producer(reader.partitions())
86 num_partitions: Number of non-overlapping partitions to read from.
127 def partitions(self, name=None): member in class:BigQueryReader
|
| /external/tensorflow/tensorflow/cc/gradients/ |
| data_flow_grad_test.cc | 52 auto partitions = Const(scope_, {{2, 1, 0}, {1, 2, 0}}); local
53 auto y = DynamicPartition(scope_, data, partitions, 3);
|
| data_flow_grad.cc | 52 // partitions = [0, 0, 1, 1, 0]
54 // dynamic_partition(data, partitions, num_partitions) = {
65 auto partitions = op.input(1); local
70 // Note: the shape of the partitions is a prefix of the data shape.
71 // shape(partitions) = [5]
72 auto partitions_shape = Shape(scope, partitions);
73 // We now create a partitions-shaped tensor with integers from
74 // [0..size(partitions)) This will be dynamic_partitioned with the
90 DynamicPartition(scope, original_indices, partitions, num_partitions);
103 // Stop propagation along the partitions inpu
[all...] |
| /external/flac/libFLAC/ |
| stream_encoder_intrin_avx2.c | 54 unsigned partitions = 1u << max_partition_order; local
64 for(partition = residual_sample = 0; partition < partitions; partition++) {
96 for(partition = residual_sample = 0; partition < partitions; partition++) {
126 /* now merge partitions for lower orders */
128 unsigned from_partition = 0, to_partition = partitions;
132 partitions >>= 1;
133 for(i = 0; i < partitions; i++) {
|
| stream_encoder_intrin_ssse3.c | 54 unsigned partitions = 1u << max_partition_order; local
64 for(partition = residual_sample = 0; partition < partitions; partition++) {
99 for(partition = residual_sample = 0; partition < partitions; partition++) {
129 /* now merge partitions for lower orders */
131 unsigned from_partition = 0, to_partition = partitions;
135 partitions >>= 1;
136 for(i = 0; i < partitions; i++) {
|
| stream_encoder_intrin_sse2.c | 65 unsigned partitions = 1u << max_partition_order; local
75 for(partition = residual_sample = 0; partition < partitions; partition++) {
110 for(partition = residual_sample = 0; partition < partitions; partition++) {
140 /* now merge partitions for lower orders */
142 unsigned from_partition = 0, to_partition = partitions;
146 partitions >>= 1;
147 for(i = 0; i < partitions; i++) {
|
| /external/eigen/bench/ |
| check_cache_queries.cpp | 66 int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] local
69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
74 cout << "cache[" << cache_id << "].partitions = " << partitions << "\n"; local
|
| /external/tensorflow/tensorflow/core/kernels/ |
| dynamic_partition_op.cc | 43 const Tensor** partitions,
46 OP_REQUIRES_OK(c, c->input("partitions", partitions));
49 TensorShapeUtils::StartsWith((*data)->shape(), (*partitions)->shape()),
51 "data.shape must start with partitions.shape, ",
53 ", partitions.shape = ", (*partitions)->shape().DebugString()));
55 // Count how many occurrences of each partition id we have in partitions
57 auto e_partitions = (*partitions)->flat<int32>();
63 "partitions", SliceDebugString((*partitions)->shape(), i)
92 const Tensor* partitions; variable
[all...] |
| dynamic_partition_op_gpu.cu.cc | 17 // 1. Let N be the size of partitions. We initialize a new vector indices_in
20 // by partitions and indices_in. This will result in two new vectors
182 // N - the size of the partitions tensor
184 // P - the number of partitions
211 const Tensor* partitions, const Tensor* partition_count,
219 for (int i = partitions->dims(); i < data->dims(); i++) {
229 const Tensor& partitions = c->input(1); local
232 c, TensorShapeUtils::StartsWith(data.shape(), partitions.shape()),
234 "data.shape must start with partitions.shape, ",
236 ", partitions.shape = ", partitions.shape().DebugString())
[all...] |
| /build/make/tools/fs_config/ |
| fs_config_generate.c | 63 "minus blacklist. Partitions are identified as path references to\n"
77 const char* partitions = NULL; local
101 if (partitions) {
122 partitions = optarg;
173 if (partitions) {
174 char* partitions_copy = strdup(partitions);
177 /* Deal with case all iterated partitions are blacklists with no match */
182 fprintf(stderr, "Failed to allocate a copy of %s\n", partitions);
185 /* iterate through (officially) comma separated list of partitions */
|
| /external/gptfdisk/ |
| basicmbr.h | 16 // Maximum number of MBR partitions
28 // go. Also used when loading logical partitions.
34 struct MBRRecord partitions[4]; member in struct:TempMBR
48 // the logical partitions, to simplify data retrieval for GPT conversions.
49 MBRPart partitions[MAX_MBR_PARTS]; member in class:BasicMBRData
109 // Functions to create, delete, or change partitions
141 // Functions to extract data on specific partitions....
|
| bsd.h | 25 // FreeBSD documents a maximum # of partitions of 8, but I saw 16 on a NetBSD
29 // theoretical maximum of 118.75 partitions that the program can handle before
67 uint16_t numParts; // number of partitions in table
68 struct BSDRecord* partitions; // partition array member in class:BSDData
85 // Functions to extract data on specific partitions....
|
| gpt.h | 65 GPTPart *partitions; member in class:GPTData
66 uint32_t numParts; // # of partitions the table can hold
82 uint32_t sectorAlignment; // Start partitions at multiples of sectorAlignment
190 uint32_t ComputeAlignment(void); // Set alignment based on current partitions
|
| /external/e2fsprogs/lib/ext2fs/ |
| dosio.c | 46 * Array of all opened partitions
48 static PARTITION **partitions = NULL; variable
49 static unsigned short npart = 0; /* Number of mapped partitions */
110 * For partition numbers >5 Linux uses DOS extended partitions -
112 * extended partitions when scanning for a first Linux/ext2fs.
121 return NULL; /* We don't support extended partitions for now */
222 if(!strcmp(partitions[i]->dev, dev))
225 active = partitions[i];
340 newparts = (PARTITION**)realloc(partitions, sizeof(PARTITION) * npart);
345 partitions = newparts
[all...] |
| /external/tensorflow/tensorflow/contrib/kafka/kernels/ |
| kafka_dataset_ops.cc | 282 std::vector<RdKafka::TopicPartition*> partitions; local
283 partitions.emplace_back(topic_partition_.get());
284 RdKafka::ErrorCode err = consumer_->assign(partitions);
|
| /system/update_engine/payload_consumer/ |
| install_plan.h | 49 // Load the |source_path| and |target_path| of all |partitions| based on the
51 // to load all the partitions for the valid slots.
66 // Only download manifest and fill in partitions in install plan without
112 std::vector<Partition> partitions; member in struct:chromeos_update_engine::InstallPlan
|
| /system/update_engine/payload_generator/ |
| payload_generation_config.h | 114 // The updated partitions.
115 std::vector<PartitionConfig> partitions; member in struct:chromeos_update_engine::ImageConfig
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| graph_mgr.cc | 147 std::unordered_map<string, GraphDef> partitions; local
166 TF_RETURN_IF_ERROR(Partition(popts, &graph, &partitions));
168 TF_RETURN_IF_ERROR(AddControlEdges(popts, &partitions));
172 for (const auto& partition : partitions) {
191 item->units.reserve(partitions.size());
|
| /system/core/init/ |
| init_first_stage.cpp | 161 // required_devices_partition_names_. Found partitions will then be removed from it
195 // UeventCallback() will remove found partitions from required_devices_partition_names_.
196 // So if it isn't empty here, it means some partitions are not found.
203 LOG(INFO) << "Wait for partitions returned after " << t;
303 LOG(ERROR) << "Partitions can't be verified at boot";
306 // Checks for verified partitions.
358 // Gets the vbmeta partitions from device tree.
387 // libavb verifies AVB metadata on all verified partitions at once.
396 std::vector<std::string> partitions = android::base::Split(device_tree_vbmeta_parts_, ","); local
398 for (const auto& partition : partitions) {
[all...] |
| /system/core/libcutils/ |
| fs_config.cpp | 245 static const char* partitions[] = {"odm/", "oem/", "product/", "vendor/"}; local
246 for (size_t i = 0; i < (sizeof(partitions) / sizeof(partitions[0])); ++i) {
247 size_t plen = strlen(partitions[i]);
249 if (!strncmp(path, partitions[i], plen)) return true;
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| ListsTest.java | 563 List<List<Integer>> partitions = Lists.partition(source, 1); local
564 assertTrue(partitions.isEmpty());
565 assertEquals(0, partitions.size());
570 List<List<Integer>> partitions = Lists.partition(source, 1); local
571 assertEquals(1, partitions.size());
572 assertEquals(Collections.singletonList(1), partitions.get(0));
577 List<List<Integer>> partitions = Lists.partition(source, 2); local
578 assertEquals(1, partitions.size());
579 assertEquals(Collections.singletonList(1), partitions.get(0));
584 List<List<Integer>> partitions = Lists.partition(source, 1) local
592 List<List<Integer>> partitions = Lists.partition(source, 2); local
600 List<List<Integer>> partitions = Lists.partition(source, 2); local
610 List<List<Integer>> partitions = Lists.partition(list, 3); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ListsTest.java | 808 List<List<Integer>> partitions = Lists.partition(source, 1); local
809 assertTrue(partitions.isEmpty());
810 assertEquals(0, partitions.size());
815 List<List<Integer>> partitions = Lists.partition(source, 1); local
816 assertEquals(1, partitions.size());
817 assertEquals(Collections.singletonList(1), partitions.get(0));
822 List<List<Integer>> partitions = Lists.partition(source, 2); local
823 assertEquals(1, partitions.size());
824 assertEquals(Collections.singletonList(1), partitions.get(0));
829 List<List<Integer>> partitions = Lists.partition(source, 1) local
837 List<List<Integer>> partitions = Lists.partition(source, 2); local
846 List<List<Integer>> partitions = Lists.partition(source, 2); local
863 List<List<Integer>> partitions = Lists.partition(source, 2); local
873 List<List<Integer>> partitions = Lists.partition(list, 3); local
[all...] |
| /external/avb/test/ |
| avb_slot_verify_unittest.cc | 1346 std::set<std::string> partitions = ops_.get_partition_names_read_from(); local
1436 std::set<std::string> partitions = ops_.get_partition_names_read_from(); local
[all...] |
| /external/syslinux/gpxe/src/arch/i386/include/ |
| int13.h | 283 struct partition_table_entry partitions[4]; member in struct:master_boot_record
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_partition_test.cc | 76 std::unordered_map<string, GraphDef>* partitions) {
96 Status s = Partition(popts, &g, partitions);
101 // Partitions must inherit the versions of the original graph.
102 for (auto& it : *partitions) {
110 std::unordered_map<string, GraphDef> partitions; local
111 Partition(graph_def, &partitions);
112 for (const auto& kv : partitions) {
396 std::unordered_map<string, GraphDef> partitions; local
397 Partition(ToGraphDef(), &partitions); local
398 for (const auto& kv : partitions) {
453 std::unordered_map<string, GraphDef> partitions; local
[all...] |
