field 149 gtags-cscope/command.c field = p->y1 - FLDLINE; field 151 gtags-cscope/command.c if (field >= FIELDS) { field 152 gtags-cscope/command.c field = FIELDS - 1; field 197 gtags-cscope/command.c field = (field + 1) % FIELDS; field 198 gtags-cscope/command.c if (field == 2) field 199 gtags-cscope/command.c field = 3; field 219 gtags-cscope/command.c field = (field + (FIELDS - 1)) % FIELDS; field 220 gtags-cscope/command.c if (field == 2) field 221 gtags-cscope/command.c field = 1; field 234 gtags-cscope/command.c field = 0; field 248 gtags-cscope/command.c field = FIELDS - 1; field 489 gtags-cscope/command.c field = item->field; field 545 gtags-cscope/command.c addcmd(field, Pattern); /* add to command history */ field 546 gtags-cscope/command.c if (field == CHANGE) { field 559 gtags-cscope/command.c switch (field) { field 572 gtags-cscope/command.c } else if (field == FILENAME && field 85 gtags-cscope/display.c int field; /**< input field */ field 195 gtags-cscope/display.c printw("%c%s: %s", toupper((unsigned char)fields[field].text2[0]), field 196 gtags-cscope/display.c fields[field].text2 + 1, Pattern); field 200 gtags-cscope/display.c if (ogs == YES && field != FILENAME) { field 207 gtags-cscope/display.c if (field == SYMBOL || field == CALLEDBY || field == CALLING) { field 210 gtags-cscope/display.c if (field != FILENAME) { field 229 gtags-cscope/display.c if (field == SYMBOL || field == CALLEDBY || field == CALLING) { field 263 gtags-cscope/display.c if (field == FILENAME) { field 280 gtags-cscope/display.c if (field == SYMBOL || field == CALLEDBY || field == CALLING) { field 283 gtags-cscope/display.c if (field == FILENAME) { field 394 gtags-cscope/display.c fldline = FLDLINE + field; field 395 gtags-cscope/display.c fldcolumn = strlen(fields[field].text1) + strlen(fields[field].text2) + 3; field 457 gtags-cscope/display.c f = fields[field].findfcn; field 480 gtags-cscope/display.c fields[field].text2, Pattern, findresult); field 483 gtags-cscope/display.c fields[field].text2, Pattern); field 201 gtags-cscope/global-cscope.h int field; /**< input field number */ field 249 gtags-cscope/global-cscope.h extern int field; /**< input field */ field 182 gtags-cscope/gtags-cscope.c field = *s - '0'; field 183 gtags-cscope/gtags-cscope.c if (field > 8) { field 184 gtags-cscope/gtags-cscope.c field = 8; field 473 gtags-cscope/gtags-cscope.c field = *buf - '0'; field 68 gtags-cscope/history.c h->field = f; field 135 libdb/queue.h #define SLIST_FOREACH(var, head, field) \ field 136 libdb/queue.h for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next) field 142 libdb/queue.h #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ field 143 libdb/queue.h (elm)->field.sle_next = (slistelm)->field.sle_next; \ field 144 libdb/queue.h (slistelm)->field.sle_next = (elm); \ field 147 libdb/queue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \ field 148 libdb/queue.h (elm)->field.sle_next = (head)->slh_first; \ field 152 libdb/queue.h #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) field 154 libdb/queue.h #define SLIST_REMOVE_HEAD(head, field) do { \ field 155 libdb/queue.h (head)->slh_first = (head)->slh_first->field.sle_next; \ field 158 libdb/queue.h #define SLIST_REMOVE(head, elm, type, field) do { \ field 160 libdb/queue.h SLIST_REMOVE_HEAD((head), field); \ field 164 libdb/queue.h while( curelm->field.sle_next != (elm) ) \ field 165 libdb/queue.h curelm = curelm->field.sle_next; \ field 166 libdb/queue.h curelm->field.sle_next = \ field 167 libdb/queue.h curelm->field.sle_next->field.sle_next; \ field 204 libdb/queue.h #define STAILQ_LAST(head, type, field) \ field 208 libdb/queue.h ((char *)((head)->stqh_last) - __offsetof(struct type, field)))) field 210 libdb/queue.h #define STAILQ_FOREACH(var, head, field) \ field 211 libdb/queue.h for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next) field 213 libdb/queue.h #define STAILQ_INSERT_HEAD(head, elm, field) do { \ field 214 libdb/queue.h if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \ field 215 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ field 219 libdb/queue.h #define STAILQ_INSERT_TAIL(head, elm, field) do { \ field 220 libdb/queue.h (elm)->field.stqe_next = NULL; \ field 222 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ field 225 libdb/queue.h #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ field 226 libdb/queue.h if (((elm)->field.stqe_next = (tqelm)->field.stqe_next) == NULL)\ field 227 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ field 228 libdb/queue.h (tqelm)->field.stqe_next = (elm); \ field 231 libdb/queue.h #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) field 233 libdb/queue.h #define STAILQ_REMOVE_HEAD(head, field) do { \ field 235 libdb/queue.h (head)->stqh_first->field.stqe_next) == NULL) \ field 239 libdb/queue.h #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ field 240 libdb/queue.h if (((head)->stqh_first = (elm)->field.stqe_next) == NULL) \ field 244 libdb/queue.h #define STAILQ_REMOVE(head, elm, type, field) do { \ field 246 libdb/queue.h STAILQ_REMOVE_HEAD(head, field); \ field 250 libdb/queue.h while( curelm->field.stqe_next != (elm) ) \ field 251 libdb/queue.h curelm = curelm->field.stqe_next; \ field 252 libdb/queue.h if((curelm->field.stqe_next = \ field 253 libdb/queue.h curelm->field.stqe_next->field.stqe_next) == NULL) \ field 254 libdb/queue.h (head)->stqh_last = &(curelm)->field.stqe_next; \ field 286 libdb/queue.h #define LIST_FOREACH(var, head, field) \ field 287 libdb/queue.h for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next) field 293 libdb/queue.h #define LIST_INSERT_AFTER(listelm, elm, field) do { \ field 294 libdb/queue.h if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \ field 295 libdb/queue.h (listelm)->field.le_next->field.le_prev = \ field 296 libdb/queue.h &(elm)->field.le_next; \ field 297 libdb/queue.h (listelm)->field.le_next = (elm); \ field 298 libdb/queue.h (elm)->field.le_prev = &(listelm)->field.le_next; \ field 301 libdb/queue.h #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ field 302 libdb/queue.h (elm)->field.le_prev = (listelm)->field.le_prev; \ field 303 libdb/queue.h (elm)->field.le_next = (listelm); \ field 304 libdb/queue.h *(listelm)->field.le_prev = (elm); \ field 305 libdb/queue.h (listelm)->field.le_prev = &(elm)->field.le_next; \ field 308 libdb/queue.h #define LIST_INSERT_HEAD(head, elm, field) do { \ field 309 libdb/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \ field 310 libdb/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ field 312 libdb/queue.h (elm)->field.le_prev = &(head)->lh_first; \ field 315 libdb/queue.h #define LIST_NEXT(elm, field) ((elm)->field.le_next) field 317 libdb/queue.h #define LIST_REMOVE(elm, field) do { \ field 318 libdb/queue.h if ((elm)->field.le_next != NULL) \ field 319 libdb/queue.h (elm)->field.le_next->field.le_prev = \ field 320 libdb/queue.h (elm)->field.le_prev; \ field 321 libdb/queue.h *(elm)->field.le_prev = (elm)->field.le_next; \ field 351 libdb/queue.h #define TAILQ_FOREACH(var, head, field) \ field 352 libdb/queue.h for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field)) field 354 libdb/queue.h #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ field 357 libdb/queue.h (var) = TAILQ_PREV((var), headname, field)) field 364 libdb/queue.h #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) field 366 libdb/queue.h #define TAILQ_PREV(elm, headname, field) \ field 367 libdb/queue.h (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) field 374 libdb/queue.h #define TAILQ_INSERT_HEAD(head, elm, field) do { \ field 375 libdb/queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ field 376 libdb/queue.h (head)->tqh_first->field.tqe_prev = \ field 377 libdb/queue.h &(elm)->field.tqe_next; \ field 379 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ field 381 libdb/queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \ field 384 libdb/queue.h #define TAILQ_INSERT_TAIL(head, elm, field) do { \ field 385 libdb/queue.h (elm)->field.tqe_next = NULL; \ field 386 libdb/queue.h (elm)->field.tqe_prev = (head)->tqh_last; \ field 388 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ field 391 libdb/queue.h #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ field 392 libdb/queue.h if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ field 393 libdb/queue.h (elm)->field.tqe_next->field.tqe_prev = \ field 394 libdb/queue.h &(elm)->field.tqe_next; \ field 396 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ field 397 libdb/queue.h (listelm)->field.tqe_next = (elm); \ field 398 libdb/queue.h (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ field 401 libdb/queue.h #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ field 402 libdb/queue.h (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ field 403 libdb/queue.h (elm)->field.tqe_next = (listelm); \ field 404 libdb/queue.h *(listelm)->field.tqe_prev = (elm); \ field 405 libdb/queue.h (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ field 408 libdb/queue.h #define TAILQ_REMOVE(head, elm, field) do { \ field 409 libdb/queue.h if (((elm)->field.tqe_next) != NULL) \ field 410 libdb/queue.h (elm)->field.tqe_next->field.tqe_prev = \ field 411 libdb/queue.h (elm)->field.tqe_prev; \ field 413 libdb/queue.h (head)->tqh_last = (elm)->field.tqe_prev; \ field 414 libdb/queue.h *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ field 443 libdb/queue.h #define CIRCLEQ_FOREACH(var, head, field) \ field 446 libdb/queue.h (var) = (var)->field.cqe_next) field 448 libdb/queue.h #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ field 451 libdb/queue.h (var) = (var)->field.cqe_prev) field 458 libdb/queue.h #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ field 459 libdb/queue.h (elm)->field.cqe_next = (listelm)->field.cqe_next; \ field 460 libdb/queue.h (elm)->field.cqe_prev = (listelm); \ field 461 libdb/queue.h if ((listelm)->field.cqe_next == (void *)(head)) \ field 464 libdb/queue.h (listelm)->field.cqe_next->field.cqe_prev = (elm); \ field 465 libdb/queue.h (listelm)->field.cqe_next = (elm); \ field 468 libdb/queue.h #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ field 469 libdb/queue.h (elm)->field.cqe_next = (listelm); \ field 470 libdb/queue.h (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \ field 471 libdb/queue.h if ((listelm)->field.cqe_prev == (void *)(head)) \ field 474 libdb/queue.h (listelm)->field.cqe_prev->field.cqe_next = (elm); \ field 475 libdb/queue.h (listelm)->field.cqe_prev = (elm); \ field 478 libdb/queue.h #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ field 479 libdb/queue.h (elm)->field.cqe_next = (head)->cqh_first; \ field 480 libdb/queue.h (elm)->field.cqe_prev = (void *)(head); \ field 484 libdb/queue.h (head)->cqh_first->field.cqe_prev = (elm); \ field 488 libdb/queue.h #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ field 489 libdb/queue.h (elm)->field.cqe_next = (void *)(head); \ field 490 libdb/queue.h (elm)->field.cqe_prev = (head)->cqh_last; \ field 494 libdb/queue.h (head)->cqh_last->field.cqe_next = (elm); \ field 500 libdb/queue.h #define CIRCLEQ_NEXT(elm,field) ((elm)->field.cqe_next) field 502 libdb/queue.h #define CIRCLEQ_PREV(elm,field) ((elm)->field.cqe_prev) field 504 libdb/queue.h #define CIRCLEQ_REMOVE(head, elm, field) do { \ field 505 libdb/queue.h if ((elm)->field.cqe_next == (void *)(head)) \ field 506 libdb/queue.h (head)->cqh_last = (elm)->field.cqe_prev; \ field 508 libdb/queue.h (elm)->field.cqe_next->field.cqe_prev = \ field 509 libdb/queue.h (elm)->field.cqe_prev; \ field 510 libdb/queue.h if ((elm)->field.cqe_prev == (void *)(head)) \ field 511 libdb/queue.h (head)->cqh_first = (elm)->field.cqe_next; \ field 513 libdb/queue.h (elm)->field.cqe_prev->field.cqe_next = \ field 514 libdb/queue.h (elm)->field.cqe_next; \