q 18 examples/mqueue-cpp/mqueue.cpp bool operator() (const MQueue* q) const { return q->getName() == name; }
q 25 examples/mqueue-cpp/mqueue.cpp if (q.empty()) {
q 28 examples/mqueue-cpp/mqueue.cpp Message m = q.top();
q 29 examples/mqueue-cpp/mqueue.cpp q.pop();
q 36 examples/mqueue-cpp/mqueue.cpp q.push(*m);
q 37 examples/mqueue-cpp/mqueue.cpp return q.size();
q 54 examples/mqueue-cpp/mqueue.h bool empty() const { return q.empty(); }
q 65 examples/mqueue-cpp/mqueue.h priority_queue<Message> q;
q 18 examples/mqueue-cpp/mqueue_glue.cpp MQueue *q = MQUEUE_UNBOX(obj);
q 19 examples/mqueue-cpp/mqueue_glue.cpp const char *queue_name = q->getName().c_str();
q 25 examples/mqueue-cpp/mqueue_glue.cpp MQueue *q;
q 26 examples/mqueue-cpp/mqueue_glue.cpp q = MQUEUE_UNBOX(obj);
q 27 examples/mqueue-cpp/mqueue_glue.cpp delete q;
q 66 examples/spigot/spigot.c int k, i, j, l, b, q, r, *array;
q 82 examples/spigot/spigot.c q = 0;
q 84 examples/spigot/spigot.c q += array[j] * 10;
q 85 examples/spigot/spigot.c array[j] = q % (2*j+1);
q 86 examples/spigot/spigot.c q /= 2*j+1;
q 87 examples/spigot/spigot.c q *= j;
q 89 examples/spigot/spigot.c r = b + q/10;
q 90 examples/spigot/spigot.c b = q % 10;
q 110 examples/spigot/spigot.c int k, i, j, l, b, q, r, *array;
q 126 examples/spigot/spigot.c q = 0;
q 128 examples/spigot/spigot.c q += array[j] * 10;
q 129 examples/spigot/spigot.c array[j] = q % j;
q 130 examples/spigot/spigot.c q /= j;
q 132 examples/spigot/spigot.c r = b + q/10;
q 133 examples/spigot/spigot.c b = q % 10;
q 1169 ext/charconv/jconv.c const char *p, *q;
q 1170 ext/charconv/jconv.c for (p=s, q=t; *p && *q; p++, q++) {
q 1172 ext/charconv/jconv.c if (*q != '-' && *q != '_') return FALSE;
q 1174 ext/charconv/jconv.c if (tolower(*p) != tolower(*q)) return FALSE;
q 1177 ext/charconv/jconv.c if (*p || *q) return FALSE;
q 232 ext/mt-random/mt-random.c double q = floor((double)0xffffffff / (double)n);
q 233 ext/mt-random/mt-random.c double qn = q * n;
q 237 ext/mt-random/mt-random.c return Scm_MakeIntegerFromUI((unsigned long)(r/q));
q 592 gc/alloc.c for (p = q; p != 0; p = obj_link(p)){
q 617 gc/alloc.c for (p = q; p != 0; p = obj_link(p)){
q 659 gc/alloc.c ptr_t q;
q 663 gc/alloc.c q = GC_obj_kinds[kind].ok_freelist[size];
q 664 gc/alloc.c if (q != 0) GC_set_fl_marks(q);
q 700 gc/alloc.c register ptr_t q; /* pointer to current object */
q 705 gc/alloc.c q = GC_obj_kinds[kind].ok_freelist[size];
q 706 gc/alloc.c if (q != 0) GC_clear_fl_marks(q);
q 161 gc/backgraph.c #define SET_OH_BG_PTR(p,q) (((oh *)(p)) -> oh_bg_ptr) = HIDE_POINTER(q)
q 167 gc/backgraph.c ptr_t q = GET_OH_BG_PTR(p); \
q 168 gc/backgraph.c if (!((word)q & FLAG_MANY)) { \
q 169 gc/backgraph.c if (q && !((word)q & 1)) s \
q 172 gc/backgraph.c back_edges *orig_be_ = (back_edges *)((word)q & ~FLAG_MANY); \
q 181 gc/backgraph.c q = be_ -> edges[local_]; s \
q 211 gc/backgraph.c ptr_t old_back_ptr = GET_OH_BG_PTR(q);
q 222 gc/backgraph.c GC_ASSERT(p == GC_base(p) && q == GC_base(q));
q 223 gc/backgraph.c if (!GC_HAS_DEBUG_INFO(q) || !GC_HAS_DEBUG_INFO(p)) {
q 229 gc/backgraph.c SET_OH_BG_PTR(q, p);
q 230 gc/backgraph.c if (GOT_LUCKY_NUMBER) ensure_struct(q);
q 234 gc/backgraph.c FOR_EACH_PRED(pred, q, { if (p == pred) return; });
q 235 gc/backgraph.c ensure_struct(q);
q 236 gc/backgraph.c old_back_ptr = GET_OH_BG_PTR(q);
q 251 gc/backgraph.c GC_print_heap_obj(q);
q 368 gc/backgraph.c FOR_EACH_PRED(q, p, {
q 370 gc/backgraph.c if (GC_is_marked(q) && !(FLAG_MANY & (word)GET_OH_BG_PTR(p))) {
q 372 gc/backgraph.c GC_printf2("Found bogus pointer from 0x%lx to 0x%lx\n", q, p);
q 377 gc/backgraph.c this_height = backwards_height(q);
q 412 gc/backgraph.c FOR_EACH_PRED(q, p, {
q 413 gc/backgraph.c if (!GC_is_marked(q) && GC_HAS_DEBUG_INFO(q)) {
q 416 gc/backgraph.c q_height = backwards_height(q);
q 419 gc/backgraph.c p_deepest_obj = q;
q 628 gc/dbg_mlc.c register GC_PTR q = GC_base(p);
q 631 gc/dbg_mlc.c if (q == 0) {
q 636 gc/dbg_mlc.c hhdr = HDR(q);
q 642 gc/dbg_mlc.c GC_change_stubborn(q);
q 648 gc/dbg_mlc.c register GC_PTR q = GC_base(p);
q 651 gc/dbg_mlc.c if (q == 0) {
q 656 gc/dbg_mlc.c hhdr = HDR(q);
q 662 gc/dbg_mlc.c GC_end_stubborn_change(q);
q 1255 gc/dyn_load.c PCR_IL_LoadedSegment * q;
q 1267 gc/dyn_load.c for (q = p -> lf_ls; q != NIL; q = q -> ls_next) {
q 1268 gc/dyn_load.c if ((q -> ls_flags & PCR_IL_SegFlags_Traced_MASK)
q 1271 gc/dyn_load.c ((char *)(q -> ls_addr),
q 1272 gc/dyn_load.c (char *)(q -> ls_addr) + q -> ls_bytes,
q 295 gc/finalize.c ptr_t q, r;
q 304 gc/finalize.c for (q = p; q <= scan_limit; q += ALIGNMENT) {
q 305 gc/finalize.c r = *(ptr_t *)q;
q 307 gc/finalize.c GC_PUSH_ONE_HEAP((word)r, q);
q 791 gc/include/gc.h GC_API GC_PTR GC_same_obj GC_PROTO((GC_PTR p, GC_PTR q));
q 853 gc/include/gc.h (*(void **)GC_is_visible(p) = GC_is_valid_displacement(q))
q 856 gc/include/gc.h (*(char **)GC_is_visible(p) = GC_is_valid_displacement(q))
q 859 gc/include/gc.h # define GC_PTR_STORE(p, q) *((p) = (q))
q 863 gc/include/gc.h GC_API void (*GC_same_obj_print_proc) GC_PROTO((GC_PTR p, GC_PTR q));
q 558 gc/include/private/gc_priv.h # define HBLK_PTR_DIFF(p,q) divHBLKSZ((ptr_t)p - (ptr_t)q)
q 1456 gc/mark.c register word q;
q 1468 gc/mark.c q = *p;
q 1469 gc/mark.c GC_PUSH_ONE_STACK(q, p);
q 1536 gc/mark.c register word q;
q 1556 gc/mark.c q = p[i];
q 1557 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i);
q 1584 gc/mark.c register word q;
q 1604 gc/mark.c q = p[i];
q 1605 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i);
q 1606 gc/mark.c q = p[i+1];
q 1607 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i);
q 1633 gc/mark.c register word q;
q 1653 gc/mark.c q = p[i];
q 1654 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i);
q 1655 gc/mark.c q = p[i+1];
q 1656 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i + 1);
q 1657 gc/mark.c q = p[i+2];
q 1658 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i + 2);
q 1659 gc/mark.c q = p[i+3];
q 1660 gc/mark.c GC_PUSH_ONE_HEAP(q, p + i + 3);
q 1207 gc/os_dep.c LPVOID q;
q 1212 gc/os_dep.c q = (LPVOID)(p - GC_page_size);
q 1213 gc/os_dep.c if ((ptr_t)q > (ptr_t)p /* underflow */ || q < limit) break;
q 1214 gc/os_dep.c result = VirtualQuery(q, &buf, sizeof(buf));
q 1242 gc/os_dep.c struct GC_malloc_heap_list *q = GC_malloc_heap_l;
q 1244 gc/os_dep.c while (0 != q) {
q 1245 gc/os_dep.c if (q -> allocation_base == p) return TRUE;
q 1246 gc/os_dep.c q = q -> next;
q 2031 gc/os_dep.c word q = *p;
q 2033 gc/os_dep.c GC_PUSH_ONE_STACK(q, p);
q 185 gc/pthread_support.c ptr_t q, *qptr;
q 191 gc/pthread_support.c q = *qptr;
q 192 gc/pthread_support.c if ((word)q >= HBLKSIZE) {
q 194 gc/pthread_support.c gfl[nwords] = q;
q 197 gc/pthread_support.c for (; (word)q >= HBLKSIZE; qptr = &(obj_link(q)), q = *qptr);
q 198 gc/pthread_support.c GC_ASSERT(0 == q);
q 535 gc/pthread_support.c ptr_t q;
q 540 gc/pthread_support.c q = p -> ptrfree_freelists[j];
q 541 gc/pthread_support.c if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
q 542 gc/pthread_support.c q = p -> normal_freelists[j];
q 543 gc/pthread_support.c if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
q 545 gc/pthread_support.c q = p -> gcj_freelists[j];
q 546 gc/pthread_support.c if ((word)q > HBLKSIZE) GC_set_fl_marks(q);
q 29 gc/ptr_chck.c (unsigned long)p, (unsigned long)q);
q 60 gc/ptr_chck.c if (divHBLKSZ((word)p) != divHBLKSZ((word)q)
q 61 gc/ptr_chck.c && HDR((word)q) != 0) {
q 76 gc/ptr_chck.c if ((ptr_t)p >= limit || (ptr_t)q >= limit || (ptr_t)q < (ptr_t)h ) {
q 95 gc/ptr_chck.c if (HBLKPTR(p) != HBLKPTR(q)) goto fail;
q 108 gc/ptr_chck.c if ((ptr_t)q >= limit || (ptr_t)q < base) {
q 113 gc/ptr_chck.c (*GC_same_obj_print_proc)((ptr_t)p, (ptr_t)q);
q 318 gc/reclaim.c register word *p, *q, *plim;
q 337 gc/reclaim.c q = p + sz;
q 343 gc/reclaim.c while (p < q) {
q 349 gc/reclaim.c while (p < q) {
q 84 gc/stubborn.c register GC_PTR *p, *q;
q 104 gc/stubborn.c q = new_list;
q 106 gc/stubborn.c if (*p != 0) *q++ = *p;
q 110 gc/stubborn.c GC_changing_list_current = q;
q 244 gc/stubborn.c register GC_PTR q;
q 253 gc/stubborn.c if ((q = *p) != 0) {
q 254 gc/stubborn.c h = HBLKPTR(q);
q 274 gc/stubborn.c register GC_PTR q;
q 281 gc/stubborn.c if ((q = *p) != 0) {
q 283 gc/stubborn.c r = (ptr_t)GC_base(q);
q 1175 gc/tests/test.c void *q[100];
q 1177 gc/tests/test.c q[n++] = p;
q 1179 gc/tests/test.c for (;(q[n] = va_arg(a,void *));n++) ;
q 1183 gc/tests/test.c if (q[i] == q[j]) {
q 1064 src/bignum.c ScmBignum *q;
q 1067 src/bignum.c q = SCM_BIGNUM(Scm_BignumCopy(dividend));
q 1068 src/bignum.c rr = bignum_sdiv(q, dd);
q 1072 src/bignum.c q = make_bignum(dividend->size + 1);
q 1073 src/bignum.c br = bignum_gdiv(dividend, bv, q);
q 1077 src/bignum.c q->sign = dividend->sign * d_sign;
q 1078 src/bignum.c return Scm_NormalizeBignum(q);
q 1085 src/bignum.c ScmBignum *q, *r;
q 1092 src/bignum.c q = make_bignum(dividend->size - divisor->size + 1);
q 1093 src/bignum.c r = bignum_gdiv(dividend, divisor, q);
q 1094 src/bignum.c q->sign = dividend->sign * divisor->sign;
q 1097 src/bignum.c return Scm_Cons(Scm_NormalizeBignum(q), Scm_NormalizeBignum(r));
q 1259 src/bignum.c ScmBignum *q;
q 1263 src/bignum.c q = SCM_BIGNUM(Scm_BignumCopy(b));
q 1264 src/bignum.c for (;q->size > 0;) {
q 1265 src/bignum.c rem = bignum_sdiv(q, radix);
q 1268 src/bignum.c for (; q->values[q->size-1] == 0 && q->size > 0; q->size--)
q 1271 src/bignum.c if (q->sign < 0) SCM_APPEND1(h, t, SCM_MAKE_CHAR('-'));
q 71 src/char.c const char *q = encoding;
q 72 src/char.c for (;*p && *q; p++, q++) {
q 73 src/char.c if (tolower(*p) != tolower(*q)) break;
q 75 src/char.c if (*p == '\0' && *q == '\0') return TRUE;
q 414 src/extlib.c ScmObj q, r;
q 415 src/extlib.c q = Scm_Quotient(n1, n2, &r);
q 416 src/extlib.c SCM_RETURN(Scm_Values2(q, r));
q 828 src/load.c ScmObj provided, providing, p, q;
q 851 src/load.c q = Scm_Assoc(SCM_CDR(p), ldinfo.waiting, SCM_CMP_EQ);
q 852 src/load.c if (SCM_FALSEP(q)) break;
q 853 src/load.c SCM_ASSERT(SCM_PAIRP(q));
q 854 src/load.c p = Scm_Assoc(SCM_CDR(q), ldinfo.providing, SCM_CMP_EQUAL);
q 309 src/macro.c ScmObj q = Scm_Assq(pvar, ctx->pvars), pvref;
q 310 src/macro.c if (!SCM_PAIRP(q)) return pvar;
q 311 src/macro.c pvref = SCM_CDR(q);
q 322 src/macro.c ScmObj q = Scm_ListRef(ctx->pvars, count, SCM_UNBOUND);
q 323 src/macro.c SCM_ASSERT(SCM_PAIRP(q));
q 324 src/macro.c return SCM_CAR(q);
q 435 src/macro.c ScmObj q;
q 437 src/macro.c if (!SCM_FALSEP(q = id_memq(form, ctx->literals))) return q;
q 445 src/macro.c if (!SCM_FALSEP(q = id_memq(form, ctx->tvars))) return q;
q 1319 src/number.c long q, r;
q 1321 src/number.c q = SCM_INT_VALUE(x)/SCM_INT_VALUE(y);
q 1326 src/number.c return SCM_MAKE_INT(q);
q 1342 src/number.c ScmObj q = Scm_BignumDivSI(SCM_BIGNUM(x), SCM_INT_VALUE(y), &r);
q 1344 src/number.c return q;
q 1371 src/number.c double q;
q 1373 src/number.c q = roundeven(rx/ry);
q 1375 src/number.c double rr = roundeven(rx - q*ry);
q 1378 src/number.c return Scm_MakeFlonum(q);
q 1952 src/number.c ScmObj f, r, s, mp, mm, q;
q 2037 src/number.c q = Scm_Quotient(r10, s, &r);
q 2044 src/number.c SCM_ASSERT(SCM_INTP(q));
q 2054 src/number.c *buf++ = SCM_INT_VALUE(q) + '0';
q 2058 src/number.c *buf++ = SCM_INT_VALUE(q) + '1';
q 2063 src/number.c *buf++ = SCM_INT_VALUE(q) + '0';
q 2068 src/number.c *buf++ = SCM_INT_VALUE(q) + '0';
q 2071 src/number.c *buf++ = SCM_INT_VALUE(q) + '1';
q 416 src/signal.c for (i=0; i<SCM_VM_SIGQ_SIZE; i++) q->queue[i] = -1;
q 417 src/signal.c q->head = q->tail = 0;
q 418 src/signal.c q->overflow = 0;
q 419 src/signal.c q->pending = SCM_NIL;
q 429 src/signal.c ScmSignalQueue *q = &vm->sigq;
q 437 src/signal.c for (sigQsize = 0; q->head != q->tail; sigQsize++) {
q 438 src/signal.c sigQcopy[sigQsize] = q->queue[q->head++];
q 439 src/signal.c if (q->head >= SCM_VM_SIGQ_SIZE) q->head = 0;
q 441 src/signal.c q->overflow = 0; /*TODO: we should do something*/
q 448 src/signal.c tail = q->pending;
q 456 src/signal.c q->pending = tail = cell;
q 468 src/signal.c SCM_FOR_EACH(sp, q->pending) {
q 470 src/signal.c q->pending = SCM_CDR(sp);
q 128 src/symbol.c const char *p = SCM_STRING_BODY_START(b), *q;
q 145 src/symbol.c for (i=0, q=p; i<siz; i++, q++) {
q 146 src/symbol.c if ((unsigned int)*q < 128
q 147 src/symbol.c && (special[(unsigned int)*q]&case_mask)) {
q 155 src/symbol.c for (q=p; q<p+siz; ) {
q 157 src/symbol.c SCM_CHAR_GET(q, ch);
q 158 src/symbol.c q += SCM_CHAR_NBYTES(ch);
q 302 src/system.c const char *p = get_first_separator(path, end), *q;
q 305 src/system.c q = skip_separators(p, end);
q 306 src/system.c if (q == end) return p;
q 307 src/system.c p = get_first_separator(q, end);