| /external/valgrind/main/memcheck/tests/ |
| leak-cycle.c | 49 /* one cycle linked to another */
62 /* two linked cycles */
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/config/ |
| user.hpp | 84 // to be linked as dll's rather than static libraries on Microsoft Windows
88 // be statically linked (Boost.Test for example) and others which may only
89 // be dynamically linked (Boost.Threads for example), in these cases this
93 // BOOST_WHATEVER_DYN_LINK: Forces library "whatever" to be linked as a dll
100 // Note that there may be some libraries that can only be statically linked
101 // (Boost.Test for example) and others which may only be dynamically linked
108 // build variant will be automatically selected and linked against,
118 // build variant will be automatically selected and linked against, simply
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| valparam.h | 65 /** Linked list of value/parameter pairs. \internal */
166 /** Create a new linked list of valparams.
178 /** Initialize linked list of valparams.
179 * \param headp linked list
186 /** Destroy (free allocated memory for) linked list of valparams (created with
189 * \param headp linked list
194 /** Append valparam to tail of linked list.
195 * \param headp linked list
206 /** Get first valparam in linked list.
207 * \param headp linked lis
[all...] |
| compat-queue.h | 39 * This file defines four types of data structures: singly-linked lists,
40 * singly-linked tail queues, lists and tail queues.
42 * A singly-linked list is headed by a single forward pointer. The elements
43 * are singly linked for minimum space and pointer manipulation overhead at
47 * macro for this purpose for optimum efficiency. A singly-linked list may
48 * only be traversed in the forward direction. Singly-linked lists are ideal
52 * A singly-linked tail queue is headed by a pair of pointers, one to the
54 * singly linked for minimum space and pointer manipulation overhead at the
59 * A singly-linked tail queue may only be traversed in the forward direction.
60 * Singly-linked tail queues are ideal for applications with large dataset
[all...] |
| /external/chromium_org/cc/output/ |
| program_binding.cc | 57 int linked = 0; local
58 context->GetProgramiv(program_, GL_LINK_STATUS, &linked);
59 if (!linked)
|
| /external/chromium_org/ppapi/native_client/src/untrusted/nacl_ppapi_util/ |
| ppapi_srpc_main.c | 27 * so if this code is compiled and linked with irt=1, the weak symbol
29 * main will succeed. If this code is compiled and linked with irt=0,
39 * Yes, this could be conditionally linked in via scons magic by
|
| /external/chromium_org/ui/gfx/ |
| font_fallback_win_unittest.cc | 12 // Subclass of LinkedFontsIterator for testing that allows mocking the linked
22 // Add a linked font to the mocked vector of linked fonts.
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 22 // E = -sum_n V_n * ( B_n + sum_{n, m linked by b} V_m * F_b )
90 /// value can change when linked nodes change, but convergence is very fast
300 Linked.push_back(ib);
302 Linked.push_back(ob);
310 Linked.clear();
319 Linked.push_back(n);
328 /// @param Linked - Numbers of linked nodes that need updating.
335 if (Linked.empty())
340 // linked nodes with sequential numbers. By scanning the linked node
[all...] |
| /external/chromium_org/third_party/accessibility-audit/ |
| README.chromium | 13 This version has been built from the revision linked in the comment at the top
|
| /external/chromium_org/third_party/mesa/src/src/egl/main/ |
| eglcontext.h | 116 * Unlink a linked context from its display.
127 * Lookup a handle to find the linked context.
128 * Return NULL if the handle has no corresponding linked context.
141 * Return the handle of a linked context, or EGL_NO_CONTEXT.
|
| egldisplay.h | 188 * Lookup a handle to find the linked display.
189 * Return NULL if the handle has no corresponding linked display.
202 * Return the handle of a linked display, or EGL_NO_DISPLAY.
232 * Return true if the resource is linked.
|
| eglimage.h | 112 * Unlink a linked image from its display.
123 * Lookup a handle to find the linked image.
124 * Return NULL if the handle has no corresponding linked image.
137 * Return the handle of a linked image, or EGL_NO_IMAGE_KHR.
|
| eglsurface.h | 137 * Unlink a linked surface from its display.
148 * Lookup a handle to find the linked surface.
149 * Return NULL if the handle has no corresponding linked surface.
162 * Return the handle of a linked surface, or EGL_NO_SURFACE.
|
| /external/chromium_org/third_party/webrtc/modules/audio_conference_mixer/source/ |
| memory_pool_win.h | 39 // Atomic single linked list entry header.
41 // Atomic single linked list payload.
63 // Windows implementation of single linked atomic list, documented here:
66 // Atomic single linked list head.
|
| /external/chromium_org/third_party/webrtc/test/channel_transport/ |
| udp_socket2_manager_win.h | 64 // Atomic single linked list entry header.
66 // Atomic single linked list payload
83 // Sample code for use of msfts single linked atomic list can be found here:
86 // Atomic single linked list head.
|
| /external/compiler-rt/test/asan/TestCases/Linux/ |
| asan_rt_confict_test-2.cc | 25 // CHECK: Your application is linked against incompatible ASan runtimes
|
| /external/eigen/Eigen/ |
| SPQRSupport | 19 * In order to use this module, the SPQR headers must be accessible from the include paths, and your binary must be linked to the SPQR library and its dependencies (Cholmod, AMD, COLAMD,...).
|
| /external/harfbuzz_ng/src/ |
| check-libstdc++.sh | 23 echo "Ouch, linked to libstdc++"
|
| /external/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 44 * This file defines four types of data structures: singly-linked lists,
45 * singly-linked tail queues, lists and tail queues.
47 * A singly-linked list is headed by a single forward pointer. The elements
48 * are singly linked for minimum space and pointer manipulation overhead at
52 * macro for this purpose for optimum efficiency. A singly-linked list may
53 * only be traversed in the forward direction. Singly-linked lists are ideal
57 * A singly-linked tail queue is headed by a pair of pointers, one to the
59 * singly linked for minimum space and pointer manipulation overhead at the
64 * A singly-linked tail queue may only be traversed in the forward direction.
65 * Singly-linked tail queues are ideal for applications with large dataset
[all...] |
| /external/mdnsresponder/ |
| LICENSE | 6 of client code licenses, the shared library code, which is linked
|
| /external/mesa3d/src/egl/main/ |
| eglcontext.h | 116 * Unlink a linked context from its display.
127 * Lookup a handle to find the linked context.
128 * Return NULL if the handle has no corresponding linked context.
141 * Return the handle of a linked context, or EGL_NO_CONTEXT.
|
| egldisplay.h | 188 * Lookup a handle to find the linked display.
189 * Return NULL if the handle has no corresponding linked display.
202 * Return the handle of a linked display, or EGL_NO_DISPLAY.
232 * Return true if the resource is linked.
|
| eglimage.h | 112 * Unlink a linked image from its display.
123 * Lookup a handle to find the linked image.
124 * Return NULL if the handle has no corresponding linked image.
137 * Return the handle of a linked image, or EGL_NO_IMAGE_KHR.
|
| eglsurface.h | 137 * Unlink a linked surface from its display.
148 * Lookup a handle to find the linked surface.
149 * Return NULL if the handle has no corresponding linked surface.
162 * Return the handle of a linked surface, or EGL_NO_SURFACE.
|
| /frameworks/base/cmds/app_process/ |
| Android.mk | 25 # Build a variant of app_process binary linked with ASan runtime.
|
