| /external/skia/src/core/ |
| SkRegionPriv.h | 32 RunHead* head = (RunHead*)sk_malloc_throw(sizeof(RunHead) + count * sizeof(RunType)); local
33 head->fRefCnt = 1;
34 head->fRunCount = count;
35 return head;
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| StructureChain.h | 45 static StructureChain* create(JSGlobalData& globalData, Structure* head) { return new (&globalData) StructureChain(globalData, globalData.structureChainStructure.get(), head); }
46 WriteBarrier<Structure>* head() { return m_vector.get(); } function in class:JSC::StructureChain
52 StructureChain(JSGlobalData&, Structure*, Structure* head);
|
| StructureChain.cpp | 37 StructureChain::StructureChain(JSGlobalData& globalData, Structure* structure, Structure* head)
41 for (Structure* current = head; current; current = current->storedPrototype().isNull() ? 0 : asObject(current->storedPrototype())->structure())
47 for (Structure* current = head; current; current = current->storedPrototype().isNull() ? 0 : asObject(current->storedPrototype())->structure())
|
| /external/qemu/ |
| qlist.c | 35 QTAILQ_INIT(&qlist->head);
70 QTAILQ_INSERT_TAIL(&qlist->head, entry, next);
84 QTAILQ_FOREACH(entry, &qlist->head, next)
93 if (qlist == NULL || QTAILQ_EMPTY(&qlist->head)) {
97 entry = QTAILQ_FIRST(&qlist->head);
98 QTAILQ_REMOVE(&qlist->head, entry, next);
111 if (qlist == NULL || QTAILQ_EMPTY(&qlist->head)) {
115 entry = QTAILQ_FIRST(&qlist->head);
124 return QTAILQ_EMPTY(&qlist->head);
150 QTAILQ_FOREACH_SAFE(entry, &qlist->head, next, next_entry)
[all...] |
| notify.h | 32 #define NOTIFIER_LIST_INITIALIZER(head) \
33 { QTAILQ_HEAD_INITIALIZER((head).notifiers) }
|
| /external/javassist/src/main/javassist/compiler/ast/ |
| FieldDecl.java | 27 public Declarator getDeclarator() { return (Declarator)tail().head(); }
29 public ASTree getInit() { return (ASTree)sublist(2).head(); }
|
| CondExpr.java | 28 public ASTree condExpr() { return head(); }
32 public ASTree thenExpr() { return tail().head(); }
36 public ASTree elseExpr() { return tail().tail().head(); }
|
| /external/webkit/Source/WebCore/dom/ |
| ContainerNodeAlgorithms.h | 34 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
44 GenericNode* head = 0; local
47 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, container);
51 while ((n = head) != 0) {
57 head = next;
62 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, static_cast<GenericNodeContainer*>(n));
114 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container)
135 head = n;
|
| /external/webkit/Source/WebCore/inspector/ |
| ScriptProfile.idl | 32 readonly attribute ScriptProfileNode head;
|
| /external/chromium/third_party/libevent/ |
| event-internal.h | 75 #define TAILQ_FIRST(head) ((head)->tqh_first)
76 #define TAILQ_END(head) NULL
78 #define TAILQ_FOREACH(var, head, field) \
79 for((var) = TAILQ_FIRST(head); \
80 (var) != TAILQ_END(head); \
|
| /frameworks/base/libs/hwui/ |
| Extensions.h | 54 const char* head = current; local
57 head = strchr(current, ' ');
58 String8 s(current, head ? head - current : strlen(current));
63 current = head + 1;
64 } while (head);
|
| /libcore/luni/src/main/java/java/lang/ref/ |
| FinalizerReference.java | 25 private static FinalizerReference head = null; field in class:FinalizerReference
51 reference.next = head;
52 if (head != null) {
53 head.prev = reference;
55 head = reference;
68 head = next;
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnSentence.java | 116 * @param head The top clause of this sentence
119 public WnnSentence(WnnClause head, WnnSentence tail) {
122 this.id = head.id;
123 this.candidate = head.candidate;
124 this.stroke = head.stroke;
125 this.frequency = head.frequency;
126 this.partOfSpeech = head.partOfSpeech;
127 this.attribute = head.attribute;
129 this.elements.add(head);
132 this.id = head.id
[all...] |
| /external/chromium/net/base/ |
| address_list.cc | 40 struct addrinfo* head; member in struct:net::AddressList::Data
42 // Indicates which free function to use for |head|.
113 void AddressList::Adopt(struct addrinfo* head) {
114 data_ = new Data(head, true /*is_system_created*/);
117 void AddressList::Copy(const struct addrinfo* head, bool recursive) {
118 data_ = new Data(CreateCopyOfAddrinfo(head, recursive),
122 void AddressList::Append(const struct addrinfo* head) {
123 DCHECK(head);
126 new_head = CreateCopyOfAddrinfo(data_->head, true);
129 new_head = data_->head;
180 const struct addrinfo* AddressList::head() const { function in class:net::AddressList
[all...] |
| /external/valgrind/main/coregrind/m_gdbserver/ |
| inferiors.c | 48 list->head = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next;
67 if (list->head != list->tail)
70 list->head->id = new_id;
78 if (list->head == entry) {
79 list->head = entry->next;
81 list->tail = list->head;
85 cur = &list->head;
119 struct inferior_list_entry *inf = all_threads.head;
138 struct inferior_list_entry *inf = all_threads.head;
[all...] |
| /external/kernel-headers/original/linux/ |
| notifier.h | 43 struct notifier_block *head; member in struct:atomic_notifier_head
48 struct notifier_block *head; member in struct:blocking_notifier_head
52 struct notifier_block *head; member in struct:raw_notifier_head
57 (name)->head = NULL; \
61 (name)->head = NULL; \
64 (name)->head = NULL; \
69 .head = NULL }
72 .head = NULL }
74 .head = NULL }
|
| /external/blktrace/btt/ |
| devmap.c | 25 struct list_head head; member in struct:devmap
44 list_add_tail(&dmp->head, &all_devmaps);
55 struct devmap *dmp = list_entry(p, struct devmap, head);
87 struct devmap *dmp = list_entry(p, struct devmap, head);
89 list_del(&dmp->head);
|
| /libcore/luni/src/main/java/java/util/ |
| ArrayDeque.java | 64 * thus avoiding head and tail wrapping around to equal each
71 * The index of the element at the head of the deque (which is the
75 private transient int head; field in class:ArrayDeque
117 * when head and tail have wrapped around to become equal.
120 assert head == tail;
121 int p = head;
131 head = 0;
143 if (head < tail) {
144 System.arraycopy(elements, head, a, 0, size());
145 } else if (head > tail)
[all...] |
| /external/skia/src/views/ |
| SkTagList.cpp | 29 void SkTagList::DeleteTag(SkTagList** head, U8CPU tag)
33 SkTagList* rec = *head;
45 *head = next;
|
| /external/webkit/Source/JavaScriptCore/profiler/ |
| Profile.h | 42 ProfileNode* head() const { return m_head.get(); } function in class:JSC::Profile
43 void setHead(PassRefPtr<ProfileNode> head) { m_head = head; }
|
| /external/webkit/Tools/BuildSlaveSupport/build.webkit.org-config/public_html/LeaksViewer/ |
| WebInspectorShims.js | 45 profileReady: function(head) {
46 this._callback({ head: head });
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
[all...] |
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
[all...] |
