Home
last modified time | relevance | path

Searched refs:num_nodes (Results 1 – 25 of 159) sorted by relevance

1234567

/external/tensorflow/tensorflow/compiler/xla/pjrt/distributed/
Dclient_server_test.cc34 int num_nodes = 3; in TEST() local
36 service_options.num_nodes = num_nodes; in TEST()
46 absl::Barrier barrier(num_nodes); in TEST()
70 TF_RET_CHECK(connect_count == num_nodes); in TEST()
86 TF_RET_CHECK(shutdown_count == num_nodes); in TEST()
92 std::vector<xla::Status> statuses(num_nodes); in TEST()
95 "test_threads", num_nodes); in TEST()
96 for (int i = 0; i < num_nodes; ++i) { in TEST()
100 for (int i = 0; i < num_nodes; ++i) { in TEST()
107 service_options.num_nodes = 2; in TEST()
[all …]
/external/arm-trusted-firmware/plat/xilinx/zynqmp/pm_service/
Dpm_api_clock.c230 uint8_t num_nodes; member
829 .num_nodes = ARRAY_SIZE(ignore_unused_pll_nodes),
847 .num_nodes = ARRAY_SIZE(generic_pll_pre_src_nodes),
855 .num_nodes = ARRAY_SIZE(generic_pll_half_nodes),
867 .num_nodes = ARRAY_SIZE(generic_pll_int_nodes),
885 .num_nodes = ARRAY_SIZE(generic_pll_post_src_nodes),
897 .num_nodes = ARRAY_SIZE(generic_pll_system_nodes),
905 .num_nodes = ARRAY_SIZE(generic_pll_nodes),
923 .num_nodes = ARRAY_SIZE(generic_pll_pre_src_nodes),
931 .num_nodes = ARRAY_SIZE(generic_pll_half_nodes),
[all …]
/external/tensorflow/tensorflow/core/lib/strings/
Dproto_serialization_test.cc31 GraphDef MakeGraphDef(int num_nodes) { in MakeGraphDef() argument
33 for (int i = 0; i < num_nodes; ++i) { in MakeGraphDef()
45 int num_nodes = state.range(0); in BM_ProtoSerializationToString() local
47 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_ProtoSerializationToString()
59 int num_nodes = state.range(0); in BM_ProtoSerializationToBuffer() local
61 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_ProtoSerializationToBuffer()
73 int num_nodes = state.range(0); in BM_DeterministicProtoHash64() local
75 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_DeterministicProtoHash64()
84 int num_nodes = state.range(0); in BM_AreSerializedProtosEqual() local
86 GraphDef graph_def_a = MakeGraphDef(num_nodes); in BM_AreSerializedProtosEqual()
[all …]
/external/tensorflow/tensorflow/compiler/xla/
Dshape_tree_test.cc64 int num_nodes = 0; in TestShapeConstructor() local
65 int_tree.ForEachElement([&num_nodes](const ShapeIndex& /*index*/, int data) { in TestShapeConstructor()
67 ++num_nodes; in TestShapeConstructor()
69 EXPECT_EQ(expected_num_nodes, num_nodes); in TestShapeConstructor()
72 num_nodes = 0; in TestShapeConstructor()
74 [&num_nodes](const ShapeIndex& /*index*/, bool data) { in TestShapeConstructor()
76 ++num_nodes; in TestShapeConstructor()
78 EXPECT_EQ(expected_num_nodes, num_nodes); in TestShapeConstructor()
90 int num_nodes = 0; in TestInitValueConstructor() local
91 tree.ForEachElement([&num_nodes](const ShapeIndex& /*index*/, int data) { in TestInitValueConstructor()
[all …]
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles_benchmark.cc27 const int num_nodes = state.range(0); in BM_StressTest() local
28 while (state.KeepRunningBatch(num_nodes)) { in BM_StressTest()
30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
31 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
34 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
35 int end = std::min(num_nodes, i + 5); in BM_StressTest()
/external/tensorflow/tensorflow/core/nccl/
Dnccl_manager_test.cc54 TestCase(int num_nodes, int num_ranks_per_node) in TestCase()
55 : num_nodes(num_nodes), num_ranks_per_node(num_ranks_per_node) {} in TestCase()
59 const int num_nodes; member
88 static void PopulateMultiNodeParams(int* num_nodes, int* num_ranks_per_node) { in PopulateMultiNodeParams() argument
91 *num_nodes = 2; in PopulateMultiNodeParams()
104 TestCase* MakeReductionTestCase(int num_nodes, int num_ranks_per_node, in MakeReductionTestCase() argument
107 TestCase* test_case = new TestCase(num_nodes, num_ranks_per_node); in MakeReductionTestCase()
124 for (int node = 0; node < num_nodes; ++node) { in MakeReductionTestCase()
165 TestCase* MakeGatherTestCase(int num_nodes, int num_ranks_per_node, in MakeGatherTestCase() argument
167 TestCase* test_case = new TestCase(num_nodes, num_ranks_per_node); in MakeGatherTestCase()
[all …]
/external/ltp/testcases/kernel/lib/
Dnuma_helper.c152 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes) in get_allowed_nodes_arr() argument
159 *num_nodes = 0; in get_allowed_nodes_arr()
195 (*nodes)[*num_nodes] = i; in get_allowed_nodes_arr()
196 (*num_nodes)++; in get_allowed_nodes_arr()
220 int num_nodes = 0; in get_allowed_nodes() local
223 ret = get_allowed_nodes_arr(flag, &num_nodes, &nodes); in get_allowed_nodes()
230 if (i < num_nodes) { in get_allowed_nodes()
247 int i, ret, num_nodes; in print_node_info() local
249 ret = get_allowed_nodes_arr(flag, &num_nodes, &allowed_nodes); in print_node_info()
252 for (i = 0; i < num_nodes; i++) in print_node_info()
/external/tensorflow/tensorflow/compiler/tests/
Dlstm.py43 def LSTMCellWeightsShape(num_inputs, num_nodes): argument
47 return [num_inputs + num_nodes, 4 * num_nodes]
140 def BuildLSTMLayer(batch_size, seq_length, num_inputs, num_nodes): argument
155 LSTMCellWeightsShape(num_inputs, num_nodes), name='weights')
156 m = array_ops.zeros([batch_size, num_nodes], name='init_m')
157 c = array_ops.zeros([batch_size, num_nodes], name='init_c')
/external/adhd/cras/src/alsa_plugin/
Dctl_cras.c117 struct cras_ionode_info *nodes, size_t num_nodes) in get_nodes() argument
125 &num_devs, &num_nodes); in get_nodes()
128 &num_devs, &num_nodes); in get_nodes()
131 return num_nodes; in get_nodes()
140 int num_nodes, i; in ctl_cras_read_integer() local
147 num_nodes = get_nodes(cras->client, CRAS_STREAM_OUTPUT, nodes, in ctl_cras_read_integer()
149 for (i = 0; i < num_nodes; i++) { in ctl_cras_read_integer()
169 int num_nodes, i; in ctl_cras_write_integer() local
176 num_nodes = get_nodes(cras->client, CRAS_STREAM_OUTPUT, nodes, in ctl_cras_write_integer()
178 for (i = 0; i < num_nodes; i++) { in ctl_cras_write_integer()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dgeneric_layout_optimizer.cc122 const int num_nodes = context->num_nodes; in ExpandLayoutSensitiveOp() local
123 for (int i = 0; i < num_nodes; ++i) { in ExpandLayoutSensitiveOp()
144 const int num_nodes = context->num_nodes; in ExpandLayoutAgnosticOp() local
145 for (int i = 0; i < num_nodes; ++i) { in ExpandLayoutAgnosticOp()
228 const int original_num_nodes = context->num_nodes; in EraseCancellableNodes()
231 const int num_nodes = graph_view->NumNodes(); in EraseCancellableNodes() local
233 for (int i = original_num_nodes; i < num_nodes; ++i) { in EraseCancellableNodes()
280 const int num_nodes = graph_view->NumNodes(); in EraseCancellableNodesAroundPad() local
281 for (int i = 0; i < num_nodes; ++i) { in EraseCancellableNodesAroundPad()
385 const int num_nodes = graph_view->NumNodes(); in EraseOutputShapeAttrs() local
[all …]
/external/tensorflow/tensorflow/core/platform/
Dnuma_test.cc32 int num_nodes = port::NUMANumNodes(); in TEST() local
33 for (int request_node = 0; request_node < num_nodes; ++request_node) { in TEST()
51 int num_nodes = port::NUMANumNodes(); in TEST() local
52 for (int request_node = 0; request_node < num_nodes; ++request_node) { in TEST()
/external/adhd/cras/src/tools/cras_monitor/
Dcras_monitor.c62 size_t num_nodes, cras_node_id_t node_id) in node_array_index_of_node_id() argument
68 for (i = 0; i < num_nodes; i++) { in node_array_index_of_node_id()
83 size_t num_nodes = CRAS_MAX_IONODES; in node_name_for_node_id() local
99 &num_devs, &num_nodes); in node_name_for_node_id()
102 &num_devs, &num_nodes); in node_name_for_node_id()
114 node_index = node_array_index_of_node_id(nodes, num_nodes, node_id); in node_name_for_node_id()
115 if (node_index >= num_nodes) in node_name_for_node_id()
117 num_nodes); in node_name_for_node_id()
/external/mesa3d/src/gallium/drivers/etnaviv/
Detnaviv_compiler_nir_ra.c139 unsigned num_nodes = etna_live_defs(impl, defs, live_map); in etna_ra_assign() local
140 struct ra_graph *g = ra_alloc_interference_graph(regs, num_nodes); in etna_ra_assign()
143 for (unsigned i = 0; i < num_nodes; i++) { in etna_ra_assign()
222 for (unsigned i = 0; i < num_nodes; i++) { in etna_ra_assign()
239 c->num_nodes = num_nodes; in etna_ra_assign()
247 for (unsigned i = 0; i < c->num_nodes; i++) { in etna_ra_finish()
/external/ltp/testcases/kernel/mem/lib/
Dmem.c171 int num_nodes, *nodes; in set_global_mempolicy() local
175 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in set_global_mempolicy()
178 if (num_nodes < 2) { in set_global_mempolicy()
190 if (num_nodes == 2) { in set_global_mempolicy()
530 int num_nodes, *nodes; in test_ksm_merge_across_nodes() local
538 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in test_ksm_merge_across_nodes()
541 if (num_nodes < 2) { in test_ksm_merge_across_nodes()
550 memory = SAFE_MALLOC(num_nodes * sizeof(char *)); in test_ksm_merge_across_nodes()
551 for (i = 0; i < num_nodes; i++) { in test_ksm_merge_across_nodes()
576 nr_pages * num_nodes); in test_ksm_merge_across_nodes()
[all …]
/external/freetype/src/cache/
Dftcglyph.c36 family->num_nodes++; in FTC_GNode_Init()
48 if ( family && --family->num_nodes == 0 ) in FTC_GNode_UnselectFamily()
112 family->num_nodes = 0; in FTC_Family_Init()
205 family->num_nodes++; in FTC_GCache_Lookup()
209 if ( --family->num_nodes == 0 ) in FTC_GCache_Lookup()
Dftcmru.c174 list->num_nodes = 0; in FTC_MruList_Init()
189 FT_ASSERT( list->num_nodes == 0 ); in FTC_MruList_Reset()
244 if ( list->num_nodes >= list->max_nodes && list->max_nodes > 0 ) in FTC_MruList_New()
260 list->num_nodes--; in FTC_MruList_New()
273 list->num_nodes++; in FTC_MruList_New()
311 list->num_nodes--; in FTC_MruList_Remove()
/external/tensorflow/tensorflow/core/kernels/boosted_trees/
Dstats_ops.cc178 const int num_nodes = output_node_ids.size(); in Compute() local
182 output_node_ids_list.allocate(feature_idx, {num_nodes}, in Compute()
188 feature_idx, {num_nodes}, &output_gains_t)); in Compute()
193 output_thresholds_list.allocate(feature_idx, {num_nodes}, in Compute()
199 feature_idx, {num_nodes, 1}, in Compute()
206 feature_idx, {num_nodes, 1}, in Compute()
211 for (int i = 0; i < num_nodes; ++i) { in Compute()
349 const int num_nodes = output_node_ids.size(); in Compute() local
352 OP_REQUIRES_OK(context, context->allocate_output("node_ids", {num_nodes}, in Compute()
358 OP_REQUIRES_OK(context, context->allocate_output("gains", {num_nodes}, in Compute()
[all …]
/external/mesa3d/src/imgui/
Dimstb_rectpack.h128 …tbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
186 int num_nodes; member
256 context->align = (context->width + context->num_nodes-1) / context->num_nodes; in stbrp_setup_allow_out_of_mem()
260 … stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
267 for (i=0; i < num_nodes-1; ++i) in stbrp_init_target()
276 context->num_nodes = num_nodes; in stbrp_init_target()
516 STBRP_ASSERT(count == context->num_nodes+2); in stbrp__skyline_pack_rectangle()
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles_test.cc515 const int num_nodes = state.range(0); in BM_StressTest() local
519 int32 *nodes = new int32[num_nodes]; in BM_StressTest()
520 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
523 for (int i = 0; i < num_nodes; i++) { in BM_StressTest()
524 int end = std::min(num_nodes, i + 5); in BM_StressTest()
537 const int num_nodes = state.range(0); in BM_ContractEdge() local
543 nodes.reserve(num_nodes); in BM_ContractEdge()
544 for (int i = 0; i < num_nodes; i++) { in BM_ContractEdge()
548 for (int i = 0; i < num_nodes - 1; ++i) { in BM_ContractEdge()
549 g.InsertEdge(nodes[i], nodes[num_nodes - 1]); in BM_ContractEdge()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dimmutable_executor_state.cc37 for (int32 i = 0; i < gview_.num_nodes(); i++) { in ~ImmutableExecutorState()
97 pending_ids_.resize(gview_.num_nodes()); in Initialize()
285 const int num_nodes = g->num_node_ids(); in BuildControlFlowInfo() local
286 cf_info->frame_names.resize(num_nodes); in BuildControlFlowInfo()
288 parent_nodes.resize(num_nodes); in BuildControlFlowInfo()
290 visited.resize(num_nodes); in BuildControlFlowInfo()
357 atomic_pending_counts_.reset(new std::atomic<int32>[gview_.num_nodes()]); in InitializePending()
359 atomic_pending_counts_.get() + gview_.num_nodes(), 0); in InitializePending()

1234567