| /external/selinux/libsepol/include/sepol/ |
| handle.h | 25 * This should reduce the amount of memory required to expand the policy. */
|
| /external/v8/src/ |
| code-factory.h | 45 // Code stubs. Add methods here as needed to reduce dependency on
|
| /external/v8/src/compiler/ |
| change-lowering.h | 26 virtual Reduction Reduce(Node* node) OVERRIDE;
|
| js-builtin-reducer.h | 24 virtual Reduction Reduce(Node* node) OVERRIDE;
|
| machine-operator-reducer.h | 27 virtual Reduction Reduce(Node* node) OVERRIDE;
|
| phi-reducer.h | 17 virtual Reduction Reduce(Node* node) OVERRIDE {
|
| /external/vboot_reference/firmware/2lib/ |
| 2nvstorage.c | 72 /* Macro for vb2_nv_get() single-bit settings to reduce duplicate code. */
80 * TODO: We could reduce the binary size for this code by #ifdef'ing
163 /* Macro for vb2_nv_set() single-bit settings to reduce duplicate code. */
178 * TODO: We could reduce the binary size for this code by #ifdef'ing
|
| /frameworks/base/docs/html/training/efficient-downloads/ |
| regular_updates.jd | 67 <p>You can further reduce the impact of these scheduled alarms by opportunistically reducing their frequency based on how recently your app was used.</p>
69 <p>One approach is to implement an exponential back-off pattern to reduce the frequency of your updates (and / or the degree of prefetching you perform) if the app hasn't been used since the previous update. It's often useful to assert a minimum update frequency and to reset the frequency whenever the app is used, for example:</p>
89 <p>You can use a similar exponential back-off pattern to reduce the effect of failed connections and download errors.</p>
91 <p>The cost of initiating a network connection is the same whether you are able to contact your server and download data or not. For time-sensitive transfers where successful completion is important, an exponential back-off algorithm can be used to reduce the frequency of retries in order to minimize the associated battery impact, for example:</p>
|
| /packages/apps/TvSettings/Settings/res/anim/ |
| setup_scroll_adapter.xml | 18 <!-- Reduce opacity of unselected items to 30% -->
|
| /packages/apps/UnifiedEmail/src/com/android/mail/graphics/ |
| PageMarginDrawable.java | 27 * Allows us to reduce a layer of overdraw by no longer having
|
| /external/bison/po/ |
| ru.po | 45 msgid " Conflict between rule %d and token %s resolved as reduce"
55 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
60 msgid "conflicts: %d shift/reduce\n"
65 msgid "conflicts: %d reduce/reduce\n"
80 msgid "expected %d shift/reduce conflict"
81 msgid_plural "expected %d shift/reduce conflicts"
88 msgid "expected %d reduce/reduce conflict
[all...] |
| ro.po | 44 msgid " Conflict between rule %d and token %s resolved as reduce"
46 " Conflict ?ntre regula %d ?i elementul (token) %s rezolvat ca reduce"
56 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
57 msgstr "conflicte: %d shift/reduce, %d reduce/reduce\n"
61 msgid "conflicts: %d shift/reduce\n"
62 msgstr "conflicte: %d shift/reduce\n
[all...] |
| id.po | 44 msgid " Conflict between rule %d and token %s resolved as reduce"
45 msgstr " Konflik antara aturan %d dan token %s diselesaikan sebagai reduce"
55 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
60 msgid "conflicts: %d shift/reduce\n"
65 msgid "conflicts: %d reduce/reduce\n"
80 msgid "expected %d shift/reduce conflict"
81 msgid_plural "expected %d shift/reduce conflicts
[all...] |
| pt_BR.po | 41 msgid " Conflict between rule %d and token %s resolved as reduce"
42 msgstr " Conflito entre a regra %d e a token %s resolvido como `reduce`."
51 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
56 msgid "conflicts: %d shift/reduce\n"
61 msgid "conflicts: %d reduce/reduce\n"
76 msgid "expected %d shift/reduce conflict"
77 msgid_plural "expected %d shift/reduce conflicts
[all...] |
| da.po | 42 msgid " Conflict between rule %d and token %s resolved as reduce"
52 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
57 msgid "conflicts: %d shift/reduce\n"
62 msgid "conflicts: %d reduce/reduce\n"
77 msgid "expected %d shift/reduce conflict"
78 msgid_plural "expected %d shift/reduce conflicts"
84 msgid "expected %d reduce/reduce conflict
[all...] |
| el.po | 44 msgid " Conflict between rule %d and token %s resolved as reduce"
58 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
63 msgid "conflicts: %d shift/reduce\n"
68 msgid "conflicts: %d reduce/reduce\n"
83 msgid "expected %d shift/reduce conflict"
84 msgid_plural "expected %d shift/reduce conflicts"
90 msgid "expected %d reduce/reduce conflict
[all...] |
| et.po | 40 msgid " Conflict between rule %d and token %s resolved as reduce"
50 msgid "conflicts: %d shift/reduce, %d reduce/reduce\n"
56 msgid "conflicts: %d shift/reduce\n"
61 msgid "conflicts: %d reduce/reduce\n"
76 msgid "expected %d shift/reduce conflict"
77 msgid_plural "expected %d shift/reduce conflicts"
83 msgid "expected %d reduce/reduce conflict
[all...] |
| /external/skia/src/pathops/ |
| SkReduceOrder.cpp | 9 int SkReduceOrder::reduce(const SkDLine& line) { function in class:SkReduceOrder
57 // reduce to a quadratic or smaller
63 int SkReduceOrder::reduce(const SkDQuad& quad) { function in class:SkReduceOrder
197 // reduce to a quadratic or smaller
203 int SkReduceOrder::reduce(const SkDCubic& cubic, Quadratics allowQuadratics) { function in class:SkReduceOrder
265 int order = reducer.reduce(quad);
291 int order = reducer.reduce(cubic, kAllow_Quadratics);
|
| /external/bison/tests/ |
| existing.at | 410 dnl GNU AWK 3.0.6, 3.1.0, and 3.1.1. They reduce the full getline expression
417 dnl That is, like the other versions of GNU AWK, they reduce the full getline
430 [[input.y: conflicts: 265 shift/reduce]],
431 [[input.y: conflicts: 65 shift/reduce]])[
446 dnl - 56 -> 326: reduce -> shift on '*', '/', and '%'
447 dnl - 58 -> 327: reduce -> shift on '*', '/', and '%'
448 dnl - 61 -> 328: reduce -> shift on '*', '/', and '%'
457 NAME [reduce using rule 152 (opt_variable)]
458 '$' [reduce using rule 152 (opt_variable)]
466 NAME [reduce using rule 152 (opt_variable)
[all...] |
| glr-regression.at | 91 [glr-regr1.y: conflicts: 1 shift/reduce
211 [glr-regr2a.y: conflicts: 2 shift/reduce
344 [glr-regr3.y: conflicts: 1 shift/reduce, 1 reduce/reduce
439 [glr-regr4.y: conflicts: 1 reduce/reduce
499 [glr-regr5.y: conflicts: 1 reduce/reduce
551 [glr-regr6.y: conflicts: 1 reduce/reduc
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/ |
| SecP192R1Field.java | 78 reduce(tt, z); method
105 public static void reduce(int[] xx, int[] z) method in class:SecP192R1Field
199 reduce(tt, z); method
208 reduce(tt, z); method
213 reduce(tt, z); method
|
| SecP224R1Field.java | 78 reduce(tt, z); method
105 public static void reduce(int[] xx, int[] z) method in class:SecP224R1Field
205 reduce(tt, z); method
214 reduce(tt, z); method
219 reduce(tt, z); method
|
| /external/tcpdump/ |
| in_cksum.c | 54 #define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1]; ADDCARRY(sum);}
96 REDUCE;
122 REDUCE;
127 REDUCE;
146 REDUCE;
|
| /external/v8/test/cctest/compiler/ |
| test-js-typed-lowering.cc | 74 Node* reduce(Node* node) { function in class:JSTypedLoweringTester
77 Reduction reduction = reducer.Reduce(node);
104 return reduce(Unop(op, Parameter(input_type)));
108 return reduce(Binop(op, Parameter(left_type, 0), Parameter(right_type, 1)));
206 Node* r = R.reduce(add);
223 Node* r = R.reduce(add);
250 Node* r = R.reduce(add);
320 Node* r = R.reduce(add);
380 Node* r = R.reduce(add);
426 Node* r = R.reduce(c)
[all...] |
| /packages/apps/ExactCalculator/src/com/android/calculator2/ |
| BoundedRational.java | 68 BoundedRational nicer = reduce().positiveDen();
107 private BoundedRational reduce() { method in class:BoundedRational
119 result = result.reduce();
147 if (!r.mDen.equals(BigInteger.ONE)) r = r.reduce();
169 // It's tempting but marginally unsound to reduce 0 * null to zero.
200 r = r.positiveDen().reduce();
404 exp = exp.reduce().positiveDen();
443 r = r.reduce().positiveDen();
511 r = r.reduce();
|
