| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| To.java | 6 * Pursuant to title 15 Untied States Code Section 105, works of NIST
7 * employees are not subject to copyright protection in the United States
8 * and are considered to be in the public domain. As a result, a formal
9 * license is not needed to use the software.
17 * not limited to the correctness, accuracy, reliability or usefulness of
20 * Permission to use this software is contingent upon your acceptance
39 * To SIP Header.
50 public final class To extends AddressParametersHeader implements
61 public To() {
62 super(TO,true)
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 29 /// A Range represents the closed range [from, to]. The caller must
30 /// guarantee that from <= to. Note that Range is immutable, so as not
31 /// to subvert RangeSet's immutability.
36 Range(const llvm::APSInt &from, const llvm::APSInt &to)
37 : std::pair<const llvm::APSInt*, const llvm::APSInt*>(&from, &to) {
38 assert(from <= to);
46 const llvm::APSInt &To() const {
50 return &From() == &To() ? &From() : NULL;
55 ID.AddPointer(&To());
65 // be used to speed up some of the operations in RangeSet
[all...] |
| /external/llvm/utils/TableGen/ |
| SetTheory.cpp | 142 // (sequence "Format", From, To) Generate a sequence of records by name.
146 throw "Bad args to (sequence \"Format\", From, To): " +
154 int64_t From, To;
163 To = II->getValue();
166 if (To < 0 || To >= (1 << 30))
167 throw "To out of range";
172 int Step = From <= To ? 1 : -1;
173 for (To += Step; From != To; From += Step)
[all...] |
| /external/chromium/testing/gtest/test/ |
| gtest-port_test.cc | 15 // contributors may be used to endorse or promote products derived from
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
49 // included, or there will be a compiler error. This trick is to
163 class To {
165 To(bool* converted) { *converted = true; } // NOLINT
170 To to = ::testing::internal::ImplicitCast_<To>(&converted); local
171 (void)to;
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 79 In a nutshell the library was written from scratch with verbose comments to help instruct computer science students how
80 to implement ``bignum'' math. However, the resulting code has proven to be very useful. It has been used by numerous
82 Linux and Windows based x86 to ARM based Gameboys and PPC based MacOS machines.
87 release as well. This textbook is meant to compliment the project by providing a more solid walkthrough of the development
90 Since both\footnote{Note that the MPI files under mtest/ are copyrighted by Michael Fromberger. They are not required to use LibTomMath.} are in the
91 public domain everyone is entitled to do with them as they see fit.
95 LibTomMath is meant to be very ``GCC friendly'' as it comes with a makefile well suited for GCC. However, the library will
96 also build in MSVC, Borland C out of the box. For any other ISO C compiler a makefile will have to be made by the end
100 To build as a static library for GCC issue the followin
[all...] |
| /external/llvm/lib/CodeGen/ |
| SplitKit.cpp | 91 // back to the call that may throw.
238 // Live segment ends exactly at Stop. Move to the next segment.
370 // No longer a simple mapping. Switch to a complex, non-forced mapping.
410 // We may be trying to avoid interference that ends at a deleted instruction,
535 // value. The inserted COPY is not a kill, and we don't need to recompute
536 // the source live range. The spiller also won't try to hoist this copy.
630 // want to avoid calculating the live range of the source register if
644 DEBUG(dbgs() << " move kill to " << Kill << '\t' << *MBBI);
676 // We'll never be able to exit the DefLoop.
692 // Leave loop by going to the immediate dominator of the loop header
[all...] |
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | 1 //===- ValueTracking.cpp - Walk computations to compute properties --------===//
45 /// known to be either zero or one and return them in the KnownZero/KnownOne
46 /// bit sets. This code only analyzes bits in Mask, in order to short-circuit
48 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is that
50 /// it to be an explicit zero. If we don't change it to zero, other code could
108 // it the preferred alignment. Otherwise, we have to assume that it
162 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
163 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
167 // Output known-0 are known to be clear if zero in either the LHS | RHS
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 62 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
80 cl::desc("Pop up a window to show dags before the first "
84 cl::desc("Pop up a window to show dags before legalize types"));
87 cl::desc("Pop up a window to show dags before legalize"));
90 cl::desc("Pop up a window to show dags before the second "
94 cl::desc("Pop up a window to show dags before the post legalize types"
98 cl::desc("Pop up a window to show isel dags as they are selected"));
101 cl::desc("Pop up a window to show sched dags as they are processed"));
104 cl::desc("Pop up a window to show SUnit dags after they are processed"));
161 // instructions are special in various ways, which require special support to
[all...] |
| DAGCombiner.cpp | 10 // This pass combines dag nodes to form fewer, simpler DAG nodes. It can be run
14 // primarily intended to handle simplification opportunities that are implicit
45 STATISTIC(LdStFP2Int , "Number of fp load/store pairs transformed to int");
66 // Worklist of all of the nodes that need to be simplified.
73 /// the instruction to the work lists because they might get more simplified
82 /// visit - call the node-specific routine that knows how to fold each
87 /// AddToWorkList - Add to the work list making sure it's instance is at the
88 /// the back (next to be processed.)
101 SDValue CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
110 SDValue To[] = { Res0, Res1 }
[all...] |
| /external/llvm/lib/VMCore/ |
| Constants.cpp | 80 // Constructor to create a '0' constant of arbitrary type...
119 // Convert an integer to a pointer, if necessary.
123 // Broadcast a scalar to a vector, if necessary.
150 // references to the constant by other constants in the constant pool. These
165 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
173 // Value has no outstanding references it is safe to delete it now...
200 // Div and rem can trap if the RHS is not known to be non-zero.
223 /// getRelocationInfo - This method classifies the entry according to
225 /// conservative, so if it might codegen to a relocatable entry, it should say
228 /// NoRelocation: This constant pool entry is guaranteed to never have
[all...] |
| /external/clang/lib/AST/ |
| ASTImporter.cpp | 89 DeclarationNameInfo& To);
91 bool ImportDefinition(RecordDecl *From, RecordDecl *To,
93 bool ImportDefinition(EnumDecl *From, EnumDecl *To,
103 bool IsStructuralMatch(ClassTemplateDecl *From, ClassTemplateDecl *To);
168 /// declarations, mapping from a declaration in the first context to the
169 /// declaration in the second context that we believe to be equivalent.
173 /// with a declaration in the second context still needs to be verified.
176 /// \brief Declaration (from, to) pairs that are known not to be equivalent
220 /// one of them (if needed!) to ensure that the bit-widths match
[all...] |
| /external/clang/lib/Sema/ |
| SemaDeclCXX.cpp | 47 /// the default argument of a parameter to determine whether it
73 /// VisitDeclRefExpr - Visit a reference to a declaration, to
132 // FIXME: If the call to this decl is using any of its default arguments, we
133 // need to search them for potentially-throwing calls.
144 // change to that specification.
158 "and don't know how to handle them anyway.");
221 // 4) to the parameter type. The default argument expression has
239 // Okay: add the default argument to the parameter
259 /// to the parameter declaration
[all...] |
| SemaOverload.cpp | 37 /// A convenience routine for creating a decayed reference to a
90 /// category corresponding to the given implicit conversion kind.
122 /// corresponding to the given implicit conversion kind.
159 "Lvalue-to-rvalue",
160 "Array-to-pointer",
161 "Function-to-pointer",
172 "Pointer-to-member conversion",
175 "Derived-to-base conversion",
187 /// sequence to the identity conversion.
219 /// a conversion of a pointer or pointer-to-member to bool. This i
[all...] |
| /external/v8/src/ |
| objects.h | 13 // contributors may be used to endorse or promote products derived
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
120 ABSENT = 16 // Used in runtime to indicate a property is absent.
223 // PropertyNormalizationMode is used to specify whether to keep
231 // NormalizedMapSharingMode is used to specify whether a map may be shared
249 // The names of the string instance types are intended to systematically
344 // Since string types are not consecutive, this macro is used to
405 // object type in this causes the compiler to generate most of the boilerplat
[all...] |
