| /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/tests/ |
| 049-if-expression-precedence.c | 2 failure with operator precedence
|
| /external/mesa3d/src/glsl/glcpp/tests/ |
| 049-if-expression-precedence.c | 2 failure with operator precedence
|
| /external/chromium_org/v8/src/ |
| token.cc | 34 #define T(name, string, precedence) #name,
41 #define T(name, string, precedence) string,
48 #define T(name, string, precedence) precedence,
|
| /external/v8/src/ |
| token.cc | 34 #define T(name, string, precedence) #name,
41 #define T(name, string, precedence) string,
48 #define T(name, string, precedence) precedence,
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| CollapsedBorderValue.h | 44 CollapsedBorderValue(const BorderValue& border, const Color& color, EBorderPrecedence precedence)
49 , m_precedence(precedence)
59 EBorderPrecedence precedence() const { return static_cast<EBorderPrecedence>(m_precedence); } function in class:WebCore::CollapsedBorderValue
63 return width() == o.width() && style() == o.style() && precedence() == o.precedence();
|
| /external/smack/src/org/xbill/DNS/ |
| IPSECKEYRecord.java | 35 private int precedence; field in class:IPSECKEYRecord
50 * @param precedence The record's precedence.
57 IPSECKEYRecord(Name name, int dclass, long ttl, int precedence,
62 this.precedence = checkU8("precedence", precedence);
100 precedence = in.readU8();
125 precedence = st.getUInt8();
153 sb.append(precedence);
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/subcommands/ |
| expand.py | 61 def _add_size(precedence, bucket, depth, committed, sizes):
62 stacktrace_sequence = precedence
89 precedence = ''
90 precedence += '(alloc=%d) ' % int(words[ALLOC_COUNT])
91 precedence += '(free=%d) ' % int(words[FREE_COUNT])
93 precedence += '(type=%s) ' % bucket.symbolized_typeinfo
94 precedence += '(type.name=%s) ' % bucket.typeinfo_name
95 ExpandCommand._add_size(precedence, bucket, depth,
|
| /frameworks/compile/mclinker/lib/Support/ |
| DefSymParser.cpp | 22 static inline int precedence(const char* x) function
64 if (precedence(si) <= precedence(operatorStack.top())) {
65 // if the precedence of incoming operator is less or equal to
66 // top of stack, we clear stack till top is lower precedence
69 if (precedence(si) <= precedence(operatorStack.top())) {
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| toy.ml | 7 * 1 is the lowest precedence. *)
|
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
|
| toy.ml | 9 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
|
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
100 (* If this is a binop, find its precedence. *)
102 let token_prec = precedence c in
119 let next_prec = precedence c2 in
163 (* Read the precedence if present. *)
|
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
89 (* If this is a binop, find its precedence. *)
91 let token_prec = precedence c in
108 let next_prec = precedence c2 in
|
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /development/tools/idegen/src/ |
| Eclipse.java | 42 * If the user has a file named "path-precedence" in their project's
49 File precedence = new File("path-precedence"); local
50 if (precedence.exists()) {
51 Configuration.parseFile(precedence, patterns);
57 // Everything not matched by the user's precedence spec.
173 * A precedence bucket for source roots.
|
| /external/chromium_org/tools/gn/ |
| parser.h | 25 int precedence; member in struct:ParserHelper
48 // Parses an expression with the given precedence or higher.
49 scoped_ptr<ParseNode> ParseExpression(int precedence);
|
| parser.cc | 21 enum Precedence {
35 // until you hit something of that precedence. There's a dispatch table in
38 // infix, what its precedence is.
171 scoped_ptr<ParseNode> Parser::ParseExpression(int precedence) {
190 precedence <= expressions_[cur_token().type()].precedence) {
243 ParseExpression(expressions_[token.type()].precedence + 1);
333 // Why _OR? We're parsing things that are higher precedence than the ,
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| parser.ml | 5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 var
114 (* If this is a binop, find its precedence. *)
116 let token_prec = precedence c in
133 let next_prec = precedence c2 in
189 (* Read the precedence if present. *)
|
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/chromium_org/net/dns/ |
| address_sorter_posix.cc | 35 // Precedence and label are separate to support override through /etc/gai.conf.
180 unsigned precedence; member in struct:net::__anon9029::DestinationInfo
215 // Rule 6: Prefer higher precedence.
216 if (dst_a->precedence != dst_b->precedence)
217 return dst_a->precedence > dst_b->precedence;
265 info->precedence = GetPolicyValue(precedence_table_, info->address);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| LeftRecursiveRuleAnalyzer.java | 144 int nextPrec = precedence(alt);
230 predST.add("opPrec", precedence(alt));
310 public int precedence(int alt) { method in class:LeftRecursiveRuleAnalyzer
315 int p = precedence(alt);
|
