HomeSort by relevance Sort by last modified time
    Searched refs:elm (Results 1 - 25 of 31) sorted by null

1 2

  /external/qemu/
qemu-queue.h 103 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \
104 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
106 &(elm)->field.le_next; \
107 (listelm)->field.le_next = (elm); \
108 (elm)->field.le_prev = &(listelm)->field.le_next; \
111 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \
112 (elm)->field.le_prev = (listelm)->field.le_prev; \
113 (elm)->field.le_next = (listelm); \
114 *(listelm)->field.le_prev = (elm); \
115 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
sys-tree.h 86 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
87 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
131 /* Finds the node with the same key as elm */ \
133 name##_SPLAY_FIND(SYS_TREE_STRUCT name *head, SYS_TREE_STRUCT type *elm) \
137 name##_SPLAY(head, elm); \
138 if ((cmp)(elm, (head)->sph_root) == 0) \
144 name##_SPLAY_NEXT(SYS_TREE_STRUCT name *head, SYS_TREE_STRUCT type *elm) \
146 name##_SPLAY(head, elm); \
    [all...]
  /bionic/libc/include/sys/
queue.h 105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
  /development/ndk/platforms/android-3/include/sys/
queue.h 105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/
queue.h 105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
  /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/sys/
queue.h 105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
  /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/sys/
queue.h 105 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
106 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
108 &(elm)->field.le_next; \
109 (listelm)->field.le_next = (elm); \
110 (elm)->field.le_prev = &(listelm)->field.le_next; \
113 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
114 (elm)->field.le_prev = (listelm)->field.le_prev; \
115 (elm)->field.le_next = (listelm); \
116 *(listelm)->field.le_prev = (elm); \
117 (listelm)->field.le_prev = &(elm)->field.le_next;
    [all...]
  /external/chromium/third_party/libevent/compat/sys/
queue.h 109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next
    [all...]
  /external/ipsec-tools/src/include-glibc/sys/
queue.h 138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
150 #define SLIST_REMOVE(head, elm, type, field) do { \
151 if (SLIST_FIRST((head)) == (elm)) { \
    [all...]
  /external/chromium/third_party/libevent/
event-internal.h 77 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
82 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
83 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
84 (elm)->field.tqe_next = (listelm); \
85 *(listelm)->field.tqe_prev = (elm); \
86 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
  /external/ipsec-tools/src/racoon/
var.h 99 #define LIST_FOREACH(elm, head, field) \
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
schedule.c 57 #define TAILQ_FOREACH(elm, head, field) \
58 for (elm = TAILQ_FIRST(head); elm; elm = TAILQ_NEXT(elm, field))
rsalist.c 61 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
  /external/wpa_supplicant/wpa_gui-qt4/
eventhistory.cpp 88 elm = new EventListModel(parent);
89 eventListView->setModel(elm);
96 delete elm;
116 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"),
eventhistory.h 60 EventListModel *elm; member in class:EventHistory
  /external/wpa_supplicant_6/wpa_supplicant/wpa_gui-qt4/
eventhistory.cpp 91 elm = new EventListModel(parent);
92 eventListView->setModel(elm);
99 delete elm;
125 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"),
eventhistory.h 60 EventListModel *elm; member in class:EventHistory
  /external/v8/src/
list-inl.h 130 bool List<T, P>::Contains(const T& elm) {
132 if (data_[i] == elm)
list.h 116 bool Contains(const T& elm);
jsregexp.cc 1772 TextElement elm = elms_->at(k); local
2296 TextElement elm = elms_->at(i); local
2355 TextElement elm = elms_->last(); local
2462 TextElement elm = elms_->at(i); local
2479 TextElement elm = elms_->at(elms_->length() - 1); local
3245 TextElement elm = that->elements()->at(i); local
4763 TextElement& elm = elements()->at(i); local
5118 TextElement elm = that->elements()->at(0); local
    [all...]
execution.cc 515 Object* elm = local
517 if (elm->IsJSFunction()) return Handle<JSFunction>(JSFunction::cast(elm));
  /external/chromium/third_party/icu/source/i18n/
ucol_bld.cpp 1211 UCAElements elm; local
    [all...]
  /external/icu4c/i18n/
ucol_bld.cpp 1211 UCAElements elm; local
    [all...]
  /libcore/luni/src/test/java/tests/api/java/util/
LinkedListTest.java 470 Object elm; local
481 elm = i2.next();
483 elm == objArray[n]);
491 elm = i1.next();
493 elm == objArray[n]);
  /external/bluetooth/glib/tests/
queue-test.c 85 check_max (gpointer elm, gpointer user_data)
88 gint element = GPOINTER_TO_INT (elm);
95 check_min (gpointer elm, gpointer user_data)
98 gint element = GPOINTER_TO_INT (elm);
125 delete_elm (gpointer elm, gpointer user_data)
127 g_queue_remove ((GQueue *)user_data, elm);
421 gpointer elm = g_queue_peek_nth (q, n); local
432 g_assert (elm == g_queue_pop_nth (q, n));

Completed in 268 milliseconds

1 2