Home
last modified time | relevance | path

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

12345

/external/arm-trusted-firmware/plat/xilinx/zynqmp/pm_service/
Dpm_api_clock.c216 uint8_t num_nodes; member
815 .num_nodes = ARRAY_SIZE(ignore_unused_pll_nodes),
833 .num_nodes = ARRAY_SIZE(generic_pll_pre_src_nodes),
841 .num_nodes = ARRAY_SIZE(generic_pll_half_nodes),
853 .num_nodes = ARRAY_SIZE(generic_pll_int_nodes),
871 .num_nodes = ARRAY_SIZE(generic_pll_post_src_nodes),
883 .num_nodes = ARRAY_SIZE(generic_pll_system_nodes),
891 .num_nodes = ARRAY_SIZE(generic_pll_nodes),
909 .num_nodes = ARRAY_SIZE(generic_pll_pre_src_nodes),
917 .num_nodes = ARRAY_SIZE(generic_pll_half_nodes),
[all …]
/external/tensorflow/tensorflow/core/lib/strings/
Dproto_serialization_test.cc30 GraphDef MakeGraphDef(int num_nodes) { in MakeGraphDef() argument
32 for (int i = 0; i < num_nodes; ++i) { in MakeGraphDef()
43 static void BM_ProtoSerializationToString(int iters, int num_nodes) { in BM_ProtoSerializationToString() argument
45 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_ProtoSerializationToString()
56 static void BM_ProtoSerializationToBuffer(int iters, int num_nodes) { in BM_ProtoSerializationToBuffer() argument
58 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_ProtoSerializationToBuffer()
70 static void BM_DeterministicProtoHash64(int iters, int num_nodes) { in BM_DeterministicProtoHash64() argument
72 GraphDef graph_def = MakeGraphDef(num_nodes); in BM_DeterministicProtoHash64()
81 static void BM_AreSerializedProtosEqual(int iters, int num_nodes) { in BM_AreSerializedProtosEqual() argument
83 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/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/adhd/cras/src/alsa_plugin/
Dctl_cras.c163 struct cras_ionode_info *nodes, size_t num_nodes) in get_nodes() argument
171 &num_devs, &num_nodes); in get_nodes()
174 &num_devs, &num_nodes); in get_nodes()
177 return num_nodes; in get_nodes()
186 int num_nodes, i; in ctl_cras_read_integer() local
193 num_nodes = get_nodes(cras->client, CRAS_STREAM_OUTPUT, nodes, in ctl_cras_read_integer()
195 for (i = 0; i < num_nodes; i++) { in ctl_cras_read_integer()
206 num_nodes = get_nodes(cras->client, CRAS_STREAM_INPUT, nodes, in ctl_cras_read_integer()
208 for (i = 0; i < num_nodes; i++) { in ctl_cras_read_integer()
229 int num_nodes, i; in ctl_cras_write_integer() local
[all …]
/external/tensorflow/tensorflow/core/nccl/
Dnccl_manager_test.cc53 TestCase(int num_nodes, int num_ranks_per_node) in TestCase()
54 : num_nodes(num_nodes), num_ranks_per_node(num_ranks_per_node) {} in TestCase()
58 const int num_nodes; member
87 static void PopulateMultiNodeParams(int* num_nodes, int* num_ranks_per_node) { in PopulateMultiNodeParams() argument
90 *num_nodes = 2; in PopulateMultiNodeParams()
103 TestCase* MakeReductionTestCase(int num_nodes, int num_ranks_per_node, in MakeReductionTestCase() argument
106 TestCase* test_case = new TestCase(num_nodes, num_ranks_per_node); in MakeReductionTestCase()
123 for (int node = 0; node < num_nodes; ++node) { in MakeReductionTestCase()
164 TestCase* MakeGatherTestCase(int num_nodes, int num_ranks_per_node, in MakeGatherTestCase() argument
166 TestCase* test_case = new TestCase(num_nodes, num_ranks_per_node); in MakeGatherTestCase()
[all …]
/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/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')
Dlstm_test.py78 num_nodes = 1
80 weights = init_weights(lstm.LSTMCellWeightsShape(num_inputs, num_nodes))
141 num_nodes = 1
144 weights = array_ops.zeros(lstm.LSTMCellWeightsShape(num_inputs, num_nodes))
161 num_nodes = 1
164 weights = init_weights(lstm.LSTMCellWeightsShape(num_inputs, num_nodes))
243 FLAGS.num_inputs, FLAGS.num_nodes)
253 FLAGS.num_inputs, FLAGS.num_nodes))
/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.c67 size_t num_nodes, cras_node_id_t node_id) in node_array_index_of_node_id() argument
73 for (i = 0; i < num_nodes; i++) { in node_array_index_of_node_id()
88 size_t num_nodes = CRAS_MAX_IONODES; in node_name_for_node_id() local
104 &num_devs, &num_nodes); in node_name_for_node_id()
107 &num_devs, &num_nodes); in node_name_for_node_id()
119 node_index = node_array_index_of_node_id(nodes, num_nodes, node_id); in node_name_for_node_id()
120 if (node_index >= num_nodes) in node_name_for_node_id()
122 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/tensorflow/tensorflow/core/graph/
Dsubgraph_test.cc345 static void BM_SubgraphHelper(int iters, int num_nodes, in BM_SubgraphHelper() argument
357 for (int i = 0; i < num_nodes; i++) { in BM_SubgraphHelper()
369 if (num_nodes > 1000) { in BM_SubgraphHelper()
370 fed.push_back(strings::StrCat("N", num_nodes - 1000)); in BM_SubgraphHelper()
373 std::vector<string> targets = {strings::StrCat("N", num_nodes - 1)}; in BM_SubgraphHelper()
386 static void BM_Subgraph(int iters, int num_nodes) { in BM_Subgraph() argument
387 BM_SubgraphHelper(iters, num_nodes, false /* use_function_convention */); in BM_Subgraph()
389 static void BM_SubgraphFunctionConvention(int iters, int num_nodes) { in BM_SubgraphFunctionConvention() argument
390 BM_SubgraphHelper(iters, num_nodes, true /* use_function_convention */); in BM_SubgraphFunctionConvention()
Dbenchmark_testlib.h72 GraphDef CreateGraphDef(int num_nodes, int num_edges_per_node) { in CreateGraphDef() argument
91 for (int op = 0; op < num_nodes; ++op) { in CreateGraphDef()
103 for (int op = 0; op < num_nodes; ++op) { in CreateGraphDef()
107 attr.set_i(num_nodes); in CreateGraphDef()
/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.c37 family->num_nodes++; in FTC_GNode_Init()
49 if ( family && --family->num_nodes == 0 ) in FTC_GNode_UnselectFamily()
113 family->num_nodes = 0; in FTC_Family_Init()
206 family->num_nodes++; in FTC_GCache_Lookup()
210 if ( --family->num_nodes == 0 ) in FTC_GCache_Lookup()
Dftcmru.c175 list->num_nodes = 0; in FTC_MruList_Init()
190 FT_ASSERT( list->num_nodes == 0 ); in FTC_MruList_Reset()
245 if ( list->num_nodes >= list->max_nodes && list->max_nodes > 0 ) in FTC_MruList_New()
261 list->num_nodes--; in FTC_MruList_New()
274 list->num_nodes++; in FTC_MruList_New()
312 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/lite/
Dgraph_info.cc61 node_type_(info->num_nodes(), NodeSubset::kTfNonPartition) { in PartitionGraphIntoIndependentNodeSubsetsImpl()
75 node_epochs_.resize(info_->num_nodes(), kEpochNotReady); in Partition()
78 for (int node_index = 0; node_index < info_->num_nodes(); node_index++) { in Partition()
201 for (int node_index = 0; node_index < info_->num_nodes(); node_index++) { in BuildNodeSubset()
/external/libhevc/encoder/
Dhme_defs.h525 as_nodes, num_nodes, new_node, au4_map, center_x, center_y, use_hashing) \ argument
541 (as_nodes)[(num_nodes)] = (new_node); \
542 ((num_nodes))++; \
549 for(k = 0; k < ((num_nodes)); k++) \
560 if(k == ((num_nodes))) \
565 ((num_nodes))++; \
577 #define INSERT_NEW_NODE_NOMAP(as_nodes, num_nodes, new_node, implicit_layer) \ argument
582 for(k = 0; k < (num_nodes); k++) \
595 for(k = 0; k < (num_nodes); k++) \
608 if(k == (num_nodes)) \
[all …]
/external/tensorflow/tensorflow/lite/experimental/delegates/hexagon/
Dhexagon_delegate_kernel.cc295 unsigned int num_nodes; in PrintPerformanceData() local
298 kMaxNodes, &num_nodes) != 0) { in PrintPerformanceData()
302 printf("Total %d nodes.\n", num_nodes); in PrintPerformanceData()
303 std::sort(perf_data.begin(), perf_data.begin() + num_nodes, PerfInfoCmp()); in PrintPerformanceData()
304 for (int i = 0; i < num_nodes; i++) { in PrintPerformanceData()
311 for (int i = 0; i < num_nodes; i++) { in PrintPerformanceData()
/external/ltp/testcases/kernel/syscalls/migrate_pages/
Dmigrate_pages02.c45 static int num_nodes; variable
89 for (i = 0; i < num_nodes; i++) in migrate_to_node()
274 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
278 if (num_nodes < 2) in setup()
295 for (i = 0; i < num_nodes; i++) { in setup()
Dmigrate_pages03.c41 static int num_nodes, max_node; variable
55 if (get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes) < 0) in setup()
58 if (num_nodes < TEST_NODES) { in setup()
/external/libxaac/decoder/drc_src/
Dimpd_drc_dynamic_payload.c181 ia_tables_struct* str_tables, WORD32 num_nodes, in impd_dec_times() argument
207 for (k = 0; k < num_nodes - 1; k++) { in impd_dec_times()
249 for (k = 0; k < num_nodes; k++) { in impd_dec_times()
311 str_spline_nodes->num_nodes = 1; in impd_drc_uni_gain_read()
403 if ((str_spline_nodes->num_nodes < 1) || in impd_parse_spline_nodes()
404 (str_spline_nodes->num_nodes > NODE_COUNT_MAX)) in impd_parse_spline_nodes()
407 str_spline_nodes->str_node[str_spline_nodes->num_nodes - 1].loc_db_gain; in impd_parse_spline_nodes()
410 str_spline_nodes->num_nodes = 1; in impd_parse_spline_nodes()
425 if ((str_spline_nodes->num_nodes < 1) || in impd_parse_spline_nodes()
426 (str_spline_nodes->num_nodes > NODE_COUNT_MAX)) in impd_parse_spline_nodes()
[all …]

12345