Lines Matching defs:row

1118 // This routine creates a state machine for updating the multi-row
1120 // The machine visits each row (of receiver/count) until the receiver type
1122 // the location of the first empty row. (An empty row records null for its
1142 // Test this row for both the receiver and for null.
1148 for (int row = start_row; row <= last_row; row++) {
1150 bool test_for_null_also = (row == start_row);
1153 int recvr_offset = in_bytes(VirtualCallData::receiver_offset(row));
1160 int count_offset = in_bytes(VirtualCallData::receiver_count_offset(row));
1173 // Receiver did not match any saved receiver and there is no empty row for it.
1210 // // main copy of decision tree, rooted at row[1]
1211 // if (row[0].rec == rec) { row[0].incr(); goto done; }
1212 // if (row[0].rec != NULL) {
1213 // // inner copy of decision tree, rooted at row[1]
1214 // if (row[1].rec == rec) { row[1].incr(); goto done; }
1215 // if (row[1].rec != NULL) {
1216 // // degenerate decision tree, rooted at row[2]
1217 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1218 // if (row[2].rec != NULL) { count.incr(); goto done; } // overflow
1219 // row[2].init(rec); goto done;
1221 // // remember row[1] is empty
1222 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1223 // row[1].init(rec); goto done;
1226 // // remember row[0] is empty
1227 // if (row[1].rec == rec) { row[1].incr(); goto done; }
1228 // if (row[2].rec == rec) { row[2].incr(); goto done; }
1229 // row[0].init(rec); goto done;
1248 uint row;
1256 for (row = 0; row < RetData::row_limit(); row++) {
1261 in_bytes(RetData::bci_offset(row)),
1266 increment_mdp_data_at(mdp, in_bytes(RetData::bci_count_offset(row)));
1270 in_bytes(RetData::bci_displacement_offset(row)));