当前位置:网站首页>Botu uses peek and poke for IO mapping
Botu uses peek and poke for IO mapping
2022-07-03 05:05:00 【DoTheTran】
Berto S7120、SCL Language programming 、PEEK、POKE Instructions 、IO mapping
brief introduction
Sometimes we need to map a variable to IO On domain , For example, a size of 16 The array variable of corresponds to the output Q0.0 To Q1.7, If one by one assignment is too verbose , Now we can use SCL Linguistic PEEK、POKE Instructions , Perform index addressing mapping
This article refers to the Siemens Help Center website :
http://www.ad.siemens.com.cn/productportal/Prods/S7-1200_PLC_EASY_PLUS/07-Program/03-instruction/03-Address/03-PEEK_POKE.html
background
Take the parking lot project as an example , share 20 A parking space , Each parking space corresponds to a sensor and a red light . For the convenience of programming , Use them separately DB The size in the block is 20 The array variable of represents the parking space sensor and the red light . It is very convenient to assign values in the way of circular array at one time 20 Assignment of lamp States .
But the problem is , How to input and output variables in an array , The convenient and fast mapping is I Point and Q How about it? ?
SCL Language
First of all SCL Language , It can easily complete the work that requires many instructions in the ladder diagram , It's like C Language programming is generally , It mainly uses IF…THEN/FOR/WHILE Statement to construct condition 、 loop 、 Judge such a structure , Add instructions to these structures again , To realize logical judgment . All programs are written in a plain text environment , But not as intuitive as ladder diagram .
PEEK And POKE
Use S7-1200 ,SCL Programming language PEEK and POKE Instructions , Can realize the right I/O、M Read or write memory and data blocks .
Applicable conditions of the directive :
- Used only for SCL programing language ;
- Software from TIA PORTAL V11 SP2 rise ;
- S7-1200 CPU Firmware from V2.2 rise ;
- Applicable operands ,I、Q、M、DB;
- DB Must be a non optimized access block .
Because we are right about I spot 、Q Point addressing , So use PEEK_BOOL and POKE_BOOL Instructions .
PEEK_BOOL Instructions
PEEK_BOOL Instructions are used to read input (I)、 Output (Q)、 Memory (M) Or data block (DB) Bit of variable .PEEK The instruction assigns the obtained data value to the corresponding variable in the form of return value .
PEEK_BOOL Command format :
among , Parameters area, There are four values according to the area where the data is located .
| area value | type | explain |
|---|---|---|
| 16#81 | I | Input area variables |
| 16#82 | Q | Output area variables |
| 16#83 | M | M Zone variable |
| 16#84 | DB | Block variables |
POKE_BOOL Instructions
POKE _BOOL Instructions can be used to input (I)( Generally not used )、 Output (Q)、 Memory (M) Or data block (DB) Write the variable address .POKE The instruction can pass the result to the corresponding variable in the instruction body .
PEEK_BOOL Command format :
Parameters area The value of is the same as PEEK.
Start
First, create a new one FC block , Name it IO mapping , Language choice SCL
Open the new block , Pull out the block interface above , Create two new temporary variables . among i As a cyclic variable ,io_offset Become IO Offset of the starting address of the domain .
At the command → Basic instructions → Mobile operating → read / Write to memory , find PEEK_BOOL and POKE_BOOL Instructions , Double click for easy input .
stay FC Block, enter the following code
FOR #i := 0 TO 19 DO //I -> Input
#io_offset := #i + 8 * 2 + 0;// from I2.0 Start
" An array variable ". Parking space sensor [#i] :=
PEEK_BOOL(area := 16#81,//16#81 by I
dbNumber := 0,
byteOffset := #io_offset / 8,
bitOffset := #io_offset MOD 8);
END_FOR;
FOR #i := 0 TO 19 DO // Output -> Q
#io_offset := #i + 8 * 4 + 0;// from Q4.0 Start
POKE_BOOL(area := 16#82, //16#82 by Q
dbNumber := 0,
byteOffset := #io_offset / 8,
bitOffset := #io_offset MOD 8,
value := " An array variable ". Parking space red light [#i]);
END_FOR
ad locum
If the mapped address is a continuous storage space , This method can use FOR Loop assignment . It's easy to find the law , Array element subscripts from 0 Start adding one by one 1, If I/O Point is from 0.0 Start , The bit variable of the corresponding input address is from 0 To 7 And back and forth , The byte address is first 8 individual 0, And then there was 8 individual 1…… So the summary is that the byte address is subscript division 8 The business of , Bit addresses are subscript divisible 8 The remainder of , In programming language, byte address is subscript /8, Bit address is subscript MOD8. If the byte address is not from 0.0 Start , Add an offset at the beginning of the loop . Then we can use FOR Loop to quickly implement bit by bit assignment .
边栏推荐
- Problems encountered in fuzzy query of SQL statements
- Esp32-c3 learning and testing WiFi (II. Wi Fi distribution - smart_config mode and BlueIf mode)
- 1111 online map (30 points)
- 2022-02-12 daily clock in: problem fine brush
- Go language interface learning notes Continued
- [research materials] 2021 annual report on mergers and acquisitions in the property management industry - Download attached
- Thesis reading_ Chinese NLP_ ELECTRA
- Notes | numpy-10 Iterative array
- M1 Pro install redis
- Maximum continuous sub segment sum (dynamic programming, recursive, recursive)
猜你喜欢

Basic use of Metasploit penetration testing framework

Flutter monitors volume to realize waveform visualization of audio

Oracle SQL table data loss
![[set theory] relation properties (transitivity | transitivity examples | transitivity related theorems)](/img/c2/87358af6b2b2892a6eceb751b3b60c.jpg)
[set theory] relation properties (transitivity | transitivity examples | transitivity related theorems)

Source insight garbled code solution

"Hands on deep learning" pytorch edition Chapter II exercise

Thesis reading_ Chinese medical model_ eHealth

5-36v input automatic voltage rise and fall PD fast charging scheme drawing 30W low-cost chip

JDBC database operation

Shuttle + alluxio accelerated memory shuffle take-off
随机推荐
1107 social clusters (30 points)
Problems encountered in fuzzy query of SQL statements
Market status and development prospect prediction of global SoC Test Platform Industry in 2022
Thesis reading_ ICD code_ MSMN
leetcode860. Lemonade change
1110 complete binary tree (25 points)
String matching: find a substring in a string
编译GCC遇到的“pthread.h” not found问题
JS function algorithm interview case
Market status and development prospects of the global autonomous marine glider industry in 2022
论文阅读_ICD编码_MSMN
1111 online map (30 points)
Market status and development prospect prediction of global colorimetric cup cover industry in 2022
MPM model and ab pressure test
Self introduction and objectives
Notes | numpy-07 Slice and index
Current market situation and development prospect prediction of global direct energy deposition 3D printer industry in 2022
Preparation for school and professional cognition
Burp suite plug-in based on actual combat uses tips
leetcode435. Non overlapping interval