00001
00005 #include "system.h"
00006
00007 #include <rpmlib.h>
00008
00009 #include "rpmds.h"
00010
00011 #include "debug.h"
00012
00015 struct rpmlibProvides_s {
00016
00017 const char * featureName;
00018
00019 const char * featureEVR;
00020 int featureFlags;
00021
00022 const char * featureDescription;
00023 };
00024
00025
00026 static struct rpmlibProvides_s rpmlibProvides[] = {
00027 { "rpmlib(VersionedDependencies)", "3.0.3-1",
00028 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00029 N_("PreReq:, Provides:, and Obsoletes: dependencies support versions.") },
00030 { "rpmlib(CompressedFileNames)", "3.0.4-1",
00031 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00032 N_("file name(s) stored as (dirName,baseName,dirIndex) tuple, not as path.")},
00033 { "rpmlib(PayloadIsBzip2)", "3.0.5-1",
00034 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00035 N_("package payload can be compressed using bzip2.") },
00036 { "rpmlib(PayloadFilesHavePrefix)", "4.0-1",
00037 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00038 N_("package payload file(s) have \"./\" prefix.") },
00039 { "rpmlib(ExplicitPackageProvide)", "4.0-1",
00040 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00041 N_("package name-version-release is not implicitly provided.") },
00042 { "rpmlib(HeaderLoadSortsTags)", "4.0.1-1",
00043 ( RPMSENSE_EQUAL),
00044 N_("header tags are always sorted after being loaded.") },
00045 { "rpmlib(ScriptletInterpreterArgs)", "4.0.3-1",
00046 ( RPMSENSE_EQUAL),
00047 N_("the scriptlet interpreter can use arguments from header.") },
00048 { "rpmlib(PartialHardlinkSets)", "4.0.4-1",
00049 ( RPMSENSE_EQUAL),
00050 N_("a hardlink file set may be installed without being complete.") },
00051 { "rpmlib(ConcurrentAccess)", "4.1-1",
00052 ( RPMSENSE_EQUAL),
00053 N_("package scriptlets may access the rpm database while installing.") },
00054 #ifdef WITH_LUA
00055 { "rpmlib(BuiltinLuaScripts)", "4.2.2-1",
00056 ( RPMSENSE_EQUAL),
00057 N_("internal support for lua scripts.") },
00058 #endif
00059 { "rpmlib(PayloadIsLzma)", "4.4.2-1",
00060 (RPMSENSE_RPMLIB|RPMSENSE_EQUAL),
00061 N_("package payload can be compressed using lzma.") },
00062 { NULL, NULL, 0, NULL }
00063 };
00064
00065 void rpmShowRpmlibProvides(FILE * fp)
00066 {
00067 const struct rpmlibProvides_s * rlp;
00068
00069 for (rlp = rpmlibProvides; rlp->featureName != NULL; rlp++) {
00070
00071 rpmds pro = rpmdsSingle(RPMTAG_PROVIDENAME, rlp->featureName,
00072 rlp->featureEVR, rlp->featureFlags);
00073
00074 const char * DNEVR = rpmdsDNEVR(pro);
00075
00076 if (pro != NULL && DNEVR != NULL) {
00077 fprintf(fp, " %s\n", DNEVR+2);
00078 if (rlp->featureDescription)
00079 fprintf(fp, "\t%s\n", rlp->featureDescription);
00080 }
00081 pro = rpmdsFree(pro);
00082 }
00083 }
00084
00085 int rpmCheckRpmlibProvides(const rpmds key)
00086 {
00087 const struct rpmlibProvides_s * rlp;
00088 int rc = 0;
00089
00090 for (rlp = rpmlibProvides; rlp->featureName != NULL; rlp++) {
00091 if (rlp->featureEVR && rlp->featureFlags) {
00092 rpmds pro;
00093 pro = rpmdsSingle(RPMTAG_PROVIDENAME, rlp->featureName,
00094 rlp->featureEVR, rlp->featureFlags);
00095 rc = rpmdsCompare(pro, key);
00096 pro = rpmdsFree(pro);
00097 }
00098 if (rc)
00099 break;
00100 }
00101 return rc;
00102 }
00103
00104 int rpmGetRpmlibProvides(const char *** provNames, int ** provFlags,
00105 const char *** provVersions)
00106 {
00107 const char ** names, ** versions;
00108 int * flags;
00109 int n = 0;
00110
00111
00112 while (rpmlibProvides[n].featureName != NULL)
00113 n++;
00114
00115
00116 names = xcalloc((n+1), sizeof(*names));
00117 versions = xcalloc((n+1), sizeof(*versions));
00118 flags = xcalloc((n+1), sizeof(*flags));
00119
00120
00121 for (n = 0; rpmlibProvides[n].featureName != NULL; n++) {
00122 names[n] = rpmlibProvides[n].featureName;
00123 flags[n] = rpmlibProvides[n].featureFlags;
00124 versions[n] = rpmlibProvides[n].featureEVR;
00125 }
00126
00127
00128 if (provNames)
00129 *provNames = names;
00130 else
00131 names = _free(names);
00132
00133
00134
00135 if (provFlags)
00136 *provFlags = flags;
00137 else
00138 flags = _free(flags);
00139
00140
00141
00142 if (provVersions)
00143 *provVersions = versions;
00144 else
00145 versions = _free(versions);
00146
00147
00148
00149
00150 return n;
00151
00152 }