|
@@ -2052,31 +2052,6 @@ static bool ieee80211_id_in_list(const u8 *ids, int n_ids, u8 id)
|
|
return false;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
|
|
-/**
|
|
|
|
- * ieee80211_ie_split - split an IE buffer according to ordering
|
|
|
|
- *
|
|
|
|
- * @ies: the IE buffer
|
|
|
|
- * @ielen: the length of the IE buffer
|
|
|
|
- * @ids: an array with element IDs that are allowed before
|
|
|
|
- * the split
|
|
|
|
- * @n_ids: the size of the element ID array
|
|
|
|
- * @offset: offset where to start splitting in the buffer
|
|
|
|
- *
|
|
|
|
- * This function splits an IE buffer by updating the @offset
|
|
|
|
- * variable to point to the location where the buffer should be
|
|
|
|
- * split.
|
|
|
|
- *
|
|
|
|
- * It assumes that the given IE buffer is well-formed, this
|
|
|
|
- * has to be guaranteed by the caller!
|
|
|
|
- *
|
|
|
|
- * It also assumes that the IEs in the buffer are ordered
|
|
|
|
- * correctly, if not the result of using this function will not
|
|
|
|
- * be ordered correctly either, i.e. it does no reordering.
|
|
|
|
- *
|
|
|
|
- * The function returns the offset where the next part of the
|
|
|
|
- * buffer starts, which may be @ielen if the entire (remainder)
|
|
|
|
- * of the buffer should be used.
|
|
|
|
- */
|
|
|
|
size_t ieee80211_ie_split(const u8 *ies, size_t ielen,
|
|
size_t ieee80211_ie_split(const u8 *ies, size_t ielen,
|
|
const u8 *ids, int n_ids, size_t offset)
|
|
const u8 *ids, int n_ids, size_t offset)
|
|
{
|
|
{
|
|
@@ -2087,6 +2062,7 @@ size_t ieee80211_ie_split(const u8 *ies, size_t ielen,
|
|
|
|
|
|
return pos;
|
|
return pos;
|
|
}
|
|
}
|
|
|
|
+EXPORT_SYMBOL(ieee80211_ie_split);
|
|
|
|
|
|
size_t ieee80211_ie_split_vendor(const u8 *ies, size_t ielen, size_t offset)
|
|
size_t ieee80211_ie_split_vendor(const u8 *ies, size_t ielen, size_t offset)
|
|
{
|
|
{
|