CN108965161A - Information processing method and electronic equipment - Google Patents

Information processing method and electronic equipment Download PDF

Info

Publication number
CN108965161A
CN108965161A CN201810599649.8A CN201810599649A CN108965161A CN 108965161 A CN108965161 A CN 108965161A CN 201810599649 A CN201810599649 A CN 201810599649A CN 108965161 A CN108965161 A CN 108965161A
Authority
CN
China
Prior art keywords
storage region
data
storage
preset value
space
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810599649.8A
Other languages
Chinese (zh)
Inventor
杨雪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lenovo Beijing Ltd
Original Assignee
Lenovo Beijing Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lenovo Beijing Ltd filed Critical Lenovo Beijing Ltd
Priority to CN201810599649.8A priority Critical patent/CN108965161A/en
Publication of CN108965161A publication Critical patent/CN108965161A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/9063Intermediate storage in different physical parts of a node or terminal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Present disclose provides a kind of information processing methods, storage state including obtaining the first storage region in kernel spacing, first storage region is used to store a data queue of network interface card transmission, and in the case where the occupied memory space of the first storage region is less than the first preset value, network protocol stack handles the data in the data queue.The disclosure additionally provides a kind of electronic equipment.

Description

Information processing method and electronic equipment
Technical field
This disclosure relates to a kind of information processing method and a kind of electronic equipment.
Background technique
With the continuous innovation of network interface card technology, the nominal rate and data-handling capacity of network interface card are increasingly improved, core network Protocol stack is increasingly becoming the bottleneck of data processing.When the flow of data increases, network protocol stack handles data due to having little time And it generates data processing delay or even generates packet loss.For example, certain application program by malicious access, keeps the application program corresponding The flow of data flow increases suddenly, and network protocol stack is caused to have little time to handle data, and causes the delay of data processing, or even produce Raw packet loss phenomenon.
Summary of the invention
An aspect of this disclosure provides a kind of information processing method, including obtaining the first memory block in kernel spacing The storage state in domain, first storage region are used to store a data queue of network interface card transmission, and deposit described first In the case that the occupied memory space in storage area domain is less than the first preset value, the number in the data queue is handled to network protocol stack According to.
Optionally, the method also includes default not less than first in the occupied memory space of the first storage region In the case where value, the data queue in first storage region is copied to the second storage region of user's space.
Optionally, the second storage region that the data queue in first storage region is copied to user's space it Afterwards, the method also includes replicating in the case where the occupied memory space of the first storage region is not less than the second preset value The second storage region of data in data queue in first storage region to user's space, wherein described second is pre- If value is not more than first preset value.
Optionally, the second storage region that the data queue in first storage region is copied to user's space it Afterwards, the method also includes in the case where the occupied memory space of the first storage region is less than the second preset value, network is assisted View stack handles the data in the data queue in first storage region.
Optionally, the method also includes following at least one data deleted in second storage region, or will The third storage region in data deposit kernel spacing in second storage region, or the data are sent to user Space protocol stack.
Optionally, the method also includes handling the data in second storage region, with the spy of the determination data Reference breath, is based on the characteristic information, judges whether the data are secure data, and in the data is secure data In the case of, user-level communication is sent to by the third storage region in data deposit kernel spacing or by the data Stack, or in the case where the data are not secure data, delete the data.
Optionally, the storage state for obtaining the first storage region in kernel spacing is included in that there are multiple first to deposit In the case where storage area domain, the storage state of at least one specific first storage region in kernel spacing is obtained.
Another aspect of the disclosure provides a kind of information processing system, including obtains module for obtaining kernel spacing In the first storage region storage state, first storage region is used to store a data queue of network interface card transmission, the One processing module is used in the case where the occupied memory space of the first storage region is less than the first preset value, network association View stack handles the data in the data queue.
Optionally, information processing system further includes the first replication module, for occupied in first storage region In the case that memory space is not less than the first preset value, the data queue in first storage region is copied into user's space The second storage region.
Optionally, information processing system further includes the second replication module, in the occupied storage of the first storage region In the case that space is not less than the second preset value, the data replicated in the data queue in first storage region are empty to user Between the second storage region, wherein second preset value be not more than first preset value.
Optionally, information processing system further includes Second processing module, in the occupied storage of the first storage region In the case that space is less than the second preset value, network protocol stack handles the number in the data queue in first storage region According to.
Optionally, information processing system further includes following at least one, deletes the data in second storage region, or Person is sent to by the third storage region in the data deposit kernel spacing in second storage region, or by the data User-level communication stack.
Optionally, information processing system further includes third processing module, for handling the number in second storage region According to the characteristic information of the determination data, judgment module is used to be based on the characteristic information, judges whether the data are peace Total evidence, execution module are used to that the data to be stored in the in kernel spacing in the case where the data are secure data The data are perhaps sent to user-level communication stack or the case where the data are not secure data by three storage regions Under, delete the data.
Optionally, the storage state for obtaining the first storage region in kernel spacing is included in that there are multiple first to deposit In the case where storage area domain, the storage state of at least one specific first storage region in kernel spacing is obtained.
Another aspect of the disclosure provides a kind of electronic equipment, including processor and memory, is stored thereon with Computer-readable instruction, when described instruction is executed by processor, so that the processor, obtains the first storage in kernel spacing The storage state in region, first storage region are used to store a data queue of network interface card transmission, and described first In the case that the occupied memory space of storage region is less than the first preset value, network protocol stack is handled in the data queue Data.
Optionally, the processor also executes pre- not less than first in the occupied memory space of the first storage region If the data queue in first storage region to be copied to the second storage region of user's space in the case where value.
Optionally, the second storage region that the data queue in first storage region is copied to user's space it Afterwards, the processor is also executed in the case where the occupied memory space of the first storage region is not less than the second preset value, multiple Make the data in the data queue in first storage region to user's space the second storage region, wherein described second Preset value is not more than first preset value.
Optionally, the second storage region that the data queue in first storage region is copied to user's space it Afterwards, the method also includes in the case where the occupied memory space of the first storage region is less than the second preset value, network is assisted View stack handles the data in the data queue in first storage region.
Optionally, the method also includes following at least one data deleted in second storage region, or will The third storage region in data deposit kernel spacing in second storage region, or the data are sent to user Space protocol stack.
Optionally, the method also includes handling the data in second storage region, with the spy of the determination data Reference breath, is based on the characteristic information, judges whether the data are secure data, and in the data is secure data In the case of, user-level communication is sent to by the third storage region in data deposit kernel spacing or by the data Stack, or in the case where the data are not secure data, delete the data.
Optionally, the storage state for obtaining the first storage region in kernel spacing is included in that there are multiple first to deposit In the case where storage area domain, the storage state of at least one specific first storage region in kernel spacing is obtained.
Another aspect of the present disclosure provides a kind of non-volatile memory medium, is stored with computer executable instructions, institute Instruction is stated when executed for realizing method as described above.
Another aspect of the present disclosure provides a kind of computer program, and the computer program, which includes that computer is executable, to be referred to It enables, described instruction is when executed for realizing method as described above.
Detailed description of the invention
In order to which the disclosure and its advantage is more fully understood, referring now to being described below in conjunction with attached drawing, in which:
Fig. 1 diagrammatically illustrates the application scenarios of the information processing method according to the embodiment of the present disclosure;
Fig. 2A diagrammatically illustrates the flow chart of the information processing method according to the embodiment of the present disclosure;
Fig. 2 B diagrammatically illustrates the storage for obtaining the first storage region in kernel spacing according to the embodiment of the present disclosure The schematic diagram of state.
Fig. 2 C diagrammatically illustrates the schematic diagram of the operation S220 according to the embodiment of the present disclosure.
Fig. 3 A diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure;
Fig. 3 B diagrammatically illustrates the schematic diagram of the operation S310 according to the embodiment of the present disclosure.
Fig. 4 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure;
Fig. 5 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure;
Fig. 6 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure;
Fig. 7 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure;
Fig. 8 diagrammatically illustrates the block diagram of the information processing system according to the embodiment of the present disclosure;
Fig. 9 diagrammatically illustrates the block diagram of the information processing system according to another embodiment of the disclosure;
Figure 10 diagrammatically illustrates the block diagram of the information processing system according to another embodiment of the disclosure;
Figure 11 diagrammatically illustrates the block diagram of the information processing system according to another embodiment of the disclosure;
Figure 12 diagrammatically illustrates the block diagram of the information processing system according to another embodiment of the disclosure;And
Figure 13 diagrammatically illustrates the block diagram of the electronic equipment according to the embodiment of the present disclosure.
Specific embodiment
Hereinafter, will be described with reference to the accompanying drawings embodiment of the disclosure.However, it should be understood that these descriptions are only exemplary , and it is not intended to limit the scope of the present disclosure.In the following detailed description, to elaborate many specific thin convenient for explaining Section is to provide the comprehensive understanding to the embodiment of the present disclosure.It may be evident, however, that one or more embodiments are not having these specific thin It can also be carried out in the case where section.In addition, in the following description, descriptions of well-known structures and technologies are omitted, to avoid Unnecessarily obscure the concept of the disclosure.
Term as used herein is not intended to limit the disclosure just for the sake of description specific embodiment.It uses herein The terms "include", "comprise" etc. show the presence of the feature, step, operation and/or component, but it is not excluded that in the presence of Or add other one or more features, step, operation or component.
There are all terms (including technical and scientific term) as used herein those skilled in the art to be generally understood Meaning, unless otherwise defined.It should be noted that term used herein should be interpreted that with consistent with the context of this specification Meaning, without that should be explained with idealization or excessively mechanical mode.
It, in general should be according to this using statement as " at least one in A, B and C etc. " is similar to Field technical staff is generally understood the meaning of the statement to make an explanation (for example, " system at least one in A, B and C " Should include but is not limited to individually with A, individually with B, individually with C, with A and B, with A and C, have B and C, and/or System etc. with A, B, C).Using statement as " at least one in A, B or C etc. " is similar to, generally come Saying be generally understood the meaning of the statement according to those skilled in the art to make an explanation (for example, " having in A, B or C at least One system " should include but is not limited to individually with A, individually with B, individually with C, with A and B, have A and C, have B and C, and/or the system with A, B, C etc.).It should also be understood by those skilled in the art that substantially arbitrarily indicating two or more The adversative conjunction and/or phrase of optional project shall be construed as either in specification, claims or attached drawing A possibility that giving including one of these projects, either one or two projects of these projects.For example, phrase " A or B " should A possibility that being understood to include " A " or " B " or " A and B ".
Shown in the drawings of some block diagrams and/or flow chart.It should be understood that some sides in block diagram and/or flow chart Frame or combinations thereof can be realized by computer program instructions.These computer program instructions can be supplied to general purpose computer, The processor of special purpose computer or other programmable data processing units, so that these instructions are when executed by this processor can be with Creation is for realizing function/operation device illustrated in these block diagrams and/or flow chart.
Therefore, the technology of the disclosure can be realized in the form of hardware and/or software (including firmware, microcode etc.).Separately Outside, the technology of the disclosure can take the form of the computer program product on the computer-readable medium for being stored with instruction, should Computer program product uses for instruction execution system or instruction execution system is combined to use.In the context of the disclosure In, computer-readable medium, which can be, can include, store, transmitting, propagating or transmitting the arbitrary medium of instruction.For example, calculating Machine readable medium can include but is not limited to electricity, magnetic, optical, electromagnetic, infrared or semiconductor system, device, device or propagation medium. The specific example of computer-readable medium includes: magnetic memory apparatus, such as tape or hard disk (HDD);Light storage device, such as CD (CD-ROM);Memory, such as random access memory (RAM) or flash memory;And/or wire/wireless communication link.
Embodiment of the disclosure provides a kind of information processing method, including obtaining the first storage region in kernel spacing Storage state, first storage region be used for store network interface card transmission a data queue, and it is described first storage In the case that the occupied memory space in region is less than the first preset value, network protocol stack handles the number in the data queue According to.
Fig. 1 diagrammatically illustrates the application scenarios of information processing method according to an embodiment of the present disclosure.It should be noted that Being is only the example that can apply the scene of the embodiment of the present disclosure shown in Fig. 1, to help skilled in the art to understand the disclosure Technology contents, but be not meant to that the embodiment of the present disclosure may not be usable for other equipment, system, environment or scene.
As shown in Figure 1, including electronic equipment 100 in the application scenarios, electronic equipment 100 includes network interface card 110.
Network interface card 110 for example receives data queue 1, data queue 2, data queue 3 and the data queue 4 of Ethernet transmitting. The data queue 1 received, data queue 2, data queue 3 and data queue 4 are cached to interior by network interface card 110 by trawl performance In nuclear space 120, network protocol stack 130 of the trawl performance into the electronic equipment 100 sends data queue to be treated Identification information, the identification information for example can be the address of data to be treated in the number or data queue of data queue Information etc., to make the data queue 1 in 130 process kernel space 120 of network protocol stack, data queue 2,3 and of data queue Data queue 4.
When the bursts of traffic at least one data queue that the network interface card 110 receives increases, network protocol stack 130 comes not And the data of the data queue 1, data queue 2, data queue 3 and data queue 4 cached in process kernel space 120, it causes The delay of data processing even packet loss.For example, certain application program by malicious access, leads to the corresponding data team of the application program When the bursts of traffic of column 1 increases, network protocol stack 130 has little time the data cached in process kernel space 120, and causes flow The data of other normal data queues can not be handled in time, or even generate packet loss.
To solve the above-mentioned problems, present disclose provides a kind of method of information processing, this method being capable of dynamic self-adapting The data flow that ground processing burst increases, guarantees that other normal data flows are unaffected.Below with reference to Fig. 2A~Fig. 2 C, Fig. 3 A and Fig. 3 B and Fig. 4~Fig. 7 illustrate embodiment of the present disclosure.
Fig. 2A diagrammatically illustrates the flow chart of information processing method according to an embodiment of the present disclosure.
As shown in Figure 2 A, this method includes operation S210 and S220.
In operation S210, the storage state of the first storage region in kernel spacing is obtained, first storage region is used In the data queue that storage network interface card is sent.
In operation S220, in the case where the occupied memory space of the first storage region is less than the first preset value, Network protocol stack handles the data in the data queue.
This method can monitor the storage state of the first storage region in real time, guarantee the data stored in the first storage region When the flow of queue does not occur abnormal, the data of first storage region can be handled in time by network protocol stack.
In accordance with an embodiment of the present disclosure, in operation S210, the first storage region can be the storage region in kernel spacing, For storing a data queue of network interface card transmission.For example, 32 Linux memory headrooms usually divide address range 0X00000000~0XBFFFFFFFF is user's space, and address range 0XC0000000~0XFFFFFFFF is kernel spacing, Under the scene, the first storage region for example be can be from the memory block address 0XF0000000 to address 0XF000FFFF Domain.In accordance with an embodiment of the present disclosure, storage state can refer to the size of the occupied memory space of the first storage region.Example Such as, the corresponding address range of the first storage region is 0XF0000000~0XF000FFFF, address 0XF0000000~ Data are cached on 0XF000FFFF, then storage state can be the first storage region and be otherwise fully engaged.According to the disclosure Embodiment can monitor the state of the first storage region by obtaining the position of pointer, when pointer is from the first storage region When first address position is moved to FA final address position, show that the first storage region is otherwise fully engaged.
Fig. 2 B diagrammatically illustrates the storage for obtaining the first storage region in kernel spacing according to the embodiment of the present disclosure The schematic diagram of state.
It as shown in Figure 2 B, include the first storage region 210 and pointer P in the schematic diagram.
First storage region 210 is, for example, from address 0 to the storage region of address N-1, and pointer P is for monitoring the first storage The storage state in region 210, for example, when pointer P is located at the position of address N-2, indicate memory space that data occupy be from The space of address N-3 is arrived in address 0, and the position by obtaining pointer P can obtain the storage state of the first storage region 210.
In accordance with an embodiment of the present disclosure, the storage state for obtaining the first storage region in kernel spacing includes existing In the case where multiple first storage regions, the storage state of at least one specific first storage region in kernel spacing is obtained.Example As in scene shown in Fig. 1, network interface card can receive data queue 1, data queue 2, data queue 3 and data queue 4, network interface card Driving respectively stores the data of 4 data queues to 4 the first storage regions, and usually data queue 1 and data queue 2 Flow the case where increasing there is no burst, can only obtain data queue 3 at this time and data queue 4 corresponding kernel is empty Between in the first storage region storage state.The data flow of monitoring can be arranged in this method according to actual needs, save money Source simultaneously improves user experience.
In accordance with an embodiment of the present disclosure, in operation S220, the first preset value for example can be the big of the memory space of occupancy It is small, such as the first preset value is that 256M or the first preset value for example can be occupied memory space and the first memory block The ratio of the total memory space in domain, such as occupied memory space are the 8/9 of the total memory space of the first storage region.According to In embodiment of the disclosure, such as the scene shown in Fig. 2 B, the first preset value is that the first storage region is otherwise fully engaged, and is passed through Pointer P monitors the first storage region 210 and is not otherwise fully engaged, is handled by network protocol stack and is buffered in the first storage region 210 In data queue.
In accordance with an embodiment of the present disclosure, in operation S220, there are multiple first storage regions, such as network interface card N number of data queue can be received simultaneously, and N number of data queue is corresponding with N number of first storage region respectively, when this N number of first is deposited The M occupied memory spaces of the first storage region in storage area domain are not less than preset value, and N-M the first storage regions are occupied Memory space be less than preset value in the case where, network protocol stack does not handle the M corresponding data queues of the first storage region, And handle the N-M corresponding data queues of the first storage region.
Fig. 2 C diagrammatically illustrates the schematic diagram of the operation S220 according to the embodiment of the present disclosure.
It as shown in Figure 2 C, further include the first storage region 220 on the basis of the first storage region 210 in the schematic diagram With the first storage region 230.Multiple first storage region includes the first storage region 210, the first storage region 220 and first Storage region 230 caches the data of different data queue respectively.The pointer P1 of first storage region 210 is located at the position of address N-1 It sets, the pointer P2 of the first storage region 220 is located at the position of address 2N, and the pointer P3 of the first storage region 230 is located at address X's Position.
For example, if the first preset value is that the first storage region 210 is otherwise fully engaged, the first storage region 210 and first The occupied memory space of storage region 230 is less than preset value, is deposited by network protocol stack processing the first storage region 210 and first Data in storage area domain 230.And the first storage region 220 is otherwise fully engaged, network protocol stack does not handle the first storage region 220 In data.
Fig. 3 A diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure.
As shown in Figure 3A, this method includes operation S210 and operation S310.
In operation S310, the case where the occupied memory space of the first storage region is not less than the first preset value Under, the data queue in first storage region is copied to the second storage region of user's space.
Data queue in first storage region is copied to the second storage region by this method, so that network protocol stack is temporary The data in first storage region are not handled, alleviate the pressure of network protocol stack, guarantee the data energy of normal data queue It is enough to be handled in time.
In accordance with an embodiment of the present disclosure, operation S310, if such as the first preset value is that memory space is otherwise fully engaged, In the case where the first storage region is otherwise fully engaged, the data queue in the first storage region is copied to the of user's space Two storage regions, such as copy to from first storage region 0XF0000000~0XF000FFFF the second memory block of user's space Domain 0X00000000~0X0000FFFF.In accordance with an embodiment of the present disclosure, the shape of the first storage region can be monitored by pointer State shows the first storage when pointer is moved to the last one address location from first address location of the first storage region Region is otherwise fully engaged, at this point, the data queue in the first storage region is copied to the second storage region of user's space, it should Pointer returns to first address location in the first storage region, so that network protocol stack does not handle first storage temporarily Data in region, while first storage region can continue to receive the data of the data queue.
Fig. 3 B diagrammatically illustrates the schematic diagram of the operation S310 according to the embodiment of the present disclosure.
It as shown in Figure 3B, include the first storage region 220 shown in fig. 2 C, the first storage region 220 in the schematic diagram It is otherwise fully engaged, the data queue in the first storage region 220 is copied to the second storage region of user's space, pointer P weight The new first address position returned in the first storage region 220, so that network protocol stack does not handle first storage region 220 temporarily In data, while first storage region 220 can continue to receive the data of the data queue.
Fig. 4 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure.
As shown in figure 4, it further includes operation S410 that this method, which is included on the basis of previous embodiment,.
It is multiple in the case where the occupied memory space of the first storage region is not less than the second preset value in operation S410 Make the data in the data queue in first storage region to user's space the second storage region, wherein described second Preset value is not more than first preset value.
In accordance with an embodiment of the present disclosure, it deposits the data queue in the first storage region is copied to the second of user's space After storage area domain, in the case where the occupied memory space of the first storage region is not less than the second preset value, described the is replicated The second storage region of data in data queue in one storage region to user's space, wherein second preset value is not Greater than first preset value.
In accordance with an embodiment of the present disclosure, in operation S410, the second preset value is not more than first preset value, such as first Preset value is that the ratio of occupied memory space and the total memory space of the first storage region is 1, and the second preset value is occupied The ratio of memory space and the total memory space of the first storage region is 1/3.In above-mentioned scene, such as the first memory block Domain is fully occupied, and the data queue in the first storage region is copied to the second storage region of user's space, this first is deposited Storage area domain continues to the data of the data queue, if the memory space that the data continued to occupy is default not less than second Value, then replicate the data in the data queue in first storage region to user's space the second storage region.
Fig. 5 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure.
As shown in figure 5, it further includes operation S510 that this method, which is included on the basis of previous embodiment,.
In operation S510, in the case where the occupied memory space of the first storage region is less than the second preset value, network Protocol stack handles the data in the data queue in first storage region.
In accordance with an embodiment of the present disclosure, the data queue in first storage region is being copied to the of user's space After two storage regions, in the case where the occupied memory space of the first storage region is less than the second preset value, network protocol Stack handles the data in the data queue in first storage region.
In accordance with an embodiment of the present disclosure, S510 is being operated, such as is being answered by the data queue in first storage region After making the second storage region of user's space, which continues to the data of the data queue, if continuing The memory space that the data of the received data queue occupy is less than the second preset value, then network protocol stack processing described first is deposited The data in data queue in storage area domain.
In accordance with an embodiment of the present disclosure, the case where the occupied memory space of the first storage region is less than the second preset value Under, it includes in preset times that network protocol stack, which handles the data in the data queue in first storage region, this first After the occupied memory space of storage region is respectively less than the second preset value, network protocol stack handles the number in first storage region According to.Wherein, preset times can be preset, for example, can be 5 times, it is 10 inferior.
In accordance with an embodiment of the present disclosure, the data for being stored in the second storage region can be deleted, or can be by second The third storage region in data deposit kernel spacing in storage region, or the data are sent to user's space association Discuss stack.This method can the data according to actual needs to the second storage region handle, either delete or reuse, Further improve user experience.
Fig. 6 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure.
As shown in fig. 6, it further includes operation S610~S630 that this method, which is included on the basis of previous embodiment,.
In operation S610, the data in second storage region are handled, with the characteristic information of the determination data.
In operation S620, it is based on the characteristic information, judges whether the data are secure data.
In operation S630, in the case where the data are secure data, the data are stored in the in kernel spacing The data are sent to user-level communication stack by three storage regions;Or the case where the data are not secure data Under, delete the data.
In accordance with an embodiment of the present disclosure, in operation S610, such as by other applications in the second storage region Data processing, obtains the characteristic information of the data, and this feature information for example can be the transmitting terminal etc. of the data.
In accordance with an embodiment of the present disclosure, in operation S620, it is based on the characteristic information, judges whether the data are safety Data.For example, whether the transmitting terminal of the data is marked as unsafe equipment.
In accordance with an embodiment of the present disclosure, it in operation S630, in the case where the data are secure data, such as can incite somebody to action Third storage region in the data deposit kernel spacing, again carries out the data by the network protocol stack of kernel spacing Reason, or the data can be sent to user-level communication stack, the data are carried out by the network protocol stack of user's space Processing.Alternatively, the data can be deleted in the case where the data are dangerous data.
Fig. 7 diagrammatically illustrates the flow chart of the information processing method according to another embodiment of the disclosure.
As shown in fig. 7, this method includes operation S710~S780.
In operation S710, it is similar to operations described above S210, each data queue corresponding first is monitored in real time and deposits The storage state in storage area domain.
In operation S720, judge whether the storage state of at least one the first storage region is the storage shape at full capacity State refers to storage state not less than the first preset value at full capacity.If each equal sub-load of the first storage region, executes operation S770 and operation S780.
In operation S770 and operation S780, it is similar to operations described above S220, the data queue of sub-load retains In kernel spacing, the data in the data queue are handled by network protocol stack.
At least one first storage region at full capacity, executes operation S730, is similar to operations described above if it exists Data queue in the first storage region at full capacity is copied to the second storage region of user's space by S310.
In operation S740, in the second memory block that the data queue in first storage region is copied to user's space Whether after domain, the first storage region continues to data, judge current storage state less than the second preset value.If less than Two preset values execute operation S760 and operation S780.In operation S760, the second storage region of user's space is released.
If being not less than the second preset value, operation S750 is executed, is similar to operations described above S410, duplication described first The second storage region of data in data queue in storage region to user's space, wherein second preset value is little In first preset value, and the storage state of the first storage region is monitored in real time, until the storage state of the first storage region Less than the second preset value.
Fig. 8 diagrammatically illustrates the block diagram of the information processing system 800 according to the embodiment of the present disclosure.
As shown in figure 8, information processing system 800 includes obtaining module 810 and first processing module 820.
Module 810 is obtained, such as is executed above with reference to the operation S210 in figure, is deposited for obtaining first in kernel spacing The storage state in storage area domain, first storage region are used to store a data queue of network interface card transmission.
First processing module 820, such as execute above with reference to the operation S220 in figure, in first storage region In the case that occupied memory space is less than the first preset value, network protocol stack handles the data in the data queue.
In accordance with an embodiment of the present disclosure, the storage state for obtaining the first storage region in kernel spacing includes existing In the case where multiple first storage regions, the storage state of at least one specific first storage region in kernel spacing is obtained.
Fig. 9 diagrammatically illustrates the block diagram of the information processing system 900 according to another embodiment of the disclosure.
As shown in figure 9, information processing system 900 further includes the first replication module 910 on the basis of previous embodiment.
First replication module 910, such as execute above with reference to the operation S310 in figure, in first storage region In the case that occupied memory space is not less than the first preset value, the data queue in first storage region is copied to Second storage region of user's space.
Figure 10 diagrammatically illustrates the block diagram of the information processing system 1000 according to another embodiment of the disclosure.
As shown in Figure 10, information processing system 1000 further includes the second replication module on the basis of previous embodiment 1010。
Second replication module 1010, such as execute above with reference to the operation S410 in figure, in the first storage region quilt In the case that the memory space of occupancy is not less than the second preset value, the number in the data queue in first storage region is replicated According to the second storage region for arriving user's space, wherein second preset value is not more than first preset value.
Figure 11 diagrammatically illustrates the block diagram of the information processing system 1100 according to another embodiment of the disclosure.
As shown in figure 11, information processing system 1100 further includes Second processing module on the basis of previous embodiment 1110。
Second processing module 1110, such as execute above with reference to the operation S510 in figure, in the first storage region quilt In the case that the memory space of occupancy is less than the second preset value, network protocol stack handles the data team in first storage region Data in column.
Figure 12 diagrammatically illustrates the block diagram of the information processing system 1200 according to another embodiment of the disclosure.
As shown in figure 12, information processing system 1200 further includes third processing module on the basis of previous embodiment 1210, judgment module 1220 and execution module 1230.
Third processing module 1210, such as execute above with reference to the operation S610 in figure, for handling second storage Data in region, with the characteristic information of the determination data.
Judgment module 1220, such as execute above with reference to the operation S620 in figure, for being based on the characteristic information, judgement Whether the data are secure data.
Execution module 1230, such as execute above with reference to the operation S630 in figure, for being secure data in the data In the case where, user's space association is sent to by the third storage region in data deposit kernel spacing or by the data Stack is discussed, or in the case where the data are not secure data, deletes the data.
It is module according to an embodiment of the present disclosure, submodule, unit, any number of or in which any more in subelement A at least partly function can be realized in a module.It is single according to the module of the embodiment of the present disclosure, submodule, unit, son Any one or more in member can be split into multiple modules to realize.According to the module of the embodiment of the present disclosure, submodule, Any one or more in unit, subelement can at least be implemented partly as hardware circuit, such as field programmable gate Array (FPGA), programmable logic array (PLA), system on chip, the system on substrate, the system in encapsulation, dedicated integrated electricity Road (ASIC), or can be by the hardware or firmware for any other rational method for integrate or encapsulate to circuit come real Show, or with any one in three kinds of software, hardware and firmware implementations or with wherein any several appropriately combined next reality It is existing.Alternatively, can be at least by part according to one or more of the module of the embodiment of the present disclosure, submodule, unit, subelement Ground is embodied as computer program module, when the computer program module is run, can execute corresponding function.
For example, obtaining module 810, first processing module 820, the first replication module 910, the second replication module 1010, the Any number of in two processing modules 1110, third processing module 1210, judgment module 1220 and execution module 1230 can close And it is realized in a module or any one module therein can be split into multiple modules.Alternatively, in these modules At least partly functions of one or more modules can be combined at least partly function of other modules, and in a module Middle realization.In accordance with an embodiment of the present disclosure, it is multiple that module 810, first processing module 820, the first replication module 910, second are obtained In molding block 1010, Second processing module 1110, third processing module 1210, judgment module 1220 and execution module 1230 extremely Few one can at least be implemented partly as hardware circuit, such as field programmable gate array (FPGA), programmable logic battle array (PLA), system on chip, the system on substrate, the system in encapsulation, specific integrated circuit (ASIC) are arranged, or can be by electricity Road carries out the hardware such as any other rational method that is integrated or encapsulating or firmware to realize, or with software, hardware and firmware Any one in three kinds of implementations several appropriately combined is realized with wherein any.Alternatively, obtaining module 810, first Processing module 820, the first replication module 910, the second replication module 1010, Second processing module 1110, third processing module 1210, at least one of judgment module 1220 and execution module 1230 can at least be implemented partly as computer program mould Block can execute corresponding function when the computer program module is run.
Figure 13 is diagrammatically illustrated according to the electronic equipment for being adapted for carrying out method as described above of the embodiment of the present disclosure Block diagram.Computer system shown in Figure 13 is only an example, should not function and use scope to the embodiment of the present disclosure Bring any restrictions.
As shown in figure 13, electronic equipment 1300 includes processor 1310 and computer readable storage medium 1320.The electronics Equipment 1300 can execute the method according to the embodiment of the present disclosure.
Specifically, processor 1310 for example may include general purpose microprocessor, instruction set processor and/or related chip group And/or special microprocessor (for example, specific integrated circuit (ASIC)), etc..Processor 1310 can also include for caching The onboard storage device of purposes.Processor 1310 can be the different movements for executing the method flow according to the embodiment of the present disclosure Single treatment unit either multiple processing units.
Computer readable storage medium 1320, for example, can be can include, store, transmitting, propagating or transmitting instruction Arbitrary medium.For example, readable storage medium storing program for executing can include but is not limited to electricity, magnetic, optical, electromagnetic, infrared or semiconductor system, dress It sets, device or propagation medium.The specific example of readable storage medium storing program for executing includes: magnetic memory apparatus, such as tape or hard disk (HDD);Light Storage device, such as CD (CD-ROM);Memory, such as random access memory (RAM) or flash memory;And/or wire/wireless communication Link.
Computer readable storage medium 1320 may include computer program 1321, which may include Code/computer executable instructions executes processor 1310 and is implemented according to the disclosure The method or its any deformation of example.
Computer program 1321 can be configured to have the computer program code for example including computer program module.Example Such as, in the exemplary embodiment, the code in computer program 1321 may include one or more program modules, for example including 1321A, module 1321B ....It should be noted that the division mode and number of module are not fixed, those skilled in the art It can be combined according to the actual situation using suitable program module or program module, when these program modules are combined by processor When 1310 execution, processor 1310 is executed according to the method for the embodiment of the present disclosure or its any deformation.
In accordance with an embodiment of the present disclosure, processor 1310 can be carried out with sender unit 1330 and signal receiver 1340 Interaction, to execute according to the method for the embodiment of the present disclosure or its any deformation.
According to an embodiment of the invention, it is multiple to obtain module 810, first processing module 820, the first replication module 910, second In molding block 1010, Second processing module 1110, third processing module 1210, judgment module 1220 and execution module 1230 extremely Few one can be implemented as the computer program module with reference to Figure 13 description and may be implemented when being executed by processor 1310 Corresponding operating described above.
The disclosure additionally provides a kind of computer-readable medium, which, which can be in above-described embodiment, retouches Included in the equipment/device/system stated;It is also possible to individualism, and without in the supplying equipment/device/system.On It states computer-readable medium and carries one or more program, when said one or multiple programs are performed, in realization The corresponding operating of face description.
In accordance with an embodiment of the present disclosure, computer-readable medium can be computer-readable signal media or computer can Read storage medium either the two any combination.Computer readable storage medium for example can be --- but it is unlimited In system, device or the device of --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, or any above combination.It calculates The more specific example of machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, portable of one or more conducting wires Formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device or The above-mentioned any appropriate combination of person.In the disclosure, computer readable storage medium can be it is any include or storage program Tangible medium, which can be commanded execution system, device or device use or in connection.And in this public affairs In opening, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal, In carry computer-readable program code.The data-signal of this propagation can take various forms, including but not limited to Electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be computer-readable Any computer-readable medium other than storage medium, the computer-readable medium can send, propagate or transmit for by Instruction execution system, device or device use or program in connection.The journey for including on computer-readable medium Sequence code can transmit with any suitable medium, including but not limited to: wireless, wired, optical cable, radiofrequency signal etc., or Above-mentioned any appropriate combination.
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction It closes to realize.
It will be understood by those skilled in the art that the feature recorded in each embodiment and/or claim of the disclosure can To carry out multiple combinations or/or combination, even if such combination or combination are not expressly recited in the disclosure.Particularly, exist In the case where not departing from disclosure spirit or teaching, the feature recorded in each embodiment and/or claim of the disclosure can To carry out multiple combinations and/or combination.All these combinations and/or combination each fall within the scope of the present disclosure.
Although the disclosure, art technology has shown and described referring to the certain exemplary embodiments of the disclosure Personnel it should be understood that in the case where the spirit and scope of the present disclosure limited without departing substantially from the following claims and their equivalents, A variety of changes in form and details can be carried out to the disclosure.Therefore, the scope of the present disclosure should not necessarily be limited by above-described embodiment, But should be not only determined by appended claims, also it is defined by the equivalent of appended claims.

Claims (10)

1. a kind of information processing method, comprising:
The storage state of the first storage region in kernel spacing is obtained, first storage region is used to store network interface card transmission One data queue;And
In the case where the occupied memory space of the first storage region is less than the first preset value, network protocol stack handles institute State the data in data queue.
2. according to the method described in claim 1, further include:
In the case where the occupied memory space of the first storage region is not less than the first preset value, described first is stored Data queue in region copies to the second storage region of user's space.
3. according to the method described in claim 2, wherein, the data queue in first storage region is being copied to user After second storage region in space, the method also includes:
In the case where the occupied memory space of the first storage region is not less than the second preset value, first memory block is replicated The second storage region of data in data queue in domain to user's space, wherein second preset value is no more than described First preset value.
4. according to the method described in claim 2, wherein, the data queue in first storage region is being copied to user After second storage region in space, the method also includes:
In the case where the occupied memory space of the first storage region is less than the second preset value, network protocol stack processing described the The data in data queue in one storage region.
5. according to the method described in claim 2, further including following at least one:
Delete the data in second storage region;Or
By the third storage region in the data deposit kernel spacing in second storage region;Or
The data are sent to user-level communication stack.
6. according to the method described in claim 2, further include:
The data in second storage region are handled, with the characteristic information of the determination data;
Based on the characteristic information, judge whether the data are secure data;And
In the case where the data are secure data, by the third storage region in data deposit kernel spacing or incite somebody to action The data are sent to user-level communication stack;Or
In the case where the data are not secure data, the data are deleted.
7. according to the method described in claim 1, wherein, the storage state for obtaining the first storage region in kernel spacing Include:
There are multiple first storage regions, at least one specific first storage region is deposited in acquisition kernel spacing Storage state.
8. a kind of electronic equipment, comprising:
Processor;And
Memory is stored thereon with computer-readable instruction, when described instruction is executed by processor, so that the processor:
The storage state of the first storage region in kernel spacing is obtained, first storage region is used to store network interface card transmission One data queue;And
In the case where the occupied memory space of the first storage region is less than the first preset value, network protocol stack handles institute State the data in data queue.
9. electronic equipment according to claim 8, wherein the processor also executes:
In the case where the occupied memory space of the first storage region is not less than the first preset value, described first is stored Data queue in region copies to the second storage region of user's space.
10. electronic equipment according to claim 9, wherein replicated by the data queue in first storage region To after the second storage region of user's space, the processor is also executed:
In the case where the occupied memory space of the first storage region is not less than the second preset value, first memory block is replicated The second storage region of data in data queue in domain to user's space, wherein second preset value is no more than described First preset value.
CN201810599649.8A 2018-06-11 2018-06-11 Information processing method and electronic equipment Pending CN108965161A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810599649.8A CN108965161A (en) 2018-06-11 2018-06-11 Information processing method and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810599649.8A CN108965161A (en) 2018-06-11 2018-06-11 Information processing method and electronic equipment

Publications (1)

Publication Number Publication Date
CN108965161A true CN108965161A (en) 2018-12-07

Family

ID=64488305

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810599649.8A Pending CN108965161A (en) 2018-06-11 2018-06-11 Information processing method and electronic equipment

Country Status (1)

Country Link
CN (1) CN108965161A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111447046A (en) * 2020-03-26 2020-07-24 广州市百果园信息技术有限公司 Service data transmission method, device, equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101789908A (en) * 2010-03-04 2010-07-28 成都市华为赛门铁克科技有限公司 Fragmental message receiving and processing method and device
CN103425436A (en) * 2012-05-21 2013-12-04 联想(北京)有限公司 Terminal equipment and virtual storage unit management method
CN103888377A (en) * 2014-03-28 2014-06-25 华为技术有限公司 Message cache method and device
CN107003943A (en) * 2016-12-05 2017-08-01 华为技术有限公司 Control method, storage device and the system of reading and writing data order in NVMe over Fabric frameworks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101789908A (en) * 2010-03-04 2010-07-28 成都市华为赛门铁克科技有限公司 Fragmental message receiving and processing method and device
CN103425436A (en) * 2012-05-21 2013-12-04 联想(北京)有限公司 Terminal equipment and virtual storage unit management method
CN103888377A (en) * 2014-03-28 2014-06-25 华为技术有限公司 Message cache method and device
CN107003943A (en) * 2016-12-05 2017-08-01 华为技术有限公司 Control method, storage device and the system of reading and writing data order in NVMe over Fabric frameworks

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111447046A (en) * 2020-03-26 2020-07-24 广州市百果园信息技术有限公司 Service data transmission method, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
US20180237040A1 (en) Locomotive control system
US8406986B2 (en) Emergency routing within a controllable transit system
CN108829350A (en) Data migration method and device based on block chain
CN105659222B (en) System and method for calculating eap-message digest
CN107767478A (en) A kind of method and device for preserving logging
CN105264930B (en) Sending node and its reporting cached state method
CN105518611A (en) Remote direct memory access method, equipment and system
CN105426472B (en) Distributed computing system and its data processing method
US10031758B2 (en) Chained-instruction dispatcher
US9092285B2 (en) Method of entropy distribution on a parallel computer
CN108885667A (en) Safety risk management system, server, control method and non-transitory computer-readable medium
CN107924330A (en) Technology for integrated thread scheduling
CN108965161A (en) Information processing method and electronic equipment
CN109088750A (en) Network Situation Awareness System design and dispositions method based on container
TWI622956B (en) Result data stream coding for repeating workloads
CN108134745A (en) Distribution type data collection method and device
CN110399394A (en) The data traversal method, apparatus and calculate node of calculate node
JP2012205303A5 (en)
CN114490280A (en) Log processing method, device, equipment and medium
CN105915930A (en) Video file sending method and apparatus
CN108376377A (en) A kind of method, apparatus and server for finding pet
KR102442576B1 (en) Video frame codec architectures
CN109756561B (en) Data storage method and device, electronic equipment and computer readable medium
CN110322350A (en) Cut method, apparatus, equipment and the storage medium of the common recognition hollow block of network
CN109787813A (en) Configuration method, equipment, system and the medium of service chaining based on SDN

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20181207

RJ01 Rejection of invention patent application after publication