Home
last modified time | relevance | path

Searched refs:split (Results 1 – 25 of 4834) sorted by relevance

12345678910>>...194

/external/mesa3d/src/mesa/vbo/
Dvbo_split_inplace.c63 static void flush_vertex( struct split_context *split ) in flush_vertex() argument
65 struct gl_context *ctx = split->ctx; in flush_vertex()
70 if (!split->dstprim_nr) in flush_vertex()
73 if (split->ib) { in flush_vertex()
74 ib = *split->ib; in flush_vertex()
76 ib.count = split->max_index - split->min_index + 1; in flush_vertex()
78 split->min_index * ib.index_size); in flush_vertex()
81 for (i = 0; i < split->dstprim_nr; i++) in flush_vertex()
82 split->dstprim[i].start -= split->min_index; in flush_vertex()
85 assert(split->max_index >= split->min_index); in flush_vertex()
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/
Ddecision_tree.cc42 const auto& split = current_node.dense_float_binary_split(); in Traverse() local
43 node_id = example.dense_float_features[split.feature_column()] <= in Traverse()
44 split.threshold() in Traverse()
45 ? split.left_id() in Traverse()
46 : split.right_id(); in Traverse()
50 const auto& split = in Traverse() local
51 current_node.sparse_float_binary_split_default_left().split(); in Traverse()
53 example.sparse_float_features[split.feature_column()]; in Traverse()
56 const int32 dimension_id = split.dimension_id(); in Traverse()
60 split.threshold() in Traverse()
[all …]
Ddecision_tree_test.cc66 void TestLinkChildrenBinary(TreeNode* node, SplitType* split) { in TestLinkChildrenBinary() argument
69 EXPECT_EQ(3, split->left_id()); in TestLinkChildrenBinary()
70 EXPECT_EQ(8, split->right_id()); in TestLinkChildrenBinary()
314 auto* split = node.mutable_dense_float_binary_split(); in TEST_F() local
315 split->set_left_id(-1); in TEST_F()
316 split->set_right_id(-1); in TEST_F()
317 TestLinkChildrenBinary(&node, split); in TEST_F()
322 auto* split = in TEST_F() local
324 split->set_left_id(-1); in TEST_F()
325 split->set_right_id(-1); in TEST_F()
[all …]
/external/guava/guava-tests/test/com/google/common/base/
DSplitterTest.java45 COMMA_SPLITTER.split(null); in testSplitNullString()
53 Iterable<String> letters = COMMA_SPLITTER.split(simple); in testCharacterSimpleSplit()
72 assertEquals("[]", Splitter.on(',').split("").toString()); in testToString()
73 assertEquals("[a, b, c]", Splitter.on(',').split("a,b,c").toString()); in testToString()
74 assertEquals("[yam, bam, jam, ham]", Splitter.on(", ").split("yam, bam, jam, ham").toString()); in testToString()
79 Iterable<String> letters = Splitter.on('.').split(simple); in testCharacterSimpleSplitWithNoDelimiter()
85 Iterable<String> letters = COMMA_SPLITTER.split(doubled); in testCharacterSplitWithDoubleDelimiter()
91 Iterable<String> letters = COMMA_SPLITTER.split(doubled); in testCharacterSplitWithDoubleDelimiterAndSpace()
97 Iterable<String> letters = COMMA_SPLITTER.split(trailing); in testCharacterSplitWithTrailingDelimiter()
103 Iterable<String> letters = COMMA_SPLITTER.split(leading); in testCharacterSplitWithLeadingDelimiter()
[all …]
/external/autotest/client/site_tests/platform_ToolchainTests/src/
Dclang-fortify-tests.cpp158 } split = {}; in TestString() local
160 EXPECT_NO_DEATH(memcpy(split.tiny_buffer, &split, sizeof(split))); in TestString()
161 EXPECT_NO_DEATH(memcpy(split.tiny_buffer, &split, sizeof(split))); in TestString()
162 EXPECT_NO_DEATH(memmove(split.tiny_buffer, &split, sizeof(split))); in TestString()
163 EXPECT_NO_DEATH(mempcpy(split.tiny_buffer, &split, sizeof(split))); in TestString()
164 EXPECT_NO_DEATH(memset(split.tiny_buffer, 0, sizeof(split))); in TestString()
166 EXPECT_NO_DEATH(bcopy(&split, split.tiny_buffer, sizeof(split))); in TestString()
167 EXPECT_NO_DEATH(bzero(split.tiny_buffer, sizeof(split))); in TestString()
170 _Static_assert(sizeof(small_string) > sizeof(split.tiny_buffer), ""); in TestString()
175 EXPECT_DEATH_STRUCT(strcpy(split.tiny_buffer, small_string)); in TestString()
[all …]
/external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/
DSplitterTest.java42 COMMA_SPLITTER.split(null); in testSplitNullString()
50 Iterable<String> letters = COMMA_SPLITTER.split(simple); in testCharacterSimpleSplit()
69 assertEquals("[]", Splitter.on(',').split("").toString()); in testToString()
70 assertEquals("[a, b, c]", Splitter.on(',').split("a,b,c").toString()); in testToString()
71 assertEquals("[yam, bam, jam, ham]", Splitter.on(", ").split("yam, bam, jam, ham").toString()); in testToString()
76 Iterable<String> letters = Splitter.on('.').split(simple); in testCharacterSimpleSplitWithNoDelimiter()
82 Iterable<String> letters = COMMA_SPLITTER.split(doubled); in testCharacterSplitWithDoubleDelimiter()
88 Iterable<String> letters = COMMA_SPLITTER.split(doubled); in testCharacterSplitWithDoubleDelimiterAndSpace()
94 Iterable<String> letters = COMMA_SPLITTER.split(trailing); in testCharacterSplitWithTrailingDelimiter()
100 Iterable<String> letters = COMMA_SPLITTER.split(leading); in testCharacterSplitWithLeadingDelimiter()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopUnswitch/
D2011-11-18-TwoSwitches.ll8 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
11 ; CHECK-NEXT: br label %.split
13 ; CHECK: .split.us: ; preds = %0
15 ; CHECK-NEXT: br i1 %2, label %.split.us.split.us, label %.split.us..split.us.split_crit_edge
17 ; CHECK: .split.us..split.us.split_crit_edge: ; preds = %.split.us
18 ; CHECK-NEXT: br label %.split.us.split
20 ; CHECK: .split.us.split.us: ; preds = %.split.us
23 …in.us.us: ; preds = %loop_begin.backedge.us.us, %.split.us.split.us
36 ; CHECK: .split.us.split: ; preds = %.split.us..split.us.spli…
39 …op_begin.us: ; preds = %loop_begin.backedge.us, %.split.us.split
[all …]
D2011-11-18-SimpleSwitch.ll8 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
11 ; CHECK-NEXT: br label %.split
13 ; CHECK: .split.us: ; preds = %0
16 … loop_begin.us: ; preds = %loop_begin.backedge.us, %.split.us
25 ; CHECK: .split: ; preds = %..split_crit_edge
27 ; CHECK-NEXT: br i1 %2, label %.split.split.us, label %.split..split.split_crit_edge
29 ; CHECK: .split..split.split_crit_edge: ; preds = %.split
30 ; CHECK-NEXT: br label %.split.split
32 ; CHECK: .split.split.us: ; preds = %.split
35 …p_begin.us1: ; preds = %loop_begin.backedge.us5, %.split.split.us
[all …]
Dtrivial-unswitch.ll11 ; CHECK: br label %.split
13 ; CHECK: .split: ; preds = %..split_crit_edge
14 ; CHECK: br i1 %cond2, label %.split..split.split_crit_edge, label %.split.loop_exit.split1_crit…
16 ; CHECK: .split..split.split_crit_edge: ; preds = %.split
17 ; CHECK: br label %.split.split
19 ; CHECK: .split.split: ; preds = %.split..split.split_crit_edge
22 ; CHECK: loop_begin: ; preds = %do_something, %.split.split
58 ; CHECK: br label %.split
60 ; CHECK: .split: ; preds = %..split_crit_edge
63 ; CHECK: loop_begin: ; preds = %do_something, %.split
/external/llvm/test/Transforms/LoopUnswitch/
D2011-11-18-TwoSwitches.ll9 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
12 ; CHECK-NEXT: br label %.split
14 ; CHECK: .split.us: ; preds = %0
16 ; CHECK-NEXT: br i1 %2, label %.split.us.split.us, label %.split.us..split.us.split_crit_edge
18 ; CHECK: .split.us..split.us.split_crit_edge: ; preds = %.split.us
19 ; CHECK-NEXT: br label %.split.us.split
21 ; CHECK: .split.us.split.us: ; preds = %.split.us
24 …in.us.us: ; preds = %loop_begin.backedge.us.us, %.split.us.split.us
37 ; CHECK: .split.us.split: ; preds = %.split.us..split.us.spli…
40 …op_begin.us: ; preds = %loop_begin.backedge.us, %.split.us.split
[all …]
D2011-11-18-SimpleSwitch.ll9 ; CHECK-NEXT: br i1 %1, label %.split.us, label %..split_crit_edge
12 ; CHECK-NEXT: br label %.split
14 ; CHECK: .split.us: ; preds = %0
17 … loop_begin.us: ; preds = %loop_begin.backedge.us, %.split.us
26 ; CHECK: .split: ; preds = %..split_crit_edge
28 ; CHECK-NEXT: br i1 %2, label %.split.split.us, label %.split..split.split_crit_edge
30 ; CHECK: .split..split.split_crit_edge: ; preds = %.split
31 ; CHECK-NEXT: br label %.split.split
33 ; CHECK: .split.split.us: ; preds = %.split
36 …p_begin.us1: ; preds = %loop_begin.backedge.us5, %.split.split.us
[all …]
Dtrivial-unswitch.ll11 ; CHECK: br label %.split
13 ; CHECK: .split: ; preds = %..split_crit_edge
14 ; CHECK: br i1 %cond2, label %.split..split.split_crit_edge, label %.split.loop_exit.split1_crit…
16 ; CHECK: .split..split.split_crit_edge: ; preds = %.split
17 ; CHECK: br label %.split.split
19 ; CHECK: .split.split: ; preds = %.split..split.split_crit_edge
22 ; CHECK: loop_begin: ; preds = %do_something, %.split.split
/external/llvm/test/CodeGen/X86/
D2007-10-30-LSRCrash.ll16 bb76.split: ; preds = %bb69.outer.split.split, %bb69.us208
19 bb69.outer: ; preds = %bb76.split, %bb98.preheader
20 …%from.0.reg2mem.0.ph.rec = phi i32 [ %tmp75.rec, %bb76.split ], [ 0, %bb98.preheader ] ; <i32> [#…
23 br i1 false, label %bb69.us208, label %bb69.outer.split.split
26 switch i32 0, label %bb76.split [
32 bb69.outer.split.split: ; preds = %bb69.outer
33 switch i8 0, label %bb76.split [
39 bb89: ; preds = %bb69.outer.split.split, %bb69.outer.split.split, %bb69.outer.split.split, %bb69.u…
40 …69.us208 ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %b…
43 bb103: ; preds = %bb76.split, %bb98.preheader
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/
D2007-10-30-LSRCrash.ll16 bb76.split: ; preds = %bb69.outer.split.split, %bb69.us208
19 bb69.outer: ; preds = %bb76.split, %bb98.preheader
20 …%from.0.reg2mem.0.ph.rec = phi i32 [ %tmp75.rec, %bb76.split ], [ 0, %bb98.preheader ] ; <i32> [#…
23 br i1 false, label %bb69.us208, label %bb69.outer.split.split
26 switch i32 0, label %bb76.split [
32 bb69.outer.split.split: ; preds = %bb69.outer
33 switch i8 0, label %bb76.split [
39 bb89: ; preds = %bb69.outer.split.split, %bb69.outer.split.split, %bb69.outer.split.split, %bb69.u…
40 …69.us208 ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %b…
43 bb103: ; preds = %bb76.split, %bb98.preheader
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/
D2007-10-30-LSRCrash.ll16 bb76.split: ; preds = %bb69.outer.split.split, %bb69.us208
19 bb69.outer: ; preds = %bb76.split, %bb98.preheader
20 …%from.0.reg2mem.0.ph.rec = phi i32 [ %tmp75.rec, %bb76.split ], [ 0, %bb98.preheader ] ; <i32> [#…
23 br i1 false, label %bb69.us208, label %bb69.outer.split.split
26 switch i32 0, label %bb76.split [
32 bb69.outer.split.split: ; preds = %bb69.outer
33 switch i8 0, label %bb76.split [
39 bb89: ; preds = %bb69.outer.split.split, %bb69.outer.split.split, %bb69.outer.split.split, %bb69.u…
40 …69.us208 ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %b…
43 bb103: ; preds = %bb76.split, %bb98.preheader
/external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/
Dgrow_stats.h68 void AddSplit(const decision_trees::BinaryNode& split,
144 float sum(int split) const { return sum_[split]; } in sum() argument
145 float square(int split) const { return square_[split]; } in square() argument
147 void update(int split, float old_val, float weight) { in update() argument
148 sum_[split] += weight; in update()
150 square_[split] = square_[split] - old_val * old_val + new_val * new_val; in update()
194 virtual float GiniScore(int split, float* left_sum,
200 virtual float left_count(int split, int class_num) const = 0;
201 virtual float right_count(int split, int class_num) const = 0;
203 virtual void ClassificationAddLeftExample(int split, int64 int_label,
[all …]
/external/libaom/libaom/av1/encoder/
Dvar_based_part.c57 var split[4]; member
62 v4x4 split[4]; member
67 v8x8 split[4]; member
72 v16x16 split[4]; member
77 v32x32 split[4]; member
82 v64x64 split[4]; member
87 var *split[4]; member
98 node->split[i] = &vt->split[i].part_variances.none; in tree_to_node()
105 node->split[i] = &vt->split[i].part_variances.none; in tree_to_node()
112 node->split[i] = &vt->split[i].part_variances.none; in tree_to_node()
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/estimator_batch/
Dcustom_export_strategy.py155 split = gtflow_node.dense_float_binary_split
156 feature_id = split.feature_column
161 inequality_test.threshold.float_value = split.threshold
163 split = gtflow_node.sparse_float_binary_split_default_left.split
165 feature_id = split.feature_column + num_dense
169 (sorted_feature_names[feature_id], split.dimension_id))
175 inequality_test.threshold.float_value = split.threshold
177 split = gtflow_node.sparse_float_binary_split_default_right.split
182 feature_id = split.feature_column + num_dense
186 (sorted_feature_names[feature_id], split.dimension_id))
[all …]
/external/jsilver/src/com/google/clearsilver/jsilver/data/
DDefaultHdfParser.java54 Split split; in parseLine() local
55 if ((split = split(line, "=")) != null) { in parseLine()
57 output.setValue(createFullPath(context, split.left), split.right); in parseLine()
58 } else if ((split = split(line, "<<")) != null) { in parseLine()
63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right)); in parseLine()
64 } else if ((split = split(line, "{")) != null) { in parseLine()
67 context.add(split.left); in parseLine()
68 } else if (split(line, "}") != null) { in parseLine()
72 } else if ((split = split(line, ":")) != null) { in parseLine()
74 output.setSymlink(createFullPath(context, split.left), split.right); in parseLine()
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/
Drandom_tree_gen.cc99 DenseFloatBinarySplit* split = GetSplit(&node); in Generate() local
100 const int left_id = split->left_id(); in Generate()
101 const int right_id = split->right_id(); in Generate()
153 DenseFloatBinarySplit* split = nullptr; in ShiftNodeIndex() local
158 split = node.mutable_sparse_float_binary_split_default_left() in ShiftNodeIndex()
162 split = node.mutable_sparse_float_binary_split_default_right() in ShiftNodeIndex()
166 split = node.mutable_dense_float_binary_split(); in ShiftNodeIndex()
171 if (split) { in ShiftNodeIndex()
172 split->set_left_id(shift + split->left_id()); in ShiftNodeIndex()
173 split->set_right_id(shift + split->right_id()); in ShiftNodeIndex()
[all …]
/external/elfutils/libdw/
Dlibdw_find_split_unit.c54 Dwarf_CU *split = NULL; in try_split_file() local
55 while (dwarf_get_units (split_dwarf, split, &split, in try_split_file()
58 if (split->unit_type == DW_UT_split_compile in try_split_file()
59 && cu->unit_id8 == split->unit_id8) in try_split_file()
61 if (tsearch (split->dbg, &cu->dbg->split_tree, in try_split_file()
70 __libdw_link_skel_split (cu, split); in try_split_file()
79 if (cu->split == (Dwarf_CU *) -1) in try_split_file()
94 if (cu->split != (Dwarf_CU *) -1) in __libdw_find_split_unit()
95 return cu->split; in __libdw_find_split_unit()
120 if (cu->split == (Dwarf_CU *) -1) in __libdw_find_split_unit()
[all …]
/external/brotli/c/enc/
Dmetablock_inc.h48 BlockSplit* split, HistogramType** histograms, size_t* histograms_size) { in FN()
58 self->split_ = split; in FN()
65 split->types, split->types_alloc_size, max_num_blocks); in FN()
67 split->lengths, split->lengths_alloc_size, max_num_blocks); in FN()
86 BlockSplit* split = self->split_; in FN() local
93 split->lengths[0] = (uint32_t)self->block_size_; in FN()
94 split->types[0] = 0; in FN()
99 ++split->num_types; in FN()
121 if (split->num_types < BROTLI_MAX_NUMBER_OF_BLOCK_TYPES && in FN()
125 split->lengths[self->num_blocks_] = (uint32_t)self->block_size_; in FN()
[all …]
/external/llvm/test/CodeGen/PowerPC/
Dpr24636.ll18 br i1 undef, label %.lr.ph.split, label %.preheader
21 br i1 undef, label %.lr.ph.split, label %.preheader
23 .lr.ph.split: ; preds = %.preheader, %.lr.ph
24 br i1 undef, label %._crit_edge, label %.lr.ph.split.split
26 .lr.ph.split.split: ; preds = %.lr.ph.split.split, %.lr.ph.split
27 %1 = phi i32 [ %2, %.lr.ph.split.split ], [ undef, %.lr.ph.split ]
30 br i1 %3, label %.lr.ph.split.split, label %._crit_edge
32 ._crit_edge: ; preds = %.lr.ph.split.split, %.lr.ph.split
33 %.lcssa = phi i32 [ undef, %.lr.ph.split ], [ %2, %.lr.ph.split.split ]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/
Dpr24636.ll18 br i1 undef, label %.lr.ph.split, label %.preheader
21 br i1 undef, label %.lr.ph.split, label %.preheader
23 .lr.ph.split: ; preds = %.preheader, %.lr.ph
24 br i1 undef, label %._crit_edge, label %.lr.ph.split.split
26 .lr.ph.split.split: ; preds = %.lr.ph.split.split, %.lr.ph.split
27 %1 = phi i32 [ %2, %.lr.ph.split.split ], [ undef, %.lr.ph.split ]
30 br i1 %3, label %.lr.ph.split.split, label %._crit_edge
32 ._crit_edge: ; preds = %.lr.ph.split.split, %.lr.ph.split
33 %.lcssa = phi i32 [ undef, %.lr.ph.split ], [ %2, %.lr.ph.split.split ]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/CallSiteSplitting/
Dcallsite-split-or-phi.ll10 ;CHECK: br i1 %tobool1, label %Header.split, label %TBB
11 ;CHECK-LABEL: Header.split:
14 ;CHECK: br i1 %cmp, label %TBB.split, label %End
15 ;CHECK-LABEL: TBB.split:
18 ;CHECK: %[[MERGED:.*]] = phi i32 [ %[[CALL1]], %Header.split ], [ %[[CALL2]], %TBB.split ]
39 ;CHECK-LABEL: Header2.split:
41 ;CHECK-LABEL: TBB.split:
44 ;CHECK: %[[MERGED:.*]] = phi i32 [ %[[CALL1]], %Header2.split ], [ %[[CALL2]], %TBB.split ]
68 ;CHECK-LABEL: Header2.split:
70 ;CHECK-LABEL: TBB.split:
[all …]

12345678910>>...194