OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:tries
(Results
1551 - 1575
of
2764
) sorted by null
<<
61
62
63
64
65
66
67
68
69
70
>>
/external/iproute2/doc/
ip-tunnels.tex
313
as soon as you loaded module \verb|ipip|. 2.2
tries
to select the best
/external/jetty/src/java/org/eclipse/jetty/util/
URIUtil.java
470
* if the path
tries
to .. above its root.
/external/libchrome/base/files/
file_util_posix.cc
256
// Break loudly here if anyone
tries
to do this.
/external/libchrome/base/trace_event/
memory_dump_manager.cc
601
// or will deadlock (e.g., if ContinueAsyncProcessDump()
tries
to acquire it).
/external/libchrome/dbus/
bus.h
516
//
Tries
to register the object path. Returns true on success.
/external/libevent/
evmap.c
86
/* Helper used by the event_io_map hashtable code;
tries
to return a good hash
/external/libevent/include/event2/
dns.h
447
a win32 host. Preferentially
tries
to use GetNetworkParams; if that fails,
/external/libjpeg-turbo/
README-turbo.txt
256
against libjpeg v7- until the program actually
tries
to call jpeg_mem_src() or
/external/libnfc-nci/src/include/
bt_types.h
480
#define AMP_USE_AMP_IF_PEER_TRIES_IT 1 /* Allow AMP to be used if the peer
tries
to use it */
/external/libnfc-nxp/src/
phHciNfc_Emulation.c
758
* This function
tries
to enable and initialise the UICC connected
[
all
...]
/external/libvncserver/libvncclient/
sockets.c
451
* FindFreeTcpPort
tries
to find unused TCP port in the range
/external/libvpx/libvpx/build/make/
Makefile
274
# This may be useful to revisit in the future (it
tries
to locate libraries
/external/libxml2/doc/devhelp/
libxml2-nanohttp.html
120
</pre><p>This function
tries
to read @len bytes from the existing HTTP connection and saves them in @dest. This is a blocking call.</p>
libxml2-xlink.html
146
</pre><p>Check whether the given node carries the attributes needed to be a link element (or is one of the linking elements issued from the (X)HTML DtDs). This routine don't try to do full checking of the link validity but
tries
to detect and return the appropriate link type.</p>
/external/libxml2/doc/
guidelines.html
221
figure below
tries
to express that mechanism:<img src="catalog.gif"
xmlmem.html
68
also
tries
to give some information about the content and structure of the
/external/libxml2/doc/html/
libxml-nanohttp.html
56
</pre><p>This function
tries
to read @len bytes from the existing HTTP connection and saves them in @dest. This is a blocking call.</p>
libxml-xlink.html
71
</pre><p>Check whether the given node carries the attributes needed to be a link element (or is one of the linking elements issued from the (X)HTML DtDs). This routine don't try to do full checking of the link validity but
tries
to detect and return the appropriate link type.</p>
/external/libxml2/python/
libxml2-python-api.xml
342
<info>Cleanup function for the XML library. It
tries
to reclaim all parsing related global memory allocated for the library processing. It doesn't deallocate any document related memory. Calling this function should not prevent reusing the library but one should call xmlCleanupParser() only when the process has finished using the library or XML document built with it.</info>
/external/libxml2/
xmlmemory.c
589
*
tries
to show some content from the memory block
/external/llvm/docs/
Passes.rst
244
tries
to provide a lazy, caching interface to a common kind of alias
378
ADCE aggressively
tries
to eliminate code. This pass is similar to :ref:`DCE
677
Jump threading
tries
to find distinct threads of control flow running through a
[
all
...]
/external/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h
388
/// \brief
Tries
to add the pointer recorded in RtCheck at index
MemoryDependenceAnalysis.h
247
/// It builds on alias analysis information, and
tries
to provide a lazy,
/external/llvm/include/llvm/CodeGen/
FastISel.h
370
/// It first
tries
to emit an instruction with an immediate operand using
/external/llvm/include/llvm/ExecutionEngine/
ExecutionEngine.h
111
/// behavior can occurs if the user
tries
to do it.
Completed in 2015 milliseconds
<<
61
62
63
64
65
66
67
68
69
70
>>