/external/bluetooth/glib/glib/ |
H A D | gqueue.h | 42 GList *head; member in struct:_GQueue
|
/external/icu4c/layout/ |
H A D | LEInsertionList.h | 142 * The head of the insertion list. 146 InsertionRecord *head; member in class:LEInsertionList
|
/external/ipsec-tools/src/racoon/ |
H A D | logger.h | 38 int head; member in struct:log
|
H A D | genlist.c | 50 genlist_insert (struct genlist *head, void *data) argument 54 TAILQ_INSERT_HEAD(head, entry, chain); 59 genlist_append (struct genlist *head, void *data) argument 63 TAILQ_INSERT_TAIL(head, entry, chain); 68 genlist_foreach (struct genlist *head, genlist_func_t func, void *arg) argument 72 TAILQ_FOREACH(p, head, chain) { 82 genlist_next (struct genlist *head, struct genlist_entry **buf) argument 86 if (head) 87 p = TAILQ_FIRST(head); 96 genlist_free (struct genlist *head, genlist_freedata_ argument [all...] |
/external/dropbear/ |
H A D | queue.h | 37 struct Link* head; member in struct:Queue
|
/external/kernel-headers/original/linux/ |
H A D | circ_buf.h | 6 int head; member in struct:circ_buf 11 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 14 as a completely full buffer has head == tail, which is the same as 16 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 19 accessing head and tail more than once, so they can change 21 #define CIRC_CNT_TO_END(head,tail,size) \ 23 int n = ((head) + end) & ((size)-1); \ 27 #define CIRC_SPACE_TO_END(head,tai [all...] |
/external/webkit/Source/JavaScriptCore/runtime/ |
H A D | StructureChain.h | 45 static StructureChain* create(JSGlobalData& globalData, Structure* head) { return new (&globalData) StructureChain(globalData, globalData.structureChainStructure.get(), head); } argument 46 WriteBarrier<Structure>* head() { return m_vector.get(); } function in class:JSC::StructureChain 52 StructureChain(JSGlobalData&, Structure*, Structure* head);
|
H A D | StructureChain.cpp | 37 StructureChain::StructureChain(JSGlobalData& globalData, Structure* structure, Structure* head) argument 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/webkit/Source/JavaScriptCore/wtf/ |
H A D | DoublyLinkedList.h | 37 Node* head(); 58 template <typename Node> inline Node* DoublyLinkedList<Node>::head() function in class:WTF::DoublyLinkedList
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRUnbufferedCommonTreeNodeStream.h | 55 NSUInteger head; variable 71 @property (assign, getter=getHead, setter=setHead:) NSUInteger head; variable
|
H A D | FastQueue.h | 68 public T head() { return get(0); } function in class:FastQueue
|
/external/blktrace/btt/ |
H A D | 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);
|
/external/bluetooth/hcidump/parser/ |
H A D | hidp.c | 39 static char *type2str(uint8_t head) argument 41 switch (head & 0xf0) { 67 static char *result2str(uint8_t head) argument 69 switch (head & 0x0f) { 89 static char *operation2str(uint8_t head) argument 91 switch (head & 0x0f) { 109 static char *report2str(uint8_t head) argument 111 switch (head & 0x03) { 125 static char *protocol2str(uint8_t head) argument 127 switch (head [all...] |
/external/checkpolicy/ |
H A D | queue.h | 25 queue_node_ptr_t head; member in struct:queue_info
|
/external/clang/test/CodeGen/ |
H A D | 2008-08-07-AlignPadding1.c | 16 PyGC_Head head; member in struct:gc_generation 21 #define GEN_HEAD(n) (&generations[n].head)
|
H A D | union-init.c | 16 PyGC_Head head; member in struct:gc_generation 23 #define GEN_HEAD(n) (&generations[n].head)
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | IntQueue.java | 27 private IntQueue.Entry head; field in class:IntQueue 37 if (head == null) 38 head = entry; 42 return head == null; 46 if (head == null) 49 int value = head.value; 50 head = head.next; 51 if (head == null)
|
/external/qemu/ |
H A D | qlist.h | 27 QTAILQ_HEAD(,QListEntry) head; member in struct:QList 34 for ((var) = ((qlist)->head.tqh_first); \
|
/external/skia/src/core/ |
H A D | 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/skia/src/gpu/ |
H A D | GrTLList.h | 31 T* head() const { return fHead; } function in class:GrTLList
|
/external/skia/src/utils/ |
H A D | SkSfntUtils.cpp | 33 bool SkSfntUtils::ReadTable_head(SkFontID fontID, SkSfntTable_head* head) { argument 44 head->fVersion = parse_be32(p); 45 head->fRevision = parse_be32(p); 46 head->fCheckSumAdjustment = parse_be32(p); 47 head->fMagicNumber = parse_be32(p); 48 head->fFlags = parse_be16(p); 49 head->fUnitsPerEm = parse_be16(p); 50 head->fDateCreated = parse_be64(p); 51 head->fDateModified = parse_be64(p); 52 head [all...] |
/external/skia/third_party/glu/libtess/ |
H A D | dict.c | 51 DictNode *head; local 55 head = &dict->head; 57 head->key = NULL; 58 head->next = head; 59 head->prev = head; 72 for( node = dict->head.next; node != &dict->head; nod [all...] |
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 30 struct LNode *head; member in struct:LList
|
/external/webkit/Source/JavaScriptCore/profiler/ |
H A D | Profile.h | 42 ProfileNode* head() const { return m_head.get(); } function in class:JSC::Profile 43 void setHead(PassRefPtr<ProfileNode> head) { m_head = head; } argument
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
H A D | tokens.h | 60 TokenBlock *head; member in struct:TokenStream_Rec
|