| /external/ipsec-tools/src/include-glibc/sys/ |
| D | queue.h | 138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
151 if (SLIST_FIRST((head)) == (elm)) { \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
[all …]
|
| /external/libevent/ |
| D | ht-internal.h | 48 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
49 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
50 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
51 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
53 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
54 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
101 #define _HT_SET_HASH(elm, field, hashfn) \ argument
102 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
103 #define _HT_SET_HASHVAL(elm, field, val) \ argument
104 do { (elm)->field.hte_hash = (val); } while (0)
[all …]
|
| D | event-internal.h | 321 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
332 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
333 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
334 (elm)->field.tqe_next = (listelm); \
335 *(listelm)->field.tqe_prev = (elm); \
336 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
|
| /external/dhcpcd-6.8.2/compat/ |
| D | queue.h | 68 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
71 #define TAILQ_PREV(elm, headname, field) \ argument
72 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
94 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
95 if (((elm)->field.tqe_next = (head)->tqh_first) != TAILQ_END(head))\
97 &(elm)->field.tqe_next; \
99 (head)->tqh_last = &(elm)->field.tqe_next; \
100 (head)->tqh_first = (elm); \
101 (elm)->field.tqe_prev = &(head)->tqh_first; \
104 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
|
| /external/jemalloc/include/jemalloc/internal/ |
| D | rtree.h | 103 rtree_node_elm_t *elm, unsigned level);
114 rtree_node_elm_t *rtree_child_tryread(rtree_node_elm_t *elm);
115 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
117 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 void rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm,
160 rtree_child_tryread(rtree_node_elm_t *elm) in rtree_child_tryread() argument
165 child = elm->child; in rtree_child_tryread()
167 child = atomic_read_p(&elm->pun); in rtree_child_tryread()
172 rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level) in rtree_child_read() argument
176 child = rtree_child_tryread(elm); in rtree_child_read()
[all …]
|
| D | tcache.h | 472 tcaches_t *elm = &tcaches[ind]; in tcaches_get() local
473 if (unlikely(elm->tcache == NULL)) in tcaches_get()
474 elm->tcache = tcache_create(tsd, arena_choose(tsd, NULL)); in tcaches_get()
475 return (elm->tcache); in tcaches_get()
|
| D | arena.h | 1177 arena_chunk_map_misc_t *elm = arena_miscelm_get(chunk, in arena_prof_tctx_get() local
1179 ret = atomic_read_p(&elm->prof_tctx_pun); in arena_prof_tctx_get()
1203 arena_chunk_map_misc_t *elm; in arena_prof_tctx_set() local
1207 elm = arena_miscelm_get(chunk, pageind); in arena_prof_tctx_set()
1208 atomic_write_p(&elm->prof_tctx_pun, tctx); in arena_prof_tctx_set()
1235 arena_chunk_map_misc_t *elm; in arena_prof_tctx_reset() local
1243 elm = arena_miscelm_get(chunk, pageind); in arena_prof_tctx_reset()
1244 atomic_write_p(&elm->prof_tctx_pun, in arena_prof_tctx_reset()
|
| /external/ipsec-tools/src/racoon/ |
| D | var.h | 99 #define LIST_FOREACH(elm, head, field) \ argument
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
|
| D | schedule.c | 57 #define TAILQ_FOREACH(elm, head, field) \ argument
58 for (elm = TAILQ_FIRST(head); elm; elm = TAILQ_NEXT(elm, field))
|
| D | rsalist.c | 61 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
|
| /external/v8/src/ |
| D | list-inl.h | 88 void List<T, P>::Set(int index, const T& elm) { in Set() argument
90 data_[index] = elm; in Set()
95 void List<T, P>::InsertAt(int index, const T& elm, P alloc) { in InsertAt() argument
97 Add(elm, alloc); in InsertAt()
101 data_[index] = elm; in InsertAt()
118 bool List<T, P>::RemoveElement(const T& elm) { in RemoveElement() argument
120 if (data_[i] == elm) { in RemoveElement()
183 bool List<T, P>::Contains(const T& elm) const { in Contains() argument
185 if (data_[i] == elm) in Contains()
193 int List<T, P>::CountOccurrences(const T& elm, int start, int end) const { in CountOccurrences() argument
[all …]
|
| D | list.h | 122 bool RemoveElement(const T& elm);
148 bool Contains(const T& elm) const;
149 int CountOccurrences(const T& elm, int start, int end) const;
|
| D | string-stream.cc | 81 int elm = 0; in Add() local
83 if (format[offset] != '%' || elm == elms.length()) { in Add()
102 FmtElm current = elms[elm++]; in Add()
|
| D | builtins.cc | 641 void visit(uint32_t i, Handle<Object> elm) { in visit() argument
650 storage_->set(index, *elm); in visit()
666 SeededNumberDictionary::AtNumberPut(dict, index, elm, false); in visit()
|
| /external/jemalloc/src/ |
| D | tcache.c | 446 tcaches_t *elm; in tcaches_create() local
462 elm = tcaches_avail; in tcaches_create()
464 elm->tcache = tcache; in tcaches_create()
465 *r_ind = (unsigned)(elm - tcaches); in tcaches_create()
467 elm = &tcaches[tcaches_past]; in tcaches_create()
468 elm->tcache = tcache; in tcaches_create()
477 tcaches_elm_flush(tsd_t *tsd, tcaches_t *elm) in tcaches_elm_flush() argument
480 if (elm->tcache == NULL) in tcaches_elm_flush()
482 tcache_destroy(tsd, elm->tcache); in tcaches_elm_flush()
483 elm->tcache = NULL; in tcaches_elm_flush()
[all …]
|
| D | rtree.c | 123 rtree_child_read_hard(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level) in rtree_child_read_hard() argument
126 return (rtree_node_init(rtree, level, &elm->child)); in rtree_child_read_hard()
|
| D | ctl.c | 812 const char *elm, *tdot, *dot; in ctl_lookup() local
816 elm = name; in ctl_lookup()
818 dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot : strchr(elm, '\0'); in ctl_lookup()
819 elen = (size_t)((uintptr_t)dot - (uintptr_t)elm); in ctl_lookup()
836 strncmp(elm, child->name, elen) == 0) { in ctl_lookup()
854 index = malloc_strtoumax(elm, NULL, 10); in ctl_lookup()
893 elm = &dot[1]; in ctl_lookup()
894 dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot : in ctl_lookup()
895 strchr(elm, '\0'); in ctl_lookup()
896 elen = (size_t)((uintptr_t)dot - (uintptr_t)elm); in ctl_lookup()
|
| /external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/ |
| D | eventhistory.cpp | 85 elm = new EventListModel(parent); in EventHistory()
86 eventListView->setModel(elm); in EventHistory()
93 delete elm; in ~EventHistory()
119 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"), in addEvent()
|
| D | eventhistory.h | 54 EventListModel *elm;
|
| /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treebuilders/ |
| D | _base.py | 336 for elm in self.openElements[::-1]:
337 if elm.name == "table":
338 lastTable = elm
|
| /external/v8/src/regexp/ |
| D | jsregexp.cc | 2524 TextElement elm = elements()->at(k); in GetQuickCheckDetails() local
2525 if (elm.text_type() == TextElement::ATOM) { in GetQuickCheckDetails()
2526 Vector<const uc16> quarks = elm.atom()->data(); in GetQuickCheckDetails()
2590 RegExpCharacterClass* tree = elm.char_class(); in GetQuickCheckDetails()
2781 TextElement elm = elements()->at(i); in FilterOneByte() local
2782 if (elm.text_type() == TextElement::ATOM) { in FilterOneByte()
2783 Vector<const uc16> quarks = elm.atom()->data(); in FilterOneByte()
2798 DCHECK(elm.text_type() == TextElement::CHAR_CLASS); in FilterOneByte()
2799 RegExpCharacterClass* cc = elm.char_class(); in FilterOneByte()
3223 TextElement elm = elements()->at(i); in TextEmitPass() local
[all …]
|
| D | regexp-ast.h | 348 void AddElement(TextElement elm, Zone* zone) { in AddElement() argument
349 elements_.Add(elm, zone); in AddElement()
350 length_ += elm.length(); in AddElement()
|
| /external/v8/benchmarks/ |
| D | deltablue.js | 60 OrderedCollection.prototype.add = function (elm) { argument
61 this.elms.push(elm);
76 OrderedCollection.prototype.remove = function (elm) { argument
80 if (value != elm) {
|
| /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/ |
| D | kv_pb.py | 339 elm=""
340 if printElemNumber: elm="(%d)" % cnt
341 res+=prefix+("value%s: %s\n" % (elm, self.DebugFormatString(e)))
|
| /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/static/ |
| D | jquery.url.js | 74 function getAttrName( elm ) { argument
75 var tn = elm.tagName;
|