| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/include/cloog/ |
| union_domain.h | 12 * this structure reprensents a node of a linked list of CloogDomain structures.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/cloog/ |
| union_domain.h | 12 * this structure reprensents a node of a linked list of CloogDomain structures.
|
| /external/chromium_org/third_party/WebKit/Source/core/html/canvas/ |
| WebGLUniformLocation.cpp | 49 // If the program has been linked again, then this UniformLocation is no
58 // If the program has been linked again, then this UniformLocation is no
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| synchronization_profiling.h | 42 // mutex.cc, which is not always linked in with spinlock. Hence we
43 // provide a weak definition, which are used if mutex.cc isn't linked in.
|
| /external/chromium_org/third_party/tcmalloc/vendor/ |
| TODO | 20 1) Remove requirement that the heap-checker must be linked last into
27 2) Have tcmalloc work correctly when libpthread is not linked in
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| synchronization_profiling.h | 42 // mutex.cc, which is not always linked in with spinlock. Hence we
43 // provide a weak definition, which are used if mutex.cc isn't linked in.
|
| /external/chromium_org/v8/src/ |
| v8threads.h | 107 // Head of linked list of free states.
109 // Head of linked list of states in use.
|
| /external/eigen/cmake/ |
| FindStandardMathLibrary.cmake | 36 # the test program linked successfully without any linker flag.
53 # the test program linked successfully when linking to the 'm' library
|
| /external/libcap-ng/libcap-ng-0.7/utils/ |
| proc-llist.h | 30 /* This is the node of the linked list. Any data elements that are per
43 /* This is the linked list head. Only data elements that are 1 per
|
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
45 INSIST(!LINKED(elt, link));\
57 INSIST(!LINKED(elt, link));\
69 INSIST(LINKED(elt, link));\
92 INSIST(!LINKED(elt, link));\
105 INSIST(!LINKED(elt, link));\
|
| /external/chromium_org/gpu/command_buffer/tests/ |
| gl_bind_uniform_location_unittest.cc | 76 GLint linked = 0; local
77 glGetProgramiv(program, GL_LINK_STATUS, &linked);
78 EXPECT_EQ(1, linked);
174 GLint linked = 0; local
175 glGetProgramiv(program, GL_LINK_STATUS, &linked);
176 EXPECT_EQ(1, linked);
|
| /external/smack/src/org/jivesoftware/smack/util/ |
| Cache.java | 31 * object lookup. Two linked lists are maintained: one keeps objects in the
36 * <li> A pointer to the node in the linked list that maintains accessed
38 * linear scans of the linked list.
39 * <li> A pointer to the node in the linked list that maintains the age
41 * linear scans of the linked list.</ul>
45 * The object is subsequently moved to the front of the accessed linked list
59 * Linked list to maintain order that cache objects are accessed
65 * Linked list to maintain time that cache objects were initially added
180 // Remove references to linked list nodes
369 // of the linked list until they are no longer too old. We get to avoi
[all...] |
| /external/libpng/contrib/gregbook/ |
| Makefile.unx | 20 # This makefile builds both dynamically and statically linked executables
30 #PNGLIBd = -L$(PNGDIR) -lpng16 # dynamically linked, installed libpng
31 #PNGLIBs = $(PNGDIR)/libpng16.a # statically linked, installed libpng
36 PNGLIBd = -Wl,-rpath,$(PNGDIR) -L$(PNGDIR) -lpng16 # dynamically linked
37 PNGLIBs = $(PNGDIR)/libpng.a # statically linked, local libpng
42 ZLIBd = -L$(ZDIR) -lz # dynamically linked against zlib
43 ZLIBs = $(ZDIR)/libz.a # statically linked against zlib
|
| Makefile.sgi | 19 # This makefile builds dynamically linked executables (against libpng and zlib,
27 PNGLIB = -L/usr/local/lib -lpng16 # dynamically linked against libpng
28 #PNGLIB = /usr/local/lib/libpng16.a # statically linked against libpng
35 ZLIB = -L/usr/local/lib -lz # dynamically linked against zlib
36 #ZLIB = /usr/local/lib/libz.a # statically linked against zlib
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_transition.java | 5 * internally linked together into singly linked lists containing all the
22 * @param nxt next transition in linked list.
70 /** Next transition in linked list of transitions out of a state */
73 /** Next transition in linked list of transitions out of a state */
|
| /external/elfutils/0.153/lib/ |
| list.h | 23 distribute linked combinations of the two. Non-GPL Code permitted under
53 /* Add element to the end of a circular, double-linked list. */
69 /* Remove element from circular, double-linked list. */
96 /* Add element to the front of a single-linked list. */
106 /* Add element to the rear of a circular single-linked list. */
|
| /external/bison/lib/ |
| fd-hook.c | 29 /* The first and last link in the doubly linked list.
80 /* Add the link to the doubly linked list. */
105 /* The link is in use. Remove it from the doubly linked list. */
|
| /external/bison/src/ |
| derives.c | 31 /* Linked list of rule numbers. */
69 /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules
88 /* DSET contains what we need under the form of a linked list. Make
|
| /external/chromium_org/third_party/icu/source/common/ |
| rbbisetb.h | 34 // All of them are strung together in a linked list, which is kept in order
45 RangeDescriptor *fNext; // Next RangeDescriptor in the linked list.
108 RangeDescriptor *fRangeList; // Head of the linked list of RangeDescriptors
|
| /external/chromium_org/third_party/libevent/compat/sys/ |
| queue.h | 39 * This file defines five types of data structures: singly-linked lists,
43 * A singly-linked list is headed by a single forward pointer. The elements
44 * are singly linked for minimum space and pointer manipulation overhead at
48 * macro for this purpose for optimum efficiency. A singly-linked list may
49 * only be traversed in the forward direction. Singly-linked lists are ideal
54 * pointers for a hash table header). The elements are doubly linked
62 * linked to save space, so elements can only be removed from the
69 * linked so that an arbitrary element can be removed without a need to
76 * linked so that an arbitrary element can be removed without a need to
86 * Singly-linked List definitions
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.h | 30 ** All elements of the hash table are on a single doubly-linked list.
34 ** the global doubly-linked list. The contents of the bucket are the
54 ** structure. All elements are stored on a single doubly-linked list.
|
| /external/icu/icu4c/source/common/ |
| rbbisetb.h | 34 // All of them are strung together in a linked list, which is kept in order
45 RangeDescriptor *fNext; // Next RangeDescriptor in the linked list.
108 RangeDescriptor *fRangeList; // Head of the linked list of RangeDescriptors
|
| /external/mdnsresponder/mDNSShared/ |
| dnsextd.h | 45 DomainAuthInfo * updateKeys; // linked list of keys for signing deletion updates
46 DomainAuthInfo * queryKeys; // linked list of keys for queries
151 GenLinkedList eventSources; // linked list of EventSource's
|
| /external/oprofile/opjitconv/ |
| opjitconv.h | 41 /* linked list. see jitentry_list */
116 * list head. The linked list is used during parsing (parse_all) to
119 * and the linked list is not used any more.
|
| /external/qemu/include/qemu/ |
| queue.h | 5 * the implementations. Left in singly-linked lists, lists, simple
44 * This file defines four types of data structures: singly-linked lists,
47 * A singly-linked list is headed by a single forward pointer. The
48 * elements are singly linked for minimum space and pointer manipulation
53 * efficiency. A singly-linked list may only be traversed in the forward
54 * direction. Singly-linked lists are ideal for applications with large
58 * pointers for a hash table header). The elements are doubly linked
66 * linked to save space, so elements can only be removed from the
73 * linked so that an arbitrary element can be removed without a need to
166 * Singly-linked List definitions
[all...] |
