Lines Matching defs:epidx
1976 int i, j, epidx;
1994 epidx = 0;
2010 if (endpoints[epidx].out_ep) {
2011 if (++epidx >= MIDI_MAX_ENDPOINTS) {
2017 endpoints[epidx].out_ep = usb_endpoint_num(ep);
2019 endpoints[epidx].out_interval = ep->bInterval;
2026 endpoints[epidx].out_interval = 1;
2027 endpoints[epidx].out_cables =
2030 endpoints[epidx].assoc_out_jacks[j] = ms_ep->baAssocJackID[j];
2031 for (; j < ARRAY_SIZE(endpoints[epidx].assoc_out_jacks); ++j)
2032 endpoints[epidx].assoc_out_jacks[j] = -1;
2036 if (endpoints[epidx].in_ep) {
2037 if (++epidx >= MIDI_MAX_ENDPOINTS) {
2043 endpoints[epidx].in_ep = usb_endpoint_num(ep);
2045 endpoints[epidx].in_interval = ep->bInterval;
2047 endpoints[epidx].in_interval = 1;
2048 endpoints[epidx].in_cables =
2051 endpoints[epidx].assoc_in_jacks[j] = ms_ep->baAssocJackID[j];
2052 for (; j < ARRAY_SIZE(endpoints[epidx].assoc_in_jacks); ++j)
2053 endpoints[epidx].assoc_in_jacks[j] = -1;