| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopUnrollPass.cpp | 157 TargetTransformInfo::UnrollingPreferences &UP) { in getUnrollingPreferences() argument
158 UP.Threshold = CurrentThreshold; in getUnrollingPreferences()
159 UP.AbsoluteThreshold = CurrentAbsoluteThreshold; in getUnrollingPreferences()
160 UP.MinPercentOfOptimized = CurrentMinPercentOfOptimized; in getUnrollingPreferences()
161 UP.OptSizeThreshold = OptSizeUnrollThreshold; in getUnrollingPreferences()
162 UP.PartialThreshold = CurrentThreshold; in getUnrollingPreferences()
163 UP.PartialOptSizeThreshold = OptSizeUnrollThreshold; in getUnrollingPreferences()
164 UP.Count = CurrentCount; in getUnrollingPreferences()
165 UP.MaxCount = UINT_MAX; in getUnrollingPreferences()
166 UP.Partial = CurrentAllowPartial; in getUnrollingPreferences()
[all …]
|
| /external/llvm/lib/Target/R600/ |
| D | AMDGPUTargetTransformInfo.cpp | 32 TTI::UnrollingPreferences &UP) { in getUnrollingPreferences() argument
33 UP.Threshold = 300; // Twice the default. in getUnrollingPreferences()
34 UP.MaxCount = UINT_MAX; in getUnrollingPreferences()
35 UP.Partial = true; in getUnrollingPreferences()
60 UP.Threshold = 800; in getUnrollingPreferences()
|
| /external/eigen/blas/ |
| D | level2_impl.h | 87 …func[NOTR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
88 …func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
89 …func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
95 …func[NOTR | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
96 …func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
97 …func[ADJ | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTh… in EIGEN_BLAS_FUNC()
142 …func[NOTR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|0, … in EIGEN_BLAS_FUNC()
143 …func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
144 …func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
150 …func[NOTR | (UP << 2) | (UNIT << 3)] = (internal::triangular_matrix_vector_product<int,Upper|Uni… in EIGEN_BLAS_FUNC()
[all …]
|
| D | level3_impl.h | 78 …func[NOTR | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
79 …func[TR | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
80 …func[ADJ | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
82 …func[NOTR | (RIGHT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
83 …func[TR | (RIGHT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
84 …func[ADJ | (RIGHT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
95 …func[NOTR | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
96 …func[TR | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
97 …func[ADJ | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
99 …func[NOTR | (RIGHT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,… in EIGEN_BLAS_FUNC()
[all …]
|
| D | level2_real_impl.h | 24 …func[UP] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::ru… in EIGEN_BLAS_FUNC()
97 func[UP] = (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run); in EIGEN_BLAS_FUNC()
157 func[UP] = (internal::rank2_update_selector<Scalar,int,Upper>::run); in EIGEN_BLAS_FUNC()
245 …func[UP] = (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,false>::run); in EIGEN_BLAS_FUNC()
296 func[UP] = (internal::packed_rank2_update_selector<Scalar,int,Upper>::run); in EIGEN_BLAS_FUNC()
|
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| D | Token.pm | 20 Readonly my $UP => 3;
21 sub UP { $UP } subroutine
23 Readonly my $MIN_TOKEN_TYPE => $UP + 1;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/token/ |
| D | ANTLRCommonTokenTest.m | 33 token.text = @"<UP>";
36 STAssertNotNil(token.text, @"Token text was nil, was expecting <UP>");
37 …STAssertTrue([token.text isEqualToString:@"<UP>"], @"Token text was not <UP> was instead: %@", tok…
43 ANTLRCommonToken *token = [[ANTLRCommonToken newToken:ANTLRTokenTypeUP Text:@"<UP>"] retain];
46 STAssertNotNil(token.text, @"Token text was nil, was expecting <UP>");
47 …STAssertTrue([token.text isEqualToString:@"<UP>"], @"Token text was not <UP> was instead: %@", tok…
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| D | TreeParser.as | 37 public static const UP:int = TokenConstants.UP; constant in org.antlr.runtime.tree.TreeParser
81 * corresponding UP node.
91 // current node is a subtree, skip to corresponding UP.
92 // must count nesting level to get right UP
95 while ( tokenType!=TokenConstants.EOF && !(tokenType==UP && level==0) ) {
102 else if ( tokenType == UP ) {
106 input.consume(); // consume UP
109 /** We have DOWN/UP nodes in the stream that have no line info; override.
133 if ( e.token==null ) { // could be an UP/DOWN node
|
| D | CommonTreeNodeStream.as | 39 * includes pointers to DOWN and UP and EOF nodes.
62 * This buffer includes pointers to DOWN, UP, and EOF nodes.
81 /** Reuse same DOWN, UP navigation nodes unless this is true */
105 up = this.adaptor.createFromType(TokenConstants.UP, "UP");
126 * Don't do DOWN, UP nodes if its a list (t is isNil).
149 // add UP node if t has children
151 addNavigationNode(TokenConstants.UP);
171 /** As we flatten the tree, we use UP, DOWN nodes to represent
187 navNode = adaptor.createFromType(TokenConstants.UP, "UP");
399 if ( adaptor.getType(stop)==TokenConstants.UP ) {
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| D | SimpleCTP.java | 164 match(input, Token.UP, null); in declaration()
185 match(input, Token.UP, null); in declaration()
224 match(input, Token.UP, null); in variable()
314 match(input, Token.UP, null); in functionHeader()
351 match(input, Token.UP, null); in formalParameter()
468 match(input, Token.UP, null); in block()
598 match(input, Token.UP, null); in forStat()
681 match(input, Token.UP, null); in expr()
702 match(input, Token.UP, null); in expr()
723 match(input, Token.UP, null); in expr()
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| D | SimpleCTP.java | 164 match(input, Token.UP, null); in declaration()
185 match(input, Token.UP, null); in declaration()
224 match(input, Token.UP, null); in variable()
314 match(input, Token.UP, null); in functionHeader()
351 match(input, Token.UP, null); in formalParameter()
468 match(input, Token.UP, null); in block()
598 match(input, Token.UP, null); in forStat()
681 match(input, Token.UP, null); in expr()
702 match(input, Token.UP, null); in expr()
723 match(input, Token.UP, null); in expr()
[all …]
|
| /external/droiddriver/src/io/appium/droiddriver/scroll/ |
| D | Direction.java | 21 import static io.appium.droiddriver.scroll.Direction.PhysicalDirection.UP;
46 UP { enumConstant
60 return UP; in reverse()
105 private final PhysicalDirection[] directions = {UP, DOWN};
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| D | TreeParser.js | 15 UP: org.antlr.runtime.Token.UP property
66 !(tokenType===TP.UP && level===0) )
74 else if ( tokenType === TP.UP ) {
|
| D | CommonTreeNodeStream.js | 43 this.up = this.adaptor.create(Token.UP, "UP");
107 this.addNavigationNode(org.antlr.runtime.Token.UP);
145 navNode = this.adaptor.create(org.antlr.runtime.Token.UP, "UP");
355 if ( this.adaptor.getType(stop)===org.antlr.runtime.Token.UP ) {
|
| /external/llvm/utils/lit/lit/ |
| D | ProgressBar.py | 48 UP = '' #: Move the cursor up one line variable in TerminalController
226 if not (self.term.CLEAR_EOL and self.term.UP and self.term.BOL):
234 self.BOL = self.term.UP + self.term.BOL
268 self.BOL + self.term.UP + self.term.CLEAR_EOL +
278 self.term.UP + self.term.CLEAR_EOL +
279 self.term.UP + self.term.CLEAR_EOL)
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| D | ButtonAnimationComponent.java | 24 public static final int UP = 0; field in ButtonAnimationComponent.Animation
54 if (mSprite.getCurrentAnimation() == Animation.UP) { in update()
68 mSprite.playAnimation(Animation.UP); in update()
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| D | constants.py | 52 UP = 3 variable
54 MIN_TOKEN_TYPE = UP+1
|
| /external/smali/smali/src/main/java/org/jf/smali/ |
| D | smaliTreeWalker.java | 440 match(input, Token.UP, null); in smali_file()
603 match(input, Token.UP, null); in super_spec()
639 match(input, Token.UP, null); in implements_spec()
760 match(input, Token.UP, null); in source_spec()
828 match(input, Token.UP, null); in access_list()
891 match(input, Token.UP, null); in fields()
954 match(input, Token.UP, null); in methods()
1002 match(input, Token.UP, null); in field()
1027 match(input, Token.UP, null); in field()
1071 else if ( (LA8_0==UP||LA8_0==I_ANNOTATIONS) ) { in field_initial_value()
[all …]
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| D | test-trees.rb | 155 [101, DOWN, 102, DOWN, 103, UP, 104, UP, EOF].each_with_index do |type, index|
178 stream.look(-1).type.should == UP
184 stream.look(-1).type.should == UP
207 [107, UP, UP, 104].each do |val|
212 [105, UP].each do |val|
217 stream.look(-1).type.should == UP
297 buffer << type.to_s unless type == DOWN or type == UP
356 stream.look(1).type.should == UP
395 stream.look(1).type.should == UP
398 stream.look(1).type.should == UP
[all …]
|
| /external/libvterm/src/encoding/ |
| D | DECdrawing.tbl | 11 6/10 = U+2518 # BOX DRAWINGS LIGHT UP AND LEFT (bottom-right corner)
14 6/13 = U+2514 # BOX DRAWINGS LIGHT UP AND RIGHT (bottom-left corner)
23 7/6 = U+2534 # BOX DRAWINGS LIGHT UP AND HORIZONTAL
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| D | Token.java | 36 public static final int UP = 3; field
38 public static final int MIN_TOKEN_TYPE = UP+1;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | TreeParser.java | 41 public static final int UP = Token.UP; field in TreeParser
112 while ( tokenType!=Token.EOF && !(tokenType==UP && level==0) ) { in matchAny()
119 else if ( tokenType == UP ) { in matchAny()
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestTreeNodeStream.java | 159 assertEquals(Token.UP, ((Tree)stream.LT(6)).getType()); in testLT()
161 assertEquals(Token.UP, ((Tree)stream.LT(8)).getType()); in testLT()
228 assertEquals(Token.UP, ((Tree)stream.LT(1)).getType()); in testMarkRewindInMiddle()
230 assertEquals(Token.UP, ((Tree)stream.LT(1)).getType()); in testMarkRewindInMiddle()
237 assertEquals(Token.UP, ((Tree)stream.LT(1)).getType()); in testMarkRewindInMiddle()
240 assertEquals(Token.UP, ((Tree)stream.LT(-1)).getType()); in testMarkRewindInMiddle()
366 if ( !(type==Token.DOWN||type==Token.UP) ) { in toNodesOnlyString()
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ANTLRTreeParser.m | 117 * corresponding UP node.
128 // current node is a subtree, skip to corresponding UP.
129 // must count nesting level to get right UP
143 [input consume]; // consume UP
146 /** We have DOWN/UP nodes in the stream that have no line info; override.
173 if ( e.token == nil ) { // could be an UP/DOWN node
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| D | testtree.py | 9 from antlr3 import CommonToken, UP, DOWN, EOF
168 self.failUnlessEqual(UP, stream.LT(6).getType())
170 self.failUnlessEqual(UP, stream.LT(8).getType())
197 self.failUnlessEqual(UP, stream.LT(-1).getType()) #TODO: remove?
206 self.failUnlessEqual(UP, stream.LT(-1).getType()) #TODO: remove?
238 self.failUnlessEqual(UP, stream.LT(1).getType())
240 self.failUnlessEqual(UP, stream.LT(1).getType())
247 self.failUnlessEqual(UP, stream.LT(1).getType())
250 self.failUnlessEqual(UP, stream.LT(-1).getType())
376 101, DOWN, 102, DOWN, 103, 106, DOWN, 107, UP, UP, 104, 105, UP]
[all …]
|