HomeSort by relevance Sort by last modified time
    Searched defs:Try (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/third_party/sfntly/cpp/src/sfntly/port/
lock.cc 33 bool Lock::Try() {
58 bool Lock::Try() {
  /external/chromium_org/base/synchronization/
lock_impl_posix.cc 38 bool LockImpl::Try() {
lock_impl_win.cc 20 bool LockImpl::Try() {
lock.h 30 bool Try() { return lock_.Try(); }
50 bool Try() {
51 bool rv = lock_.Try();
  /external/libpng/contrib/visupng/
cexcept.h 69 The Try/Catch and Throw statements (described below) implicitly
97 Try/Catch/Throw macros, so it shouldn't be expensive or have side
108 are used by a Try/Catch statement. It does no harm to initialize
112 Try/Catch statement.
115 Try statement
118 The Try/Catch/Throw macros are capitalized in order to avoid
122 A Try/Catch statement has a syntax similar to an if/else statement,
132 If a Throw that uses the same exception context as the Try/Catch is
133 executed within the Try clause (typically within a function called
134 by the Try clause), and the exception is not caught by a neste
    [all...]
  /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/
prototype-1.7.js 67 var Try = {
73 try {
201 try {
509 try {
712 try {
823 try {
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/io/
Code.java 25 private final Try[] tries;
29 short[] instructions, Try[] tries, CatchHandler[] catchHandlers) {
59 public Try[] getTries() {
67 public static class Try {
72 Try(int startAddress, int instructionCount, int handlerOffset) {
  /external/chromium_org/chrome/browser/local_discovery/
privet_url_fetcher.cc 145 void PrivetURLFetcher::Try() {
212 Try();
350 base::Bind(&PrivetURLFetcher::Try, weak_factory_.GetWeakPtr()),
365 Try();
  /external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 392 size_t Try = 0;
393 // If ScaledReg is an invariant, try to find a variant expression.
394 while (Try < BaseRegsSize && !isa<SCEVAddRecExpr>(ScaledReg))
395 std::swap(ScaledReg, BaseRegs[Try++]);
    [all...]

Completed in 1828 milliseconds