72 	struct ide_timing *t;  in ide_timing_find_mode()  local
74 	for (t = ide_timing; t->mode != speed; t++)  in ide_timing_find_mode()
75 		if (t->mode == 0xff)  in ide_timing_find_mode()
77 	return t;  in ide_timing_find_mode()
84 	struct ide_timing *t = ide_timing_find_mode(XFER_PIO_0 + pio);  in ide_pio_cycle_time()  local
94 		if (pio < 3 && cycle < t->cycle)  in ide_pio_cycle_time()
102 	return cycle ? cycle : t->cycle;  in ide_pio_cycle_time()
109 static void ide_timing_quantize(struct ide_timing *t, struct ide_timing *q,  in ide_timing_quantize()  argument
112 	q->setup   = EZ(t->setup   * 1000,  T);  in ide_timing_quantize()
113 	q->act8b   = EZ(t->act8b   * 1000,  T);  in ide_timing_quantize()
114 	q->rec8b   = EZ(t->rec8b   * 1000,  T);  in ide_timing_quantize()
115 	q->cyc8b   = EZ(t->cyc8b   * 1000,  T);  in ide_timing_quantize()
116 	q->active  = EZ(t->active  * 1000,  T);  in ide_timing_quantize()
117 	q->recover = EZ(t->recover * 1000,  T);  in ide_timing_quantize()
118 	q->cycle   = EZ(t->cycle   * 1000,  T);  in ide_timing_quantize()
119 	q->udma    = EZ(t->udma    * 1000, UT);  in ide_timing_quantize()
145 		       struct ide_timing *t, int T, int UT)  in ide_timing_compute()  argument
160 	*t = *s;  in ide_timing_compute()
178 		ide_timing_merge(&p, t, t, IDE_TIMING_CYCLE | IDE_TIMING_CYC8B);  in ide_timing_compute()
184 	ide_timing_quantize(t, t, T, UT);  in ide_timing_compute()
193 		ide_timing_merge(&p, t, t, IDE_TIMING_ALL);  in ide_timing_compute()
199 	if (t->act8b + t->rec8b < t->cyc8b) {  in ide_timing_compute()
200 		t->act8b += (t->cyc8b - (t->act8b + t->rec8b)) / 2;  in ide_timing_compute()
201 		t->rec8b = t->cyc8b - t->act8b;  in ide_timing_compute()
204 	if (t->active + t->recover < t->cycle) {  in ide_timing_compute()
205 		t->active += (t->cycle - (t->active + t->recover)) / 2;  in ide_timing_compute()
206 		t->recover = t->cycle - t->active;  in ide_timing_compute()