| /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/chromium_org/mojo/public/cpp/bindings/ |
| struct_ptr.h | 43 U To() const {
91 // Designed to be used when Struct is small and copyable.
108 U To() const {
|
| array.h | 20 // Provides read-only access to array data.
57 U To() const {
|
| string.h | 39 U To() const {
|
| /external/ceres-solver/examples/ |
| libmv_homography.cc | 14 // used to endorse or promote products derived from this software without
18 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 // Permission is hereby granted, free of charge, to any person obtaining a copy
32 // of this software and associated documentation files (the "Software"), to
34 // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
35 // sell copies of the Software, and to permit persons to whom the Software is
36 // furnished to do so, subject to the following conditions
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 27 /// A Range represents the closed range [from, to]. The caller must
28 /// guarantee that from <= to. Note that Range is immutable, so as not
29 /// to subvert RangeSet's immutability.
34 Range(const llvm::APSInt &from, const llvm::APSInt &to)
35 : std::pair<const llvm::APSInt*, const llvm::APSInt*>(&from, &to) {
36 assert(from <= to);
44 const llvm::APSInt &To() const {
48 return &From() == &To() ? &From() : nullptr;
53 ID.AddPointer(&To());
63 // be used to speed up some of the operations in RangeSet
[all...] |
| /external/llvm/lib/TableGen/ |
| SetTheory.cpp | 166 // (sequence "Format", From, To) Generate a sequence of records by name.
172 PrintFatalError(Loc, "Bad args to (sequence \"Format\", From, To): " +
188 int64_t From, To;
197 To = II->getValue();
200 if (To < 0 || To >= (1 << 30))
201 PrintFatalError(Loc, "To out of range");
206 Step *= From <= To ? 1 : -1;
208 if (Step > 0 && From > To)
[all...] |
| /external/chromium_org/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,
51 // included, or there will be a compiler error. This trick is to
202 class To {
204 To(bool* converted) { *converted = true; } // NOLINT
209 To to = ::testing::internal::ImplicitCast_<To>(&converted); local
210 (void)to;
[all...] |
| /external/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,
51 // included, or there will be a compiler error. This trick is to
202 class To {
204 To(bool* converted) { *converted = true; } // NOLINT
209 To to = ::testing::internal::ImplicitCast_<To>(&converted); local
210 (void)to;
[all...] |
| /ndk/sources/third_party/googletest/googletest/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,
51 // included, or there will be a compiler error. This trick is to
202 class To {
204 To(bool* converted) { *converted = true; } // NOLINT
209 To to = ::testing::internal::ImplicitCast_<To>(&converted); local
210 (void)to;
[all...] |
| /external/llvm/lib/CodeGen/ |
| SplitKit.cpp | 93 // back to the call that may throw.
103 // really be live-in to the landing pad. This can happen if the landing pad
109 // Value is properly live-in to the landing pad.
260 // Live segment ends exactly at Stop. Move to the next segment.
398 // No longer a simple mapping. Switch to a complex, non-forced mapping.
439 // We may be trying to avoid interference that ends at a deleted instruction,
562 // value. The inserted COPY is not a kill, and we don't need to recompute
563 // the source live range. The spiller also won't try to hoist this copy.
657 // want to avoid calculating the live range of the source register if
671 DEBUG(dbgs() << " move kill to " << Kill << '\t' << *MBBI)
[all...] |
| StackColoring.cpp | 12 // which represent the possible lifetime of stack slots. It attempts to
16 // TODO: In the future we plan to improve stack coloring in the following ways:
68 /// zone. This can happen when the user returns a reference to a local
69 /// data-structure. We can detect these cases and decide not to optimize the
70 /// code. If this flag is enabled, we try to save the user.
78 STATISTIC(StackSpaceSaved, "Number of bytes saved due to merging slots.");
111 /// Maps serial numbers to basic blocks.
113 /// Maps basic blocks to a serial number.
125 /// The list of lifetime markers found. These markers are to be removed
160 /// slots to use the joint slots
[all...] |
| TwoAddressInstructionPass.cpp | 16 // to:
21 // Note that if a register allocator chooses to use this pass, that it
22 // has to be capable of handling the non-SSA nature of these rewritten
56 STATISTIC(NumCommuted , "Number of instructions commuted to coalesce");
58 STATISTIC(NumConvertedTo3Addr, "Number of instructions promoted to 3-address");
63 // Temporary flag to disable rescheduling.
91 // SrcRegMap - A map from virtual registers to physical registers which are
92 // likely targets to be coalesced to due to copies from physical registers t
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 14 // parameters define the context of the match, which allows matchers to recurse
15 // or store the current node as bound to a specific string, so that it can be
22 // to clang's AST class hierarchy, meaning that you can use a Matcher<Base>
26 // The matcher functions are defined in ASTMatchers.h. To make it possible
27 // to implement both the matcher function and the implementation of the matcher
31 // This file contains the base classes needed to construct the actual matchers.
61 /// \brief Adds \c Node to the map with key \c ID.
69 /// \brief Returns the AST node bound to \c ID.
71 /// Returns NULL if there was no node bound to \c ID or if there is a node but
72 /// it cannot be converted to the specified type
[all...] |
| /external/llvm/lib/Analysis/ |
| ValueTracking.cpp | 1 //===- ValueTracking.cpp - Walk computations to compute properties --------===//
64 // If all of the MaskV bits are known to be zero, then we know the
98 // fall back to the minimum known zeros in both operands.
109 // Are we still trying to solve for the sign bit?
141 // If the multiplication is known not to overflow, compute the sign bit.
180 // Only make use of no-wrap flags if we failed to compute the sign bit
182 // which case we prefer to follow the result of the direct computation,
197 // Use the high end of the ranges to find leading zeros.
212 /// Determine which bits of V are known to be either zero or one and return
215 /// NOTE: we cannot consider 'undef' to be "IsZero" here. The problem is tha
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 71 /// \brief Add BB to the resulting dominator
142 /// Additionally to that even complicated loops look like this:
151 /// 3 3 = "Flow" block, with back edge to entry block
199 void delPhiValues(BasicBlock *From, BasicBlock *To);
201 void addPhiValues(BasicBlock *From, BasicBlock *To);
345 llvm_unreachable("Unhandled condition to invert");
388 // Try to treat it like an ELSE block
412 // Edge from inside a subregion to its entry, ignore it
440 // Analyze all the conditions leading to a node
496 /// \brief Remove all PHI values coming from "From" into "To" and remembe
[all...] |
| /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| rtcp_packet.h | 38 // report_block.To(234)
47 // fir.To(234)
123 // TODO(asapersson): Consider adding a constructor to struct.
129 void To(uint32_t ssrc) {
500 void To(uint32_t ssrc) {
539 void To(uint32_t ssrc) {
591 void To(uint32_t ssrc) {
637 void To(uint32_t ssrc) {
686 void To(uint32_t ssrc) {
731 void To(uint32_t ssrc)
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 66 STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
69 "Number of entry blocks where fast isel failed to lower arguments");
172 "fails to lower an instruction"));
176 "fails to lower a formal argument"));
186 cl::desc("Pop up a window to show dags before the first "
190 cl::desc("Pop up a window to show dags before legalize types"));
193 cl::desc("Pop up a window to show dags before legalize"));
196 cl::desc("Pop up a window to show dags before the second "
200 cl::desc("Pop up a window to show dags before the post legalize types"
204 cl::desc("Pop up a window to show isel dags as they are selected"))
[all...] |
| /external/llvm/lib/IR/ |
| Constants.cpp | 132 // Constructor to create a '0' constant of arbitrary type...
174 // Convert an integer to a pointer, if necessary.
178 // Broadcast a scalar to a vector, if necessary.
202 /// constant that corresponds to the specified element if possible, or null if
237 // references to the constant by other constants in the constant pool. These
252 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
259 // Value has no outstanding references it is safe to delete it now...
289 // Div and rem can trap if the RHS is not known to be non-zero.
359 /// getRelocationInfo - This method classifies the entry according to
361 /// conservative, so if it might codegen to a relocatable entry, it should sa
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| wsdtypes.h | 4 * No warranty is given; refer to the file DISCLAIMER.PD within this package.
81 const WCHAR *To;
|
| /external/clang/lib/AST/ |
| ASTImporter.cpp | 86 DeclarationNameInfo& To);
97 /// \brief Import only the bare bones needed to establish a valid
107 bool ImportDefinition(RecordDecl *From, RecordDecl *To,
109 bool ImportDefinition(VarDecl *From, VarDecl *To,
111 bool ImportDefinition(EnumDecl *From, EnumDecl *To,
113 bool ImportDefinition(ObjCInterfaceDecl *From, ObjCInterfaceDecl *To,
115 bool ImportDefinition(ObjCProtocolDecl *From, ObjCProtocolDecl *To,
129 bool IsStructuralMatch(ClassTemplateDecl *From, ClassTemplateDecl *To);
130 bool IsStructuralMatch(VarTemplateDecl *From, VarTemplateDecl *To);
197 /// declarations, mapping from a declaration in the first context to th
[all...] |
| /external/chromium_org/v8/src/heap/ |
| spaces.h | 37 // Page::kMaxHeapObjectSize, so that they do not have to move during
41 // A store-buffer based write barrier is used to keep track of intergenerational
46 // object maps so if the page belongs to old pointer space or large object
47 // space it is essential to guarantee that the page does not contain any
48 // garbage pointers to new space: every pointer aligned word which satisfies
49 // the Heap::InNewSpace() predicate must be a pointer to a live heap object in
52 // apply to map space which is iterated in a special fashion. However we still
53 // require pointer fields of dead maps to be cleaned.
55 // To enable lazy cleaning of old space pages we can mark chunks of the page
59 // together to form a free list after a GC. Garbage sections created outsid
[all...] |
| /external/clang/lib/Sema/ |
| SemaDeclCXX.cpp | 52 /// the default argument of a parameter to determine whether it
80 /// VisitDeclRefExpr - Visit a reference to a declaration, to
171 // FIXME: If the call to this decl is using any of its default arguments, we
172 // need to search them for potentially-throwing calls.
183 // change to that specification.
198 "and don't know how to handle them anyway.");
259 // 4) to the parameter type. The default argument expression has
276 // Okay: add the default argument to the parameter
296 /// to the parameter declaration
[all...] |
| SemaOverload.cpp | 41 /// A convenience routine for creating a decayed reference to a function.
53 // DiagnoseUseOfDecl to accept both the FoundDecl and the decl
108 /// category corresponding to the given implicit conversion kind.
140 /// corresponding to the given implicit conversion kind.
177 "Lvalue-to-rvalue",
178 "Array-to-pointer",
179 "Function-to-pointer",
190 "Pointer-to-member conversion",
193 "Derived-to-base conversion",
205 /// sequence to the identity conversion
[all...] |
| TreeTransform.h | 42 /// \brief A semantic tree transformation that allows one to transform one
46 /// \c TreeTransform<X> and then overriding certain operations to provide
47 /// behavior specific to that transformation. For example, template
54 /// This tree-transformation template uses static polymorphism to allow
55 /// subclasses to customize any of its operations. Thus, a subclass can
63 /// then passes the pieces on to the "rebuild" step, which constructs a new AST
65 /// routines recursively transform the operands to composite AST nodes (e.g.,
67 /// were changed by the transformation, invokes the rebuild operation to create
78 /// PointerType, StmtExpr) to alter the transformation. As mentioned previously,
80 /// to substitute template arguments for their corresponding templat
[all...] |
