2006-06-27 07:58:46 +08:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Copyright (C) 2005 Mike Isely <isely@pobox.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "pvrusb2-std.h"
|
|
|
|
#include "pvrusb2-debug.h"
|
2006-06-26 07:03:59 +08:00
|
|
|
#include <asm/string.h>
|
|
|
|
#include <linux/slab.h>
|
2006-06-27 07:58:46 +08:00
|
|
|
|
|
|
|
struct std_name {
|
|
|
|
const char *name;
|
|
|
|
v4l2_std_id id;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
#define CSTD_PAL \
|
|
|
|
(V4L2_STD_PAL_B| \
|
|
|
|
V4L2_STD_PAL_B1| \
|
|
|
|
V4L2_STD_PAL_G| \
|
|
|
|
V4L2_STD_PAL_H| \
|
|
|
|
V4L2_STD_PAL_I| \
|
|
|
|
V4L2_STD_PAL_D| \
|
|
|
|
V4L2_STD_PAL_D1| \
|
|
|
|
V4L2_STD_PAL_K| \
|
|
|
|
V4L2_STD_PAL_M| \
|
|
|
|
V4L2_STD_PAL_N| \
|
|
|
|
V4L2_STD_PAL_Nc| \
|
|
|
|
V4L2_STD_PAL_60)
|
|
|
|
|
|
|
|
#define CSTD_NTSC \
|
|
|
|
(V4L2_STD_NTSC_M| \
|
|
|
|
V4L2_STD_NTSC_M_JP| \
|
|
|
|
V4L2_STD_NTSC_M_KR| \
|
|
|
|
V4L2_STD_NTSC_443)
|
|
|
|
|
2007-12-03 13:10:04 +08:00
|
|
|
#define CSTD_ATSC \
|
|
|
|
(V4L2_STD_ATSC_8_VSB| \
|
|
|
|
V4L2_STD_ATSC_16_VSB)
|
|
|
|
|
2006-06-27 07:58:46 +08:00
|
|
|
#define CSTD_SECAM \
|
|
|
|
(V4L2_STD_SECAM_B| \
|
|
|
|
V4L2_STD_SECAM_D| \
|
|
|
|
V4L2_STD_SECAM_G| \
|
|
|
|
V4L2_STD_SECAM_H| \
|
|
|
|
V4L2_STD_SECAM_K| \
|
|
|
|
V4L2_STD_SECAM_K1| \
|
|
|
|
V4L2_STD_SECAM_L| \
|
|
|
|
V4L2_STD_SECAM_LC)
|
|
|
|
|
|
|
|
#define TSTD_B (V4L2_STD_PAL_B|V4L2_STD_SECAM_B)
|
|
|
|
#define TSTD_B1 (V4L2_STD_PAL_B1)
|
|
|
|
#define TSTD_D (V4L2_STD_PAL_D|V4L2_STD_SECAM_D)
|
|
|
|
#define TSTD_D1 (V4L2_STD_PAL_D1)
|
|
|
|
#define TSTD_G (V4L2_STD_PAL_G|V4L2_STD_SECAM_G)
|
|
|
|
#define TSTD_H (V4L2_STD_PAL_H|V4L2_STD_SECAM_H)
|
|
|
|
#define TSTD_I (V4L2_STD_PAL_I)
|
|
|
|
#define TSTD_K (V4L2_STD_PAL_K|V4L2_STD_SECAM_K)
|
|
|
|
#define TSTD_K1 (V4L2_STD_SECAM_K1)
|
|
|
|
#define TSTD_L (V4L2_STD_SECAM_L)
|
|
|
|
#define TSTD_M (V4L2_STD_PAL_M|V4L2_STD_NTSC_M)
|
|
|
|
#define TSTD_N (V4L2_STD_PAL_N)
|
|
|
|
#define TSTD_Nc (V4L2_STD_PAL_Nc)
|
|
|
|
#define TSTD_60 (V4L2_STD_PAL_60)
|
|
|
|
|
2008-04-23 01:45:42 +08:00
|
|
|
#define CSTD_ALL (CSTD_PAL|CSTD_NTSC|CSTD_ATSC|CSTD_SECAM)
|
2006-06-27 07:58:46 +08:00
|
|
|
|
|
|
|
/* Mapping of standard bits to color system */
|
2007-02-18 03:11:19 +08:00
|
|
|
static const struct std_name std_groups[] = {
|
2006-06-27 07:58:46 +08:00
|
|
|
{"PAL",CSTD_PAL},
|
|
|
|
{"NTSC",CSTD_NTSC},
|
|
|
|
{"SECAM",CSTD_SECAM},
|
2007-12-03 13:10:04 +08:00
|
|
|
{"ATSC",CSTD_ATSC},
|
2006-06-27 07:58:46 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Mapping of standard bits to modulation system */
|
2007-02-18 03:11:19 +08:00
|
|
|
static const struct std_name std_items[] = {
|
2006-06-27 07:58:46 +08:00
|
|
|
{"B",TSTD_B},
|
|
|
|
{"B1",TSTD_B1},
|
|
|
|
{"D",TSTD_D},
|
|
|
|
{"D1",TSTD_D1},
|
|
|
|
{"G",TSTD_G},
|
|
|
|
{"H",TSTD_H},
|
|
|
|
{"I",TSTD_I},
|
|
|
|
{"K",TSTD_K},
|
|
|
|
{"K1",TSTD_K1},
|
|
|
|
{"L",TSTD_L},
|
|
|
|
{"LC",V4L2_STD_SECAM_LC},
|
|
|
|
{"M",TSTD_M},
|
|
|
|
{"Mj",V4L2_STD_NTSC_M_JP},
|
|
|
|
{"443",V4L2_STD_NTSC_443},
|
|
|
|
{"Mk",V4L2_STD_NTSC_M_KR},
|
|
|
|
{"N",TSTD_N},
|
|
|
|
{"Nc",TSTD_Nc},
|
|
|
|
{"60",TSTD_60},
|
2007-12-03 13:10:04 +08:00
|
|
|
{"8VSB",V4L2_STD_ATSC_8_VSB},
|
|
|
|
{"16VSB",V4L2_STD_ATSC_16_VSB},
|
2006-06-27 07:58:46 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// Search an array of std_name structures and return a pointer to the
|
|
|
|
// element with the matching name.
|
|
|
|
static const struct std_name *find_std_name(const struct std_name *arrPtr,
|
|
|
|
unsigned int arrSize,
|
|
|
|
const char *bufPtr,
|
|
|
|
unsigned int bufSize)
|
|
|
|
{
|
|
|
|
unsigned int idx;
|
|
|
|
const struct std_name *p;
|
|
|
|
for (idx = 0; idx < arrSize; idx++) {
|
|
|
|
p = arrPtr + idx;
|
|
|
|
if (strlen(p->name) != bufSize) continue;
|
|
|
|
if (!memcmp(bufPtr,p->name,bufSize)) return p;
|
|
|
|
}
|
2006-06-30 22:35:28 +08:00
|
|
|
return NULL;
|
2006-06-27 07:58:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int pvr2_std_str_to_id(v4l2_std_id *idPtr,const char *bufPtr,
|
|
|
|
unsigned int bufSize)
|
|
|
|
{
|
|
|
|
v4l2_std_id id = 0;
|
|
|
|
v4l2_std_id cmsk = 0;
|
|
|
|
v4l2_std_id t;
|
|
|
|
int mMode = 0;
|
|
|
|
unsigned int cnt;
|
|
|
|
char ch;
|
|
|
|
const struct std_name *sp;
|
|
|
|
|
|
|
|
while (bufSize) {
|
|
|
|
if (!mMode) {
|
|
|
|
cnt = 0;
|
|
|
|
while ((cnt < bufSize) && (bufPtr[cnt] != '-')) cnt++;
|
|
|
|
if (cnt >= bufSize) return 0; // No more characters
|
2007-01-20 11:35:03 +08:00
|
|
|
sp = find_std_name(std_groups, ARRAY_SIZE(std_groups),
|
|
|
|
bufPtr,cnt);
|
2006-06-27 07:58:46 +08:00
|
|
|
if (!sp) return 0; // Illegal color system name
|
|
|
|
cnt++;
|
|
|
|
bufPtr += cnt;
|
|
|
|
bufSize -= cnt;
|
|
|
|
mMode = !0;
|
|
|
|
cmsk = sp->id;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
cnt = 0;
|
|
|
|
while (cnt < bufSize) {
|
|
|
|
ch = bufPtr[cnt];
|
|
|
|
if (ch == ';') {
|
|
|
|
mMode = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (ch == '/') break;
|
|
|
|
cnt++;
|
|
|
|
}
|
2007-01-20 11:35:03 +08:00
|
|
|
sp = find_std_name(std_items, ARRAY_SIZE(std_items),
|
2006-06-27 07:58:46 +08:00
|
|
|
bufPtr,cnt);
|
|
|
|
if (!sp) return 0; // Illegal modulation system ID
|
|
|
|
t = sp->id & cmsk;
|
|
|
|
if (!t) return 0; // Specific color + modulation system illegal
|
|
|
|
id |= t;
|
|
|
|
if (cnt < bufSize) cnt++;
|
|
|
|
bufPtr += cnt;
|
|
|
|
bufSize -= cnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (idPtr) *idPtr = id;
|
|
|
|
return !0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
unsigned int pvr2_std_id_to_str(char *bufPtr, unsigned int bufSize,
|
|
|
|
v4l2_std_id id)
|
|
|
|
{
|
|
|
|
unsigned int idx1,idx2;
|
|
|
|
const struct std_name *ip,*gp;
|
|
|
|
int gfl,cfl;
|
|
|
|
unsigned int c1,c2;
|
|
|
|
cfl = 0;
|
|
|
|
c1 = 0;
|
2007-01-20 11:35:03 +08:00
|
|
|
for (idx1 = 0; idx1 < ARRAY_SIZE(std_groups); idx1++) {
|
2006-06-27 07:58:46 +08:00
|
|
|
gp = std_groups + idx1;
|
|
|
|
gfl = 0;
|
2007-01-20 11:35:03 +08:00
|
|
|
for (idx2 = 0; idx2 < ARRAY_SIZE(std_items); idx2++) {
|
2006-06-27 07:58:46 +08:00
|
|
|
ip = std_items + idx2;
|
|
|
|
if (!(gp->id & ip->id & id)) continue;
|
|
|
|
if (!gfl) {
|
|
|
|
if (cfl) {
|
|
|
|
c2 = scnprintf(bufPtr,bufSize,";");
|
|
|
|
c1 += c2;
|
|
|
|
bufSize -= c2;
|
|
|
|
bufPtr += c2;
|
|
|
|
}
|
|
|
|
cfl = !0;
|
|
|
|
c2 = scnprintf(bufPtr,bufSize,
|
|
|
|
"%s-",gp->name);
|
|
|
|
gfl = !0;
|
|
|
|
} else {
|
|
|
|
c2 = scnprintf(bufPtr,bufSize,"/");
|
|
|
|
}
|
|
|
|
c1 += c2;
|
|
|
|
bufSize -= c2;
|
|
|
|
bufPtr += c2;
|
|
|
|
c2 = scnprintf(bufPtr,bufSize,
|
|
|
|
ip->name);
|
|
|
|
c1 += c2;
|
|
|
|
bufSize -= c2;
|
|
|
|
bufPtr += c2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return c1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Template data for possible enumerated video standards. Here we group
|
|
|
|
// standards which share common frame rates and resolution.
|
|
|
|
static struct v4l2_standard generic_standards[] = {
|
|
|
|
{
|
|
|
|
.id = (TSTD_B|TSTD_B1|
|
|
|
|
TSTD_D|TSTD_D1|
|
|
|
|
TSTD_G|
|
|
|
|
TSTD_H|
|
|
|
|
TSTD_I|
|
|
|
|
TSTD_K|TSTD_K1|
|
|
|
|
TSTD_L|
|
|
|
|
V4L2_STD_SECAM_LC |
|
|
|
|
TSTD_N|TSTD_Nc),
|
|
|
|
.frameperiod =
|
|
|
|
{
|
|
|
|
.numerator = 1,
|
|
|
|
.denominator= 25
|
|
|
|
},
|
|
|
|
.framelines = 625,
|
|
|
|
.reserved = {0,0,0,0}
|
|
|
|
}, {
|
|
|
|
.id = (TSTD_M|
|
|
|
|
V4L2_STD_NTSC_M_JP|
|
|
|
|
V4L2_STD_NTSC_M_KR),
|
|
|
|
.frameperiod =
|
|
|
|
{
|
|
|
|
.numerator = 1001,
|
|
|
|
.denominator= 30000
|
|
|
|
},
|
|
|
|
.framelines = 525,
|
|
|
|
.reserved = {0,0,0,0}
|
|
|
|
}, { // This is a total wild guess
|
|
|
|
.id = (TSTD_60),
|
|
|
|
.frameperiod =
|
|
|
|
{
|
|
|
|
.numerator = 1001,
|
|
|
|
.denominator= 30000
|
|
|
|
},
|
|
|
|
.framelines = 525,
|
|
|
|
.reserved = {0,0,0,0}
|
|
|
|
}, { // This is total wild guess
|
|
|
|
.id = V4L2_STD_NTSC_443,
|
|
|
|
.frameperiod =
|
|
|
|
{
|
|
|
|
.numerator = 1001,
|
|
|
|
.denominator= 30000
|
|
|
|
},
|
|
|
|
.framelines = 525,
|
|
|
|
.reserved = {0,0,0,0}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct v4l2_standard *match_std(v4l2_std_id id)
|
|
|
|
{
|
|
|
|
unsigned int idx;
|
2011-03-26 09:54:34 +08:00
|
|
|
for (idx = 0; idx < ARRAY_SIZE(generic_standards); idx++) {
|
2006-06-27 07:58:46 +08:00
|
|
|
if (generic_standards[idx].id & id) {
|
|
|
|
return generic_standards + idx;
|
|
|
|
}
|
|
|
|
}
|
2006-06-30 22:35:28 +08:00
|
|
|
return NULL;
|
2006-06-27 07:58:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int pvr2_std_fill(struct v4l2_standard *std,v4l2_std_id id)
|
|
|
|
{
|
|
|
|
struct v4l2_standard *template;
|
|
|
|
int idx;
|
|
|
|
unsigned int bcnt;
|
|
|
|
template = match_std(id);
|
|
|
|
if (!template) return 0;
|
|
|
|
idx = std->index;
|
|
|
|
memcpy(std,template,sizeof(*template));
|
|
|
|
std->index = idx;
|
|
|
|
std->id = id;
|
|
|
|
bcnt = pvr2_std_id_to_str(std->name,sizeof(std->name)-1,id);
|
|
|
|
std->name[bcnt] = 0;
|
2007-09-09 09:32:12 +08:00
|
|
|
pvr2_trace(PVR2_TRACE_STD,"Set up standard idx=%u name=%s",
|
2006-06-27 07:58:46 +08:00
|
|
|
std->index,std->name);
|
|
|
|
return !0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* These are special cases of combined standards that we should enumerate
|
|
|
|
separately if the component pieces are present. */
|
|
|
|
static v4l2_std_id std_mixes[] = {
|
|
|
|
V4L2_STD_PAL_B | V4L2_STD_PAL_G,
|
|
|
|
V4L2_STD_PAL_D | V4L2_STD_PAL_K,
|
|
|
|
V4L2_STD_SECAM_B | V4L2_STD_SECAM_G,
|
|
|
|
V4L2_STD_SECAM_D | V4L2_STD_SECAM_K,
|
|
|
|
};
|
|
|
|
|
|
|
|
struct v4l2_standard *pvr2_std_create_enum(unsigned int *countptr,
|
|
|
|
v4l2_std_id id)
|
|
|
|
{
|
|
|
|
unsigned int std_cnt = 0;
|
|
|
|
unsigned int idx,bcnt,idx2;
|
|
|
|
v4l2_std_id idmsk,cmsk,fmsk;
|
|
|
|
struct v4l2_standard *stddefs;
|
|
|
|
|
2007-09-09 09:32:12 +08:00
|
|
|
if (pvrusb2_debug & PVR2_TRACE_STD) {
|
2008-04-23 01:45:43 +08:00
|
|
|
char buf[100];
|
2006-06-27 07:58:46 +08:00
|
|
|
bcnt = pvr2_std_id_to_str(buf,sizeof(buf),id);
|
|
|
|
pvr2_trace(
|
2007-09-09 09:32:12 +08:00
|
|
|
PVR2_TRACE_STD,"Mapping standards mask=0x%x (%.*s)",
|
2006-06-27 07:58:46 +08:00
|
|
|
(int)id,bcnt,buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
*countptr = 0;
|
|
|
|
std_cnt = 0;
|
|
|
|
fmsk = 0;
|
|
|
|
for (idmsk = 1, cmsk = id; cmsk; idmsk <<= 1) {
|
|
|
|
if (!(idmsk & cmsk)) continue;
|
|
|
|
cmsk &= ~idmsk;
|
|
|
|
if (match_std(idmsk)) {
|
|
|
|
std_cnt++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
fmsk |= idmsk;
|
|
|
|
}
|
|
|
|
|
2007-01-20 11:35:03 +08:00
|
|
|
for (idx2 = 0; idx2 < ARRAY_SIZE(std_mixes); idx2++) {
|
2006-06-27 07:58:46 +08:00
|
|
|
if ((id & std_mixes[idx2]) == std_mixes[idx2]) std_cnt++;
|
|
|
|
}
|
|
|
|
|
2008-04-23 01:45:42 +08:00
|
|
|
/* Don't complain about ATSC standard values */
|
|
|
|
fmsk &= ~CSTD_ATSC;
|
|
|
|
|
2006-06-27 07:58:46 +08:00
|
|
|
if (fmsk) {
|
2008-04-23 01:45:43 +08:00
|
|
|
char buf[100];
|
2006-06-27 07:58:46 +08:00
|
|
|
bcnt = pvr2_std_id_to_str(buf,sizeof(buf),fmsk);
|
|
|
|
pvr2_trace(
|
|
|
|
PVR2_TRACE_ERROR_LEGS,
|
[media] pvrusb2: don't break long lines
Due to the 80-cols restrictions, and latter due to checkpatch
warnings, several strings were broken into multiple lines. This
is not considered a good practice anymore, as it makes harder
to grep for strings at the source code.
As we're right now fixing other drivers due to KERN_CONT, we need
to be able to identify what printk strings don't end with a "\n".
It is a way easier to detect those if we don't break long lines.
So, join those continuation lines.
The patch was generated via the script below, and manually
adjusted if needed.
</script>
use Text::Tabs;
while (<>) {
if ($next ne "") {
$c=$_;
if ($c =~ /^\s+\"(.*)/) {
$c2=$1;
$next =~ s/\"\n$//;
$n = expand($next);
$funpos = index($n, '(');
$pos = index($c2, '",');
if ($funpos && $pos > 0) {
$s1 = substr $c2, 0, $pos + 2;
$s2 = ' ' x ($funpos + 1) . substr $c2, $pos + 2;
$s2 =~ s/^\s+//;
$s2 = ' ' x ($funpos + 1) . $s2 if ($s2 ne "");
print unexpand("$next$s1\n");
print unexpand("$s2\n") if ($s2 ne "");
} else {
print "$next$c2\n";
}
$next="";
next;
} else {
print $next;
}
$next="";
} else {
if (m/\"$/) {
if (!m/\\n\"$/) {
$next=$_;
next;
}
}
}
print $_;
}
</script>
Signed-off-by: Mauro Carvalho Chehab <mchehab@s-opensource.com>
2016-10-19 03:44:18 +08:00
|
|
|
"WARNING: Failed to classify the following standard(s): %.*s",
|
2006-06-27 07:58:46 +08:00
|
|
|
bcnt,buf);
|
|
|
|
}
|
|
|
|
|
2007-09-09 09:32:12 +08:00
|
|
|
pvr2_trace(PVR2_TRACE_STD,"Setting up %u unique standard(s)",
|
2006-06-27 07:58:46 +08:00
|
|
|
std_cnt);
|
2006-06-30 22:35:28 +08:00
|
|
|
if (!std_cnt) return NULL; // paranoia
|
2006-06-27 07:58:46 +08:00
|
|
|
|
treewide: kzalloc() -> kcalloc()
The kzalloc() function has a 2-factor argument form, kcalloc(). This
patch replaces cases of:
kzalloc(a * b, gfp)
with:
kcalloc(a * b, gfp)
as well as handling cases of:
kzalloc(a * b * c, gfp)
with:
kzalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kzalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kzalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kzalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kzalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kzalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kzalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kzalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kzalloc
+ kcalloc
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kzalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kzalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kzalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kzalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kzalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kzalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kzalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kzalloc(sizeof(THING) * C2, ...)
|
kzalloc(sizeof(TYPE) * C2, ...)
|
kzalloc(C1 * C2 * C3, ...)
|
kzalloc(C1 * C2, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * E2
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kzalloc
+ kcalloc
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:03:40 +08:00
|
|
|
stddefs = kcalloc(std_cnt, sizeof(struct v4l2_standard),
|
2006-06-27 07:58:46 +08:00
|
|
|
GFP_KERNEL);
|
2011-03-26 09:52:22 +08:00
|
|
|
if (!stddefs)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
for (idx = 0; idx < std_cnt; idx++)
|
|
|
|
stddefs[idx].index = idx;
|
2006-06-27 07:58:46 +08:00
|
|
|
|
|
|
|
idx = 0;
|
|
|
|
|
|
|
|
/* Enumerate potential special cases */
|
2007-01-20 11:35:03 +08:00
|
|
|
for (idx2 = 0; (idx2 < ARRAY_SIZE(std_mixes)) && (idx < std_cnt);
|
|
|
|
idx2++) {
|
2006-06-27 07:58:46 +08:00
|
|
|
if (!(id & std_mixes[idx2])) continue;
|
|
|
|
if (pvr2_std_fill(stddefs+idx,std_mixes[idx2])) idx++;
|
|
|
|
}
|
|
|
|
/* Now enumerate individual pieces */
|
|
|
|
for (idmsk = 1, cmsk = id; cmsk && (idx < std_cnt); idmsk <<= 1) {
|
|
|
|
if (!(idmsk & cmsk)) continue;
|
|
|
|
cmsk &= ~idmsk;
|
|
|
|
if (!pvr2_std_fill(stddefs+idx,idmsk)) continue;
|
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
|
|
|
|
*countptr = std_cnt;
|
|
|
|
return stddefs;
|
|
|
|
}
|
|
|
|
|
|
|
|
v4l2_std_id pvr2_std_get_usable(void)
|
|
|
|
{
|
|
|
|
return CSTD_ALL;
|
|
|
|
}
|