| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| ReasonFlags.java | 71 * @param reasons - the bitwise OR of the Key Reason flags giving the
75 int reasons)
77 super(getBytes(reasons), getPadBits(reasons));
81 DERBitString reasons)
83 super(reasons.getBytes(), reasons.getPadBits());
|
| DistributionPoint.java | 17 * reasons [1] ReasonFlags OPTIONAL,
26 ReasonFlags reasons; field in class:DistributionPoint
64 reasons = new ReasonFlags(DERBitString.getInstance(t, false));
74 ReasonFlags reasons,
78 this.reasons = reasons;
89 return reasons;
109 if (reasons != null)
111 v.add(new DERTaggedObject(false, 1, reasons));
132 if (reasons != null
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| ReasonsMask.java | 6 * This class helps to handle CRL revocation reasons mask. Each CRL handles a
7 * certain set of revocation reasons.
14 * Constructs are reason mask with the reasons.
16 * @param reasons The reasons.
18 ReasonsMask(ReasonFlags reasons)
20 _reasons = reasons.intValue();
23 private ReasonsMask(int reasons)
25 _reasons = reasons;
38 * A mask with all revocation reasons
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/x509/ |
| DistributionPoint.java | 45 * reasons [1] ReasonFlags OPTIONAL,
69 private final ReasonFlags reasons; field in class:DistributionPoint
73 ReasonFlags reasons, GeneralNames cRLIssuer) {
74 if ((reasons != null) && (distributionPoint == null) && (cRLIssuer == null)) {
75 throw new IllegalArgumentException("DistributionPoint MUST NOT consist of only the reasons field");
78 this.reasons = reasons;
88 if (reasons != null) {
89 reasons.dumpValue(sb, prefix + " ");
125 values[1] = dp.reasons;
[all...] |
| /packages/apps/Email/src/com/android/email/ |
| SecurityPolicy.java | 128 // This can never be supported at this time. It exists only for historic reasons where
294 int reasons = getInactiveReasons(policy); local
295 if (Email.DEBUG && (reasons != 0)) {
297 if (reasons == 0) {
302 if ((reasons & INACTIVE_NEED_ACTIVATION) != 0) {
305 if ((reasons & INACTIVE_NEED_CONFIGURATION) != 0) {
308 if ((reasons & INACTIVE_NEED_PASSWORD) != 0) {
311 if ((reasons & INACTIVE_NEED_ENCRYPTION) != 0) {
316 return reasons == 0;
368 int reasons = 0 local
[all...] |
| /ndk/tests/device/test-gnustl-full/jni/ |
| Android.mk | 17 # This test enters an infinit loop for unknown reasons!
|
| /ndk/tests/device/test-stlport/jni/ |
| Android.mk | 17 # This test enters an infinit loop for unknown reasons!
|
| /external/valgrind/main/none/tests/s390x/ |
| op_exception.stderr.exp | 6 did not recognise. There are two possible reasons for this.
19 did not recognise. There are two possible reasons for this.
32 did not recognise. There are two possible reasons for this.
45 did not recognise. There are two possible reasons for this.
|
| /external/openssl/crypto/x509v3/ |
| v3_crld.c | 288 if (!strcmp(cnf->name, "reasons"))
290 if (!set_reasons(&point->reasons, cnf->value))
406 ASN1_IMP_OPT(DIST_POINT, reasons, ASN1_BIT_STRING, 1),
551 print_reasons(out, "Only Some Reasons",
575 if(point->reasons)
576 print_reasons(out, "Reasons", point->reasons,
|
| v3_purp.c | 321 if (dp->reasons)
323 if (dp->reasons->length > 0)
324 dp->dp_reasons = dp->reasons->data[0];
325 if (dp->reasons->length > 1)
326 dp->dp_reasons |= (dp->reasons->data[1] << 8);
697 * returns 0 for OK, positive for reason for mismatch, reasons match
|
| x509v3.h | 233 /* All existing reasons */
250 ASN1_BIT_STRING *reasons; member in struct:DIST_POINT_st
|
| /bionic/libdl/ |
| Android.mk | 20 # for x86, exclude libgcc_eh.a for the same reasons as above
|
| /external/ceres-solver/docs/ |
| nnlsq.tex | 11 is a Non-linear least squares problem~\footnote{Ceres can solve a more general version of this problem, but for pedagogical reasons, we will restrict ourselves to this class of problems for now. See section~\ref{chapter:overview} for a full description of the problems that Ceres can solve}. Here $\|\cdot\|$ denotes the Euclidean norm of a vector.
|
| helloworld.tex | 71 Starting from a $x=5$, the solver in two iterations goes to 10~\footnote{Actually the solver ran for three iterations, and it was by looking at the value returned by the linear solver in the third iteration, it observed that the update to the parameter block was too small and declared convergence. Ceres only prints out the display at the end of an iteration, and terminates as soon as it detects convergence, which is why you only see two iterations here and not three.}. The careful reader will note that this is a linear problem and one linear solve should be enough to get the optimal value. The default configuration of the solver is aimed at non-linear problems, and for reasons of simplicity we did not change it in this example. It is indeed possible to obtain the solution to this problem using Ceres in one iteration. Also note that the solver did get very close to the optimal function value of 0 in the very first iteration. We will discuss these issues in greater detail when we talk about convergence and parameter settings for Ceres.
|
| bundleadjustment.tex | 4 One of the main reasons for writing Ceres was our need to solve large scale bundle adjustment problems~\cite{hartley-zisserman-book-2004,triggs-etal-1999}.
|
| /external/webkit/LayoutTests/dom/html/level2/html/ |
| HTMLModElement01.js | 105 assertURIEquals("citeLink",null,null,null,"ins-reasons.html",null,null,null,null,vcite);
|
| HTMLModElement03.js | 105 assertURIEquals("citeLink",null,null,null,"del-reasons.html",null,null,null,null,vcite);
|
| /external/webkit/LayoutTests/dom/xhtml/level2/html/ |
| HTMLModElement01.js | 105 assertURIEquals("citeLink",null,null,null,"ins-reasons.html",null,null,null,null,vcite);
|
| HTMLModElement03.js | 105 assertURIEquals("citeLink",null,null,null,"del-reasons.html",null,null,null,null,vcite);
|
| /external/openssl/crypto/x509/ |
| x509_vfy.c | 824 unsigned int reasons, best_reasons = 0; local
832 reasons = *preasons;
833 crl_score = get_crl_score(ctx, &crl_issuer, &reasons, crl, x);
840 best_reasons = reasons;
970 * The reasons mask is also used to determine if the CRL is suitable: if
971 * no new reasons the CRL is rejected, otherwise reasons is updated.
995 /* If no new reasons reject */
1030 /* If no new reasons reject */
1298 unsigned int reasons; local
[all...] |
| /external/libpcap/ |
| grammar.c | 373 const char *reasons[] = PFRES_NAMES; local
376 for (i = 0; reasons[i]; i++) {
377 if (pcap_strcasecmp(reason, reasons[i]) == 0)
[all...] |
| grammar.y | 96 const char *reasons[] = PFRES_NAMES;
99 for (i = 0; reasons[i]; i++) {
100 if (pcap_strcasecmp(reason, reasons[i]) == 0)
|
| /external/oprofile/events/i386/nehalem/ |
| unit_masks | 315 0x01 flags Counts the number of cycles during which execution stalled due to several reasons, one of which is a partial flag register stall
|
| /external/openssl/include/openssl/ |
| x509v3.h | 233 /* All existing reasons */
250 ASN1_BIT_STRING *reasons; member in struct:DIST_POINT_st
|
| /external/iproute2/doc/ |
| ip-tunnels.tex | 424 by historical reasons broadcast mode is not supported by IPIP tunnels,
|
