ÓйØCÖ¸ÕëºÍ½á¹¹Ìå
C/C++ code:
struct dmi_eps {
uint8_t anchor[4];
int8_t checksum;
uint8_t length;
uint8_t majorversion;
uint8_t minorversion;
uint16_t maxstructsize;
uint8_t revision;
uint8_t pad[5];
uint8_t intanchor[5];
int8_t intchecksum;
uint16_t tablelength;
uint32_t tableaddress;
uint16_t numstructs;
uint8_t SMBIOSrev;
};
char *dmi, *dmi_search_start, *dmi_start;
int found=0;
struct dmi_eps *eps;
//find anchor
for(dmi = dmi_search_start; dmi < dmi_search_start + 0xf0000; dmi +=16){
if( *dmi == '_' &&
*(dmi+1) == 'S' &&
*(dmi+2) == 'M' &&
*(dmi+3) == '_'){
found =1;
break;
}
}
if (!found) {
return -1;
}
dmi_start=dmi;¡¢
eps=(struct dmi_eps *)dmi; /* ÎÊÌâµã1£ºÕâ¶Î´úÂëµÄ×÷ÓÃÊÇʲôѽ£¿*/
}
ÇëÎÊ£¬¡°ÎÊÌâµã1£º¡± ´¦µÄ´úÂëµÄ×÷ÓÃÊÇʲô°¡£¿Êǽ«dmiÖ¸ÕëËùÖ¸ÏòµÄÄÚÈݸ³Öµ¸ø½á¹¹ÌåepsÂð£¿
Èç¹ûÊÇÕâÑùµÄ»°£¬ÄÇÒÔºó¾ÍÖ±½Ó¿ÉÒÔʹÓÃeps½á¹¹ÌåÖеijÉÔ±ÁËÂð£¿
Ï£ÍûÄܵõ½¸ßÊÖµÄÖ¸µ¼Óë°ï棬ллÏÈ~~~~
ÔÀ´dmiÊÇcharÖ¸Õ룬ºóÀ´(struct dmi_eps *)dmiÇ¿ÖÆ×ª»»¡£²¢½«Æä¸³Öµ¸ø
eps
epsºÍdmiÖ¸ÏòµÄÄÚÈÝÒ»Ö¡£
»¹ÓиöÎÊÌâ¾ÍÊÇ£¬dmiÖ¸ÕëÖеÄÄÚÈÝ»áºÍepsÀïÃæµÄ½á¹¹ÊÇÒ»ÑùµÄÂð£¿
ÄÇÈç¹ûÎÒÊä³ö
Ïà¹ØÎÊ´ð£º
QQȺ 29152388
ÓÑÇéUP
°ï¶¥
up
°ïup
up Ö§³Ö£¡
up jf
...ÄѵÀÓзÖ..?
up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£
Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ
¼ÓÁË¡£
¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
ÎÒÏÖÔÚҪЩһ¸öfortranµ÷ÓÃC½Ó¿ÚµÄÎÊÌ⣬µ«ÊDz»ÖªµÀ CÓïÑÔÀïÃæ·ÖÅäµÄÖ¸ÕëÔõô¸¶¸øfortran,ÓÖ²»ÄÜÔÚfortranÁ¢ÂíÏÈ·ÖÅäºÃ£¬ÒµÎñÉϲ»ÔÊÐí¡£
ÎÒдÁ˸ö²âÊÔµÄÀý×Ó¡£µ«ÊDz»ÐС£
test.c
#include <stdio.h>
#incl ......
Á½¸öÎļþ1.PC£¬1.inc
1.PCÓвÙ×÷oracleÊý¾Ý¿âµÄ ,1.incÒ²ÓвÙ×÷oracleÊý¾Ý¿â
ÔÚÆäËûÊý¾ÝÖÐÈçinformix ÖÐ$include 1.inc¾Í¿ÉÒÔʹÓÃÁË
ÔÚORACLEÊý¾Ý¿âÖØ $include 1.inc²»¿ÉÓà EXEC SQL include 1.incÒ²²»¿É ......
ÈçºÎÓÃC»Í¼£¬ÄÜ·ñ±àÒ»¸ö¾ßÌåµÄ ¡£
#include <conio.h>
#include <stdio.h>
int main()
{
int i;
char *s[]={"BLACK","BLUE","GREEN","CYAN","RE ......
°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......