count 732 src/cmd/5l/asm.c c->outof - c->count, c->outof, count 733 src/cmd/5l/asm.c (double)(c->outof - c->count)/c->outof); count 65 src/cmd/5l/l.h int32 count; count 60 src/cmd/cc/dpchk.c int count; count 159 src/cmd/cc/dpchk.c newname(char *s, int p, int count) count 176 src/cmd/cc/dpchk.c l->count = count; count 443 src/cmd/cc/dpchk.c if(l->count > 0) { count 445 src/cmd/cc/dpchk.c i = l->count; count 473 src/cmd/cc/dpchk.c i = l->count; count 599 src/cmd/gc/const.c if(count(n->list) == 1 && isconst(n->list->n, CTSTR)) { count 272 src/cmd/gc/dcl.c if(count(el) == 1 && count(vl) > 1) { count 529 src/cmd/gc/dcl.c if(count(left) == 1 && count(right) == 1) { count 606 src/cmd/gc/dcl.c vargen = count(nt->rlist); count 637 src/cmd/gc/dcl.c gen = count(nt->list); count 1213 src/cmd/gc/dcl.c t->outtuple = count(out); count 1214 src/cmd/gc/dcl.c t->intuple = count(in); count 518 src/cmd/gc/esc.c if(count(n->list) == count(n->rlist)) count 564 src/cmd/gc/esc.c if(count(n->list) == 1 && curfn->type->outtuple > 1) { count 946 src/cmd/gc/esc.c src->type->bound = count(ll); count 1004 src/cmd/gc/esc.c src->type->bound = count(ll); count 1341 src/cmd/gc/go.h int count(NodeList *l); count 451 src/cmd/gc/go.y yyerror("argument count mismatch: %d = %d", count($1), 1); count 399 src/cmd/gc/inl.c if(count(n->list) == 1 && n->list->n->op == OINLCALL && count(n->list->n->rlist) > 1) { count 644 src/cmd/gc/inl.c varargcount = count(n->list) + multiret; count 727 src/cmd/gc/order.c if(count(n->list) < 2 || isblank(n->list->next->n)) { count 965 src/cmd/gc/order.c if(count(n->list) > 5) { count 967 src/cmd/gc/order.c t->bound = count(n->list); count 55 src/cmd/gc/range.c if(count(n->list) == 2) count 65 src/cmd/gc/range.c if(count(n->list) > 2) { count 18 src/cmd/gc/select.c int lno, count; count 22 src/cmd/gc/select.c count = 0; count 25 src/cmd/gc/select.c count++; count 90 src/cmd/gc/select.c sel->xoffset = count; count 105 src/cmd/gc/select.c i = count(sel->list); count 1086 src/cmd/gc/sinit.c if(count(n->list) < structcount(t)) { count 1126 src/cmd/gc/sinit.c if(count(n->list) < t->bound) { count 281 src/cmd/gc/swt.c needvar = count(n->list) != 1 || n->list->n->op == OLITERAL; count 1123 src/cmd/gc/typecheck.c if(count(n->list) == 1 && !n->isddd) count 1245 src/cmd/gc/typecheck.c if(count(n->list) == 1) { count 1347 src/cmd/gc/typecheck.c if(count(args) == 1 && !n->isddd) count 1726 src/cmd/gc/typecheck.c if(count(n->list) == 1) count 2266 src/cmd/gc/typecheck.c n2 = count(nl); count 2899 src/cmd/gc/typecheck.c cl = count(n->list); count 2900 src/cmd/gc/typecheck.c cr = count(n->rlist); count 274 src/cmd/gc/walk.c if((curfn->type->outnamed && count(n->list) > 1) || paramoutheap(curfn)) { count 290 src/cmd/gc/walk.c if(count(n->list) == 1 && count(rl) > 1) { count 1194 src/cmd/gc/walk.c n->left->op == OADDSTR && count(n->left->list) == 2 && count 1461 src/cmd/gc/walk.c yyerror("error in shape across %+H %O %+H / %d %d [%s]", nl, op, nr, count(nl), count(nr), curfn->nname->sym->name); count 1534 src/cmd/gc/walk.c count(nl), structcount(*nr)); count 1559 src/cmd/gc/walk.c if(count(lr0) == 0) { count 2523 src/cmd/gc/walk.c c = count(n->list); count 2695 src/cmd/gc/walk.c argc = count(n->list) - 1; count 103 src/lib9/flag.c f->set = count; count 31 src/libbio/bread.c Bread(Biobuf *bp, void *ap, long count) count 38 src/libbio/bread.c c = count; count 70 src/libbio/bread.c return count-c; count 31 src/libbio/bwrite.c Bwrite(Biobuf *bp, void *ap, long count) count 38 src/libbio/bwrite.c c = count; count 63 src/libbio/bwrite.c return count-c; count 98 src/pkg/runtime/hashmap.h uintgo count; // # live cells == size of map. Must be first (used by len() builtin) count 32 src/pkg/runtime/hashmap_fast.c if(h == nil || h->count == 0) { count 141 src/pkg/runtime/hashmap_fast.c if(h == nil || h->count == 0) { count 654 src/pkg/runtime/mgc0.c uintptr count, elemsize, b; count 723 src/pkg/runtime/mgc0.c uintptr n, i, end_b, elemsize, size, ti, objti, count, type, nobj; count 799 src/pkg/runtime/mgc0.c stack_top.count = 0; // 0 means an infinite number of iterations count 802 src/pkg/runtime/mgc0.c stack_top.count = 1; count 829 src/pkg/runtime/mgc0.c stack_top.count = 1; count 837 src/pkg/runtime/mgc0.c stack_top.count = 0; // 0 means an infinite number of iterations count 1012 src/pkg/runtime/mgc0.c if(--stack_top.count != 0) { count 1048 src/pkg/runtime/mgc0.c count = pc[2]; count 1054 src/pkg/runtime/mgc0.c stack_top = (Frame){count, elemsize, i, pc}; count 1058 src/pkg/runtime/mgc0.c if(--stack_top.count != 0) { count 15 src/pkg/runtime/os_plan9.h int32 runtime·plan9_semrelease(uint32 *addr, int32 count); count 103 src/pkg/runtime/os_solaris.c runtime·sysvicall6(uintptr fn, int32 count, ...) count 107 src/pkg/runtime/os_solaris.c m->libcall.n = (uintptr)count; count 108 src/pkg/runtime/os_solaris.c for(;count; count--) count 109 src/pkg/runtime/os_solaris.c m->scratch.v[count - 1] = *((uintptr*)&count + count); count 49 src/pkg/runtime/os_solaris.h uintptr runtime·sysvicall6(uintptr fn, int32 count, ...); count 296 src/pkg/runtime/os_windows.c runtime·stdcall(void *fn, int32 count, ...) count 299 src/pkg/runtime/os_windows.c m->libcall.n = count; count 300 src/pkg/runtime/os_windows.c m->libcall.args = (uintptr*)&count + 1; count 15 src/pkg/runtime/os_windows.h void *runtime·stdcall(void *fn, int32 count, ...); count 146 test/bench/shootout/chameneosredux.c int count; count 220 test/bench/shootout/chameneosredux.c cr->count++; count 232 test/bench/shootout/chameneosredux.c cr->count = cr->sameCount = 0; count 249 test/bench/shootout/chameneosredux.c sprintf( str, "%u%s", cr->count, numstr ); count 281 test/bench/shootout/chameneosredux.c total += creatures[i].count; count 51 test/bench/shootout/fannkuch.c Aint* count; count 64 test/bench/shootout/fannkuch.c count = calloc(n, sizeof(*count)); count 76 test/bench/shootout/fannkuch.c count[r-1] = r; count 119 test/bench/shootout/fannkuch.c if( (count[r] -= 1) > 0 ) { count 115 test/bench/shootout/regex-dna.c int re_eo, m[3], pos, count; count 118 test/bench/shootout/regex-dna.c for (count = 0, pos = 0; count 120 test/bench/shootout/regex-dna.c pos = m[1]) count++; count 121 test/bench/shootout/regex-dna.c return count;