bounded 274 src/cmd/5g/cgen.c cgen_shift(n->op, n->bounded, nl, nr, res); bounded 551 src/cmd/5g/cgen.c cgenindex(Node *n, Node *res, int bounded) bounded 564 src/cmd/5g/cgen.c if(bounded) { bounded 904 src/cmd/5g/cgen.c int bounded; bounded 932 src/cmd/5g/cgen.c bounded = debug['B'] || n->bounded; bounded 939 src/cmd/5g/cgen.c p2 = cgenindex(nr, &tmp, bounded); bounded 947 src/cmd/5g/cgen.c p2 = cgenindex(nr, &tmp, bounded); bounded 956 src/cmd/5g/cgen.c p2 = cgenindex(nr, &tmp, bounded); bounded 974 src/cmd/5g/cgen.c if(!debug['B'] && !n->bounded) { bounded 1006 src/cmd/5g/cgen.c if(!debug['B'] && !n->bounded) { bounded 726 src/cmd/5g/ggen.c cgen_shift(int op, int bounded, Node *nl, Node *nr, Node *res) bounded 734 src/cmd/5g/ggen.c USED(bounded); bounded 1975 src/cmd/5g/gsubr.c p2 = cgenindex(r, &n3, debug['B'] || n->bounded); bounded 2056 src/cmd/5g/gsubr.c if(!debug['B'] && !n->bounded) { bounded 405 src/cmd/6g/cgen.c if(n->bounded) // let race detector avoid nil checks bounded 408 src/cmd/6g/cgen.c if(n->bounded) bounded 455 src/cmd/6g/cgen.c cgen_shift(n->op, n->bounded, nl, nr, res); bounded 690 src/cmd/6g/cgen.c if(!debug['B'] && !n->bounded) { bounded 722 src/cmd/6g/cgen.c if(!debug['B'] && !n->bounded) { bounded 959 src/cmd/6g/ggen.c cgen_shift(int op, int bounded, Node *nl, Node *nr, Node *res) bounded 1033 src/cmd/6g/ggen.c if(!bounded) { bounded 2152 src/cmd/6g/gsubr.c if(!debug['B'] && !n->bounded) { bounded 2231 src/cmd/6g/gsubr.c if(!debug['B'] && !n->bounded) { bounded 2279 src/cmd/6g/gsubr.c if(!debug['B'] && !n->bounded) { bounded 407 src/cmd/8g/cgen.c cgen_shift(n->op, n->bounded, nl, nr, res); bounded 464 src/cmd/8g/cgen.c igenindex(Node *n, Node *res, int bounded) bounded 484 src/cmd/8g/cgen.c if(bounded) { bounded 508 src/cmd/8g/cgen.c int bounded; bounded 588 src/cmd/8g/cgen.c bounded = debug['B'] || n->bounded; bounded 594 src/cmd/8g/cgen.c p2 = igenindex(nr, &tmp, bounded); bounded 601 src/cmd/8g/cgen.c p2 = igenindex(nr, &tmp, bounded); bounded 608 src/cmd/8g/cgen.c p2 = igenindex(nr, &tmp, bounded); bounded 635 src/cmd/8g/cgen.c if(!debug['B'] && !n->bounded) { bounded 671 src/cmd/8g/cgen.c if(!debug['B'] && !n->bounded) { bounded 824 src/cmd/8g/ggen.c cgen_shift(int op, int bounded, Node *nl, Node *nr, Node *res) bounded 883 src/cmd/8g/ggen.c if(bounded) { bounded 265 src/cmd/gc/go.h uchar bounded; // bounds check unnecessary bounded 535 src/cmd/gc/racewalk.c r->bounded = 1; bounded 151 src/cmd/gc/range.c tmp->bounded = 1; bounded 821 src/cmd/gc/sinit.c a->bounded = 1; bounded 954 src/cmd/gc/sinit.c a->bounded = 1; bounded 958 src/cmd/gc/sinit.c r->bounded = 1; bounded 2767 src/cmd/gc/subr.c nx->bounded = 1; bounded 2982 src/cmd/gc/subr.c nx->bounded = 1; bounded 2984 src/cmd/gc/subr.c ny->bounded = 1; bounded 30 src/cmd/gc/walk.c static int bounded(Node*, int64); bounded 481 src/cmd/gc/walk.c n->bounded = bounded(n->right, 8*t->width); bounded 1033 src/cmd/gc/walk.c if(n->bounded) bounded 1039 src/cmd/gc/walk.c n->bounded = bounded(r, t->bound); bounded 1040 src/cmd/gc/walk.c if(debug['m'] && n->bounded && !isconst(n->right, CTINT)) bounded 1042 src/cmd/gc/walk.c if(smallintconst(n->right) && !n->bounded) bounded 1045 src/cmd/gc/walk.c n->bounded = bounded(r, n->left->val.u.sval->len); bounded 1046 src/cmd/gc/walk.c if(debug['m'] && n->bounded && !isconst(n->right, CTINT)) bounded 1049 src/cmd/gc/walk.c if(!n->bounded) bounded 2633 src/cmd/gc/walk.c nptr1->bounded = 1; bounded 2728 src/cmd/gc/walk.c nx->bounded = 1; bounded 2809 src/cmd/gc/walk.c int bounded, slice3; bounded 2827 src/cmd/gc/walk.c bounded = n->etype; bounded 2886 src/cmd/gc/walk.c if(!bounded) bounded 2895 src/cmd/gc/walk.c if(!bounded) { bounded 2915 src/cmd/gc/walk.c if(!bounded)