Skip to content
Toggle navigation
Toggle navigation
This project
Loading...
Sign in
John McEleney
/
mailutils
Go to a project
Toggle navigation
Toggle navigation pinning
Projects
Groups
Snippets
Help
Project
Activity
Repository
Pipelines
Graphs
Issues
0
Merge Requests
0
Wiki
Network
Create a new issue
Builds
Commits
Issue Boards
Files
Commits
Network
Compare
Branches
Tags
Commit
01de5a47
...
01de5a47417b45a106ce17465664f0c73ae10877
authored
2002-12-29 10:15:21 +0000
by
Sergey Poznyakoff
Browse Files
Options
Browse Files
Tag
Download
Email Patches
Plain Diff
Reflect addition of NLS libraries.
1 parent
f2968ff2
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
16 additions
and
9 deletions
mailbox/mailutils-config.c
mailbox/mailutils-config.c
View file @
01de5a4
...
...
@@ -95,8 +95,7 @@ main (int argc, char **argv)
if
(
mu_argp_parse
(
&
argp
,
&
argc
,
&
argv
,
0
,
argp_capa
,
&
index
,
NULL
))
{
argp_help
(
&
argp
,
stdout
,
ARGP_HELP_SEE
,
program_invocation_short_name
);
argp_help
(
&
argp
,
stdout
,
ARGP_HELP_SEE
,
program_invocation_short_name
);
return
1
;
}
...
...
@@ -117,22 +116,26 @@ main (int argc, char **argv)
}
entry
[
4
];
entry
[
n
].
level
=
1
;
asprintf
(
&
entry
[
n
].
ptr
,
"
%s -lmailbox"
,
LINK_FLAGS
);
asprintf
(
&
entry
[
n
].
ptr
,
"%s -lmailbox"
,
LINK_FLAGS
);
n
++
;
#ifdef ENABLE_NLS
entry
[
n
].
level
=
10
;
asprintf
(
&
entry
[
n
].
ptr
,
"-lintl -liconv"
);
n
++
;
#endif
for
(;
n
<
sizeof
(
entry
)
/
sizeof
(
entry
[
0
])
&&
argc
>
0
;
argc
--
,
argv
++
,
n
++
)
{
if
(
strcmp
(
argv
[
0
],
"auth"
)
==
0
)
{
entry
[
n
].
level
=
2
;
asprintf
(
&
entry
[
n
].
ptr
,
"
-lmuauth %s"
,
AUTHLIBS
);
asprintf
(
&
entry
[
n
].
ptr
,
"-lmuauth %s"
,
AUTHLIBS
);
}
#ifdef WITH_GUILE
else
if
(
strcmp
(
argv
[
0
],
"guile"
)
==
0
)
{
entry
[
n
].
level
=
-
1
;
asprintf
(
&
entry
[
n
].
ptr
,
"
-lmu_scm %s"
,
GUILE_LIBS
);
asprintf
(
&
entry
[
n
].
ptr
,
"-lmu_scm %s"
,
GUILE_LIBS
);
}
#endif
else
...
...
@@ -159,11 +162,15 @@ main (int argc, char **argv)
}
for
(
j
=
0
;
j
<
n
;
j
++
)
/* At least one entry is always present */
printf
(
"%s"
,
entry
[
0
].
ptr
);
/* Print the rest of them separated by a space */
for
(
j
=
1
;
j
<
n
;
j
++
)
{
if
(
j
>
0
&&
entry
[
j
].
level
==
entry
[
j
-
1
].
level
)
if
(
entry
[
j
].
level
==
entry
[
j
-
1
].
level
)
continue
;
printf
(
"%s"
,
entry
[
j
].
ptr
);
printf
(
"
%s"
,
entry
[
j
].
ptr
);
}
printf
(
"
\n
"
);
return
0
;
...
...
Please
register
or
sign in
to post a comment