Home
last modified time | relevance | path

Searched refs:elm (Results 1 – 25 of 4037) sorted by relevance

12345678910>>...162

/dports/net/zebra-server/idzebra-2.0.55/tab/
H A Dexplain.abs15 elm (4,550) rpnOperators -
38 elm (4,507) schemas -
45 elm (4,514) costInfo -
46 elm (4,515) variantSets -
54 elm (4,601) dateAdded !
60 elm (4,102) name -
62 elm (4,127) address -
63 elm (4,128) email -
64 elm (4,129) phone -
67 elm (4,1001) string -
[all …]
H A Dgils.abs26 elm (1,1) schemaIdentifier -
27 elm (1,10) rank -
28 elm (1,12) url -
30 elm (2,1) title !:w,!:p,!:s
46 elm (2,2) author !
64 elm (2,6) abstract !
77 elm (4,71)/(4,92) place !
80 elm (4,93) timePeriod !
84 elm (4,93)/(4,101)/(4,36) endingDate !
102 elm (4,70)/(4,55)/(4,29) cost !
[all …]
H A Ddanmarc.abs11 elm 10 DanBib-ID-nummer -
194 elm 96/?/a Opstilling -
241 elm 241 Originaltitel -
244 elm 241/?/r Sprog -
335 elm 500 Periodicums-frekvens -
336 elm 500/? Periodicums-frekvens -
337 elm 500/?/a Periodicums-frekvens -
475 #elm 621/?/a Stednavn Subject
476 #elm 621/?/b Land/stat Subject
586 elm 700/?/b Funktionsbetegnelse -
[all …]
/dports/games/el-data/el_data/
H A Dmaplist.lst1 anitora.elm Anitora
6 cave1.elm Crystal_Caverns
9 cont2map1.elm Idaloran
20 cont2map14.elm Arius
31 cont2map19.elm Hulda
67 cont2map8.elm EVTR
80 map11.elm Tars
101 map4f.elm Tirnym
102 map5nf.elm VotD
110 map8.elm Naralik
[all …]
/dports/net/zebra-server/idzebra-2.0.55/test/charmap/
H A Dx.abs2 # bu elm for title has been modified
25 elm (1,1) schemaIdentifier -
26 elm (1,10) rank -
27 elm (1,12) url -
45 elm (2,2) author !
63 elm (2,6) abstract !
76 elm (4,71)/(4,92) place !
79 elm (4,93) timePeriod !
83 elm (4,93)/(4,101)/(4,36) endingDate !
101 elm (4,70)/(4,55)/(4,29) cost !
[all …]
/dports/net/zebra-server/idzebra-2.0.55/test/config/
H A Dg.abs24 elm (1,1) schemaIdentifier -
25 elm (1,10) rank -
26 elm (1,12) url -
28 elm (2,1) title !:w,!:p,!:s
44 elm (2,2) author !
62 elm (2,6) abstract !
75 elm (4,71)/(4,92) place !
78 elm (4,93) timePeriod !
82 elm (4,93)/(4,101)/(4,36) endingDate !
100 elm (4,70)/(4,55)/(4,29) cost !
[all …]
/dports/textproc/htdig/htdig-3.2.0b6/db/
H A Dshqueue.h62 ((ssize_t *)(((u_int8_t *)(elm)) + (elm)->field.sle_prev))
75 (-(elm)->field.sle_next + SH_PTR_TO_OFF(elm, &(elm)->field.sle_next))
81 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, \
106 (elm)->field.sle_prev - (elm)->field.sle_next; \
107 *SH_LIST_PREV(elm, field) += (elm)->field.sle_next; \
149 (-(elm)->field.stqe_next + SH_PTR_TO_OFF(elm, &(elm)->field.stqe_next))
183 SH_PTR_TO_OFF((elm), &(elm)->field.stqe_next) + \
210 *SH_TAILQ_PREVP(elm, field) += elm->field.stqe_next; \
286 (elm)->field.scqe_prev = (elm)->field.scqe_next - \
299 (elm)->field.scqe_prev = SH_PTR_TO_OFF(elm, head); \
[all …]
H A Dqueue.h79 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
92 &(elm)->field.le_next; \
107 (head)->lh_first = (elm); \
114 (elm)->field.le_prev; \
115 *(elm)->field.le_prev = (elm)->field.le_next; \
134 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
185 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
206 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
207 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
221 (head)->cqh_last = (elm); \
[all …]
/dports/textproc/mifluz/mifluz-0.26.0/db/
H A Dshqueue.h66 ((ssize_t *)(((u_int8_t *)(elm)) + (elm)->field.sle_prev))
79 (-(elm)->field.sle_next + SH_PTR_TO_OFF(elm, &(elm)->field.sle_next))
85 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, \
110 (elm)->field.sle_prev - (elm)->field.sle_next; \
111 *SH_LIST_PREV(elm, field) += (elm)->field.sle_next; \
153 (-(elm)->field.stqe_next + SH_PTR_TO_OFF(elm, &(elm)->field.stqe_next))
187 SH_PTR_TO_OFF((elm), &(elm)->field.stqe_next) + \
214 *SH_TAILQ_PREVP(elm, field) += elm->field.stqe_next; \
290 (elm)->field.scqe_prev = (elm)->field.scqe_next - \
303 (elm)->field.scqe_prev = SH_PTR_TO_OFF(elm, head); \
[all …]
H A Dqueue.h83 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
96 &(elm)->field.le_next; \
111 (head)->lh_first = (elm); \
118 (elm)->field.le_prev; \
119 *(elm)->field.le_prev = (elm)->field.le_next; \
138 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
189 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
210 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
211 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
225 (head)->cqh_last = (elm); \
[all …]
/dports/databases/db18/db-18.1.40/src/dbinc/
H A Dshqueue.h53 (elm)->field.sce_next = (elm)->field.sce_prev = -1
73 (elm)->field.sce_next = SH_PTR_TO_OFF(elm, __next); \
77 (elm)->field.sce_prev = SH_PTR_TO_OFF(elm, listelm); \
84 (elm)->field.sce_prev = SH_PTR_TO_OFF(elm, __prev); \
88 (elm)->field.sce_next = SH_PTR_TO_OFF(elm, listelm); \
182 SH_PTR_TO_OFF(elm, &(elm)->field.sle_next))
190 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, listelm); \
203 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, \
228 (elm)->field.sle_prev - (elm)->field.sle_next; \
324 SH_PTR_TO_OFF(elm, &(elm)->field.stqe_next)))
[all …]
/dports/databases/db5/db-5.3.28/src/dbinc/
H A Dshqueue.h54 (elm)->field.sce_next = (elm)->field.sce_prev = -1
74 (elm)->field.sce_next = SH_PTR_TO_OFF(elm, __next); \
78 (elm)->field.sce_prev = SH_PTR_TO_OFF(elm, listelm); \
85 (elm)->field.sce_prev = SH_PTR_TO_OFF(elm, __prev); \
89 (elm)->field.sce_next = SH_PTR_TO_OFF(elm, listelm); \
172 SH_PTR_TO_OFF(elm, &(elm)->field.sle_next))
180 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, listelm); \
193 (elm)->field.sle_next = SH_PTR_TO_OFF(elm, \
218 (elm)->field.sle_prev - (elm)->field.sle_next; \
314 SH_PTR_TO_OFF(elm, &(elm)->field.stqe_next)))
[all …]
/dports/mail/scam-backscatter/scamback/
H A Dqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
195 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
214 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
303 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
310 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
383 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
419 if (*(elm)->field.tqe_prev != (elm)) \
488 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
[all …]
/dports/sysutils/udfclient/UDFclient.0.8.11/
H A Dqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
195 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
214 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
303 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
376 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
412 if (*(elm)->field.tqe_prev != (elm)) \
481 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
490 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
[all …]
/dports/mail/bogofilter-lmdb/bogofilter-1.2.5/src/
H A Dbsdqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
233 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
307 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
381 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
418 if (*(elm)->field.tqe_prev != (elm)) \
487 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
506 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
609 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/dports/mail/bogofilter/bogofilter-1.2.5/src/
H A Dbsdqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
233 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
307 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
381 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
418 if (*(elm)->field.tqe_prev != (elm)) \
487 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
506 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
609 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/dports/mail/bogofilter-kc/bogofilter-1.2.5/src/
H A Dbsdqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
233 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
307 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
381 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
418 if (*(elm)->field.tqe_prev != (elm)) \
487 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
506 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
609 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/dports/mail/bogofilter-sqlite/bogofilter-1.2.5/src/
H A Dbsdqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
233 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
307 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
381 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
418 if (*(elm)->field.tqe_prev != (elm)) \
487 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
506 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
609 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/dports/net/libarms/libarms-5.01/libarms/
H A Dqueue.h113 if (*(elm)->field.le_prev != (elm)) \
158 *(elm)->field.le_prev = (elm)->field.le_next; \
172 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
233 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
307 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
381 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
418 if (*(elm)->field.tqe_prev != (elm)) \
487 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
506 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
609 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
[all …]
/dports/editors/vigor/vigor-0.016/include/sys/
H A Dqueue.h92 &(elm)->field.le_next; \
107 (head)->lh_first = (elm); \
114 (elm)->field.le_prev; \
115 *(elm)->field.le_prev = (elm)->field.le_next; \
147 (head)->tqh_first = (elm); \
154 *(head)->tqh_last = (elm); \
178 (elm)->field.tqe_prev; \
181 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
211 (head)->cqh_last = (elm); \
231 (head)->cqh_last = (elm); \
[all …]
/dports/x11-toolkits/p5-Prima/Prima-1.63/include/unix/
H A Dqueue.h162 (head)->slh_first = (elm); \
165 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
235 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
308 (head)->lh_first = (elm); \
312 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
317 (elm)->field.le_prev; \
318 *(elm)->field.le_prev = (elm)->field.le_next; \
352 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
402 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
479 #define CIRCLEQ_NEXT(elm,field) ((elm)->field.cqe_next) argument
[all …]
/dports/mail/milter-greylist/milter-greylist-4.6.4/
H A Dqueue.h118 if (*(elm)->field.le_prev != (elm)) \
163 *(elm)->field.le_prev = (elm)->field.le_next; \
181 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
252 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
345 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
438 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
477 if (*(elm)->field.tqe_prev != (elm)) \
546 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
584 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
611 if ((elm)->field.cqe_next->field.cqe_prev != (elm)) \
[all …]
/dports/devel/mk-configure/mk-configure-0.37.0/features/
H A Dnetbsd_sys_queue.h115 if (*(elm)->field.le_prev != (elm)) \
160 *(elm)->field.le_prev = (elm)->field.le_next; \
178 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
249 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
342 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
435 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
474 if (*(elm)->field.tqe_prev != (elm)) \
543 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
581 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
608 if ((elm)->field.cqe_next->field.cqe_prev != (elm)) \
[all …]
/dports/www/firefox-esr/firefox-91.8.0/security/nss/lib/dbm/include/
H A Dqueue.h105 #define LIST_REMOVE(elm, field) \
107 if ((elm)->field.le_next != NULL) \
108 (elm)->field.le_next->field.le_prev = \
109 (elm)->field.le_prev; \
110 *(elm)->field.le_prev = (elm)->field.le_next; \
148 #define TAILQ_INSERT_TAIL(head, elm, field) \
150 (elm)->field.tqe_next = NULL; \
151 (elm)->field.tqe_prev = (head)->tqh_last; \
152 *(head)->tqh_last = (elm); \
153 (head)->tqh_last = &(elm)->field.tqe_next; \
[all …]
/dports/sysutils/vector/vector-0.10.0/cargo-crates/krb5-src-0.2.4+1.18.2/krb5/src/plugins/kdb/db2/libdb2/include/
H A Ddb-queue.h92 &(elm)->field.le_next; \
100 (head)->lh_first = (elm); \
107 (elm)->field.le_prev; \
108 *(elm)->field.le_prev = (elm)->field.le_next; \
140 (head)->tqh_first = (elm); \
147 *(head)->tqh_last = (elm); \
164 (elm)->field.tqe_prev; \
167 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
197 (head)->cqh_last = (elm); \
217 (head)->cqh_last = (elm); \
[all …]

12345678910>>...162