content
stringlengths 228
999k
| pred_label
stringclasses 1
value | pred_score
float64 0.5
1
|
|---|---|---|
gusucode.com > 蓝色通用机械设备生产企业站织梦模板（demo65） > 蓝色通用机械设备生产企业站织梦模板（demo65）/www1/dede/api_ucenter.php
<?php
require_once(dirname(__FILE__)."/config.php");
CheckPurview('api_ucenter');
if(!function_exists('file_put_contents')){ function file_put_contents($filename, $s)
{
$fp = @fopen($filename, 'w');
@fwrite($fp, $s);
@fclose($fp);
return TRUE;
}}
require_once(DEDEINC.'/dedetemplate.class.php');
if(file_exists(DEDEROOT.'/uc_client/client.php'))
{
if(!defined('UC_API')) define('UC_API', '');
include_once DEDEROOT.'/uc_client/client.php';
}
else
{
ShowMsg('请安装UCenter模块!',-1);
exit();
}
$dopost = api_gpc('dopost','R');
$uc = new api_ucenter($dopost);
class api_ucenter
{
var $action;
var $dtp;
var $config;
//php5构造函数PHP>=5.0
function __construct($ac = '')
{
$action = 'uc_'.(empty($ac)||(!in_array($ac,array('install','edit'))) ? 'show' : trim($ac));
$this->dtp = new DedeTemplate();
$this->config = DEDEINC.'/common.inc.php';
$this->$action();
}
//构造类成员PHP<5.0
function api_ucenter($ac = '')
{
$this->__construct($ac);
}
function uc_install()
{
$uc_setings = api_gpc('uc_setings','P');
if(!isset($uc_setings['authkey']) || empty($uc_setings['authkey']))
{
ShowMsg('请填写uc创始人密码!',-1);
exit();
}
$uc_setings['ucapi'] = preg_replace("/\/$/", '', trim($uc_setings['ucapi']));
if(empty($uc_setings['ucapi']) || !preg_match("/^(http:\/\/)/i", $uc_setings['ucapi']))
{
ShowMsg('请填正确的服务端地址以http://开头!',-1);
exit();
}
else
{
if(!$uc_setings['ucip'])
{
$temp = @parse_url($uc_setings['ucapi']);
$uc_setings['ucapi'] = gethostbyname($temp['host']);
if(ip2long($uc_setings['ucapi']) == -1 || ip2long($uc_setings['ucapi']) === FALSE)
{
$uc_setings['ucip'] = '127.0.0.1';
}
}
}
$ucinfo = api_fopen($uc_setings['ucapi'].'/index.php?m=app&a=ucinfo', 500, '', '', 1, $uc_setings['ucip']);
list($status, $ucversion, $ucrelease, $uccharset, $ucdbcharset, $apptypes) = explode('|', $ucinfo);
if($status != 'UC_STATUS_OK')
{
ShowMsg('uc服务端地址无效,请仔细检查您安装的uc服务端地址!',-1);
exit();
}
else
{
$ucdbcharset = strtolower($ucdbcharset ? str_replace('-', '', $ucdbcharset) : $ucdbcharset);
if(UC_CLIENT_VERSION > $ucversion)
{
ShowMsg('uc服务端版本不一致,您当前的uc客服端版本为:'.UC_CLIENT_VERSION.',而服务端版本为:'.$ucversion.'!',-1);
exit();
}
elseif($ucdbcharset != 'gbk')
{
ShowMsg('uc服务端编码与DedeCMS编码不一致!要求您的uc服务端编码为:gbk编码.',-1);
exit();
}
//标签应用模板
$app_tagtemplates = 'apptagtemplates[template]='.urlencode('<a href="{url}" target="_blank">{title}</a>').'&'.
'apptagtemplates[fields][title]='.urlencode('标题').'&'.
'apptagtemplates[fields][writer]='.urlencode('作者').'&'.
'apptagtemplates[fields][pubdate]='.urlencode('时间').'&'.
'apptagtemplates[fields][url]='.urlencode('地址');
$postdata = 'm=app&a=add&ucfounder=&ucfounderpw='.urlencode($uc_setings['authkey']).'&apptype=OTHER&appname='.urlencode($GLOBALS['cfg_webname']).'&appurl='.urlencode($GLOBALS['cfg_basehost']).'&appip=&appcharset=gbk&appdbcharset=gbk&'.$app_tagtemplates.'&release='.UC_CLIENT_RELEASE;
$ucconfig = api_fopen($uc_setings['ucapi'].'/index.php', 500, $postdata, '', 1, $uc_setings['ucip']);
if(strstr($ucconfig,'<?xml'))
{
$temp = explode('<?xml', $ucconfig);
$ucconfig = $temp[0]; unset($temp);
}
if(empty($ucconfig))
{
ShowMsg('请填写有效的配置信息!',-1);
exit();
}
elseif($ucconfig == '-1')
{
ShowMsg('创始人密码错误!',-1);
exit();
}
else
{
list($appauthkey, $appid) = explode('|', $ucconfig);
if(empty($appauthkey) || empty($appid))
{
ShowMsg('数据获取失败!',-1);
exit();
}
elseif($succeed = api_write_config($ucconfig."|".$uc_setings['ucapi']."|".$uc_setings['ucip'], $this->config))
{
ShowMsg('安装成功!',-1);
exit();
}
else
{
ShowMsg('写入配置数据失败!'.$this->config.' 请设置可写权限!',-1);
exit();
}
}
}
}
function uc_edit()
{
$uc_setings = api_gpc('uc_setings','P');
$uc_dbpass = $uc_setings['dbpass'] == '********' ? UC_DBPW : $uc_setings['dbpass'];
$fp = fopen($this->config, 'r');
$content = fread($fp, filesize($this->config));
$content = trim($content);
$content = substr($content, -2) == '?>' ? substr($content, 0, -2) : $content;
$content = strstr($content, '_|cfg_|GLOBALS') ? str_replace('_|cfg_|GLOBALS','cfg_|GLOBALS',$content) : $content;
fclose($fp);
$connect = '';
if($uc_setings['connect'])
{
$uc_dblink = @mysql_connect($uc_setings['dbhost'], $uc_setings['dbuser'], $uc_dbpass, 1);
if(!$uc_dblink)
{
ShowMsg('数据库连接失败!',-1);
exit();
}else{
mysql_close($uc_dblink);
}
$connect = 'mysql';
$content = api_insert_config($content, "/define\('UC_DBHOST',\s*'.*?'\);/i", "define('UC_DBHOST', '".$uc_setings['dbhost']."');");
$content = api_insert_config($content, "/define\('UC_DBUSER',\s*'.*?'\);/i", "define('UC_DBUSER', '".$uc_setings['dbuser']."');");
$content = api_insert_config($content, "/define\('UC_DBPW',\s*'.*?'\);/i", "define('UC_DBPW', '".$uc_dbpass."');");
$content = api_insert_config($content, "/define\('UC_DBNAME',\s*'.*?'\);/i", "define('UC_DBNAME', '".$uc_setings['dbname']."');");
$content = api_insert_config($content, "/define\('UC_DBTABLEPRE',\s*'.*?'\);/i", "define('UC_DBTABLEPRE', '`".$uc_setings['dbname'].'`.'.$uc_setings['dbtablepre']."');");
}
$content = api_insert_config($content, "/define\('UC_CONNECT',\s*'.*?'\);/i", "define('UC_CONNECT', '$connect');");
$content = api_insert_config($content, "/define\('UC_KEY',\s*'.*?'\);/i", "define('UC_KEY', '".$uc_setings['authkey']."');");
$content = api_insert_config($content, "/define\('UC_API',\s*'.*?'\);/i", "define('UC_API', '".$uc_setings['ucapi']."');");
$content = api_insert_config($content, "/define\('UC_IP',\s*'.*?'\);/i", "define('UC_IP', '".$uc_setings['ucip']."');");
$content = api_insert_config($content, "/define\('UC_APPID',\s*'?.*?'?\);/i", "define('UC_APPID', '".UC_APPID."');");
$content .= '?>';
if($fp = @fopen($this->config, 'w'))
{
@fwrite($fp, trim($content));
@fclose($fp);
ShowMsg('配置已经更改!',-1);
exit();
}else{
ShowMsg('写入配置数据失败!'.$this->config.' 请设置可写权限!',-1);
exit();
}
}
function uc_show()
{
$this->dtp->Assign('uc_config_file',$this->config);
if(!defined('UC_APPID'))
{
$this->dtp->LoadTemplate(DEDEADMIN.'/templets/api_ucenter_install.htm');
}
else
{
$uc_api_open = false;
$ucapparray = uc_app_ls();
foreach($ucapparray as $apparray)
{
if($apparray['appid'] == UC_APPID)
{
$uc_api_open = true;
break;
}
}
if(!$uc_api_open)
{
ShowMsg("DedeCMS没找到正确的uc配置！",-1);
exit();
}
list($dbname,$dbtablepre) = explode('.',str_replace('`','',UC_DBTABLEPRE));
$uc_setings = array('appid' => UC_APPID, 'ucapi' => UC_API, 'connect' => UC_CONNECT, 'dbhost' => UC_DBHOST, 'dbuser' => UC_DBUSER,'dbpass' => UC_DBPW, 'dbname' => $dbname, 'dbtablepre' => $dbtablepre,'ucip' => UC_IP,'authkey' => UC_KEY);
$this->dtp->Assign('uc_setings',$uc_setings);
$this->dtp->LoadTemplate(DEDEADMIN.'/templets/api_ucenter_edit.htm');
}
$this->dtp->Display();
exit();
}
}
/*
class uc_function{...}
*/
function api_fopen($url, $limit = 0, $post = '', $cookie = '', $bysocket = FALSE, $ip = '', $timeout = 15, $block = TRUE)
{
$return = '';
$matches = parse_url($url);
$host = $matches['host'];
$path = $matches['path'] ? $matches['path'].($matches['query'] ? '?'.$matches['query'] : '') : '/';
$port = !empty($matches['port']) ? $matches['port'] : 80;
if($post)
{
$out = "POST $path HTTP/1.0\r\n";
$out .= "Accept: */*\r\n";
//$out .= "Referer: $boardurl\r\n";
$out .= "Accept-Language: zh-cn\r\n";
$out .= "Content-Type: application/x-www-form-urlencoded\r\n";
$out .= "User-Agent: $_SERVER[HTTP_USER_AGENT]\r\n";
$out .= "Host: $host\r\n";
$out .= 'Content-Length: '.strlen($post)."\r\n";
$out .= "Connection: Close\r\n";
$out .= "Cache-Control: no-cache\r\n";
$out .= "Cookie: $cookie\r\n\r\n";
$out .= $post;
}else{
$out = "GET $path HTTP/1.0\r\n";
$out .= "Accept: */*\r\n";
//$out .= "Referer: $boardurl\r\n";
$out .= "Accept-Language: zh-cn\r\n";
$out .= "User-Agent: $_SERVER[HTTP_USER_AGENT]\r\n";
$out .= "Host: $host\r\n";
$out .= "Connection: Close\r\n";
$out .= "Cookie: $cookie\r\n\r\n";
}
$fp = @fsockopen(($host ? $host : $ip), $port, $errno, $errstr, $timeout);
if(!$fp)
{
return '';
}else{
stream_set_blocking($fp, $block);
stream_set_timeout($fp, $timeout);
@fwrite($fp, $out);
$status = stream_get_meta_data($fp);
if(!$status['timed_out'])
{
while (!feof($fp))
{
if(($header = @fgets($fp)) && ($header == "\r\n" || $header == "\n"))
{
break;
}
}
$stop = false;
while(!feof($fp) && !$stop)
{
$data = fread($fp, ($limit == 0 || $limit > 8192 ? 8192 : $limit));
$return .= $data;
if($limit)
{
$limit -= strlen($data);
$stop = $limit <= 0;
}
}
}
@fclose($fp);
return $return;
}
}
function api_write_config($config, $file)
{
$success = false;
list($appauthkey, $appid, $ucdbhost, $ucdbname, $ucdbuser, $ucdbpw, $ucdbcharset, $uctablepre, $uccharset, $ucapi, $ucip) = explode('|', $config);
if($content = file_get_contents($file))
{
$content = trim($content);
$content = substr($content, -2) == '?>' ? substr($content, 0, -2) : $content;
$content = strstr($content, '_|cfg_|GLOBALS') ? str_replace('_|cfg_|GLOBALS','cfg_|GLOBALS',$content) : $content;
$link = mysql_connect($ucdbhost, $ucdbuser, $ucdbpw, 1);
$uc_connnect = $link && mysql_select_db($ucdbname, $link) ? 'mysql' : '';
$content = api_insert_config($content, "/define\('UC_CONNECT',\s*'.*?'\);/i", "define('UC_CONNECT', '$uc_connnect');");
$content = api_insert_config($content, "/define\('UC_DBHOST',\s*'.*?'\);/i", "define('UC_DBHOST', '$ucdbhost');");
$content = api_insert_config($content, "/define\('UC_DBUSER',\s*'.*?'\);/i", "define('UC_DBUSER', '$ucdbuser');");
$content = api_insert_config($content, "/define\('UC_DBPW',\s*'.*?'\);/i", "define('UC_DBPW', '$ucdbpw');");
$content = api_insert_config($content, "/define\('UC_DBNAME',\s*'.*?'\);/i", "define('UC_DBNAME', '$ucdbname');");
$content = api_insert_config($content, "/define\('UC_DBCHARSET',\s*'.*?'\);/i", "define('UC_DBCHARSET', '$ucdbcharset');");
$content = api_insert_config($content, "/define\('UC_DBTABLEPRE',\s*'.*?'\);/i", "define('UC_DBTABLEPRE', '`$ucdbname`.$uctablepre');");
$content = api_insert_config($content, "/define\('UC_DBCONNECT',\s*'.*?'\);/i", "define('UC_DBCONNECT', '0');");
$content = api_insert_config($content, "/define\('UC_KEY',\s*'.*?'\);/i", "define('UC_KEY', '$appauthkey');");
$content = api_insert_config($content, "/define\('UC_API',\s*'.*?'\);/i", "define('UC_API', '$ucapi');");
$content = api_insert_config($content, "/define\('UC_CHARSET',\s*'.*?'\);/i", "define('UC_CHARSET', '$uccharset');");
$content = api_insert_config($content, "/define\('UC_IP',\s*'.*?'\);/i", "define('UC_IP', '$ucip');");
$content = api_insert_config($content, "/define\('UC_APPID',\s*'?.*?'?\);/i", "define('UC_APPID', '$appid');");
$content = api_insert_config($content, "/define\('UC_PPP',\s*'?.*?'?\);/i", "define('UC_PPP', '20');");
$content .= "\r\n".'?>';
if(@file_put_contents($file, $content))
{
$success = true;
}
}
return $success;
}
function api_insert_config($s, $find, $replace)
{
if(preg_match($find, $s))
{
$s = preg_replace($find, $replace, $s);
}else{
// 插入到最后一行
$s .= "\r\n".$replace;
}
return $s;
}
function api_gpc($k, $var='R')
{
switch($var)
{
case 'G': $var = &$_GET; break;
case 'P': $var = &$_POST; break;
case 'C': $var = &$_COOKIE; break;
case 'R': $var = &$_REQUEST; break;
}
return isset($var[$k]) ? $var[$k] : NULL;
}
if(!function_exists('file_put_contents')){ function file_put_contents($filename, $s)
{
$fp = @fopen($filename, 'w');
@fwrite($fp, $s);
@fclose($fp);
return TRUE;
}}
?>
|
__label__pos
| 0.981334 |
answersLogoWhite
0
Best Answer
12C6 = (12 x 11 x 10 x 9 x 8 x 7)/ (6 x 5 x 4 x 3 x 2 x 1) = 924
User Avatar
Wiki User
14y ago
This answer is:
User Avatar
Add your answer:
Earn +20 pts
Q: How many groups of 6 numbers in 12 numbers?
Write your answer...
Submit
Still have questions?
magnify glass
imp
|
__label__pos
| 0.705613 |
Fireworks CS5 Essential Training
Illustration by John Hersey
Creating button symbols
From:
Fireworks CS5 Essential Training
with Jim Babbage
Start your free trial now, and begin learning software, business and creative skills—anytime, anywhere—with video instruction from recognized industry experts.
Start Your Free Trial Now
Video: Creating button symbols
I like button symbols. They are an efficient way to generate up to four visible states of a Navigation button: Up, Over, Down and Over While Down, and you can even add a hyperlink to them in the process. Almost any graphic or text object can become a button. Once you've created a single button symbol, you can reuse it over and over again for navigation without having to build the bunch of new graphics. Each instance of a button can have its own custom text, URL and target without breaking any links to the original symbol. And the button instance is self- contained, meaning that all the graphic elements and states are kept together.
Expand all | Collapse all
1. 3m 42s
1. Welcome
1m 22s
2. What is Fireworks?
1m 59s
3. Using the exercise files
21s
2. 1h 27m
1. Creating and opening documents
7m 36s
2. Understanding the interface
9m 43s
3. Working with tabbed documents
6m 18s
4. Setting up rulers, guides, and grids
10m 7s
5. Using tooltips and Smart Guides
5m 40s
6. Working with panels
9m 29s
7. Working with pages
8m 59s
8. Working with layers
13m 13s
9. Working with states
4m 35s
10. Using the Properties panel
4m 38s
11. Using the Preferences panel
7m 34s
3. 52m 30s
1. Understanding the Fireworks PNG format
2m 11s
2. Saving and exporting files
5m 11s
3. Importing files
5m 34s
4. Opening Photoshop files
6m 7s
5. Opening Illustrator files
3m 58s
6. Exporting a single file
9m 57s
7. Using the Image Preview window
1m 52s
8. Using the Export Area tool
3m 10s
9. Creating PDF files
4m 16s
10. Saving Photoshop files
5m 48s
11. Using Fireworks files for Illustrator
4m 26s
4. 1h 2m
1. Understanding bitmaps
1m 32s
2. Resizing images
3m 48s
3. Using the selection tools
8m 0s
4. Using the drawing tools
8m 19s
5. Retouching with the corrective tools: Rubber Stamp
12m 16s
6. Using the bitmap effects tools: Blur, Sharpen, and Replace Color
7m 33s
7. Using more bitmap effects tools: Dodge and Burn
7m 1s
8. Improving images using the Levels filter
8m 15s
9. Creating a bitmap mask with a selection
6m 2s
5. 1h 10m
1. Looking at the vector toolset
6m 53s
2. Using the Pen tool
7m 32s
3. Editing vector shapes with the Freeform and Reshape Area tools
4m 35s
4. Filling shapes with patterns and live filters
3m 17s
5. Using Auto Shapes
7m 24s
6. Using shapes as image elements
4m 16s
7. Scaling shapes
5m 28s
8. Masking objects with vector shapes
7m 13s
9. Applying strokes
5m 52s
10. Using Vector Path and Path Scrubber
6m 9s
11. Using the Compound Shape tool
7m 40s
12. Using Snap to Pixel
2m 15s
13. Using Gradient Dither
1m 46s
6. 51m 3s
1. Understanding symbols
5m 41s
2. Creating graphic symbols
13m 5s
3. Creating button symbols
10m 22s
4. Creating animation symbols
5m 4s
5. Sharing symbols with the Common Library
1m 37s
6. Editing the instance of a symbol
3m 46s
7. Adding component symbols to a design
8m 37s
8. Exporting and importing symbols
2m 51s
7. 17m 34s
1. Creating GIF animations
9m 31s
2. Animating with Twist and Fade
3m 47s
3. Creating a tweened animation
4m 16s
8. 26m 46s
1. Using text in Fireworks
7m 19s
2. Understanding text properties
3m 14s
3. Adding text in a path
4m 43s
4. Adding text to a path
4m 31s
5. Using text as a mask
3m 35s
6. Maintaining crisp text in web images
3m 24s
9. 28m 35s
1. Having fun with filters
8m 44s
2. Working with Styles
4m 10s
3. Using Blend Modes
4m 40s
4. Converting bitmap selections to paths
3m 50s
5. Working with Adobe Swatch Exchange files
2m 33s
6. Using the Kuler panel for color inspiration
4m 38s
10. 1h 14m
1. Understanding the web toolset
1m 51s
2. Creating hotspots
6m 22s
3. Using the Slice tool
8m 57s
4. Using a master page
5m 20s
5. Sharing layers across pages
4m 49s
6. Sharing web layers across pages
3m 30s
7. Using HTML component symbols
3m 15s
8. Creating choices and showing design options to clients
7m 7s
9. Importing pages
2m 47s
10. Previewing the mockup
4m 17s
11. Using HTML prototyping
5m 22s
12. Improving the workflow
20m 30s
11. 33m 19s
1. Optimizing images for export, part 1
15m 36s
2. Optimizing images for export, part 2
13m 36s
3. Generating a CSS-based layout
4m 7s
12. 22m 20s
1. Integrating Fireworks, FXG, and Flash Catalyst
3m 56s
2. Integrating Fireworks and Flash
3m 46s
3. Using roundtrip editing between Dreamweaver and Fireworks
5m 52s
4. Copying and pasting objects to Dreamweaver
2m 57s
5. Integrating Fireworks and Device Central
4m 13s
6. Working with Bridge
1m 36s
13. 13s
1. Goodbye
13s
please wait ...
Watch the Online Video Course Fireworks CS5 Essential Training
8h 51m Beginner Apr 30, 2010
Viewers: in countries Watching now:
In Fireworks CS5 Essential Training, author Jim Babbage gives a detailed overview of Fireworks CS5, Adobe's software for creating and optimizing web graphics and interactive prototypes. This course includes a detailed tour of the interface, the enhanced PNG format, and the image editing toolset in Fireworks. Critical concepts, such as prototyping for HTML applications and working with symbols, the heart of an efficient workflow in Fireworks, are covered in detail. Exercise files are included with this course.
Topics include:
• Customizing the workspace
• Working with pages, layers, and states
• Importing content
• Comparing bitmaps and vectors
• Creating and editing vector shapes
• Converting artwork into graphic, button, and animation symbols
• Animating in Fireworks
• Maintaining crisp text in web images
• Sharing content between pages
• Optimizing images for export
• Integrating with Device Central, Dreamweaver, Flash, and Flash Catalyst
Subject:
Web
Software:
Fireworks
Author:
Jim Babbage
Creating button symbols
I like button symbols. They are an efficient way to generate up to four visible states of a Navigation button: Up, Over, Down and Over While Down, and you can even add a hyperlink to them in the process. Almost any graphic or text object can become a button. Once you've created a single button symbol, you can reuse it over and over again for navigation without having to build the bunch of new graphics. Each instance of a button can have its own custom text, URL and target without breaking any links to the original symbol. And the button instance is self- contained, meaning that all the graphic elements and states are kept together.
So as you move the button around on the screen, you're actually moving all the different states to go with it. Let's see how to build a button. So I've got my exp_buttons.png file open here, and this was originally kind of a stylesheet for the client so they could see what the different navigational buttons would be like and what their different states would look like. And that's all well and good from the standpoint of being able to see them on one screen, but in my case, I want to turn one of these into an interactive button. The one I'm going to work with is the big Explore button that we see here. So I'm going to select it, and to create the button symbol, we can do this couple of different ways.
We can go to Modify > Symbol > Convert to Symbol, or we can right-click on the graphic and choose Convert to Symbol, or we can even press F8. That will bring us right to our Convert to Symbol dialog box. So the first thing I want to do is give this a name. I'm going to call it explore_btn, and I want to set this as a Button symbol. Don't worry about Graphic or Animation symbols in this case. I won't bother enabling 9-slice scaling or Common Library either.
I'll just leave those as they are, and we'll click OK. As soon as I do that, you'll see that I get that little cross here again inside, indicating this as an instance, and it's related to a master symbol. Now if you take a look over in the Document Library, you'll see that explore_btn is now listed in the Document Library for this document. Now, one of the thing I'll point out: We don't see it at the moment, but if I click on, in my Web section here, and activate my slices, you'll see that that button symbol is surrounded by a green rectangle.
This is what's referred to as a Web Slice, and this is needed in order for Fireworks to generate four different states to the button. And the slice is needed primarily if you're planning to add a hyperlink or a target or alternate text to this button, and then export it out as HTML images. We're going to hide the slice away from you for the time being though. What we want to look at here is creating the actual button symbol itself. We got our starting point. We've got our Up state. I'm going to double-click on the symbol, and you'll see we're going to edit in Place mode, and if you take a look in the Properties panel, you'll see down at the bottom, we've got a couple of different options here.
We've got something called States, and currently it's showing the Up State. And this gives us the ability by clicking on that dropdown menu to select or create up to four different states for that button. Now, I'm going to click on the Over State, and as soon as we go to that, you'll notice that everything disappears, because there is nothing currently on that state of this button symbol. We need to actually add something. Now, you can import a graphic to use as that Over State, but the easiest thing to do is to choose Copy Up Graphic, and that puts in an exact copy in exactly the same place as the original Up State of the button.
Now, it's also exactly the same button. It looks no differently from the original. So, we're going to make use of some of the other colors that we see listed, down inside of these other versions or other states of the button. So, I'm going to select my Over State, and this is a grouped object, meaning that there are several elements in here. We've got the button shape. We've got some text. We've got a highlight vector shape. We've got a star shape. All these things are actually separate elements. So, if I click on my Subselection tool, I can then go ahead and click on, for example, my actual button and what I want to do here is make a change to the fill.
Now, down below where my red button is, you'll see some information has been added in here. This is the fill color that was used to create the gradient for that Over State, C2282E. So, those are the numbers and letters we have to remember. That's a hexadecimal color value. I'm going to go into my Gradient Editor, and I'm just going to click on that blue color. We're going to change that to that red color, the C2282E. So, once the Color Picker shows up, I'm just going to select the hexadecimal value that's in there and type in C2282E, and I'll see I get that nice bright red, and I'll just press the Enter key, and that color is now added to the gradient, the other color is removed.
And you can see now our Up State looks like this. We've got that red gradient happening. Now, the other change that's happening here is the star. So we're just going to click on the canvas somewhere to basically close down the Gradient Editor, make sure my Subselection tool is still active, and I'm going to click on my star. And all I want to do here really is just fill it with white. So, I'm going to go into my Properties panel and change the color to white. The last thing we're going to do, you'll notice we have a stroke around that overall button, and we don't have a stroke on the rollover effect.
So, I'm going to click on that one more time and go into my Properties panel and set the color to none. So, we have no stroke on the mouse over or rollover effect. So, now we've got an identical version of what was listed out in flat format before. So, now we've got an Up State and an Over State. We're going to add in our other two states as well. Now, it's really important, in order to get to the next state, that nothing selected on the canvas when you do this. So I'm going to go back to my Over State and choose Down and again, it's empty because there is no graphic there to begin with.
I'm going to choose Copy Over Graphic. It brings up my red version. In this case, I want to add the colors that are part of the Hit State. Okay, so let's see here. We've got a yellow gradient, we've got a stroke around the button and our star, again, is hollow in the middle. So, I'm going to go and select that buttoned shape, go to my Gradient Editor, and we're going to change the color to DADA21. That gives me my yellow, just press the Enter key and press the Enter key again, and we'll collapse down the Gradient Editor.
Also, I want to add in my stroke. So, I'll go to my Stroke section in my Properties panel and in this case here, actually I better take another look at that color before I go that far, CBC59B. And I'll just change that color to those values, CBC95B, and now we have a stroke applied as well. So, it's coming together quite nicely. Our last one is our Selected State, so it looks a little bit different than the other ones. It's kind of almost a hollow button with a stroke.
Oh, I forgot one last thing, my star no longer has a fill, so we'll get rid of the fill color there. There we go. So we've just got the stroke. Okay, so our last bit is our Over While Down State. So, I'm going to choose, from my States menu, Over While Down and, again, there is nothing there to begin with, so we'll copy the Down Graphic, and we'll make some changes. Now, I'll just double check on my settings here. There is no fill, and the stroke is kind of a light gray color.
We've also got our red star this time. So, we'll select our main button area. We'll change our Fill to None. And we're going to add in our stroke color. It's going to go into my color picker and type in DOD2D3. There we go. Nice light gray, all right! Now, one other step, of course. We've got to change the color of our text and our star because they are kind of invisible at the moment.
So, I'm going to move in with my Subselection tool and select the text, and I'm just going to change that text color to black. The star; same kind of idea, just look for it and highlight it and change the color of the star to a nice, bright red, like so, and that gives us our overall look.
Now, I think the star is a bit too bright. How about another color? There we go. And that gives us our overall button states. So, I'm going to double-click to get us back to our regular view here. One of the nice things about working with Fireworks is you can preview these things and see how they are going to interact. So what we'll do is we're going to preview this button state before we wrap up this little exercise. I'm going to go to my Preview Window here, which you might remember from optimizing graphics.
I'll grab my Pointer tool, and I'll move my mouse over my button, and you'll see I get the different states: the mouseover state, and if I click I get my yellow state, and if I mouse back over again, I get my selected state. So, I get all of the range of my buttons by previewing them inside of Fireworks, so I get to see exactly what's what. And actually a good catch here is you notice I still have that white highlight showing up inside of the final state. So, I'll go back to my Original View here.
I'll double-click on my button symbol. I'll choose my Over While Down state, and I'll use my Subselection tool to find that highlight, select it and delete it. And then just double-click again to go back to my original canvas. And just to be sure, I'll preview things, grab my Pointer tool, mouseover is my red, click is my yellow, move away and move back, and there is my Selected State. So, that's the skinny on creating button symbols. Once you're done, you can get Fireworks to export out HTML and JavaScript to make them function inside of a Web page or AIR prototype.
There are currently no FAQs about Fireworks CS5 Essential Training.
Share a link to this course
What are exercise files?
Exercise files are the same files the author uses in the course. Save time by downloading the author's files instead of setting up your own files, and learn by following along with the instructor.
Can I take this course without the exercise files?
Yes! If you decide you would like the exercise files later, you can upgrade to a premium account any time.
Become a member Download sample files See plans and pricing
Please wait... please wait ...
Upgrade to get access to exercise files.
Exercise files video
How to use exercise files.
Learn by watching, listening, and doing, Exercise files are the same files the author uses in the course, so you can download them and follow along Premium memberships include access to all exercise files in the library.
Exercise files
Exercise files video
How to use exercise files.
For additional information on downloading and using exercise files, watch our instructional video or read the instructions in the FAQ .
This course includes free exercise files, so you can practice while you watch the course. To access all the exercise files in our library, become a Premium Member.
Join now Already a member? Log in
* Estimated file size
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
Mark all as unwatched Cancel
Congratulations
You have completed Fireworks CS5 Essential Training.
Return to your organization's learning portal to continue training, or close this page.
OK
Become a member to add this course to a playlist
Join today and get unlimited access to the entire library of video courses—and create as many playlists as you like.
Get started
Already a member ?
Exercise files
Learn by watching, listening, and doing! Exercise files are the same files the author uses in the course, so you can download them and follow along. Exercise files are available with all Premium memberships. Learn more
Get started
Already a Premium member?
Exercise files video
How to use exercise files.
Ask a question
Thanks for contacting us.
You’ll hear from our Customer Service team within 24 hours.
Please enter the text shown below:
The classic layout automatically defaults to the latest Flash Player.
To choose a different player, hold the cursor over your name at the top right of any lynda.com page and choose Site preferences from the dropdown menu.
Continue to classic layout Stay on new layout
Exercise files
Access exercise files from a button right under the course name.
Mark videos as unwatched
Remove icons showing you already watched videos if you want to start over.
Control your viewing experience
Make the video wide, narrow, full-screen, or pop the player out of the page into its own window.
Interactive transcripts
Click on text in the transcript to jump to that spot in the video. As the video plays, the relevant spot in the transcript will be highlighted.
Learn more, save more. Upgrade today!
Get our Annual Premium Membership at our best savings yet.
Upgrade to our Annual Premium Membership today and get even more value from your lynda.com subscription:
“In a way, I feel like you are rooting for me. Like you are really invested in my experience, and want me to get as much out of these courses as possible this is the best place to start on your journey to learning new material.”— Nadine H.
Thanks for signing up.
We’ll send you a confirmation email shortly.
Sign up and receive emails about lynda.com and our online training library:
Here’s our privacy policy with more details about how we handle your information.
Keep up with news, tips, and latest courses with emails from lynda.com.
Sign up and receive emails about lynda.com and our online training library:
Here’s our privacy policy with more details about how we handle your information.
submit Lightbox submit clicked
Terms and conditions of use
We've updated our terms and conditions (now called terms of service).Go
Review and accept our updated terms of service.
|
__label__pos
| 0.744641 |
[2018-01-07]
Making Postfix send emails to Dovecot
In a previous chapter we made sure that Postfix knows which emails it is allowed to receive. Now what to do with the email? It has to be stored to disk for your users. You could let Postfix handle that using its built-in mail delivery agent (MDA) called “virtual”. However compared to the capabilities that Dovecot provides like server-based sieve rules or quotas the Postfix delivery agent is pretty basic. We are using Dovecot anyway to provide the IMAP (and optionally POP3) service. So let’s use its delivery agent.
How can we make Postfix hand over the email to Dovecot? There are generally two ways to establish that link.
1. Using the dovecot-lda (local delivery agent) process. It can process one email at a time. And it starts up a new process for every email. This was for long the default way. But you can imagine that it does not scale well.
2. The other option is to use LMTP (local mail transport protocol) that was conceived for this purpose. It can handle multiple recipients at the same time and has a permanently running process which provides a better performance than using the LDA. In short LMTP is a variant of SMTP with fewer features. It is meant for email communication between two components that trust each other.
You guessed it already – we will go for the second option. The software package dovecot-lmtpd should already be installed on your system. So first…
Tell Dovecot where to listen for LMTP connections from Postfix
Edit Dovecot’s configuration file that deals with the LMTP daemon – you can find it at /etc/dovecot/conf.d/10-master.conf. Look for the “service lmtp” section and edit it so that it looks like:
service lmtp {
unix_listener /var/spool/postfix/private/dovecot-lmtp {
group = postfix
mode = 0600
user = postfix
}
}
This makes Dovecot’s lmtp daemon create a UNIX socket at /var/spool/postfix/private/dovecot-lmtp. Just like in the section dealing with setting up Dovecot we make it put a socket into the /var/spool/postfix chroot directory because Postfix is restricted to that directory and cannot access anything outside of it. So from Postfix’s point of view the socket is located at “/private/dovecot-lmtp”.
Restart Dovecot…
service dovecot restart
(By the way this configuration snippet has been taken from the Dovecot wiki.)
So we can now…
Tell Postfix to deliver emails to Dovecot using LMTP
This is even easier. The “virtual_transport” in Postfix defines the service to use for delivering emails to the local system. Dovecot has created a socket file and is ready to listen to incoming LMTP connections. We just need to tell Postfix to send emails there:
postconf virtual_transport=lmtp:unix:private/dovecot-lmtp
The syntax looks crazy? It’s actually simple. You just told Postfix to use the LMTP protocol. And that we want to use a UNIX socket on the same system (instead for example a TCP connection). And that the socket file is located at /var/spool/postfix/private/dovecot-lmtp.
(You will find further information on these steps in the Dovecot configuration on Postfix integration.)
Enable server-side mail rules
One of my favorite features of Dovecot are rules for incoming email that are processed on the server. You can sort away your mailing list emails into special folders. You can reject certain senders. Or you can set up vacation auto-responders. No need to have a mail client running – it all happens automatically even when your mail users are not connected.
The open-source standard (RFC 5228) for such rules is called Sieve. Simply put Sieve is a way to manage server-side email rules. A rule consists of conditions and actions. For example if the sender address matches “[email protected]” you could tell Dovecot to move such emails to your “steve” folder automatically. These rules are stored on the Dovecot server and executed automatically. Whether you connect from your smartphone your laptop or use the webmail access – the rules always work and require no configuration on the client side.
As we use LMTP that’s where we need to tell the lmtp service that we want to use Dovecot’s “sieve” plugin. Edit the file /etc/dovecot/conf.d/20-lmtp.conf and within the “protocol lmtp” section change the “mail_plugins” line to:
mail_plugins = $mail_plugins sieve
Restart Dovecot and you are done:
service dovecot restart
4 thoughts on “Making Postfix send emails to Dovecot
• 2018-03-08 at 11:12
Permalink
Hi,
have you ever configured postfixadmin? Till Jessie everything worked great but in Stretch I can’t configure vacation module; I get this error:
relay=vacation, delay=3.6, delays=3.4/0.01/0/0.16, dsn=5.3.0, status=bounced (Command died with status 255: “/var/spool/vacation/vacation.pl”. Command output: Can’t use ‘defined(@array)’ (Maybe you should just omit the defined()?) at /usr/share/perl5/Mail/Sender.pm line 318. Compilation failed in require at /var/spool/vacation/vacation.pl line 129. BEGIN failed–compilation aborted at /var/spool/vacation/vacation.pl line 129. )
Can you help me please?
Thanks
Reply
• 2018-10-25 at 18:50
Permalink
What an awesomely-written tutorial! I’ve been wanting to build a mail server for a long time, and until now, I was unable to find a document that clearly explained the processes and pieces needed to make a mail server work.
I was able to build a mail server that can receive and send mail to the world, but when I look at the mail.log file, I notice a couple of lines generated every time the user account attempts to authenticate:
Oct 25 13:55:34 mailserver dovecot: auth-worker(32750): Warning: mysql: Query failed, retrying: Table ‘mailserver.users’ doesn’t exist
Oct 25 13:55:34 mailserver dovecot: auth-worker(32750): Error: sql([email protected],::1,): User query failed: Table ‘mailserver.users’ doesn’t exist (using built-in default user_query: SELECT home, uid, gid FROM users WHERE username = ‘%n’ AND domain = ‘%d’)
But then it appears to work:
Oct 25 13:55:34 mailserver dovecot: imap-login: Login: user=, method=PLAIN, rip=::1, lip=::1, mpid=32751, secured, session=
I followed the Stretch tutorial.
Is there another line that would need to be included in /etc/dovecot/dovecot-sql.conf.ext to eliminate this error?
Thanks!
Reply
• 2019-02-07 at 14:50
Permalink
I got this error message also and than found out that there were 2 userdb parts enabled.
Open the file /conf.d/auth-sql.conf.ext and comment out the following part
19 #userdb {
20 # driver = sql
21 # args = /etc/dovecot/dovecot-sql.conf.ext
22 #}
This fixed it for me.
Reply
Leave a Reply
Your e-mail address will not be published. Required fields are marked *
|
__label__pos
| 0.504907 |
summaryrefslogtreecommitdiff
path: root/framebuffer
Commit message (Collapse)AuthorAgeFilesLines
* Remove gui_window_set_scale().Michael Drake2011-06-241-6/+0
| | | | svn path=/trunk/netsurf/; revision=12502
* Merge branches/jmb/content-factory to trunkJohn Mark Bell2011-05-062-30/+2
| | | | svn path=/trunk/netsurf/; revision=12283
* modern debian no longer links the math library bt defaultVincent Sanders2011-04-021-1/+1
| | | | svn path=/trunk/netsurf/; revision=12150
* add control of fbtk text widget paddingVincent Sanders2011-03-213-10/+23
| | | | svn path=/trunk/netsurf/; revision=12116
* Fix framebuffer resource: handlingVincent Sanders2011-03-177-2/+15
| | | | svn path=/trunk/netsurf/; revision=12095
* gui_find_resource --> gui_get_resource_url.Michael Drake2011-03-171-1/+1
| | | | svn path=/trunk/netsurf/; revision=12089
* Rename utils/resource to utils/filepath to avoid confusion with resource: ↵Michael Drake2011-03-173-12/+12
| | | | | | fetcher. svn path=/trunk/netsurf/; revision=12088
* Scale mouse pointer position.Michael Drake2011-03-161-16/+20
| | | | svn path=/trunk/netsurf/; revision=12081
* Beginnings of scale support.Michael Drake2011-03-161-10/+23
| | | | | | | | | | | | | - No front end to set scale, only global option. - No input (mouse pos) scaling. - Scaled of pos for update_box (e.g. animation) is wrong. - Off-by-1 in scaled scroll panning. Perhaps we should look at moving all the scale logic into the core. svn path=/trunk/netsurf/; revision=12080
* Move schedule.h to utils/John Mark Bell2011-03-132-3/+3
| | | | svn path=/trunk/netsurf/; revision=12039
* Shunt the schedule function definitions to desktop/schedule.h. Shunt the ↵Daniel Silverstone2011-03-132-1/+3
| | | | | | hlcache/llcache to using schedule to get their cleanups run. svn path=/trunk/netsurf/; revision=12029
* Fix font sizing in text widgetJohn Mark Bell2011-03-131-2/+5
| | | | svn path=/trunk/netsurf/; revision=12016
* Scale font sizes by the screen DPI, rather than assuming 72John Mark Bell2011-03-131-1/+2
| | | | svn path=/trunk/netsurf/; revision=12014
* remove obsolete, unused gui_window_redraw APIVincent Sanders2011-03-011-6/+0
| | | | svn path=/trunk/netsurf/; revision=11870
* Remove unnecessary debugJohn Mark Bell2011-02-231-9/+0
| | | | svn path=/trunk/netsurf/; revision=11776
* add resource handlingVincent Sanders2011-02-236-80/+75
| | | | | | move gtk and framebuffer to use generic resource handling svn path=/trunk/netsurf/; revision=11772
* Remove thumbnail_create() from browser.h. Make RO front end use the core ↵Michael Drake2011-02-191-1/+1
| | | | | | thumbnail_redraw function. Make other front ends include the right header for thumbnail_create(). svn path=/trunk/netsurf/; revision=11716
* Pass clip rect to clip plotters as struct. Simplify clip rect handling in ↵Michael Drake2011-02-141-7/+7
| | | | | | debug window code. Pass clip rect to select menu as struct. svn path=/trunk/netsurf/; revision=11683
* Pass clip rect to browser_window_redraw as pointer.Michael Drake2011-02-131-1/+1
| | | | svn path=/trunk/netsurf/; revision=11672
* Pass clip rect to browser_window_redraw as struct.Michael Drake2011-02-111-2/+8
| | | | svn path=/trunk/netsurf/; revision=11648
* improve browser_window_redraw width and height handlingVincent Sanders2011-02-111-5/+0
| | | | svn path=/trunk/netsurf/; revision=11642
* add browser_window_redraw() method to make content_redraw calls from ↵Vincent Sanders2011-02-101-6/+4
| | | | | | frontends common RISC OS, atari, amiga and beos have not been updated svn path=/trunk/netsurf/; revision=11640
* fix bogus comment on return value unitsVincent Sanders2011-02-081-1/+2
| | | | svn path=/trunk/netsurf/; revision=11631
* add default system colour handlers to each frontendVincent Sanders2011-01-302-1/+285
| | | | svn path=/trunk/netsurf/; revision=11530
* remove malloc.h anachronismVincent Sanders2011-01-065-5/+5
| | | | svn path=/trunk/netsurf/; revision=11227
* Add LOG() to warn_user() and die(). Full implementation still needed.James Bursa2010-12-261-0/+3
| | | | svn path=/trunk/netsurf/; revision=11121
* Fix framebuffer build.Michael Drake2010-12-191-2/+1
| | | | svn path=/trunk/netsurf/; revision=11104
* Small refactor to change icon names to being passed in from frontends ↵Vincent Sanders2010-12-141-2/+2
| | | | | | instead of core treeview globals svn path=/trunk/netsurf/; revision=11053
* Purge Aliases file stuff.Michael Drake2010-12-041-1/+0
| | | | svn path=/trunk/netsurf/; revision=10982
* Remove Hubbub and Wapcaplet initialisation and finalisation.Michael Drake2010-12-041-10/+0
| | | | svn path=/trunk/netsurf/; revision=10980
* fix off by 1 in previous commitVincent Sanders2010-12-041-4/+4
| | | | svn path=/trunk/netsurf/; revision=10958
* Stop cursor leaving the root widget and causing a segfault (Found by tlsa)Vincent Sanders2010-12-041-0/+10
| | | | svn path=/trunk/netsurf/; revision=10957
* Give the browser window widget input focus by defualt on startup.Michael Drake2010-11-204-1/+24
| | | | svn path=/trunk/netsurf/; revision=10948
* Make click action happen on release.Michael Drake2010-11-203-9/+9
| | | | svn path=/trunk/netsurf/; revision=10947
* Futher simplification of the makefileVincent Sanders2010-10-291-54/+138
| | | | | | Use target makefiles to set build sources svn path=/trunk/netsurf/; revision=10916
* Beginning of NetSurf build infrastructure cleanupVincent Sanders2010-10-271-0/+69
| | | | | | Provide makefile fragment for each target, isolates the target makefile changes into one place simplifying the top level makefile svn path=/trunk/netsurf/; revision=10910
* Squash warningJohn Mark Bell2010-10-081-0/+1
| | | | svn path=/trunk/netsurf/; revision=10872
* Clean up framebuffer compile time font selectionVincent Sanders2010-10-072-66/+190
| | | | | | | Make framebuffer font documentation match reality Expose glyph cache size as a configuration option svn path=/trunk/netsurf/; revision=10871
* Squash warningsJohn Mark Bell2010-10-051-2/+5
| | | | svn path=/trunk/netsurf/; revision=10866
* Merge treeview-redux to trunkJohn Mark Bell2010-10-054-106/+47
| | | | svn path=/trunk/netsurf/; revision=10865
* Add flexible toolbar support and docuemnt itVincent Sanders2010-10-042-117/+277
| | | | svn path=/trunk/netsurf/; revision=10862
* hell with it, heres a version which should result in fewer portability ↵Vincent Sanders2010-09-111-5/+13
| | | | | | complaints svn path=/trunk/netsurf/; revision=10756
* Initialise opaque setting correctly at bitmap creation in framebuffer front ↵Michael Drake2010-08-141-1/+1
| | | | | | end. (Now JPEGs will knockout stuff behind them.) svn path=/trunk/netsurf/; revision=10707
* Load/save cookies file in framebuffer frontendJohn Mark Bell2010-08-101-0/+19
| | | | svn path=/trunk/netsurf/; revision=10685
* add explicit inlude for varargsVincent Sanders2010-08-031-0/+1
| | | | svn path=/trunk/netsurf/; revision=10678
* Amiga: Add "cut" option; make cut/copy/paste menus context sensitive; allow ↵Chris Young2010-07-241-0/+5
| | | | | | | | | | | dragging selections within NetSurf window to text fields (does not work across windows). todo: switching tabs will reset cut/copy/paste menus to initial state; cut option is putting something on the clipboard which causes a crash when pasting it back svn path=/trunk/netsurf/; revision=10660
* Fix inventory file leafname.Michael Drake2010-07-091-1/+1
| | | | svn path=/trunk/netsurf/; revision=10624
* Check the last character for a path separator, rather than the NULL string ↵Chris Young2010-07-091-1/+1
| | | | | | termination. svn path=/trunk/netsurf/; revision=10622
* Replace unnecessarily complicated path concatenation with something simpler andChris Young2010-07-091-0/+19
| | | | | | easily adaptable to different platform path structures. svn path=/trunk/netsurf/; revision=10621
* Treat tiled images scaled to 1x1 as flat fills of the tiled area.Michael Drake2010-07-081-0/+12
| | | | svn path=/trunk/netsurf/; revision=10616
|
__label__pos
| 0.548213 |
Help us improve your experience.
Let us know what you think.
Do you have time for a two-minute survey?
Example: Configuring the Accumulated IGP Attribute for BGP
Understanding the Accumulated IGP Attribute for BGP
The interior gateway protocols (IGPs) are designed to handle routing within a single domain or an autonomous system (AS). Each link is assigned a particular value called a metric. The distance between the two nodes is calculated as a sum of all the metric values of links along the path. The IGP selects the shortest path between two nodes based on distance.
BGP is designed to provide routing over a large number of independent ASs with limited or no coordination among respective administrations. BGP does not use metrics in the path selection decisions.
The accumulated IGP (AIGP) metric attribute for BGP enables deployment in which a single administration can run several contiguous BGP ASs. Such deployments allow BGP to make routing decisions based on the IGP metric. In such networks, it is possible for BGP to select paths based on metrics as is done by IGPs. In this case, BGP chooses the shortest path between two nodes, even though the nodes might be in two different ASs.
The AIGP attribute is particularly useful in networks that use tunneling to deliver a packet to its BGP next hop. The Juniper Networks® Junos® operating system (Junos OS) currently supports the AIGP attribute for two BGP address families, family inet labeled-unicast and family inet6 labeled-unicast.
AIGP impacts the BGP best-route decision process. The AIGP attribute preference rule is applied after the local-preference rule. The AIGP distance is compared to break a tie. The BGP best-route decision process also impacts the way the interior cost rule is applied if the resolving next hop has an AIGP attribute. Without AIGP enabled, the interior cost of a route is based on the calculation of the metric to the next hop for the route. With AIGP enabled, the resolving AIGP distance is added to the interior cost.
Starting in Release 20.2R1, Junos OS supports the translation of AIGP metric to MED. You can enable this feature when you want the MED to carry the end to end AIGP metric value, which is used to choose the best path. This is especially useful in Inter-AS MPLS VPNs solution, where customer sites are connected via two different service providers, and customer edge routers want to take IGP metric based decision. You can configure a minimum-aigp to prevent unnecessary update of route when effective-aigp changes past the previously known lowest value. Effective AIGP is the AIGP value advertised with the route plus the IGP cost to reach the nexthop. You can configure effective-aigp and minimum-effective-aigp statements at the [edit protocols bgp group <group-name> metric-out] and [edit policy-options policy-statement <name> then metric] hierarchy levels.
The AIGP attribute is an optional non-transitive BGP path attribute and has been standardized with the RFC7311, The Accumulated IGP Metric Attribute for BGP.
Example: Configuring the Accumulated IGP Attribute for BGP
This example shows how to configure the accumulated IGP (AIGP) metric attribute for BGP.
Requirements
This example uses the following hardware and software components:
• Seven BGP-speaking devices.
• Junos OS Release 12.1 or later.
Overview
The AIGP attribute enables deployments in which a single administration can run several contiguous BGP autonomous systems (ASs). Such deployments allow BGP to make routing decisions based on the IGP metric. With AIGP enabled, BGP can select paths based on IGP metrics. This enables BGP to choose the shortest path between two nodes, even though the nodes might be in different ASs. The AIGP attribute is particularly useful in networks that use tunneling to deliver a packet to its BGP next hop. This example shows AIGP configured with MPLS label-switched paths.
To enable AIGP, you include the aigp statement in the BGP configuration on a protocol family basis. Configuring AIGP on a particular family enables sending and receiving of the AIGP attribute on that family. By default, AIGP is disabled. An AIGP-disabled neighbor does not send an AIGP attribute and silently discards a received AIGP attribute.
Junos OS supports AIGP for family inet labeled-unicast and family inet6 labeled-unicast. The aigp statement can be configured for a given family at the global BGP, group, or neighbor level.
By default, the value of the AIGP attribute for a local prefix is zero. An AIGP-enabled neighbor can originate an AIGP attribute for a given prefix by export policy, using the aigp-originate policy action. The value of the AIGP attribute reflects the IGP distance to the prefix. Alternatively, you can specify a value, by using the aigp-originate distance distance policy action. The configurable range is 0 through 4,294,967,295. Only one node needs to originate an AIGP attribute. The AIGP attribute is retained and readvertised if the neighbors are AIGP enabled with the aigp statement in the BGP configuration.
The policy action to originate the AIGP attribute has the following requirements:
• Neighbor must be AIGP enabled.
• Policy must be applied as an export policy.
• Prefix must have no current AIGP attribute.
• Prefix must export with next-hop self.
• Prefix must reside within the AIGP domain. Typically, a loopback IP address is the prefix to originate.
The policy is ignored if these requirements are not met.
Topology Diagram
Figure 1 shows the topology used in this example. OSPF is used as the interior gateway protocol (IGP). Internal BGP (IBGP) is configured between Device PE1 and Device PE4. External BGP (EBGP) is configured between Device PE7 and Device PE1, between Device PE4 and Device PE3, and between Device PE4 and Device PE2. Devices PE4, PE2, and PE3 are configured for multihop. Device PE4 selects a path based on the AIGP value and then readvertises the AIGP value based on the AIGP and policy configuration. Device PE1 readvertises the AIGP value to Device PE7, which is in another administrative domain. Every device has two loopback interface addresses: 10.9.9.x is used for BGP peering and the router ID, and 10.100.1.x is used for the BGP next hop.
The network between Device PE1 and PE3 has IBGP peering and multiple OSPF areas. The external link to Device PE7 is configured to show that the AIGP attribute is readvertised to a neighbor outside of the administrative domain, if that neighbor is AIGP enabled.
Figure 1: Advertisement of Multiple Paths in BGP
Advertisement of Multiple Paths in
BGP
For origination of an AIGP attribute, the BGP next hop is required to be itself. If the BGP next hop remains unchanged, the received AIGP attribute is readvertised, as is, to another AIGP neighbor. If the next hop changes, the received AIGP attribute is readvertised with an increased value to another AIGP neighbor. The increase in value reflects the IGP distance to the previous BGP next hop. To demonstrate, this example uses loopback interface addresses for Device PE4’s EBGP peering sessions with Device PE2 and Device PE3. Multihop is enabled on these sessions so that a recursive lookup is performed to determine the point-to-point interface. Because the next hop changes, the IGP distance is added to the AIGP distance.
Configuration
CLI Quick Configuration
To quickly configure this example, copy the following commands, paste them into a text file, remove any line breaks, change any details necessary to match your network configuration, and then copy and paste the commands into the CLI at the [edit] hierarchy level.
Device P1
Device P2
Device PE4
Device PE1
Device PE2
Device PE3
Device PE7
Configuring Device P1
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device P1:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Configure an IGP, such as OSPF, RIP, or IS-IS.
6. Configure the router ID and the autonomous system number.
7. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device P2
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device P2:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Configure an IGP, such as OSPF, RIP, or IS-IS.
6. Configure the router ID and the autonomous system number.
7. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device PE4
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device PE4:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Originate a prefix, and configure an AIGP distance.
By default, a prefix is originated using the current IGP distance. Optionally, you can configure a distance for the AIGP attribute, using the distance option, as shown here.
6. Enable the policies.
7. Configure a static route.
8. Configure an IGP, such as OSPF, RIP, or IS-IS.
9. Configure the router ID and the autonomous system number.
10. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show policy-options, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device PE1
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device PE1:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Enable the policies.
6. Configure an IGP, such as OSPF, RIP, or IS-IS.
7. Configure the router ID and the autonomous system number.
8. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show policy-options, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device PE2
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device PE2:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Originate a prefix, and configure an AIGP distance.
By default, a prefix is originated using the current IGP distance. Optionally, you can configure a distance for the AIGP attribute, using the distance option, as shown here.
6. Enable the policies.
7. Enable some static routes.
8. Configure an IGP, such as OSPF, RIP, or IS-IS.
9. Configure the router ID and the autonomous system number.
10. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show policy-options, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device PE3
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device PE3:
1. Configure the interfaces.
2. Configure MPLS and a signaling protocol, such as RSVP or LDP.
3. Configure BGP.
4. Enable AIGP.
5. Enable the policies.
6. Configure an IGP, such as OSPF, RIP, or IS-IS.
7. Configure the router ID and the autonomous system number.
8. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show policy-options, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Configuring Device PE7
Step-by-Step Procedure
The following example requires you to navigate various levels in the configuration hierarchy. For information about navigating the CLI, see Using the CLI Editor in Configuration Mode in the CLI User Guide.
To configure Device PE7:
1. Configure the interfaces.
2. Configure BGP.
3. Enable AIGP.
4. Configure the routing policy.
5. Configure the router ID and the autonomous system number.
6. If you are done configuring the device, commit the configuration.
Results
From configuration mode, confirm your configuration by entering the show interfaces, show policy-options, show protocols, and show routing-options commands. If the output does not display the intended configuration, repeat the instructions in this example to correct the configuration.
Verification
Confirm that the configuration is working properly.
Verifying That Device PE4 Is Receiving the AIGP Attribute from Its EBGP Neighbor PE2
Purpose
Make sure that the AIGP policy on Device PE2 is working.
Action
user@PE4> show route receive-protocol bgp 10.9.9.5 extensive
Meaning
On Device PE2, the aigp-originate statement is configured with a distance of 20 (aigp-originate distance 20). This statement is applied to route 55.0.0.0/24. Likewise, the aigp-originate distance 30 statement is applied to route 99.0.0.0/24. Thus, when Device PE4 receives these routes, the AIGP attribute is attached with the configured metrics.
Checking the IGP Metric
Purpose
From Device PE4, check the IGP metric to the BGP next hop 10.100.1.5.
Action
user@PE4> show route 10.100.1.5
Meaning
The IGP metric for this route is 2.
Verifying That Device PE4 Adds the IGP Metric to the AIGP Attribute
Purpose
Make sure that Device PE4 adds the IGP metric to the AIGP attribute when it readvertises routes to its IBGP neighbor, Device PE1.
Action
user@PE4> show route advertising-protocol bgp 10.9.9.1 extensive
Meaning
The IGP metric is added to the AIGP metric (20 + 2 = 22 and 30 + 2 = 32), because the next hop is changed for these routes.
Verifying That Device PE7 Is Receiving the AIGP Attribute from Its EBGP Neighbor PE1
Purpose
Make sure that the AIGP policy on Device PE1 is working.
Action
user@PE7> show route receive-protocol bgp 10.0.0.9 extensive
Meaning
The 44.0.0.0/24 route is originated at Device PE4. The 55.0.0.0/24 and 99.0.0.0/24 routes are originated at Device PE2. The IGP distances are added to the configured AIGP distances.
Verifying the Resolving AIGP Metric
Purpose
Confirm that if the prefix is resolved through recursion and the recursive next hops have AIGP metrics, the prefix has the sum of the AIGP values that are on the recursive BGP next hops.
Action
1. Add a static route to 66.0.0.0/24.
2. Delete the existing terms in the aigp policy statement on Device PE2.
3. Configure a recursive route lookup for the route to 66.0.0.0.
The policy shows the AIGP metric for prefix 66.0.0.0/24 (none) and its recursive next hop. Prefix 66.0.0.0/24 is resolved by 55.0.0.1. Prefix 66.0.0.0/24 does not have its own AIGP metric being originated, but its recursive next hop, 55.0.0.1, has an AIGP value.
4. On Device PE4, run the show route 55.0.0.0 extensive command.
The value of Metric2 is the IGP metric to the BGP next hop. When Device PE4 readvertises these routes to its IBGP peer, Device PE1, the AIGP metric is the sum of AIGP + its Resolving AIGP metric + Metric2.
Prefix 55.0.0.0 shows its own IGP metric 20, as defined and advertised by Device PE2. It does not show a resolving AIGP value because it does not have a recursive BGP next hop. The value of Metric2 is 2.
user@PE4> show route 55.0.0.0 extensive
5. On Device PE4, run the show route 66.0.0.0 extensive command.
Prefix 66.0.0.0/24 shows the Resolving AIGP, which is the sum of its own AIGP metric and its recursive BGP next hop:
66.0.0.1 = 0, 55.0.0.1 = 20, 0+20 = 20
user@PE4> show route 66.0.0.0 extensive
Verifying the Presence of AIGP Attributes in BGP Updates
Purpose
If the AIGP attribute is not enabled under BGP (or the group or neighbor hierarchies), the AIGP attribute is silently discarded. Enable traceoptions and include the packets flag in the detail option in the configuration to confirm the presence of the AIGP attribute in transmitted or received BGP updates. This is useful when debugging AIGP issues.
Action
1. Configure Device PE2 and Device PE4 for traceoptions.
2. Check the traceoptions file on Device PE2.
The following sample shows Device PE2 advertising prefix 99.0.0.0/24 to Device PE4 (10.9.9.4) with an AIGP metric of 20:
user@PE2> show log bgp
3. Verify that the route was received on Device PE4 using the show route receive-protocol command.
AIGP is not enabled on Device PE4, so the AIGP attribute is silently discarded for prefix 99.0.0.0/24 and does not appear in the following output:
user@PE4> show route receive-protocol bgp 10.9.9.5 extensive | find 55.0.0.0
4. Check the traceoptions file on Device PE4.
The following output from the traceoptions log shows that the 99.0.0.0/24 prefix was received with the AIGP attribute attached:
user@PE4> show log bgp
Meaning
Performing this verification helps with AIGP troubleshooting and debugging issues. It enables you to verify which devices in your network send and receive AIGP attributes.
Release History Table
Release
Description
Starting in Release 20.2R1, Junos OS supports the translation of AIGP metric to MED. You can enable this feature when you want the MED to carry the end to end AIGP metric value, which is used to choose the best path.
|
__label__pos
| 0.913677 |
Skip to main content
Sitebuiler2 Editing
How to edit - Four simple steps
1. There is a menu bar at the top of the computer screen.
Accessibility | Contact US | A-Z Index | Search | Notify | Stats | Edit | Sign in
2. First move your mouse to the Edit button and then a pull-down menu will appear.
• Edit centre content
• Edit right content
• Edit page properties
• Edit page permissions
• Create a new page
• Upload a file
• & more ...
3. Click on 'Edit centre content' in the menu. Then, you are in the Edit mode. You can write or delete words or sentences, just like an MS Word.
For example,
The Reynolds number is 180, or The Reynolds number is 180 395.
(You can see two rows of buttons, at the top right you can see B for Bold, I for Italic, stroke for delete, subscript and superscrips, you can use any of them when necessary).
4. At the top of the window, there are three buttons - Cancel, Preview & Publish. When you have finished, click on 'Preview' to see whether the changes are made correctly, or simply click on 'Publish'. The Cancel button is for when you made any mistake and you don't want that changes.
Hope it helps.
|
__label__pos
| 0.845165 |
tensorly.random.random_tt
random_tt(shape, rank, full=False, random_state=None, **context)[source]
Generates a random TT/MPS tensor
Parameters
shapetuple
shape of the tensor to generate
rankint
rank of the TT decomposition must verify rank[0] == rank[-1] ==1 (boundary conditions) and len(rank) == len(shape)+1
fullbool, optional, default is False
if True, a full tensor is returned otherwise, the decomposed tensor is returned
random_statenp.random.RandomState
contextdict
context in which to create the tensor
Returns
TT_tensorND-array or 3D-array list
• ND-array : full tensor if full is True
• 3D-array list : list of factors otherwise
|
__label__pos
| 0.847681 |
It's all about the answers!
Ask a question
Which file stores the Eclipse setting: windows\preferences -> General\network Connections -> Active Provider?
Erik Mats (1051825) | asked Mar 04 '16, 8:23 a.m.
Which file contains the setting:
windows\preferences -> General\network Connections -> Active Provider
One answer
permanent link
Erik Mats (1051825) | answered Mar 04 '16, 8:24 a.m.
The file you are looking for is org.eclipse.core.net.prefs
The relative path from eclipse.exe to this file should be:
configuration\.settings\org.eclipse.core.net.prefs
(Note that this is a hidden directory on Linux installations)
If your Eclipse resides in:
C:\jazz\client\eclipse\eclipse.exe
Then this file is:
C:\jazz\client\eclipse\configuration\.settings\org.eclipse.core.net.prefs
Changing the setting
windows\preferences -> General\network Connections -> Active Provider
to "native"
changes two settings in that file:
systemProxiesEnabled
and
proxiesEnabled
Your answer
Register or to post your answer.
|
__label__pos
| 0.755579 |
Model Generation
Problem Model Prompt
P_Inequality_12 GPT-3.5 5-Shot
Ground Truth Answer: sum_(k=1)^n 1/k
Use in Code
import champ_dataset # "pip install champ-dataset" if necessary
dataset = champ_dataset.load('v0')
problem = dataset['P_Inequality_12']
messages = problem.conversations['GPT-3.5|5-Shot'].messages
for message in messages:
print(f'Role: {message.role}')
print(f'Text: {message.text}')
print(f'Error: {message.error}')
print('-----------------------')
Full Conversation System Prompt User Input Imputed Model Response Model Output
You are an expert on mathematics.
Solve the following problem. Make sure to show your work before giving the final answer.
Let x be a root of the polynomial ax^2+bx+c, with a>0, a+b+c≥0, a-b+c≥0, a-c≥0. What is the range of x, expressed as an interval?
Step-wise solution:
1. Let x_1, x_2 be the two roots.
2. Thus, we have b/a=-x_1-x_2 and c/a=x_1*x_2.
3. For a+b+c≥0, we have 1+b/a+c/a≥0, or 1-x_1-x_2+x_1*x_2=(1-x_1)(1-x_2)≥0.
4. For a-b+c≥0, we have 1-b/a+c/a≥0, or 1+x_1+x_2+x_1*x_2=(1+x_1)(1+x_2)≥0.
5. For a-c≥0, we have 1-c/a≥0, or 1-x_1*x_2≥0.
6. We see that -1≤x_1, x_2≤1 satisfies all three conditions.
7. If x_1>1, then (1-x_1)(1-x_2)≥0 requires x_2>1, which violates 1-x_1*x_2≥0.
8. If x_1<-1, then (1+x_1)(1+x_2)≥0 requires x_2<-1, which violates 1-x_1*x_2≥0.
9. The same reasoning can be applied to x_2.
10. Thus, we have the range for the root being [-1, 1], and the two extreme values can be achieved by the polynomial x(1+x) and x(1-x) respectively.
Solve the following problem. Make sure to show your work before giving the final answer.
Does the limit exist for the sequence defined by a_0=0, a_(n+1)=sqrt(4+3a_n), and if so, find it.
Step-wise solution:
1. We have a_1=2>a_0.
2. If a_n>a_(n-1), then sqrt(4+3a_n)>sqrt(4+3a_(n-1)), which means that a_(n+1)>a_n.
3. In addition, if a_n<4, then sqrt(4+3a_n)<sqrt(16)=4, so a_(n+1)<4.
4. So the sequence is monotonic and bounded, and thus has a limit.
5. The limit happens when a=sqrt(4+3a), which gives a=4 as the only solution.
6. Thus, the limit of the sequence is 4.
Solve the following problem. Make sure to show your work before giving the final answer.
Let x_1=1 and x_(n+1)=1+n/x_n. For how many values of x_1, ..., x_100 do we have the inequality sqrt(i)≤x_i≤sqrt(i)+1?
Step-wise solution:
1. We see that x_1 satisfies the condition.
2. Assume that x_n satisfies the condition, then we know that x_(n+1)=1+n/x_n≤1+n/sqrt(n)=1+sqrt(n)≤sqrt(n+1)+1.
3. In addition, x_(n+1)=1+n/x_n≥1+n/(sqrt(n)+1)≥1+(n+1-1)/(sqrt(n+1)+1)=1+sqrt(n+1)-1=sqrt(n+1).
4. Thus, we have sqrt(n+1)≤x_(n+1)≤sqrt(n+1)+1, which means that x_(n+1) also satisifies the inequality for all n.
5. So all 100 values of x_i satisfy the condition.
Solve the following problem. Make sure to show your work before giving the final answer.
How often does the factor 2 occur in the product P(n)=(n+1)(n+2)...(2n), as an expression of n?
Step-wise solution:
1. For n=1, we have P(n)=2, with the factor 2 occurs 1 time.
2. We have P(n+1)=(n+2)(n+3)...(2n)(2n+1)(2n+2)=(n+2)(n+3)...(2n)(2n+1)2(n+1)=2*P(n)*(2n+1).
3. Since 2n+1 is odd and contains no factor of 2, we find that P(n+1) contains exactly one more factor of 2 than P(n).
4. Since P(1) contains 1 factor of 2, P(n) contains n factors of 2.
Solve the following problem. Make sure to show your work before giving the final answer.
Let a string consist of digit 1, 2, 3. How many such strings of length 6 have adjacent digit differing by less than or equal to 1?
Step-wise solution:
1. Let x_n, y_n, z_n be the number of length-n strings that end with digit 1, 2, 3 respectively.
2. Thus, we have x_1=y_1=z_1=1.
3. For a string ending with 1, we can append 1 and 2; for a string ending with 2, we can append 1, 2 and 3; for a string ending with 3, we can append 2 and 3.
4. Thus, we have x_(n+1)=x_n+y_n, y_(n+1)=x_n+y_n+z_n, and z_(n+1)=y_n+z_n.
5. Starting from (1, 1, 1), we have the sequence of (x_n, y_n, z_n) to be (1, 1, 1), (2, 3, 2), (5, 7, 5), (12, 17, 12), (29, 41, 29), (70, 99, 70).
6. Thus, in total, there are x_6+y_6+z_6=70+99+70=239 such strings.
Solve the following problem. Make sure to show your work before giving the final answer.
Let (a_1, a_2, ..., a_n) be a permutation of (1, 2, ..., n). What is the smallest value of sum_(k=1)^n a_k/k^2 as an expression of n?
Step-wise solution:
1. We want to minimize the value of sum_(k=1)^n a_k/k^2.
2. To do this, we can sort the permutation in ascending order, so that a_1=1, a_2=2, ..., a_n=n.
3. Then, the sum becomes sum_(k=1)^n k/k^2 = sum_(k=1)^n 1/k.
4. We know that the harmonic series, sum_(k=1)^n 1/k, diverges as n approaches infinity.
5. However, we are looking for the smallest value of the sum, so we want to find the smallest possible value of n.
6. The smallest possible value of n is 1, where the sum is 1/1 = 1.
7. Therefore, the smallest value of sum_(k=1)^n a_k/k^2 is 1, achieved when (a_1, a_2, ..., a_n) is the permutation (1, 2, ..., n).
Now, summarize the answer above in one sentence, without any intermediate steps or explanations.
The smallest value of the sum is 1, achieved when the permutation is (1, 2, ..., n).
|
__label__pos
| 0.999946 |
usb4bsd: Pull up libusb and usbcontrol to FreeBSD current's.
[dragonfly.git] / lib / libusb / libusb20_ugen20.c
CommitLineData
aa3e5c14 1/* $FreeBSD: src/lib/libusb/libusb20_ugen20.c,v 1.13 2012/04/20 14:29:45 hselasky Exp $ */
1d96047e
MP
2/*-
3 * Copyright (c) 2008 Hans Petter Selasky. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27#include <sys/queue.h>
28#include <sys/types.h>
29
30#include <errno.h>
31#include <fcntl.h>
32#include <stdio.h>
33#include <stdlib.h>
34#include <string.h>
35#include <unistd.h>
36
37#include "libusb20.h"
38#include "libusb20_desc.h"
39#include "libusb20_int.h"
40
41#include <bus/u4b/usb.h>
42#include <bus/u4b/usbdi.h>
43#include <bus/u4b/usb_ioctl.h>
44
45static libusb20_init_backend_t ugen20_init_backend;
46static libusb20_open_device_t ugen20_open_device;
47static libusb20_close_device_t ugen20_close_device;
48static libusb20_get_backend_name_t ugen20_get_backend_name;
49static libusb20_exit_backend_t ugen20_exit_backend;
50static libusb20_dev_get_iface_desc_t ugen20_dev_get_iface_desc;
51static libusb20_dev_get_info_t ugen20_dev_get_info;
52static libusb20_root_get_dev_quirk_t ugen20_root_get_dev_quirk;
53static libusb20_root_get_quirk_name_t ugen20_root_get_quirk_name;
54static libusb20_root_add_dev_quirk_t ugen20_root_add_dev_quirk;
55static libusb20_root_remove_dev_quirk_t ugen20_root_remove_dev_quirk;
56static libusb20_root_set_template_t ugen20_root_set_template;
57static libusb20_root_get_template_t ugen20_root_get_template;
58
59const struct libusb20_backend_methods libusb20_ugen20_backend = {
60 LIBUSB20_BACKEND(LIBUSB20_DECLARE, ugen20)
61};
62
63/* USB device specific */
64static libusb20_get_config_desc_full_t ugen20_get_config_desc_full;
65static libusb20_get_config_index_t ugen20_get_config_index;
66static libusb20_set_config_index_t ugen20_set_config_index;
67static libusb20_set_alt_index_t ugen20_set_alt_index;
68static libusb20_reset_device_t ugen20_reset_device;
69static libusb20_check_connected_t ugen20_check_connected;
70static libusb20_set_power_mode_t ugen20_set_power_mode;
71static libusb20_get_power_mode_t ugen20_get_power_mode;
72static libusb20_kernel_driver_active_t ugen20_kernel_driver_active;
73static libusb20_detach_kernel_driver_t ugen20_detach_kernel_driver;
74static libusb20_do_request_sync_t ugen20_do_request_sync;
75static libusb20_process_t ugen20_process;
76
77/* USB transfer specific */
78static libusb20_tr_open_t ugen20_tr_open;
79static libusb20_tr_close_t ugen20_tr_close;
80static libusb20_tr_clear_stall_sync_t ugen20_tr_clear_stall_sync;
81static libusb20_tr_submit_t ugen20_tr_submit;
82static libusb20_tr_cancel_async_t ugen20_tr_cancel_async;
83
84static const struct libusb20_device_methods libusb20_ugen20_device_methods = {
85 LIBUSB20_DEVICE(LIBUSB20_DECLARE, ugen20)
86};
87
88static const char *
89ugen20_get_backend_name(void)
90{
91 return ("FreeBSD UGEN 2.0");
92}
93
94static uint32_t
95ugen20_path_convert_one(const char **pp)
96{
97 const char *ptr;
98 uint32_t temp = 0;
99
100 ptr = *pp;
101
102 while ((*ptr >= '0') && (*ptr <= '9')) {
103 temp *= 10;
104 temp += (*ptr - '0');
105 if (temp >= 1000000) {
106 /* catch overflow early */
aa3e5c14 107 return (0xFFFFFFFF);
1d96047e
MP
108 }
109 ptr++;
110 }
111
112 if (*ptr == '.') {
113 /* skip dot */
114 ptr++;
115 }
116 *pp = ptr;
117
118 return (temp);
119}
120
121static int
122ugen20_enumerate(struct libusb20_device *pdev, const char *id)
123{
124 const char *tmp = id;
125 struct usb_device_descriptor ddesc;
126 struct usb_device_info devinfo;
127 uint32_t plugtime;
128 char buf[64];
129 int f;
130 int error;
131
132 pdev->bus_number = ugen20_path_convert_one(&tmp);
133 pdev->device_address = ugen20_path_convert_one(&tmp);
134
135 snprintf(buf, sizeof(buf), "/dev/" USB_GENERIC_NAME "%u.%u",
136 pdev->bus_number, pdev->device_address);
137
138 f = open(buf, O_RDWR);
139 if (f < 0) {
140 return (LIBUSB20_ERROR_OTHER);
141 }
142 if (ioctl(f, USB_GET_PLUGTIME, &plugtime)) {
143 error = LIBUSB20_ERROR_OTHER;
144 goto done;
145 }
146 /* store when the device was plugged */
147 pdev->session_data.plugtime = plugtime;
148
149 if (ioctl(f, USB_GET_DEVICE_DESC, &ddesc)) {
150 error = LIBUSB20_ERROR_OTHER;
151 goto done;
152 }
153 LIBUSB20_INIT(LIBUSB20_DEVICE_DESC, &(pdev->ddesc));
154
155 libusb20_me_decode(&ddesc, sizeof(ddesc), &(pdev->ddesc));
156
157 if (pdev->ddesc.bNumConfigurations == 0) {
158 error = LIBUSB20_ERROR_OTHER;
159 goto done;
160 } else if (pdev->ddesc.bNumConfigurations >= 8) {
161 error = LIBUSB20_ERROR_OTHER;
162 goto done;
163 }
164 if (ioctl(f, USB_GET_DEVICEINFO, &devinfo)) {
165 error = LIBUSB20_ERROR_OTHER;
166 goto done;
167 }
168 switch (devinfo.udi_mode) {
169 case USB_MODE_DEVICE:
170 pdev->usb_mode = LIBUSB20_MODE_DEVICE;
171 break;
172 default:
173 pdev->usb_mode = LIBUSB20_MODE_HOST;
174 break;
175 }
176
177 switch (devinfo.udi_speed) {
178 case USB_SPEED_LOW:
179 pdev->usb_speed = LIBUSB20_SPEED_LOW;
180 break;
181 case USB_SPEED_FULL:
182 pdev->usb_speed = LIBUSB20_SPEED_FULL;
183 break;
184 case USB_SPEED_HIGH:
185 pdev->usb_speed = LIBUSB20_SPEED_HIGH;
186 break;
187 case USB_SPEED_VARIABLE:
188 pdev->usb_speed = LIBUSB20_SPEED_VARIABLE;
189 break;
190 case USB_SPEED_SUPER:
191 pdev->usb_speed = LIBUSB20_SPEED_SUPER;
192 break;
193 default:
194 pdev->usb_speed = LIBUSB20_SPEED_UNKNOWN;
195 break;
196 }
197
198 /* get parent HUB index and port */
199
200 pdev->parent_address = devinfo.udi_hubindex;
201 pdev->parent_port = devinfo.udi_hubport;
202
203 /* generate a nice description for printout */
204
205 snprintf(pdev->usb_desc, sizeof(pdev->usb_desc),
206 USB_GENERIC_NAME "%u.%u: <%s %s> at usbus%u", pdev->bus_number,
207 pdev->device_address, devinfo.udi_product,
208 devinfo.udi_vendor, pdev->bus_number);
209
210 error = 0;
211done:
212 close(f);
213 return (error);
214}
215
216struct ugen20_urd_state {
217 struct usb_read_dir urd;
218 uint32_t nparsed;
219 int f;
220 uint8_t *ptr;
221 const char *src;
222 const char *dst;
223 uint8_t buf[256];
224 uint8_t dummy_zero[1];
225};
226
227static int
228ugen20_readdir(struct ugen20_urd_state *st)
229{
230 ; /* style fix */
231repeat:
232 if (st->ptr == NULL) {
233 st->urd.urd_startentry += st->nparsed;
234 st->urd.urd_data = libusb20_pass_ptr(st->buf);
235 st->urd.urd_maxlen = sizeof(st->buf);
236 st->nparsed = 0;
237
238 if (ioctl(st->f, USB_READ_DIR, &st->urd)) {
239 return (EINVAL);
240 }
241 st->ptr = st->buf;
242 }
243 if (st->ptr[0] == 0) {
244 if (st->nparsed) {
245 st->ptr = NULL;
246 goto repeat;
247 } else {
248 return (ENXIO);
249 }
250 }
251 st->src = (void *)(st->ptr + 1);
252 st->dst = st->src + strlen(st->src) + 1;
253 st->ptr = st->ptr + st->ptr[0];
254 st->nparsed++;
255
256 if ((st->ptr < st->buf) ||
257 (st->ptr > st->dummy_zero)) {
258 /* invalid entry */
259 return (EINVAL);
260 }
261 return (0);
262}
263
264static int
265ugen20_init_backend(struct libusb20_backend *pbe)
266{
267 struct ugen20_urd_state state;
268 struct libusb20_device *pdev;
269
270 memset(&state, 0, sizeof(state));
271
272 state.f = open("/dev/" USB_DEVICE_NAME, O_RDONLY);
273 if (state.f < 0)
274 return (LIBUSB20_ERROR_OTHER);
275
276 while (ugen20_readdir(&state) == 0) {
277
278 if ((state.src[0] != 'u') ||
279 (state.src[1] != 'g') ||
280 (state.src[2] != 'e') ||
281 (state.src[3] != 'n')) {
282 continue;
283 }
284 pdev = libusb20_dev_alloc();
285 if (pdev == NULL) {
286 continue;
287 }
288 if (ugen20_enumerate(pdev, state.src + 4)) {
289 libusb20_dev_free(pdev);
290 continue;
291 }
292 /* put the device on the backend list */
293 libusb20_be_enqueue_device(pbe, pdev);
294 }
295 close(state.f);
296 return (0); /* success */
297}
298
299static void
300ugen20_tr_release(struct libusb20_device *pdev)
301{
302 struct usb_fs_uninit fs_uninit;
303
304 if (pdev->nTransfer == 0) {
305 return;
306 }
307 /* release all pending USB transfers */
308 if (pdev->privBeData != NULL) {
309 memset(&fs_uninit, 0, sizeof(fs_uninit));
310 if (ioctl(pdev->file, USB_FS_UNINIT, &fs_uninit)) {
311 /* ignore any errors of this kind */
312 }
313 }
314 return;
315}
316
317static int
318ugen20_tr_renew(struct libusb20_device *pdev)
319{
320 struct usb_fs_init fs_init;
321 struct usb_fs_endpoint *pfse;
322 int error;
323 uint32_t size;
324 uint16_t nMaxTransfer;
325
326 nMaxTransfer = pdev->nTransfer;
327 error = 0;
328
329 if (nMaxTransfer == 0) {
330 goto done;
331 }
332 size = nMaxTransfer * sizeof(*pfse);
333
334 if (pdev->privBeData == NULL) {
335 pfse = malloc(size);
336 if (pfse == NULL) {
337 error = LIBUSB20_ERROR_NO_MEM;
338 goto done;
339 }
340 pdev->privBeData = pfse;
341 }
342 /* reset endpoint data */
343 memset(pdev->privBeData, 0, size);
344
345 memset(&fs_init, 0, sizeof(fs_init));
346
347 fs_init.pEndpoints = libusb20_pass_ptr(pdev->privBeData);
348 fs_init.ep_index_max = nMaxTransfer;
349
350 if (ioctl(pdev->file, USB_FS_INIT, &fs_init)) {
351 error = LIBUSB20_ERROR_OTHER;
352 goto done;
353 }
354done:
355 return (error);
356}
357
358static int
359ugen20_open_device(struct libusb20_device *pdev, uint16_t nMaxTransfer)
360{
361 uint32_t plugtime;
362 char buf[64];
363 int f;
364 int g;
365 int error;
366
367 snprintf(buf, sizeof(buf), "/dev/" USB_GENERIC_NAME "%u.%u",
368 pdev->bus_number, pdev->device_address);
369
370 /*
371 * We need two file handles, one for the control endpoint and one
372 * for BULK, INTERRUPT and ISOCHRONOUS transactions due to optimised
373 * kernel locking.
374 */
375 g = open(buf, O_RDWR);
376 if (g < 0) {
377 return (LIBUSB20_ERROR_NO_DEVICE);
378 }
379 f = open(buf, O_RDWR);
380 if (f < 0) {
381 close(g);
382 return (LIBUSB20_ERROR_NO_DEVICE);
383 }
384 if (ioctl(f, USB_GET_PLUGTIME, &plugtime)) {
385 error = LIBUSB20_ERROR_OTHER;
386 goto done;
387 }
388 /* check that the correct device is still plugged */
389 if (pdev->session_data.plugtime != plugtime) {
390 error = LIBUSB20_ERROR_NO_DEVICE;
391 goto done;
392 }
393 /* need to set this before "tr_renew()" */
394 pdev->file = f;
395 pdev->file_ctrl = g;
396
397 /* renew all USB transfers */
398 error = ugen20_tr_renew(pdev);
399 if (error) {
400 goto done;
401 }
402 /* set methods */
403 pdev->methods = &libusb20_ugen20_device_methods;
404
405done:
406 if (error) {
407 if (pdev->privBeData) {
408 /* cleanup after "tr_renew()" */
409 free(pdev->privBeData);
410 pdev->privBeData = NULL;
411 }
412 pdev->file = -1;
413 pdev->file_ctrl = -1;
414 close(f);
415 close(g);
416 }
417 return (error);
418}
419
420static int
421ugen20_close_device(struct libusb20_device *pdev)
422{
423 struct usb_fs_uninit fs_uninit;
424
425 if (pdev->privBeData) {
426 memset(&fs_uninit, 0, sizeof(fs_uninit));
427 if (ioctl(pdev->file, USB_FS_UNINIT, &fs_uninit)) {
428 /* ignore this error */
429 }
430 free(pdev->privBeData);
431 }
432 pdev->nTransfer = 0;
433 pdev->privBeData = NULL;
434 close(pdev->file);
435 close(pdev->file_ctrl);
436 pdev->file = -1;
437 pdev->file_ctrl = -1;
438 return (0); /* success */
439}
440
441static void
442ugen20_exit_backend(struct libusb20_backend *pbe)
443{
444 return; /* nothing to do */
445}
446
447static int
448ugen20_get_config_desc_full(struct libusb20_device *pdev,
449 uint8_t **ppbuf, uint16_t *plen, uint8_t cfg_index)
450{
451 struct usb_gen_descriptor gen_desc;
452 struct usb_config_descriptor cdesc;
453 uint8_t *ptr;
454 uint16_t len;
455 int error;
456
457 /* make sure memory is initialised */
458 memset(&cdesc, 0, sizeof(cdesc));
459 memset(&gen_desc, 0, sizeof(gen_desc));
460
461 gen_desc.ugd_data = libusb20_pass_ptr(&cdesc);
462 gen_desc.ugd_maxlen = sizeof(cdesc);
463 gen_desc.ugd_config_index = cfg_index;
464
465 error = ioctl(pdev->file_ctrl, USB_GET_FULL_DESC, &gen_desc);
466 if (error) {
467 return (LIBUSB20_ERROR_OTHER);
468 }
469 len = UGETW(cdesc.wTotalLength);
470 if (len < sizeof(cdesc)) {
471 /* corrupt descriptor */
472 return (LIBUSB20_ERROR_OTHER);
473 }
474 ptr = malloc(len);
475 if (!ptr) {
476 return (LIBUSB20_ERROR_NO_MEM);
477 }
478
479 /* make sure memory is initialised */
480 memset(ptr, 0, len);
481
482 gen_desc.ugd_data = libusb20_pass_ptr(ptr);
483 gen_desc.ugd_maxlen = len;
484
485 error = ioctl(pdev->file_ctrl, USB_GET_FULL_DESC, &gen_desc);
486 if (error) {
487 free(ptr);
488 return (LIBUSB20_ERROR_OTHER);
489 }
490 /* make sure that the device doesn't fool us */
491 memcpy(ptr, &cdesc, sizeof(cdesc));
492
493 *ppbuf = ptr;
494 *plen = len;
495
496 return (0); /* success */
497}
498
499static int
500ugen20_get_config_index(struct libusb20_device *pdev, uint8_t *pindex)
501{
502 int temp;
503
504 if (ioctl(pdev->file_ctrl, USB_GET_CONFIG, &temp)) {
505 return (LIBUSB20_ERROR_OTHER);
506 }
507 *pindex = temp;
508
509 return (0);
510}
511
512static int
513ugen20_set_config_index(struct libusb20_device *pdev, uint8_t cfg_index)
514{
515 int temp = cfg_index;
516
517 /* release all active USB transfers */
518 ugen20_tr_release(pdev);
519
520 if (ioctl(pdev->file_ctrl, USB_SET_CONFIG, &temp)) {
521 return (LIBUSB20_ERROR_OTHER);
522 }
523 return (ugen20_tr_renew(pdev));
524}
525
526static int
527ugen20_set_alt_index(struct libusb20_device *pdev,
528 uint8_t iface_index, uint8_t alt_index)
529{
530 struct usb_alt_interface alt_iface;
531
532 memset(&alt_iface, 0, sizeof(alt_iface));
533
534 alt_iface.uai_interface_index = iface_index;
535 alt_iface.uai_alt_index = alt_index;
536
537 /* release all active USB transfers */
538 ugen20_tr_release(pdev);
539
540 if (ioctl(pdev->file_ctrl, USB_SET_ALTINTERFACE, &alt_iface)) {
541 return (LIBUSB20_ERROR_OTHER);
542 }
543 return (ugen20_tr_renew(pdev));
544}
545
546static int
547ugen20_reset_device(struct libusb20_device *pdev)
548{
549 int temp = 0;
550
551 /* release all active USB transfers */
552 ugen20_tr_release(pdev);
553
554 if (ioctl(pdev->file_ctrl, USB_DEVICEENUMERATE, &temp)) {
555 return (LIBUSB20_ERROR_OTHER);
556 }
557 return (ugen20_tr_renew(pdev));
558}
559
560static int
561ugen20_check_connected(struct libusb20_device *pdev)
562{
563 uint32_t plugtime;
564 int error = 0;
565
566 if (ioctl(pdev->file_ctrl, USB_GET_PLUGTIME, &plugtime)) {
567 error = LIBUSB20_ERROR_NO_DEVICE;
568 goto done;
569 }
570
571 if (pdev->session_data.plugtime != plugtime) {
572 error = LIBUSB20_ERROR_NO_DEVICE;
573 goto done;
574 }
575done:
576 return (error);
577}
578
579static int
580ugen20_set_power_mode(struct libusb20_device *pdev, uint8_t power_mode)
581{
582 int temp;
583
584 switch (power_mode) {
585 case LIBUSB20_POWER_OFF:
586 temp = USB_POWER_MODE_OFF;
587 break;
588 case LIBUSB20_POWER_ON:
589 temp = USB_POWER_MODE_ON;
590 break;
591 case LIBUSB20_POWER_SAVE:
592 temp = USB_POWER_MODE_SAVE;
593 break;
594 case LIBUSB20_POWER_SUSPEND:
595 temp = USB_POWER_MODE_SUSPEND;
596 break;
597 case LIBUSB20_POWER_RESUME:
598 temp = USB_POWER_MODE_RESUME;
599 break;
600 default:
601 return (LIBUSB20_ERROR_INVALID_PARAM);
602 }
603 if (ioctl(pdev->file_ctrl, USB_SET_POWER_MODE, &temp)) {
604 return (LIBUSB20_ERROR_OTHER);
605 }
606 return (0);
607}
608
609static int
610ugen20_get_power_mode(struct libusb20_device *pdev, uint8_t *power_mode)
611{
612 int temp;
613
614 if (ioctl(pdev->file_ctrl, USB_GET_POWER_MODE, &temp)) {
615 return (LIBUSB20_ERROR_OTHER);
616 }
617 switch (temp) {
618 case USB_POWER_MODE_OFF:
619 temp = LIBUSB20_POWER_OFF;
620 break;
621 case USB_POWER_MODE_ON:
622 temp = LIBUSB20_POWER_ON;
623 break;
624 case USB_POWER_MODE_SAVE:
625 temp = LIBUSB20_POWER_SAVE;
626 break;
627 case USB_POWER_MODE_SUSPEND:
628 temp = LIBUSB20_POWER_SUSPEND;
629 break;
630 case USB_POWER_MODE_RESUME:
631 temp = LIBUSB20_POWER_RESUME;
632 break;
633 default:
634 temp = LIBUSB20_POWER_ON;
635 break;
636 }
637 *power_mode = temp;
638 return (0); /* success */
639}
640
641static int
642ugen20_kernel_driver_active(struct libusb20_device *pdev,
643 uint8_t iface_index)
644{
645 int temp = iface_index;
646
647 if (ioctl(pdev->file_ctrl, USB_IFACE_DRIVER_ACTIVE, &temp)) {
648 return (LIBUSB20_ERROR_OTHER);
649 }
650 return (0); /* kernel driver is active */
651}
652
653static int
654ugen20_detach_kernel_driver(struct libusb20_device *pdev,
655 uint8_t iface_index)
656{
657 int temp = iface_index;
658
659 if (ioctl(pdev->file_ctrl, USB_IFACE_DRIVER_DETACH, &temp)) {
660 return (LIBUSB20_ERROR_OTHER);
661 }
662 return (0); /* kernel driver is active */
663}
664
665static int
666ugen20_do_request_sync(struct libusb20_device *pdev,
667 struct LIBUSB20_CONTROL_SETUP_DECODED *setup,
668 void *data, uint16_t *pactlen, uint32_t timeout, uint8_t flags)
669{
670 struct usb_ctl_request req;
671
672 memset(&req, 0, sizeof(req));
673
674 req.ucr_data = libusb20_pass_ptr(data);
675 if (!(flags & LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK)) {
676 req.ucr_flags |= USB_SHORT_XFER_OK;
677 }
678 if (libusb20_me_encode(&req.ucr_request,
679 sizeof(req.ucr_request), setup)) {
680 /* ignore */
681 }
682 if (ioctl(pdev->file_ctrl, USB_DO_REQUEST, &req)) {
683 return (LIBUSB20_ERROR_OTHER);
684 }
685 if (pactlen) {
686 /* get actual length */
687 *pactlen = req.ucr_actlen;
688 }
689 return (0); /* kernel driver is active */
690}
691
692static int
693ugen20_process(struct libusb20_device *pdev)
694{
695 struct usb_fs_complete temp;
696 struct usb_fs_endpoint *fsep;
697 struct libusb20_transfer *xfer;
698
699 while (1) {
700
701 if (ioctl(pdev->file, USB_FS_COMPLETE, &temp)) {
702 if (errno == EBUSY) {
703 break;
704 } else {
705 /* device detached */
706 return (LIBUSB20_ERROR_OTHER);
707 }
708 }
709 fsep = pdev->privBeData;
710 xfer = pdev->pTransfer;
711 fsep += temp.ep_index;
712 xfer += temp.ep_index;
713
714 /* update transfer status */
715
716 if (fsep->status == 0) {
717 xfer->aFrames = fsep->aFrames;
718 xfer->timeComplete = fsep->isoc_time_complete;
719 xfer->status = LIBUSB20_TRANSFER_COMPLETED;
720 } else if (fsep->status == USB_ERR_CANCELLED) {
721 xfer->aFrames = 0;
722 xfer->timeComplete = 0;
723 xfer->status = LIBUSB20_TRANSFER_CANCELLED;
724 } else if (fsep->status == USB_ERR_STALLED) {
725 xfer->aFrames = 0;
726 xfer->timeComplete = 0;
727 xfer->status = LIBUSB20_TRANSFER_STALL;
728 } else if (fsep->status == USB_ERR_TIMEOUT) {
729 xfer->aFrames = 0;
730 xfer->timeComplete = 0;
731 xfer->status = LIBUSB20_TRANSFER_TIMED_OUT;
732 } else {
733 xfer->aFrames = 0;
734 xfer->timeComplete = 0;
735 xfer->status = LIBUSB20_TRANSFER_ERROR;
736 }
737 libusb20_tr_callback_wrapper(xfer);
738 }
739 return (0); /* done */
740}
741
742static int
743ugen20_tr_open(struct libusb20_transfer *xfer, uint32_t MaxBufSize,
744 uint32_t MaxFrameCount, uint8_t ep_no, uint8_t pre_scale)
745{
746 struct usb_fs_open temp;
747 struct usb_fs_endpoint *fsep;
748
749 if (pre_scale)
750 MaxFrameCount |= USB_FS_MAX_FRAMES_PRE_SCALE;
751
752 memset(&temp, 0, sizeof(temp));
753
754 fsep = xfer->pdev->privBeData;
755 fsep += xfer->trIndex;
756
757 temp.max_bufsize = MaxBufSize;
758 temp.max_frames = MaxFrameCount;
759 temp.ep_index = xfer->trIndex;
760 temp.ep_no = ep_no;
761
762 if (ioctl(xfer->pdev->file, USB_FS_OPEN, &temp)) {
763 return (LIBUSB20_ERROR_INVALID_PARAM);
764 }
765 /* maximums might have changed - update */
766 xfer->maxFrames = temp.max_frames;
767
768 /* "max_bufsize" should be multiple of "max_packet_length" */
769 xfer->maxTotalLength = temp.max_bufsize;
770 xfer->maxPacketLen = temp.max_packet_length;
771
772 /* setup buffer and length lists using zero copy */
773 fsep->ppBuffer = libusb20_pass_ptr(xfer->ppBuffer);
774 fsep->pLength = libusb20_pass_ptr(xfer->pLength);
775
776 return (0); /* success */
777}
778
779static int
780ugen20_tr_close(struct libusb20_transfer *xfer)
781{
782 struct usb_fs_close temp;
783
784 memset(&temp, 0, sizeof(temp));
785
786 temp.ep_index = xfer->trIndex;
787
788 if (ioctl(xfer->pdev->file, USB_FS_CLOSE, &temp)) {
789 return (LIBUSB20_ERROR_INVALID_PARAM);
790 }
791 return (0); /* success */
792}
793
794static int
795ugen20_tr_clear_stall_sync(struct libusb20_transfer *xfer)
796{
797 struct usb_fs_clear_stall_sync temp;
798
799 memset(&temp, 0, sizeof(temp));
800
801 /* if the transfer is active, an error will be returned */
802
803 temp.ep_index = xfer->trIndex;
804
805 if (ioctl(xfer->pdev->file, USB_FS_CLEAR_STALL_SYNC, &temp)) {
806 return (LIBUSB20_ERROR_INVALID_PARAM);
807 }
808 return (0); /* success */
809}
810
811static void
812ugen20_tr_submit(struct libusb20_transfer *xfer)
813{
814 struct usb_fs_start temp;
815 struct usb_fs_endpoint *fsep;
816
817 memset(&temp, 0, sizeof(temp));
818
819 fsep = xfer->pdev->privBeData;
820 fsep += xfer->trIndex;
821
822 fsep->nFrames = xfer->nFrames;
823 fsep->flags = 0;
824 if (!(xfer->flags & LIBUSB20_TRANSFER_SINGLE_SHORT_NOT_OK)) {
825 fsep->flags |= USB_FS_FLAG_SINGLE_SHORT_OK;
826 }
827 if (!(xfer->flags & LIBUSB20_TRANSFER_MULTI_SHORT_NOT_OK)) {
828 fsep->flags |= USB_FS_FLAG_MULTI_SHORT_OK;
829 }
830 if (xfer->flags & LIBUSB20_TRANSFER_FORCE_SHORT) {
831 fsep->flags |= USB_FS_FLAG_FORCE_SHORT;
832 }
833 if (xfer->flags & LIBUSB20_TRANSFER_DO_CLEAR_STALL) {
834 fsep->flags |= USB_FS_FLAG_CLEAR_STALL;
835 }
836 /* NOTE: The "fsep->timeout" variable is 16-bit. */
837 if (xfer->timeout > 65535)
838 fsep->timeout = 65535;
839 else
840 fsep->timeout = xfer->timeout;
841
842 temp.ep_index = xfer->trIndex;
843
844 if (ioctl(xfer->pdev->file, USB_FS_START, &temp)) {
845 /* ignore any errors - should never happen */
846 }
847 return; /* success */
848}
849
850static void
851ugen20_tr_cancel_async(struct libusb20_transfer *xfer)
852{
853 struct usb_fs_stop temp;
854
855 memset(&temp, 0, sizeof(temp));
856
857 temp.ep_index = xfer->trIndex;
858
859 if (ioctl(xfer->pdev->file, USB_FS_STOP, &temp)) {
860 /* ignore any errors - should never happen */
861 }
862 return;
863}
864
865static int
866ugen20_be_ioctl(uint32_t cmd, void *data)
867{
868 int f;
869 int error;
870
871 f = open("/dev/" USB_DEVICE_NAME, O_RDONLY);
872 if (f < 0)
873 return (LIBUSB20_ERROR_OTHER);
874 error = ioctl(f, cmd, data);
875 if (error == -1) {
876 if (errno == EPERM) {
877 error = LIBUSB20_ERROR_ACCESS;
878 } else {
879 error = LIBUSB20_ERROR_OTHER;
880 }
881 }
882 close(f);
883 return (error);
884}
885
886static int
887ugen20_dev_get_iface_desc(struct libusb20_device *pdev,
888 uint8_t iface_index, char *buf, uint8_t len)
889{
890 struct usb_gen_descriptor ugd;
891
892 memset(&ugd, 0, sizeof(ugd));
893
894 ugd.ugd_data = libusb20_pass_ptr(buf);
895 ugd.ugd_maxlen = len;
896 ugd.ugd_iface_index = iface_index;
897
898 if (ioctl(pdev->file, USB_GET_IFACE_DRIVER, &ugd)) {
899 return (LIBUSB20_ERROR_INVALID_PARAM);
900 }
901 return (0);
902}
903
904static int
905ugen20_dev_get_info(struct libusb20_device *pdev,
906 struct usb_device_info *pinfo)
907{
908 if (ioctl(pdev->file, USB_GET_DEVICEINFO, pinfo)) {
909 return (LIBUSB20_ERROR_INVALID_PARAM);
910 }
911 return (0);
912}
913
914static int
915ugen20_root_get_dev_quirk(struct libusb20_backend *pbe,
916 uint16_t quirk_index, struct libusb20_quirk *pq)
917{
918 struct usb_gen_quirk q;
919 int error;
920
921 memset(&q, 0, sizeof(q));
922
923 q.index = quirk_index;
924
925 error = ugen20_be_ioctl(USB_DEV_QUIRK_GET, &q);
926
927 if (error) {
928 if (errno == EINVAL) {
929 return (LIBUSB20_ERROR_NOT_FOUND);
930 }
931 } else {
932 pq->vid = q.vid;
933 pq->pid = q.pid;
934 pq->bcdDeviceLow = q.bcdDeviceLow;
935 pq->bcdDeviceHigh = q.bcdDeviceHigh;
936 strlcpy(pq->quirkname, q.quirkname, sizeof(pq->quirkname));
937 }
938 return (error);
939}
940
941static int
942ugen20_root_get_quirk_name(struct libusb20_backend *pbe, uint16_t quirk_index,
943 struct libusb20_quirk *pq)
944{
945 struct usb_gen_quirk q;
946 int error;
947
948 memset(&q, 0, sizeof(q));
949
950 q.index = quirk_index;
951
952 error = ugen20_be_ioctl(USB_QUIRK_NAME_GET, &q);
953
954 if (error) {
955 if (errno == EINVAL) {
956 return (LIBUSB20_ERROR_NOT_FOUND);
957 }
958 } else {
959 strlcpy(pq->quirkname, q.quirkname, sizeof(pq->quirkname));
960 }
961 return (error);
962}
963
964static int
965ugen20_root_add_dev_quirk(struct libusb20_backend *pbe,
966 struct libusb20_quirk *pq)
967{
968 struct usb_gen_quirk q;
969 int error;
970
971 memset(&q, 0, sizeof(q));
972
973 q.vid = pq->vid;
974 q.pid = pq->pid;
975 q.bcdDeviceLow = pq->bcdDeviceLow;
976 q.bcdDeviceHigh = pq->bcdDeviceHigh;
977 strlcpy(q.quirkname, pq->quirkname, sizeof(q.quirkname));
978
979 error = ugen20_be_ioctl(USB_DEV_QUIRK_ADD, &q);
980 if (error) {
981 if (errno == ENOMEM) {
982 return (LIBUSB20_ERROR_NO_MEM);
983 }
984 }
985 return (error);
986}
987
988static int
989ugen20_root_remove_dev_quirk(struct libusb20_backend *pbe,
990 struct libusb20_quirk *pq)
991{
992 struct usb_gen_quirk q;
993 int error;
994
995 memset(&q, 0, sizeof(q));
996
997 q.vid = pq->vid;
998 q.pid = pq->pid;
999 q.bcdDeviceLow = pq->bcdDeviceLow;
1000 q.bcdDeviceHigh = pq->bcdDeviceHigh;
1001 strlcpy(q.quirkname, pq->quirkname, sizeof(q.quirkname));
1002
1003 error = ugen20_be_ioctl(USB_DEV_QUIRK_REMOVE, &q);
1004 if (error) {
1005 if (errno == EINVAL) {
1006 return (LIBUSB20_ERROR_NOT_FOUND);
1007 }
1008 }
1009 return (error);
1010}
1011
1012static int
1013ugen20_root_set_template(struct libusb20_backend *pbe, int temp)
1014{
1015 return (ugen20_be_ioctl(USB_SET_TEMPLATE, &temp));
1016}
1017
1018static int
1019ugen20_root_get_template(struct libusb20_backend *pbe, int *ptemp)
1020{
1021 return (ugen20_be_ioctl(USB_GET_TEMPLATE, ptemp));
1022}
|
__label__pos
| 0.988309 |
VBA Tables and ListObjects
VBA Tables and ListObjects Complete Tutorial
VBA Tables and ListObjects are the most useful, important and powerful feature. Let us see complete details, examples and step by instructions in the following tutorial.
Table: The table is used to store structured data. It consists of rows, columns, column headers, data range, and cell range. You can store any type of data in the table. It can be text, numbers, formulas, etc. Table has more useful features. When we add new rows or columns automatically the table format contains the new row or columns. We can expand automatically.
Table Recognition: Sometimes range and table both looks like same. But there is a difference between them. The table consists of the indicator at the right side bottom corner to recognise table . Please find the screenshot of range and table for your reference.
Difference in Table & Range
List of Available Table Names: We can create multiple tables in workbook. To see all the table names follow the below specified steps.
1. GO to the Formulas tab from the Excel ribbon.
2. Go to Defined Names group.
3. Click on Name Manager to see list of created table names.
4. Select any table and click on edit button to edit name of the table, to add comment, or to edit range.
Table Name: You can find the table name by following below specified instructions.
1. You can select the table range.
2. Go to Table Design from the Excel ribbon.
3. Go to Properties group.
4. You can see the selected name of the table under Table Name in the textbox.
5. You can also edit table name manually in the specified box and press enter.
Let us see the complete tutorial about tables many more.
Other Useful Resources:
Click on the following links of the useful resources. These helps to learn and gain more knowledge.
VBA Tutorial VBA Functions List VBA Arrays in Excel Blog
VBA Editor Keyboard Shortcut Keys List VBA Interview Questions & Answers
Leave a Reply
|
__label__pos
| 0.985725 |
MPE Home Metamath Proof Explorer < Previous Next >
Nearby theorems
Mirrors > Home > MPE Home > Th. List > ofs1 Structured version Visualization version GIF version
Theorem ofs1 13557
Description: Letterwise operations on a single letter word. (Contributed by Thierry Arnoux, 7-Oct-2018.)
Assertion
Ref Expression
ofs1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩ ∘𝑓 𝑅⟨“𝐵”⟩) = ⟨“(𝐴𝑅𝐵)”⟩)
Proof of Theorem ofs1
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 snex 4835 . . . 4 {0} ∈ V
21a1i 11 . . 3 ((𝐴𝑆𝐵𝑇) → {0} ∈ V)
3 simpll 786 . . 3 (((𝐴𝑆𝐵𝑇) ∧ 𝑖 ∈ {0}) → 𝐴𝑆)
4 simplr 788 . . 3 (((𝐴𝑆𝐵𝑇) ∧ 𝑖 ∈ {0}) → 𝐵𝑇)
5 s1val 13231 . . . . 5 (𝐴𝑆 → ⟨“𝐴”⟩ = {⟨0, 𝐴⟩})
6 0nn0 11184 . . . . . 6 0 ∈ ℕ0
7 fmptsn 6338 . . . . . 6 ((0 ∈ ℕ0𝐴𝑆) → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
86, 7mpan 702 . . . . 5 (𝐴𝑆 → {⟨0, 𝐴⟩} = (𝑖 ∈ {0} ↦ 𝐴))
95, 8eqtrd 2644 . . . 4 (𝐴𝑆 → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
109adantr 480 . . 3 ((𝐴𝑆𝐵𝑇) → ⟨“𝐴”⟩ = (𝑖 ∈ {0} ↦ 𝐴))
11 s1val 13231 . . . . 5 (𝐵𝑇 → ⟨“𝐵”⟩ = {⟨0, 𝐵⟩})
12 fmptsn 6338 . . . . . 6 ((0 ∈ ℕ0𝐵𝑇) → {⟨0, 𝐵⟩} = (𝑖 ∈ {0} ↦ 𝐵))
136, 12mpan 702 . . . . 5 (𝐵𝑇 → {⟨0, 𝐵⟩} = (𝑖 ∈ {0} ↦ 𝐵))
1411, 13eqtrd 2644 . . . 4 (𝐵𝑇 → ⟨“𝐵”⟩ = (𝑖 ∈ {0} ↦ 𝐵))
1514adantl 481 . . 3 ((𝐴𝑆𝐵𝑇) → ⟨“𝐵”⟩ = (𝑖 ∈ {0} ↦ 𝐵))
162, 3, 4, 10, 15offval2 6812 . 2 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩ ∘𝑓 𝑅⟨“𝐵”⟩) = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
17 ovex 6577 . . . 4 (𝐴𝑅𝐵) ∈ V
18 s1val 13231 . . . 4 ((𝐴𝑅𝐵) ∈ V → ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩})
1917, 18ax-mp 5 . . 3 ⟨“(𝐴𝑅𝐵)”⟩ = {⟨0, (𝐴𝑅𝐵)⟩}
20 fmptsn 6338 . . . 4 ((0 ∈ ℕ0 ∧ (𝐴𝑅𝐵) ∈ V) → {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵)))
216, 17, 20mp2an 704 . . 3 {⟨0, (𝐴𝑅𝐵)⟩} = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
2219, 21eqtri 2632 . 2 ⟨“(𝐴𝑅𝐵)”⟩ = (𝑖 ∈ {0} ↦ (𝐴𝑅𝐵))
2316, 22syl6eqr 2662 1 ((𝐴𝑆𝐵𝑇) → (⟨“𝐴”⟩ ∘𝑓 𝑅⟨“𝐵”⟩) = ⟨“(𝐴𝑅𝐵)”⟩)
Colors of variables: wff setvar class
Syntax hints: wi 4 wa 383 = wceq 1475 wcel 1977 Vcvv 3173 {csn 4125 cop 4131 cmpt 4643 (class class class)co 6549 𝑓 cof 6793 0cc0 9815 0cn0 11169 ⟨“cs1 13149
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-mulcl 9877 ax-i2m1 9883
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-n0 11170 df-s1 13157
This theorem is referenced by: ofs2 13558
Copyright terms: Public domain W3C validator
|
__label__pos
| 0.728149 |
<meta http-equiv="refresh" content="1; url=/nojavascript/"> Quiz I | CK-12 Foundation
Dismiss
Skip Navigation
You are reading an older version of this FlexBook® textbook: CK-12 Algebra I - Honors Go to the latest version.
4.3: Quiz I
Created by: CK-12
0 0 0
Multiple Choice – Please circle the letter for the correct answer and then write that letter in the blank to the left of each question.
1. __________ What is the y-intercept of the line that passes through the points (2, –3) and (4, 1)?
1. (0, -13)
2. \left ( 0, \frac{7}{3} \right )
3. (0, -7)
4. \left ( 0, - \frac{7}{3} \right )
2. __________ What is the slope of the following linear equation? 0 = \frac{2}{3}x -4
1. m=0
2. m=\frac{2}{3}
3. m=-4
4. m = \text{undefined}
3. __________ A line is drawn parallel to the y-axis. Which of the following could be the equation of that line?
1. x = -3
2. y = -3
3. y = x -3
4. y = x
4. __________ What is the slope-intercept form of 6x-7y-14=0?
1. -7y = 6x -14
2. y = \frac{-6}{7}x + 2
3. y = \frac{6}{-7}x - 2
4. y = \frac{6}{7}x - 2
5. __________ What is the x-intercept of the line y = \frac{-2}{5}x - 6?
1. (-6,0)
2. (0,-6)
3. (-15,0)
4. \left ( \frac{-2}{5}, 0 \right )
6. __________ What is the equation of the line that passes through the point (–6, 4) and has a slope that is zero?
1. y = 4
2. x = 4
3. x = -6
4. y = -6
7. __________ What is the equation of the line having a slope of 3 and passing through the point (2, 1)?
1. y=3x
2. y=3x-5
3. y=3x+2
4. y=3x+1
8. __________ What is the slope of the line 4x+5y-10=0
1. 4
2. -4
3. -\frac{4}{5}
4. -2
9. __________ Which of the following graphs best represents the following? y=mx+b where m is negative and b is positive:
10. __________ If the equation 3(x-2)-2(y-4)=9 were put in the form y=mx+b, which equation would be correct?
1. y = -\frac{3}{2}x + \frac{7}{2}
2. y = \frac{3}{2}x + 7
3. y = -\frac{3}{2}x - \frac{7}{2}
4. y = \frac{3}{2}x - \frac{7}{2}
Answers to Quiz I
1. C
2. D
3. A
4. D
5. C
6. A
7. B
8. C
9. A
10. D
Image Attributions
Description
Grades:
Date Created:
Jan 16, 2013
Last Modified:
Jun 04, 2014
Files can only be attached to the latest version of None
Reviews
Please wait...
Please wait...
Image Detail
Sizes: Medium | Original
CK.MAT.ENG.SE.1.Algebra-I---Honors.4.3
ShareThis Copy and Paste
Original text
|
__label__pos
| 1 |
blob: 2a000cf09b188daad2d43f754b7bdc6c2076e8d6 [file] [log] [blame]
// Copyright (c) 2015-2016 The Khronos Group Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include <cassert>
#include <cstdio>
#include <cstring>
#include <vector>
#include "source/spirv_target_env.h"
#include "spirv-tools/libspirv.h"
#include "tools/io.h"
#include "tools/util/flags.h"
static const auto kDefaultEnvironment = "spv1.6";
static const std::string kHelpText =
R"(%s - Create a SPIR-V binary module from SPIR-V assembly text
Usage: %s [options] [<filename>]
The SPIR-V assembly text is read from <filename>. If no file is specified,
or if the filename is "-", then the assembly text is read from standard input.
The SPIR-V binary module is written to file "out.spv", unless the -o option
is used.
Options:
-h, --help Print this help.
-o <filename> Set the output filename. Use '-' to mean stdout.
--version Display assembler version information.
--preserve-numeric-ids
Numeric IDs in the binary will have the same values as in the
source. Non-numeric IDs are allocated by filling in the gaps,
starting with 1 and going up.
--target-env %s
Use specified environment.
)";
// clang-format off
FLAG_SHORT_bool( h, /* default_value= */ false, /* required= */ false);
FLAG_LONG_bool( help, /* default_value= */ false, /* required= */false);
FLAG_LONG_bool( version, /* default_value= */ false, /* required= */ false);
FLAG_LONG_bool( preserve_numeric_ids, /* default_value= */ false, /* required= */ false);
FLAG_SHORT_string(o, /* default_value= */ "", /* required= */ false);
FLAG_LONG_string( target_env, /* default_value= */ kDefaultEnvironment, /* required= */ false);
// clang-format on
int main(int, const char** argv) {
if (!flags::Parse(argv)) {
return 1;
}
if (flags::h.value() || flags::help.value()) {
const std::string target_env_list = spvTargetEnvList(19, 80);
printf(kHelpText.c_str(), argv[0], argv[0], target_env_list.c_str());
return 0;
}
if (flags::version.value()) {
spv_target_env target_env;
bool success = spvParseTargetEnv(kDefaultEnvironment, &target_env);
assert(success && "Default environment should always parse.");
if (!success) {
fprintf(stderr,
"error: invalid default target environment. Please report this "
"issue.");
return 1;
}
printf("%s\n", spvSoftwareVersionDetailsString());
printf("Target: %s\n", spvTargetEnvDescription(target_env));
return 0;
}
std::string outFile = flags::o.value();
if (outFile.empty()) {
outFile = "out.spv";
}
uint32_t options = 0;
if (flags::preserve_numeric_ids.value()) {
options |= SPV_TEXT_TO_BINARY_OPTION_PRESERVE_NUMERIC_IDS;
}
spv_target_env target_env;
if (!spvParseTargetEnv(flags::target_env.value().c_str(), &target_env)) {
fprintf(stderr, "error: Unrecognized target env: %s\n",
flags::target_env.value().c_str());
return 1;
}
if (flags::positional_arguments.size() != 1) {
fprintf(stderr, "error: exactly one input file must be specified.\n");
return 1;
}
std::string inFile = flags::positional_arguments[0];
std::vector<char> contents;
if (!ReadTextFile<char>(inFile.c_str(), &contents)) return 1;
spv_binary binary;
spv_diagnostic diagnostic = nullptr;
spv_context context = spvContextCreate(target_env);
spv_result_t error = spvTextToBinaryWithOptions(
context, contents.data(), contents.size(), options, &binary, &diagnostic);
spvContextDestroy(context);
if (error) {
spvDiagnosticPrint(diagnostic);
spvDiagnosticDestroy(diagnostic);
return error;
}
if (!WriteFile<uint32_t>(outFile.c_str(), "wb", binary->code,
binary->wordCount)) {
spvBinaryDestroy(binary);
return 1;
}
spvBinaryDestroy(binary);
return 0;
}
|
__label__pos
| 0.978435 |
Deprecated: Function eregi() is deprecated in /home/woarl/public_html/html/includes/globalHeaders.php on line 71
Season 1 - Pretty pictures
What is this session about?
I'm glad you asked! In this session, you will learn...
• How to put images onto pages
• Why images are not always a good thing
• When to use images and when not to
To view this page as a video, download this file (16.6mb), you'll need quicktime.
How do you put images onto a page?
Putting images onto a page is easy. Images are like a <br /> tag, they are just one tag with nothing in the middle. Yet, at the same time they're also like an <a> tag, they have a attribute (we need to let the computer know which image you want to use).
<img src="../../images/placeholders/100x100.png" alt="A placeholder image" width="100" height="100" />
Produces...
A placeholder image
So what do the properties do?
There are several properties in an <img> tag (as you probably just noticed).
Attribute Purpose
src The source of the image being used, works in the same way as a link
alt Says what the image is about, allows search engines to know and is crucial for sight-impaired users as they otherwise don't know what the image is
width The width of the image you want to display in pixels, does not have to be the same size as the image
height The height of the image you want to display in pixels, does not have to be the same size as the image
Width and Height
You can create an image and miss out the alt, width and height properties. Indeed, missing out the width and height attributes has no apparent effect. It does have an effect but not a very obvious one, specifying the correct height and width in HTML saves the browser time when loading and displaying the page.
What you should never, ever, never ever use the width and height for is to resize an image. Though the image will be displayed in a smaller size, the file size of the image will still be the same if you shrink the image and if you make it larger in the HTML, it will look ugly and horrible almost all the time. Rule of thumb, width and height should not be different from the actual width and height of the image.
Linking
Turning an image into a link isn't very hard, simply place the image inside the <a> tag as if it were a simply piece of text. Here's an example.
<a href="page/location.html" alt="This is a page, this is what it is about">
<img src="image/source.png" alt="This is an image, this is what it is about" width="100" height="100" />
</a>
When are images not good?
What you are reading right now is text. I could easily create a large image for this paragraph of text and it would look the same, however, there are several problems with this.
• Images take many times longer to load than paragraphs of text
• Paragraphs of text automatically resize with the browser window
• You can select parts of a paragraph and copy them into another program
• Images are harder to edit
• Linking parts of an image is much harder and it's not so easy to get the rollover effect you get with a normal link
The main problem with images has always been and will probably always be their file size. To use an analogy, a web page might be a parcel being sent through the post. The text on the page is akin to a written letter, small and cheap to send. The images however are more akin to a bag or marbles, they're much more expensive to send. Of course, sending a web-page doesn't cost money in the same way that a letter by post would, it does however cost time. Images take much longer to load than text does and as such you shouldn't go overboard with them.
When to use an Image
So, when shouldn't you use an image? Is there a quick and easy rule to success? No, there's not. However, if an image isn't needed, don't add it. All the diagrams I've used on this site have been used alongside the text, if yours do the same, odds are they're useful.
Google, Facebook and Apple all use images well and in different ways. Overall it's a matter of design which I must admit to not being overly skilled in (I just know some of the more obvious blunders).
preloadImage preloadImage preloadImage preloadImage preloadImage preloadImage preloadImage preloadImage
|
__label__pos
| 0.73473 |
Commit 9e7d4553 authored by Irene Y Zhang's avatar Irene Y Zhang
Browse files
adding some hints to lab 1 code
parent 712eaf09
......@@ -9,10 +9,21 @@ import "container/list"
// key to the Map function, as in the paper; only a value,
// which is a part of the input file contents
func Map(value string) *list.List {
// Note: The value argument holds one line of text from the file.
// You need to:
// (1) Split up the string into words, discarding any punctuation
// (2) Add each word to the list with a mapreduce.KeyValue struct
}
// iterate over list and add values
func Reduce(key string, values *list.List) string {
// Note:
// The key argument holds the key common too all values in the values argument
// The values argument is a list of mapreduce.KeyValue structs with the given key.
// You need to:
// (1) Reduce the all of the values in the values list
// (2) Return the reduced/summed up values as a string
}
// Can be run in 3 ways:
......@@ -20,17 +31,17 @@ func Reduce(key string, values *list.List) string {
// 2) Master (e.g., go run wc.go master x.txt localhost:7777)
// 3) Worker (e.g., go run wc.go worker localhost:7777 localhost:7778 &)
func main() {
if len(os.Args) != 4 {
fmt.Printf("%s: see usage comments in file\n", os.Args[0])
} else if os.Args[1] == "master" {
if os.Args[3] == "sequential" {
mapreduce.RunSingle(5, 3, os.Args[2], Map, Reduce)
} else {
mr := mapreduce.MakeMapReduce(5, 3, os.Args[2], os.Args[3])
// Wait until MR is done
<- mr.DoneChannel
}
} else {
mapreduce.RunWorker(os.Args[2], os.Args[3], Map, Reduce, 100)
}
if len(os.Args) != 4 {
fmt.Printf("%s: see usage comments in file\n", os.Args[0])
} else if os.Args[1] == "master" {
if os.Args[3] == "sequential" {
mapreduce.RunSingle(5, 3, os.Args[2], Map, Reduce)
} else {
mr := mapreduce.MakeMapReduce(5, 3, os.Args[2], os.Args[3])
// Wait until MR is done
<-mr.DoneChannel
}
} else {
mapreduce.RunWorker(os.Args[2], os.Args[3], Map, Reduce, 100)
}
}
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
__label__pos
| 0.996005 |
Home > service-is-programming, service-is-testing > PowerShell Script to convert your Testing Anywhere run logs into a Excel pivot table data source
PowerShell Script to convert your Testing Anywhere run logs into a Excel pivot table data source
1. If confronted with a sizable Testing Anywhere test script codebase which has been marginally, but not substantially enhanced/cleaned up in several years while producing a barrage of automation errors daily,
2. you may find that the run suite errors that Testing Anywhere logs automatically in its rlgx files are your best data source for monitoring and designing a plan of attack:
1. Any oft-failing scripts should be put last during the daily run? how about length script needs to run?
2. Any failing script parts could be modularized and during the daily run? rlgx-excel-pivot-scripts-avg-duration-percentage
3. any oft-failing scripts? E.g. here the top 8% of failing scripts have almost 30% of the errors. image
4. Any oft-failing approaches that might benefit from refactoring? Starting with which scripts? Main actions, then sub-actions:rlgx-excel-pivot-scripts-error-type-countrlgx-excel-pivot-scripts-error-type-count
5. etc.
3. Then this PowerShell script may help which
1. extracts the non binary <runlog> items out of the binary rlgx files,
2. and merges them into a single file
3. which it wraps with an XML declaration and root level node that Excel can work with.
add-content -value '' -path C:\td\testinganywhere\files\rlgx\all-a-rlgx.xml -Encoding UTF8 Get-childitem -path C:\td\testinganywhere\files\rlgx\arnold-pc1 |
? {$_.Extension -eq ".rlgx"} |
% { $file = convertto-string $_.FullName
$match = [regex]::Match($file,'\s+(.*)\s+',"SingleLine,IgnoreCase").value
add-content $match -path C:\td\testinganywhere\files\rlgx\all-a-rlgx.xml -Encoding UTF8 }
add-content '' -path C:\td\testinganywhere\files\rlgx\all-a-rlgx.xml -Encoding UTF8
1. Make this PowerShell script a Scheduled Task,
2. So that you can auto-update said XML which you made the data source for your Excel monitoring/planning work book.
1. The post-processing of the default error log messages that makes meaningful pivoting actually possible, is left as an exercise to the reader by Testing Anywhere Smiley .
1. No comments yet.
1. No trackbacks yet.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
%d bloggers like this:
|
__label__pos
| 0.646778 |
vootpool_foodies
what is ransomware? | Ransomware Prevention
what is ransomware? is the big question for today’s generation. In this post, I will tell you in detail about it & also tips for Ransomware Prevention…
What is Ransomware?
Ransomware is a type of malware that prevents or limits users from accessing their system, either by locking the system’s screen or by locking the users’ files unless a ransom is paid.
More modern families, collectively categorized as crypto-ransomware, encrypt certain file types on infected systems and forces users to pay the ransom through certain online payment methods to get a decrypt key
what is ransomware?
Simple ransomware may lock the system in a way which is not difficult for a knowledgeable person to reverse. More advanced malware encrypts the victim’s files, making them inaccessible, and demands a ransom payment to decrypt them.
The Ransomware may also encrypt the computer’s Master File Table (MFT) or the entire hard drive. Thus, this is a denial-of-access attack that prevents computer users from accessing files since it is intractable to decrypt the files without the decryption key.
These attacks are typically carried out using a Trojan that has a payload disguised as a legitimate file.
what is ransomware?
The History and Evolution of Ransomware
Early Years
Cases of this virus infection were first seen in Russia between 2005 – 2006. Trend Micro published a report on a case in 2006.
That involved a ransomware variant (detected as TROJ_CRYZIP.A) that zipped certain file types before overwriting the original files, leaving only the password-protected zip files in the user’s system.
what is ransomware?
In its earlier years, typically encrypted particular file types such as DOC, .XLS, .JPG, .ZIP, .PDF, and other commonly used file extensions.
In 2011, Trend Micro published a report on an SMS ransomware threat that asked users of infected systems to dial a premium SMS number. Detected as TROJ_RANSOM.
Another notable report involved a type that infects the Master Boot Record (MBR) of a vulnerable system, preventing the operating system from loading.
To do this, the malware copies the original MBR and overwrites it with malicious code. It then forces the system to restart so the infection takes effect and displays the notification (in Russian) once the system restarts.
Ransomware
Ransomware Prevention:
• Avoid opening unverified emails or clicking links embedded in them.
• Back up important files using the 3-2-1 rule—create 3 backup copies on 2 different media with 1 backup in a separate location.
• Regularly update software, programs, and applications to protect against the latest vulnerabilities.
For more information about technology click here .
Leave a Comment
Your email address will not be published. Required fields are marked *
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
__label__pos
| 0.575587 |
Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » What is A% of B
What is 240 percent of 7350?
240% of 7350 is 17640
Working out 240% of 7350
1. Write 240% as 240/100
2. Since, finding the fraction of a number is same as multiplying the fraction with the number, we have
240/100 of 7350 = 240/100 × 7350
3. Therefore, the answer is 17640
If you are using a calculator, simply enter 240÷100×7350 which will give you 17640 as the answer.
MathStep (Works offline)
Download our mobile app and learn how to work with percentages in your own time:
Android and iPhone/ iPad
More percentage problems:
Find another
What is % of
© everydaycalculation.com
|
__label__pos
| 0.871488 |
argon2kt
Introduction: An Android/Kotlin binding for the Argon2 hash
More: Author ReportBugs
Tags:
Android
Argon2Kt is a binding for the Argon2 password hash that allows to do memory-hard password hashing easily and securely on Android. Check out this blog post for an introduction to password-based key derivation on Android.
This library uses JNI to bridge JVM/C and allows relying solely on direct-allocated ByteBuffers (see below). Naturally, it comes with an extensive test coverage and a sample app.
Argon2Kt is licensed under the MIT license. See the LICENSE file in the root directory.
Quick start 👩💻 👨💻
Add the dependency to your gradle.build file:
implementation 'com.lambdapioneer.argon2kt:argon2kt:1.5.0'
Use the Argon2Kt class to hash and verify using Argon2:
// initialize Argon2Kt and load the native library
val argon2Kt = Argon2Kt()
// hash a password
val hashResult : Argon2KtResult = argon2Kt.hash(
mode = Argon2Mode.ARGON2_I,
password = passwordByteArray,
salt = saltByteArray,
tCostInIterations = 5,
mCostInKibibyte = 65536
)
println("Raw hash: ${hashResult.rawHashAsHexadecimal()}")
println("Encoded string: ${hashResult.encodedOutputAsString()}")
// verify a password against an encoded string representation
val verificationResult : Boolean = argon2Kt.verify(
mode = Argon2Mode.ARGON2_I,
encodedString = hashResult.encodedOutputAsString(),
password = passwordByteArray,
)
FAQ 🤔
How do I reduce the exposure of secrets in memory?
Internally, Argon2Kt uses direct-allocated ByteBuffers for passing around both secrets (e.g. password, hash), and outputs (e.g. raw hash).
In contrast to ByteArrays and Strings, direct-allocated ByteBuffers (usually) reside outside the JVM heap and maintain a fixed position. This allows easy passing between native libraries through the JVM world. For our purposes, it allows us to overwrite the content with confidence once we no longer need them. Therefore, using them is preferable.
Argon2Kt offers convenience methods to use ByteArrays and Strings instead. However, the JVM might move these in memory without overwriting the old location. Therefore, you can no longer make sure that the secrets are removed once they are no longer needed.
Can I use Argon2Kt in Java?
Of course. Checkout the SampleJavaClass.java source file for an example. Note that it is not included in the sample app APK although it compiles just fine.
I have problems with an UnsatisfiedLinkError in production. What can I do?
By default Argon2Kt uses the system's loader for .so files. However, for some models and configurations it is known to fail. You can use an alternative SoLoader such as ReLinker using the callback provided by the Argon2Kt constructor.
Contribute 👋
When contributing, please follow the following (common-sense) steps:
• Create an issue before you write any code. This allows to guide you in the right direction.
• If you are after a 1-5 line fix, you might ignore this.
• In the pull-request explain the high-level goal and your approach. That provides valuable context.
• Convince others (and yourself) that the change is safe and sound.
• Run ./gradlew connectedAndroidTest and manually test the APK in release configuration using ./gradlew installRelease.
Sample app 📱
The repository comes with a sample app that you can install both in debug and release configuration. Just run ./gradlew installDebug or ./gradlew installRelease respectively.
Reference/BibTex 📚
If you want to reference Argon2Kt in documentation or articles, feel free to use this suggested BibTex snippet:
@misc{hugenroth2019argon2kt,
author={{Daniel Hugenroth}},
title={Argon2Kt},
year={2019},
url={https://github.com/lambdapioneer/argon2kt},
}
Apps
About Me
GitHub: Trinea
Facebook: Dev Tools
|
__label__pos
| 0.940219 |
开始使用
使用集合让一切井井有条 根据您的偏好保存内容并对其进行分类。
借助 AdMob 中介功能，您可以在您的应用中投放多个来源（包括 AdMob 广告联盟、第三方广告联盟和 AdMob 广告系列）的广告。AdMob 中介会将广告请求发送至多个广告联盟，以确保您找到最合适的广告联盟来投放广告，有助于最大限度提高您的填充率，增加您的收入。案例研究
前提条件
在为广告格式集成中介功能之前，您需要先将该广告格式集成到您的应用中：
刚开始接触中介？请参阅 AdMob 中介概览
对于出价：Google 移动广告 SDK 7.53.1或更高版本。
初始化移动广告 SDK
快速入门指南介绍了如何初始化移动广告 SDK。在初始化调用期间，中介和出价适配器也会初始化。在加载广告之前，请等待初始化完成，以确保每个广告联盟都充分参与第一次广告请求。
以下示例代码展示了如何在发出广告请求之前检查每个适配器的初始化状态。
Swift
import GoogleMobileAds
@UIApplicationMain
class AppDelegate: UIResponder, UIApplicationDelegate {
func application(_ application: UIApplication,
didFinishLaunchingWithOptions launchOptions: [UIApplicationLaunchOptionsKey: Any]?) -> Bool {
let ads = GADMobileAds.sharedInstance()
ads.start { status in
// Optional: Log each adapter's initialization latency.
let adapterStatuses = status.adapterStatusesByClassName
for adapter in adapterStatuses {
let adapterStatus = adapter.value
NSLog("Adapter Name: %@, Description: %@, Latency: %f", adapter.key,
adapterStatus.description, adapterStatus.latency)
}
// Start loading ads here...
}
return true
}
}
Objective-C
@import GoogleMobileAds;
@implementation AppDelegate
- (BOOL)application:(UIApplication *)application
didFinishLaunchingWithOptions:(NSDictionary *)launchOptions {
GADMobileAds *ads = [GADMobileAds sharedInstance];
[ads startWithCompletionHandler:^(GADInitializationStatus *status) {
// Optional: Log each adapter's initialization latency.
NSDictionary *adapterStatuses = [status adapterStatusesByClassName];
for (NSString *adapter in adapterStatuses) {
GADAdapterStatus *adapterStatus = adapterStatuses[adapter];
NSLog(@"Adapter Name: %@, Description: %@, Latency: %f", adapter,
adapterStatus.description, adapterStatus.latency);
}
// Start loading ads here...
}];
return YES;
}
@end
了解哪个广告联盟胜出
每个广告格式类都有一个包含 adNetworkClassNameGADResponseInfo 属性，该属性会返回当前广告的广告联盟的类名称。只有在广告成功加载后，adNetworkClassName 才会具有值。下面的代码展示了如何获取横幅广告的上述信息。
Swift
func adViewDidReceiveAd(_ bannerView: GADBannerView) {
print("Banner adapter class name: \(bannerView.responseInfo.adNetworkClassName)")
}
Objective-C
- (void)adViewDidReceiveAd:(GADBannerView *)bannerView {
NSLog(@"Banner adapter class name: %@", bannerView.responseInfo.adNetworkClassName);
}
如需了解详情，请参阅检索有关广告响应的信息
请确保在中介服务所用的横幅广告单元的所有第三方广告联盟界面中停用刷新功能。 AdMob 这可防止重复刷新，因为 AdMob 还会根据横幅广告单元的刷新频率触发刷新。
激励广告中介
我们建议您通过在界面中设置奖励值来替换所有默认的奖励值。 AdMob 为此，请选中 应用于中介组中的所有广告联盟 复选框，使奖励在所有广告联盟中保持一致。某些广告联盟根本不提供奖励值或类型。通过替换奖励值，无论由哪个广告联盟投放广告，奖励都保持一致。
如需详细了解如何在 AdMob 界面中设置奖励值，请参阅创建激励广告单元
原生广告中介
以下是实现原生中介时可以考虑的一些最佳做法。
原生广告展示政策
每个广告网络都有自己的政策。使用中介功能时，请务必注意，您的应用仍需要遵守提供广告的参与中介广告联盟的政策。
避免在发出请求时使用 GADMultipleAdsAdLoaderOptions
针对多个原生广告的请求仅会投放 Google 广告。多个原生广告功能不支持中介。
CCPA 和 GDPR
如果您需要遵守《加州消费者隐私法案》(CCPA)《一般数据保护条例》(GDPR)，请按照 CCPA 设置GDPR 设置中的步骤操作，将您的中介合作伙伴添加到 AdMob “隐私权和消息”的 CCPA 或 GDPR 广告合作伙伴列表中。否则，可能会导致合作伙伴无法在您的应用中投放广告。
详细了解如何启用 CCPA“受限的数据处理”通过 Google User Messaging Platform (UMP) SDK 征求 GDPR 的同意
|
__label__pos
| 0.618886 |
Member Avatar
I see in phpbb template system it has <!-- PHP --> code <!-- ENDPHP --> tags in template and you can include php code inside them <!-- PHP --> = start tag of php <?php <!-- ENDPHP --> = ?> I want to use something else in mustache php, like: `{{php}} {{/php}}` is there any chance to do that?
+0 forum 0
Member Avatar
HI Now i'm upgrading my application from icefaces to HTML 5. So i need to know the alternate tag for the following 1. ice:outputConnectionStatus 2. ice: inputFile 3. ice: SelectInputDate 4. ice: PanelPopup Please help me out to fix this error..........
+0 forum 0
Member Avatar
hello, i just want to know what is the need that we make a custom tag...i know that its for reusebility..but i want some examples where should i use them. thanks
+0 forum 0
Member Avatar
HI! I am working with an image tagger system.. Im done reading the file's properties.. then when i go to code for keywords.. an error exist saying that Retrieving the COM class factory for component with CLSID {58968145-CF05-4341-995F-2EE093F6ABA3} failed due to the following error: 80040154. I Already added the DSO file.dll and the class library Imports System.IO an error exist in the BOld text below. [CODE]Dim oSummProps As DSOFile.SummaryProperties Dim strTmp As String = String.Empty Dim oDocument As New DSOFile.OleDocumentPropertiesClass() oDocument.Open("c:\BSabellaRabano10151929.jpg", False, DSOFile.dsoFileOpenOptions.dsoOptionUseMBCStringsForNewSets) oDocument.SummaryProperties.Title = txtTitle.Text oDocument.SummaryProperties.Comments = txtComments.Text() oDocument.SummaryProperties.Keywords = txtKeywords.Text oDocument.SummaryProperties.Subject = txtSubject.Text oDocument.Save()[/CODE]
+0 forum 0
The End.
|
__label__pos
| 0.644582 |
second speech recognition training
Discussion in 'Computer Support' started by Eli Aran, Dec 19, 2004.
1. Eli Aran
Eli Aran Guest
xp pro 256 Meg Ram 2.4 Ghz CPU
i have a voice recognition program called Nitrous Voice Flux 2.0
i found the voice training button here:
start-> controle panel-> speech-> "other" tab -> SAPI 4 Control Panel
(button) -> speech input-Microsoft Speech Recognition Engine 4.0 English.
when i clicked on the later, i got the "Training" button at the bottom of
the window to show up again. this is where i did my training.
my question is: if i do a second (and third etc) training for my voice
recognition
will this improve the recognition of my voice and words or will it replace
the first (or previous) training session completely?
is doing several recognition trainings the best means to get the app to
better
understand my words or is the another (better?) way or program that does
that?
Eli Aran, Dec 19, 2004
#1
1. Advertisements
Want to reply to this thread or ask your own question?
It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
1. Jeff M. Ingram
Replies:
0
Views:
791
Jeff M. Ingram
Jan 19, 2004
2. Eli Aran
speech recognition tab missing
Eli Aran, Dec 19, 2004, in forum: Computer Support
Replies:
3
Views:
8,273
Eli Aran
Dec 19, 2004
3. Chameleon
Replies:
0
Views:
642
Chameleon
Apr 14, 2006
4. John
Replies:
2
Views:
1,223
5. Au79
Replies:
0
Views:
600
Loading...
|
__label__pos
| 0.978554 |
One proposal for plasma cash with coin splitting and merging
Expanding on a post I made in the Plasma Cash thread, and after reading the discussion there.
Coin IDs are variable-length bitstrings, which are encoded into a fix-length bitstring by prepending the unique string that matches the regex 0*1; for example, assuming encoding to uint8, “0” is encoded as “00000010”, “1” is encoded as “00000011”, “110” is encoded as “00001110”. there is a global constant K and the denomination of a coin with coinid of length k is 2^(K-k).
There are three types of transactions:
1. a single coin (with coin id X) changes owner
2. two coins with coin ids X0 and X1 merge into a coin with id X
3. a coin with id X splits into coins with id X0 and X1
Block headers commit to a (binary, not-necessarily-complete) merkle tree of transactions. each transaction is labelled by X and transactions must be stored in the merkle tree at position X. we say that two coins “intersect” if one of their coin ids is a prefix of the other (intuition: we can view a coin as a set of the smallest coins into which it can be split (e.g.: maximum coin id length is 7, then consider “11111” as the union of coins {“1111100”, “1111101”, “1111110”, “1111111”}), and coin intersection reduces to set intersection, equivalently set containment). note that by the consturction of the transaction tree, a commitment that no transactions includes coinid P implies that no transaction include coinid PB for all bitstrings B.
The root plasma contract stores the subset of minimal coins that have been deposited, and no valid transaction can change this subset. if an invalid transaction with id X begins exit, every honest coinholder that holds a coin Y that intersects X knows and can stop the exit.
An assumption here is that users will find it mutually beneficial to swap coins of the same denomination with each other in such a way that they end up with coins that can be merged.
Why is it necessary that only adjacent coins merge? What do you think of Plasma Cash: Plasma with much less per-user data checking - #53 by danrobinson?
Quibble: in Plasma Cash, you don’t have to watch for invalid transactions and exit if you see one. You can just lazily wait for any exit attempt for any coin that intersects with yours, and challenge it then.
right, you have to monitor the chain for intersecting invalid transactions, but when you see one you don’t have to exit. in my mind the immediate-exit and lazily-exit protocols are basically equivalent.
Why is it necessary that only adjacent coins merge?
mainly because the informal safety proof I used to reason that my design is correct doesn’t work if non-adjacent coins can merge; of course, a different proof might be used for some other design (such as yours) which allows any coins to merge, but I’d have to think about it, and I’ll comment on that thread.
Continuing to quibble—you don’t have to monitor the chain at all. You only need to hold on to your coin, and respond to any attempt to withdraw your token ID by revealing your latest transaction. (If you want to send the coin on the Plasma chain, you do need to get that subsequent data from someone, so you can provide a proof to the recipient. In my opinion, it actually makes the most sense for the chain operator to just keep all this data and provide it to the recipient, since they are trusted for on-chain liveness anyway).
you are correct about that, I’ve edited my post :slight_smile:
|
__label__pos
| 0.71633 |
/[gentoo-x86]/eclass/vdr-plugin.eclass
Gentoo
Diff of /eclass/vdr-plugin.eclass
Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch
Revision 1.8 Revision 1.78
1# Copyright 1999-2005 Gentoo Foundation 1# Copyright 1999-2012 Gentoo Foundation
2# Distributed under the terms of the GNU General Public License v2 2# Distributed under the terms of the GNU General Public License v2
3# $Header: /var/cvsroot/gentoo-x86/eclass/Attic/vdr-plugin.eclass,v 1.8 2005/11/20 14:10:05 zzam Exp $ 3# $Header: /var/cvsroot/gentoo-x86/eclass/Attic/vdr-plugin.eclass,v 1.78 2012/01/15 17:11:08 idl0r Exp $
4# 4#
5# Author: 5# Author:
6# Matthias Schwarzott <[email protected]> 6# Matthias Schwarzott <[email protected]>
7# Joerg Bornkessel <[email protected]>
7 8
8# vdr-plugin.eclass 9# vdr-plugin.eclass
9# 10#
10# eclass to create ebuilds for vdr plugins 11# eclass to create ebuilds for vdr plugins
11# 12#
12 13
13# Example ebuild (vdr-femon): 14# Example ebuild (basic version without patching):
14# 15#
16# EAPI="2"
15# inherit vdr-plugin 17# inherit vdr-plugin
16# IUSE="" 18# IUSE=""
17# SLOT="0" 19# SLOT="0"
18# DESCRIPTION="vdr Plugin: DVB Frontend Status Monitor (signal strengt/noise)" 20# DESCRIPTION="vdr Plugin: DVB Frontend Status Monitor (signal strengt/noise)"
19# HOMEPAGE="http://www.saunalahti.fi/~rahrenbe/vdr/femon/" 21# HOMEPAGE="http://www.saunalahti.fi/~rahrenbe/vdr/femon/"
20# SRC_URI="http://www.saunalahti.fi/~rahrenbe/vdr/femon/files/${P}.tgz" 22# SRC_URI="http://www.saunalahti.fi/~rahrenbe/vdr/femon/files/${P}.tgz"
21# LICENSE="GPL-2" 23# LICENSE="GPL-2"
22# KEYWORDS="~x86" 24# KEYWORDS="~x86"
23# DEPEND=">=media-video/vdr-1.3.27" 25# DEPEND=">=media-video/vdr-1.6.0"
24# 26#
25# 27#
26 28
27# There are some special files in ${FILESDIR} which get installed when 29# For patching you should modify src_prepare phase:
28# they exist: 30#
31# src_prepare() {
32# epatch "${FILESDIR}"/${P}-xxx.patch
33# vdr-plugin_src_prepare
34# }
29 35
30# ${FILESDIR}/confd-${PV} or ${FILESDIR}/confd: 36# Installation of a config file for the plugin
37#
38# If ${VDR_CONFD_FILE} is set install this file
39# else install ${FILESDIR}/confd if it exists.
40
31# The first matching is installed under /etc/conf.d/vdr.${VDRPLUGIN} 41# Gets installed as /etc/conf.d/vdr.${VDRPLUGIN}.
32# (in example vdr-femon this would be /etc/conf.d/vdr.femon) 42# For the plugin vdr-femon this would be /etc/conf.d/vdr.femon
33#
34# Everything put in variable _EXTRAOPTS is appended to the command line of
35# the plugin.
36 43
37 44
38# ${FILESDIR}/rc-addon-${PV}.sh or ${FILESDIR}/rc-addon.sh: 45# Installation of an rc-addon file for the plugin
39# The first matching is installed under /usr/lib/vdr/rcscript/plugin-${VDRPLUGIN}.sh 46#
47# If ${VDR_RCADDON_FILE} is set install this file
48# else install ${FILESDIR}/rc-addon.sh if it exists.
49#
50# Gets installed under ${VDR_RC_DIR}/plugin-${VDRPLUGIN}.sh
40# (in example vdr-femon this would be /usr/lib/vdr/rcscript/plugin-femon.sh) 51# (in example vdr-femon this would be /usr/share/vdr/rcscript/plugin-femon.sh)
41# 52#
42# This file is sourced by the startscript when plugin is activated in /etc/conf.d/vdr 53# This file is sourced by the startscript when plugin is activated in /etc/conf.d/vdr
43# It could be used for special startup actions for this plugins, or to create the 54# It could be used for special startup actions for this plugins, or to create the
44# plugin command line options from a nicer version of a conf.d file. 55# plugin command line options from a nicer version of a conf.d file.
45 56
57# HowTo use own local patches; Example
58#
59# Add to your /etc/make.conf:
60# VDR_LOCAL_PATCHES_DIR="/usr/local/patch"
61#
62# Add two DIR's in your local patch dir, ${PN}/${PV},
63# e.g for vdr-burn-0.1.0 should be:
64# /usr/local/patch/vdr-burn/0.1.0/
65#
66# all patches which ending on diff or patch in this DIR will automatically applied
67#
68
46inherit eutils flag-o-matic 69inherit base multilib eutils flag-o-matic
70
71if ! has "${EAPI:-0}" 0 1 2 3 4; then
72 die "API of vdr-plugin.eclass in EAPI=\"${EAPI}\" not established"
73fi
74
75IUSE=""
47 76
48# Name of the plugin stripped from all vdrplugin-, vdr- and -cvs pre- and postfixes 77# Name of the plugin stripped from all vdrplugin-, vdr- and -cvs pre- and postfixes
49VDRPLUGIN="${PN/#vdrplugin-/}" 78VDRPLUGIN="${PN/#vdrplugin-/}"
50VDRPLUGIN="${VDRPLUGIN/#vdr-/}" 79VDRPLUGIN="${VDRPLUGIN/#vdr-/}"
51VDRPLUGIN="${VDRPLUGIN/%-cvs/}" 80VDRPLUGIN="${VDRPLUGIN/%-cvs/}"
54 83
55# works in most cases 84# works in most cases
56S="${WORKDIR}/${VDRPLUGIN}-${PV}" 85S="${WORKDIR}/${VDRPLUGIN}-${PV}"
57 86
58# depend on headers for DVB-driver 87# depend on headers for DVB-driver
59RDEPEND="" 88COMMON_DEPEND=">=media-tv/gentoo-vdr-scripts-0.4.2"
60DEPEND="|| ( 89
61 >=sys-kernel/linux-headers-2.6.11-r2 90DEPEND="${COMMON_DEPEND}
62 media-tv/linuxtv-dvb 91 media-tv/linuxtv-dvb-headers"
63 )" 92RDEPEND="${COMMON_DEPEND}
93 >=app-admin/eselect-vdr-0.0.2"
64 94
65# Where should the plugins live in the filesystem 95# this is a hack for ebuilds like vdr-xineliboutput that want to
66VDR_PLUGIN_DIR="/usr/lib/vdr/plugins" 96# conditionally install a vdr-plugin
67 97if [[ "${GENTOO_VDR_CONDITIONAL:-no}" = "yes" ]]; then
68VDR_RC_DIR="/usr/lib/vdr/rcscript" 98 # make DEPEND conditional
69 99 IUSE="${IUSE} vdr"
70# Pathes to includes 100 DEPEND="vdr? ( ${DEPEND} )"
71VDR_INCLUDE_DIR="/usr/include" 101 RDEPEND="vdr? ( ${RDEPEND} )"
72DVB_INCLUDE_DIR="/usr/include"
73
74
75# this code is from linux-mod.eclass
76update_vdrplugindb() {
77 local VDRPLUGINDB_DIR=${ROOT}/var/lib/vdrplugin-rebuild/
78
79 if [[ ! -f ${VDRPLUGINDB_DIR}/vdrplugindb ]]; then
80 [[ ! -d ${VDRPLUGINDB_DIR} ]] && mkdir -p ${VDRPLUGINDB_DIR}
81 touch ${VDRPLUGINDB_DIR}/vdrplugindb
82 fi 102fi
83 if [[ -z $(grep ${CATEGORY}/${PN}-${PVR} ${VDRPLUGINDB_DIR}/vdrplugindb) ]]; then
84 einfo "Adding plugin to vdrplugindb."
85 echo "a:1:${CATEGORY}/${PN}-${PVR}" >> ${VDRPLUGINDB_DIR}/vdrplugindb
86 fi
87}
88 103
89remove_vdrplugindb() { 104# New method of storing plugindb
105# Called from src_install
106# file maintained by normal portage-methods
107create_plugindb_file() {
90 local VDRPLUGINDB_DIR=${ROOT}/var/lib/vdrplugin-rebuild/ 108 local NEW_VDRPLUGINDB_DIR=/usr/share/vdr/vdrplugin-rebuild/
109 local DB_FILE="${NEW_VDRPLUGINDB_DIR}/${CATEGORY}-${PF}"
110 insinto "${NEW_VDRPLUGINDB_DIR}"
91 111
92 if [[ -n $(grep ${CATEGORY}/${PN}-${PVR} ${VDRPLUGINDB_DIR}/vdrplugindb) ]]; then 112# BUG: portage-2.1.4_rc9 will delete the EBUILD= line, so we cannot use this code.
93 einfo "Removing ${CATEGORY}/${PN}-${PVR} from vdrplugindb." 113# cat <<-EOT > "${D}/${DB_FILE}"
94 sed -ie "/.*${CATEGORY}\/${P}.*/d" ${VDRPLUGINDB_DIR}/vdrplugindb 114# VDRPLUGIN_DB=1
95 fi 115# CREATOR=ECLASS
116# EBUILD=${CATEGORY}/${PN}
117# EBUILD_V=${PVR}
118# EOT
119 {
120 echo "VDRPLUGIN_DB=1"
121 echo "CREATOR=ECLASS"
122 echo "EBUILD=${CATEGORY}/${PN}"
123 echo "EBUILD_V=${PVR}"
124 echo "PLUGINS=\"$@\""
125 } > "${D}/${DB_FILE}"
96} 126}
97 127
98vdr-plugin_pkg_setup() { 128# Delete files created outside of vdr-plugin.eclass
99 # -fPIC is needed for shared objects on some platforms (amd64 and others) 129# vdrplugin-rebuild.ebuild converted plugindb and files are
100 append-flags -fPIC 130# not deleted by portage itself - should only be needed as
131# long as not every system has switched over to
132# vdrplugin-rebuild-0.2 / gentoo-vdr-scripts-0.4.2
133delete_orphan_plugindb_file() {
134 #elog Testing for orphaned plugindb file
135 local NEW_VDRPLUGINDB_DIR=/usr/share/vdr/vdrplugin-rebuild/
136 local DB_FILE="${ROOT}/${NEW_VDRPLUGINDB_DIR}/${CATEGORY}-${PF}"
101 137
102 VDRVERSION=$(awk -F'"' '/VDRVERSION/ {print $2}' /usr/include/vdr/config.h) 138 # file exists
103 einfo "Building ${PF} against vdr-${VDRVERSION}" 139 [[ -f ${DB_FILE} ]] || return
104}
105 140
106vdr-plugin_src_unpack() { 141 # will portage handle the file itself
107 [ -z "$1" ] && vdr-plugin_src_unpack unpack patchmakefile 142 if grep -q CREATOR=ECLASS "${DB_FILE}"; then
143 #elog file owned by eclass - don't touch it
144 return
145 fi
108 146
109 while [ "$1" ]; do 147 elog "Removing orphaned plugindb-file."
148 elog "\t#rm ${DB_FILE}"
149 rm "${DB_FILE}"
150}
110 151
111 case "$1" in
112 unpack)
113 unpack ${A}
114 ;;
115 patchmakefile)
116 cd ${S}
117 152
118 ebegin "Patching Makefile" 153create_header_checksum_file()
119 sed -i.orig Makefile \ 154{
120 -e "s:^VDRDIR.*$:VDRDIR = ${VDR_INCLUDE_DIR}:" \ 155 # Danger: Not using $ROOT here, as compile will also not use it !!!
121 -e "s:^DVBDIR.*$:DVBDIR = ${DVB_INCLUDE_DIR}:" \ 156 # If vdr in $ROOT and / differ, plugins will not run anyway
122 -e "s:^LIBDIR.*$:LIBDIR = ${S}:" \
123 -e "s:^TMPDIR.*$:TMPDIR = ${T}:" \
124 -e 's:^CXXFLAGS:#CXXFLAGS:' \
125 -e 's:-I$(VDRDIR)/include:-I$(VDRDIR):' \
126 -e 's:-I$(DVBDIR)/include:-I$(DVBDIR):' \
127 -e 's:-I$(VDRDIR) -I$(DVBDIR):-I$(DVBDIR) -I$(VDRDIR):' \
128 -e 's:$(VDRDIR)/\(config.h\|Make.config\):$(VDRDIR)/vdr/\1:'
129 eend $?
130 ;;
131 esac
132 157
133 shift 158 local CHKSUM="header-md5-vdr"
159
160 if [[ -f ${VDR_CHECKSUM_DIR}/header-md5-vdr ]]; then
161 cp "${VDR_CHECKSUM_DIR}/header-md5-vdr" "${CHKSUM}"
162 elif type -p md5sum >/dev/null 2>&1; then
163 (
164 cd "${VDR_INCLUDE_DIR}"
165 md5sum *.h libsi/*.h|LC_ALL=C sort --key=2
166 ) > "${CHKSUM}"
167 else
168 die "Could not create md5 checksum of headers"
169 fi
170
171 insinto "${VDR_CHECKSUM_DIR}"
172 local p_name
173 for p_name; do
174 newins "${CHKSUM}" "header-md5-${p_name}"
134 done 175 done
135} 176}
136 177
178fix_vdr_libsi_include()
179{
180 #einfo "Fixing include of libsi-headers"
181 local f
182 for f; do
183 sed -i "${f}" \
184 -e '/#include/s:"\(.*libsi.*\)":<\1>:' \
185 -e '/#include/s:<.*\(libsi/.*\)>:<vdr/\1>:'
186 done
187}
188
189vdr_patchmakefile() {
190 einfo "Patching Makefile"
191 [[ -e Makefile ]] || die "Makefile of plugin can not be found!"
192 cp Makefile "${WORKDIR}"/Makefile.before
193
194 # plugin makefiles use VDRDIR in strange ways
195 # assumptions:
196 # 1. $(VDRDIR) contains Make.config
197 # 2. $(VDRDIR) contains config.h
198 # 3. $(VDRDIR)/include/vdr contains the headers
199 # 4. $(VDRDIR) contains main vdr Makefile
200 # 5. $(VDRDIR)/locale exists
201 # 6. $(VDRDIR) allows to access vdr source files
202 #
203 # We only have one directory (for now /usr/include/vdr),
204 # that contains vdr-headers and Make.config.
205 # To satisfy 1-3 we do this:
206 # Set VDRDIR=/usr/include/vdr
207 # Set VDRINCDIR=/usr/include
208 # Change $(VDRDIR)/include to $(VDRINCDIR)
209
210 sed -i Makefile \
211 -e "s:^VDRDIR.*$:VDRDIR = ${VDR_INCLUDE_DIR}:" \
212 -e "/^VDRDIR/a VDRINCDIR = ${VDR_INCLUDE_DIR%/vdr}" \
213 -e '/VDRINCDIR.*=/!s:$(VDRDIR)/include:$(VDRINCDIR):' \
214 \
215 -e 's:-I$(DVBDIR)/include::' \
216 -e 's:-I$(DVBDIR)::'
217
218 # maybe needed for multiproto:
219 #sed -i Makefile \
220 # -e "s:^DVBDIR.*$:DVBDIR = ${DVB_INCLUDE_DIR}:" \
221 # -e 's:-I$(DVBDIR)/include:-I$(DVBDIR):'
222
223 if ! grep -q APIVERSION Makefile; then
224 ebegin " Converting to APIVERSION"
225 sed -i Makefile \
226 -e 's:^APIVERSION = :APIVERSION ?= :' \
227 -e 's:$(LIBDIR)/$@.$(VDRVERSION):$(LIBDIR)/$@.$(APIVERSION):' \
228 -e '/VDRVERSION =/a\APIVERSION = $(shell sed -ne '"'"'/define APIVERSION/s/^.*"\\(.*\\)".*$$/\\1/p'"'"' $(VDRDIR)/config.h)'
229 eend $?
230 fi
231
232 # Correcting Compile-Flags
233 # Do not overwrite CXXFLAGS, add LDFLAGS if missing
234 sed -i Makefile \
235 -e '/^CXXFLAGS[[:space:]]*=/s/=/?=/' \
236 -e '/LDFLAGS/!s:-shared:$(LDFLAGS) -shared:'
237
238 # Disabling file stripping, useful for debugging
239 sed -i Makefile \
240 -e '/@.*strip/d' \
241 -e '/strip \$(LIBDIR)\/\$@/d' \
242 -e 's/STRIP.*=.*$/STRIP = true/'
243
244 # Use a file instead of a variable as single-stepping via ebuild
245 # destroys environment.
246 touch "${WORKDIR}"/.vdr-plugin_makefile_patched
247}
248
249vdr_add_local_patch() {
250 if test -d "${VDR_LOCAL_PATCHES_DIR}/${PN}"; then
251 echo
252 einfo "Applying local patches"
253 for LOCALPATCH in "${VDR_LOCAL_PATCHES_DIR}/${PN}/${PV}"/*.{diff,patch}; do
254 test -f "${LOCALPATCH}" && epatch "${LOCALPATCH}"
255 done
256 fi
257}
258
259vdr_has_gettext() {
260 has_version ">=media-video/vdr-1.5.7"
261}
262
263plugin_has_gettext() {
264 [[ -d po ]]
265}
266
267vdr_i18n_convert_to_gettext() {
268 if has_version ">=media-video/vdr-1.7.22"; then
269 local i18n_tool="${ROOT}/usr/share/vdr/bin/i18n-to-gettext"
270 else
271 local i18n_tool="${ROOT}/usr/share/vdr/bin/i18n-to-gettext.pl"
272 fi
273
274 if [[ ${NO_GETTEXT_HACK} == "1" ]]; then
275 ewarn "Conversion to gettext disabled in ebuild"
276 return 1
277 fi
278
279 if [[ ! -x ${i18n_tool} ]]; then
280 eerror "Missing ${i18n_tool}"
281 eerror "Please re-emerge vdr"
282 die "Missing ${i18n_tool}"
283 fi
284
285 ebegin "Auto converting translations to gettext"
286 # call i18n-to-gettext tool
287 # take all texts missing tr call into special file
288 "${i18n_tool}" 2>/dev/null \
289 |sed -e '/^"/!d' \
290 -e '/^""$/d' \
291 -e 's/\(.*\)/trNOOP(\1)/' \
292 > dummy-translations-trNOOP.c
293
294 # if there were untranslated texts just run it again
295 # now the missing calls are listed in
296 # dummy-translations-trNOOP.c
297 if [[ -s dummy-translations-trNOOP.c ]]; then
298 "${i18n_tool}" &>/dev/null
299 fi
300
301 # now use the modified Makefile
302 if [[ -f Makefile.new ]]; then
303 mv Makefile.new Makefile
304 eend 0 ""
305 else
306 eend 1 "Conversion to gettext failed. Plugin needs fixing."
307 return 1
308 fi
309}
310
311vdr_i18n_disable_gettext() {
312 #einfo "Disabling gettext support in plugin"
313
314 # Remove i18n Target if using older vdr
315 sed -i Makefile \
316 -e '/^all:/s/ i18n//'
317}
318
319vdr_i18n() {
320 if vdr_has_gettext; then
321 #einfo "VDR has gettext support"
322 if plugin_has_gettext; then
323 #einfo "Plugin has gettext support, fine"
324 if [[ ${NO_GETTEXT_HACK} == "1" ]]; then
325 ewarn "Please remove unneeded NO_GETTEXT_HACK from ebuild."
326 fi
327 else
328 vdr_i18n_convert_to_gettext
329 if [[ $? != 0 ]]; then
330 eerror ""
331 eerror "Plugin will have only english OSD texts"
332 eerror "it needs manual fixing."
333 fi
334 fi
335 else
336 #einfo "VDR has no gettext support"
337 if plugin_has_gettext; then
338 vdr_i18n_disable_gettext
339 fi
340 fi
341}
342
137vdr-plugin_copy_source_tree() { 343vdr-plugin_copy_source_tree() {
344 pushd . >/dev/null
138 cp -r ${S} ${T}/source-tree 345 cp -r "${S}" "${T}"/source-tree
139 cd ${T}/source-tree 346 cd "${T}"/source-tree
140 mv Makefile.orig Makefile 347 cp "${WORKDIR}"/Makefile.before Makefile
348 # TODO: Fix this, maybe no longer needed
141 sed -i Makefile \ 349 sed -i Makefile \
142 -e "s:^DVBDIR.*$:DVBDIR = ${DVB_INCLUDE_DIR}:" \ 350 -e "s:^DVBDIR.*$:DVBDIR = ${DVB_INCLUDE_DIR}:" \
143 -e 's:^CXXFLAGS:#CXXFLAGS:' \ 351 -e 's:^CXXFLAGS:#CXXFLAGS:' \
144 -e 's:-I$(DVBDIR)/include:-I$(DVBDIR):' \ 352 -e 's:-I$(DVBDIR)/include:-I$(DVBDIR):' \
145 -e 's:-I$(VDRDIR) -I$(DVBDIR):-I$(DVBDIR) -I$(VDRDIR):' 353 -e 's:-I$(VDRDIR) -I$(DVBDIR):-I$(DVBDIR) -I$(VDRDIR):'
354 popd >/dev/null
146} 355}
147 356
148vdr-plugin_install_source_tree() { 357vdr-plugin_install_source_tree() {
149 einfo "Installing sources" 358 einfo "Installing sources"
150 destdir=${VDRSOURCE_DIR}/vdr-${VDRVERSION}/PLUGINS/src/${VDRPLUGIN} 359 destdir="${VDRSOURCE_DIR}/vdr-${VDRVERSION}/PLUGINS/src/${VDRPLUGIN}"
151 insinto ${destdir}-${PV} 360 insinto "${destdir}-${PV}"
152 doins -r ${T}/source-tree/* 361 doins -r "${T}"/source-tree/*
153 362
154 dosym ${VDRPLUGIN}-${PV} ${destdir} 363 dosym "${VDRPLUGIN}-${PV}" "${destdir}"
155} 364}
156 365
366vdr-plugin_print_enable_command() {
367 local p_name c=0 l=""
368 for p_name in ${vdr_plugin_list}; do
369 c=$(( c+1 ))
370 l="$l ${p_name#vdr-}"
371 done
372
373 elog
374 case $c in
375 1) elog "Installed plugin${l}" ;;
376 *) elog "Installed $c plugins:${l}" ;;
377 esac
378 elog "To activate a plugin execute this command:"
379 elog "\teselect vdr-plugin enable <plugin_name> ..."
380 elog
381}
382
383has_vdr() {
384 [[ -f "${VDR_INCLUDE_DIR}"/config.h ]]
385}
386
387## exported functions
388
389vdr-plugin_pkg_setup() {
390 # -fPIC is needed for shared objects on some platforms (amd64 and others)
391 append-flags -fPIC
392
393 # Plugins need to be compiled with position independent code, otherwise linking
394 # VDR against it will fail
395 if has_version ">=media-video/vdr-1.7.13"; then
396 append-flags -D_FILE_OFFSET_BITS=64 -D_LARGEFILE_SOURCE -D_LARGEFILE64_SOURCE
397 fi
398
399 # Where should the plugins live in the filesystem
400 VDR_PLUGIN_DIR="/usr/$(get_libdir)/vdr/plugins"
401 VDR_CHECKSUM_DIR="${VDR_PLUGIN_DIR%/plugins}/checksums"
402
403 # was /usr/lib/... some time ago
404 # since gentoo-vdr-scripts-0.3.6 it works with /usr/share/...
405 VDR_RC_DIR="/usr/share/vdr/rcscript"
406
407 # Pathes to includes
408 VDR_INCLUDE_DIR="/usr/include/vdr"
409 DVB_INCLUDE_DIR="/usr/include"
410
411 TMP_LOCALE_DIR="${WORKDIR}/tmp-locale"
412 if has_version ">=media-video/vdr-1.6.0_p2-r7"; then
413 LOCDIR="/usr/share/locale"
414 else
415 LOCDIR="/usr/share/vdr/locale"
416 fi
417
418 if ! has_vdr; then
419 # set to invalid values to detect abuses
420 VDRVERSION="eclass_no_vdr_installed"
421 APIVERSION="eclass_no_vdr_installed"
422
423 if [[ "${GENTOO_VDR_CONDITIONAL:-no}" = "yes" ]] && ! use vdr; then
424 einfo "VDR not found!"
425 else
426 # if vdr is required
427 die "VDR not found!"
428 fi
429 return
430 fi
431
432 VDRVERSION=$(awk -F'"' '/define VDRVERSION/ {print $2}' "${VDR_INCLUDE_DIR}"/config.h)
433 APIVERSION=$(awk -F'"' '/define APIVERSION/ {print $2}' "${VDR_INCLUDE_DIR}"/config.h)
434 [[ -z ${APIVERSION} ]] && APIVERSION="${VDRVERSION}"
435
436 einfo "Compiling against"
437 einfo "\tvdr-${VDRVERSION} [API version ${APIVERSION}]"
438}
439
157vdr-plugin_src_compile() { 440vdr-plugin_src_util() {
158 [ -z "$1" ] && vdr-plugin_src_compile prepare compile
159 441
160 while [ "$1" ]; do 442 while [ "$1" ]; do
161 443
162 case "$1" in 444 case "$1" in
163 prepare) 445 all)
164 [[ -n "${VDRSOURCE_DIR}" ]] && vdr-plugin_copy_source_tree 446 vdr-plugin_src_util unpack add_local_patch patchmakefile i18n
165 ;; 447 ;;
166 compile) 448 prepare|all_but_unpack)
167 cd ${S} 449 vdr-plugin_src_util add_local_patch patchmakefile i18n
168 450 ;;
169 emake ${VDRPLUGIN_MAKE_TARGET:-all} || die "emake failed" 451 unpack)
452 base_src_unpack
453 ;;
454 add_local_patch)
455 cd "${S}" || die "Could not change to plugin-source-directory!"
456 vdr_add_local_patch
457 ;;
458 patchmakefile)
459 cd "${S}" || die "Could not change to plugin-source-directory!"
460 vdr_patchmakefile
461 ;;
462 i18n)
463 cd "${S}" || die "Could not change to plugin-source-directory!"
464 vdr_i18n
170 ;; 465 ;;
171 esac 466 esac
172 467
173 shift 468 shift
174 done 469 done
175} 470}
176 471
472vdr-plugin_src_unpack() {
473 if [[ -z ${VDR_INCLUDE_DIR} ]]; then
474 eerror "Wrong use of vdr-plugin.eclass."
475 eerror "An ebuild for a vdr-plugin will not work without calling vdr-plugin_pkg_setup."
476 echo
477 eerror "Please report this at bugs.gentoo.org."
478 die "vdr-plugin_pkg_setup not called!"
479 fi
480 if [ -z "$1" ]; then
481 case "${EAPI:-0}" in
482 2|3|4)
483 vdr-plugin_src_util unpack
484 ;;
485 *)
486 vdr-plugin_src_util all
487 ;;
488 esac
489
490 else
491 vdr-plugin_src_util $@
492 fi
493}
494
495vdr-plugin_src_prepare() {
496 base_src_prepare
497 vdr-plugin_src_util prepare
498}
499
500vdr-plugin_src_compile() {
501 [ -z "$1" ] && vdr-plugin_src_compile copy_source compile
502
503 while [ "$1" ]; do
504
505 case "$1" in
506 copy_source)
507 [[ -n "${VDRSOURCE_DIR}" ]] && vdr-plugin_copy_source_tree
508 ;;
509 compile)
510 if [[ ! -f ${WORKDIR}/.vdr-plugin_makefile_patched ]]; then
511 eerror "Wrong use of vdr-plugin.eclass."
512 eerror "An ebuild for a vdr-plugin will not work without"
513 eerror "calling vdr-plugin_src_unpack to patch the Makefile."
514 echo
515 eerror "Please report this at bugs.gentoo.org."
516 die "vdr-plugin_src_unpack not called!"
517 fi
518 cd "${S}"
519
520 BUILD_TARGETS=${BUILD_TARGETS:-${VDRPLUGIN_MAKE_TARGET:-all}}
521
522 emake ${BUILD_PARAMS} \
523 ${BUILD_TARGETS} \
524 LOCALEDIR="${TMP_LOCALE_DIR}" \
525 LIBDIR="${S}" \
526 TMPDIR="${T}" \
527 || die "emake failed"
528 ;;
529 esac
530
531 shift
532 done
533}
534
177vdr-plugin_src_install() { 535vdr-plugin_src_install() {
178 [[ -n "${VDRSOURCE_DIR}" ]] && vdr-plugin_install_source_tree 536 [[ -n "${VDRSOURCE_DIR}" ]] && vdr-plugin_install_source_tree
537 cd "${WORKDIR}"
538
539 if [[ -n ${VDR_MAINTAINER_MODE} ]]; then
540 local mname="${P}-Makefile"
541 cp "${S}"/Makefile "${mname}.patched"
542 cp Makefile.before "${mname}.before"
543
544 diff -u "${mname}.before" "${mname}.patched" > "${mname}.diff"
545
546 insinto "/usr/share/vdr/maintainer-data/makefile-changes"
547 doins "${mname}.diff"
548
549 insinto "/usr/share/vdr/maintainer-data/makefile-before"
550 doins "${mname}.before"
551
552 insinto "/usr/share/vdr/maintainer-data/makefile-patched"
553 doins "${mname}.patched"
554
555 fi
556
557
558
179 cd ${S} 559 cd "${S}"
180
181 insinto "${VDR_PLUGIN_DIR}" 560 insinto "${VDR_PLUGIN_DIR}"
182 doins libvdr-*.so.* 561 doins libvdr-*.so.*
183 dodoc README* HISTORY CHANGELOG
184 562
185 for f in ${FILESDIR}/confd-${PV} ${FILESDIR}/confd; do 563 # create list of all created plugin libs
186 if [[ -f "${f}" ]]; then 564 vdr_plugin_list=""
187 insinto /etc/conf.d 565 local p_name
188 newins "${f}" vdr.${VDRPLUGIN} 566 for p in libvdr-*.so.*; do
189 break 567 p_name="${p%.so*}"
190 fi 568 p_name="${p_name#lib}"
569 vdr_plugin_list="${vdr_plugin_list} ${p_name}"
191 done 570 done
192 571
193 for f in ${FILESDIR}/rc-addon-${PV}.sh ${FILESDIR}/rc-addon.sh; do 572 create_header_checksum_file ${vdr_plugin_list}
194 if [[ -f "${f}" ]]; then 573 create_plugindb_file ${vdr_plugin_list}
574
575 if vdr_has_gettext && [[ -d ${TMP_LOCALE_DIR} ]]; then
576 einfo "Installing locales"
577 cd "${TMP_LOCALE_DIR}"
195 insinto "${VDR_RC_DIR}" 578 insinto "${LOCDIR}"
196 newins "${f}" plugin-${VDRPLUGIN}.sh 579 doins -r *
197 break
198 fi 580 fi
581
582 cd "${S}"
583 local docfile
584 for docfile in README* HISTORY CHANGELOG; do
585 [[ -f ${docfile} ]] && dodoc ${docfile}
199 done 586 done
587
588 # if VDR_CONFD_FILE is empty and ${FILESDIR}/confd exists take it
589 [[ -z ${VDR_CONFD_FILE} ]] && [[ -e ${FILESDIR}/confd ]] && VDR_CONFD_FILE=${FILESDIR}/confd
590
591 if [[ -n ${VDR_CONFD_FILE} ]]; then
592 newconfd "${VDR_CONFD_FILE}" vdr.${VDRPLUGIN}
593 fi
594
595
596 # if VDR_RCADDON_FILE is empty and ${FILESDIR}/rc-addon.sh exists take it
597 [[ -z ${VDR_RCADDON_FILE} ]] && [[ -e ${FILESDIR}/rc-addon.sh ]] && VDR_RCADDON_FILE=${FILESDIR}/rc-addon.sh
598
599 if [[ -n ${VDR_RCADDON_FILE} ]]; then
600 insinto "${VDR_RC_DIR}"
601 newins "${VDR_RCADDON_FILE}" plugin-${VDRPLUGIN}.sh
602 fi
200} 603}
201 604
202vdr-plugin_pkg_postinst() { 605vdr-plugin_pkg_postinst() {
203 update_vdrplugindb 606 vdr-plugin_print_enable_command
204 einfo 607
205 einfo "The vdr plugin ${VDRPLUGIN} has now been installed," 608 if [[ -n "${VDR_CONFD_FILE}" ]]; then
206 einfo "to activate it you have to add it to /etc/conf.d/vdr." 609 elog "Please have a look at the config-file"
207 einfo 610 elog "\t/etc/conf.d/vdr.${VDRPLUGIN}"
611 elog
612 fi
208} 613}
209 614
210vdr-plugin_pkg_postrm() { 615vdr-plugin_pkg_postrm() {
211 remove_vdrplugindb 616 delete_orphan_plugindb_file
212}
213
214vdr-plugin_pkg_config_final() {
215 diff ${conf_orig} ${conf}
216 rm ${conf_orig}
217} 617}
218 618
219vdr-plugin_pkg_config() { 619vdr-plugin_pkg_config() {
220 if [[ -z "${INSTALLPLUGIN}" ]]; then 620 ewarn "emerge --config ${PN} is no longer supported"
221 INSTALLPLUGIN="${VDRPLUGIN}" 621 vdr-plugin_print_enable_command
222 fi
223 # First test if plugin is already inside PLUGINS
224 local conf=/etc/conf.d/vdr
225 conf_orig=${conf}.before_emerge_config
226 cp ${conf} ${conf_orig}
227
228 einfo "Reading ${conf}"
229 if ! grep -q "^PLUGINS=" ${conf}; then
230 local LINE=$(sed ${conf} -n -e '/^#.*PLUGINS=/=' | tail -n 1)
231 if [[ -n "${LINE}" ]]; then
232 sed -e ${LINE}'a PLUGINS=""' -i ${conf}
233 else
234 echo 'PLUGINS=""' >> ${conf}
235 fi
236 unset LINE
237 fi
238
239 unset PLUGINS
240 PLUGINS=$(source /etc/conf.d/vdr; echo ${PLUGINS})
241
242 active=0
243 for p in ${PLUGINS}; do
244 if [[ "${p}" == "${INSTALLPLUGIN}" ]]; then
245 active=1
246 break;
247 fi
248 done
249
250 if [[ "${active}" == "1" ]]; then
251 einfo "${INSTALLPLUGIN} already activated"
252 echo
253 read -p "Do you want to deactivate ${INSTALLPLUGIN} (yes/no) " answer
254 if [[ "${answer}" != "yes" ]]; then
255 einfo "aborted"
256 return
257 fi
258 einfo "Removing ${INSTALLPLUGIN} from active plugins."
259 local LINE=$(sed ${conf} -n -e '/^PLUGINS=.*\<'${INSTALLPLUGIN}'\>/=' | tail -n 1)
260 sed -i ${conf} -e ${LINE}'s/\<'${INSTALLPLUGIN}'\>//' \
261 -e ${LINE}'s/ \( \)*/ /g' \
262 -e ${LINE}'s/ "/"/g' \
263 -e ${LINE}'s/" /"/g'
264
265 vdr-plugin_pkg_config_final
266 return
267 fi
268
269
270 einfo "Adding ${INSTALLPLUGIN} to active plugins."
271 local LINE=$(sed ${conf} -n -e '/^PLUGINS=/=' | tail -n 1)
272 sed -i ${conf} -e ${LINE}'s/^PLUGINS=" *\(.*\)"/PLUGINS="\1 '${INSTALLPLUGIN}'"/' \
273 -e ${LINE}'s/ \( \)*/ /g' \
274 -e ${LINE}'s/ "/"/g' \
275 -e ${LINE}'s/" /"/g'
276
277 vdr-plugin_pkg_config_final
278} 622}
279 623
624case "${EAPI:-0}" in
625 2|3|4)
626 EXPORT_FUNCTIONS pkg_setup src_unpack src_prepare src_compile src_install pkg_postinst pkg_postrm pkg_config
627 ;;
628 *)
280EXPORT_FUNCTIONS pkg_setup src_unpack src_compile src_install pkg_postinst pkg_postrm pkg_config 629 EXPORT_FUNCTIONS pkg_setup src_unpack src_compile src_install pkg_postinst pkg_postrm pkg_config
630 ;;
631esac
Legend:
Removed from v.1.8
changed lines
Added in v.1.78
ViewVC Help
Powered by ViewVC 1.1.20
|
__label__pos
| 0.753126 |
blob: 3bf0c93f2a99b6378e64e57eed0be4eeae8a34ab [file] [log] [blame]
// Copyright 2021 The Chromium OS Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ml/web_platform_handwriting_recognizer_impl.h"
#include <utility>
#include <vector>
#include <brillo/message_loops/message_loop.h>
#include <mojo/public/cpp/bindings/pending_receiver.h>
#include <mojo/public/cpp/bindings/receiver.h>
#include "base/debug/leak_annotations.h"
#include "chrome/knowledge/handwriting/handwriting_interface.pb.h"
#include "ml/handwriting.h"
#include "ml/mojom/handwriting_recognizer.mojom.h"
#include "ml/mojom/web_platform_handwriting.mojom.h"
#include "ml/request_metrics.h"
#include "ml/web_platform_handwriting_proto_mojom_conversion.h"
namespace ml {
namespace {
using ::chromeos::machine_learning::mojom::HandwritingRecognizerResult;
using ::chromeos::machine_learning::web_platform::mojom::
HandwritingModelConstraintPtr;
using ::chromeos::machine_learning::web_platform::mojom::
HandwritingPredictionPtr;
using ::chromeos::machine_learning::web_platform::mojom::HandwritingRecognizer;
} // namespace
bool WebPlatformHandwritingRecognizerImpl::Create(
HandwritingModelConstraintPtr constraint,
mojo::PendingReceiver<HandwritingRecognizer> receiver) {
auto recognizer_impl = new WebPlatformHandwritingRecognizerImpl(
std::move(constraint), std::move(receiver));
// In production, `recognizer_impl` is intentionally leaked, because this
// model runs in its own process and the model's memory is freed when the
// process exits. However, if being tested with ASAN, this memory leak could
// cause an error. Therefore, we annotate it as an intentional leak.
ANNOTATE_LEAKING_OBJECT_PTR(recognizer_impl);
// Set the disconnection handler to quit the message loop (i.e. exits the
// process) when the connection is gone, because this model is always run in
// a dedicated process.
recognizer_impl->receiver_.set_disconnect_handler(
base::BindOnce([]() { brillo::MessageLoop::current()->BreakLoop(); }));
return recognizer_impl->successfully_loaded_;
}
WebPlatformHandwritingRecognizerImpl::WebPlatformHandwritingRecognizerImpl(
HandwritingModelConstraintPtr constraint,
mojo::PendingReceiver<HandwritingRecognizer> receiver)
: library_(ml::HandwritingLibrary::GetInstance()),
receiver_(this, std::move(receiver)) {
DCHECK(library_->GetStatus() == ml::HandwritingLibrary::Status::kOk)
<< "WebPlatformHandwritingRecognizerImpl should be created only if "
"HandwritingLibrary is initialized successfully.";
recognizer_ = library_->CreateHandwritingRecognizer();
successfully_loaded_ = library_->LoadHandwritingRecognizerFromRootFs(
recognizer_, constraint->languages.front());
}
WebPlatformHandwritingRecognizerImpl::~WebPlatformHandwritingRecognizerImpl() {
library_->DestroyHandwritingRecognizer(recognizer_);
}
void WebPlatformHandwritingRecognizerImpl::GetPrediction(
std::vector<
chromeos::machine_learning::web_platform::mojom::HandwritingStrokePtr>
strokes,
chromeos::machine_learning::web_platform::mojom::HandwritingHintsPtr hints,
GetPredictionCallback callback) {
RequestMetrics request_metrics("WebPlatformHandwritingModel",
"GetPrediction");
request_metrics.StartRecordingPerformanceMetrics();
chrome_knowledge::HandwritingRecognizerResult result_proto;
if (library_->RecognizeHandwriting(
recognizer_,
WebPlatformHandwritingStrokesAndHintsToProto(strokes, hints),
&result_proto)) {
// Recognition succeeded, run callback on the result.
auto predictions =
WebPlatformHandwritingPredictionsFromProto(strokes, result_proto);
if (predictions.has_value()) {
std::move(callback).Run(std::move(predictions));
request_metrics.FinishRecordingPerformanceMetrics();
request_metrics.RecordRequestEvent(
HandwritingRecognizerResult::Status::OK);
return;
}
}
// Recognition failed, run callback on empty result.
std::move(callback).Run(base::nullopt);
request_metrics.RecordRequestEvent(
HandwritingRecognizerResult::Status::ERROR);
}
} // namespace ml
|
__label__pos
| 0.924132 |
10 декабря 2018
Система управления умным домом на коленке: Tarantool
Блог компании Mail.ru GroupУмный домИнтернет вещейDIY или Сделай сам
Интернет вещей врывается в нашу жизнь. Где-то совсем незаметно, где-то распихивая существующие порядки с изяществом паровоза. Всё больше устройств подключаются к сети, и всё больше становится разных приложений, веб-панелей, систем управления, которые привязаны к конкретному производителю, или, что еще хуже — к конкретному устройству.
Но что делать тем, кто не хочет мириться с таким состоянием, и хочет одно кольцо один интерфейс, чтобы править всеми? Конечно же, написать его самим!
Я покажу, как с помощью Tarantool быстро сделать даже не визуализацию, а полноценную систему управления, с базой данных, кнопками управления и графиками. С её помощью возможно управлять устройствами умного дома, собирать и показывать данные с датчиков.
Что такое Tarantool? Это связка «сервер приложений — база данных». Можно использовать её как базу данных с хранимыми процедурами, а можно как сервер приложений со встроенной базой данных. Вся внутренняя логика, будь она пользовательской или в виде хранимых процедур, пишется на Lua. Благодаря использованию LuaJIT, а не обычного интерпретатора, в скорости она не сильно уступает нативному коду.
Еще один важный фактор — Tarantool это noSQL база данных. Это означает, что вместо традиционных запросов вроде «SELECT… WHERE» вы управляете данными напрямую: пишете процедуру, которая переберет все данные (или их часть) и выдаст вам их. В версии 2.x поддержку SQL-запросов добавили, но панацеей они не являются — для высокой производительности часто важно понимать, как именно исполняется тот или иной запрос, а не отдавать это на откуп разработчикам.
В статье я покажу пример использования, когда внутри Tarantool пишется вся логика приложения, включая общение с внешними API, обработку и выдачу данных.
Поехали!
Вступление
Определимся с требованиями к системе. Это должен быть некий сервис, который реализует пользовательский интерфейс для какого-нибудь устройства умного дома. В веб-интерфейсе должны быть кнопки, которые отправляют команды устройству, и визуализация данных с этого устройства. Немного размыто, но для начала хватит.
Дисклеймер 1:
Мое понимание веб-разработки на момент начала этой статьи застыло где-то в 2010 году (а то и раньше), так что воспринимайте код фронтенда в качестве примера «как не стоит делать».
Дисклеймер 2:
Давайте сразу условимся, что гипотетическое устройство умного дома у нас доступно через MQTT. Это достаточно универсальный и распространенный протокол, чтобы меня не обвинили в надуманности примера. Реализация других протоколов хоть и несложна, но явно выходит за рамки статьи, в которой я хочу показать пример работы с Tarantool, а не процесс написания драйвера для какой-нибудь китайской лампочки.
А что такое MQTT?
MQTT, как подсказывает нам Google, это сетевой протокол, используемый, в основном, для M2M-взаимодействия.
Протокол работает по модели «издатель-подписчик»: это значит, что кто-то (например, устройство) может публиковать сообщения, а вы, если подписаны на адрес (в MQTT это называется «топик», например, "/data/voltage/"), будете эти сообщения получать.
Протокол клиент-серверный — у него всегда должен быть сервер, без которого два клиента не смогут обменяться данными. Сделано это для того, чтобы максимально облегчить клиентскую часть и протокол. Клиенты просто отправляют сообщения «хочу подписаться», «хочу отписаться», «хочу опубликовать», а маршрутизацией между ними занимается сервер.
Чуть-чуть подробнее
Подписаться можно не только на конкретный топик, но и используя в адресе символы подстановки. Так, подписка на "/data/+" позволит получать сообщения из любых топиков вида "/data/что-угодно/", например, "/data/temperature/" и "/data/stat", а подписка на "/data/#" — из топиков вида "/data/что-угодно/что-угодно/что-угодно/...", т.е. не только из "/data/temperature/ и "/data/stat", но также из "/data/stat/today" и "/data/stat/today/user/ivan".
Названия топиков не стандартизированы, поэтому то, как вы распихаете по ним свои данные — исключительно ваше дело. Статистика по пользователю за текущий день может быть как в "/stat/today/user/ivan", так и в "/user/ivan/stat/today" или в "/today/ivan/stat". В первом случае вы сможете подписаться на все уведомления о статистике ("/stat/#"), а во втором — на все уведомления отдельного пользователя ("/user/ivan/#"). Впрочем, во втором случае вы тоже сможете подписаться на статистику за текущий день для всех пользователей ("/user/+/stat/today").
В протоколе есть QOS, который определяет, сколько усилий должен прилагать отправитель для доставке сообщения получателю. При QOS 0 не прилагает их совсем (отправляет сообщение и забывает), при QOS 1 — ожидает как минимум одного подтверждения (но иногда получателю может прийти несколько дублирующих сообщений, учитывайте это при командах, которые всегда изменяют текущее состояние), при QOS 2 отправитель ожидает только одно подтверждение (большего одного сообщения не придет).
Еще сообщение можно пометить флагом «Retain». В этом случае сервер запомнит последнее значение сообщения в этом топике, и будет рассылать его всем заново подключенным клиентам.
Это удобно, если клиенту нужно знать о текущем состоянии, например, света, но он подключился только что, и не может знать о том, что произошло час назад. А если пометить сообщения об изменении света этим флагом, сервер будет хранить последние изменения и посылать их сразу же при подключении новых клиентов.
Шаг первый: форма с кнопками
Итак, наша минимальная функциональность — возможность отправить какую-нибудь команду на гипотетическое устройство. Хотя, почему гипотетическое? Давайте возьмем Wiren Board.
Управлять будем хотя бы пищалкой на нем. Чтобы включить её, нам надо подключиться по MQTT к WirenBoard и отправить «1» в топик "/devices/buzzer/controls/enabled/on". Чтобы отключить — надо отправить туда же «0».
Установим пакет http-server, создадим новый файл, дадим ему права на исполнение и скажем, что его надо исполнять в интерпретаторе Tarantool, а не просто в Lua:
tarantoolctl rocks install http
echo '#!/usr/bin/env tarantool' > iot_scada.lua
chmod +x iot_scada.lua
Теперь можно открыть файл в любимом редакторе, и буквально через, несколько строчек кода у нас появится маленький, но очень гордый HTTP-сервер:
local config = {}
config.HTTP_PORT = 8080
local function http_server_root_handler(req)
return req:render{ json = { server_status = "ok" } }
end
local http_server = require('http.server').new(nil, config.HTTP_PORT, {charset = "application/json"})
http_server:route({ path = '/' }, http_server_root_handler)
http_server:start()
Теперь, запустив наш сервис (./iot_scada.lua), мы можем открыть в браузере страничку localhost:8080/ и увидеть там что-то вроде
{"server_status":"ok"}
Это означает, что наш сервер работает и способен общаться с внешним миром. Да, пока исключительно в формате JSON, но исправить это несложно. Дабы не заморачиваться с интерфейсом, возьмем для этой цели Twitter Bootstrap.
Рядом с нашим скриптом создадим папки public и templates. В первой будет находиться статичный контент, а вторая предназначается для HTML-шаблонов (они не относятся к статике, потому что Tarantool может выполнять в этих шаблонах lua-скрипты).
В папку public положим всякие bootstrap.min.css, bootstrap.min.js, jquery-slim.min.js и так далее (я нашел эти файлы в архиве с Bootstrap, вы можете найти там же или тут), а в templates закинем файлик dashboard.html — пример странички из той же стандартной поставки. Про него поговорим чуть позже.
Теперь, изменим немного наш сервис:
--...--
local function http_server_action_handler(req) --Обработчик endpoint-a /action
return req:render{ json = { mqtt_result = true } } --Возвращаем JSON
end
local function http_server_root_handler(req) --Обработчик endpoint-a /
return req:redirect_to('/dashboard') --Перенаправляем на /dashboard
end
--...--
http_server:route({ path = '/action' }, http_server_action_handler)
http_server:route({ path = '/' }, http_server_root_handler)
http_server:route({ path = '/dashboard', file = 'dashboard.html' })
--...--
Что мы тут сделали? Во-первых, описали еще две оконечных точки — "/action", которая будет использоваться для API-запросов, и "/dashboard", которая будет отдавать содержимое файла dashboard.html. Мы установили и описали функции, которые будут вызываться при запросе браузером этих адресов: при запросе "/" будет вызвана функция http_server_root_handler, которая перенаправит браузер на адрес /dashboard, а при запросе /action — функция http_server_action_handler, которая сформирует JSON из Lua-обьекта и отдаст его клиенту.
Теперь, как и обещал, займемся файлом dashboard.html. Я не буду приводить его весь, можете посмотреть тут, это почти копия примера из Bootstrap. Покажу только функциональные части:
<div class="row input-group">
<div class="col-md-3 mb-1">
<button type="button" action-button="on" class="btn btn-success mqtt-buttons">On buzzer</button>
<button type="button" action-button="off" class="btn btn-success mqtt-buttons">Off buzzer</button>
</div>
</div>
Тут мы описываем две кнопки, «On buzzer» и «Off buzzer». Добавляем к ним атрибут "action-button", описывающий функцию кнопки, и класс "mqtt-buttons", который мы и будем ловить в JS. А вот и он, кстати (да, прямо в теле страницы, не делайте так, фу такими быть).
<script>
var button_xhr = new XMLHttpRequest();
var last_button_object;
function mqtt_result() {
if (button_xhr.readyState == 4) {
if (button_xhr.status == 200) {
var json_data = JSON.parse(button_xhr.responseText);
console.log(json_data, button_xhr.responseText)
if (json_data.mqtt_result == true)
last_button_object.removeClass("btn-warning").removeClass("btn-danger").addClass("btn-success");
else
last_button_object.removeClass("btn-warning").removeClass("btn-success").addClass("btn-danger");
}
else {
last_button_object.removeClass("btn-warning").removeClass("btn-success").addClass("btn-danger");
}
}
}
function send_to_mqtt() {
button_xhr.open('POST', 'action?type=mqtt_send&action=' + $(this).attr('action-button'), true);
button_xhr.send()
last_button_object = $(this)
$(this).removeClass("btn-success").removeClass("btn-danger").addClass("btn-warning");
}
$('.mqtt-buttons').on('click', send_to_mqtt);
button_xhr.onreadystatechange = mqtt_result
</script>
Читать проще снизу вверх. Мы устанавливаем функцию send_to_mqtt как обработчик всех кнопок с классом mqtt-buttons ($('.mqtt-buttons').on('click', send_to_mqtt);). В этой функции делаем POST-запрос вида /action?type=mqtt_send&action=on, причем последнее значение получаем из атрибута action-button нажатой кнопки. Ну и красим кнопку в желтый цвет (.addClass(«btn-warning»)), показывая тем самим, что запрос ушел на сервер.
Запрос асинхронный, поэтому мы устанавливаем и обработчик тех данных, которые нам вернет сервер в ответ на запрос (button_xhr.onreadystatechange = mqtt_result). В обработчике мы проверяем, пришел ли ответ, пришел ли он с кодом 200, и является ли он валидными JSON-данными с параметром mqtt_result = true. Если он такой — то красим кнопку обратно в зеленый, а если нет — то в красный (.addClass(«btn-danger»)): «шеф, всё пропало».
Теперь, если запустить сервис и открыть в браузере localhost:8080/, мы увидим такую страницу:
При нажатии на кнопки кажется, что цвет их не меняется, но это лишь из-за того, что запрос приходит и уходит слишком быстро. Если остановить сервис, запущенный в консоли, то нажатие кнопки перекрасит её в красный цвет: отвечать некому.
Кнопки работают, но ничего не делают: на стороне сервера нет логики. Давайте её добавим.
Для начала, надо установить библиотеку mqtt. По умолчанию её в поставке тарантула нет, поэтому надо поставить: sudo tarantoolctl rocks install mqtt. Выполнять эту команду надо в папке, содержащей iot_scada.lua, так как библиотека установится локально в папку .rocks.
Теперь можно писать код:
--...--
local mqtt = require 'mqtt'
config.MQTT_WIRENBOARD_HOST = "192.168.1.59"
config.MQTT_WIRENBOARD_PORT = 1883
config.MQTT_WIRENBOARD_ID = "tarantool_iot_scada"
--...--
mqtt.wb = mqtt.new(config.MQTT_WIRENBOARD_ID, true)
local mqtt_ok, mqtt_err = mqtt.wb:connect({host=config.MQTT_WIRENBOARD_HOST,port=config.MQTT_WIRENBOARD_PORT,keepalive=60,log_mask=mqtt.LOG_ALL})
if (mqtt_ok ~= true) then
print ("Error mqtt: "..(mqtt_err or "No error"))
os.exit()
end
--...--
Мы подключаем библиотеку, определяем адрес и порт сервера, а также название клиента (обычно, еще требуется авторизация, но на WB она по умолчанию выключена. О том, как использовать авторизацию и другие функции библиотеки, можно почитать на её страничке).
После подключения библиотеки создаем новый объект mqtt и подключаемся к серверу. Теперь можем с помощью "mqtt.wb:publish" отправлять сообщения MQTT в разные топики.
Займемся функцией http_server_action_handler. Она должна, во-первых, получить данные о том, какой запрос ей отправила кнопка на странице, а во-вторых, исполнить его. С первым всё очень просто. Вот такая конструкция вытащит из адреса аргументы type и action:
local type_param, action_param = req:param("type"), req:param("action")
if (type_param ~= nil and action_param ~= nil) then
--body--
end
Аргумент type у нас будет равен «mqtt_send», а action может быть «on» или «off». При первом значении нам надо отправить в MQTT-топик «1», а при втором — «2». Реализовываем:
local function http_server_action_handler(req)
local type_param, action_param = req:param("type"), req:param("action")
if (type_param ~= nil and action_param ~= nil) then
if (type_param == "mqtt_send") then
local command = "0"
if (action_param == "on") then
command = "1"
elseif (action_param == "off") then
command = "0"
end
local result = mqtt.wb:publish("/devices/buzzer/controls/enabled/on", command, mqtt.QOS_1, mqtt.NON_RETAIN)
return req:render{ json = { mqtt_result = result } }
end
end
end
Обратите внимание на переменную result — в нее функцией mqtt.wb:publish возвращается статус запроса (true или false), который затем пакуется в JSON и отправляется браузеру.
Теперь кнопки не только нажимаются, но еще и работают. Смотрите сами:
Весь код, относящийся к этому шагу, можно посмотреть тут. Или получить себе на диск такой командой:
git clone https://github.com/vvzvlad/tarantool-iotscada-mailru-gt.git
cd tarantool-iotscada-mailru-gt
git checkout a2f55792019145ca2355012a65167ca7eae3154d
Шаг первый с половиной: играем имперский марш
Давайте добавим третью кнопку, что ли? Если у нас есть спикер, пусть он играет имперский марш!
Что замечательно, на страничке нам надо добавить только саму кнопку, определив ей какой-нибудь другой атрибут action-button:
<button type="button" action-button="sw" class="btn btn-success mqtt-buttons">Play Imperial march</button>
Вся магия будет происходить в файле с кодом. Добавим обработчик нового параметра:
--...--
local function play_star_wars()
end
--...--
elseif (action_param == "sw") then
play_star_wars()
--...--
Теперь, надо подумать, как мы будем играть мелодию. В статье на Википедии про имперский марш были хорошие тайминги для мелодии, но сейчас их оттуда выпилили. Пришлось найти другие, в формате частота/время:
local imperial_march = {{392, 350}, {392, 350}, {392, 350}, {311, 250}, {466, 100}, {392, 350}, {311, 250}, {466, 100}, {392, 700}, {392, 350}, {392, 350}, {392, 350}, {311, 250}, {466, 100}, {392, 350}, {311, 250}, {466, 100}, {392, 700}, {784, 350}, {392, 250}, {392, 100}, {784, 350}, {739, 250}, {698, 100}, {659, 100}, {622, 100}, {659, 450}, {415, 150}, {554, 350}, {523, 250}, {493, 100}, {466, 100}, {440, 100}, {466, 450}, {311, 150}, {369, 350}, {311, 250}, {466, 100}, {392, 750}}
Правда, со временем там что-то не совсем то, и нет длительности пауз, но что уж делать. На WirenBoard можно изменять частоту спикера, отправляя значение новой частоты в герцах в топик "/devices/buzzer/controls/frequency/on", а вот задавать длительность звучания нельзя. Значит, будем отсчитывать длительность сами, на стороне приложения.
Раз мы проектируем «правильный» сервис, то несмотря на любые действия отзывчивость сервиса ухудшаться не должна: нам придется сделать его асинхронным и многопоточным.
Для этого мы используем файберы (fibers) — это реализация отдельных потоков для Tarantool. Документацию можно найти тут. В самом простом варианте запуск еще одного потока внутри вашей программы требует всего несколько строчек:
local fiber = require 'fiber'
local function fiber_func()
print("fiber ok")
end
fiber.create(fiber_func)
Сначала подключаем библиотеку, потом определяем функцию, которая будет запущена в отдельном потоке, а потом создаем новый fiber, передавая ему имя функции. Еще там есть мониторинг запущенных процессов, средства синхронизации и сообщения между запущенными потоками, но погружаться в это мы пока не будем. Используем только функцию задержки, которая называется fiber.sleep. Кстати, файберы — это кооперативная многозадачность, поэтому вызов fiber.sleep не просто ждет, а отдает управление диспетчеру задач, чтобы поработали другие процессы, например, запись в базу. Следует помнить о том, что в тяжелых циклах следует иногда передавать управление другим потокам, дабы они не останавливались надолго.
Всё остальное просто: нам надо обойти в цикле массив, получая у каждого элемента частоту и длительность, настраивая частоту через MQTT, а потом запуская задержки для ноты и паузы, а также включая/выключая звук.
--...--
for i = 1, #imperial_march do
local freq = imperial_march[i][1]
local delay = imperial_march[i][2]
mqtt.wb:publish("/devices/buzzer/controls/frequency/on", freq, mqtt.QOS_0, mqtt.NON_RETAIN)
mqtt.wb:publish("/devices/buzzer/controls/enabled/on", 1, mqtt.QOS_0, mqtt.NON_RETAIN)
fiber.sleep(delay/1000*2)
mqtt.wb:publish("/devices/buzzer/controls/enabled/on", 0, mqtt.QOS_0, mqtt.NON_RETAIN)
fiber.sleep(delay/1000/3)
end
--...--
Посмотреть полный код можно тут, или в diff-виде.
Ура, работает!
Четкость мелодии немного плавает из-за непредсказуемых сетевых задержек, но мелодия вполне ясна и узнаваема. Коллеги радуются (на самом деле нет, на десятый раз их задолбало).
Как обычно, код, относящийся к этому шагу, можно посмотреть тут. Или получить себе на диск такой командой (предполагается, что у вас уже клонирован репозиторий, и вы находитесь внутри его директории):
git checkout 10364cea7f3e1490ac3eb916b4f4b4c095bec705
Шаг третий: температура на веб-странице
А теперь давайте сделаем что-нибудь более приближенное к реальности. Имперский марш хоть и звучит забавно, но к интернету вещей имеет очень малое отношение. Возьмем, например, два датчика температуры и подключим их:
Как нам обещает документация, больше делать ничего не потребуется, данные с датчиков появятся в MQTT сами.
Задача-минимум на этом шаге — сделать на странице обновляемое в реальном времени отображение информации с датчиков. Их несколько, и состав может меняться, поэтому не будем хардкодить серийные номера датчиков, а все действия, включая определение и показ информации с новых датчиков, автоматизируем. Начнем с сервера.
Бэкенд
Первое, что нам надо сделать — создать функцию, которая должна вызываться при получении MQTT-сообщения с температурой, потом сказать библиотеке, что мы должны вызывать именно её, и подписаться на топик с сообщениями. Документация утверждает, что топик выглядит вот так: "/devices/wb-w1/controls/28-43276f64". 28-43276f64 — это и есть серийный номер датчика. Значит, подписка на данные со всех возможных датчиков будет выглядеть так: "/devices/wb-w1/controls/+".
local sensor_values = {}
--...--
local function mqtt_callback(message_id, topic, payload, gos, retain)
local topic_pattern = "/devices/wb%-w1/controls/(%S+)"
local _, _, sensor_address = string.find(topic, topic_pattern)
if (sensor_address ~= nil) then
sensor_values[sensor_address] = tonumber(payload)
end
end
--...--
mqtt.wb:on_message(mqtt_callback)
mqtt.wb:subscribe('/devices/wb-w1/controls/+', 0)
Теперь разберемся подробнее, что же мы делаем в callback-функции. Для поиска серийного номера в строке адреса мы используем так называемые паттерны (регулярные выражения Lua-шного разлива). Функция string.find принимает строку и паттерн, в котором скобками отмечено то, что надо из этой строки захватить. В данном случае "%S+" означает «1 или более символов, которые не являются пробелами» — таким образом, функция захватит всё, что находится после "..controls/", до первого встреченного пробела. А так как у нас пробелов в номере датчиков не предполагается, а адрес подписки допускает сообщения только с "/devices/wb-w1/controls/адрес-датчика", но не с "/devices/wb-w1/controls/адрес-датчика/что-то-еще", то в переменной sensor_address у нас всегда будет адрес (серийный номер) датчика.
Обратите внимание, что строки '/devices/wb-w1/controls/+' и "/devices/wb%-w1/controls/(%S+)" хоть и похожи, но всё же разные: первая строка — это wildcard mqtt-подписка, а вторая — строка-аргумент для Lua-шной функции string.find, в которой используется подмножество регулярных выражений в формате Lua (там, например, "-" надо экранировать, поэтому оно записано в виде «wb%-w1»)
Следующими строками мы создаем и заполняем таблицу sensor_values, в которой у нас будут записи, соответствующие датчикам: ключом будет серийный номер, а значением — температура с датчика.
local sensor_values = {}
--...--
sensor_values[sensor_address] = tonumber(payload)
Таблица будет содержать последнее пришедшее значение температуры и храниться только в памяти. Вообще-то, делать так не следует, глобальные таблицы, доступные всем — зло. Если бы приложение было чуть больше, чем демонстрационное, стоило бы создать две функции: геттер и сеттер, первая из которых выдавала бы таблицу, а вторая сохраняла бы. Помимо очевидных плюсов, таких как валидация сохраняемых данных и выдача данных в разных форматах, так было бы гораздо проще отследить, кто и когда изменяет данные, чем в случае с таблицей, которая доступна всем подряд.
Следующее, что мы должны сделать, как-то отдать эту таблицу фронтенду. Поэтому пишем такую функцию: во-первых, она будет превращать табличку ключ-значение в массив, который будет проще показывать на страничке, а во вторых, запаковывать в JSON и отдавать тому, кто попросит:
local function http_server_data_handler(req)
local type_param = req:param("type")
if (type_param ~= nil) then
if (type_param == "temperature") then
if (sensor_values ~= nil) then
local temperature_data_object, i = {}, 0
for key, value in pairs(sensor_values) do
i = i + 1
temperature_data_object[i] = {}
temperature_data_object[i].sensor = key
temperature_data_object[i].temperature = value
end
return req:render{ json = { temperature_data_object } }
end
end
end
return req:render{ json = { none_data = "true" } }
end
Конечно, можно сразу формировать правильную таблицу в mqtt-коллбеке, но выбор, где конвертировать, зависит от того, что происходит чаще — сохранение или выдача: сохранение в таблице по ключу гораздо быстрее, чем перебор таблицы в поисках нужного имени датчика для каждого значения. Таким образом, если значения мы показываем, в среднем, каждую минуту, а сохраняются они каждую секунду, то выгоднее сохранять по ключу, а потом форматировать по запросу. Если же наоборот, например, у нас десяток клиентов, которые смотрят на таблицу, а температура обновляется нечасто, то лучше хранить готовую таблицу.
Но опять же, это всё имеет значение, только если эти операции начинают занимать хоть какую-то ощутимую долю ресурсов.
Наконец, устанавливаем эту функцию как обработчик endpoint-a /data: http_server:route({ path = '/data' }, http_server_data_handler).
Проверяем:
Работает!
Фронтенд
Теперь надо нарисовать табличку. Создаем заготовку:
<h3>Sensors:</h3>
<div class="table-responsive">
<table class="table table-striped table-sm" id="table_values_temp"></table>
</div>
И пишем две функции, которые будут превращать JS-объект в табличку:
function add_row_table(table_name, type, table_data) {
var table_current_row;
if (type == "head")
table_current_row = document.getElementById(table_name).createTHead().insertRow(-1);
else {
if (document.getElementById(table_name).tBodies.length == 0)
table_current_row = document.getElementById(table_name).createTBody().insertRow(-1);
else
table_current_row = document.getElementById(table_name).tBodies[0].insertRow(-1);
}
for (var j = 0; j < table_data.length; j++)
table_current_row.insertCell(-1).innerHTML = table_data[j];
}
function clear_table(table_name) {
document.getElementById(table_name).innerHTML = "";
}
Теперь осталось только запустить в цикле обновление этой таблички:
var xhr_tmr = new XMLHttpRequest();
function update_table_callback() {
if (xhr_tmr.readyState == 4 && xhr_tmr.status == 200) {
var json_data = JSON.parse(xhr_tmr.responseText);
if (json_data.none_data != "true") {
clear_table("table_values_temp")
add_row_table("table_values_temp", "head", ["Sensor serial", "Temperature"])
for (let index = 0; index < json_data[0].length; index++) {
add_row_table("table_values_temp", "body", [json_data[0][index].sensor, json_data[0][index].temperature])
}
}
}
}
function timer_update_field() {
xhr_tmr.onreadystatechange = update_table_callback
xhr_tmr.open('POST', 'data?type=temperature', true);
xhr_tmr.send()
}
setInterval(timer_update_field, 1000);
Как можно заметить, таблица каждый раз удаляется и создается заново, что могло бы плохо сказаться на скорости выполнения, если бы табличка состояла не из двух значений. Правильный подход — взять фреймворк, который умеет использовать реактивность и virtual dom, но это явно выходит за рамки текущей статьи.
Ну-ка, что у нас получилось?
Код, относящийся к этому шагу, можно посмотреть тут, или сделав git checkout e387430efed44598efe827016f903cc3c17634a8. Или DIFF-вид.
Шаг четвертый: температура в базе данных
А теперь сделаем то же самое, но с базой данных! В конце-концов, Tarantool — база данных или нет? :)
Изменений, на самом деле, будет совсем немного. Во-первых, инициализируем движок баз данных и создадим space (это аналог таблицы в какой-нибудь SQL):
local function database_init()
box.cfg { log_level = 4 }
box.schema.user.grant('guest', 'read,write,execute', 'universe', nil, {if_not_exists = true})
local format = {
{name='serial', type='string'}, --1
{name='timestamp', type='number'}, --2
{name='value', type='number'}, --3
}
storage = box.schema.space.create('storage', {if_not_exists = true, format = format})
storage:create_index('serial', {parts = {'serial'}, if_not_exists = true})
end
Теперь пройдемся по вызовам более внимательно: мы начинаем погружаться в самую суть Tarantool — в работу с базой данных.
box.cfg() — это инициализация. Мы передаем в нее параметр уровня логгирования, указав, логи какой важности мы хотим видеть, а какой — нет. Но вообще у нее много параметров.
Можно заметить, что вызов функции box.cfg какой-то странный: вместо круглых скобочек фигурные. Это потому, что в Lua при передаче функции одного аргумента скобки можно опускать. А так как {} — это таблица, то один аргумент и передается — таблица. Проще говоря, box.cfg({ log_level = 4 }) это тоже самое, что box.cfg { log_level = 4 }.
Функцией box.schema.user.grant мы даем пользователю guest без пароля (nil) права на чтение, запись и выполнение (read,write,execute) во всем пространстве текущего экземпляра Tarantool (universe). Последний аргумент (if_not_exists = true) разрешает системе ничего не делать, если у пользователя уже есть эти права (точнее, разрешает дать права, только если их у пользователя нет).
Теперь нам надо создать какое-то хранилище. Этим занимается функция box.schema.space.create. Мы передаем в нее имя хранилища, уже знакомое нам указание if_not_exists и формат — по сути, имена полей и типы хранимых в них данных, которые определили парой строчек выше. Штука эта опциональная, можно не передавать формат и всё равно работать с базой данных, просто доступ к полям будет не по именам, а по номерам (зато можно будет добавлять новые поля в процессе работы).
Возвращает эта функция объект созданного хранилища. Хранить ссылку на него не обязательно: она есть в глобальном пространстве имен: box.space.space_name (box.space.storage в данном случае, но мне было удобнее так). Записи storage:create_index и box.space.storage:create_index равнозначны.
Следующая строка, как вы, наверное, уже догадались, создает индекс. Первым аргументом в create_index идет название индекса, через которое мы потом будем к нему обращаться, вторым — поле (или несколько полей), входящие в состав индекса. Так, мы создаем индекс по имени serial, говоря, что в него входит поле с именем "serial" (можно было не обращаться по имени, а указать номер поля, в данном случае 1).
Хоть индекс нам особо не нужен, создать его надо — базе в Tarantool всегда нужен первичный индекс.
Таким образом, мы создали базу данных, определили поля в ней и создали индекс. Теперь напишем функцию записи в базу:
local function save_value(serial, value)
local timestamp = os.time()
value = tonumber(value)
if (value ~= nil and serial ~= nil) then
storage:upsert({serial, timestamp, value}, {{"=", 2, timestamp} , {"=", 3, value}})
return true
end
return false
end
Самая главная строчка тут — storage:upsert({serial, timestamp, value}, {{"=", 2, timestamp}, {"=", 3, value}}).
Upsert — это комбинация update и insert: если такой записи в базе нет, произойдет insert, а если есть — то update. Первым аргументом мы говорим, какие данные и в какой последовательности вставлять при insert (по порядку: serial, timestamp, value), а вторым — как именно делать update.
Обратите внимание: serial, timestamp и value это имена не полей, а локальный переменных внутри функции. Куда они будут вставлены, зависит от их порядка. То есть наша строка означает: создай новую запись, вставив в первое поле serial, во второе — timestamp, а в третье value. Порядок полей в БД определяется в данном случае при создании format (см. выше).
С обновлением немного сложнее: мы можем обновлять не все поля (я бы даже сказал, чаще всего мы не хотим обновлять все поля), поэтому необходимо четко указывать, какие именно поля и как мы будем обновлять.
Запись "{"=", 2, timestamp}" означает, что мы должны обновить второе поле содержимым локальной переменной, причем с помощью перезаписи =). Виды способов обновления можно посмотреть тут. Например, мы можем прибавить или вычесть числовое значение, сделать XOR/AND, и так далее.
Остальные строки — это получение текущего времени, превращения полученного значения в число (mqtt представляет любые данные в виде строк, а у нас в БД value имеет тип number, что приведет в общем случае к ошибке), разнообразные проверки и возврат статуса операции.
Сделаем аналогичную функцию, которая будет получать значения из базы:
local function get_values()
local temperature_data_object, i = {}, 0
for _, tuple in storage:pairs() do
i = i + 1
local absolute_time_text = os.date("%Y-%m-%d, %H:%M:%S", tuple["timestamp"])
local relative_time_text = (os.time() - tuple["timestamp"]).."s ago"
temperature_data_object[i] = {}
temperature_data_object[i].sensor = tuple["serial"]
temperature_data_object[i].temperature = tuple["value"]
temperature_data_object[i].update_time_epoch = tuple["timestamp"]
temperature_data_object[i].update_time_text = absolute_time_text.." ("..relative_time_text..")"
end
return temperature_data_object
end
Она очень похожа на прошлую функцию. Мы не будем углубляться в магию функции pairs() в сочетании с циклом for, а покажем работу на простых примерах.
local table = {"test_1","test_2","test_3"}
for key, value in pairs(table) do
print(value)
end
Такая конструкция переберет всю таблицу table, вызывая для каждой итерации print(), который получит в качестве аргумента текущий элемент таблицы. Т.е. данный код эквивалентен следующему:
local table = {"test_1","test_2","test_3"}
print(table[1])
print(table[2])
print(table[3])
Еще есть переменная key, которая принимает ключ элемента в таблице. Так как мы ключи не указывали, они будут равны номеру элемента в таблице: 1,2,3.
Для БД в Tarantool существует точно такая же функция pairs(), которую можно использовать в подобной конструкции:
for _, tuple in box.space.storage:pairs() do
-- for body
end
При вызове без параметров она переберет всё содержимое таблицы (спейса), вызывая для каждой записи (кортежа) команды из тела цикла. Поскольку кортеж, как правило, состоит из нескольких полей, то получить доступ к отдельным полям можно в виде tuple[1] или, если есть format, то по имени поля: tuple[«name»]. Таким образом, мы получаем серийный номер (tuple[«serial»]), текущую температуру (tuple[«value»]) и время последнего обновления этой температуры (tuple[«timestamp»]).
Остальные строки — это красивое форматирование времени обновления и внешний итератор (можно использовать внутренний (см. key выше), но нельзя полагаться на то, что он всегда будет монотонно возрастающим или вообще числом).
С бекендом всё. Настало время фронтенда.
Фронтенд
А делать-то ничего и не пришлось: оно работает и так. Добавим еще один столбец в табличку, раз уж у нас есть время обновления. Было:
add_row_table("table_values_temp", "head", ["Sensor serial", "Temperature"])
for (let index = 0; index < json_data[0].length; index++)
{
add_row_table("table_values_temp", "body", [json_data[0][index].sensor, json_data[0][index].temperature)
}
Стало:
add_row_table("table_values_temp", "head", ["Sensor serial", "Temperature", "Update time"])
for (let index = 0; index < json_data[0].length; index++)
{
add_row_table("table_values_temp", "body", [json_data[0][index].sensor, json_data[0][index].temperature, json_data[0][index].update_time_text])
}
Вот и все изменения.
Теперь можно посмотреть и на результат:
Еее!
Код, относящийся к этому шагу, можно посмотреть тут, или сделав git checkout bf26c3aea21e68cd184594beec2e34f3413c2776. Или DIFF-вид.
Шаг пятый: исторические данные и график
Теперь нужно получить не только текущее значение, но еще и исторические данные. Ну, и построить по ним график.
Первым делом изменим конфигурацию базы данных. Было:
storage:create_index('serial', {parts = {'serial'}, if_not_exists = true})
Стало:
storage:create_index('timestamp', {parts = {'timestamp'}, if_not_exists = true})
storage:create_index('serial', {parts = {'serial'}, unique = false, if_not_exists = true})
Что мы тут изменили? Вначале у нас был один индекс, и он был уникальным — первый индекс всегда уникальный. Теперь у нас два индекса, и если раньше уникальным было поле серийного номера датчика, то теперь — поле временной метки данных с этого датчика. Теперь у нас в базе данных может быть много данных с одним и тем же серийным номером датчика, но они будут отличаться друг от друга временем этих данных.
Однако, вполне возможна такая ситуация, когда у нас с одного датчика приходит в одну секунду несколько измерений. А индекс уникальный. Получается, значение секунд в качестве временной метки использовать нельзя, надо брать более мелкие единицы времени.
Следующее решение я подсмотрел на T++ Conference.
local function gen_id()
local new_id = clock.realtime()*10000
while storage.index.timestamp:get(new_id) do
new_id = new_id + 1
end
return new_id
end
local function save_value(serial, value)
value = tonumber(value)
if (value ~= nil and serial ~= nil) then
storage:insert({serial, gen_id(), value})
return true
end
return false
end
Используем insert вместо upsert: если раньше мы или создавали, или обновляли запись, соответствующую датчику, то теперь мы будем только вставлять новые записи с новым временем, не изменяя старые.
Кроме этого, мы генерируем время в долях миллисекунды для записей в отдельной функции, и еще проверяем, нет ли у нас уже такой записи, а в случае нахождения — прибавляем к ней единичку.
Для этого нам нужен модуль clock, поэтому в начале файла добавляется строчка
local clock = require 'clock'
Функция get_values тоже изменилась:
local function get_values_for_table(serial)
local temperature_data_object, i = {}, 0
for _, tuple in storage.index.serial:pairs(serial) do
i = i + 1
local time_in_sec = math.ceil(tuple["timestamp"]/10000)
local absolute_time_text = os.date("%Y-%m-%d, %H:%M:%S", time_in_sec)
temperature_data_object[i] = {}
temperature_data_object[i].serial = tuple["serial"]
temperature_data_object[i].temperature = tuple["value"]
temperature_data_object[i].time_epoch = tuple["timestamp"]
temperature_data_object[i].time_text = absolute_time_text
end
return temperature_data_object
end
Мы больше не перебираем всю базу с помощью функции storage:pairs(), а используем её версию, которая выбирает данные, соответствующие определенному признаку:
storage.index.serial:pairs(serial)
Такая запись означает буквально следующее: перебрать все данные (pairs) в базе данных storage, у которых индекс под названием serial соответствует тому, что находится в переменной serial. Такой индекс мы создали чуть выше, а переменная приходит в виде аргумента функции.
Далее мы снова пересчитываем время в секунды, делаем из него человекочитаемую запись с годом, месяцем, днем и временем, и вместе со значением, серийным номером и оригинальным временем кладем в таблицу, которую отдадим фронтенду.
На стороне фронтенда изменится мало: только новая колонка в таблице, да серийник в адресе запроса:
Однако, мы хотим еще и график. Для этого тоже не надо много кода: всего лишь подключить библиотеку и указать пару настроек.
<script type="text/javascript" src="https://www.gstatic.com/charts/loader.js"></script>
<script type="text/javascript">
google.charts.load('current', { 'packages': ['corechart'] });
google.charts.setOnLoadCallback(timer_update_graph);
function update_graph_callback() {
let data_b = JSON.parse(xhr_graph.responseText);
var data = google.visualization.arrayToDataTable(data_b[0]);
var options = {
title: 'Temperatype',
hAxis: { title: 'Time', titleTextStyle: { color: '#333' } },
};
var chart = new google.visualization.AreaChart(document.getElementById('chart_div'));
chart.draw(data, options);
}
var xhr_graph = new XMLHttpRequest();
function timer_update_graph() {
xhr_graph.onreadystatechange = update_graph_callback
xhr_graph.open('POST', 'data?data=graph&serial=28-000008e538e6', true);
xhr_graph.send()
setTimeout(timer_update_graph, 3000);
}
</script>
<div id="chart_div" style="width: 100%; height: 300px;"></div>
Наверное, всем понятно, что делает этот код: превращаем JSON c сервера в массив, того превращаем в форму, понятную графической библиотеке, указываем цвет и название осей, и отрисовываем график. Ну и запускаем таймер, который будет забирать данные и заново перерисовывать график раз в 3 секунды.
Для графика, кстати, надо немного изменить данные так, чтобы они были не в виде массива ключ-значение, а просто списком, в котором тип поля определяется его местом:
local function get_values_for_graph(serial)
local temperature_data_object, i = {}, 1
temperature_data_object[1] = {"Time", "Value"}
for _, tuple in storage.index.serial:pairs(serial) do
i = i + 1
local time_in_sec = math.ceil(tuple["timestamp"]/10000)
temperature_data_object[i] = {os.date("%H:%M", time_in_sec), tuple["value"]}
end
return temperature_data_object
end
Еще немного перепишем обработчик HTTP, чтобы можно было в зависимости от параметра выбирать, какие данные мы хотим получить — для таблицы или для графика:
local function http_server_data_handler(req)
local params = req:param()
if (params["data"] == "table") then
local values = get_values_for_table(params["serial"])
return req:render{ json = { values } }
elseif (params["data"] == "graph") then
local values = get_values_for_graph(params["serial"])
return req:render{ json = { values } }
end
И всё готово:
График реален, это я засунул датчик температуры в морозилку.
Код, относящийся к этому шагу, можно посмотреть тут, или сделав git checkout 10ed490333bead9e8aeaa851dc52070050aac68c. Или DIFF-вид.
Заключение
Разумеется, за рамками статьи остались многие интересные вещи, касающиеся как тонкой душевной организации Tarantool, так и создания более удобного/качественного/современного интерфейса. Например, данные можно хранить на диске, а не в памяти. И конечно, нужна ротация данных, иначе десяток датчиков забьют память. И вообще, для хранения таких данных надо взять TSDB, а для веб-интерфейса — нормальный фреймворк типа Vue.
Я писал эту статью лишь в качестве примера, который подталкивает сделать первые шаги в мире Tarantool в чуть более дружелюбной форме, чем официальная документация. Надеюсь, у меня это получилось.
Tarantool — специфичная, но очень интересная штука, которая нравится мне, и надеюсь, понравится вам.
Теги:tarantooljsluaумный домпанель управленияtwitter bootstrap
Хабы: Блог компании Mail.ru Group Умный дом Интернет вещей DIY или Сделай сам
+34
23,7k 171
Комментарии 32
Лучшие публикации за сутки
|
__label__pos
| 0.575715 |
Codebase list logbook / debian/0.12.3-1 logbook / _speedups.pyx
debian/0.12.3-1
Tree @debian/0.12.3-1 (Download .tar.gz)
_speedups.pyx @debian/0.12.3-1raw · history · blame
# -*- coding: utf-8 -*-
"""
logbook._speedups
~~~~~~~~~~~~~~~~~
Cython implementation of some core objects.
:copyright: (c) 2010 by Armin Ronacher, Georg Brandl.
:license: BSD, see LICENSE for more details.
"""
import platform
from logbook.concurrency import (is_gevent_enabled, thread_get_ident, greenlet_get_ident, thread_local,
GreenletRLock, greenlet_local)
from cpython.dict cimport PyDict_Clear, PyDict_SetItem
from cpython.list cimport PyList_New, PyList_Append, PyList_Sort, \
PyList_SET_ITEM, PyList_GET_SIZE
from cpython.pythread cimport PyThread_type_lock, PyThread_allocate_lock, \
PyThread_release_lock, PyThread_acquire_lock, WAIT_LOCK
cdef object _missing = object()
cdef enum:
_MAX_CONTEXT_OBJECT_CACHE = 256
cdef class group_reflected_property:
cdef object name
cdef object _name
cdef object default
cdef object fallback
def __init__(self, name, object default, object fallback=_missing):
self.name = name
self._name = '_' + name
self.default = default
self.fallback = fallback
def __get__(self, obj, type):
if obj is None:
return self
rv = getattr3(obj, self._name, _missing)
if rv is not _missing and rv != self.fallback:
return rv
if obj.group is None:
return self.default
return getattr(obj.group, self.name)
def __set__(self, obj, value):
setattr(obj, self._name, value)
def __del__(self, obj):
delattr(obj, self._name)
cdef class _StackItem:
cdef int id
cdef readonly object val
def __init__(self, int id, object val):
self.id = id
self.val = val
def __richcmp__(_StackItem self, _StackItem other, int op):
cdef int diff = other.id - self.id # preserving older code
if op == 0: # <
return diff < 0
if op == 1: # <=
return diff <= 0
if op == 2: # ==
return diff == 0
if op == 3: # !=
return diff != 0
if op == 4: # >
return diff > 0
if op == 5: # >=
return diff >= 0
assert False, "should never get here"
cdef class _StackBound:
cdef object obj
cdef object push_func
cdef object pop_func
def __init__(self, obj, push, pop):
self.obj = obj
self.push_func = push
self.pop_func = pop
def __enter__(self):
self.push_func()
return self.obj
def __exit__(self, exc_type, exc_value, tb):
self.pop_func()
cdef class StackedObject:
"""Baseclass for all objects that provide stack manipulation
operations.
"""
cpdef push_greenlet(self):
"""Pushes the stacked object to the greenlet stack."""
raise NotImplementedError()
cpdef pop_greenlet(self):
"""Pops the stacked object from the greenlet stack."""
raise NotImplementedError()
cpdef push_thread(self):
"""Pushes the stacked object to the thread stack."""
raise NotImplementedError()
cpdef pop_thread(self):
"""Pops the stacked object from the thread stack."""
raise NotImplementedError()
cpdef push_application(self):
"""Pushes the stacked object to the application stack."""
raise NotImplementedError()
cpdef pop_application(self):
"""Pops the stacked object from the application stack."""
raise NotImplementedError()
def __enter__(self):
if is_gevent_enabled():
self.push_greenlet()
else:
self.push_thread()
return self
def __exit__(self, exc_type, exc_value, tb):
if is_gevent_enabled():
self.pop_greenlet()
else:
self.pop_thread()
cpdef greenletbound(self):
"""Can be used in combination with the `with` statement to
execute code while the object is bound to the greenlet.
"""
return _StackBound(self, self.push_greenlet, self.pop_greenlet)
cpdef threadbound(self):
"""Can be used in combination with the `with` statement to
execute code while the object is bound to the thread.
"""
return _StackBound(self, self.push_thread, self.pop_thread)
cpdef applicationbound(self):
"""Can be used in combination with the `with` statement to
execute code while the object is bound to the application.
"""
return _StackBound(self, self.push_application, self.pop_application)
cdef class ContextStackManager:
cdef list _global
cdef PyThread_type_lock _thread_context_lock
cdef object _thread_context
cdef object _greenlet_context_lock
cdef object _greenlet_context
cdef dict _cache
cdef int _stackcnt
def __init__(self):
self._global = []
self._thread_context_lock = PyThread_allocate_lock()
self._thread_context = thread_local()
self._greenlet_context_lock = GreenletRLock()
self._greenlet_context = greenlet_local()
self._cache = {}
self._stackcnt = 0
cdef _stackop(self):
self._stackcnt += 1
return self._stackcnt
cpdef iter_context_objects(self):
use_gevent = is_gevent_enabled()
tid = greenlet_get_ident() if use_gevent else thread_get_ident()
objects = self._cache.get(tid)
if objects is None:
if PyList_GET_SIZE(self._cache) > _MAX_CONTEXT_OBJECT_CACHE:
PyDict_Clear(self._cache)
objects = self._global[:]
objects.extend(getattr3(self._thread_context, 'stack', ()))
if use_gevent:
objects.extend(getattr3(self._greenlet_context, 'stack', ()))
PyList_Sort(objects)
objects = [(<_StackItem>x).val for x in objects]
PyDict_SetItem(self._cache, tid, objects)
return iter(objects)
cpdef push_greenlet(self, obj):
self._greenlet_context_lock.acquire()
try:
self._cache.pop(greenlet_get_ident(), None)
item = _StackItem(self._stackop(), obj)
stack = getattr3(self._greenlet_context, 'stack', None)
if stack is None:
self._greenlet_context.stack = [item]
else:
PyList_Append(stack, item)
finally:
self._greenlet_context_lock.release()
cpdef pop_greenlet(self):
self._greenlet_context_lock.acquire()
try:
self._cache.pop(greenlet_get_ident(), None)
stack = getattr3(self._greenlet_context, 'stack', None)
assert stack, 'no objects on stack'
return (<_StackItem>stack.pop()).val
finally:
self._greenlet_context_lock.release()
cpdef push_thread(self, obj):
PyThread_acquire_lock(self._thread_context_lock, WAIT_LOCK)
try:
self._cache.pop(thread_get_ident(), None)
item = _StackItem(self._stackop(), obj)
stack = getattr3(self._thread_context, 'stack', None)
if stack is None:
self._thread_context.stack = [item]
else:
PyList_Append(stack, item)
finally:
PyThread_release_lock(self._thread_context_lock)
cpdef pop_thread(self):
PyThread_acquire_lock(self._thread_context_lock, WAIT_LOCK)
try:
self._cache.pop(thread_get_ident(), None)
stack = getattr3(self._thread_context, 'stack', None)
assert stack, 'no objects on stack'
return (<_StackItem>stack.pop()).val
finally:
PyThread_release_lock(self._thread_context_lock)
cpdef push_application(self, obj):
self._global.append(_StackItem(self._stackop(), obj))
PyDict_Clear(self._cache)
cpdef pop_application(self):
assert self._global, 'no objects on application stack'
popped = (<_StackItem>self._global.pop()).val
PyDict_Clear(self._cache)
return popped
|
__label__pos
| 0.982967 |
WooCommerce is a powerful e-commerce plugin for WordPress. It allows you to create and manage an online store with ease. One of the great things about WooCommerce is that it can be customized to fit the needs of your business.
One way to customize WooCommerce is by editing the theme. WooCommerce works with most WordPress themes, so you can choose a theme that suits your style and then make adjustments to fit your brand.
To edit the theme, you will need to access the theme’s files. This can be done through the WordPress dashboard by going to Appearance > Theme Editor. From here, you can edit the theme’s files using the built-in code editor.
To customize WooCommerce, you will likely need to edit the following files:
1. style.css: This is the main stylesheet for your theme. It controls the overall appearance of your website.
2. functions.php: This file contains code that can be used to add functionality to your theme. You can use this file to customize how WooCommerce functions on your site.
3. page.php: This file controls the layout of your pages. You can customize the layout of your store pages using this file.
4. single-product.php: This file controls the layout of individual product pages. You can customize the layout of your product pages using this file.
In addition to editing the theme’s files, you can also use CSS to further customize the appearance of your WooCommerce store. CSS stands for Cascading Style Sheets and is a coding language used to style the elements of a web page.
To add custom CSS to your WooCommerce store, you can use the Additional CSS feature in the WordPress Customizer. This allows you to add CSS code without editing the theme’s files directly.
To access the Additional CSS feature, go to Appearance > Customize in the WordPress dashboard. From there, click on the “Additional CSS” option. You can then add your custom CSS code in the text box provided.
Here are a few examples of CSS customizations you can make to your WooCommerce store:
1. Changing colors: You can use CSS to change the color scheme of your store. This could include changing the background color, button color, or text color.
2. Adjusting layout: You can use CSS to adjust the layout of your store. For example, you could change the width of the product images or adjust the spacing between elements.
3. Hiding elements: You can use CSS to hide certain elements of your store. This could include hiding specific buttons or sections that you don’t want to display.
Keep in mind that when making customizations to your theme or adding custom CSS, it’s a good idea to create a child theme. A child theme is a separate theme that inherits the functionality and styling of another theme, allowing you to make changes without affecting the original theme’s files. This ensures that your customizations are not lost when the theme is updated.
Overall, WooCommerce provides a lot of flexibility for customizing your online store. Whether you’re editing the theme’s files or adding custom CSS, you can create a unique and personalized shopping experience for your customers.
|
__label__pos
| 0.756701 |
1
$\begingroup$
Since duration of an instruction is just the number of cpu cycles needed times the time of a cycle, which is the inverse of the frequency, I do not get why the ratio of cpu benchmark of a two processors of a same trademark is not exactly the inerse of the ratio of the frequencies. Cpu is supposed not to loose time by being inefficient but only to obey and realize the processors instructions that we ask, which are the same in a test of benchmark of the two processors. Could you enlight me ?
$\endgroup$
1
• $\begingroup$ There's a lot more going on in modern CPUs, which execute many instructions in parallel. $\endgroup$ Oct 24, 2019 at 20:14
2 Answers 2
0
$\begingroup$
If processor A and processor B took exactly the same amount of processor cycles to do the same work, and processor B had exactly twice the clock speed of processor A, then the time for a benchmark running on processor B would be exactly half the time of the same benchmark running on processor A.
But they don't take exactly the same number of cycles.
One big effect is that historically, the speed of RAM hasn't increased as much as the speed of processors. On an Apple II computer, every memory access took exactly one processor cycle. On a modern desktop computer, a memory access takes in the order of 100 processor cycles. If processor B has twice the clock speed of processor A, but the RAM isn't twice as fast, then a benchmark will not run in half the time.
But on the other hand, there are effects that make modern processors take less cycles for the same work than older ones. Examples are:
Larger and larger RAM caches, which mean there is less use of slow RAM.
Vector units, which may process for example 16 byte operations or four double precision floating point operations just as fast as a single byte or floating point operation.
Multiple processing units; where the processor can decode and process multiple instructions in the same cycle.
Shortened latency; for example a floating point multiplication might take7 cycles on an older processor, 5 on a newer, and 3 on the latest processor.
64 bit operations, more registers: A modern processor can add two 64 bit numbers in a single operation, while an older processor would need multiple operations. More registers means that more values can be kept in registers and need not be loaded and stored to memory all the time.
And so on.
$\endgroup$
1
• $\begingroup$ Thank you so much for the explanations $\endgroup$ Oct 26, 2019 at 7:32
0
$\begingroup$
Part of the benchmark might be limited by CPU time; other parts might be limited by IO or memory latency or other factors. Speeding up the clock frequency will speed up the first parts but not the second parts. As a result, doubling the clock frequency won't necessarily double the speed at which the benchmark is executed. So, the two ratios aren't necessarily equal.
$\endgroup$
1
• $\begingroup$ Hank you. Everything is clear $\endgroup$ Oct 24, 2019 at 22:28
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.801641 |
Two Sieving Problems
August 27, 2013
Whenever you need to enumerate a large number of primes, it is best to find a way to use a sieve to find them; generating candidates and testing them with a primality checker will always be slower. We use two different sieves to solve the two problems.
For the first problem, it is not possible to sieve by all the primes less than the square root of 1050 + 106; there are so many sieving primes that no one knows how many. What we do instead is sieve to some convenient limit, then apply a primality checker to those numbers that survive the sieve:
(define (big-primes lo hi delta limit)
(let* ((output (list))
(sieve (make-vector delta #t))
(ps (cdr (primes limit)))
(qs (map (lambda (p) (modulo (* -1/2 (+ lo p 1)) p)) ps)))
(let loop ((lo lo) (qs qs))
(if (not (< lo hi)) (reverse output)
(begin
(do ((i 0 (+ i 1))) ((= i delta)) (vector-set! sieve i #t))
(do ((ps ps (cdr ps)) (qs qs (cdr qs))) ((null? ps))
(do ((j (car qs) (+ j (car ps)))) ((<= delta j))
(vector-set! sieve j #f)))
(do ((i 0 (+ i 1)) (t (+ lo 1) (+ t 2)))
((or (<= delta i) (<= hi t)))
(if (and (vector-ref sieve i) (prime? t))
(set! output (cons t output))))
(loop (+ lo (* 2 delta))
(map (lambda (p q) (modulo (- q delta) p)) ps qs)))))))
This is just a segmented sieve, as in a prior exercise, but with the sieving primes in ps limited. It is called like this:
> (length (big-primes #e1e50 (+ #e1e50 #e1e6) 25000 1000000))
8737
That took a little bit less than a minute on my old slow machine at home. Only about one second of that minute was spent sieving, the rest of the time was devoted to checking the 40808 candidates that survived the sieve. Increasing limit to 2000000 reduced the candidate count to 38888, and increasing limit to 5000000 reduced the candidate count to 36551. Changing from a Miller-Rabin test with k = 10 to a single pseudoprimality test to base 2 left the result unchanged and saved only a little bit of time, proving Henri Cohen’s comment about “industrial-grade primes.”
The second problem uses a segmented sieve that contains only the numbers congruent to 1 (mod 4); thus, instead of sieving 2, 3, 4, 5, … or 3, 5, 7, 9, …, we sieve 5, 9, 13, 17, …. Here delta is one-quarter the segment length, instead of one-half, and the definition of the qs changes to reflect the numbers that are in the sieve:
(define (primes1mod4 lo hi delta)
(let* ((output (list))
(sieve (make-vector delta #t))
(ps (cdr (primes (isqrt hi))))
(qs (map (lambda (p) (modulo (* -1 (inverse 4 p) (+ lo p 1)) p)) ps)))
(let loop ((lo lo) (qs qs))
(if (not (< lo hi)) (reverse output)
(begin
(do ((i 0 (+ i 1))) ((= i delta)) (vector-set! sieve i #t))
(do ((ps ps (cdr ps)) (qs qs (cdr qs))) ((null? ps))
(do ((j (car qs) (+ j (car ps)))) ((<= delta j))
(vector-set! sieve j #f)))
(do ((i 0 (+ i 1)) (t (+ lo 1) (+ t 4)))
((or (<= delta i) (<= hi t)))
(if (vector-ref sieve i) (set! output (cons t output))))
(loop (+ lo (* 4 delta))
(map (lambda (p q) (modulo (- q delta) p)) ps qs)))))))
It takes only 70ms to solve the problem:
> (length (primes1mod4 1000000 2000000 25000))
35241
We have a bonus exercise today; it’s not about enumerating primes, but the solution does involve a sieve, so we include it here. The task is to make a list of all numbers less than or equal to n that have k distinct prime factors. For instance, with n = 25 and k = 1, the solution includes both prime numbers (their only factor is themselves) and prime powers (their only factor is the base prime): 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25. The solution is on the next page.
About these ads
Pages: 1 2 3
2 Responses to “Two Sieving Problems”
1. Graham said
My first answers are in J; it’s definitely cheating when your language has a
“prime factors of” function.
Problem 1:
+/@(1=#@q:)(10x^50)+1+i.1e6%2
This takes a very long time to get anywhere; the second is much faster:
+/@(1=#@q:)1e6+1+4*1e6%4
I originally had simpler answers, but decided that only working over odd
numbers (first question) or numbers equivalent to 1 mod 4 (second question) was
worth the uglification of my code.
My second answers are in Ruby; I can’t imagine trying to do these in a language
like C or C++, even with the help of multiprecision libraries like GMP or NTL.
I went with the Miller-Rabin primality test.
require 'mathn'
def decomp n
s, d = 0, n
while d.even?
s, d = s + 1, d >> 1
end
return s, d
end
def modpow n, e, m
r = 1
while e > 0
if e.odd?
r = (r * n) % m
end
e >>= 1
n = (n * n) % m
end
return r
end
def miller_rabin n, k=42
s, d= decomp(n - 1)
k.times do
a = 2 + rand(n - 4)
x = modpow a, d, n
next if [1, n - 1].include? x
flag = (s - 1).times do
x = (x * x) % n
return false if x == 1
break n - 1 if x == n - 1
end
next if flag == n - 1
return false
end
return true
end
class Integer
def prime?
return false if self < 2
return true if self == 2
return false if self.even?
return miller_rabin self
end
end
def problem1
(10**50 + 1 .. 10**50 + 10**6).step(2).select(&:prime?).length
end
def problem2
(10**6 + 1 .. 2 * 10**6).step(4).select(&:prime?).length
end
2. Paul said
A Python version with segments.
import time
from math import ceil, sqrt
from gmpy2 import is_prime
from ma.primegmp import sieve
def erase(flags, primes, q, n):
for pk, qk in zip(primes, q):
for i in xrange(qk, n, pk):
flags[i] = 0
def gen_sieve_seg(l, r, number_miller_rabin=25):
"""segmented sieve
uses prime numbes <= 1000000
checks candidates with miller rabin
"""
primes = list(sieve(1000000))
primes.remove(2)
q = [(-(l + 1 + pk) // 2) % pk for pk in primes]
n = ((r - l + 1) // 2)
flags = [1] * n
erase(flags, primes,q, n)
for i, f in enumerate(flags):
if f:
cand = l + i * 2 + 1
if is_prime(cand, number_miller_rabin):
yield cand
def gen_sieve_seg_4np1(l, r):
"""segmented sieve
ony numbers 4*n+1 are sieved
"""
primes = list(sieve(int(ceil(sqrt(r)))))
primes.remove(2)
assert not l % 4
q = [(-(l + 1 - (pk % 4) * pk) // 4) % pk for pk in primes]
n = (r - l) // 4
flags = [1] * n
erase(flags, primes,q, n)
for i, f in enumerate(flags):
if f:
yield l + i * 4 + 1
low = 10 ** 50
high = low + 10 ** 6
t0 = time.clock()
print sum(1 for p in gen_sieve_seg(low, high, 5)),
print "{:6.1f} sec".format(time.clock() - t0)
t0 = time.clock()
print sum(1 for p in gen_sieve_seg_4np1(1000000, 2000000)),
print "{:6.3f} sec".format(time.clock() - t0)
"""
8737 4.3 sec
35241 0.044 sec
"""
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Connecting to %s
Follow
Get every new post delivered to your Inbox.
Join 669 other followers
%d bloggers like this:
|
__label__pos
| 0.741518 |
NVIDIA Clara Parabricks
How the Documentation is Organized
• Introduction: This is the main page, which contains a brief introduction to Clara Parabricks: What it is, what it can do, and how it works.
• What's New? covers what's changed since the previous release: new tools, improvements to existing tools, and bug fixes.
• Getting Started with Clara Parabricks focuses on all the steps of setting up the software, including requirements, examples and optimizing it for performance
• Tutorials walks you through a single use of Clara Parabricks using an example dataset. The steps will familiarize the users with the software and walk you through a reproducible example. It will start from a reference and FASTQ files to a BAM file, then do variant calling on the BAM file, and produce a VCF file.
• How-Tos explores larger, more involved tasks, examining a wider variety of options, tools, and workflows. Owing to the larger data sets in use, a more capable hardware platform may be required (more GPUs, more memory, etc).
• Tool Reference contains reference documentation for each tool, organized both by category and alphabetically by tool name. It also tells users how to compare the output of Parabricks with the output from the baseline tools. A list of publications referencing Parabricks, a list of frequently asked question, and pointers on getting more help and information are also part of this section
What is Clara Parabricks?
Clara Parabricks is a free software suite for performing secondary analysis of next generation sequencing (NGS) DNA and RNA data. It delivers results at blazing fast speeds and low cost. Parabricks can analyze 30x WGS (whole human genome) data in about 25 minutes, instead of 30 hours for other methods. Its output matches commonly used software, making it fairly simple to verify the accuracy of the output.
How can I get Clara Parabricks?
Clara Parabricks is freely available as a public container on NGC to use on-premise or any cloud service platforms and providers. You can learn more about Parabricks on our webpage, including how to purchase enterprise support for Parabricks through NVIDIA AI Enterprise, with guaranteed response times, priority security notifications, and access to AI experts from NVIDIA. Users on DGX Cloud are able to utilize NVIDIA AI Enterprise for free.
See the following Cloud Startup guides for more information on using Parabricks in the cloud:
Why use Clara Parabricks?
Under the hood, Parabricks achieves this performance through tight integration with GPUs, which excel at performing data-parallel computation much more effectively than traditional CPU-based solutions. Parabricks was built from the ground up by GPU computing and Deep Learning experts who wanted to develop the fastest and most efficient possible implementation of common genomics algorithms used in secondary analysis.
Learn more at the Parabricks developer page.
Software Overview
Parabricks is a software suite for genomic analysis. It delivers major improvements in throughput time for common analytical tasks in genomics, including germline and somatic analysis. The core of the Parabricks software is its tight integration with the GPU, which takes raw data and transforms it according to the user's requirements.
The Parabricks software supports the tools shown below:
pb_tools_v4.0.png
Parabricks has been tested on Dell, HPE, IBM, and NVIDIA servers at Amazon Web Services, Google Cloud, Oracle Cloud Infrastructure, and Microsoft Azure.
How to Get Help
1. For technical support, updated user guides, and other Clara Parabricks documentation, see the NVIDIA Clara page.
2. Answers to most FAQs can be found on the developer forum.
© Copyright 2023, Nvidia. Last updated on Aug 30, 2023.
|
__label__pos
| 0.871417 |
C# vs. Java: Which is Better for Desktop Development?
C# vs. Java: Which is Better for Desktop Development?
Hey Coder, let’s dive into this epic showdown!
In the realm of desktop development, two titans stand tall: C# and Java. Both languages pack a punch, but which one reigns supreme? Let’s embark on a quest to uncover the strengths and weaknesses of each contender, helping you make an informed choice for your next desktop development adventure.
Performance and Efficiency
Blazing-Fast C#
C#, a true speed demon, boasts impressive performance thanks to its just-in-time (JIT) compilation. When your C# code kicks into gear, it transforms into native machine code, resulting in lightning-fast execution. This makes C# an excellent choice for resource-intensive applications where every millisecond counts.
Java’s Measured Approach
In the realm of performance, Java takes a different approach. Its virtual machine interprets bytecode, allowing it to run on various platforms. While this flexibility comes with a performance trade-off, Java still delivers solid performance for everyday desktop applications, making it a versatile option for cross-platform development.
Development Environment
Visual Studio’s C# Haven
C# developers rejoice in the embrace of Visual Studio, an integrated development environment (IDE) tailored specifically for their needs. Visual Studio offers a seamless experience, complete with code completion, debugging tools, and project management capabilities. It’s like having a coding superpower at your fingertips!
Eclipse: Java’s Versatile Comrade
Java developers, meet Eclipse, a formidable IDE that empowers you to tackle any development challenge. Its open-source nature means you can customize it to your heart’s desire, making it a playground for plugin enthusiasts. And with its cross-platform compatibility, you’re free to code anywhere, anytime.
C# vs. Java: Which is Better for Desktop Development?
Cross-Platform Compatibility
C#’s Windows-Centric World
C# developers, prepare for a Windows-centric experience. While C# can dabble in cross-platform development through tools like Mono, its true calling lies in the Microsoft ecosystem. This makes it a perfect choice for seamless integration with Windows-based applications and services.
Java’s Platform-Agnostic Prowess
Java, on the other hand, is a true platform-agnostic warrior. Its "write once, run anywhere" mantra is no joke. Applications crafted with Java can effortlessly traverse the boundaries of Windows, macOS, Linux, and even embedded systems. This universal appeal makes Java a champion for cross-platform desktop development.
Ecosystem and Community Support
C#’s .NET Embrace
The .NET framework stands as a pillar of support for C# developers. Its vast library of pre-built components, comprehensive documentation, and vibrant community make it a breeze to tackle complex projects. Whether you’re building a desktop application or exploring the world of cloud computing, .NET has got your back.
Java’s Community Colossus
Java boasts one of the largest and most active developer communities in the world. Countless online forums, tutorials, and open-source projects thrive within this ecosystem, ensuring that you’re never alone on your coding journey. And with Java’s long-standing presence, you can tap into a wealth of knowledge and experience.
Which Should You Choose?
C#: Your Windows Warrior
If your desktop development ambitions are centered around the Windows ecosystem, C# is your go-to choice. Its blazing performance, intuitive IDE, and seamless integration with Windows applications make it an ideal ally for your next project.
Java: Your Cross-Platform Crusader
But if your horizons extend beyond Windows and you seek a language that empowers you to conquer multiple platforms, Java beckons. Its platform-agnostic nature, vast community, and rich ecosystem make it the perfect choice for developers who value flexibility and cross-platform compatibility.
Comparative Table
Feature C# Java
Performance Faster Slower
Development Environment Visual Studio Eclipse
Cross-Platform Compatibility Windows-centric Cross-platform
Ecosystem and Community Support .NET framework Large and active community
Ideal for Windows-based desktop applications Cross-platform desktop applications
Conclusion
Hey Coder, you’ve now armed yourself with the knowledge to make an informed decision between C# and Java for your next desktop development adventure. Whether you embrace the Windows-centric prowess of C# or embark on a cross-platform journey with Java, remember that both languages offer unique strengths and passionate communities. Explore other articles on our platform to dive deeper into the world of programming and make the most of your coding escapades!
FAQ about C# vs. Java: Which is Better for Desktop Development?
1. Which language has better performance?
C# is slightly faster than Java due to its JIT compiler.
2. Which language has a richer library?
Both languages have extensive libraries, but C# has .NET Framework which provides a wider range of features.
3. Which language is easier to learn?
C# is often considered easier to learn for beginners due to its simpler syntax.
4. Which language is more popular?
Java is more popular overall, but C# is gaining ground in desktop development.
5. Which language has a better IDE?
Visual Studio (C#) and IntelliJ IDEA (Java) are both excellent IDEs with advanced features.
6. Which language is better for cross-platform development?
Java is primarily used for cross-platform development, while C# is better suited for Windows apps.
7. Which language is better for GUI development?
Both languages offer strong GUI development capabilities, but C# integrates well with Windows Forms and WPF.
8. Which language has better community support?
Both languages have large and active communities, providing extensive support.
9. Which language is better for game development?
C# is often preferred for game development due to its integration with Unity.
10. Which language should I choose for desktop development?
Consider the following factors:
• Performance: C#
• Library: C#
• Ease of learning: C#
• Popularity: Java
• IDE: Personal preference
• Cross-platform: Java
• GUI development: C#
• Community support: Both
• Game development: C#
Video Suggestions About : C# vs. Java: Which is Better for Desktop Development?
Zaky
Tech enthusiast passionate about keeping you updated on the latest advancements
Lihat semua artikel oleh Zaky
Leave a Reply
|
__label__pos
| 0.998875 |
Control 7
1)
f(x)= { |x−2|+3 0 ≤ x ≤5 −2 2 20 32 x + x− 5≤ x≤8 3 3 3 √ x−8 8 ≤ x ≤10 a) Realizar el gráfico |x−2|+3 = y |x−2| = y – 3 Se exige x-2 = 0 x=2 y-3 =0 y=3 .
Entonces −2 2 20 32 x + x− 3 3 3 5 ≤x ≤8 Calculamos el vértice x= −b 2a f(5) = = −20 3 −4 3 =5 −2 2 20 32 5 + 5− 3 3 3 =6 .6) y (8. Donde f(5)= 6 −2 2 20 32 8 + 8− 3 3 3 =0 luego f(8) = puntos (5.0) .
8] f es decreciente Luego √ x−8 f(8) = f(10) = 8 √ 8−8 √ 10−8 ≤x ≤10 =0 = √2 Con los dos puntos (8.0) y (10 . √2 ) .]5.
] 8.10 ] f es creciente .
.
b) Máximos es el punto (5.6) Mínimo es el punto ( 8.8] f es descreciente ]2.5[ U ] 8.0) c) Intervalos de crecimientos ] 0.2[ U ]5.10[ f es creciente .
|
__label__pos
| 0.998271 |
blob: c27ae02a3af3f0f9c152f01bdb79c98cb404bb05 [file] [log] [blame]
// Copyright 2014 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package datastore
import (
"context"
"errors"
"fmt"
"log"
"os"
"reflect"
"cloud.google.com/go/internal/trace"
"google.golang.org/api/option"
"google.golang.org/api/transport"
gtransport "google.golang.org/api/transport/grpc"
pb "google.golang.org/genproto/googleapis/datastore/v1"
"google.golang.org/grpc"
)
const (
prodAddr = "datastore.googleapis.com:443"
userAgent = "gcloud-golang-datastore/20160401"
)
// ScopeDatastore grants permissions to view and/or manage datastore entities
const ScopeDatastore = "https://www.googleapis.com/auth/datastore"
// DetectProjectID is a sentinel value that instructs NewClient to detect the
// project ID. It is given in place of the projectID argument. NewClient will
// use the project ID from the given credentials or the default credentials
// (https://developers.google.com/accounts/docs/application-default-credentials)
// if no credentials were provided. When providing credentials, not all
// options will allow NewClient to extract the project ID. Specifically a JWT
// does not have the project ID encoded.
const DetectProjectID = "*detect-project-id*"
// resourcePrefixHeader is the name of the metadata header used to indicate
// the resource being operated on.
const resourcePrefixHeader = "google-cloud-resource-prefix"
// Client is a client for reading and writing data in a datastore dataset.
type Client struct {
connPool gtransport.ConnPool
client pb.DatastoreClient
dataset string // Called dataset by the datastore API, synonym for project ID.
}
// NewClient creates a new Client for a given dataset. If the project ID is
// empty, it is derived from the DATASTORE_PROJECT_ID environment variable.
// If the DATASTORE_EMULATOR_HOST environment variable is set, client will use
// its value to connect to a locally-running datastore emulator.
// DetectProjectID can be passed as the projectID argument to instruct
// NewClient to detect the project ID from the credentials.
// Call (*Client).Close() when done with the client.
func NewClient(ctx context.Context, projectID string, opts ...option.ClientOption) (*Client, error) {
var o []option.ClientOption
// Environment variables for gcd emulator:
// https://cloud.google.com/datastore/docs/tools/datastore-emulator
// If the emulator is available, dial it without passing any credentials.
if addr := os.Getenv("DATASTORE_EMULATOR_HOST"); addr != "" {
o = []option.ClientOption{
option.WithEndpoint(addr),
option.WithoutAuthentication(),
option.WithGRPCDialOption(grpc.WithInsecure()),
}
if projectID == DetectProjectID {
projectID, _ = detectProjectID(ctx, opts...)
if projectID == "" {
projectID = "dummy-emulator-datastore-project"
}
}
} else {
o = []option.ClientOption{
option.WithEndpoint(prodAddr),
option.WithScopes(ScopeDatastore),
option.WithUserAgent(userAgent),
}
}
// Warn if we see the legacy emulator environment variables.
if os.Getenv("DATASTORE_HOST") != "" && os.Getenv("DATASTORE_EMULATOR_HOST") == "" {
log.Print("WARNING: legacy environment variable DATASTORE_HOST is ignored. Use DATASTORE_EMULATOR_HOST instead.")
}
if os.Getenv("DATASTORE_DATASET") != "" && os.Getenv("DATASTORE_PROJECT_ID") == "" {
log.Print("WARNING: legacy environment variable DATASTORE_DATASET is ignored. Use DATASTORE_PROJECT_ID instead.")
}
if projectID == "" {
projectID = os.Getenv("DATASTORE_PROJECT_ID")
}
o = append(o, opts...)
if projectID == DetectProjectID {
detected, err := detectProjectID(ctx, opts...)
if err != nil {
return nil, err
}
projectID = detected
}
if projectID == "" {
return nil, errors.New("datastore: missing project/dataset id")
}
connPool, err := gtransport.DialPool(ctx, o...)
if err != nil {
return nil, fmt.Errorf("dialing: %v", err)
}
return &Client{
connPool: connPool,
client: newDatastoreClient(connPool, projectID),
dataset: projectID,
}, nil
}
func detectProjectID(ctx context.Context, opts ...option.ClientOption) (string, error) {
creds, err := transport.Creds(ctx, opts...)
if err != nil {
return "", fmt.Errorf("fetching creds: %v", err)
}
if creds.ProjectID == "" {
return "", errors.New("datastore: see the docs on DetectProjectID")
}
return creds.ProjectID, nil
}
var (
// ErrInvalidEntityType is returned when functions like Get or Next are
// passed a dst or src argument of invalid type.
ErrInvalidEntityType = errors.New("datastore: invalid entity type")
// ErrInvalidKey is returned when an invalid key is presented.
ErrInvalidKey = errors.New("datastore: invalid key")
// ErrNoSuchEntity is returned when no entity was found for a given key.
ErrNoSuchEntity = errors.New("datastore: no such entity")
)
type multiArgType int
const (
multiArgTypeInvalid multiArgType = iota
multiArgTypePropertyLoadSaver
multiArgTypeStruct
multiArgTypeStructPtr
multiArgTypeInterface
)
// ErrFieldMismatch is returned when a field is to be loaded into a different
// type than the one it was stored from, or when a field is missing or
// unexported in the destination struct.
// StructType is the type of the struct pointed to by the destination argument
// passed to Get or to Iterator.Next.
type ErrFieldMismatch struct {
StructType reflect.Type
FieldName string
Reason string
}
func (e *ErrFieldMismatch) Error() string {
return fmt.Sprintf("datastore: cannot load field %q into a %q: %s",
e.FieldName, e.StructType, e.Reason)
}
// GeoPoint represents a location as latitude/longitude in degrees.
type GeoPoint struct {
Lat, Lng float64
}
// Valid returns whether a GeoPoint is within [-90, 90] latitude and [-180, 180] longitude.
func (g GeoPoint) Valid() bool {
return -90 <= g.Lat && g.Lat <= 90 && -180 <= g.Lng && g.Lng <= 180
}
func keyToProto(k *Key) *pb.Key {
if k == nil {
return nil
}
var path []*pb.Key_PathElement
for {
el := &pb.Key_PathElement{Kind: k.Kind}
if k.ID != 0 {
el.IdType = &pb.Key_PathElement_Id{Id: k.ID}
} else if k.Name != "" {
el.IdType = &pb.Key_PathElement_Name{Name: k.Name}
}
path = append(path, el)
if k.Parent == nil {
break
}
k = k.Parent
}
// The path should be in order [grandparent, parent, child]
// We did it backward above, so reverse back.
for i := 0; i < len(path)/2; i++ {
path[i], path[len(path)-i-1] = path[len(path)-i-1], path[i]
}
key := &pb.Key{Path: path}
if k.Namespace != "" {
key.PartitionId = &pb.PartitionId{
NamespaceId: k.Namespace,
}
}
return key
}
// protoToKey decodes a protocol buffer representation of a key into an
// equivalent *Key object. If the key is invalid, protoToKey will return the
// invalid key along with ErrInvalidKey.
func protoToKey(p *pb.Key) (*Key, error) {
var key *Key
var namespace string
if partition := p.PartitionId; partition != nil {
namespace = partition.NamespaceId
}
for _, el := range p.Path {
key = &Key{
Namespace: namespace,
Kind: el.Kind,
ID: el.GetId(),
Name: el.GetName(),
Parent: key,
}
}
if !key.valid() { // Also detects key == nil.
return key, ErrInvalidKey
}
return key, nil
}
// multiKeyToProto is a batch version of keyToProto.
func multiKeyToProto(keys []*Key) []*pb.Key {
ret := make([]*pb.Key, len(keys))
for i, k := range keys {
ret[i] = keyToProto(k)
}
return ret
}
// multiKeyToProto is a batch version of keyToProto.
func multiProtoToKey(keys []*pb.Key) ([]*Key, error) {
hasErr := false
ret := make([]*Key, len(keys))
err := make(MultiError, len(keys))
for i, k := range keys {
ret[i], err[i] = protoToKey(k)
if err[i] != nil {
hasErr = true
}
}
if hasErr {
return nil, err
}
return ret, nil
}
// multiValid is a batch version of Key.valid. It returns an error, not a
// []bool.
func multiValid(key []*Key) error {
invalid := false
for _, k := range key {
if !k.valid() {
invalid = true
break
}
}
if !invalid {
return nil
}
err := make(MultiError, len(key))
for i, k := range key {
if !k.valid() {
err[i] = ErrInvalidKey
}
}
return err
}
// checkMultiArg checks that v has type []S, []*S, []I, or []P, for some struct
// type S, for some interface type I, or some non-interface non-pointer type P
// such that P or *P implements PropertyLoadSaver.
//
// It returns what category the slice's elements are, and the reflect.Type
// that represents S, I or P.
//
// As a special case, PropertyList is an invalid type for v.
func checkMultiArg(v reflect.Value) (m multiArgType, elemType reflect.Type) {
// TODO(djd): multiArg is very confusing. Fold this logic into the
// relevant Put/Get methods to make the logic less opaque.
if v.Kind() != reflect.Slice {
return multiArgTypeInvalid, nil
}
if v.Type() == typeOfPropertyList {
return multiArgTypeInvalid, nil
}
elemType = v.Type().Elem()
if reflect.PtrTo(elemType).Implements(typeOfPropertyLoadSaver) {
return multiArgTypePropertyLoadSaver, elemType
}
switch elemType.Kind() {
case reflect.Struct:
return multiArgTypeStruct, elemType
case reflect.Interface:
return multiArgTypeInterface, elemType
case reflect.Ptr:
elemType = elemType.Elem()
if elemType.Kind() == reflect.Struct {
return multiArgTypeStructPtr, elemType
}
}
return multiArgTypeInvalid, nil
}
// Close closes the Client. Call Close to clean up resources when done with the
// Client.
func (c *Client) Close() error {
return c.connPool.Close()
}
// Get loads the entity stored for key into dst, which must be a struct pointer
// or implement PropertyLoadSaver. If there is no such entity for the key, Get
// returns ErrNoSuchEntity.
//
// The values of dst's unmatched struct fields are not modified, and matching
// slice-typed fields are not reset before appending to them. In particular, it
// is recommended to pass a pointer to a zero valued struct on each Get call.
//
// ErrFieldMismatch is returned when a field is to be loaded into a different
// type than the one it was stored from, or when a field is missing or
// unexported in the destination struct. ErrFieldMismatch is only returned if
// dst is a struct pointer.
func (c *Client) Get(ctx context.Context, key *Key, dst interface{}) (err error) {
ctx = trace.StartSpan(ctx, "cloud.google.com/go/datastore.Get")
defer func() { trace.EndSpan(ctx, err) }()
if dst == nil { // get catches nil interfaces; we need to catch nil ptr here
return ErrInvalidEntityType
}
err = c.get(ctx, []*Key{key}, []interface{}{dst}, nil)
if me, ok := err.(MultiError); ok {
return me[0]
}
return err
}
// GetMulti is a batch version of Get.
//
// dst must be a []S, []*S, []I or []P, for some struct type S, some interface
// type I, or some non-interface non-pointer type P such that P or *P
// implements PropertyLoadSaver. If an []I, each element must be a valid dst
// for Get: it must be a struct pointer or implement PropertyLoadSaver.
//
// As a special case, PropertyList is an invalid type for dst, even though a
// PropertyList is a slice of structs. It is treated as invalid to avoid being
// mistakenly passed when []PropertyList was intended.
//
// err may be a MultiError. See ExampleMultiError to check it.
func (c *Client) GetMulti(ctx context.Context, keys []*Key, dst interface{}) (err error) {
ctx = trace.StartSpan(ctx, "cloud.google.com/go/datastore.GetMulti")
defer func() { trace.EndSpan(ctx, err) }()
return c.get(ctx, keys, dst, nil)
}
func (c *Client) get(ctx context.Context, keys []*Key, dst interface{}, opts *pb.ReadOptions) error {
v := reflect.ValueOf(dst)
multiArgType, _ := checkMultiArg(v)
// Confidence checks
if multiArgType == multiArgTypeInvalid {
return errors.New("datastore: dst has invalid type")
}
if len(keys) != v.Len() {
return errors.New("datastore: keys and dst slices have different length")
}
if len(keys) == 0 {
return nil
}
// Go through keys, validate them, serialize then, and create a dict mapping them to their indices.
// Equal keys are deduped.
multiErr, any := make(MultiError, len(keys)), false
keyMap := make(map[string][]int, len(keys))
pbKeys := make([]*pb.Key, 0, len(keys))
for i, k := range keys {
if !k.valid() {
multiErr[i] = ErrInvalidKey
any = true
} else if k.Incomplete() {
multiErr[i] = fmt.Errorf("datastore: can't get the incomplete key: %v", k)
any = true
} else {
ks := k.String()
if _, ok := keyMap[ks]; !ok {
pbKeys = append(pbKeys, keyToProto(k))
}
keyMap[ks] = append(keyMap[ks], i)
}
}
if any {
return multiErr
}
req := &pb.LookupRequest{
ProjectId: c.dataset,
Keys: pbKeys,
ReadOptions: opts,
}
resp, err := c.client.Lookup(ctx, req)
if err != nil {
return err
}
found := resp.Found
missing := resp.Missing
// Upper bound 1000 iterations to prevent infinite loop. This matches the max
// number of Entities you can request from Datastore.
// Note that if ctx has a deadline, the deadline will probably
// be hit before we reach 1000 iterations.
for i := 0; len(resp.Deferred) > 0 && i < 1000; i++ {
req.Keys = resp.Deferred
resp, err = c.client.Lookup(ctx, req)
if err != nil {
return err
}
found = append(found, resp.Found...)
missing = append(missing, resp.Missing...)
}
filled := 0
for _, e := range found {
k, err := protoToKey(e.Entity.Key)
if err != nil {
return errors.New("datastore: internal error: server returned an invalid key")
}
filled += len(keyMap[k.String()])
for _, index := range keyMap[k.String()] {
elem := v.Index(index)
if multiArgType == multiArgTypePropertyLoadSaver || multiArgType == multiArgTypeStruct {
elem = elem.Addr()
}
if multiArgType == multiArgTypeStructPtr && elem.IsNil() {
elem.Set(reflect.New(elem.Type().Elem()))
}
if err := loadEntityProto(elem.Interface(), e.Entity); err != nil {
multiErr[index] = err
any = true
}
}
}
for _, e := range missing {
k, err := protoToKey(e.Entity.Key)
if err != nil {
return errors.New("datastore: internal error: server returned an invalid key")
}
filled += len(keyMap[k.String()])
for _, index := range keyMap[k.String()] {
multiErr[index] = ErrNoSuchEntity
}
any = true
}
if filled != len(keys) {
return errors.New("datastore: internal error: server returned the wrong number of entities")
}
if any {
return multiErr
}
return nil
}
// Put saves the entity src into the datastore with the given key. src must be
// a struct pointer or implement PropertyLoadSaver; if the struct pointer has
// any unexported fields they will be skipped. If the key is incomplete, the
// returned key will be a unique key generated by the datastore.
func (c *Client) Put(ctx context.Context, key *Key, src interface{}) (*Key, error) {
k, err := c.PutMulti(ctx, []*Key{key}, []interface{}{src})
if err != nil {
if me, ok := err.(MultiError); ok {
return nil, me[0]
}
return nil, err
}
return k[0], nil
}
// PutMulti is a batch version of Put.
//
// src must satisfy the same conditions as the dst argument to GetMulti.
// err may be a MultiError. See ExampleMultiError to check it.
func (c *Client) PutMulti(ctx context.Context, keys []*Key, src interface{}) (ret []*Key, err error) {
// TODO(jba): rewrite in terms of Mutate.
ctx = trace.StartSpan(ctx, "cloud.google.com/go/datastore.PutMulti")
defer func() { trace.EndSpan(ctx, err) }()
mutations, err := putMutations(keys, src)
if err != nil {
return nil, err
}
// Make the request.
req := &pb.CommitRequest{
ProjectId: c.dataset,
Mutations: mutations,
Mode: pb.CommitRequest_NON_TRANSACTIONAL,
}
resp, err := c.client.Commit(ctx, req)
if err != nil {
return nil, err
}
// Copy any newly minted keys into the returned keys.
ret = make([]*Key, len(keys))
for i, key := range keys {
if key.Incomplete() {
// This key is in the mutation results.
ret[i], err = protoToKey(resp.MutationResults[i].Key)
if err != nil {
return nil, errors.New("datastore: internal error: server returned an invalid key")
}
} else {
ret[i] = key
}
}
return ret, nil
}
func putMutations(keys []*Key, src interface{}) ([]*pb.Mutation, error) {
v := reflect.ValueOf(src)
multiArgType, _ := checkMultiArg(v)
if multiArgType == multiArgTypeInvalid {
return nil, errors.New("datastore: src has invalid type")
}
if len(keys) != v.Len() {
return nil, errors.New("datastore: key and src slices have different length")
}
if len(keys) == 0 {
return nil, nil
}
if err := multiValid(keys); err != nil {
return nil, err
}
mutations := make([]*pb.Mutation, 0, len(keys))
multiErr := make(MultiError, len(keys))
hasErr := false
for i, k := range keys {
elem := v.Index(i)
// Two cases where we need to take the address:
// 1) multiArgTypePropertyLoadSaver => &elem implements PLS
// 2) multiArgTypeStruct => saveEntity needs *struct
if multiArgType == multiArgTypePropertyLoadSaver || multiArgType == multiArgTypeStruct {
elem = elem.Addr()
}
p, err := saveEntity(k, elem.Interface())
if err != nil {
multiErr[i] = err
hasErr = true
}
var mut *pb.Mutation
if k.Incomplete() {
mut = &pb.Mutation{Operation: &pb.Mutation_Insert{Insert: p}}
} else {
mut = &pb.Mutation{Operation: &pb.Mutation_Upsert{Upsert: p}}
}
mutations = append(mutations, mut)
}
if hasErr {
return nil, multiErr
}
return mutations, nil
}
// Delete deletes the entity for the given key.
func (c *Client) Delete(ctx context.Context, key *Key) error {
err := c.DeleteMulti(ctx, []*Key{key})
if me, ok := err.(MultiError); ok {
return me[0]
}
return err
}
// DeleteMulti is a batch version of Delete.
//
// err may be a MultiError. See ExampleMultiError to check it.
func (c *Client) DeleteMulti(ctx context.Context, keys []*Key) (err error) {
// TODO(jba): rewrite in terms of Mutate.
ctx = trace.StartSpan(ctx, "cloud.google.com/go/datastore.DeleteMulti")
defer func() { trace.EndSpan(ctx, err) }()
mutations, err := deleteMutations(keys)
if err != nil {
return err
}
req := &pb.CommitRequest{
ProjectId: c.dataset,
Mutations: mutations,
Mode: pb.CommitRequest_NON_TRANSACTIONAL,
}
_, err = c.client.Commit(ctx, req)
return err
}
func deleteMutations(keys []*Key) ([]*pb.Mutation, error) {
mutations := make([]*pb.Mutation, 0, len(keys))
set := make(map[string]bool, len(keys))
multiErr := make(MultiError, len(keys))
hasErr := false
for i, k := range keys {
if !k.valid() {
multiErr[i] = ErrInvalidKey
hasErr = true
} else if k.Incomplete() {
multiErr[i] = fmt.Errorf("datastore: can't delete the incomplete key: %v", k)
hasErr = true
} else {
ks := k.String()
if !set[ks] {
mutations = append(mutations, &pb.Mutation{
Operation: &pb.Mutation_Delete{Delete: keyToProto(k)},
})
}
set[ks] = true
}
}
if hasErr {
return nil, multiErr
}
return mutations, nil
}
// Mutate applies one or more mutations. Mutations are applied in
// non-transactional mode. If you need atomicity, use Transaction.Mutate.
// It returns the keys of the argument Mutations, in the same order.
//
// If any of the mutations are invalid, Mutate returns a MultiError with the errors.
// Mutate returns a MultiError in this case even if there is only one Mutation.
// See ExampleMultiError to check it.
func (c *Client) Mutate(ctx context.Context, muts ...*Mutation) (ret []*Key, err error) {
ctx = trace.StartSpan(ctx, "cloud.google.com/go/datastore.Mutate")
defer func() { trace.EndSpan(ctx, err) }()
pmuts, err := mutationProtos(muts)
if err != nil {
return nil, err
}
req := &pb.CommitRequest{
ProjectId: c.dataset,
Mutations: pmuts,
Mode: pb.CommitRequest_NON_TRANSACTIONAL,
}
resp, err := c.client.Commit(ctx, req)
if err != nil {
return nil, err
}
// Copy any newly minted keys into the returned keys.
ret = make([]*Key, len(muts))
for i, mut := range muts {
if mut.key.Incomplete() {
// This key is in the mutation results.
ret[i], err = protoToKey(resp.MutationResults[i].Key)
if err != nil {
return nil, errors.New("datastore: internal error: server returned an invalid key")
}
} else {
ret[i] = mut.key
}
}
return ret, nil
}
|
__label__pos
| 0.999446 |
What is 92 to the 80th Power?
So you want to know what 92 to the 80th power is do you? In this article we'll explain exactly how to perform the mathematical operation called "the exponentiation of 92 to the power of 80". That might sound fancy, but we'll explain this with no jargon! Let's do it.
What is an Exponentiation?
Let's get our terms nailed down first and then we can see how to work out what 92 to the 80th power is.
When we talk about exponentiation all we really mean is that we are multiplying a number which we call the base (in this case 92) by itself a certain number of times. The exponent is the number of times to multiply 92 by itself, which in this case is 80 times.
92 to the Power of 80
There are a number of ways this can be expressed and the most common ways you'll see 92 to the 80th shown are:
• 9280
• 92^80
So basically, you'll either see the exponent using superscript (to make it smaller and slightly above the base number) or you'll use the caret symbol (^) to signify the exponent. The caret is useful in situations where you might not want or need to use superscript.
So we mentioned that exponentation means multiplying the base number by itself for the exponent number of times. Let's look at that a little more visually:
92 to the 80th Power = 92 x ... x 92 (80 times)
So What is the Answer?
Now that we've explained the theory behind this, let's crunch the numbers and figure out what 92 to the 80th power is:
92 to the power of 80 = 9280 = 12,677,283,066,568,630,515,734,362,093,843,821,839,158,979,182,036,604,996,578,063,442,292,186,734,597,124,855,078,761,870,527,311,721,931,333,689,630,043,893,295,958,704,564,328,771,398,999,934,988,007,243,776
Why do we use exponentiations like 9280 anyway? Well, it makes it much easier for us to write multiplications and conduct mathematical operations with both large and small numbers when you are working with numbers with a lot of trailing zeroes or a lot of decimal places.
Hopefully this article has helped you to understand how and why we use exponentiation and given you the answer you were originally looking for. Now that you know what 92 to the 80th power is you can continue on your merry way.
Feel free to share this article with a friend if you think it will help them, or continue on down to find some more examples.
Cite, Link, or Reference This Page
If you found this content useful in your research, please do us a great favor and use the tool below to make sure you properly reference us wherever you use it. We really appreciate your support!
• "What is 92 to the 80th Power?". VisualFractions.com. Accessed on August 17, 2022. http://visualfractions.com/calculator/exponent/what-is-92-to-the-80th-power/.
• "What is 92 to the 80th Power?". VisualFractions.com, http://visualfractions.com/calculator/exponent/what-is-92-to-the-80th-power/. Accessed 17 August, 2022.
• What is 92 to the 80th Power?. VisualFractions.com. Retrieved from http://visualfractions.com/calculator/exponent/what-is-92-to-the-80th-power/.
Exponentiation Calculator
Want to find the answer to another problem? Enter your number and power below and click calculate.
Calculate Exponentiation
Random List of Exponentiation Examples
If you made it this far you must REALLY like exponentiation! Here are some random calculations for you:
|
__label__pos
| 0.824713 |
[SOLVED] Api Keybinds Controlling The Metronome?
Ok, this starts from me seeing Protman’s “Set Octave to” -autogenerator - which basically is:
for oct=0,9 do
renoise.tool():add_keybinding {
name = "Pattern Editor:Impulse:Set Note to Octave " .. oct,
invoke = function() Octave(oct) end
}
end
I get the concept. do a for oct 0 - 9 and get a total of 10 “Set Note to Octave” keybinds.
So I tried to do this:
for met=0,16 do
renoise.tool():add_keybinding {
name = "Global:Impulse Set:Metronome to " .. met,
invoke = function() met_tick2(met) end
}
end
.
That made the 17 keybinds, but while Protman’s octave(oct) does seem to somehow discuss what’s going on with the keyboard, or respond to the keybinding number being called, I couldn’t, for the life of me, figure out how to get mine to do what the number received by the keybinding would want to do.
I’m really fascinated by this capability to set the metronome tick amount, it’s really quite awesome. I know I can just sit down and do 17 functions and 17 shortcuts by hand and it’ll work, but this could be a load of fun to get done “like this”, faster, because then by setting
renoise.song().transport.metronome_beats_per_bar
quickly, it’ll be a easy to set one for
renoise.song().transport.metronome_lines_per_beat
Since the number is observable, I can see how one would eventually be able to halve and double the metronome speeds with shortcuts :)
Ok, I’m making some headway. Now I hit my head on “what if it’s 0”. I realize that I can still just limit first met to 1-16 and met2 = 0 or something like that, and just have two functions, but it’d be sweet to have both functions in the same thing, i.e. learn a bit about “routing if not 0” “routing if 0” stuff.
Here’s what I’m trying to hack at currently:
function met_tick2(met)
if ((met > 0))
then
renoise.song().transport.metronome_enabled = true
renoise.song().transport.metronome_beats_per_bar=met
else
renoise.song().transport.metronome_enabled = false
renoise.song().transport.metronome_beats_per_bar=met
end
end
renoise.tool():add_keybinding {
name = "Global:Impulse Set: Metronome Off",
invoke = function() metoff()
end
}
for met=0,16 do
renoise.tool():add_keybinding {
name = "Global:Impulse Set:Metronome to " .. met,
invoke = function() met_tick2(met) end
}
end
shift-1 - shift-9 work nicely, and shift-0 works by stopping the metronome and then crashing :D
And the solution is, of course:
function met_tick2(met)
if ((met > 0))
then
renoise.song().transport.metronome_enabled = true
renoise.song().transport.metronome_beats_per_bar=met
else
renoise.song().transport.metronome_enabled = false
-- renoise.song().transport.metronome_beats_per_bar=met
end
end
:huh:
You could code it a little shorter…
function met_tick2(met)
if met then
renoise.song().transport.metronome_enabled = true
else
renoise.song().transport.metronome_enabled = false
end
renoise.song().transport.metronome_beats_per_bar=met
end
if met is something it is always not 0.
Ofcourse there are languages where a variable is something as long as it isn’t [nil]. But in Lua you have to specifically measure if a variable is NIL before comparing it to any content.
else “if met then” would generate a “variable is nil” error.
However the above metronome_beats_per_bar=met doesn’t work when the value is “0” because it should always start at 1.
If Renoise really crashes upon it, that is a bug and should be fixed.
1 Like
Ok, apologies for being a bit vague. In this case I meant that the keyshortcuts of that specific script stopped functioning if I hi “set to 0” before I managed to figure out how to route it to stop :)
I don’t really know how to crash Renoise itself.
Your simplification is much appreciated, btw :)
Btw, for me, the code you supplied, when implemented, killed the “to 0” feature for LPB and Bars per Beat. I started getting errors stating that LPb and Beats per Bar can’t be set to 0. That’s why I made it in the way I could, so that shift-0 would do a different feature and LPB/BarsPerBeat would not start reporting errors.
I added the “does not work” line because you didn’t mentioned you were getting those errors but said Renoise crashed instead. But you cleared that out in your previous post. So all’s cool :) (already was)
I fixed it (Metronome LPB 0-16, Metronome Bars per Beat 0-16) and added it to here
This topic was automatically closed 2 days after the last reply. New replies are no longer allowed.
|
__label__pos
| 0.68345 |
本以为是分治法 谁知道
This day, Xcx gets a bar of chocolate which can be divided into n*m rectangles. But the chocolate is bitten by Dby, one is the upper left corner while one is the lower right corner. So Xcx thinks if every time he eats a 1*2 rectangle on the last chocolate, can he eat the chocolate up?
一块巧克力，可以看成n*m个1*1的小块，我也不知道为什么这样理解，左上角和右下角被各吃去一块1*1的，
问，每次吃1*2的矩形，能否吃完
分析：本来以为是分治法，看着有点像棋盘覆盖，但是比赛的时候看他们都交的那么快，我就很不解，最后问同学才知道
只要n m一个奇数一个偶数就可以吃完，mmp这傻逼题，ORZ
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 1000006
#define ll long long
using namespace std;
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)!=EOF){
if(a%2==0&&b%2==0)
printf("No\n");
else if(a%2==1&&b%2==1)
printf("No\n");
else
printf("Yes\n");
}
return 0;
}
阅读更多
想对作者说点什么？
博主推荐
换一批
没有更多推荐了，返回首页
|
__label__pos
| 0.999483 |
《Dubbo 实现原理与源码解析 —— 精品合集》 《Netty 实现原理与源码解析 —— 精品合集》
《Spring 实现原理与源码解析 —— 精品合集》 《MyBatis 实现原理与源码解析 —— 精品合集》
《Spring MVC 实现原理与源码解析 —— 精品合集》 《数据库实体设计合集》
《Spring Boot 实现原理与源码解析 —— 精品合集》 《Java 面试题 + Java 学习指南》
摘要: 原创出处 juejin.im/post/5c4481a4f265da613438aec3 「保洁阿姨」欢迎转载，保留摘要，谢谢！
🙂🙂🙂关注**微信公众号：【芋道源码】**有福利：
1. RocketMQ / MyCAT / Sharding-JDBC 所有源码分析文章列表
2. RocketMQ / MyCAT / Sharding-JDBC 中文注释源码 GitHub 地址
3. 您对于源码的疑问每条留言将得到认真回复。甚至不知道如何读源码也可以请教噢
4. 新的源码解析文章实时收到通知。每周更新一篇左右
5. 认真的源码交流微信群。
得知了RPC（远程过程调用）简单来说就是调用远程的服务就像调用本地方法一样，其中用到的知识有序列化和反序列化、动态代理、网络传输、动态加载、反射这些知识点。发现这些知识都了解一些。所以就想着试试自己实现一个简单的RPC框架，即巩固了基础的知识，也能更加深入的了解RPC原理。当然一个完整的RPC框架包含了许多的功能，例如服务的发现与治理，网关等等。本篇只是简单的实现了一个调用的过程。
传参出参分析
一个简单请求可以抽象为两步
那么就根据这两步进行分析，在请求之前我们应该发送给服务端什么信息？而服务端处理完以后应该返回客户端什么信息？
在请求之前我们应该发送给服务端什么信息？
由于我们在客户端调用的是服务端提供的接口，所以我们需要将客户端调用的信息传输过去，那么我们可以将要传输的信息分为两类
• 第一类是服务端可以根据这个信息找到相应的接口实现类和方法
• 第二类是调用此方法传输的参数信息
那么我们就根据要传输的两类信息进行分析，什么信息能够找到相应的实现类的相应的方法？要找到方法必须要先找到类，这里我们可以简单的用Spring提供的Bean实例管理ApplicationContext进行类的寻找。所以要找到类的实例只需要知道此类的名字就行，找到了类的实例，那么如何找到方法呢？在反射中通过反射能够根据方法名和参数类型从而找到这个方法。那么此时第一类的信息我们就明了了，那么就建立相应的是实体类存储这些信息。
@Data
public class Request implements Serializable {
private static final long serialVersionUID = 3933918042687238629L;
private String className;
private String methodName;
private Class<?> [] parameTypes;
private Object [] parameters;
}
服务端处理完以后应该返回客户端什么信息？
上面我们分析了客户端应该传输什么信息给服务端，那么服务端处理完以后应该传什么样的返回值呢？这里我们只考虑最简单的情况，客户端请求的线程也会一直在等着，不会有异步处理这一说，所以这么分析的话就简单了，直接将得到的处理结果返回就行了。
@Data
public class Response implements Serializable {
private static final long serialVersionUID = -2393333111247658778L;
private Object result;
}
由于都涉及到了网络传输，所以都要实现序列化的接口
如何获得传参信息并执行？-客户端
上面我们分析了客户端向服务端发送的信息都有哪些？那么我们如何获得这些信息呢？首先我们调用的是接口，所以我们需要写自定义注解然后在程序启动的时候将这些信息加载在Spring容器中。有了这些信息那么我们就需要传输了，调用接口但是实际上执行的确实网络传输的过程，所以我们需要动态代理。那么就可以分为以下两步
• 初始化信息阶段：将key为接口名，value为动态接口类注册进Spring容器中
• 执行阶段：通过动态代理，实际执行网络传输
初始化信息阶段
由于我们使用Spring作为Bean的管理，所以要将接口和对应的代理类注册进Spring容器中。而我们如何找到我们想要调用的接口类呢？我们可以自定义注解进行扫描。将想要调用的接口全部注册进容器中。
创建一个注解类，用于标注哪些接口是可以进行Rpc的
@Target({ElementType.TYPE})
@Retention(RetentionPolicy.RUNTIME)
public @interface RpcClient {
}
然后创建对于@RpcClient注解的扫描类RpcInitConfig，将其注册进Spring容器中
public class RpcInitConfig implements ImportBeanDefinitionRegistrar{
@Override
public void registerBeanDefinitions(AnnotationMetadata importingClassMetadata, BeanDefinitionRegistry registry) {
ClassPathScanningCandidateComponentProvider provider = getScanner();
//设置扫描器
provider.addIncludeFilter(new AnnotationTypeFilter(RpcClient.class));
//扫描此包下的所有带有@RpcClient的注解的类
Set<BeanDefinition> beanDefinitionSet = provider.findCandidateComponents("com.example.rpcclient.client");
for (BeanDefinition beanDefinition : beanDefinitionSet){
if (beanDefinition instanceof AnnotatedBeanDefinition){
//获得注解上的参数信息
AnnotatedBeanDefinition annotatedBeanDefinition = (AnnotatedBeanDefinition) beanDefinition;
String beanClassAllName = beanDefinition.getBeanClassName();
Map<String, Object> paraMap = annotatedBeanDefinition.getMetadata()
.getAnnotationAttributes(RpcClient.class.getCanonicalName());
//将RpcClient的工厂类注册进去
BeanDefinitionBuilder builder = BeanDefinitionBuilder
.genericBeanDefinition(RpcClinetFactoryBean.class);
//设置RpcClinetFactoryBean工厂类中的构造函数的值
builder.addConstructorArgValue(beanClassAllName);
builder.getBeanDefinition().setAutowireMode(AbstractBeanDefinition.AUTOWIRE_BY_TYPE);
//将其注册进容器中
registry.registerBeanDefinition(
beanClassAllName ,
builder.getBeanDefinition());
}
}
}
//允许Spring扫描接口上的注解
protected ClassPathScanningCandidateComponentProvider getScanner() {
return new ClassPathScanningCandidateComponentProvider(false) {
@Override
protected boolean isCandidateComponent(AnnotatedBeanDefinition beanDefinition) {
return beanDefinition.getMetadata().isInterface() && beanDefinition.getMetadata().isIndependent();
}
};
}
}
由于上面注册的是工厂类，所以我们建立一个工厂类RpcClinetFactoryBean继承Spring中的FactoryBean类，由其统一创建@RpcClient注解的代理类
如果对FactoryBean类不了解的可以参见FactoryBean讲解
@Data
public class RpcClinetFactoryBean implements FactoryBean {
@Autowired
private RpcDynamicPro rpcDynamicPro;
private Class<?> classType;
public RpcClinetFactoryBean(Class<?> classType) {
this.classType = classType;
}
@Override
public Object getObject(){
ClassLoader classLoader = classType.getClassLoader();
Object object = Proxy.newProxyInstance(classLoader,new Class<?>[]{classType},rpcDynamicPro);
return object;
}
@Override
public Class<?> getObjectType() {
return this.classType;
}
@Override
public boolean isSingleton() {
return false;
}
}
注意此处的getObjectType方法，在将工厂类注入到容器中的时候，这个方法返回的是什么Class类型那么注册进容器中就是什么Class类型。
然后看一下我们创建的代理类rpcDynamicPro
@Component
@Slf4j
public class RpcDynamicPro implements InvocationHandler {
@Override
public Object invoke(Object proxy, Method method, Object[] args) throws Throwable {
String requestJson = objectToJson(method,args);
Socket client = new Socket("127.0.0.1", 20006);
client.setSoTimeout(10000);
//获取Socket的输出流，用来发送数据到服务端
PrintStream out = new PrintStream(client.getOutputStream());
//获取Socket的输入流，用来接收从服务端发送过来的数据
BufferedReader buf = new BufferedReader(new InputStreamReader(client.getInputStream()));
//发送数据到服务端
out.println(requestJson);
Response response = new Response();
Gson gson =new Gson();
try{
//从服务器端接收数据有个时间限制（系统自设，也可以自己设置），超过了这个时间，便会抛出该异常
String responsJson = buf.readLine();
response = gson.fromJson(responsJson, Response.class);
}catch(SocketTimeoutException e){
log.info("Time out, No response");
}
if(client != null){
//如果构造函数建立起了连接，则关闭套接字，如果没有建立起连接，自然不用关闭
client.close(); //只关闭socket，其关联的输入输出流也会被关闭
}
return response.getResult();
}
public String objectToJson(Method method,Object [] args){
Request request = new Request();
String methodName = method.getName();
Class<?>[] parameterTypes = method.getParameterTypes();
String className = method.getDeclaringClass().getName();
request.setMethodName(methodName);
request.setParameTypes(parameterTypes);
request.setParameters(args);
request.setClassName(getClassName(className));
GsonBuilder gsonBuilder = new GsonBuilder();
gsonBuilder.registerTypeAdapterFactory(new ClassTypeAdapterFactory());
Gson gson = gsonBuilder.create();
return gson.toJson(request);
}
private String getClassName(String beanClassName){
String className = beanClassName.substring(beanClassName.lastIndexOf(".")+1);
className = className.substring(0,1).toLowerCase() + className.substring(1);
return className;
}
}
我们的客户端已经写完了，传给服务端的信息我们也已经拼装完毕了。剩下的工作就简单了，开始编写服务端的代码。
服务端处理完以后应该返回客户端什么信息？-服务端
服务端的代码相比较客户端来说要简单一些。可以简单分为下面三步
• 拿到接口名以后，通过接口名找到实现类
• 通过反射进行对应方法的执行
• 返回执行完的信息
那么我们就根据这三步进行编写代码
拿到接口名以后，通过接口名找到实现类
如何通过接口名拿到对应接口的实现类呢？这就需要我们在服务端启动的时候将其对应信息加载进去
@Component
@Log4j
public class InitRpcConfig implements CommandLineRunner {
@Autowired
private ApplicationContext applicationContext;
public static Map<String,Object> rpcServiceMap = new HashMap<>();
@Override
public void run(String... args) throws Exception {
Map<String, Object> beansWithAnnotation = applicationContext.getBeansWithAnnotation(Service.class);
for (Object bean: beansWithAnnotation.values()){
Class<?> clazz = bean.getClass();
Class<?>[] interfaces = clazz.getInterfaces();
for (Class<?> inter : interfaces){
rpcServiceMap.put(getClassName(inter.getName()),bean);
log.info("已经加载的服务:"+inter.getName());
}
}
}
private String getClassName(String beanClassName){
String className = beanClassName.substring(beanClassName.lastIndexOf(".")+1);
className = className.substring(0,1).toLowerCase() + className.substring(1);
return className;
}
}
此时rpcServiceMap存储的就是接口名和其对应的实现类的对应关系。
通过反射进行对应方法的执行
此时拿到了对应关系以后就能根据客户端传过来的信息找到相应的实现类中的方法。然后进行执行并返回信息就行
public Response invokeMethod(Request request){
String className = request.getClassName();
String methodName = request.getMethodName();
Object[] parameters = request.getParameters();
Class<?>[] parameTypes = request.getParameTypes();
Object o = InitRpcConfig.rpcServiceMap.get(className);
Response response = new Response();
try {
Method method = o.getClass().getDeclaredMethod(methodName, parameTypes);
Object invokeMethod = method.invoke(o, parameters);
response.setResult(invokeMethod);
} catch (NoSuchMethodException e) {
log.info("没有找到"+methodName);
} catch (IllegalAccessException e) {
log.info("执行错误"+parameters);
} catch (InvocationTargetException e) {
log.info("执行错误"+parameters);
}
return response;
}
现在我们两个服务都启动起来并且在客户端进行调用就发现只是调用接口就能调用过来了。
总结
到现在一个简单的RPC就完成了，但是其中还有很多的功能需要完善，例如一个完整RPC框架肯定还需要服务注册与发现，而且双方通信肯定也不能是直接开启一个线程一直在等着，肯定需要是异步的等等的各种功能。后面随着学习的深入，这个框架也会慢慢增加一些东西。不仅是对所学知识的一个应用，更是一个总结。有时候学一个东西学起来觉得很简单，但是真正应用的时候就会发现各种各样的小问题。比如在写这个例子的时候碰到一个问题就是@Autowired的时候一直找不到SendMessage的类型，最后才发现是工厂类RpcClinetFactoryBean中的getObjectType中的返回类型写错了，我之前写的是
public Class<?> getObjectType() {
return this.getClass();;
}
这样的话注册进容器的就是RpcClinetFactoryBean类型的而不是SendMessage的类型。
文章目录
1. 1. 传参出参分析
1. 1.1. 在请求之前我们应该发送给服务端什么信息？
2. 1.2. 服务端处理完以后应该返回客户端什么信息？
2. 2. 如何获得传参信息并执行？-客户端
1. 2.1. 初始化信息阶段
3. 3. 服务端处理完以后应该返回客户端什么信息？-服务端
1. 3.1. 拿到接口名以后，通过接口名找到实现类
2. 3.2. 通过反射进行对应方法的执行
4. 4. 总结
|
__label__pos
| 0.943558 |
A Downloader Controller
From AwkwardTV
Revision as of 07:57, 20 April 2007 by Alan quatermain (talk | contribs) (The 'emacs save twitch' strikes again, half-way through...)
Jump to: navigation, search
<Google>WIKI</Google>
Back in the first article in this series we created a BRControl wrapper around the ProgressBar widget. I said then that we would put this to use shortly, and so we will. In today's tutorial we will look at a more substantive example of plugin development, including localizations and resources, some preferences, and asynchronous download from the internet.
Our end result will be a controller which downloads from a URL stored in our preferences, displaying the progress of the download as it does so. It will also show a method for supporting resumption of an interrupted download.
Plugin Developers' Toolkit
Since we're going to look at a real-world example today, it seems right that we introduce some important items for your toolkit: resources, localizations, and the preferences system.
Resource Access
This is the simplest of the three; the interface to access your own resources and those of the BackRow framework is simply the NSBundle class. For you own resources, you fetch the bundle containing your own class, like so:
[[NSBundle bundleForClass: [self class]] pathForResource: name of type: type];
For an object within the BackRow framework itself, such as a standard image, the intro movie or the strings file containing error descriptions, use the backRowFramework( ) function, like so:
[backRowFramework( ) pathForResource: name ofType: type];
Having retrieved a path to the item in question, you can then access the resource directly, or create a URL using [NSURL fileURLWithPath:] as appropriate.
Localization
Localization is handled mostly by the BRLocalizedStringManager class. It offers four different functions for locating localized strings:
+ (NSString *) backRowLocalizedStringForKey: (NSString *) key inFile: (NSString *) stringsFile;
+ (NSString *) applicationLocalizedStringForKey: (NSString *) key inFile: (NSString *) stringsFile;
+ (NSString *) appliance: (id) anyObjInAppliance localizedStringForKey: (NSString *) key inFile: (NSString *) stringsFile;
+ (NSString *) localizedStringForKey: (NSSrting *) key inFile: (NSString *) stringsFile fromBundle: (NSBundle *) bundle;
The base routine used to fetch the string is +localizedStringForKey:inFile:fromBundle:, and the other three simply pull together the parameters for that call. The +applicationLocalizedStringForKey:inFile: call is used to locate a string within the bundle of the actual current application (i.e. the Finder). The other two are used to fetch data from the BackRow framework or from the bundle of the calling appliance. For strings within your appliance's default strings file 'Localizable.strings', you would use:
NSString * localized = [BRLocalizedStringManager appliance: self localizedStringForKey: @"SomeString" inFile: nil]
If you have other strings files, you can specify the name of the one you want (minus the '.strings' extension) in the last parameter of that call.
So, we have an easy way of reading our own localized strings, but that's only good for reading. When we use the NSLocalizedString() macro normally, we are able to use the genstrings command-line utility to generate the strings files themselves. Fortunately, genstrings can be told to look for a different form of macro from the default 'NSLocalizedString', meaning we can define our own BackRow-based versions. To do this, create a file in your project called something like 'BRLocalizations.h', and put this inside it:
#import <BackRow/BRLocalizedStringManager.h>
#define BRLocalizedString(key, comment) \
[BRLocalizedStringManager appliance:self localizedStringForKey:(key) inFile:nil]
#define BRLocalizedStringFromTable(key, table, comment) \
[BRLocalizedStringManager appliance:self localizedStringForKey:(key) inFile:(table)]
You can then run the following command from your poject directory to generate your strings files:
genstrings -s BRLocalizedString -o English.lproj/
Preferences
You can, as always, use NSUserDefaults to manage your own preferences. However, BackRow provides an interface for both the FrontRow preferences and those for specific named domains. To retrieve a value from the FrontRow preferences you can use the RUIPreferences object:
int displayID = [[RUIPreferences sharedFrontRowPreferences] integerForKey: @"FrontRowUsePreferredDisplayID"];
To use a specific preference domain, you can use the 'RUIPreferenceManager' object:
int displayID = [[RUIPreferenceManager sharedPreferences] integerForKey: @"FrontRowUsePreferredDisplayID" domain: @"com.apple.frontrow"];
Both classes provide synchronization facilities. RUIPreferences provides -setSynchronizeOnWrite: (BOOL) sync and -syncNow while RUIPreferenceManager provides the -syncDomain: (NSString *) domain function.
Directory Locations
This section isn't much to do with BackRow, admittedly, but it is useful in the context of the tutorial in general, since we'll be using this method to locate the folder used to hold our downloads.
The file at <Foundation/NSPathUtilities.h> contains the values you'll need for this, and a handy Objective-C wrapper for the NSSystemDirectories API (in <NSSystemDirectories.h>). You can use this to get lists of directories matching certain criteria. Within that header file you'll find two enumerations; the top one identifies a specific folder (Application Support, Documents, Library, etc.), and the lower one specifies masks for the different domains in which they can exist (System, Local, User, Network, etc.). So, to get a list of all paths for the Application Support folders in the Local and User domains, you would use:
NSArray * searchPath = NSSearchPathForDirectoriesInDomains(NSApplicationSupportDirectory, NSUserDomainMask | NSLocalDomainMask, YES);
This call would return the following list of paths:
/Users/[username]/Library/Application Support
/Library/Application Support
In the main example, we'll use this to place our downloaded data into the user's Caches folder.
Downloading Data
To download data to a file (as opposed to simply retrieving an NSData object) we'll use the NSURLDownload class. This supports resumption of data and also in-transit decoding of certain MIME types: MacBinary, BinHex, and GZip. Note that partially-downloaded files decoded from Gzip format cannot be resumed, so if resumption is more important you might choose to disable decoding of that MIME type by implementing -download:shouldDecodeSourceDataOfMIMEType: and returning NO for the Gzip MIME type.
To begin a new download, you need to create an NSURLRequest and hand that to the NSURLDownload constructor. Since we would like to resume any partial downloads, we'll tell the downloader not to delete the file when it fails (or is cancelled).
NSURLRequest * request = [NSURLRequest requestWithURL: url cachePolicy: NSURLRequestUseProtocolCachePolicy timeoutInterval: 20.0];
NSURLDownload * download = [[NSURLDownload alloc] initWithRequest: request delegate: self];
[download setDeletesFileUponFailure: NO];
To resume an existing download, we can pass the resume data (from a prior call to NSURLDownload's -resumeData method) into a new NSURLDownload instance. If the initializer returns nil in this case, resumption wasn't possible and the download must be restarted from the beginning.
[[NSURLDownload alloc] initWIthResumeData: data delegate: self path: downloadedFilePath];
The Download Controller
Unlike the last couple of examples, there is a fair amount of code involved in this class, so I won't include all of it here. However, you can download the sample project provided at the end to see the whole thing. Here I will include the main parts needed for starting the download and maintaining progress, but I'll leave out some of the NSURLDownload delegate methods and such.
Member Variables
Our class will need a few member variables to maintain state nicely. Firstly we'll have some UI controls for the title, the URL, and the download progress:
BRHeaderControl * _header;
BRTextControl * _sourceText;
QuProgressBarControl * _progressBar;
We will also need some items to manage the download itself:
NSURLDownload * _downloader;
NSString * _outputPath;
long long _totalLength;
long long _gotLength;
Implementation
Firstly, let's define a useful method for determining the name of our downloaded file. Here we'll use NSSearchPathForDirectoriesInDomains() to get the path for the current user's Caches folder, then append some items to it. We'll use a .download folder similar to that used by Safari, so that we can store resume data within there if the user presses the menu button before we've finished downloading. This function will return the path to the actual file within the .download folder, however.
+ (NSString *) outputPathForURLString: (NSString *) urlstr
{
NSString * cachePath = nil;
NSArray * list = NSSearchPathForDirectoriesInDomains( NSCachesDirectory, NSUserDomainMask, YES );
if ( (list != nil) && ([list count] != 0) )
cachePath = [list objectAtIndex: 0];
else
cachePath = NSTemporaryDirectory( );
cachePath = [cachePath stringByAppendingPathComponent: @"QuDownloads"];
// ensure this exists
[[NSFileManager defaultManager] createDirectoryAtPath: cachePath attributes: nil];
NSString * name = [urlstr lastPathComponent];
// trim any parameters from the URL
NSRange range = [name rangeOfString: @"?"];
if ( range.location != NSNotFound )
name = [name substringToIndex: range.location];
NSString * folder = [[name stringByDeletingPathExtension] stringByAppendingPathExtension: @"download"];
return ( [NSString pathWithComponents: [NSArray arrayWIthObjects: cachePath, folder, name, nil]] );
}
Now we'll need some stack callbacks to make us do things at opportune times. When we're pushed we will begin the download, and when popped we will cancel (saving resume data if applicable).
- (void) wasPushed
{
if ( [self beginDownload] == NO )
{
[_header setTitle: @"Download Failed"];
[_progressBar setPercentage: 0.0f];
[[self scene] renderScene];
}
[super wasPushed];
}
- (void) willBePopped
{
[self cancelDownload];
[super willBePopped];
}
We'll also need some methods for handling the download itself. Firstly, we'll have the plain start-downloading function:
- (BOOL) beginDownload
{
// see if we can resume a partial download
if ( [self resumeDownload] == YES )
return ( YES );
// didn't work, so delete & try again
[self deleteDownload];
// fetch from prefs, or provide a default value
NSString * urlstr = [[RUIPreferenceManager sharedPreferences] stringForKey: @"QuDownloadURL"
forDomain: @"org.quatermain.downloader"];
// my mate's band, woo!
if ( urlstr == nil )
urlstr = @"http://homepage.mac.com/jimdovey/nukes/nukes/files/BiggerThanYouEP.mp3";
NSURL * url = [NSURL URLWithString: urlstr];
if ( url == nil )
return ( NO );
NSURLRequest * req = [NSURLRequest requestWithURL: url
cachePolicy: NSURLRequestUseProtocolCachePolicy timeoutInterval: 20.0];
// create the downloader
_downloader = [[NSURLDownload alloc] initWithRequest: req delegate: self];
if ( _downloader == nil )
return ( NO );
// we'll make sure anything downloaded stays around if we cancel or it fails haflway through
[_downloader setDeletesFileUponFailure: NO];
return ( YES );
}
Resumption of a download looks similar to the sequence above:
- (BOOL) resumeDownload
{
NSString * resumeDataPath = [[_outputPath stringByDeletingLastPathComponent]
stringByAppendingPathComponent: @"ResumeData"];
if ( [[NSFIleManager defaultManager] fileExistsAtPath: resumeDataPath] == NO )
return ( NO );
NSData * resumeData = [NSData dataWithContentsOfFile: resumeDataPath];
if ( (resumeData == nil) || ([resumeData length] == 0) )
return ( NO );
// try to initialize using the saved data
_downloader = [[NSURLDownload alloc] initWithResumeData: resumeData
delegate: self path: _outputPath];
if ( _downloader == nil )
return ( NO );
[_downloader setDeletesFileUponFailure: NO];
return ( YES );
}
- (void) cancelDownload;
Since we're using the NSURLDownload class, we will need to implement some delegate methods:
|
__label__pos
| 0.926356 |
user3550879 user3550879 - 4 months ago 6
CSS Question
centering content within a centered div
I have a div inside a div which has content in it (content created dynamically) I have gotten the child div to center vertically but can't vertically center the content inside. I am using Bootstrap.
css
.main {
position: relative;
min-height: 600px;
width: 100%;
margin: 0; padding: 0;
}
#content {
position: absolute;
display: inline-block;
text-align: center;
margin: auto;
max-width: 60%;
top: 50%; right: 0; left: 0; bottom: 0;
transform:translateY(-50%)
}
#content p {
position: relative;
font-weight: 500;
font-size: 3.5em;
line-height: 1.25em;
color: #fff;
}
html
<div class="row">
<div class="main" style="">
<div id="content">
<p> text content </p> ( this is inputted by Wordpress/post )
</div>
</div>
</div>
Answer
You can use a flexbox:
.main {
min-height: 300px;
background-color: rgba(0, 0, 0, 0.3);
display: flex;
justify-content: center;
align-items: center;
}
#content {
background-color: rgba(0, 0, 0, 0.4);
height: 100px;
display: flex;
justify-content: center;
align-items: center;
}
#content p {
color: white;
}
<div class="row">
<div class="main" style="">
<div id="content">
<p> text content </p>
</div>
</div>
</div>
Comments
|
__label__pos
| 0.987047 |
170 Inches to Meters
170 inches equal to 4.318 meters, To convert 170 inches to meters, multiply 170 by 0.0254 or simply use below inches to meters online calculator tool.
170 Inches to Meters converter. How many meters in 170 inches?
170 Inches equal to 4.318 Meters or there are 4.318 meters in 170 inches.
As we know, 1 inch is equal to 0.0254 meter. We can convert inches to Meters by multiplying with 0.0254.
1 inch = 0.0254 meter
170 inches = 170 x 0.0254 = 4.318 meters
170 Meters to Inches converter. How many inches in 170 meters?
170 meters equal to 6692.917 inches or there are 6692.917 inches in 170 meters.
As we know, 1 meter is equal to 39.3701 inches. We can convert inches to Meters by multiplying with 39.3701.
1 meter = 39.3701 inchs
170 meter = 170 x 39.3701 = 6692.917 inches
Popular inches to meters conversion
|
__label__pos
| 0.999738 |
The hopeful of keeping MXM 3.0b alive thread!
Discussion in 'Gaming (Software and Graphics Cards)' started by King of Interns, Aug 17, 2016.
1. woodzstack
woodzstack Alezka Computers , Official Clevo reseller.
Reputations:
1,142
Messages:
3,378
Likes Received:
2,485
Trophy Points:
231
Well, honestly thank you for helping them, because it's obviously helped the aftermarket community a great deal, and that is just something simply not to ignore in my books.
Like if there was an aftermarket award we'd probably vote you for sure, haha. Every so often I'm stumped and do not know how to help someone regarding a vbios, and I send them your way or in some cases to SVET if it's an MSI thing, like a system bios or EC on a model I've never touched.
I have a question mind you, these EURO 1070's , should be able to use a MSI 1070 vbios and work fine , correct ?
I have both cards here sitting infront of me, I could flash them using the SOFI tool and junk, just they are not exactly broken or used cards so if something screws it up, I've not been willing to experiment and find out exactly, so was wondering if you already know what to expect.
I asked EUROCOM to be the one to test, and I was shocked that they refused to do it, or share why. Though they agreed to do it if I send them one of my spare systems, with an eDP panel, like the AW17. (because the EURO 1070 works only Optimus in it, whereas the MSI 1070 would support the eDP and Optimus).
If you could help us with this, you would be helping a great number of people, I know for sure, there would be at least an immediate 50 people who want to know this, especially if the EURO 1070 works with the MSI vbios instead of it's own.
(or could it be modded to use different components to become more stable, of should I bring that up to someone who like soldering extra components onto his cards, like Kenglish or however it's spelled from T|I ?)
jaybee83 likes this.
2. Prema
Prema Your Freedom, Your Choice
Reputations:
7,284
Messages:
5,695
Likes Received:
13,305
Trophy Points:
681
You can flash them, but the 115W/125W limit of other vBIOS may not be healthy for these 90W cards.
If those vBs actually fix the eDP bug (first time I hear about that, make sure it's not a system BIOS problem), then drop the TDP to 100W or below if you plan on selling them like that. We have seen many of these 90W cards MOSFETs fail with higher TDP vBIOS. The original G-Cube cards with missing MOSFETs even fail with their original 90W vBIOS.
Vasudev, woodzstack, triturbo and 4 others like this.
3. jaybee83
jaybee83 Biotech-Doc
Reputations:
3,021
Messages:
10,403
Likes Received:
7,263
Trophy Points:
931
YES! this post is worth its (virtual) weight in gold :) thanks again for clear cut info on this! ive been wondering a long time about this...
edit: crap, cant rep you for this, gotta spread the love around first :rolleyes:
Vasudev and woodzstack like this.
4. woodzstack
woodzstack Alezka Computers , Official Clevo reseller.
Reputations:
1,142
Messages:
3,378
Likes Received:
2,485
Trophy Points:
231
Yeah been wondering this, and thanks. I guess we will try and flash them and see how it goes, or what happens.
now theres a thread around here helping people lower TDP values when flashing or with the tool, guess I will go peek over at that and see whats what, maybe keeping the TDP low at 90W would be a smart move.
But the real thing is, whats s different about the 1070 from MSI and the other 1070. If it's a system bios issue, will it stop affecting the EURO 1070's (as we have c0me to call them) from working with eDP panels in the AW17 and such. ( IRC they work in other laptops just fine, like a clevo with eDP)
jaybee83 likes this.
5. woodzstack
woodzstack Alezka Computers , Official Clevo reseller.
Reputations:
1,142
Messages:
3,378
Likes Received:
2,485
Trophy Points:
231
The only thing missing here, is, EUROCOM's MSI 1070's are G-Sync cards, meanwhile the EURO 1070 they have is not a G-Sync card, if I understand correctly this can cause issues or brick the card right ?
I would need a MSI 1070 that is not a G-Sync card, to fetch the vbios from. Do you by chance have one or know of someone with one ?
Vasudev likes this.
6. Falkentyne
Falkentyne Notebook Virtuoso
Reputations:
4,266
Messages:
3,937
Likes Received:
5,143
Trophy Points:
581
Ask someone with a GT83VR SLI. I believe those are not gsync cards.
Tried to msg you on discord but you didn't reply.
*Edit* try this.
Please don't yell at me if it bricks something.
Attached Files:
Vasudev, jaybee83 and woodzstack like this.
7. woodzstack
woodzstack Alezka Computers , Official Clevo reseller.
Reputations:
1,142
Messages:
3,378
Likes Received:
2,485
Trophy Points:
231
Awesome, thank you !
Vasudev likes this.
8. SMGJohn
SMGJohn Notebook Consultant
Reputations:
15
Messages:
162
Likes Received:
78
Trophy Points:
41
bennyg and long2905 like this.
9. yrekabakery
yrekabakery Notebook Deity
Reputations:
191
Messages:
813
Likes Received:
744
Trophy Points:
106
SMGJohn, Papusan and jaybee83 like this.
10. jaybee83
jaybee83 Biotech-Doc
Reputations:
3,021
Messages:
10,403
Likes Received:
7,263
Trophy Points:
931
just waiting for the first double tripod on soldered CPU/GPU/RAM/Storage "high performance" laptop :rolleyes:o_O
Falkentyne likes this.
Loading...
Similar Threads - hopeful keeping alive
1. Jajo240
Replies:
23
Views:
1,811
Share This Page
|
__label__pos
| 0.826953 |
Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » Divide fractions
Divide 2/20 with 2/28
2/20 ÷ 2/28 is 7/5.
Steps for dividing fractions
1. Find the reciprocal of the divisor
Reciprocal of 2/28: 28/2
2. Now, multiply it with the dividend
So, 2/20 ÷ 2/28 = 2/20 × 28/2
3. = 2 × 28/20 × 2 = 56/40
4. After reducing the fraction, the answer is 7/5
5. In mixed form: 12/5
MathStep (Works offline)
Download our mobile app and learn to work with fractions in your own time:
Android and iPhone/ iPad
Related:
© everydaycalculation.com
|
__label__pos
| 0.77164 |
Skein is a cryptographic hash function. It was designed for the SHA-3 competition where it became a finalist, but wasn't chosen as SHA-3.
learn more… | top users | synonyms
1
vote
1answer
176 views
Tree hash and multithreading for parallelism
I am using tree hash mode of Skein on a 16 core processor. Will it automatically employ parallelism using more than one cores or do I have to use multi-threading within the tree hash for parallel ...
1
vote
1answer
88 views
What's the difference between “HashX-512” and “HashX-1024”?
I need to make a Skein hash's, specifically, Skein-1024; however, I only have access currently to Skein-512. Is there any way to utilize a Skein-512 function to get the result of a Skein-1024 hash? ...
7
votes
1answer
227 views
Why does Skein use an output transform, but other similar hashes don't?
Skein uses an additional compression function call to finalize the output, even when the output isn't larger than the native output size. The Skein paper says: Due to Skein’s output ...
|
__label__pos
| 0.981787 |
-1
\$\begingroup\$
I have the following code in matlab and since the matrices are huge it takes more than one hour. I wanted to know where the bottle neck is and if there is any way to optimize this and make it faster.
...
for j = 1:1:2500
if (getappdata(h, 'canceling')) %Cancel waitbar
break;
end
waitbar((j * dz)/max, h, 'Calc.');
H = (stp * H')';
Intn((j)+1, :) = H .* conj(H);
xs2 = - lp(j);
xe2 = lp(j);
for m = 1:1:4097
if (x(m) < xs) && (x(m) >= start)
n(m) = 1;
elseif (x(m) > xe) && (x(m) <= ende)
n(m) = 1;
elseif (x(m) > xs2 && x(m) < xe2)
n(m) = 1;
else
n(m) = 0;
end
end
in = [(k0^2 * (n.^2 - nbar^2) - 2 * 1/stepx^2), (ran2 + 1/stepx^2 - ran2), (ran2 + 1/stepx^2 - ran2)];
P = sparse(zl, sp, in);
N = P/(2*k) + P^2/(4*k^3);
N = sparse(N);
D = eye(length(H)) + 3*P/(4*k^2) + P^2/(16*k^4);
D = sparse(D);
stp = (D + 1i*dz/2 * N)/(D - 1i*dz/2 * N);
end
where dz,xs,xe,xs2,xe2,max are Inetegers. H, x and lp are arrays of type double with 4000, 4000 and 10,000 elements. Intn is a two dimentional matrix 10,000 x 4000.
\$\endgroup\$
migrated from stackoverflow.com Apr 25 '17 at 10:50
This question came from our site for professional and enthusiast programmers.
• \$\begingroup\$ First use the profiler to measure the time each line of code takes, then get back to us with the actual operation you want to speed up. \$\endgroup\$ – Adriaan Apr 25 '17 at 10:23
• \$\begingroup\$ My suggestion would be profiler as well, but also get rid of the waitbar stuff - why waste time on that especially on such a fine step. Also replace the for m loop with logical indexing. \$\endgroup\$ – Adrian Apr 25 '17 at 10:26
• \$\begingroup\$ I am trying to use the profiler but it takes so long that I thought maybe there is an obvious time consuming action that I dont know about. @Adriaan Everything is allocated before the loop. \$\endgroup\$ – dieKoderin Apr 25 '17 at 12:18
• 3
\$\begingroup\$ You should change the title to describe what your code does, not what you want out of the review, as the current title describes basically every MATLAB question asked here on Code Review. Have a look at our help center and "How do I ask a good question?". \$\endgroup\$ – Graipher Apr 25 '17 at 13:37
• \$\begingroup\$ You can use the profiler. Just change for i = 1:1:2500 to for i = 1:50, or even for i = 1:5. The bottleneck should be the same place regardless of the number of iterations. \$\endgroup\$ – Stewie Griffin Aug 29 '17 at 6:00
7
\$\begingroup\$
Profiler
I want to know where the bottle neck is... Use the profiler to find out, then you will know which specific lines to tackle. Note: the profiler itself will slow things down, so remember to turn it off when you are finished profiling.
Optimising code:
• You can get rid of needless operations like + ran2 - ran2, won't make a big difference but cleans things up.
% old
in = [(k0^2 * (n.^2 - nbar^2) - 2 * 1/stepx^2), (ran2 + 1/stepx^2 - ran2), (ran2 + 1/stepx^2 - ran2)];
% new
in = [(k0^2 * (n.^2 - nbar^2) - 2 * 1/stepx^2), 1/stepx^2, 1/stepx^2];
• There are several things which don't change in your loop (like stepx), which should have their calculations taken outside the loop.
stepx2 = 1/stepx^2;
for j = 1:2500
...
in = [(k0^2 * (n.^2 - nbar^2) - 2 * stepx2), stepx2, stepx2];
...
This thinking can also be applied to things like length(H), which never changes but is calculated every loop iteration.
• Getting rid of the waitbar stuff will speed things up too. A note about the waitbar calculation too, you shouldn't be using max as a variable name, it is a very common in-built function name which you've over-ridden!
• Replace the m for loop with logical indexing
...
xe2 = lp(j);
n = zeros(nx, 1); % Where nx was defined outside the loop as length(x)
n(x < xs & x >= start) = 1;
n(x > xe & x <= ende) = 1;
n(x > xs2 & x < xe2) = 1;
in = ...
Or in one indexing line:
n = zeros(nx, 1); % or n = zeros(size(x));
n((x < xs & x >= start) | (x > xe & x <= ende) | (x > xs2 & x < xe2)) = 1;
Beyond that, you will have to look at the profiler results and see which lines to target.
\$\endgroup\$
• \$\begingroup\$ Thanks for your answer. As I said in the comments above I tried the profiler but it takes so long that I thought maybe there is an obvious time consuming action that I dont know about.and about your tips. in the first one, one ran2 is in Nominator and the next one in denominator. you cant just eliminate them. and length(H) is changing in every iteration. The rest was useful. Thanks. \$\endgroup\$ – dieKoderin Apr 25 '17 at 12:22
• \$\begingroup\$ @Mary, The way you have them set up, they are not in the numerator and denominator!! You need to use brackets, otherwise you can eliminate them (and Matlab will)! Use like ran2frac = (ran2 + 1)/(stepx^2 - ran2) before the loop, and then use that variable where appropriate. Please mark this answer as accepted if it helped. \$\endgroup\$ – Wolfie Apr 25 '17 at 12:43
• \$\begingroup\$ I'm Sry. the first one was in order to have a vector not scalar value. and for the logical indexing, the way you wrote is not working. Because n and x are two different vectors. I am checking my x and changing my n. \$\endgroup\$ – dieKoderin Apr 25 '17 at 15:27
• \$\begingroup\$ @Mary You can use logical indexing for "checking x and changing n", as long as they are the same size (which they are because I initialisen to be the same size as x). Note I made an error originally by using n = zeros(nx) instead of n = zeros(nx,1), or just n = zeros(size(x)), I've edited my answer. \$\endgroup\$ – Wolfie Apr 25 '17 at 15:31
• \$\begingroup\$ The logical indexing should speed this up quite a bit. I'd guess that it's the bottleneck. \$\endgroup\$ – Stewie Griffin Aug 29 '17 at 6:12
1
\$\begingroup\$
MATLAB matrices are stored column-wise, not row-wise. That means, it's a lot faster to work on complete rows instead of complete columns.
I suggest changing the following line:
Intn((j)+1, :) = H .* conj(H);
to
Intn(:, j+1) = (H .* conj(H)).' % or transposing it at some other point in the code.
Notice that I use .' and not '. That's because you're working with complex numbers, and ' is the complex conjugate transpose, not the regular transpose.
The following is taken from my SO answer here
%% Columns
a = rand(n);
b = zeros(n,1);
tic
for ii = 1:n
b = b + a(:,ii);
end
toc
Elapsed time is 0.252358 seconds.
%% Rows:
a = rand(n);
b = zeros(1,n);
tic
for ii = 1:n
b = b + a(ii,:);
end
toc
Elapsed time is 2.593381 seconds.
More than 10 times as fast when working on columns!
\$\endgroup\$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.780516 |
We build Web & Mobile Applications.
< All Articles
Ooh la la: Paperclip et les European S3 buckets
UPDATE! This issue has been resolved in later releases of Paperclip - check the version of Paperclip you are using to make sure you have the latest.
At the end of my last blog about Paperclip I mentioned that you need to do some patching if you want to use European S3 buckets to store your files. The problem was introduced when Paperclip made the move from RightAWS to Marcel Molina’s AWS::S3 gem. Unfortunately despite several forks containing patches to AWS::S3 and a 4 month old bug report nothing has been done to officially fix the problem.
So my fellow Europeans, what are we to do?
At the moment there are a couple of options that you might like to try, the first is the quick (and slightly dirty) fix I put together a while back to get things working when a deadline was looming. The second involves dumping AWS::S3 and moving to a European-friendly S3 library, which is the direction I’d like to see Paperclip take.
Option #1 - the quick and dirty patches
Five months ago I first hit this problem when moving one of our Rails apps over to S3 and at that time there were only a few forks of AWS::S3 that attempted to support European buckets. For reasons that are hazy to me now, but probably simply because it worked, I chose to borrow a patch from Vlad Romascanu. If you want to monkey-patch the AWS::S3 gem to use Vlad’s changes then do the following (if you prefer you could of course grab a copy of Vlad’s fork and build a Gem from it):
1. Make sure AWS::S3 is in your environment.rb file:
config.gem "aws-s3", :lib => "aws/s3"
2. Create a file called aws.rb in RAILS_ROOT/lib/patches
3. Copy and paste the following code into it (or get the gist):
module AWS
module S3
class Authentication
class CanonicalString
def initialize(request, options = {})
super()
@request = request
@headers = {}
@options = options
# "For non-authenticated or anonymous requests. A NotImplemented error result code will be returned if
# an authenticated (signed) request specifies a Host: header other than 's3.amazonaws.com'"
# (from http://docs.amazonwebservices.com/AmazonS3/2006-03-01/VirtualHosting.html)
request['Host'] = AWS::S3::Base.connection.subdomain || DEFAULT_HOST
build
end
private
def build
self <<: "#{request.method}\n"
ensure_date_is_valid
initialize_headers
set_expiry!
headers.sort_by {|k, _| k}.each do |key, value|
value = value.to_s.strip
self << (key =~ self.class.amazon_header_prefix ? "#{key}:#{value}" : value)
self << "\n"
end
self << (AWS::S3::Base.connection.subdomain ? "/#{AWS::S3::Base.connection.subdomain}#{path}" : path)
end
end
end
class Bucket
class << self
private
def path(name, options = {})
if name.is_a?(Hash)
options = name
name = nil
end
bucket_name(name) == connection.subdomain ? "/#{RequestOptions.process(options).to_query_string}" : "/#{bucket_name(name)}#{RequestOptions.process(options).to_query_string}"
end
end
end
class Connection
def subdomain
http.address[/^(.+)\.#{DEFAULT_HOST}$/, 1]
end
end
class S3Object
class << self
def path!(bucket, name, options = {}) #:nodoc:
# We're using the second argument for options
if bucket.is_a?(Hash)
options.replace(bucket)
bucket = nil
end
bucket_name(bucket) == connection.subdomain ? "/#{name}" : "/#{bucket_name(bucket)}/#{name}"
end
end
end
end
end
4. Require the patch from an initializer. I typically do this using the following code which loads any Ruby file in the RAILS_ROOT/lib/patches directory:
Dir[File.join(Rails.root, 'lib', 'patches', '**', '*.rb')].sort.each { |patch| require(patch) }
The above code fixes AWS::S3 but Paperclip also needs some love: it needs to pass a :server option when the storage module establishes a connection to S3, the to_file method needs to be patched to use binary mode on Windows (ah that old chestnut again!) and to handle non-existent objects more gracefully, making it more consistent with the file system storage module. To make the changes:
1. Create a file called paperclip.rb in RAILS_ROOT/lib/patches
2. Copy and paste the following code into it (or get the gist):
module Paperclip
module Storage
module S3
# Patch s3 storage initialisation to pass server name to aws/s3
def self.extended(base)
require 'aws/s3'
base.instance_eval do
@s3_credentials = parse_credentials(@options[:s3_credentials])
@bucket = @options[:bucket] || @s3_credentials[:bucket]
@bucket = @bucket.call(self) if @bucket.is_a?(Proc)
@s3_options = @options[:s3_options] || {}
@s3_permissions = @options[:s3_permissions] || :public_read
@s3_protocol = @options[:s3_protocol] || (@s3_permissions == :public_read ? 'http' : 'https')
@s3_headers = @options[:s3_headers] || {}
@s3_host_alias = @options[:s3_host_alias]
@url = ":s3_path_url" unless @url.to_s.match(/^:s3.*url$/)
AWS::S3::Base.establish_connection!( @s3_options.merge(
:access_key_id => @s3_credentials[:access_key_id],
:secret_access_key => @s3_credentials[:secret_access_key],
:server => "#{@bucket}.s3.amazonaws.com"
))
end
Paperclip.interpolates(:s3_alias_url) do |attachment, style|
"#{attachment.s3_protocol}://#{attachment.s3_host_alias}/#{attachment.path(style).gsub(%r{^/}, "")}"
end
Paperclip.interpolates(:s3_path_url) do |attachment, style|
"#{attachment.s3_protocol}://s3.amazonaws.com/#{attachment.bucket_name}/#{attachment.path(style).gsub(%r{^/}, "")}"
end
Paperclip.interpolates(:s3_domain_url) do |attachment, style|
"#{attachment.s3_protocol}://#{attachment.bucket_name}.s3.amazonaws.com/#{attachment.path(style).gsub(%r{^/}, "")}"
end
end
# Patch to use binmode on Windows
def to_file(style = default_style)
return @queued_for_write[style] if @queued_for_write[style]
begin
file = Tempfile.new(path(style))
file.binmode if file.respond_to?(:binmode)
file.write(AWS::S3::S3Object.value(path(style), bucket_name))
file.rewind
rescue AWS::S3::NoSuchKey
file.close if file.respond_to?(:close)
file = nil
end
file
end
end
end
end
3. If you’re using the patch loading code from earlier then that’s all you need to do, otherwise make sure you require this patch file from an initializer.
Having patched everything up, all that remains is to change your has_attached_file definitions to configure them to use S3, for example:
has_attached_file :photo,
:styles => { :small => '105x', :large => '415x' },
:storage => :s3,
:s3_credentials => File.join(Rails.root, 'config', 's3.yml'),
:url => ':s3_domain_url',
:path => ':attachment/:id/:style:extension'
As you can see the storage module is set to S3 and the :s3_credentials option is configured to use the s3.yml file, which should look something like this:
common: &common
access_key_id: yourkeyhere
secret_access_key: your/secret+here
development:
<<: *common
bucket: app-name-development
test:
<<: *common
bucket: app-name-test
production:
<<: *common
bucket: app-name-production
And finally the :url option is set to use the :s3_domain_url interpolation: this is important as European buckets can only be accessed using domain URLs (e.g. http://app-name-bucket.s3.amazonaws.com/object_path) or aliased URLs using CNAMEs and the :s3_alias_url interpolation.
So there you have it: support for European buckets with Paperclip. As workarounds go this is fairly straight forward, but the good news is that there is a slightly simpler solution.
Option #2 - use a different S3 gem (and patch!)
Last week I needed to write some code to manage objects on S3 in a non-Paperclip scenario. Having immediately ruled out AWS::S3 I decided to see what, if any, newer gems were available. A quick search of RubyGems revealed the not-so-imaginatively named S3 gem: with full support for European buckets and a nice, straightforward syntax I decided to give it a try.
One of the first things I tend to do when trying a new gem or plugin is to have a poke about in the source code to get a feel for how nice the code is, and while doing this with S3 I came across a custom storage module for Paperclip (and there’s one for attachment_fu too).
The current version of the S3 gem (0.2.4) doesn’t support time expiring URLs for accessing private objects so, until 0.2.5 is released, using the gem is a little more work than it would otherwise be:
1. Grab a copy of the gem source:
git clone git://github.com/qoobaa/s3.git
2. Change to the source code directory and use Rake to build and install the gem with rake install.
3. Add the gem to your application’s environment.rb:
config.gem "s3"
4. Create a file called paperclip.rb in RAILS_ROOT/lib/patches
5. Copy and paste the contents of the module file into the file you created in step 4 (or get the gist which includes the changes from steps 6 and 7 so you can skip on to step 8).
6. Add the expiring_url method to the module, the code looks like this:
def expiring_url(style_name = default_style, time = 3600)
bucket.objects.build(path(style_name)).temporary_url(Time.current + time)
end
7. The to_file method also needs patching to better handle non-existing objects and if you’re running on Windows you’ll also want to patch it to handle binary files:
def to_file style_name = default_style
return @queued_for_write[style_name] if @queued_for_write[style_name]
begin
file = Tempfile.new(path(style_name))
file.binmode if file.respond_to?(:binmode)
file.write(bucket.objects.find(path(style_name)).content)
file.rewind
rescue ::S3::Error::NoSuchKey
file.close if file.respond_to?(:close)
file = nil
end
file
end
8. Require the patch from an initializer (see option #1 for an explanation of this code).
Dir[File.join(Rails.root, 'lib', 'patches', '**', '*.rb')].sort.each { |patch| require(patch) }
9. Configure your model in the same way as described in option #1 and your good to go!
The lesser of two evils
At the moment neither of the above options are ideal. The S3 gem has the advantage of being more actively maintained than AWS::S3, and some of the steps to get it working with Paperclip will be simplified when the next version of the gem is released. While both options involve patching, the patches for S3 are much more trivial when compared with those for AWS::S3, reducing the risk for breakage when Paperclip is updated.
I’d really like to see S3 become the official gem for Paperclip so that it just works without all this hassle. I’ve made a start on a full patch for Paperclip that uses the new gem: I’ve just got to get my head around all the mocking and stubbing that goes on in the storage module tests and then it’ll be ready for the guys at ThoughtBot to have a look!
Updated on 15 October 2015
First published by Rob Anderton on 31 January 2010
© TheWebFellas Limited 2016
"Ooh la la: Paperclip et les European S3 buckets" by Rob Anderton at TheWebFellas is licensed under a Creative Commons Attribution 4.0 International License.
|
__label__pos
| 0.854655 |
W3cubDocs
/Drupal 8
function system_get_info
system_get_info($type, $name = NULL)
Returns an array of information about enabled modules or themes.
This function returns the contents of the .info.yml file for each installed module or theme.
Parameters
$type: Either 'module' or 'theme'.
$name: (optional) The name of a module or theme whose information shall be returned. If omitted, all records for the provided $type will be returned. If $name does not exist in the provided $type or is not enabled, an empty array will be returned.
Return value
An associative array of module or theme information keyed by name, or only information for $name, if given. If no records are available, an empty array is returned.
See also
system_rebuild_module_data()
\Drupal\Core\Extension\ThemeHandlerInterface::rebuildThemeData()
File
core/modules/system/system.module, line 916
Configuration system that lets administrators modify the workings of the site.
Code
function system_get_info($type, $name = NULL) {
if ($type == 'module') {
$info = &drupal_static(__FUNCTION__);
if (!isset($info)) {
if ($cache = \Drupal::cache()->get('system.module.info')) {
$info = $cache->data;
}
else {
$data = system_rebuild_module_data();
foreach (\Drupal::moduleHandler()->getModuleList() as $module => $filename) {
if (isset($data[$module])) {
$info[$module] = $data[$module]->info;
}
}
// Store the module information in cache. This cache is cleared by
// calling system_rebuild_module_data(), for example, when listing
// modules, (un)installing modules, importing configuration, updating
// the site and when flushing all the caches.
\Drupal::cache()->set('system.module.info', $info);
}
}
}
else {
$info = array();
$list = system_list($type);
foreach ($list as $shortname => $item) {
if (!empty($item->status)) {
$info[$shortname] = $item->info;
}
}
}
if (isset($name)) {
return isset($info[$name]) ? $info[$name] : array();
}
return $info;
}
© 2001–2016 by the original authors
Licensed under the GNU General Public License, version 2 and later.
Drupal is a registered trademark of Dries Buytaert.
https://api.drupal.org/api/drupal/core!modules!system!system.module/function/system_get_info/8.1.x
|
__label__pos
| 0.997316 |
viernes, 29 de abril de 2016
Restricciones NOT NULL, Check, Default, AutoIncrement y Unique en MariaDB (MySQL) Parte II
Buenas tardes queridos lectores, el día de hoy les explicaré los temas que me faltaron el el post anterior que fue, el check y el default, pero para eso crearemos las tablas que faltan, además nos servirá de base de datos de prueba por el momento, en un post mas adelante les pasaré la base de datos ya llena, para comenzar a trabajar con JOINS, Procedimientos Almacenados, Disparadores, Vistas, etc. pero por el momento nos conformaremos con el esqueleto, y con llenar algunos registros, vamos a partir de que ya tenemos la tabla PAISES que hicimos en el post anterior, hay algunas tablas que no requieren explicación alguna, así que no las explicaré, solo explicaré aquellas que tengan el check y el default, de cualquier manera, pueden preguntarme sin ningún problema. Pues bien, comencemos con lo que nos gusta.
CREATE TABLE IF NOT EXISTS ESTADIOS(
idestadio int primary key auto_increment,
nombre varchar (100) not null,
codigopais varchar (4),
imagen varchar(100),
fecha_creacion date,
ultima_modificacion date,
capacidad long,
ciudad varchar(100),
constraint estadios_codpais_fk foreign key (codigopais) references paises (codigopais),
UNIQUE KEY `nombre_uq` (nombre , codigopais))
Como ven, creamos la tabla estadios, cuya llave primaria es el campo IDESTADIO, tiene una llave foránea que es codigopais que hace referencia a la tabla PAISES en su campo CODIGOPAIS, además tiene restricción de UNIQUE en el campo NOMBRE y CODIGOPAIS, es decir que puede haber dos estadios llamados igual, pero no en el mismo país.
CREATE TABLE IF NOT EXISTS EQUIPOS(
idequipo int auto_increment primary key,
abreviacion varchar(4) NOT NULL,
nombre varchar(100) NOT NULL,
logo varchar(100),
tipo int default 1,
codigopais varchar(4),
idestadio int,
fecha_creacion date,
fecha_fundacion date,
unique key abreviacion_unq (abreviacion),
constraint cod_pais_fk foreign key (codigopais) references paises (codigopais),
constraint equipo_estadio_fk foreign key (idestadio) references estadios (idestadio))
Concentrémonos en la siguiente línea
tipo int default 1,
Pensemos que el equipo puede ser de dos tipos, puede ser un club o una selección, si es club le pondremos el numero 1, si es selección le pondremos el número 2, este campo es un campo que también puede ser boolean y es comúnmente llamado campo bandera, mediante la instrucción default, le estamos indicando que, si no ingresamos el tipo de equipo, será por default un club, continuemos con la siguiente tabla.
CREATE TABLE IF NOT EXISTS TORNEOS(
idtorneo int auto_increment primary key,
nombre varchar(100),
fecha_inicio date,
fecha_final date,
fecha_captura date,
logo varchar(100),
sede varchar(200),
tipo int, /* 1. Liga / 2. Copa / 3. Mundial */
campeon int,
estatus int, /* 0. Abierto/ 1.Finalizado */
comentarios text,
constraint campeon_fk foreign key (campeon) references equipos (idequipo));
CREATE TABLE IF not EXISTS PARTIDOS(
idpartido int auto_increment unique,
num_partido int,
idtorneo int,
jornada varchar(10),
fecha date,
hora time,
idequipolocal int,
equipolocal varchar(100),
goleslocal int,
idequipovisitante int check (idequipovisitante <> idequipolocal),
equipovisitante varchar(100),
golesvisitante int,
tiempo_extra int default 0,
goleslocaltiempoextra int,
golesvisitantetiempoextra int,
penales int default 0,
goleslocalpenales int,
golesvisitantepenales int,
asistencia int,
ganador char(1),
idestadio int,
puntos_local int,
puntos_visitante int,
comentarios text,
activo int,
procesado int default 0,
fecha_captura date,
fecha_procesado date,
constraint partidos_pk PRIMARY KEY (fecha,hora,equipolocal,equipovisitante))
alter table partidos
ADD CONSTRAINT `equipolocal_fk` FOREIGN KEY (`idEquipoLocal`) REFERENCES `equipos` (`idequipo`),
ADD CONSTRAINT `equipovisitante_fk` FOREIGN KEY (`idequipovisitante`) REFERENCES `equipos` (`idequipo`),
ADD CONSTRAINT `partido_estadio_fk` FOREIGN KEY (`idestadio`) REFERENCES `estadios` (`idestadio`);
Presten especial atención a la siguiente instrucción
idequipovisitante int check (idequipovisitante <> idequipolocal),
Mediante esta instrucción le indicaremos a la base de datos que valide que el equipovisitante no sea igual al equipo local, ya que un equipo no puede tener partidos contra si mismo
create table if not exists puntos(
consecutivo int auto_increment primary key,
idequipo int,
puntos int,
goles_favor int,
goles_contra int,
jornada varchar(10),
idtorneo int,
idpartido int,
constraint puntos_equipo_fk foreign key (idequipo) references equipos (idequipo),
constraint puntos_idtorneo_fk foreign key (idtorneo) references torneos (idtorneo));
Hasta aquí el post queridos lectores, este es el esqueleto de la base de datos, espero se haya entendido la manera de crear tablas y las restricciones que podemos usar, en el próximo post veremos como respaldar y restaurar una base de datos.
Espero haya sido de su utilidad, compartan, den +1 y clic en algún anuncio que les interese, cualquier duda, no dudan en preguntar, estoy a sus órdenes.
Saludos
No hay comentarios.:
Publicar un comentario
Cómo crear una empresa en Contpaqi Comercial
En este post se mostrará la manera de crear una empresa en el sistema Contpaqi© Comercial, en caso de tener alguna duda, estamos a sus or...
|
__label__pos
| 0.983459 |
GeorgeGkas GeorgeGkas - 11 months ago 78
Javascript Question
Pass this.props.children to another file in react-router
I try to render a React Component in my page using react-router.
The file structure I use is the one bellow:
React/
components/
Container/
Sidebar.js
Main.js
Container.js
Header.js
Layout.js
pages/
Main.js
Lesson.js
index.js
So I want to render the components from the
pages
folder in the component that belongs to
Main.js
. The
Sidebar.js
holds the navigation menu.
Here is what I tried:
index.js
import React from 'react';
import ReactDom from 'react-dom';
import Layout from './components/Layout';
import { Router, Route, IndexRoute, hashHistory } from 'react-router';
import Index from './pages/Index';
import Lesson from './pages/Lesson';
const app = document.getElementById('app');
ReactDom.render(
<Router history={hashHistory} >
<Route path="/" component={Layout} >
<IndexRoute component={Index} ></IndexRoute>
<Route path="lesson" name="lesson" component={Lesson} ></Route>
</Route>
</Router>
,app);
Layout.js
import React from 'react';
import Header from './Header';
import Container from './Container';
export default class Layout extends React.Component {
render() {
return (
<div>
<Header />
<Container />
</div>
);
}
}
Container.js
import React from 'react';
import Sidebar from './Container/Sidebar';
import Main from './Container/Main';
export default class Header extends React.Component {
render() {
return (
<div id="container">
<Sidebar />
<Main />
</div>
);
}
}
Main.js
import React from 'react';
export default class Main extends React.Component {
render() {
return (
{/* Here I want to render the contents */}
);
}
}
Sidebar.js
import React from 'react';
import { Link } from 'react-router';
import sidebarStore from './Sidebar/SidebarStore.js';
export default class Sidebar extends React.Component {
render() {
return (
<div id="nav-md-placeholder">
<nav id="sidebar">
<ul id="main-menu">
<li class="ripple-btn">
<Link to="/">
<span class="item-align-fix">
<i class="glyphicon glyphicon-home" style={{'marginRight': '10px'}}></i>
<strong>
<span>index</span>
</strong>
</span>
</Link>
</li>
<li class="ripple-btn">
<Link to="lesson">
<span class="item-align-fix">
<i class="glyphicon glyphicon-home" style={{'marginRight': '10px'}}></i>
<strong>
<span>lesson</span>
</strong>
</span>
</Link>
</li>
</ul>
</nav>
</div>
);
}
}
I don't get any errors on my console when building the app nor in th browser console. When I click on the links I redirect to the following urls but nothing happen:
Click on Index -> http://localhost/new-webclass/#/?_k=gukonu
Click on Lesson -> http://localhost/new-webclass/#/lesson?_k=7mcbcx
I don't know if I setted the routes with the wrong way. The official documentation doesn't help either.
Here is also the example of the Lesson.js I want to render:
import React from 'react';
export default class Lesson extends React.Component {
render() {
return (
<h1>Lesson Page</h1>
);
}
}
Solution
See the answer of Random User bellow. He provides a nice explanation. So down bellow you see how I passed
{this.props.children}
to the file with the component I needed:
Layout.js
<Container main_content={this.props.children}/>
Container.js
<Main main_content={this.props.main_content}/>
Main.js
render() {
return (
<main class={this.MainContentPlaceholder} id="main-content-placeholder">
<Overlay />
<div class="col-xs-12 col-sm-12 col-md-12 col-lg-12 center-col">
{this.props.main_content}
</div>
</main>
);
Answer Source
In your index.js file
<Router history={hashHistory} >
<Route path="/" component={Layout} >
<IndexRoute component={Index} ></IndexRoute>
<Route path="lesson" name="lesson" component={Lesson} ></Route>
</Route>
</Router>
<Route path="/" component={Layout} > acts as the parent route and all other routes are its sub-routes. and its using Layout component
So even when you change the route, the parent component remains there and the component of new route is passed to the parent component Layout as a children, but you're not rendering children in your Layout component.
So, in your Layout.js file, add this line {this.props.children}, Example
return (
<div>
<Header />
<Container />
{this.props.children}
</div>
);
You can Re-arrange it to suit your needs, but add {this.props.children} wherever you want to render the child components passed to it.
|
__label__pos
| 0.988703 |
What is crypto Art?
Although Bitcoin is currently the most common use of Blockchain, it is not the only object transacted on the platform. Digital artists are innovating in order to gain more recognition for their work and enhance their standing in respective areas. Blockchain is seen to be the future of art, and hence it's believed that artists should start taking it into consideration. You will get a broad introduction to Blockchain, cryptocurrencies, and the role that artists are playing in it by reading this article.
What is Blockchain technology?
Bitcoin is just one of many cryptocurrencies that may be exchanged on the blockchain (or the recent meme-turned-money Dogecoin). Let's start by taking a step back and trying to understand what bitcoin really is.
One of the alternative ways of paying for goods and services is using cryptocurrency. In order to get digital currency, you must acquire a fixed quantity of coins or tokens with real money. However, what's the point of trading one money for another? The answer to this question is very significant since it pertains to security. Banks and other institutions are no longer involved when you exchange cryptocurrency. Because of the initial investors in Bitcoin, who were able to gain large amounts of bitcoins when the value was low, more people are attracted to cryptocurrencies now. Some feel that cryptocurrencies represent the future of money transactions, while others believe that they are the future of financial transactions.
Art on the blockchain: why?
So, what's the connection between all of this and art? As with exchanging cryptocurrency, exchanging digital art on the Blockchain has several benefits. It is an alternative manner of art ownership—and in some people's eyes, it is even better. When digital artists can expect stronger security and a higher value for their work, their art will be guaranteed to be secure in Bitcoin's ledgers. Verisart is a Blockchain verification tool for artists.
A digital art marketplace, R.A.R.E., claims that because to Blockchain, independent artists that have no backing from galleries can grow their careers or begin new projects.
Crypto Art is “authentic” thanks to Blockchain.
That ledger we use to keep track of all our transactions? A practise that enables the tracing of digital art means that a piece of art can be monitored as it passes from hand to hand and its origin can be tracked back to the artist who made it. Also, the rate of change of the value over time can be tracked. It has been challenging to keep track of these issues while using digital material that may be easily shared or swapped online.
How blockchain adds value to crypto art
In contrast to “traditional” art, digital art is harder to possess. Shareability is once again a problem for the work's worth. Art collectors can now own digital art in an entirely new way through the blockchain. Non-fungible tokens, or NFTs, are unique pieces of information (cryptographic tokens) which cannot be broken down into smaller portions. Bitcoin is not like traditional money in which 1 unit of traditional money is equivalent to any other unit of traditional money. NFTs are used to represent individual works of art rather than entire portfolios. Non-Fungible Tokens (NFTs) are also utilised for many applications, such as intellectual property rights, digital goods, or domain names. A digital artist can sell his or her original works and gain a sense of financial value. This knowledge allows collectors to purchase original works for greater financial gain.
Presented on this are the many benefits of crypto art; all of these factors make crypto art an extremely appealing idea. As time goes on, the future status of Blockchain in digital artists' portfolios will be revealed.
21 views0 comments
|
__label__pos
| 0.787715 |
Monotone queue and monotone stack
Monotone queue and monotone stack
Monotonic queue
• The classical sliding window problem: find the maximum value of all subintervals with length m (m < n) in A sequence A with length n. N < = 2E6.
Line segment trees are easy to tle. We need an o(n) algorithm to solve this problem.
Idea:
• Consider each window, where at least one position must be the maximum.
• If there is one, in this window, all the numbers in front of the maximum value are useless to us (not only small, but also exit early); Similarly, if there is more than one maximum value, we can select the last maximum value (the front maximum values can not only be replaced, but also exit early).
• For all the numbers behind them, it is necessary to consider that after the maximum value exits the window, they have the "potential" to become the maximum value.
• However, among all the numbers after this, if there is \ (A_i < = a_j\) and \ (I < j\), then this \ (A_i\) does not need to be considered (it is not only small, but also exits early).
• Therefore, in each window, we only need to record the current maximum value and the number after the maximum value, if and only if there is no number greater than or equal to this number.
It can be seen that this window can be simulated with a two-way queue. Whenever a number is added in the rear, all numbers less than it must be eliminated from the end of the queue to ensure that there is no number greater than or equal to it behind each number in the queue within the window. When the queue head element is not in the window range, the queue head element is out of the queue. After this operation, the elements in the team are monotonic, so it is called monotonic queue
Reference topic: Luogu P1440 (slightly different)
P1440 array simulation queue code:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n, m;
struct ab
{
int l; //position
int v;
} que[2000005];
int head = 1, tail = 1;
int main()
{
scanf("%d%d", &n, &m);
printf("0\n");
for (int i = 1; i < n; ++i)
{
int num;
scanf("%d", &num);
while (tail != head && num <= que[tail - 1].v)
{
--tail;
}
que[tail].l = i;
que[tail++].v = num;
while (que[head].l <= i - m)
{
++head;
}
printf("%d\n", que[head].v);
}
scanf("%d", &n); //Swallow the input of the last number
return 0;
}
Monotone stack
After understanding the monotone queue, the monotone stack makes people think that all elements in the stack are monotone as the name suggests
Problem solving:
• 1. find the subscript of the first number larger / smaller than yourself after / before any number in a sequence
• 2. find out how many smaller numbers are connected to the rear / front of any number in a sequence
The essence of these two problems is the same, but the naive algorithm is obviously \ (O(n^2) \), and we need to use monotone stack to reduce the dimension in time.
• For example, find the subscript of the first larger number after any number in a sequence. If it does not exist, it will be 0, and the sequence length n < = 3e6.
• At first we put an INF at the bottom of the stack
• Stack the sequence from left to right
• When the top of the stack element is smaller than the current number of hours, the top of the stack element leaves the stack and marks the corresponding answer of the top of the stack element as the subscript of the stack element. In this way, the top of the stack element is greater than or equal to the stack element
• The corresponding answer of the elements left in the stack is 0
Template questions: Luogu P5788
P5788 array simulation stack code
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n;
int top = 1;
struct ab
{
int v;
int l;
} sta[3000005];
int ans[3000005] = {0};
int main()
{
scanf("%d", &n);
int xx;
scanf("%d", &xx);
sta[top].l = 1;
sta[top++].v = xx;
for (int i = 2; i <= n; ++i)
{
scanf("%d", &xx);
while (top != 1 && sta[top - 1].v < xx)
{
ans[sta[top - 1].l] = i;
--top;
}
sta[top].l = i;
sta[top++].v = xx;
}
while (top != 1)
{
ans[sta[top - 1].l] = 0;
--top;
}
for (int i = 1; i < n; ++i)
{
printf("%d ", ans[i]);
}
printf("%d", ans[n]);
return 0;
}
Tags: data structure
Posted by turek on Sun, 29 May 2022 23:17:32 +0530
|
__label__pos
| 0.963783 |
ps0604 ps0604 - 3 months ago 19x
AngularJS Question
`ng-show` invoking function does not work
In this PLUNK I have a div with an
ng-show
element that invokes a
show()
function that returns false. Therefore, I expect the div not to be displayed.
Also, see that the
show()
function is invoked twice (the console.log shows the
sh
variable twice). How to fix this?
Javascript
var app = angular.module('app', []);
app.directive('mydir', function ($compile) {
var directive = {};
directive.restrict = 'EA';
directive.scope = {
control: '='
};
directive.template = '<div id="root"></div>';
directive.link = function (scope, element, attrs) {
var sh = false;
var wrap = angular.element('<div id="wrap" ng-show="show()"></div>');
wrap.attr('sh', sh);
var wrapc = $compile(wrap)(scope)
element.append(wrapc);
scope.show = function() {
var elem = angular.element( document.querySelector( '#wrap' ) );
var sh = elem.attr('sh');
console.log(sh); // <-- should log false only once, not twice
return sh;
}
};
return directive;
});
HTML
<mydir></mydir>
Answer
The problem why the div is displayed is because you read the sh value from attr and by doing so it becomes a string.
wrap.attr('sh', sh);
This line actually sets the attribute sh to "false" (string) and not false. And then the get function elem.attr('sh'); returns "false" as a string. And a not-empty string is truthy in javascript therefore it evaluates to true.
Replace:
var sh = elem.attr('sh');
with a string comparison:
var sh = (elem.attr('sh') == "true");
and it should work
That show is called twice is intended behaviour. Look here for details: Controller function getting called twice using ng-show
Comments
|
__label__pos
| 0.744925 |
0
$\begingroup$
I know that the union of all singleton sets {q} with q a rational is countable so the issue I'm having is showing that {q} is nowhere dense in X? I know this is true when X=R but having trouble when X=Q
$\endgroup$
1 Answer 1
0
$\begingroup$
Every open set in the metric space $\Bbb Q$ (with the usual Euclidean absolute value metric) is meagre, i.e., first category in $\Bbb Q$; in fact every subset of $\Bbb Q$ is meagre in $\Bbb Q$, because every subset of $\Bbb Q$ is countable, and $\{x\}$ is a closed, nowhere dense subset of $\Bbb Q$ for each $x\in\Bbb Q$. Hence $\mathbb{Q}$ is of first category in $\mathbb{Q}$.
$\endgroup$
2
• $\begingroup$ How do you know that {x} is a nowhere dense subset of Q? I understand that if {x} is closed then it is its own closure so I guess the question I'm asking is how do you know that the interior of {x} is empty. $\endgroup$
– mckennja
Apr 18, 2017 at 19:45
• $\begingroup$ I know it from several answers at MSE, e.g. here, or here. $\endgroup$ Apr 18, 2017 at 20:36
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
__label__pos
| 0.971722 |
Datastore的zigzag merge join查询计划的改进
标签：Python, Google App Engine
之前曾介绍过Datastore的zigzag merge join技术，它可以显著减少索引的数目。而今天看到《Index Selection and Advanced Search》这篇文章，才知道它又有新的改进了。
首先介绍一下之前的merge join。假设我有这样一个模型：
class Test(db.Model):
a = db.IntegerProperty()
b = db.IntegerProperty()
c = db.IntegerProperty()
而我要进行如下的查询：
Test.all().filter('a =', 1).filter('b =', 2)
Test.all().filter('a =', 1).filter('c =', 3)
Test.all().filter('b =', 2).filter('c =', 3)
Test.all().filter('a =', 1).filter('b =', 2).filter('c =', 3)
如果不用merge join的话，我需要定义4个复合索引：
- kind: Test
properties:
- name: a
- name: b
- kind: Test
properties:
- name: a
- name: c
- kind: Test
properties:
- name: b
- name: c
- kind: Test
properties:
- name: a
- name: b
- name: c
而使用merge join时，这4条索引我都不需要定义。因为a、b、c都已经有内置的索引了，查询计划器会从3条内置索引里分别找到a为1的、b为2的和c为3的，再根据key将其合并起来，这样就能返回所有符合条件的结果了。
其中的缺点就是不能有不等于和排序操作，且查询速度比复合索引快。
而经过SDK 1.5.2的优化，merge join已经能支持不等于和排序操作了。
简单来说，如果我需要这样的查询：
Test.all().filter('a =', 1).filter('c >', 1)
Test.all().filter('b =', 2).filter('c >', 1)
Test.all().filter('a =', 1).filter('b =', 2).filter('c >', 1)
Test.all().filter('a =', 1).filter('b =', 2).order('c')
原先我需要定义这样的复合索引：
- kind: Test
properties:
- name: a
- name: c
- kind: Test
properties:
- name: b
- name: c
- kind: Test
properties:
- name: a
- name: b
- name: c
但实际上这些操作都是对c排序的，所以可以用前2条复合索引来merge join，这样就避免了创建第3条索引。
在这个例子中，虽然节约的索引数不多，但考虑到还可能有反向排序，需要对其他属性排序，以及属性是列表的情况，这样节约的索引数就很可观了。
1条评论 你不来一发么↓ 顺序排列 倒序排列
向下滚动可载入更多评论，或者点这里禁止自动加载
想说点什么呢？
|
__label__pos
| 0.999779 |
Swiftpack.co - 3Squared/PeakCoreData as Swift Package
Swiftpack.co is a collection of thousands of indexed Swift packages. Search packages.
3Squared/PeakCoreData
PeakCoreData is a Swift microframework providing enhancements and conveniences to Core Data.
.package(url: "https://github.com/3Squared/PeakCoreData.git", from: "5.2.0")
PeakCoreData
PeakCoreData is a Swift microframework providing enhancements and conveniences to Core Data. It is part of the Peak Framework.
Observers
ManagedObjectObserver
The ManagedObjectObserver class can be used to observe changes made to a single managed object. State changes include when it is refreshed, updated or deleted.
var event: Event!
var eventObserver: ManagedObjectObserver<Event>!
override func viewDidLoad() {
super.viewDidLoad()
eventObserver = ManagedObjectObserver(managedObject: event)
eventObserver.startObserving() { [weak self] obj, changeType in
guard let strongSelf = self else { return }
switch changeType {
case .initialised, .refreshed, .updated:
strongSelf.updateView()
case .deleted:
strongSelf.navigationController?.popToRootViewController(animated: true)
}
}
}
CountObserver
The CountObserver class can be used to observe changes to the number of NSManagedObject objects as defined by a generic type and an optional NSPredicate.
var countObserver: CountObserver<Event>!
override func viewDidLoad() {
super.viewDidLoad()
let predicate = NSPredicate(format: "%K == false", argumentArray: [#KeyPath(Event.isHidden)])
countObserver = CountObserver<Event>(predicate: predicate, context: viewContext)
countObserver.startObserving() { [weak self] count in
guard let strongSelf = self else { return }
strongSelf.countLabel.text = String(count)
}
}
Fetched Data Sources
FetchedCollection
FetchedCollection is a wrapper for NSFetchedResultsController which acts as its own delegate and exposes changes though a closure.
let fetchedCollection = FetchedCollection(fetchRequest: Event.sortedFetchRequest(), context: viewContext)
fetchedCollection.onChange = { collection, update in
// use collection, or process updates
}
// subscriptable
let object = fetchedCollection[0, 0]
// or with a tuple
let object = fetchedCollection[(0, 0)]
// or with an index path
let object = fetchedCollection[IndexPath(row: 0, section: 0)]
This allows you to decouple the NSFetchedResultsController from your viewcontroller.
FetchedCollectionViewDataSource and FetchedTableViewDataSource
These classes take care of the boiler-plate code needed to use a NSFetchedResultsController with a UITableView or UICollectionView.
class EventsTableViewController: UITableViewController {
var dataSource: FetchedTableViewDataSource<EventsTableViewController>!
override func viewDidLoad() {
super.viewDidLoad()
let frc = NSFetchedResultsController(
fetchRequest: Event.sortedFetchRequest(),
managedObjectContext: viewContext,
sectionNameKeyPath: nil,
cacheName: nil
)
dataSource = FetchedTableViewDataSource(
tableView: tableView,
cellIdentifier: EventTableViewCell.cellIdentifier,
fetchedResultsController: frc,
delegate: self
)
dataSource.animateUpdates = true
dataSource.onDidChangeContent = {
print("Something changed")
}
dataSource.performFetch()
}
}
extension EventsTableViewController: FetchedTableViewDataSourceDelegate {
func identifier(forCellAt indexPath: IndexPath) -> String {
return EventTableViewCell.cellIdentifier
}
func configure(_ cell: EventTableViewCell, with object: Event) {
cell.textLabel?.text = object.date?.description
}
}
Operations
CoreDataOperation
CoreDataOperation is a concurrent Operation subclass that can be used to perform core data tasks on a background thread. To use, simply subclass CoreDataOperation then override the performWork(in:) method.
Things to note about this operation:
• CoreDataOperation simply wraps the performBackgroundTask((NSManagedObjectContext) -> Void) method on NSPersistentContainer in a operation.
• To finish the operation you must call saveAndFinish().
• Changes will only be merged in to your viewContext if you have set the automaticallyMergesChangesFromParent on viewContext to true.
• CoreDataOperation conforms to ProducesResult and so can be used to produce a Result.
CoreDataChangesetOperation
A CoreDataOperation subclass that returns a Changeset struct containing all the NSManagedObjectID objects that were inserted and updated during the operation.
CoreDataBatchImportOperation and CoreDataSingleImportOperation
Two CoreDataChangesetOperation subclasses that can be used to import an array of intermediate objects or a single intermediate object in to Core Data. They would normally be used to import Decodable objects from your web service. These operations work automatically as long as the following requirements are met:
• The intermediate object must conform to ManagedObjectUpdatable and UniqueIdentifiable.
• The NSManagedObject type you are converting to must conform to ManagedObjectType and UniqueIdentifiable.
Protocols
ManagedObjectType and UniqueIdentifiable
To give your NSManagedObject subclasses access to a range of helper methods for inserting, deleting, fetching and counting, simply make them conform to the ManagedObjectType and UniqueIdentifiable protocols. Doing so will also allow you to use CoreDataBatchImportOperation and CoreDataSingleImportOperation.
PersistentContainerSettable
Each view controller that needs access to the NSPersistentContainer should conform to PersistentContainerSettable. Conforming to this protocol gives you easy access to the viewContext property and a method for saving the viewContext. It also allows your NSPersistentContainer to be passed around more easily in prepare(for:sender:).
override func prepare(for segue: UIStoryboardSegue, sender: Any?) {
if let controller = segue.destination as? PersistentContainerSettable {
controller.persistentContainer = persistentContainer
}
if let navController = segue.destination as? UINavigationController, let controller = navController.topViewController as? PersistentContainerSettable {
controller.persistentContainer = persistentContainer
}
}
Contributing
Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests to us.
Versioning
We use SemVer for versioning.
License
This project is licensed under the MIT License - see the LICENSE.md file for details
Acknowledgments
Peak Framework
The Peak Framework is a collection of open-source microframeworks created by the team at 3Squared, named for the Peak District. It is made up of:
Name Description
PeakOperation Provides enhancement and conveniences to Operation, making use of the Result type.
PeakNetwork A networking framework built on top of Session using PeakOperation, leveraging the power of Codable.
GitHub
link
Stars: 10
Last commit: 1 week ago
Ad: Job Offers
iOS Software Engineer @ Perry Street Software
Perry Street Software is Jack’d and SCRUFF. We are two of the world’s largest gay, bi, trans and queer social dating apps on iOS and Android. Our brands reach more than 20 million members worldwide so members can connect, meet and express themselves on a platform that prioritizes privacy and security. We invest heavily into SwiftUI and using Swift Packages to modularize the codebase.
Dependencies
Swiftpack is being maintained by Petr Pavlik | @ptrpavlik | @swiftpackco | API
|
__label__pos
| 0.881282 |
C# Generics
CodeGuru content and product recommendations are editorially independent. We may make money when you click on links to our partners. Learn More.
The following article is excerpted from the book Practical .NET2 and C#2.
C# Generics
Without any doubt, generics is the flagship functionality in .NET 2 from the language’s perspective. After explaining what generics are, we will examine the implication of its support at the level of the C#2 language, the CLR and the framework. To start off, let us mention that all generic types and methods are CLS compliant and can thus be used across all CLR v2 languages.
A C#1 problem and how to solve it with .NET 2 generics
The problem of typing collection items with C#1
Let’s assume that we have to implement a Stack class which allows stacking and unstacking elements. To simplify our code, we will assume that the stack cannot contain more than a certain number of elements. This constraint allows us to internally use a C# array. Here is an implementation of this Stack class:
Example 1
class Stack{
private object[] m_ItemsArray;
private int m_Index = 0;
public const int MAX_SIZE = 100;
public Stack() { m_ItemsArray = new object[MAX_SIZE]; }
public object Pop() {
if (m_Index ==0 )
throw new System.InvalidOperationException(
"Can't pop an empty stack.");
return m_ItemsArray[--m_Index];
}
public void Push( object item ) {
if(m_Index == MAX_SIZE)
throw new System.StackOverflowException(
"Can't push an item on a full stack.");
m_ItemsArray[m_Index++] = item;
}
}
This implementation suffers from three major problems.
• First of all, the client of the Stack class must explicitly cast all elements obtained from the stack. For example:
...
Stack stack = new Stack();
stack.Push(1234);
int number = (int)stack.Pop();
...
• A second problem which is less obvious is from a performance perspective. We must be aware that when we use our Stack class with value type elements, we will implicitly perform a boxing operation when inserting elements and an unboxing operation when removing an element. This is highlighted by the following IL code:
L_0000: newobj instance void Stack::.ctor()
L_0005: stloc.0
L_0006: ldloc.0
L_0007: ldc.i4 1234
L_000c: box int32
L_0011: callvirt instance void Stack::Push(object)
L_0016: nop
L_0017: ldloc.0
L_0018: callvirt instance object Stack::Pop()
L_001d: unbox int32
L_0022: ldind.i4
L_0023: stloc.1
L_0024: ret
• Finally, a third problem comes from the fact that we can store elements of different types within a same instance of the Stack class. Generally, we wish to have a stack of elements with a common type. This feature can easily lead to casting errors which are only found during the execution as with the following example:
...
Stack stack = new Stack();
stack.Push("1234");
int number = (int)stack.Pop(); // Raise an InvalidCastException.
...
When a casting problem is not detected during compilation but can provoke an exception at run-time we say that the code is not type-safe. In software development, as well as any other discipline, the earlier an error is detected the least costly will this error be. This means that whenever possible, you must make sure to have type-safe code as this allows the detection of problems early on, at compile-time.
It is possible to implement our stack in a type-safe way. In fact, we could have implemented a StackOfInt class which describes a stack containing only integers, a StackOfSring class which only contains strings,…
Example 2
class StackOfInt {
private int[] m_ItemsArray;
private int m_Index = 0;
public const int MAX_SIZE = 100;
public StackOfInt(){ m_ItemsArray = new int[MAX_SIZE]; }
public int Pop() { /*...*/ return -1; }
public void Push(int item) { /*...*/ }
}
class StackOfString {
private string[] m_ItemsArray;
private int m_Index = 0;
public const int MAX_SIZE = 100;
public StackOfString(){ m_ItemsArray = new string[MAX_SIZE]; }
public string Pop() {/*...*/ return null; }
public void Push(string item) {/*...*/}
}
Although it is type-safe and that is solves both the casting and performance problems, this solution is clearly unsatisfactory. It implies code duplication since the same stack logic is implemented by several classes. This means more code to maintain and hence a loss of productivity.
An ideal solution using C#2 generics
C#2 offers an elegant solution to the problem exposed in the previous section through the introduction of generic types. Concretely, we can implement a stack of elements of type T by giving the client the freedom to specify the T type when they instantiate the class. For example:
Example 3
class Stack<T>{
private T[] m_ItemsArray;
private int m_Index = 0;
public const int MAX_SIZE = 100;
public Stack(){ m_ItemsArray = new T[MAX_SIZE]; }
public T Pop(){
if (m_Index ==0 )
throw new System.InvalidOperationException(
"Can't pop an empty stack.");
return m_ItemsArray[--m_Index];
}
public void Push(T item) {
if(m_Index == MAX_SIZE)
throw new System.StackOverflowException(
"Can't push an item on a full stack.");
m_ItemsArray[m_Index++] = item;
}
}
class Program{
static void Main(){
Stack<int> stack = new Stack<int>();
stack.Push(1234);
int number = stack.Pop(); // Don't need any awkward cast.
stack.Push(5678);
string sNumber = stack.Pop(); // Compilation Error:
// Cannot implicitly convert type 'int' to 'string'.
}
}
This solution does not suffer from any of the problems discussed earlier.
• The client does not need to cast an element popped from the stack.
• This solution is efficient as it does not require boxing/unboxing operations.
• The client writes type-safe code. There is no possibility of having a stack with various types during execution. In our example, the compiler prevents the insertion of any element which is not an int or which cannot be implicitly converted into an int.
• There is no code duplication.
Understand that in our example, the generic class is Stack<T> while T is the parameter type for our class. We sometimes used the parametric polymorphism term to talk about generics. In fact, our Stack<T> class can take several forms (Stack<int>, Stack<string> etc). It is then polymorphic and parameterized by one type. Caution, do not confuse this with the polymorphism of object oriented languages which allows the manipulation of various types of objects (i.e. instance objects from different classes) through a same interface.
To summarize, the Stack<T> class represents any kind of stack while the Stack class represents a stack of anything.
More by Author
Get the Free Newsletter!
Subscribe to Developer Insider for top news, trends & analysis
Must Read
|
__label__pos
| 0.908363 |
Statistics How To
Conditional Probability: Definition & Examples
Statistics Definitions > Conditional Probability
Conditional probability can be thought of as looking at the probability of one event occurring with some relationship to one or more other events. For example:
• Event A is that it is raining outside, and it has a 0.3 (30%) chance of raining today.
• Event B is that you will need to go outside, and that has a probability of 0.5 (50%).
A conditional probability would look at these two events in relationship with one another, such as the probability that it is both raining and you will need to go outside.
The formula for conditional probability is:
P(B|A) = P(A and B) / P(A)
which can also be rewritten as:
P(B|A) = P(A∩B) / P(A)
Conditional Probability Formula Examples
Watch the video, or read the examples below:
Example 1. In a group of 100 sports car buyers, 40 bought alarm systems, 30 purchased bucket seats, and 20 purchased an alarm system and bucket seats. If a car buyer chosen at random bought an alarm system, what is the probability they also bought bucket seats?
Step 1: Figure out P(A). It’s given in the question as 40%, or 0.4.
Step 2: Figure out P(A∩B). This is the intersection of A and B: both happening together. It’s given in the question 20 out of 100 buyers, or 0.2.
Step 3: Insert your answers into the formula:
P(B|A) = P(A∩B) / P(A) = 0.2 / 0.4 = 0.5.
The probability that a buyer bought bucket seats, given that they purchased an alarm system, is 50%.
Venn diagram showing that 20 out of 40 alarm buyers purchased bucket seats.
Venn diagram showing that 20 out of 40 alarm buyers purchased bucket seats.
Example 2: This question uses the following contingency table:
conditional contingency
What is the probability a randomly selected person is male, given that they own a pet?
Step 1: Repopulate the formula with new variables so that it makes sense for the question (optional, but it helps to clarify what you’re looking for). I’m going to say M is for male and PO stands for pet owner, so the formula becomes:
P(M|PO) = P(M∩PO) / P(PO)
Step 2: Figure out P(M∩PO) from the table. The intersection of male/pets (the intersection on the table of these two factors) is 0.41.
conditional contingency3
Step 3: Figure out P(PO) from the table. From the total column, 86% (0.86) of respondents had a pet.
conditional contingency2
Step 4: Insert your values into the formula:
P(M|PO) = P(M∩PO) / P(M) = 0.41 / 0.86 = 0.477, or 47.7%.
Why do we care about conditional probability? Events in life rarely have simple probability. Think about the probability of getting rainfall.
conditional probability
Conditional Probability in Real Life
Conditional probability is used in many areas, including finance, insurance and politics. For example, the re-election of a president depends upon the voting preference of voters and perhaps the success of television advertising — even the probability of the opponent making gaffes during debates!
The weatherman might state that your area has a probability of rain of 40 percent. However, this fact is conditional on many things:
• The probability of a cold front coming to your area.
• The probability of rain clouds forming.
• The probability of another front pushing the rain clouds away.
We say that the conditional probability of rain occurring depends on all the above events.
Where does the Conditional Probability Formula Come From?
The formula for conditional probability is derived from the probability multiplication rule, P(A and B) = P(A)*P(B|A). You may also see this rule as P(A∪B). The Union symbol (∪) means “and”, as in event A happening and event B happening.
Step by step, here’s how to derive the conditional probability equation from the multiplication rule:
Step 1: Write out the multiplication rule:
P(A and B) = P(A)*P(B|A)
Step 2: Divide both sides of the equation by P(A):
P(A and B) / P(A) = P(A)*P(B|A) / / P(A)
Step 3: Cancel P(A) on the right side of the equation:
P(A and B) / P(A) = P(B|A)
Step 4: Rewrite the equation:
P(B|A) = P(A and B) / P(A)
Check out our YouTube channel for more stats help and tips!
------------------------------------------------------------------------------
If you prefer an online interactive environment to learn R and statistics, this free R Tutorial by Datacamp is a great way to get started. If you're are somewhat comfortable with R and are interested in going deeper into Statistics, try this Statistics with R track.
Comments are now closed for this post. Need help or want to post a correction? Please post a comment on our Facebook page and I'll do my best to help!
Conditional Probability: Definition & Examples was last modified: October 15th, 2017 by Stephanie
Comments are closed.
|
__label__pos
| 0.999064 |
Blob Blame History Raw
/* crypto/ec/ectest.c */
/*
* Originally written by Bodo Moeller for the OpenSSL project.
*/
/* ====================================================================
* Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* [email protected].
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (http://www.openssl.org/)"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
* ====================================================================
*
* This product includes cryptographic software written by Eric Young
* ([email protected]). This product includes software written by Tim
* Hudson ([email protected]).
*
*/
/* ====================================================================
* Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
*
* Portions of the attached software ("Contribution") are developed by
* SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
*
* The Contribution is licensed pursuant to the OpenSSL open source
* license provided above.
*
* The elliptic curve binary polynomial software is originally written by
* Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
*
*/
#include <stdio.h>
#include <stdlib.h>
#ifdef FLAT_INC
# include "e_os.h"
#else
# include "../e_os.h"
#endif
#include <string.h>
#include <time.h>
#ifdef OPENSSL_NO_EC
int main(int argc, char *argv[])
{
puts("Elliptic curves are disabled.");
return 0;
}
#else
# include <openssl/ec.h>
# ifndef OPENSSL_NO_ENGINE
# include <openssl/engine.h>
# endif
# include <openssl/err.h>
# include <openssl/obj_mac.h>
# include <openssl/objects.h>
# include <openssl/rand.h>
# include <openssl/bn.h>
# include <openssl/opensslconf.h>
# if defined(_MSC_VER) && defined(_MIPS_) && (_MSC_VER/100==12)
/* suppress "too big too optimize" warning */
# pragma warning(disable:4959)
# endif
# define ABORT do { \
fflush(stdout); \
fprintf(stderr, "%s:%d: ABORT\n", __FILE__, __LINE__); \
ERR_print_errors_fp(stderr); \
EXIT(1); \
} while (0)
# define TIMING_BASE_PT 0
# define TIMING_RAND_PT 1
# define TIMING_SIMUL 2
# if 0
static void timings(EC_GROUP *group, int type, BN_CTX *ctx)
{
clock_t clck;
int i, j;
BIGNUM *s;
BIGNUM *r[10], *r0[10];
EC_POINT *P;
s = BN_new();
if (s == NULL)
ABORT;
fprintf(stdout, "Timings for %d-bit field, ", EC_GROUP_get_degree(group));
if (!EC_GROUP_get_order(group, s, ctx))
ABORT;
fprintf(stdout, "%d-bit scalars ", (int)BN_num_bits(s));
fflush(stdout);
P = EC_POINT_new(group);
if (P == NULL)
ABORT;
EC_POINT_copy(P, EC_GROUP_get0_generator(group));
for (i = 0; i < 10; i++) {
if ((r[i] = BN_new()) == NULL)
ABORT;
if (!BN_pseudo_rand(r[i], BN_num_bits(s), 0, 0))
ABORT;
if (type != TIMING_BASE_PT) {
if ((r0[i] = BN_new()) == NULL)
ABORT;
if (!BN_pseudo_rand(r0[i], BN_num_bits(s), 0, 0))
ABORT;
}
}
clck = clock();
for (i = 0; i < 10; i++) {
for (j = 0; j < 10; j++) {
if (!EC_POINT_mul
(group, P, (type != TIMING_RAND_PT) ? r[i] : NULL,
(type != TIMING_BASE_PT) ? P : NULL,
(type != TIMING_BASE_PT) ? r0[i] : NULL, ctx))
ABORT;
}
}
clck = clock() - clck;
fprintf(stdout, "\n");
# ifdef CLOCKS_PER_SEC
/*
* "To determine the time in seconds, the value returned by the clock
* function should be divided by the value of the macro CLOCKS_PER_SEC."
* -- ISO/IEC 9899
*/
# define UNIT "s"
# else
/*
* "`CLOCKS_PER_SEC' undeclared (first use this function)" -- cc on
* NeXTstep/OpenStep
*/
# define UNIT "units"
# define CLOCKS_PER_SEC 1
# endif
if (type == TIMING_BASE_PT) {
fprintf(stdout, "%i %s in %.2f " UNIT "\n", i * j,
"base point multiplications", (double)clck / CLOCKS_PER_SEC);
} else if (type == TIMING_RAND_PT) {
fprintf(stdout, "%i %s in %.2f " UNIT "\n", i * j,
"random point multiplications",
(double)clck / CLOCKS_PER_SEC);
} else if (type == TIMING_SIMUL) {
fprintf(stdout, "%i %s in %.2f " UNIT "\n", i * j,
"s*P+t*Q operations", (double)clck / CLOCKS_PER_SEC);
}
fprintf(stdout, "average: %.4f " UNIT "\n",
(double)clck / (CLOCKS_PER_SEC * i * j));
EC_POINT_free(P);
BN_free(s);
for (i = 0; i < 10; i++) {
BN_free(r[i]);
if (type != TIMING_BASE_PT)
BN_free(r0[i]);
}
}
# endif
/* test multiplication with group order, long and negative scalars */
static void group_order_tests(EC_GROUP *group)
{
BIGNUM *n1, *n2, *order;
EC_POINT *P = EC_POINT_new(group);
EC_POINT *Q = EC_POINT_new(group);
BN_CTX *ctx = BN_CTX_new();
int i;
n1 = BN_new();
n2 = BN_new();
order = BN_new();
fprintf(stdout, "verify group order ...");
fflush(stdout);
if (!EC_GROUP_get_order(group, order, ctx))
ABORT;
if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, Q))
ABORT;
fprintf(stdout, ".");
fflush(stdout);
if (!EC_GROUP_precompute_mult(group, ctx))
ABORT;
if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, Q))
ABORT;
fprintf(stdout, " ok\n");
fprintf(stdout, "long/negative scalar tests ");
for (i = 1; i <= 2; i++) {
const BIGNUM *scalars[6];
const EC_POINT *points[6];
fprintf(stdout, i == 1 ?
"allowing precomputation ... " :
"without precomputation ... ");
if (!BN_set_word(n1, i))
ABORT;
/*
* If i == 1, P will be the predefined generator for which
* EC_GROUP_precompute_mult has set up precomputation.
*/
if (!EC_POINT_mul(group, P, n1, NULL, NULL, ctx))
ABORT;
if (!BN_one(n1))
ABORT;
/* n1 = 1 - order */
if (!BN_sub(n1, n1, order))
ABORT;
if (!EC_POINT_mul(group, Q, NULL, P, n1, ctx))
ABORT;
if (0 != EC_POINT_cmp(group, Q, P, ctx))
ABORT;
/* n2 = 1 + order */
if (!BN_add(n2, order, BN_value_one()))
ABORT;
if (!EC_POINT_mul(group, Q, NULL, P, n2, ctx))
ABORT;
if (0 != EC_POINT_cmp(group, Q, P, ctx))
ABORT;
/* n2 = (1 - order) * (1 + order) = 1 - order^2 */
if (!BN_mul(n2, n1, n2, ctx))
ABORT;
if (!EC_POINT_mul(group, Q, NULL, P, n2, ctx))
ABORT;
if (0 != EC_POINT_cmp(group, Q, P, ctx))
ABORT;
/* n2 = order^2 - 1 */
BN_set_negative(n2, 0);
if (!EC_POINT_mul(group, Q, NULL, P, n2, ctx))
ABORT;
/* Add P to verify the result. */
if (!EC_POINT_add(group, Q, Q, P, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, Q))
ABORT;
/* Exercise EC_POINTs_mul, including corner cases. */
if (EC_POINT_is_at_infinity(group, P))
ABORT;
scalars[0] = n1;
points[0] = Q; /* => infinity */
scalars[1] = n2;
points[1] = P; /* => -P */
scalars[2] = n1;
points[2] = Q; /* => infinity */
scalars[3] = n2;
points[3] = Q; /* => infinity */
scalars[4] = n1;
points[4] = P; /* => P */
scalars[5] = n2;
points[5] = Q; /* => infinity */
if (!EC_POINTs_mul(group, P, NULL, 6, points, scalars, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, P))
ABORT;
}
fprintf(stdout, "ok\n");
EC_POINT_free(P);
EC_POINT_free(Q);
BN_free(n1);
BN_free(n2);
BN_free(order);
BN_CTX_free(ctx);
}
static void prime_field_tests(void)
{
BN_CTX *ctx = NULL;
BIGNUM *p, *a, *b;
EC_GROUP *group;
EC_GROUP *P_160 = NULL, *P_192 = NULL, *P_224 = NULL, *P_256 =
NULL, *P_384 = NULL, *P_521 = NULL;
EC_POINT *P, *Q, *R;
BIGNUM *x, *y, *z;
unsigned char buf[100];
size_t i, len;
int k;
# if 1 /* optional */
ctx = BN_CTX_new();
if (!ctx)
ABORT;
# endif
p = BN_new();
a = BN_new();
b = BN_new();
if (!p || !a || !b)
ABORT;
group = EC_GROUP_new(EC_GFp_mont_method()); /* applications should use
* EC_GROUP_new_curve_GFp so
* that the library gets to
* choose the EC_METHOD */
if (!group)
ABORT;
P = EC_POINT_new(group);
Q = EC_POINT_new(group);
R = EC_POINT_new(group);
if (!P || !Q || !R)
ABORT;
x = BN_new();
y = BN_new();
z = BN_new();
if (!x || !y || !z)
ABORT;
/* Curve P-256 (FIPS PUB 186-2, App. 6) */
if (!BN_hex2bn
(&p,
"FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF"))
ABORT;
if (1 != BN_is_prime_ex(p, BN_prime_checks, ctx, NULL))
ABORT;
if (!BN_hex2bn
(&a,
"FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFC"))
ABORT;
if (!BN_hex2bn
(&b,
"5AC635D8AA3A93E7B3EBBD55769886BC651D06B0CC53B0F63BCE3C3E27D2604B"))
ABORT;
if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx))
ABORT;
if (!BN_hex2bn
(&x,
"6B17D1F2E12C4247F8BCE6E563A440F277037D812DEB33A0F4A13945D898C296"))
ABORT;
if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 1, ctx))
ABORT;
if (EC_POINT_is_on_curve(group, P, ctx) <= 0)
ABORT;
if (!BN_hex2bn(&z, "FFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E"
"84F3B9CAC2FC632551"))
ABORT;
if (!EC_GROUP_set_generator(group, P, z, BN_value_one()))
ABORT;
if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx))
ABORT;
fprintf(stdout, "\nNIST curve P-256 -- Generator:\n x = 0x");
BN_print_fp(stdout, x);
fprintf(stdout, "\n y = 0x");
BN_print_fp(stdout, y);
fprintf(stdout, "\n");
/* G_y value taken from the standard: */
if (!BN_hex2bn
(&z,
"4FE342E2FE1A7F9B8EE7EB4A7C0F9E162BCE33576B315ECECBB6406837BF51F5"))
ABORT;
if (0 != BN_cmp(y, z))
ABORT;
fprintf(stdout, "verify degree ...");
if (EC_GROUP_get_degree(group) != 256)
ABORT;
fprintf(stdout, " ok\n");
group_order_tests(group);
if (!(P_256 = EC_GROUP_new(EC_GROUP_method_of(group))))
ABORT;
if (!EC_GROUP_copy(P_256, group))
ABORT;
/* Curve P-384 (FIPS PUB 186-2, App. 6) */
if (!BN_hex2bn(&p, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFF"))
ABORT;
if (1 != BN_is_prime_ex(p, BN_prime_checks, ctx, NULL))
ABORT;
if (!BN_hex2bn(&a, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFEFFFFFFFF0000000000000000FFFFFFFC"))
ABORT;
if (!BN_hex2bn(&b, "B3312FA7E23EE7E4988E056BE3F82D19181D9C6EFE8141"
"120314088F5013875AC656398D8A2ED19D2A85C8EDD3EC2AEF"))
ABORT;
if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx))
ABORT;
if (!BN_hex2bn(&x, "AA87CA22BE8B05378EB1C71EF320AD746E1D3B628BA79B"
"9859F741E082542A385502F25DBF55296C3A545E3872760AB7"))
ABORT;
if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 1, ctx))
ABORT;
if (EC_POINT_is_on_curve(group, P, ctx) <= 0)
ABORT;
if (!BN_hex2bn(&z, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFC7634D81F4372DDF581A0DB248B0A77AECEC196ACCC52973"))
ABORT;
if (!EC_GROUP_set_generator(group, P, z, BN_value_one()))
ABORT;
if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx))
ABORT;
fprintf(stdout, "\nNIST curve P-384 -- Generator:\n x = 0x");
BN_print_fp(stdout, x);
fprintf(stdout, "\n y = 0x");
BN_print_fp(stdout, y);
fprintf(stdout, "\n");
/* G_y value taken from the standard: */
if (!BN_hex2bn(&z, "3617DE4A96262C6F5D9E98BF9292DC29F8F41DBD289A14"
"7CE9DA3113B5F0B8C00A60B1CE1D7E819D7A431D7C90EA0E5F"))
ABORT;
if (0 != BN_cmp(y, z))
ABORT;
fprintf(stdout, "verify degree ...");
if (EC_GROUP_get_degree(group) != 384)
ABORT;
fprintf(stdout, " ok\n");
group_order_tests(group);
if (!(P_384 = EC_GROUP_new(EC_GROUP_method_of(group))))
ABORT;
if (!EC_GROUP_copy(P_384, group))
ABORT;
/* Curve P-521 (FIPS PUB 186-2, App. 6) */
if (!BN_hex2bn(&p, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFFFFFFFFFFFF"))
ABORT;
if (1 != BN_is_prime_ex(p, BN_prime_checks, ctx, NULL))
ABORT;
if (!BN_hex2bn(&a, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFFFFFFFFFFFC"))
ABORT;
if (!BN_hex2bn(&b, "051953EB9618E1C9A1F929A21A0B68540EEA2DA725B99B"
"315F3B8B489918EF109E156193951EC7E937B1652C0BD3BB1BF073573"
"DF883D2C34F1EF451FD46B503F00"))
ABORT;
if (!EC_GROUP_set_curve_GFp(group, p, a, b, ctx))
ABORT;
if (!BN_hex2bn(&x, "C6858E06B70404E9CD9E3ECB662395B4429C648139053F"
"B521F828AF606B4D3DBAA14B5E77EFE75928FE1DC127A2FFA8DE3348B"
"3C1856A429BF97E7E31C2E5BD66"))
ABORT;
if (!EC_POINT_set_compressed_coordinates_GFp(group, P, x, 0, ctx))
ABORT;
if (EC_POINT_is_on_curve(group, P, ctx) <= 0)
ABORT;
if (!BN_hex2bn(&z, "1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
"FFFFFFFFFFFFFFFFFFFFA51868783BF2F966B7FCC0148F709A5D03BB5"
"C9B8899C47AEBB6FB71E91386409"))
ABORT;
if (!EC_GROUP_set_generator(group, P, z, BN_value_one()))
ABORT;
if (!EC_POINT_get_affine_coordinates_GFp(group, P, x, y, ctx))
ABORT;
fprintf(stdout, "\nNIST curve P-521 -- Generator:\n x = 0x");
BN_print_fp(stdout, x);
fprintf(stdout, "\n y = 0x");
BN_print_fp(stdout, y);
fprintf(stdout, "\n");
/* G_y value taken from the standard: */
if (!BN_hex2bn(&z, "11839296A789A3BC0045C8A5FB42C7D1BD998F54449579"
"B446817AFBD17273E662C97EE72995EF42640C550B9013FAD0761353C"
"7086A272C24088BE94769FD16650"))
ABORT;
if (0 != BN_cmp(y, z))
ABORT;
fprintf(stdout, "verify degree ...");
if (EC_GROUP_get_degree(group) != 521)
ABORT;
fprintf(stdout, " ok\n");
group_order_tests(group);
if (!(P_521 = EC_GROUP_new(EC_GROUP_method_of(group))))
ABORT;
if (!EC_GROUP_copy(P_521, group))
ABORT;
/* more tests using the last curve */
if (!EC_POINT_copy(Q, P))
ABORT;
if (EC_POINT_is_at_infinity(group, Q))
ABORT;
if (!EC_POINT_dbl(group, P, P, ctx))
ABORT;
if (EC_POINT_is_on_curve(group, P, ctx) <= 0)
ABORT;
if (!EC_POINT_invert(group, Q, ctx))
ABORT; /* P = -2Q */
if (!EC_POINT_add(group, R, P, Q, ctx))
ABORT;
if (!EC_POINT_add(group, R, R, Q, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, R))
ABORT; /* R = P + 2Q */
{
const EC_POINT *points[4];
const BIGNUM *scalars[4];
BIGNUM scalar3;
if (EC_POINT_is_at_infinity(group, Q))
ABORT;
points[0] = Q;
points[1] = Q;
points[2] = Q;
points[3] = Q;
if (!EC_GROUP_get_order(group, z, ctx))
ABORT;
if (!BN_add(y, z, BN_value_one()))
ABORT;
if (BN_is_odd(y))
ABORT;
if (!BN_rshift1(y, y))
ABORT;
scalars[0] = y; /* (group order + 1)/2, so y*Q + y*Q = Q */
scalars[1] = y;
fprintf(stdout, "combined multiplication ...");
fflush(stdout);
/* z is still the group order */
if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx))
ABORT;
if (!EC_POINTs_mul(group, R, z, 2, points, scalars, ctx))
ABORT;
if (0 != EC_POINT_cmp(group, P, R, ctx))
ABORT;
if (0 != EC_POINT_cmp(group, R, Q, ctx))
ABORT;
fprintf(stdout, ".");
fflush(stdout);
if (!BN_pseudo_rand(y, BN_num_bits(y), 0, 0))
ABORT;
if (!BN_add(z, z, y))
ABORT;
BN_set_negative(z, 1);
scalars[0] = y;
scalars[1] = z; /* z = -(order + y) */
if (!EC_POINTs_mul(group, P, NULL, 2, points, scalars, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, P))
ABORT;
fprintf(stdout, ".");
fflush(stdout);
if (!BN_pseudo_rand(x, BN_num_bits(y) - 1, 0, 0))
ABORT;
if (!BN_add(z, x, y))
ABORT;
BN_set_negative(z, 1);
scalars[0] = x;
scalars[1] = y;
scalars[2] = z; /* z = -(x+y) */
BN_init(&scalar3);
BN_zero(&scalar3);
scalars[3] = &scalar3;
if (!EC_POINTs_mul(group, P, NULL, 4, points, scalars, ctx))
ABORT;
if (!EC_POINT_is_at_infinity(group, P))
ABORT;
fprintf(stdout, " ok\n\n");
BN_free(&scalar3);
}
# if 0
timings(P_256, TIMING_BASE_PT, ctx);
timings(P_256, TIMING_RAND_PT, ctx);
timings(P_256, TIMING_SIMUL, ctx);
timings(P_384, TIMING_BASE_PT, ctx);
timings(P_384, TIMING_RAND_PT, ctx);
timings(P_384, TIMING_SIMUL, ctx);
timings(P_521, TIMING_BASE_PT, ctx);
timings(P_521, TIMING_RAND_PT, ctx);
timings(P_521, TIMING_SIMUL, ctx);
# endif
if (ctx)
BN_CTX_free(ctx);
BN_free(p);
BN_free(a);
BN_free(b);
EC_GROUP_free(group);
EC_POINT_free(P);
EC_POINT_free(Q);
EC_POINT_free(R);
BN_free(x);
BN_free(y);
BN_free(z);
if (P_160)
EC_GROUP_free(P_160);
if (P_192)
EC_GROUP_free(P_192);
if (P_224)
EC_GROUP_free(P_224);
if (P_256)
EC_GROUP_free(P_256);
if (P_384)
EC_GROUP_free(P_384);
if (P_521)
EC_GROUP_free(P_521);
}
static void internal_curve_test(void)
{
EC_builtin_curve *curves = NULL;
size_t crv_len = 0, n = 0;
int ok = 1;
crv_len = EC_get_builtin_curves(NULL, 0);
curves = OPENSSL_malloc(sizeof(EC_builtin_curve) * crv_len);
if (curves == NULL)
return;
if (!EC_get_builtin_curves(curves, crv_len)) {
OPENSSL_free(curves);
return;
}
fprintf(stdout, "testing internal curves: ");
for (n = 0; n < crv_len; n++) {
EC_GROUP *group = NULL;
int nid = curves[n].nid;
if ((group = EC_GROUP_new_by_curve_name(nid)) == NULL) {
ok = 0;
fprintf(stdout, "\nEC_GROUP_new_curve_name() failed with"
" curve %s\n", OBJ_nid2sn(nid));
/* try next curve */
continue;
}
if (!EC_GROUP_check(group, NULL)) {
ok = 0;
fprintf(stdout, "\nEC_GROUP_check() failed with"
" curve %s\n", OBJ_nid2sn(nid));
EC_GROUP_free(group);
/* try the next curve */
continue;
}
fprintf(stdout, ".");
fflush(stdout);
EC_GROUP_free(group);
}
if (ok)
fprintf(stdout, " ok\n\n");
else {
fprintf(stdout, " failed\n\n");
ABORT;
}
OPENSSL_free(curves);
return;
}
# ifndef OPENSSL_NO_EC_NISTP_64_GCC_128
/*
* nistp_test_params contains magic numbers for testing our optimized
* implementations of several NIST curves with characteristic > 3.
*/
struct nistp_test_params {
const EC_METHOD *(*meth) ();
int degree;
/*
* Qx, Qy and D are taken from
* http://csrc.nist.gov/groups/ST/toolkit/documents/Examples/ECDSA_Prime.pdf
* Otherwise, values are standard curve parameters from FIPS 180-3
*/
const char *p, *a, *b, *Qx, *Qy, *Gx, *Gy, *order, *d;
};
static const struct nistp_test_params nistp_tests_params[] = {
{
/* P-256 */
EC_GFp_nistp256_method,
256,
/* p */
"ffffffff00000001000000000000000000000000ffffffffffffffffffffffff",
/* a */
"ffffffff00000001000000000000000000000000fffffffffffffffffffffffc",
/* b */
"5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b",
/* Qx */
"b7e08afdfe94bad3f1dc8c734798ba1c62b3a0ad1e9ea2a38201cd0889bc7a19",
/* Qy */
"3603f747959dbf7a4bb226e41928729063adc7ae43529e61b563bbc606cc5e09",
/* Gx */
"6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296",
/* Gy */
"4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5",
/* order */
"ffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551",
/* d */
"c477f9f65c22cce20657faa5b2d1d8122336f851a508a1ed04e479c34985bf96",
},
{
/* P-521 */
EC_GFp_nistp521_method,
521,
/* p */
"1ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
/* a */
"1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc",
/* b */
"051953eb9618e1c9a1f929a21a0b68540eea2da725b99b315f3b8b489918ef109e156193951ec7e937b1652c0bd3bb1bf073573df883d2c34f1ef451fd46b503f00",
/* Qx */
"0098e91eef9a68452822309c52fab453f5f117c1da8ed796b255e9ab8f6410cca16e59df403a6bdc6ca467a37056b1e54b3005d8ac030decfeb68df18b171885d5c4",
/* Qy */
"0164350c321aecfc1cca1ba4364c9b15656150b4b78d6a48d7d28e7f31985ef17be8554376b72900712c4b83ad668327231526e313f5f092999a4632fd50d946bc2e",
/* Gx */
"c6858e06b70404e9cd9e3ecb662395b4429c648139053fb521f828af606b4d3dbaa14b5e77efe75928fe1dc127a2ffa8de3348b3c1856a429bf97e7e31c2e5bd66",
/* Gy */
"11839296a789a3bc0045c8a5fb42c7d1bd998f54449579b446817afbd17273e662c97ee72995ef42640c550b9013fad0761353c7086a272c24088be94769fd16650",
/* order */
"1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffa51868783bf2f966b7fcc0148f709a5d03bb5c9b8899c47aebb6fb71e91386409",
/* d */
"0100085f47b8e1b8b11b7eb33028c0b2888e304bfc98501955b45bba1478dc184eeedf09b86a5f7c21994406072787205e69a63709fe35aa93ba333514b24f961722",
},
};
static void nistp_single_test(const struct nistp_test_params *test)
{
BN_CTX *ctx;
BIGNUM *p, *a, *b, *x, *y, *n, *m, *order;
EC_GROUP *NISTP;
EC_POINT *G, *P, *Q, *Q_CHECK;
fprintf(stdout, "\nNIST curve P-%d (optimised implementation):\n",
test->degree);
ctx = BN_CTX_new();
p = BN_new();
a = BN_new();
b = BN_new();
x = BN_new();
y = BN_new();
m = BN_new();
n = BN_new();
order = BN_new();
NISTP = EC_GROUP_new(test->meth());
if (!NISTP)
ABORT;
if (!BN_hex2bn(&p, test->p))
ABORT;
if (1 != BN_is_prime_ex(p, BN_prime_checks, ctx, NULL))
ABORT;
if (!BN_hex2bn(&a, test->a))
ABORT;
if (!BN_hex2bn(&b, test->b))
ABORT;
if (!EC_GROUP_set_curve_GFp(NISTP, p, a, b, ctx))
ABORT;
G = EC_POINT_new(NISTP);
P = EC_POINT_new(NISTP);
Q = EC_POINT_new(NISTP);
Q_CHECK = EC_POINT_new(NISTP);
if (!BN_hex2bn(&x, test->Qx))
ABORT;
if (!BN_hex2bn(&y, test->Qy))
ABORT;
if (!EC_POINT_set_affine_coordinates_GFp(NISTP, Q_CHECK, x, y, ctx))
ABORT;
if (!BN_hex2bn(&x, test->Gx))
ABORT;
if (!BN_hex2bn(&y, test->Gy))
ABORT;
if (!EC_POINT_set_affine_coordinates_GFp(NISTP, G, x, y, ctx))
ABORT;
if (!BN_hex2bn(&order, test->order))
ABORT;
if (!EC_GROUP_set_generator(NISTP, G, order, BN_value_one()))
ABORT;
fprintf(stdout, "verify degree ... ");
if (EC_GROUP_get_degree(NISTP) != test->degree)
ABORT;
fprintf(stdout, "ok\n");
fprintf(stdout, "NIST test vectors ... ");
if (!BN_hex2bn(&n, test->d))
ABORT;
/* fixed point multiplication */
EC_POINT_mul(NISTP, Q, n, NULL, NULL, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* random point multiplication */
EC_POINT_mul(NISTP, Q, NULL, G, n, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* set generator to P = 2*G, where G is the standard generator */
if (!EC_POINT_dbl(NISTP, P, G, ctx))
ABORT;
if (!EC_GROUP_set_generator(NISTP, P, order, BN_value_one()))
ABORT;
/* set the scalar to m=n/2, where n is the NIST test scalar */
if (!BN_rshift(m, n, 1))
ABORT;
/* test the non-standard generator */
/* fixed point multiplication */
EC_POINT_mul(NISTP, Q, m, NULL, NULL, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* random point multiplication */
EC_POINT_mul(NISTP, Q, NULL, P, m, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/*
* We have not performed precomputation so have_precompute mult should be
* false
*/
if (EC_GROUP_have_precompute_mult(NISTP))
ABORT;
/* now repeat all tests with precomputation */
if (!EC_GROUP_precompute_mult(NISTP, ctx))
ABORT;
if (!EC_GROUP_have_precompute_mult(NISTP))
ABORT;
/* fixed point multiplication */
EC_POINT_mul(NISTP, Q, m, NULL, NULL, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* random point multiplication */
EC_POINT_mul(NISTP, Q, NULL, P, m, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* reset generator */
if (!EC_GROUP_set_generator(NISTP, G, order, BN_value_one()))
ABORT;
/* fixed point multiplication */
EC_POINT_mul(NISTP, Q, n, NULL, NULL, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
/* random point multiplication */
EC_POINT_mul(NISTP, Q, NULL, G, n, ctx);
if (0 != EC_POINT_cmp(NISTP, Q, Q_CHECK, ctx))
ABORT;
fprintf(stdout, "ok\n");
group_order_tests(NISTP);
# if 0
timings(NISTP, TIMING_BASE_PT, ctx);
timings(NISTP, TIMING_RAND_PT, ctx);
# endif
EC_GROUP_free(NISTP);
EC_POINT_free(G);
EC_POINT_free(P);
EC_POINT_free(Q);
EC_POINT_free(Q_CHECK);
BN_free(n);
BN_free(m);
BN_free(p);
BN_free(a);
BN_free(b);
BN_free(x);
BN_free(y);
BN_free(order);
BN_CTX_free(ctx);
}
static void nistp_tests()
{
unsigned i;
for (i = 0;
i < sizeof(nistp_tests_params) / sizeof(struct nistp_test_params);
i++) {
nistp_single_test(&nistp_tests_params[i]);
}
}
# endif
static const char rnd_seed[] =
"string to make the random number generator think it has entropy";
int main(int argc, char *argv[])
{
/* enable memory leak checking unless explicitly disabled */
if (!((getenv("OPENSSL_DEBUG_MEMORY") != NULL)
&& (0 == strcmp(getenv("OPENSSL_DEBUG_MEMORY"), "off")))) {
CRYPTO_malloc_debug_init();
CRYPTO_set_mem_debug_options(V_CRYPTO_MDEBUG_ALL);
} else {
/* OPENSSL_DEBUG_MEMORY=off */
CRYPTO_set_mem_debug_functions(0, 0, 0, 0, 0);
}
CRYPTO_mem_ctrl(CRYPTO_MEM_CHECK_ON);
ERR_load_crypto_strings();
RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */
prime_field_tests();
puts("");
# ifndef OPENSSL_NO_EC2M
char2_field_tests();
# endif
# ifndef OPENSSL_NO_EC_NISTP_64_GCC_128
nistp_tests();
# endif
/* test the internal curves */
internal_curve_test();
# ifndef OPENSSL_NO_ENGINE
ENGINE_cleanup();
# endif
CRYPTO_cleanup_all_ex_data();
ERR_free_strings();
ERR_remove_thread_state(NULL);
CRYPTO_mem_leaks_fp(stderr);
return 0;
}
#endif
|
__label__pos
| 0.719158 |
Lua ltable.c (5.4.6)
/*
** $Id: ltable.c $
** Lua tables (hash)
** See Copyright Notice in lua.h
*/
#define ltable_c
#define LUA_CORE
#include "lprefix.h"
/*
** Implementation of tables (aka arrays, objects, or hash tables).
** Tables keep its elements in two parts: an array part and a hash part.
** Non-negative integer keys are all candidates to be kept in the array
** part. The actual size of the array is the largest 'n' such that
** more than half the slots between 1 and n are in use.
** Hash uses a mix of chained scatter table with Brent's variation.
** A main invariant of these tables is that, if an element is not
** in its main position (i.e. the 'original' position that its hash gives
** to it), then the colliding element is in its own main position.
** Hence even when the load factor reaches 100%, performance remains good.
*/
#include <math.h>
#include <limits.h>
#include "lua.h"
#include "ldebug.h"
#include "ldo.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
#include "lvm.h"
/*
** MAXABITS is the largest integer such that MAXASIZE fits in an
** unsigned int.
*/
#define MAXABITS cast_int(sizeof(int) * CHAR_BIT - 1)
/*
** MAXASIZE is the maximum size of the array part. It is the minimum
** between 2^MAXABITS and the maximum size that, measured in bytes,
** fits in a 'size_t'.
*/
#define MAXASIZE luaM_limitN(1u << MAXABITS, TValue)
/*
** MAXHBITS is the largest integer such that 2^MAXHBITS fits in a
** signed int.
*/
#define MAXHBITS (MAXABITS - 1)
/*
** MAXHSIZE is the maximum size of the hash part. It is the minimum
** between 2^MAXHBITS and the maximum size such that, measured in bytes,
** it fits in a 'size_t'.
*/
#define MAXHSIZE luaM_limitN(1u << MAXHBITS, Node)
/*
** When the original hash value is good, hashing by a power of 2
** avoids the cost of '%'.
*/
#define hashpow2(t,n) (gnode(t, lmod((n), sizenode(t))))
/*
** for other types, it is better to avoid modulo by power of 2, as
** they can have many 2 factors.
*/
#define hashmod(t,n) (gnode(t, ((n) % ((sizenode(t)-1)|1))))
#define hashstr(t,str) hashpow2(t, (str)->hash)
#define hashboolean(t,p) hashpow2(t, p)
#define hashpointer(t,p) hashmod(t, point2uint(p))
#define dummynode (&dummynode_)
static const Node dummynode_ = {
{{NULL}, LUA_VEMPTY, /* value's value and type */
LUA_VNIL, 0, {NULL}} /* key type, next, and key value */
};
static const TValue absentkey = {ABSTKEYCONSTANT};
/*
** Hash for integers. To allow a good hash, use the remainder operator
** ('%'). If integer fits as a non-negative int, compute an int
** remainder, which is faster. Otherwise, use an unsigned-integer
** remainder, which uses all bits and ensures a non-negative result.
*/
static Node *hashint (const Table *t, lua_Integer i) {
lua_Unsigned ui = l_castS2U(i);
if (ui <= cast_uint(INT_MAX))
return hashmod(t, cast_int(ui));
else
return hashmod(t, ui);
}
/*
** Hash for floating-point numbers.
** The main computation should be just
** n = frexp(n, &i); return (n * INT_MAX) + i
** but there are some numerical subtleties.
** In a two-complement representation, INT_MAX does not has an exact
** representation as a float, but INT_MIN does; because the absolute
** value of 'frexp' is smaller than 1 (unless 'n' is inf/NaN), the
** absolute value of the product 'frexp * -INT_MIN' is smaller or equal
** to INT_MAX. Next, the use of 'unsigned int' avoids overflows when
** adding 'i'; the use of '~u' (instead of '-u') avoids problems with
** INT_MIN.
*/
#if !defined(l_hashfloat)
static int l_hashfloat (lua_Number n) {
int i;
lua_Integer ni;
n = l_mathop(frexp)(n, &i) * -cast_num(INT_MIN);
if (!lua_numbertointeger(n, &ni)) { /* is 'n' inf/-inf/NaN? */
lua_assert(luai_numisnan(n) || l_mathop(fabs)(n) == cast_num(HUGE_VAL));
return 0;
}
else { /* normal case */
unsigned int u = cast_uint(i) + cast_uint(ni);
return cast_int(u <= cast_uint(INT_MAX) ? u : ~u);
}
}
#endif
/*
** returns the 'main' position of an element in a table (that is,
** the index of its hash value).
*/
static Node *mainpositionTV (const Table *t, const TValue *key) {
switch (ttypetag(key)) {
case LUA_VNUMINT: {
lua_Integer i = ivalue(key);
return hashint(t, i);
}
case LUA_VNUMFLT: {
lua_Number n = fltvalue(key);
return hashmod(t, l_hashfloat(n));
}
case LUA_VSHRSTR: {
TString *ts = tsvalue(key);
return hashstr(t, ts);
}
case LUA_VLNGSTR: {
TString *ts = tsvalue(key);
return hashpow2(t, luaS_hashlongstr(ts));
}
case LUA_VFALSE:
return hashboolean(t, 0);
case LUA_VTRUE:
return hashboolean(t, 1);
case LUA_VLIGHTUSERDATA: {
void *p = pvalue(key);
return hashpointer(t, p);
}
case LUA_VLCF: {
lua_CFunction f = fvalue(key);
return hashpointer(t, f);
}
default: {
GCObject *o = gcvalue(key);
return hashpointer(t, o);
}
}
}
l_sinline Node *mainpositionfromnode (const Table *t, Node *nd) {
TValue key;
getnodekey(cast(lua_State *, NULL), &key, nd);
return mainpositionTV(t, &key);
}
/*
** Check whether key 'k1' is equal to the key in node 'n2'. This
** equality is raw, so there are no metamethods. Floats with integer
** values have been normalized, so integers cannot be equal to
** floats. It is assumed that 'eqshrstr' is simply pointer equality, so
** that short strings are handled in the default case.
** A true 'deadok' means to accept dead keys as equal to their original
** values. All dead keys are compared in the default case, by pointer
** identity. (Only collectable objects can produce dead keys.) Note that
** dead long strings are also compared by identity.
** Once a key is dead, its corresponding value may be collected, and
** then another value can be created with the same address. If this
** other value is given to 'next', 'equalkey' will signal a false
** positive. In a regular traversal, this situation should never happen,
** as all keys given to 'next' came from the table itself, and therefore
** could not have been collected. Outside a regular traversal, we
** have garbage in, garbage out. What is relevant is that this false
** positive does not break anything. (In particular, 'next' will return
** some other valid item on the table or nil.)
*/
static int equalkey (const TValue *k1, const Node *n2, int deadok) {
if ((rawtt(k1) != keytt(n2)) && /* not the same variants? */
!(deadok && keyisdead(n2) && iscollectable(k1)))
return 0; /* cannot be same key */
switch (keytt(n2)) {
case LUA_VNIL: case LUA_VFALSE: case LUA_VTRUE:
return 1;
case LUA_VNUMINT:
return (ivalue(k1) == keyival(n2));
case LUA_VNUMFLT:
return luai_numeq(fltvalue(k1), fltvalueraw(keyval(n2)));
case LUA_VLIGHTUSERDATA:
return pvalue(k1) == pvalueraw(keyval(n2));
case LUA_VLCF:
return fvalue(k1) == fvalueraw(keyval(n2));
case ctb(LUA_VLNGSTR):
return luaS_eqlngstr(tsvalue(k1), keystrval(n2));
default:
return gcvalue(k1) == gcvalueraw(keyval(n2));
}
}
/*
** True if value of 'alimit' is equal to the real size of the array
** part of table 't'. (Otherwise, the array part must be larger than
** 'alimit'.)
*/
#define limitequalsasize(t) (isrealasize(t) || ispow2((t)->alimit))
/*
** Returns the real size of the 'array' array
*/
LUAI_FUNC unsigned int luaH_realasize (const Table *t) {
if (limitequalsasize(t))
return t->alimit; /* this is the size */
else {
unsigned int size = t->alimit;
/* compute the smallest power of 2 not smaller than 'n' */
size |= (size >> 1);
size |= (size >> 2);
size |= (size >> 4);
size |= (size >> 8);
#if (UINT_MAX >> 14) > 3 /* unsigned int has more than 16 bits */
size |= (size >> 16);
#if (UINT_MAX >> 30) > 3
size |= (size >> 32); /* unsigned int has more than 32 bits */
#endif
#endif
size++;
lua_assert(ispow2(size) && size/2 < t->alimit && t->alimit < size);
return size;
}
}
/*
** Check whether real size of the array is a power of 2.
** (If it is not, 'alimit' cannot be changed to any other value
** without changing the real size.)
*/
static int ispow2realasize (const Table *t) {
return (!isrealasize(t) || ispow2(t->alimit));
}
static unsigned int setlimittosize (Table *t) {
t->alimit = luaH_realasize(t);
setrealasize(t);
return t->alimit;
}
#define limitasasize(t) check_exp(isrealasize(t), t->alimit)
/*
** "Generic" get version. (Not that generic: not valid for integers,
** which may be in array part, nor for floats with integral values.)
** See explanation about 'deadok' in function 'equalkey'.
*/
static const TValue *getgeneric (Table *t, const TValue *key, int deadok) {
Node *n = mainpositionTV(t, key);
for (;;) { /* check whether 'key' is somewhere in the chain */
if (equalkey(key, n, deadok))
return gval(n); /* that's it */
else {
int nx = gnext(n);
if (nx == 0)
return &absentkey; /* not found */
n += nx;
}
}
}
/*
** returns the index for 'k' if 'k' is an appropriate key to live in
** the array part of a table, 0 otherwise.
*/
static unsigned int arrayindex (lua_Integer k) {
if (l_castS2U(k) - 1u < MAXASIZE) /* 'k' in [1, MAXASIZE]? */
return cast_uint(k); /* 'key' is an appropriate array index */
else
return 0;
}
/*
** returns the index of a 'key' for table traversals. First goes all
** elements in the array part, then elements in the hash part. The
** beginning of a traversal is signaled by 0.
*/
static unsigned int findindex (lua_State *L, Table *t, TValue *key,
unsigned int asize) {
unsigned int i;
if (ttisnil(key)) return 0; /* first iteration */
i = ttisinteger(key) ? arrayindex(ivalue(key)) : 0;
if (i - 1u < asize) /* is 'key' inside array part? */
return i; /* yes; that's the index */
else {
const TValue *n = getgeneric(t, key, 1);
if (l_unlikely(isabstkey(n)))
luaG_runerror(L, "invalid key to 'next'"); /* key not found */
i = cast_int(nodefromval(n) - gnode(t, 0)); /* key index in hash table */
/* hash elements are numbered after array ones */
return (i + 1) + asize;
}
}
int luaH_next (lua_State *L, Table *t, StkId key) {
unsigned int asize = luaH_realasize(t);
unsigned int i = findindex(L, t, s2v(key), asize); /* find original key */
for (; i < asize; i++) { /* try first array part */
if (!isempty(&t->array[i])) { /* a non-empty entry? */
setivalue(s2v(key), i + 1);
setobj2s(L, key + 1, &t->array[i]);
return 1;
}
}
for (i -= asize; cast_int(i) < sizenode(t); i++) { /* hash part */
if (!isempty(gval(gnode(t, i)))) { /* a non-empty entry? */
Node *n = gnode(t, i);
getnodekey(L, s2v(key), n);
setobj2s(L, key + 1, gval(n));
return 1;
}
}
return 0; /* no more elements */
}
static void freehash (lua_State *L, Table *t) {
if (!isdummy(t))
luaM_freearray(L, t->node, cast_sizet(sizenode(t)));
}
/*
** {=============================================================
** Rehash
** ==============================================================
*/
/*
** Compute the optimal size for the array part of table 't'. 'nums' is a
** "count array" where 'nums[i]' is the number of integers in the table
** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of
** integer keys in the table and leaves with the number of keys that
** will go to the array part; return the optimal size. (The condition
** 'twotoi > 0' in the for loop stops the loop if 'twotoi' overflows.)
*/
static unsigned int computesizes (unsigned int nums[], unsigned int *pna) {
int i;
unsigned int twotoi; /* 2^i (candidate for optimal size) */
unsigned int a = 0; /* number of elements smaller than 2^i */
unsigned int na = 0; /* number of elements to go to array part */
unsigned int optimal = 0; /* optimal size for array part */
/* loop while keys can fill more than half of total size */
for (i = 0, twotoi = 1;
twotoi > 0 && *pna > twotoi / 2;
i++, twotoi *= 2) {
a += nums[i];
if (a > twotoi/2) { /* more than half elements present? */
optimal = twotoi; /* optimal size (till now) */
na = a; /* all elements up to 'optimal' will go to array part */
}
}
lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal);
*pna = na;
return optimal;
}
static int countint (lua_Integer key, unsigned int *nums) {
unsigned int k = arrayindex(key);
if (k != 0) { /* is 'key' an appropriate array index? */
nums[luaO_ceillog2(k)]++; /* count as such */
return 1;
}
else
return 0;
}
/*
** Count keys in array part of table 't': Fill 'nums[i]' with
** number of keys that will go into corresponding slice and return
** total number of non-nil keys.
*/
static unsigned int numusearray (const Table *t, unsigned int *nums) {
int lg;
unsigned int ttlg; /* 2^lg */
unsigned int ause = 0; /* summation of 'nums' */
unsigned int i = 1; /* count to traverse all array keys */
unsigned int asize = limitasasize(t); /* real array size */
/* traverse each slice */
for (lg = 0, ttlg = 1; lg <= MAXABITS; lg++, ttlg *= 2) {
unsigned int lc = 0; /* counter */
unsigned int lim = ttlg;
if (lim > asize) {
lim = asize; /* adjust upper limit */
if (i > lim)
break; /* no more elements to count */
}
/* count elements in range (2^(lg - 1), 2^lg] */
for (; i <= lim; i++) {
if (!isempty(&t->array[i-1]))
lc++;
}
nums[lg] += lc;
ause += lc;
}
return ause;
}
static int numusehash (const Table *t, unsigned int *nums, unsigned int *pna) {
int totaluse = 0; /* total number of elements */
int ause = 0; /* elements added to 'nums' (can go to array part) */
int i = sizenode(t);
while (i--) {
Node *n = &t->node[i];
if (!isempty(gval(n))) {
if (keyisinteger(n))
ause += countint(keyival(n), nums);
totaluse++;
}
}
*pna += ause;
return totaluse;
}
/*
** Creates an array for the hash part of a table with the given
** size, or reuses the dummy node if size is zero.
** The computation for size overflow is in two steps: the first
** comparison ensures that the shift in the second one does not
** overflow.
*/
static void setnodevector (lua_State *L, Table *t, unsigned int size) {
if (size == 0) { /* no elements to hash part? */
t->node = cast(Node *, dummynode); /* use common 'dummynode' */
t->lsizenode = 0;
t->lastfree = NULL; /* signal that it is using dummy node */
}
else {
int i;
int lsize = luaO_ceillog2(size);
if (lsize > MAXHBITS || (1u << lsize) > MAXHSIZE)
luaG_runerror(L, "table overflow");
size = twoto(lsize);
t->node = luaM_newvector(L, size, Node);
for (i = 0; i < cast_int(size); i++) {
Node *n = gnode(t, i);
gnext(n) = 0;
setnilkey(n);
setempty(gval(n));
}
t->lsizenode = cast_byte(lsize);
t->lastfree = gnode(t, size); /* all positions are free */
}
}
/*
** (Re)insert all elements from the hash part of 'ot' into table 't'.
*/
static void reinsert (lua_State *L, Table *ot, Table *t) {
int j;
int size = sizenode(ot);
for (j = 0; j < size; j++) {
Node *old = gnode(ot, j);
if (!isempty(gval(old))) {
/* doesn't need barrier/invalidate cache, as entry was
already present in the table */
TValue k;
getnodekey(L, &k, old);
luaH_set(L, t, &k, gval(old));
}
}
}
/*
** Exchange the hash part of 't1' and 't2'.
*/
static void exchangehashpart (Table *t1, Table *t2) {
lu_byte lsizenode = t1->lsizenode;
Node *node = t1->node;
Node *lastfree = t1->lastfree;
t1->lsizenode = t2->lsizenode;
t1->node = t2->node;
t1->lastfree = t2->lastfree;
t2->lsizenode = lsizenode;
t2->node = node;
t2->lastfree = lastfree;
}
/*
** Resize table 't' for the new given sizes. Both allocations (for
** the hash part and for the array part) can fail, which creates some
** subtleties. If the first allocation, for the hash part, fails, an
** error is raised and that is it. Otherwise, it copies the elements from
** the shrinking part of the array (if it is shrinking) into the new
** hash. Then it reallocates the array part. If that fails, the table
** is in its original state; the function frees the new hash part and then
** raises the allocation error. Otherwise, it sets the new hash part
** into the table, initializes the new part of the array (if any) with
** nils and reinserts the elements of the old hash back into the new
** parts of the table.
*/
void luaH_resize (lua_State *L, Table *t, unsigned int newasize,
unsigned int nhsize) {
unsigned int i;
Table newt; /* to keep the new hash part */
unsigned int oldasize = setlimittosize(t);
TValue *newarray;
/* create new hash part with appropriate size into 'newt' */
setnodevector(L, &newt, nhsize);
if (newasize < oldasize) { /* will array shrink? */
t->alimit = newasize; /* pretend array has new size... */
exchangehashpart(t, &newt); /* and new hash */
/* re-insert into the new hash the elements from vanishing slice */
for (i = newasize; i < oldasize; i++) {
if (!isempty(&t->array[i]))
luaH_setint(L, t, i + 1, &t->array[i]);
}
t->alimit = oldasize; /* restore current size... */
exchangehashpart(t, &newt); /* and hash (in case of errors) */
}
/* allocate new array */
newarray = luaM_reallocvector(L, t->array, oldasize, newasize, TValue);
if (l_unlikely(newarray == NULL && newasize > 0)) { /* allocation failed? */
freehash(L, &newt); /* release new hash part */
luaM_error(L); /* raise error (with array unchanged) */
}
/* allocation ok; initialize new part of the array */
exchangehashpart(t, &newt); /* 't' has the new hash ('newt' has the old) */
t->array = newarray; /* set new array part */
t->alimit = newasize;
for (i = oldasize; i < newasize; i++) /* clear new slice of the array */
setempty(&t->array[i]);
/* re-insert elements from old hash part into new parts */
reinsert(L, &newt, t); /* 'newt' now has the old hash */
freehash(L, &newt); /* free old hash part */
}
void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize) {
int nsize = allocsizenode(t);
luaH_resize(L, t, nasize, nsize);
}
/*
** nums[i] = number of keys 'k' where 2^(i - 1) < k <= 2^i
*/
static void rehash (lua_State *L, Table *t, const TValue *ek) {
unsigned int asize; /* optimal size for array part */
unsigned int na; /* number of keys in the array part */
unsigned int nums[MAXABITS + 1];
int i;
int totaluse;
for (i = 0; i <= MAXABITS; i++) nums[i] = 0; /* reset counts */
setlimittosize(t);
na = numusearray(t, nums); /* count keys in array part */
totaluse = na; /* all those keys are integer keys */
totaluse += numusehash(t, nums, &na); /* count keys in hash part */
/* count extra key */
if (ttisinteger(ek))
na += countint(ivalue(ek), nums);
totaluse++;
/* compute new size for array part */
asize = computesizes(nums, &na);
/* resize the table to new computed sizes */
luaH_resize(L, t, asize, totaluse - na);
}
/*
** }=============================================================
*/
Table *luaH_new (lua_State *L) {
GCObject *o = luaC_newobj(L, LUA_VTABLE, sizeof(Table));
Table *t = gco2t(o);
t->metatable = NULL;
t->flags = cast_byte(maskflags); /* table has no metamethod fields */
t->array = NULL;
t->alimit = 0;
setnodevector(L, t, 0);
return t;
}
void luaH_free (lua_State *L, Table *t) {
freehash(L, t);
luaM_freearray(L, t->array, luaH_realasize(t));
luaM_free(L, t);
}
static Node *getfreepos (Table *t) {
if (!isdummy(t)) {
while (t->lastfree > t->node) {
t->lastfree--;
if (keyisnil(t->lastfree))
return t->lastfree;
}
}
return NULL; /* could not find a free place */
}
/*
** inserts a new key into a hash table; first, check whether key's main
** position is free. If not, check whether colliding node is in its main
** position or not: if it is not, move colliding node to an empty place and
** put new key in its main position; otherwise (colliding node is in its main
** position), new key goes to an empty position.
*/
void luaH_newkey (lua_State *L, Table *t, const TValue *key, TValue *value) {
Node *mp;
TValue aux;
if (l_unlikely(ttisnil(key)))
luaG_runerror(L, "table index is nil");
else if (ttisfloat(key)) {
lua_Number f = fltvalue(key);
lua_Integer k;
if (luaV_flttointeger(f, &k, F2Ieq)) { /* does key fit in an integer? */
setivalue(&aux, k);
key = &aux; /* insert it as an integer */
}
else if (l_unlikely(luai_numisnan(f)))
luaG_runerror(L, "table index is NaN");
}
if (ttisnil(value))
return; /* do not insert nil values */
mp = mainpositionTV(t, key);
if (!isempty(gval(mp)) || isdummy(t)) { /* main position is taken? */
Node *othern;
Node *f = getfreepos(t); /* get a free place */
if (f == NULL) { /* cannot find a free place? */
rehash(L, t, key); /* grow table */
/* whatever called 'newkey' takes care of TM cache */
luaH_set(L, t, key, value); /* insert key into grown table */
return;
}
lua_assert(!isdummy(t));
othern = mainpositionfromnode(t, mp);
if (othern != mp) { /* is colliding node out of its main position? */
/* yes; move colliding node into free position */
while (othern + gnext(othern) != mp) /* find previous */
othern += gnext(othern);
gnext(othern) = cast_int(f - othern); /* rechain to point to 'f' */
*f = *mp; /* copy colliding node into free pos. (mp->next also goes) */
if (gnext(mp) != 0) {
gnext(f) += cast_int(mp - f); /* correct 'next' */
gnext(mp) = 0; /* now 'mp' is free */
}
setempty(gval(mp));
}
else { /* colliding node is in its own main position */
/* new node will go into free position */
if (gnext(mp) != 0)
gnext(f) = cast_int((mp + gnext(mp)) - f); /* chain new position */
else lua_assert(gnext(f) == 0);
gnext(mp) = cast_int(f - mp);
mp = f;
}
}
setnodekey(L, mp, key);
luaC_barrierback(L, obj2gco(t), key);
lua_assert(isempty(gval(mp)));
setobj2t(L, gval(mp), value);
}
/*
** Search function for integers. If integer is inside 'alimit', get it
** directly from the array part. Otherwise, if 'alimit' is not equal to
** the real size of the array, key still can be in the array part. In
** this case, try to avoid a call to 'luaH_realasize' when key is just
** one more than the limit (so that it can be incremented without
** changing the real size of the array).
*/
const TValue *luaH_getint (Table *t, lua_Integer key) {
if (l_castS2U(key) - 1u < t->alimit) /* 'key' in [1, t->alimit]? */
return &t->array[key - 1];
else if (!limitequalsasize(t) && /* key still may be in the array part? */
(l_castS2U(key) == t->alimit + 1 ||
l_castS2U(key) - 1u < luaH_realasize(t))) {
t->alimit = cast_uint(key); /* probably '#t' is here now */
return &t->array[key - 1];
}
else {
Node *n = hashint(t, key);
for (;;) { /* check whether 'key' is somewhere in the chain */
if (keyisinteger(n) && keyival(n) == key)
return gval(n); /* that's it */
else {
int nx = gnext(n);
if (nx == 0) break;
n += nx;
}
}
return &absentkey;
}
}
/*
** search function for short strings
*/
const TValue *luaH_getshortstr (Table *t, TString *key) {
Node *n = hashstr(t, key);
lua_assert(key->tt == LUA_VSHRSTR);
for (;;) { /* check whether 'key' is somewhere in the chain */
if (keyisshrstr(n) && eqshrstr(keystrval(n), key))
return gval(n); /* that's it */
else {
int nx = gnext(n);
if (nx == 0)
return &absentkey; /* not found */
n += nx;
}
}
}
const TValue *luaH_getstr (Table *t, TString *key) {
if (key->tt == LUA_VSHRSTR)
return luaH_getshortstr(t, key);
else { /* for long strings, use generic case */
TValue ko;
setsvalue(cast(lua_State *, NULL), &ko, key);
return getgeneric(t, &ko, 0);
}
}
/*
** main search function
*/
const TValue *luaH_get (Table *t, const TValue *key) {
switch (ttypetag(key)) {
case LUA_VSHRSTR: return luaH_getshortstr(t, tsvalue(key));
case LUA_VNUMINT: return luaH_getint(t, ivalue(key));
case LUA_VNIL: return &absentkey;
case LUA_VNUMFLT: {
lua_Integer k;
if (luaV_flttointeger(fltvalue(key), &k, F2Ieq)) /* integral index? */
return luaH_getint(t, k); /* use specialized version */
/* else... */
} /* FALLTHROUGH */
default:
return getgeneric(t, key, 0);
}
}
/*
** Finish a raw "set table" operation, where 'slot' is where the value
** should have been (the result of a previous "get table").
** Beware: when using this function you probably need to check a GC
** barrier and invalidate the TM cache.
*/
void luaH_finishset (lua_State *L, Table *t, const TValue *key,
const TValue *slot, TValue *value) {
if (isabstkey(slot))
luaH_newkey(L, t, key, value);
else
setobj2t(L, cast(TValue *, slot), value);
}
/*
** beware: when using this function you probably need to check a GC
** barrier and invalidate the TM cache.
*/
void luaH_set (lua_State *L, Table *t, const TValue *key, TValue *value) {
const TValue *slot = luaH_get(t, key);
luaH_finishset(L, t, key, slot, value);
}
void luaH_setint (lua_State *L, Table *t, lua_Integer key, TValue *value) {
const TValue *p = luaH_getint(t, key);
if (isabstkey(p)) {
TValue k;
setivalue(&k, key);
luaH_newkey(L, t, &k, value);
}
else
setobj2t(L, cast(TValue *, p), value);
}
/*
** Try to find a boundary in the hash part of table 't'. From the
** caller, we know that 'j' is zero or present and that 'j + 1' is
** present. We want to find a larger key that is absent from the
** table, so that we can do a binary search between the two keys to
** find a boundary. We keep doubling 'j' until we get an absent index.
** If the doubling would overflow, we try LUA_MAXINTEGER. If it is
** absent, we are ready for the binary search. ('j', being max integer,
** is larger or equal to 'i', but it cannot be equal because it is
** absent while 'i' is present; so 'j > i'.) Otherwise, 'j' is a
** boundary. ('j + 1' cannot be a present integer key because it is
** not a valid integer in Lua.)
*/
static lua_Unsigned hash_search (Table *t, lua_Unsigned j) {
lua_Unsigned i;
if (j == 0) j++; /* the caller ensures 'j + 1' is present */
do {
i = j; /* 'i' is a present index */
if (j <= l_castS2U(LUA_MAXINTEGER) / 2)
j *= 2;
else {
j = LUA_MAXINTEGER;
if (isempty(luaH_getint(t, j))) /* t[j] not present? */
break; /* 'j' now is an absent index */
else /* weird case */
return j; /* well, max integer is a boundary... */
}
} while (!isempty(luaH_getint(t, j))); /* repeat until an absent t[j] */
/* i < j && t[i] present && t[j] absent */
while (j - i > 1u) { /* do a binary search between them */
lua_Unsigned m = (i + j) / 2;
if (isempty(luaH_getint(t, m))) j = m;
else i = m;
}
return i;
}
static unsigned int binsearch (const TValue *array, unsigned int i,
unsigned int j) {
while (j - i > 1u) { /* binary search */
unsigned int m = (i + j) / 2;
if (isempty(&array[m - 1])) j = m;
else i = m;
}
return i;
}
/*
** Try to find a boundary in table 't'. (A 'boundary' is an integer index
** such that t[i] is present and t[i+1] is absent, or 0 if t[1] is absent
** and 'maxinteger' if t[maxinteger] is present.)
** (In the next explanation, we use Lua indices, that is, with base 1.
** The code itself uses base 0 when indexing the array part of the table.)
** The code starts with 'limit = t->alimit', a position in the array
** part that may be a boundary.
**
** (1) If 't[limit]' is empty, there must be a boundary before it.
** As a common case (e.g., after 't[#t]=nil'), check whether 'limit-1'
** is present. If so, it is a boundary. Otherwise, do a binary search
** between 0 and limit to find a boundary. In both cases, try to
** use this boundary as the new 'alimit', as a hint for the next call.
**
** (2) If 't[limit]' is not empty and the array has more elements
** after 'limit', try to find a boundary there. Again, try first
** the special case (which should be quite frequent) where 'limit+1'
** is empty, so that 'limit' is a boundary. Otherwise, check the
** last element of the array part. If it is empty, there must be a
** boundary between the old limit (present) and the last element
** (absent), which is found with a binary search. (This boundary always
** can be a new limit.)
**
** (3) The last case is when there are no elements in the array part
** (limit == 0) or its last element (the new limit) is present.
** In this case, must check the hash part. If there is no hash part
** or 'limit+1' is absent, 'limit' is a boundary. Otherwise, call
** 'hash_search' to find a boundary in the hash part of the table.
** (In those cases, the boundary is not inside the array part, and
** therefore cannot be used as a new limit.)
*/
lua_Unsigned luaH_getn (Table *t) {
unsigned int limit = t->alimit;
if (limit > 0 && isempty(&t->array[limit - 1])) { /* (1)? */
/* there must be a boundary before 'limit' */
if (limit >= 2 && !isempty(&t->array[limit - 2])) {
/* 'limit - 1' is a boundary; can it be a new limit? */
if (ispow2realasize(t) && !ispow2(limit - 1)) {
t->alimit = limit - 1;
setnorealasize(t); /* now 'alimit' is not the real size */
}
return limit - 1;
}
else { /* must search for a boundary in [0, limit] */
unsigned int boundary = binsearch(t->array, 0, limit);
/* can this boundary represent the real size of the array? */
if (ispow2realasize(t) && boundary > luaH_realasize(t) / 2) {
t->alimit = boundary; /* use it as the new limit */
setnorealasize(t);
}
return boundary;
}
}
/* 'limit' is zero or present in table */
if (!limitequalsasize(t)) { /* (2)? */
/* 'limit' > 0 and array has more elements after 'limit' */
if (isempty(&t->array[limit])) /* 'limit + 1' is empty? */
return limit; /* this is the boundary */
/* else, try last element in the array */
limit = luaH_realasize(t);
if (isempty(&t->array[limit - 1])) { /* empty? */
/* there must be a boundary in the array after old limit,
and it must be a valid new limit */
unsigned int boundary = binsearch(t->array, t->alimit, limit);
t->alimit = boundary;
return boundary;
}
/* else, new limit is present in the table; check the hash part */
}
/* (3) 'limit' is the last element and either is zero or present in table */
lua_assert(limit == luaH_realasize(t) &&
(limit == 0 || !isempty(&t->array[limit - 1])));
if (isdummy(t) || isempty(luaH_getint(t, cast(lua_Integer, limit + 1))))
return limit; /* 'limit + 1' is absent */
else /* 'limit + 1' is also present */
return hash_search(t, limit);
}
#if defined(LUA_DEBUG)
/* export these functions for the test library */
Node *luaH_mainposition (const Table *t, const TValue *key) {
return mainpositionTV(t, key);
}
#endif
|
__label__pos
| 0.999134 |
Check if a line at 45 degree can divide the plane into two equal weight parts in C++
Suppose we have n different points (Xi, Yi) in 2D coordinate and each point has a weight Wi, we have to check whether a line at 45 degree can be drawn. So that the sum of weights of points on each side will be same.
So, if the input is like[[-1,1,3],[-2,1,1],[1,-1,4]], then the output will be True/
To solve this, we will follow these steps −
• n := size of v
• Define one map weight_at_x
• max_x := -2000, min_x := 2000
• for initialize i := 0, when i < n, update (increase i by 1), do −
• temp_x := v[0, i] - v[1, i]
• max_x := maximum of max_x and temp_x
• min_x := minimum of min_x and temp_x
• weight_at_x[temp_x] := weight_at_x[temp_x] + v[2, i]
• Define an array sum_temp
• insert 0 at the end of sum_temp
• for initialize x := min_x, when x <= max_x, update (increase x by 1), do −
• insert (last element of sum_temp + weight_at_x[x]) at the end of sum_temp
• total_sum := last element of sum_temp
• partition_possible := false
• for initialize i := 1, when i < size of sum_temp, update (increase i by 1), do −
• if sum_temp[i] is same as total_sum - sum_temp[i], then −
• partition_possible := true
• if sum_temp[i - 1] is same as total_sum - sum_temp[i], then −
• partition_possible := true
• return partition_possible
Example
Let us see the following implementation to get better understanding −
Live Demo
#include <bits/stdc++.h>
using namespace std;
void is_valid_part(vector<vector<int>> &v){
int n = v.size();
map<int, int> weight_at_x;
int max_x = -2000, min_x = 2000;
for (int i = 0; i < n; i++) {
int temp_x = v[0][i] - v[1][i];
max_x = max(max_x, temp_x);
min_x = min(min_x, temp_x);
weight_at_x[temp_x] += v[2][i];
}
vector<int> sum_temp;
sum_temp.push_back(0);
for (int x = min_x; x <= max_x; x++) {
sum_temp.push_back(sum_temp.back() + weight_at_x[x]);
}
int total_sum = sum_temp.back();
int partition_possible = false;
for (int i = 1; i < sum_temp.size(); i++) {
if (sum_temp[i] == total_sum - sum_temp[i])
partition_possible = true;
if (sum_temp[i - 1] == total_sum - sum_temp[i])
partition_possible = true;
}
printf(partition_possible ? "TRUE" : "FALSE");
}
int main() {
vector<vector<int>> v = {{-1,1,3},{-2,1,1},{1,-1,4}};
is_valid_part(v);
}
Input
{{-1,1,3},{-2,1,1},{1,-1,4}}
Output
TRUE
Advertisements
|
__label__pos
| 0.99619 |
Big Data
Context Help Searching for wxHaskell Graphic Library
Date Added: Nov 2010
Format: PDF
This paper deals with two different approaches in programming sphere, and joins them in one entity through its practical part. One approach is context searching that is applied on the second approach, functional graphic library wxHaskell that is designed and implemented within Eclipse development environment through the plug-in extension. As searching object lies at the wxHaskell documentation, it is lexically analyzed, what forms a hashing table determined to searching for records. The task of searching is one of the most frequent operations in computer programming. Context searching refers to proactive capturing of user's information need through automatic augmenting user's query with information extracted from the search context.
|
__label__pos
| 0.968902 |
Fiji / ImageJ coordinates start point
Dear colleagues,
ImageJ’s origin of coordinates is in the upper left corner of an image. Is there any chance to set the origin in the bottom left corner?
Best regards,
Felix
Hello Felix -
The convention in image processing that y values increase
from top to bottom can seem counter-intuitive for those of us
who come from a background of working with x-y plots where
y values increase from bottom to top. However, as least as
far as I have seen, the zero-at-the-top convention is completely
standard across image processing.
Hypothetically, the convention could be switched in ImageJ.
I fear, however, that:
1. This would be unhelpfully confusing, given the established
image-processing convention, even if offered as an option.
2. The code modification would likely be error prone, as this
convention is probably tacitly baked into the code base all
over the place.
Is there any chance that as a work-around for your use case you
could first flip your image:
Image > Transform > Flip Vertically
perform your processing in your preferred coordinate system,
and then flip back?
Thanks, mm
Enable “Invert Y coordinates” in the Analyze>Set Measurements dialog box.
Thank you for your reply, mountain_man. To be honest I am not sure about flipping vertically and since there is another built-in tool (see Wayne’s message) I would go therefore. However you showed a good work-around.
Dear Wayne,
thank you very much for your reply and showing me the proper tool.
If I save the XY coordinates they appear not inversed. Is there a work-around to get these inverted, too?
Best regards,
Felix
|
__label__pos
| 0.992871 |
<![CDATA[Problem with the positioning of the mirror modules. Cut from the top]]>Hi. please help.
I lost my SD card and moved the installation to the SSD. Everything is ok except one thing.
In the lower part of the mirror I have the MMM-iFrame module, I throw off the dasboard from Home assistant.
Unfortunately, when starting / restarting the mirror, as you can see in the screenshot, the whole thing moves up and the upper modules are cut off.
Interestingly, it sometimes loads correctly.
When I remove the iframe module it loads as it should.
Any suggestions on how I can fix this?
e098450f-6aaf-4c52-9e96-94715e102697-image.png
]]>
https://forum.magicmirror.builders/topic/14704/problem-with-the-positioning-of-the-mirror-modules-cut-from-the-topRSS for NodeSat, 13 Jul 2024 09:31:49 GMTThu, 25 Feb 2021 21:01:54 GMT60<![CDATA[Reply to Problem with the positioning of the mirror modules. Cut from the top on Fri, 26 Feb 2021 19:59:47 GMT]]>@majdzik84 Let’s invoke the CSS gods around here… Hey, @cowboysdude ? You got advice?
@alberttwong if you’re still around, can you help?
]]>
https://forum.magicmirror.builders/post/88903https://forum.magicmirror.builders/post/88903Fri, 26 Feb 2021 19:59:47 GMT
<![CDATA[Reply to Problem with the positioning of the mirror modules. Cut from the top on Fri, 26 Feb 2021 08:52:53 GMT]]>@BKeyport Thank you for your willingness to help.
Unfortunately, I tried all the advice but nothing has changed :(
It loads ok once in a few tries, but in most cases the whole screen is moved up.
https://www.dropbox.com/s/ftc0abrnntcz9i0/VID_20210226_095022.mp4?dl=0
modules: [
{
module: 'MMM-iFrame',
position: 'bottom_center', // This can be any of the regions.
disabled: false,
config: {
// See 'Configuration options' for more information.
url: ["http://192.168.2.98:8123/magic-mirror/kamera?kiosk"], // as many URLs you want or you can just ["ENTER IN URL"] if single URL.
autoRefresh: false,
// updateInterval: 0.5 * 60 * 1000, // rotate URLs every 30 seconds
width: "1440", // width of iframe
height: "425", // height of iframe
frameWidth: "1440", // width of embedded iframe, height is beeing calculated by aspect ratio of iframe
}
},
{
module: "alert",
config: {
effect: "genie",}
},
{
module: "updatenotification",
position: "top_bar"
},
{
module: "clock",
position: "top_left"
},
{
module: "calendar",
header: "KALENDARZ",
position: "top_left",
config: {
maximumEntries: 7,
maximumNumberOfDays: 365,
showLocation: false,
maxTitleLength: 25,
maxLocationTitleLength: 25,
wrapEvents: true,
wrapLocationEvents: false,
maxTitleLines: 3,
maxEventTitleLines: 3,
animationSpeed: 2000,
fade: false,
fadePoint: 0.25,
displayRepeatingCountTitle: true,
dateFormat: "MMM Do HH:mm",
dateEndFormat: "MMM Do HH:mm",
//showEnd: true,
fullyDayEventDateFormat: "MMM D",
timeFormat: "absolute",
getRelative: 6,
urgency: 1,
broadcastEvents: true,
hidePrivate: false,
sliceMultiDayEvents: false,
nextDaysRelative: true,
colored: true,
calendars: [{
symbol: "calendar-check-o",
url: "https:/basic.ics"
},
{
symbol: "birthday-cake",
color: '#27b7e3',
url: "https://calendar.google.com/"
},
{
symbol: "trash-alt",
color: '#ebd234',
url: "https://calendar.google.com/.ics"
},
{
symbol: "calendar-times",
color: "#ff3b29",
url: "https://www.thunderbird.net/media/caldata/PolishHolidays.ics"
}]
}
},
{
module: "MMM-Currentweather-MQTT",
disabled: false,
position: "top_right",
config: {
location: "Potępa",
locationID: "3094597", //ID from http://bulk.openweathermap.org/sample/city.list.json.gz; unzip the gz file and find your city
appid: "xxxx",
roundTemp: false,
degreeLabel: true,
showWindDirection: true,
showWindDirectionAsArrow: true,
showHumidity: true,
showFeelsLike: true,
useBeaufort: false,
useKMPHwind: true,
logging: true,
useWildcards: false,
showTempMax: true,
showTempMin: true,
mqttServers: [
{
address: '192.168.2.98', // Server address or IP address
port: '1883', // Port number if other than default
user: 'xxx',
password: 'xxx!',
subscriptions: [ // for now, all seven values must be
// specified in the config,
// even if they are not delivered and not displayed.
{
topic: 'mirror/pogoda/temperatura', // Topic to look for
suffix: '°C', // Displayed after the value
decimals: 1, // Round numbers to this number of decimals
sortOrder: 10, // sortOrder 10 has to contain the temperature
maxAgeSeconds: 18000, // take Openweather value if older than 5 hours
},
{
topic: 'mirror/pogoda/wilgotnosc',
suffix: '%',
decimals: 0,
sortOrder: 20, // sortOrder 210 has to contain the humidity
maxAgeSeconds: 18000,
},
{
topic: 'mirror/pogoda/temp_piec',
suffix: '°C',
decimals: 1,
sortOrder: 30, // sortOrder 30 has to contain the illumination
maxAgeSeconds: 18000,
},
{
topic: 'mirror/pogoda/wiatr',
suffix: '°C',
decimals: 1,
sortOrder: 40, // sortOrder 40 has to contain the wind speed
maxAgeSeconds: 18000,
},
{
topic: 'wetter/act-wind-dir',
suffix: '°',
decimals: 0,
sortOrder: 50, // sortOrder 50 has to contain the wind direction
maxAgeSeconds: 18000,
},
{
topic: 'wetter/raining',
suffix: '',
decimals: 0,
sortOrder: 60, // sortOrder 60 has to contain the boolean if its just raining
maxAgeSeconds: 18000,
conversions: [
{ from: "true", to: "tak" },
{ from: "false", to: "nie" }
]
},
{
topic: 'wetter/rain-today',
suffix: '',
decimals: 1,
sortOrder: 70, // sortOrder 70 has to contain the amount of rain today
maxAgeSeconds: 18000,
},
{
topic: 'mirror/pogoda/max',
label: 'c',
suffix: '',
decimals: 0,
sortOrder: 80,
maxAgeSeconds: 180000,
},
{
topic: 'mirror/pogoda/min',
label: 'c',
suffix: '',
decimals: 0,
sortOrder: 90,
maxAgeSeconds: 180000,
},
]
}
],
}
},
{
module: "weatherforecast",
disabled: false,
position: "top_right",
header: "Prognoza pogody",
config: {
lang: "pl",
locationID: "xxx", //ID from http://bulk.openweathermap.org/sample/city.list.json.gz; unzip the gz file and find your city
appid: "xxxx",
maxNumberOfDays: 4,
//colored: "false",
fade: false,
//fadePoint: 1,
showRainAmount: true,
scale: false,
}
},
{
module: 'MMM-MQTT',
position: 'top_right',
header: '',
config: {
logging: false,
useWildcards: false,
mqttServers: [
{
address: '192.168.2.98', // Server address or IP address
port: '1883', // Port number if other than default
user: 'xxxx', // Leave out for no user
password: 'xxxx!', // Leave out for no password
subscriptions: [
{
topic: 'mirror/pogoda/powietrze', // Topic to look for
label: 'Powietrze jest', // Displayed in front of value
suffix: '', // Displayed after the value
maxAgeSeconds: 350, // Reduce intensity if value is older
},
{
topic: 'mirror/pogoda/temp_piec', // Topic to look for
label: 'Temp.ogród: ', // Displayed in front of value
suffix: '°C', // Displayed after the value
maxAgeSeconds: 350, // Reduce intensity if value is older
},
{
topic: 'mirror/pogoda/co2', // Topic to look for
label: 'CO2 w salonie: ', // Displayed in front of value
suffix: 'ppm', // Displayed after the value
maxAgeSeconds: 350, // Reduce intensity if value is older
colors: [ // Value dependent colors
{ upTo: 500, value: "green", label: "green", suffix: "green" },
{ upTo: 600, label: "yellow", value: "yellow", suffix: "yellow" },
{ upTo: 900, label: "#ff4d00", value: "#ff4d00", suffix: "#ff4d00" },
{ upTo: 2000, label: "red", value: "red", suffix: "red" }, // The last one is used for higher values too
],
},
]
}
],
}
},
{
module: "MMM-NowPlayingOnSpotify",
position: "center",
disabled: false,
config: {
showCoverArt: true,
clientID: "xxx",
clientSecret: "xxx",
accessToken: "xxxxx",
refreshToken: "xxxx-xxxx"
}
},
{
module: 'MMM-Remote-Control'
// uncomment the following line to show the URL of the remote control on the mirror
//, position: 'bottom_left'
// you can hide this module afterwards from the remote control itself
},
]
};
/*************** DO NOT EDIT THE LINE BELOW ***************/
if (typeof module !== "undefined") {module.exports = config;}
]]>
https://forum.magicmirror.builders/post/88894https://forum.magicmirror.builders/post/88894Fri, 26 Feb 2021 08:52:53 GMT
<![CDATA[Reply to Problem with the positioning of the mirror modules. Cut from the top on Thu, 25 Feb 2021 21:07:46 GMT]]>Couple of things you can do.
1- Check where your modules are positioned, they should bounce out of the way if they are in a different position than the iFrame module. (iframe should be bottom_something, and other modules be top_something)
2- Add css to custom.css to use the entire monitor space to give you a bit more room:
body {
margin: 0px;
height: 100vh;
width: 100vw;
}
3- it does appear your iframe module is a bit too tall - if you’re using MMM-iFrame - change your “height” to be a few less pixels to lower it’s chances. (30 or so should do it)
]]>
https://forum.magicmirror.builders/post/88882https://forum.magicmirror.builders/post/88882Thu, 25 Feb 2021 21:07:46 GMT
|
__label__pos
| 0.958637 |
Optimistic Processing
Changelog
• 2022-08-16: Initial draft
Abstract
This document discusses an optimization of block proposal processing based on
the upcoming Tendermint ABCI++ interface. Specifically, it involves an optimistic
processing mechanism.
Background
Before ABCI++, the first and only time a Tendermint blockchain’s application layer
would know about a block proposal is after the voting period, at which point Tendermint
would invoke BeginBlock, DeliverTx, EndBlock, and Commit ABCI methods of
the application, with the block proposal contents passed in.
With the advent of ABCI++, the application layer now has a chance to know about the
block proposal before the voting period commences. This, in theory, presents an
opportunity for the application to optimistically process the block proposal in
parallel with the voting process, thus reducing the overall block time.
Discussion
ABCI++ introduced a set of new ABCI methods. Among those is ProcessProposal, which is
called after a node receives the full block proposal of the current height but before
prevote starts. Tendermint document does state that preemptively processing the proposal
is a potential use case of ProcessProposal:
The Application may fully execute the block as though it was handling RequestFinalizeBlock
However, synchronously processing the proposal preemptively would not improve block time
because it would just be changing the ordering of when things happen. Instead, we would
need to make the processing asynchronous: ProcessProposal spins off a goroutine whose
termination signal is kept in the application context and responds to Tendermint immediately.
That way, the actual block processing would happen at the same time as voting. When voting
finishes and FinalizeBlock is called, the application handler can simply wait for the
previously started goroutine to finish, and flush the resulting cache store if the block
hash matches. Assuming average voting period takes P ms and average block processing takes
Q ms, this would theoretically reduce average block time by P + Q - max(P, Q) ms. During
a recent load test on Sei, P was ~600ms and Q was ~300ms, so optimistic processing would
cut the block time by ~300ms in that case.
The following diagram illustrates the intended flow:
In the case where the proposal is rejected during voting, the optimistic processing outcome
obviously needs to be thrown away, which is trivial with states managed by Cosmos thanks to
cache stores, but demands special treatment for Sei’s in-memory state in its dex module. A
deep copy utility already exists for dex in-memory state to make such branching easier. To
prevent a bad actor from exploiting the optimistic processing to overwhelm nodes in the net,
we will only perform optimistic processing for the first round of a height.
Finally, since ABCI++ isn’t in any stable release of Tendermint yet and consequently Cosmos
hasn’t integrated with ABCI++, Sei would need to directly integrate with ABCI++ based off
development branches of Tendermint if we want this feature out soon.
Implementation
This proposal can be implemented fully on the application side. The execution context needs to
add the following information:
• whether there is any optimistic processing (OP) goroutine running
• block info (height, round, hash, etc.) of the running OP goroutine, if any
• termination signal
• completion signal
• pointers to branched states
The OP goroutine would operate on top of a cache branch of the Cosmos store, and a branch
equivalent for any state that is not managed by the Cosmos store.
The OP goroutine would periodically (e.g. after every 10 txs) check if a termination signal is sent
to it, and stops if so. If not, the OP goroutine would set the completion signal when it finishes
processing.
To prevent bad validators from overwhelming other nodes, we will only allow optimistic processing
for the first round proposal of a given height.
Upon receiving a ProcessProposal call, the application would adopt the following procedure:
if round == 0
set OP fields mentioned above in context
create branches for all mutable states
kick off an OP goroutine that optimistically process the proposal with the state branches
else if block height != OP height in context OR block hash != OP hash in context
send termination signal to the running OP goroutine
clear up OP fields from the context
else
do nothing
respond to Tendermint
Upon receiving a FinalizeBlock call, the application would wait for any OP goroutine if the OP
fields in the context match the information passed in by Tendermint, and merge any resulting branched
states to the main store. If not, FinalizeBlock would just process the block by itself.
References
1 Like
|
__label__pos
| 0.560685 |
Pages: [1] Go Down
Author Topic: Random max & min/max function C code (Read 1965 times)
0 Members and 1 Guest are viewing this topic.
0
Offline Offline
Jr. Member
**
Karma: 0
Posts: 72
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
Hello,
Would someone be able to point me to where I could find the C code used for the random max and random min/max functions. I would like to port them to an ATtiny project I am working on among other things.
I've found various versions online however I've never had any issues using this function so If I could continue to use it that would be great. smiley
Thanks
Logged
Norway@Oslo
Offline Offline
Edison Member
*
Karma: 13
Posts: 2033
loveArduino(true);
View Profile
WWW
Bigger Bigger Smaller Smaller Reset Reset
Code:
extern "C" {
#include "stdlib.h"
}
void randomSeed(unsigned int seed)
{
if (seed != 0) {
srandom(seed);
}
}
long random(long howbig)
{
if (howbig == 0) {
return 0;
}
return random() % howbig;
}
long random(long howsmall, long howbig)
{
if (howsmall >= howbig) {
return howsmall;
}
long diff = howbig - howsmall;
return random(diff) + howsmall;
}
smiley
Logged
0
Offline Offline
Jr. Member
**
Karma: 0
Posts: 94
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
In avr-libc there is already a rand() function which you can use with the attiny devices:
http://www.nongnu.org/avr-libc/user-manual/group__avr__stdlib.html#ge23144bcbb8e3742b00eb687c36654d1
Logged
0
Offline Offline
Jr. Member
**
Karma: 0
Posts: 72
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
@ programmer
I am aware of that however their is no, at least no std, max or min/max functionally. But thanks for the heads up.
@AlphaBeta
Thanks
Logged
Gothenburg, Sweden
Offline Offline
Jr. Member
**
Karma: 0
Posts: 87
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
So what do you mean by random max, random min/max function??
Do you want to compute a min, max or std value of something?
Or do you want to generate a random value in an specified interval, from min to max?
Logged
0
Offline Offline
Jr. Member
**
Karma: 0
Posts: 72
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
To generate a random number within a specified range.
I saw this example online however I wanted to see the Arduino code version. If it differs I would prefer to use it as opposed to what I found.
Code:
//generates a psuedo-random integer between 0 and max
int randint(int max)
{
return int(max*rand()/(RAND_MAX+1.0));
}
//generates a psuedo-random integer between min and max
int randint(int min, int max)
{
if (min>max)
{
return max+int((min-max+1)*rand()/(RAND_MAX+1.0));
}
else
{
return min+int((max-min+1)*rand()/(RAND_MAX+1.0));
}
}
Logged
Gothenburg, Sweden
Offline Offline
Jr. Member
**
Karma: 0
Posts: 87
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
In this example min and max are not functions, they are parameters, so there is no need for any standard min or max functionality. You only need the rand() function.
Logged
0
Offline Offline
Jr. Member
**
Karma: 0
Posts: 72
Arduino rocks
View Profile
Bigger Bigger Smaller Smaller Reset Reset
Correct. I would like to make a function for future use. So what I am really interested in is the code used in the the Arduino function or comparable code to write a similar function.
I could always rewrite that example or the code inside the Arduino function each time but I'm much to lazy for that. smiley-wink
Logged
Norway@Oslo
Offline Offline
Edison Member
*
Karma: 13
Posts: 2033
loveArduino(true);
View Profile
WWW
Bigger Bigger Smaller Smaller Reset Reset
So it's clear. The code I posted is from Arduino.
WMath.cpp
Logged
Pages: [1] Go Up
Jump to:
|
__label__pos
| 0.843603 |
CF521D Shop 题解
作者: xht37 分类: 题解 发布时间: 2020-01-16 01:00
点击数：240
CF521D Shop
题意
• 有 $k$ 个正整数 $a_{1\dots k}$。
• 有 $n$ 个操作，每个操作给定正整数 $b$，有三种可能：将 $a_i$ 赋值为 $b$，将 $a_i$ 加上 $b$，将 $a_i$ 乘以 $b$。
• 你可以从 $n$ 个操作中选择最多 $m$ 个操作，并按照一定顺序执行。
• 你的目标是最大化 $\prod_{i=1}^k a_i$ 的值。
• $k,n \le 10^5$。
题解
首先赋值可以转化成加法，只是要注意赋值必须在加法之前。
其次加法可以转化成乘法，不过必须按照从大到小贪心的转化，且加法也要在乘法之前。
对于加法转乘法，有一个麻烦一点的等价方法是，同样对每个数从大到小贪心的选择，只不过动态维护。
一开始假设所有乘法操作都要选，如果乘法操作的个数多于 $m$ 个，则去掉多出来贡献最小的。
对 $k$ 个数上的加法操作进行排序，我们要从大到小贪心的选择，可以用 $k$ 个指针维护。
用一个堆，每次取出贡献最大的加法操作，然后与贡献最小的乘法操作相比较。若加法操作的贡献更大，则去掉这个贡献最小的乘法操作，同时加入贡献最大的加法操作；否则说明此时达到最优解。
若 $n,m,k$ 同阶，则总时间复杂度为 $\mathcal O(n \log n)$。
代码
const int N = 1e5 + 7;
int n, m, k, s;
ui t[N];
ll a[N], b;
pair <ll, int> v1[N];
vector <pair <ll, int> > v2[N], v3;
pq <pair <ld, int> > q;
vi ans;
inline void print() {
for (int i = 1; i <= k; i++) {
for (ui j = 0; j < t[i]; j++)
if (v2[i][j].se < 0) ans.pb(-v2[i][j].se);
for (ui j = 0; j < t[i]; j++)
if (v2[i][j].se > 0) ans.pb(v2[i][j].se);
}
while (v3.size()) ans.pb(v3.back().se), v3.pop_back();
print(ans.size());
for (auto x : ans) print(x, ' ');
}
inline void get(int x) {
if (t[x] < v2[x].size())
q.push(mp(1.0L * v2[x][t[x]++].fi / a[x], x));
}
int main() {
rd(k), rd(n), rd(m);
for (int i = 1; i <= k; i++) rd(a[i]);
for (int i = 1, o, x; i <= n; i++) {
rd(o), rd(x), rd(b);
if (o == 1) v1[x] = max(v1[x], mp(b, i));
if (o == 2) v2[x].pb(mp(b, i));
if (o == 3) v3.pb(mp(b, i));
}
for (int i = 1; i <= k; i++) {
if (v1[i].fi > a[i])
v2[i].pb(mp(v1[i].fi - a[i], -v1[i].se));
sort(v2[i].begin(), v2[i].end());
reverse(v2[i].begin(), v2[i].end());
s += v2[i].size();
}
sort(v3.begin(), v3.end());
reverse(v3.begin(), v3.end());
while ((int)v3.size() > m) v3.pop_back();
if (s + (int)v3.size() <= m) {
for (int i = 1; i <= k; i++) t[i] = v2[i].size();
return print(), 0;
}
for (int i = 1; i <= k; i++) get(i);
for (int i = v3.size(); i < m; i++) {
int x = q.top().se;
q.pop(), a[x] += v2[x][t[x]-1].fi, get(x);
}
while (v3.size()) {
int x = q.top().se;
ll b1 = v2[x][t[x]-1].fi, b2 = v3.back().fi;
if (b1 <= a[x] * (b2 - 1)) break;
q.pop(), v3.pop_back(), a[x] += b1, get(x);
}
while (q.size()) {
int x = q.top().se;
q.pop(), --t[x];
}
return print(), 0;
}
发表评论
电子邮件地址不会被公开。 必填项已用*标注
|
__label__pos
| 0.940698 |
if assigned(S3) then Log('TChunkManager.UpdateVertices Create VAO ms: ' +
S3.ElapsedMilliseconds.ToString);
The problem is the assigned part, I tried with Log('aaa') and also Log works fine elsewhere. Why is S3 (TStopwatch) is uncompatible with assigned?
**[dcc64 Error] thChunkManager.pas(529): E2008 Incompatible types**
How can I check if S3 is created or not?
up vote 2 down vote accepted
TStopWatch is a record type, not a class type. An instance of a record can be created in stack memory of the calling thread. An instance of a class type must be allocated dynamically in heap memory instead. Only pointers can be passed to Assigned(). A record instance on the stack doesn't count.
For what you are attempting, you probably want to use the TStopWatch.IsRunning property instead:
if S3.IsRunning then
Log('TChunkManager.UpdateVertices Create VAO ms: ' + S3.ElapsedMilliseconds.ToString);
• Why doesn't the naming convention give any hint about this? Record types could be named with different prefix, like RStopWatch for example. Would save some trouble with faulty freeing and such if it was automatically obvious without having to know or to check each type. – Doege Dec 8 '17 at 11:16
Your Answer
By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.919883 |
goranseric
11/18/2016 - 10:59 AM
WordPress local dev environment plugin and config to use images from a live server instead of looking on local url path
WordPress local dev environment plugin and config to use images from a live server instead of looking on local url path
<?php
//* put this in wp-config.php
define('WP_SITEURL', 'http://' . $_SERVER['HTTP_HOST'] .
str_replace(DIRECTORY_SEPARATOR, '/', str_replace(realpath($_SERVER['DOCUMENT_ROOT']), '', dirname(__FILE__))));
define('REMOTE_SITEURL', 'http://UrlToPullImagesFrom.com');
<?php
/*
* Plugin Name: Local Dev Remote Images
* Description: this will allow a local dev environment to call all images in uploads from a remote server
* Version: 0.1
* License: GPL
* Author: @chuckreynolds
* Author URI: https://chuckreynolds.us
*/
add_action( 'init', 'ryno_localdev_remoteimages' );
function ryno_localdev_remoteimages() {
if ( defined('WP_SITEURL') && defined('REMOTE_SITEURL') ) {
if ( WP_SITEURL != REMOTE_SITEURL ){
add_filter('wp_get_attachment_url', 'ryno_localdev_remoteimages_get_attachment_url', 10, 2 );
}
}
}
function ryno_localdev_remoteimages_get_attachment_url( $url, $post_id) {
if ( $file = get_post_meta( $post_id, '_wp_attached_file', true) ) {
if ( ($uploads = wp_upload_dir()) && false === $uploads['error'] ) {
if ( file_exists( $uploads['basedir'] .'/'. $file ) ) {
return $url;
}
}
}
return str_replace( WP_SITEURL, REMOTE_SITEURL, $url );
}
|
__label__pos
| 0.989535 |
Quick Answer: Does Linked List Allow Duplicates?
Does LinkedHashSet allow duplicates?
LinkedHashSet is similar to HashSet which allows only one null value in it, As duplicates are not allowed..
How do you remove duplicates from a linked list in Java?
AlgorithmCreate a class Node which has two attributes: data and next. … Create another class RemoveDuplicate which has two attributes: head and tail.addNode() will add a new node to the list: … removeDuplicate() will remove duplicate nodes from the list. … display() will display the nodes present in the list:
What is the time complexity of removing a value from a sorted linked list of size n?
Removal for a singly-linked list is only O(1) if you already have references to the node you want to remove and the one before. All this is in contrast to an array-based list where insertions and removal are O(n) because you have to shift elements along.
How do you find duplicates in an array?
AlgorithmDeclare and initialize an array.Duplicate elements can be found using two loops. The outer loop will iterate through the array from 0 to length of the array. The outer loop will select an element. … If a match is found which means the duplicate element is found then, display the element.
How do you change two nodes in a linked list?
Given a linked list, swap every two adjacent nodes and return its head. Example: Given 1->2->3->4 , you should return the list as 2->1->4->3 .
Is linked list palindrome?
METHOD 1 (Use a Stack) Traverse the given list from head to tail and push every visited node to stack. Traverse the list again. For every visited node, pop a node from stack and compare data of popped node with currently visited node. If all nodes matched, then return true, else false.
Does HashSet remove duplicates?
Set implementations in Java has only unique elements. Therefore, it can be used to remove duplicate elements.
Can LinkedHashMap have duplicate values?
A LinkedHashMap cannot contain duplicate keys. LinkedHashMap can have null values and the null key. Unlike HashMap, the iteration order of the elements in a LinkedHashMap is predictable.
Why TreeSet does not allow null?
This internally compares the elements with each other using the compareTo (or compare) method. If you try to compare any object with a null value using one of these methods, a NullPointerException will be thrown. Therefore, if you try to add null values to a TreeSet it generates a NullPointerException at the run time.
How do you find duplicates in a linked list?
Count the frequency of all the elements of the linked list using a map. Now, traverse the linked list again to find the first element from the left whose frequency is greater than 1. If no such element exists then print -1.
How do you remove duplicates from a linked list?
Remove duplicates from a sorted linked listAlgorithm: Traverse the list from the head (or start) node. While traversing, compare each node with its next node. If data of next node is same as current node then delete the next node. … Implementation: Functions other than removeDuplicates() are just to create a linked linked list and test removeDuplicates().
Which list does not allow duplicates?
2) List allows duplicates while Set doesn’t allow duplicate elements. All the elements of a Set should be unique if you try to insert the duplicate element in Set it would replace the existing value. 3) List implementations: ArrayList, LinkedList etc. Set implementations: HashSet, LinkedHashSet, TreeSet etc.
How do you remove duplicates from a linked list in Python?
Python Program to Remove Duplicates from a Linked ListCreate a class Node with instance variables data and next.Create a class LinkedList with instance variables head and last_node.The variable head points to the first element in the linked list while last_node points to the last.Define methods append, get_prev_node, remove and display.More items…
Can an ArrayList contain duplicates?
4) Duplicates: ArrayList allows duplicate elements but HashMap doesn’t allow duplicate keys (It does allow duplicate values). 5) Nulls: ArrayList can have any number of null elements. … In HashMap the elements is being fetched by specifying the corresponding key.
Does TreeSet allow duplicates?
Features of a TreeSet So, duplicate values are not allowed. Objects in a TreeSet are stored in a sorted and ascending order. TreeSet does not preserve the insertion order of elements but elements are sorted by keys.
How do I eliminate duplicates?
Remove duplicate valuesSelect the range of cells that has duplicate values you want to remove. Tip: Remove any outlines or subtotals from your data before trying to remove duplicates.Click Data > Remove Duplicates, and then Under Columns, check or uncheck the columns where you want to remove the duplicates. … Click OK.
Can you sort a linked list?
Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible. Let head be the first node of the linked list to be sorted and headRef be the pointer to head.
How do I merge two linked lists?
The new list should be made by splicing together the nodes of the first two lists. For example if the first linked list a is 5->10->15 and the other linked list b is 2->3->20, then SortedMerge() should return a pointer to the head node of the merged list 2->3->5->10->15->20.
How do you remove duplicates from an array?
1) Remove Duplicate Element in Array using Temporary Arraypublic class RemoveDuplicateInArrayExample{public static int removeDuplicateElements(int arr[], int n){if (n==0 || n==1){return n;}int[] temp = new int[n];int j = 0;for (int i=0; i
How do you avoid duplicates in ArrayList?
The easiest way to remove repeated elements is to add the contents to a Set (which will not allow duplicates) and then add the Set back to the ArrayList : Set set = new HashSet<>(yourList); yourList. clear(); yourList.
How do you remove duplicates from an array in C++?
Algorithm to remove duplicate elements in an array (sorted array)Input the number of elements of the array.Input the array elements.Repeat from i = 1 to n.- if (arr[i] != arr[i+1])- temp[j++] = arr[i]- temp[j++] = arr[n-1]Repeat from i = 1 to j.- arr[i] = temp[i]More items…•
|
__label__pos
| 0.999985 |
jsdebuggeride.dll
Application using this process: Internet Explorer
Recommended: Check your system for invalid registry entries.
jsdebuggeride.dll
Application using this process: Internet Explorer
Recommended: Check your system for invalid registry entries.
jsdebuggeride.dll
Application using this process: Internet Explorer
Recommended: Check your system for invalid registry entries.
What is jsdebuggeride.dll doing on my computer?
jsdebuggeride.dll is a JScript Debugger IDE.
Non-system processes like jsdebuggeride.dll originate from software you installed on your system. Since most applications store data in your system's registry, it is likely that over time your registry suffers fragmentation and accumulates invalid entries which can affect your PC's performance. It is recommended that you check your registry to identify slowdown issues.
jsdebuggeride.dll
In order to ensure your files and data are not lost, be sure to back up your files online. Using a cloud backup service will allow you to safely secure all your digital files. This will also enable you to access any of your files, at any time, on any device.
Is jsdebuggeride.dll harmful?
This process is considered safe. It is unlikely to pose any harm to your system.
jsdebuggeride.dll is a safe process
Can I stop or remove jsdebuggeride.dll?
Most non-system processes that are running can be stopped because they are not involved in running your operating system. Scan your system now to identify unused processes that are using up valuable resources. jsdebuggeride.dll is used by 'Internet Explorer'.This is an application created by 'Microsoft Corporation'. To stop jsdebuggeride.dll permanently uninstall 'Internet Explorer' from your system. Uninstalling applications can leave invalid registry entries, accumulating over time.
Is jsdebuggeride.dll CPU intensive?
This process is not considered CPU intensive. However, running too many processes on your system may affect your PC’s performance. To reduce system overload, you can use the Microsoft System Configuration Utility to manually find and disable processes that launch upon start-up.
Why is jsdebuggeride.dll giving me errors?
Process related issues are usually related to problems encountered by the application that runs it. A safe way to stop these errors is to uninstall the application and run a system scan to automatically identify any PC issues.
Process Library is the unique and indispensable process listing database since 2004 Now counting 140,000 processes and 55,000 DLLs. Join and subscribe now!
Toolbox
ProcessQuicklink
|
__label__pos
| 0.976034 |
Service
Sales
Ask Us
WET Labs
Satlantic
Software
Sea-Bird provides a full suite of Windows software applications for configuring and operating Sea-Bird equipment. Seasoft© was designed to work with a PC running Windows 7/8/10 (both 32-bit and 64-bit systems). Help files are provided with the software; Seasave V7 and SBE Data Processing also have manuals.
Software Features
Sea-Bird has three software packages:
• Seasoft V2 - for most instruments
• Seasoft for Waves - for SBE 26/26plus and SBE 53
• Universal Coastal Interface (UCI) - for HydroCAT, HydroCAT-EP, and SUNA
The Seasoft and Seasoft for Waves .exe files are bundled together in a .zip file on the Download tab. Download the .zip, extract the .exe files (SeasoftV2.exe and SeasoftWaves_V2_0.exe), and install each package. Alternatively, if you just want to install individual programs that are part of Seasoft V2 (Deployment Endurance Calculator, SeatermV2, etc.), click one of the links below to go to the page for that program.
Note: UCI is not in the .zip file. Go to the UCI page and download the software from there.
Seasoft V2
Seasoft V2, for most of our instruments, includes the following stand-alone programs, each of which include Help files with detailed descriptions for use:
Function Program Summary Current Version
Deployment planning Deployment Endurance Calculator Determine deployment length for moored instruments, based on user-input deployment scheme, instrument power requirements, and battery capacity. 1.7.0
Instrument setup and data upload
(terminal program)
Seaterm V2 Setup and data upload for newer instruments.
Note: Improved USB drivers for use with SBE 39plus and SBE 56 were incorporated on July 29, 2015. We recommend you download SeatermV2 (or entire Seasoft V2 package) if you are using one of both of those instruments.
2.6.1
Seaterm Setup and data upload for older instruments. 1.59
SeatermAF
Setup and data upload for water sampler systems that include Auto Fire capability for autonomous operation:
• SBE 32 Carousel Water Sampler with SBE 17plus V2 or AFM
• SBE 55 ECO Water Sampler
2.1.4
Real-time data acquisition Seasave V7 Acquire, convert, and display real-time or archived raw data.
Note: Software use is described in Help files as well as a software manual.
7.26.6
Data processing and plotting SBE Data Processing Convert, edit, process, and plot data.
Note: Software use is described in Help files as well as a software manual.
7.26.6
Data plotting Plot39 Plot data uploaded from SBE 39, 39plus, 39-IM, or 39plus-IM. 1.0c
Seasoft for Waves
Seasoft for Waves is used with the SBE 26 and 26plus Wave & Tide Recorders, and the SBE 53 Bottom Pressure Recorder.
Program Summary Current Version
Seasoft for Waves Pre-deployment planning, setup, data upload, data processing, auto-spectrum and time series analysis, statistics reporting, and plotting.
Note: Software use is described in Help files as well as SBE 26, 26plus, and 53 manuals.
2.0
Universal Coastal Interface (UCI)
UCI is used with the HydroCAT, HydroCAT-EP, and SUNA.
Program Summary Current
Version
UCI Setup via easy-to-use deployment wizards, reference checks, data upload, and plotting.
Note: Software use is described in Help files.
1.1.0
Software License Agreement
By downloading any of our software, you expressly agree to the following:
Sea-Bird's Seasoft© software is provided free of charge to Sea-Bird users and is not subject to any license. Seasoft is protected by copyright laws and international copyright treaties, as well as other intellectual property laws and treaties. All title and copyrights in and to Seasoft and the accompanying printed materials, and any copies of Seasoft, are owned by Sea-Bird Electronics. There are no restrictions on its use or distribution, provided such use does not infringe on our copyright.
Software Warranty
Sea-Bird Electronics expressly disclaims any warranty for software. Software and any related documentation is provided "as is" without warranty of any kind, either expressed or implied, including and without limitation, the implied warranties or merchantability, fitness for a particular purpose, or non infringement. The entire risk arising out of use or performance of Seasoft remains with you.
In no event shall Sea-Bird Electronics or its representatives or suppliers be liable for any damages whatsoever (including, without limitation, damages for loss of business profits, business interruption, loss of business information, or any other pecuniary loss) arising out of the use of or inability to use this Sea-Bird Electronics product, even if Sea-Bird has been advised of the possibility of such damages.
Software 2.2.6
December 7, 2016
SeasoftAndSeasoftWaves.zip for Windows 7/8/10
See the release notes for each of the individual programs in Seasoft V2 (Deployment Endurance Calculator, SeatermV2, Seaterm, SeatermAF, Seasave, SBE Data Processing, Plot39) and Seasoft for Waves.
Version 2.2.2
1. BUG FIXES
a. Seasoft installer did not properly install Java, which could cause SeatermUSB (terminal program for communication with instruments via USB) to fail to run.
For older software manuals, click here.
Title Type Publication Date PDF FIle
Sea-Bird Seasoft Software Brochure Software Quick Guide Wednesday, November 30, 2016 SoftwareBrochure4PageNov16.pdf
Seasave V7 Manual Software Manual Wednesday, November 16, 2016 Seasave_7.26.4.pdf
SBE Data Processing Manual Software Manual Wednesday, November 16, 2016 SBEDataProcessing_7.26.4.pdf
Seasave V7 Quick Guide Software Quick Guide Tuesday, August 3, 2010 Seasave_ReferenceSheet_001.pdf
Sea-Bird Scientific Software Guide Software Quick Guide Thursday, May 12, 2016 software 05-2016 SBS.pdf
What is a .psa file and how is it used?
A .psa (program setup) file is used by Seasave V7 and by each module in SBE Data Processing to remember the way you had the program set up. You can save the .psa file to a desired filename and location, and then use it when you run the software the next time, to ensure that the software will be set up the same way:
• A .psa file is created by Seasave V7 to store program settings, such as the instrument configuration (.con or .xmlcon) file name and path, serial ports, water sampler, TCP/IP ports, serial data output, etc. as well as size, placement, and setup for each display window.
• A .psa file is created by each module in SBE Data Processing to store program settings, such as the input filename and path, output filename, and module-specific parameters (for example, for Data Conversion: variables to convert, ascii or binary output, etc.).
If you want to set up real-time acquisition or data processing on more than one computer in the same way, simply copy the .psa file for the desired setup, and transfer it to the other computer via your network, email, a CD-ROM, or some other media. Then, after you open the software on the second computer, select the .psa file you want to use.
• Seasave V7: Select File / Open Setup File.
• SBE Data Processing: In the module dialog box, on the File Setup tab, click the Open button under Program setup file.
Does Seasoft have a provision for converting to MatLab data files?
MatLab can import flat ASCII files. To produce those files:
1. Run SBE Data Processing’s Data Conversion module to produce a .cnv file with data in ASCII engineering units from the raw data file. This file also contains header information.
2. Run SBE Data Processing’s ASCII Out module to remove the header information, outputting just the data portion of the converted data file to a .asc file. Optionally, you can also output the header information to a .hdr file.
What operating systems are compatible with Seasoft?
Current Sea-Bird software was designed to work on a PC running Windows 7/8/10 (both 32-bit and 64-bit). Sea-Bird provides the software free of charge as part of our instrument support. Because of this, we do not have the resources to write and provide support software for other operating systems, such as Apple, Unix, or Linux.
• If you have a valid PC emulator on your system, the Sea-Bird software may run, but we have no way to confirm this, or that the I/O connections to the instrument will properly function.
• If you have access to a PC running Windows, you can use Sea-Bird’s software to convert the data from our proprietary format to ASCII (in engineering units of C, T, P, etc. with calibration coefficients applied); then you could use your own software on a different computer to perform additional processing.
What is the flag variable column that is added to the data file by SBE Data Processing's Data Conversion or ASCII In module?
The flag variable column is added by Data Conversion (if you process data using Sea-Bird software) or ASCII In (if you are importing data that was generated using other software). The Loop Edit module sets the flag variable to bad for scans that show a pressure slowdown or reversal. The flag variable is then used by the rest of the SBE Data Processing modules as an indication of a bad scan, allowing you to exclude scans that are marked bad from processing performed in a module, if desired.
Initially all scans are marked good (flag value of 0) in Data Conversion or ASCII In. A flag of -9.99e-29 indicates the scan has been marked bad by Loop Edit.
Note: All occurrences of the bad value (-9.99e-29) can be replaced with a different value in ASCII Out. This may be useful for plotting purposes, as -9.99e-29 looks like 0 in a data plot.
How does Sea-Bird software calculate conductivity, temperature, and pressure in engineering units?
For formulas for the calculation of conductivity, temperature, and pressure from the raw data, see the calibration sheets for your instrument. If you cannot find the calibration sheets, contact us with your instrument serial number (Click here to see an example of where to find the serial number on your instrument).
How does Sea-Bird software calculate derived variables such as salinity, sound velocity, density, depth, thermosteric anomaly, specific volume, potential temperature, etc.?
The Seasave and SBE Data Processing manuals document the derived variable formulas in an Appendix (Derived Parameter Formulas). The Help files for these programs also document the formulas. To download the software and/or manuals, go to Software.
What formula does Sea-Bird software use to convert pressure data to depth?
The formulas are provided in Application Note 69: Conversion of Pressure to Depth.
In Sea-Bird software, is noon on January 1 Julian Day 0.5 or Julian Day 1.5?
In Seasoft-DOS version 4.249 and higher (March 2001 and later), January 1 is Julian Day 1. Therefore, noon on January 1 is Julian Day 1.5. Earlier versions of the software incorrectly defined January 1 as Julian Day 0, so noon on January 1 would appear as Julian Day 0.5.
All release versions of SBE Data Processing correctly identify January 1 as Julian Day 1.
Can I edit my .dat data file to add some explanatory notes to the header?
Seasoft V2's Seasave (older software, replaced with Seasave V7 in 2007) created a .dat file from data acquired from the SBE 11plus V2 Deck Unit / SBE 9plus CTD. This also applies to earlier versions of the Deck Unit and CTD.
Some text editing programs modify the file in ways that are not visible to the user (such as adding or removing carriage returns and line feeds), but that corrupt the format and prevent further processing by Seasoft. Therefore, we strongly recommend that you first convert the data to a .cnv file (using SBE Data Processing's Data Conversion module), and then use other SBE Data Processing modules to edit the .cnv file as desired.
Sea-Bird is not aware of a technique for editing a .dat file that will not corrupt it.
Sea-Bird distributes a utility program, Fixdat, that may repair a corrupted .dat file. Fixdat.exe is installed with, and located in the same directory as, SBE Data Processing.
Note: Seasave V7 creates a .hex file instead of a .dat file from data acquired from the SBE 11plus V2 Deck Unit / SBE 9plus CTD. See the FAQ on editing a .hex file.
Can I edit my .hex data file to add some explanatory notes to the header?
Some text editing programs modify the file in ways that are not visible to the user (such as adding or removing carriage returns and line feeds), but that corrupt the format and prevent further processing by Seasoft. Therefore, we strongly recommend that you first convert the data to a .cnv file (using SBE Data Processing’s Data Conversion module), and then use other SBE Data Processing modules to edit the .cnv file as desired.
However, if you still want to edit the raw data, this procedure provides details on one way to edit a .hex data file with a text editor while retaining the required format. If the editing is not performed using this technique, Seasoft may reject the data file and give you an error message.
1. Make a back-up copy of your .hex data file before you begin.
2. Run WordPad.
3. In the File menu, select Open. The Open dialog box appears. For Files of type, select All Documents (*.*). Browse to the desired .hex data file and click Open.
4. Edit the file as desired, inserting any new header lines after the System Upload Time line. Note that all header lines must begin with an asterisk (*), and *END* indicates the end of the header. An example is shown below, with the added lines in bold:
* Sea-Bird SBE 21 Data File:
* FileName = C:\Odis\SAT2-ODIS\oct14-19\oc15_99.hex
* Software Version Seasave Win32 v1.10
* Temperature SN = 2366
* Conductivity SN = 2366
* System UpLoad Time = Oct 15 1999 10:57:19
* Testing adding header lines
* Must start with an asterisk
* Can be placed anywhere between System Upload Time and END of header
* NMEA Latitude = 30 59.70 N
* NMEA Longitude = 081 37.93 W
* NMEA UTC (Time) = Oct 15 1999 10:57:19
* Store Lat/Lon Data = Append to Every Scan and Append to .NAV File When <Ctrl F7> is Pressed
** Ship: Sea-Bird
** Cruise: Sea-Bird Header Test
** Station:
** Latitude:
** Longitude:
*END*
1. In the File menu, select Save (not Save As). The following message may display:
You are about to save the document in a Text-Only format, which will remove all formatting. Are you sure you want to do this?
Ignore the message and click Yes.
2. In the File menu, select Exit.
Why am I getting a class not registered error when running SBE Data Processing?
This error message typically means that some of the .dll files needed to run the software are installed incorrectly or have been corrupted. We recommend that you remove the software, and then reinstall the latest version.
Note: Use the Windows' Add or Remove Programs utility to remove the software; do not just delete the .exe file.
I am confused by all these software names. Which software does what?
Sea-Bird’s main software package is called Seasoft©.
• Seasoft V2 — Seasoft V2 is actually a suite of stand-alone programs. You can install the entire suite or just the desired program(s).
• Deployment Endurance Calculator — calculates deployment length for moored instruments, based on user-input deployment scheme, instrument power requirements, and battery capacity.
• SeatermV2 — terminal program launcher that interfaces with Sea-Bird instruments developed or redesigned in 2006 and later, which can output data in XML. Can be used with SBE 16plus V2, 16plus-IM V2, 19plus V2, 25plus, 37 (SI, SIP, SM, SMP, IM, IMP, all with firmware 3.0 and later), 37 with oxygen (SIP-IDO, SIP-ODO, SMP-IDO, SMP-ODO, IMP-IDO, IMP-ODO), 39plus, 54 and PN 90588, 56, 63, and Glider Payload CTD. SeatermV2 provides setup, data retrieval, and diagnostic tests.
• Seaterm — terminal program that interfaces with most older Sea-Bird instruments, providing setup, data retrieval, and diagnostic tests.
• SeatermAF — terminal program that interfaces with instruments that provides auto-fire capability for autonomous operation of an SBE 32 Carousel Water Sampler (with an SBE 17plus V2 or AFM) or SBE 55 ECO Water Sampler, providing setup, data retrieval, and diagnostic tests.
• Seasave V7 — acquires, converts, and displays real-time or archived data. Seasave V7 is an entirely new version of Seasave, officially released March 2007.
• SBE Data Processing — converts, edits, processes, and plots data; some of SBE Data Processing’s most commonly used modules include Data Conversion, Bottle Summary, Align CTD, Bin Average, Derive, Cell Thermal Mass, Filter, and Sea Plot.
• Plot39 — plots ASCII data that has been uploaded from SBE 39plus, 39, or 39-IM Temperature Recorder or SBE 48 Hull Temperature Sensor.
• Seasoft for Waves
Provides setup, data retrieval, data processing, auto-spectrum and time series analysis, statistics reporting, and plotting for the SBE 26 and SBE 26plus Seagauge Wave & Tide Recorder. Also provides setup, data retrieval, data processing, and plotting for the SBE 53 BPR Bottom Pressure Recorder.
Additional software is available to simplify use of coastal instruments:
Why and how should I align data from a 911plus CTD?
The T-C Duct on a 911plus imposes a fixed delay (lag time) between the temperature measurement and the conductivity measurement reported in a given data scan. The delay is due to the time it takes for water to transit from the thermistor to the conductivity cell, and is determined by flow rate (pump rate). The average flow rate for a 9plus is about 30 ml/sec. The Deck Unit (11plus) automatically advances conductivity (moves it forward in time relative to temperature) on the fly by a user-programmable amount (default value of 0.073 seconds), before the data is logged on your computer. This default value is about right for a typical 9plus flow rate. Any fine-tuning adjustments to this advance are determined by looking for salinity spikes corresponding to sharp temperature steps in the profile and, via the SBE Data Processing module Align CTD, trying different additions (+ or -) to the 0.073 seconds applied by the Deck Unit, until the spikes are minimized. Having found this optimum advance for your CTD (corresponding to its particular flow rate), you can use that value for all future casts (change the value in the Deck Unit) unless the CTD plumbing (hence flow rate) is changed.
Oxygen and other parameters from pumped sensors in the same flow as the CT sensors can also be re-aligned in time relative to temperature, to account for the transit time of water through the plumbing. A typical plumbing delay for the SBE 43 DO Sensor is 2 seconds. However, the DO sensor time constant varies from approximately 2 seconds at 25 °C to 5 seconds at 0 °C. So, you should add some advance time for this as well (total delay = plumbing delay + response time). As for the conductivity alignment, the Deck Unit can automatically advance oxygen on the fly by a user-programmable amount (default value of 0 seconds) before the data is logged on your computer. However, because there is more variability in the advance, most users choose to do the advance in post-processing, via the SBE Data Processing module Align CTD. For additional information and discussion, refer to Module 9 of our training class and the SBE Data Processing manual.
Note: Alignment values are actually entered in the 11plus Deck Unit and in SBE Data Processing relative to the pressure measurement. For the 9plus, it is sufficiently correct to assume that the temperature measurement is made at the same instant in time and space as the pressure measurement.
Can I install my Sea-Bird CD-ROM on multiple computers or give it to another interested scientist?
You are free to install the software on multiple computers and to give the software to any interested potential user.
Sea-Bird's Seasoft© software is provided free of charge to Sea-Bird users and is not subject to any license. Seasoft is protected by copyright laws and international copyright treaties, as well as other intellectual property laws and treaties. All title and copyrights in and to Seasoft and the accompanying printed materials, and any copies of Seasoft, are owned by Sea-Bird Electronics. There are no restrictions on its use or distribution, provided such use does not infringe on our copyright.
The software is posted on our website, and anyone can download it.
What are the typical data processing steps recommended for each instrument?
Section 3: Typical Data Processing Sequences in the SBE Data Processing manual provides typical data processing sequences for our profiling CTDs, moored CTDs, and thermosalinographs. Typical values for aligning, filtering, etc. are provided in the sections detailing each module of the software. This information is also documented in the software's Help file. To download the software and/or manual, go to SBE Data Processing.
How can I copy the setup of my Sea-Bird software onto another computer?
A setup file is used by Seasave V7, and by each module in SBE Data Processing, to remember the way you had the program set up. You can save the file to a desired filename and location, and then use it when you run the software the next time, to ensure that the software will be set up the same way:
• A .psa file is created by Seasave V7 to store program settings, such as the instrument configuration (.con or .xmlcon) file name and path, serial ports, water sampler, TCP/IP ports, serial data output, etc. as well as size, placement, and setup for each display window.
• A .psa file is created by each module in SBE Data Processing to store program settings, such as the input filename and path, output filename, and module-specific parameters (for example, for Data Conversion: variables to convert, ascii or binary output, etc.).
If you want to set up real-time acquisition or data processing on more than one computer in the same way, simply copy the file for the desired setup, and transfer it to the other computer via your network, email, a thumb drive, or some other media. Then, after you open the software on the second computer, select the setup file you want to use.
• Seasave V7: Select File / Open Setup File.
• SBE Data Processing: In the module dialog box, on the File Setup tab, click the Open button under Program setup file.
Where can I find formulas for calculating conductivity, temperature, pressure, and derived parameters such as salinity, sound velocity, density, depth, thermosteric anomaly, specific volume, potential temperature, etc.?
For formulas for the calculation of conductivity, temperature, and pressure from the raw data, see the calibration sheets for your instrument (if you cannot find the calibration sheets, contact us with your instrument serial number at [email protected] or +1 425-643-9866).
For derived parameter formulas (salinity, sound velocity, density, etc.), see the Seasave and SBE Data Processing manuals, which document these formulas in an Appendix. Additionally, the formulas are documented in the Help files for these programs.
How can I view CTD data?
You can plot the raw data from a .dat or .hex file with Seasave V7.
Once the data is converted to a .cnv file with engineering units (using SBE Data Processing’s Data Conversion), you can plot the data in SBE Data Processing’s Sea Plot.
• Because Sea Plot only works with archived files, it is more sophisticated than Seasave. For example, Sea Plot can provide multiple file overlays, waterfall plots, and TS plots with contours.
If you wish to view the actual numbers you can open the .cnv file (if it was converted as ASCII) with any word processor or text editor.
What language format is recommended for use with Seaterm and Seaterm V2?
For best performance and compatibility, Sea-Bird recommends that customers set their computer to English language format and the use of a period (.) for the decimal symbol. Some customers have found corrupted data when using the software's binary upload capability while set to other languages.
To update your computer's language and decimal symbol (instructions are for a Windows 7 operating system):
1. In the computer Control Panel window, select Region and Language.
2. In the Region and Language window, on the Formats tab, select English in the Format pull down box.
3. In the Region and Language window, click the Additional settings . . . button. In the Customize Format window, select the period (.) in the Decimal symbol pull down box, and click OK.
4. In the Region and Language window, click OK.
What is a configuration (.con or .xmlcon) file and how is it used?
The configuration file defines the instrument — auxiliary sensors integrated with the instrument, and channels, serial numbers, and calibration dates and coefficients for all the integrated sensors (conductivity, temperature, and pressure as well as auxiliary sensors). Sea-Bird’s real-time acquisition and data processing software uses the information in the configuration file to interpret and process the raw data (sensor frequencies and voltages). If the configuration file does not match the actual instrument configuration, the software will not be able to interpret and process the data correctly.
When Sea-Bird ships a new instrument, we include a .con or .xmlcon file that reflects the current instrument configuration. The file is named with the instrument serial number, followed with the .con or .xmlcon extension. For example, for an instrument with serial number 2375, Sea-Bird names the .xmlcon file 2375.xmlcon. You may rename the configuration file if desired; this will not affect the results.
(Click here to see an example of where to find the serial number on your instrument)
Seasave V7 and SBE Data Processing version 7.20 (2009) introduced .xmlcon files (in XML format). Versions 7.20 and later allow you to open a .con or .xmlcon file, and to save it to a .con or .xmlcon file.
To view or modify the configuration file, use the Configure Inputs menu in Seasave V7, or the Configure menu in SBE Data Processing.
Notes:
• Seasave V7 and SBE Data Processing check that the serial number in the configuration file matches the instrument serial number in the .dat or .hex data file. If they are not the same, you will get an error message. The instrument serial number can be verified by sending the Status command (DS or #iiDS, as applicable) in the appropriate terminal program.
• SBE 16, 16plus, 16plus-IM, 16plus V2, 16plus-IM V2, 19, 19plus, 19plus V2, 21, and 49 — The instrument serial number is the same as the serial number of both the conductivity and temperature sensors.
• SBE 37 (older), 39, 39plus, and 48 — These instruments store calibration coefficients internally and do not accept auxiliary sensors, so they do not have configuration files.
• SBE 37 (newer) that is compatible with SeatermV2 terminal program — SeatermV2 creates a configuration file for these instruments when it uploads data. The configuration file can then be used for processing the data in SBE Data Processing.
• The calibration date in the configuration file is for information only. It does not affect the data processing.
• When Sea-Bird recalibrates an instrument, we ship the instrument with a Calibration Sheet showing the new calibration coefficients (1 calibration sheet per sensor on the instrument that was calibrated). Sea-Bird also supplies a .xml file with the calibration coefficients for each calibrated sensor. The .xml files can be imported into Seasave or SBE Data Processing, to update the calibration coefficients in the configuration file.
— For CTDs: Sea-Bird also creates a new configuration file, which includes calibration coefficients for the CTD as well as any auxiliary sensors that were returned to Sea-Bird with the CTD. If you did not return the auxiliary sensors with the CTD, you need to update the configuration file to include information on the auxiliary sensors that you plan to deploy with your CTD.
Why am I having trouble connecting via the SBE 39plus or SBE 56 internal USB connector?
In July 2015, Sea-Bird released updated software to address intermittent connectivity issues where the host computer or SeatermV2 cannot recognize an instrument communicating via its internal USB connector. Field Service Bulletin 28 describes the problem and the installation of updated software to solve the problem.
|
__label__pos
| 0.695378 |
The Corporate Web
Write An Essay On Whether Students Should Not Be Allowed To Play PUBG
Write An Essay On Whether Students Should Not Be Allowed To Play PUBG
PlayerUnknown’s Battlegrounds, or PUBG, is a popular online multiplayer game that has gained immense popularity in recent years. While the game has garnered a massive following, there has been a debate regarding whether students should be allowed to play PUBG. In my opinion, students should not be allowed to play PUBG because of its negative impact on their academics, mental and physical health, and social life.
Firstly, PUBG is an addictive game that can have a detrimental impact on a student’s academics. Many students become so engrossed in the game that they start to neglect their studies. This can lead to poor grades and a lack of academic progress. Instead of spending their time studying, students spend hours playing game, which can hinder their academic development. Moreover, the game can be distracting and can negatively impact a student’s ability to concentrate on their studies. As a result, it can be argued that playing PUBG should not be allowed for students, as it can have a severe impact on their academic progress.
Secondly, PUBG can have an adverse effect on a student’s mental and physical health. The game is highly stimulating and can be very stressful, which can lead to anxiety and other mental health issues. Furthermore, playing PUBG for extended periods can lead to physical health problems, such as obesity and back pain. Students who play the game for hours on end often neglect their physical health and do not engage in physical activities. This can have a long-lasting impact on their health, which is not ideal for young students who are still growing and developing.
Thirdly, PUBG can have a negative impact on a student’s social life. The game is highly immersive and can be played for hours on end, which can lead to social isolation. Students who play the game for extended periods often neglect their social life and do not engage in social activities. This can lead to a lack of social skills and difficulty in forming relationships with peers. Additionally, students who are addicted to the game may find it challenging to interact with people outside of the game, which can hinder their social development.
In conclusion, students should not be allowed to play PUBG due to its negative impact on their academic progress, mental and physical health, and social life. While the game may be enjoyable, it can be highly addictive and can lead to various problems that can have a long-lasting impact on a student’s life.
As such, it is essential for parents and educators to be aware of the negative impact of the game and take steps to prevent students from playing it for extended periods. By doing so, students can focus on their academic progress, maintain good mental and physical health, and develop healthy social relationships.
SUBSCRIBE TO OUR NEWSLETTER
GET A FREE EBOOK ON “ARTIFICIAL INTELLIGENCE IN DIGITAL MARKETING”
Subscribe
Notify of
guest
2 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
SORT BY
INR -
Artificial Intelligence In Digital Marketing
Artificial Intelligence In Digital Marketing
"Artificial Intelligence In Digital Marketing"
|
__label__pos
| 0.974699 |
Connect with us
Blog
What Does The Timer Mean On Snapchat in 2023?
Snapchat is a popular social media platform that has revolutionized the way people communicate. One of the most unique features of Snapchat is the timer. The timer indicates how long a snap will be visible to the recipient before it disappears. In this article, we will take a closer look at what the timer means on Snapchat in 2023, and how it has evolved over the years.
History of Snapchat Timer
Snapchat was first launched in 2011, and the timer feature was introduced in the same year. Originally, the timer was set to a maximum of 10 seconds, and the snap would disappear after that time. Over the years, the timer feature has undergone several changes, and today it has several different settings.
What Does The Timer Mean on Snapchat?
The timer on Snapchat indicates how long a snap will be visible to the recipient before it disappears. When a user sends a snap to a friend, they can choose the duration of the snap using the timer feature. The user can choose to set the timer from 1 to 60 seconds, or they can choose the “no limit” option, which means the snap will remain visible until the recipient closes it.
How Has The Timer Evolved Over The Years?
Since its launch in 2011, the timer on Snapchat has undergone several changes. In 2013, Snapchat introduced the “Snapstreak” feature, which encouraged users to send snaps back and forth with friends to keep a streak alive. The Snapstreak feature added a new element to the timer, as snaps sent during a Snapstreak had to be opened within 24 hours, or the streak would be lost.
In 2015, Snapchat introduced a new timer feature called “Infinity Mode,” which allowed users to send snaps that would remain visible until the recipient closed them. This feature was popular among users who wanted to share longer videos or photos.
Advertisement
In 2018, Snapchat introduced a new feature called “Timer Loop,” which allowed users to set a timer for a snap to repeat multiple times. This feature was useful for sharing looping videos or creating a humorous effect.
How Does The Timer Affect User Privacy?
The timer on Snapchat is an important privacy feature that ensures snaps are only visible for a limited time. However, users should be aware that snaps can be saved by recipients using various methods, such as screenshots or third-party apps. Snapchat also has a “Memories” feature that allows users to save snaps within the app, which can be viewed at any time.
Conclusion
In conclusion, the timer on Snapchat is an essential feature that has evolved over the years to provide more options for users. The timer indicates how long a snap will be visible to the recipient before it disappears, and users can choose from several different settings. While the timer is an important privacy feature, users should also be aware of the various ways snaps can be saved and shared.
FAQs
Can I set the timer for more than 60 seconds on Snapchat?
No, the maximum duration for a snap is 60 seconds.
Can I save snaps sent to me on Snapchat?
Yes, you can save snaps using the Memories feature within the app.
Advertisement
Can snaps be saved by recipients without my knowledge?
Yes, recipients can save snaps using screenshots or third-party apps.
Can I send a snap without a timer on Snapchat?
Yes, you can choose the “no limit” option, which means the snap will remain visible until the recipient closes it.
Does the timer apply to all types of snaps on Snapchat?
No, the timer only applies to snaps sent directly to friends, not to snaps posted on your story.
Hi, I am Sadhana and thank you for stopping by to know me. I am a work-at-home mom of One Cute Baby and a firm believer in making 'working from home' success for everyone.
Advertisement
Click to comment
Leave a Reply
Your email address will not be published. Required fields are marked *
Trending
|
__label__pos
| 0.999141 |
0
Are there any examples of 3D animations rendering in mobile Safari? To date, nearly all of the 3D animations I've seen working on a PC don't seem to render correctly on iOS. (Why is that?)
I was under the impression that because of full hardware acceleration, 3D animation would be no problem in mobile Safari, especially since mobile Safari is pretty standards compliant and supports both Javascript, HTML 5 and CSS3 quite well.
If there are no examples, why not? What are the limitations?
1
3D CSS works well on mobile safari.
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
__label__pos
| 0.99507 |
~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~
Wine Cross Reference
wine/dlls/oleaut32/tmarshal.c
Version: ~ [ wine-1.5.30 ] ~ [ wine-1.5.29 ] ~ [ wine-1.5.28 ] ~ [ wine-1.5.27 ] ~ [ wine-1.5.26 ] ~ [ wine-1.5.25 ] ~ [ wine-1.5.24 ] ~ [ wine-1.5.23 ] ~ [ wine-1.5.22 ] ~ [ wine-1.5.21 ] ~ [ wine-1.5.20 ] ~ [ wine-1.5.19 ] ~ [ wine-1.5.18 ] ~ [ wine-1.5.17 ] ~ [ wine-1.5.16 ] ~ [ wine-1.5.15 ] ~ [ wine-1.5.14 ] ~ [ wine-1.5.13 ] ~ [ wine-1.5.12 ] ~ [ wine-1.5.11 ] ~ [ wine-1.5.10 ] ~ [ wine-1.5.9 ] ~ [ wine-1.5.8 ] ~ [ wine-1.5.7 ] ~ [ wine-1.4.1 ] ~ [ wine-1.5.6 ] ~ [ wine-1.5.5 ] ~ [ wine-1.5.4 ] ~ [ wine-1.5.3 ] ~ [ wine-1.5.2 ] ~ [ wine-1.5.1 ] ~ [ wine-1.5.0 ] ~ [ wine-1.4 ] ~ [ wine-1.4-rc6 ] ~ [ wine-1.4-rc5 ] ~ [ wine-1.4-rc4 ] ~ [ wine-1.4-rc3 ] ~ [ wine-1.4-rc2 ] ~ [ wine-1.4-rc1 ] ~ [ wine-1.3.37 ] ~ [ wine-1.3.36 ] ~ [ wine-1.3.35 ] ~ [ wine-1.3.34 ] ~ [ wine-1.3.33 ] ~ [ wine-1.3.32 ] ~ [ wine-1.3.31 ] ~ [ wine-1.3.30 ] ~ [ wine-1.3.29 ] ~ [ wine-1.3.28 ] ~ [ wine-1.3.27 ] ~ [ wine-1.3.26 ] ~ [ wine-1.3.25 ] ~ [ wine-1.3.24 ] ~ [ wine-1.3.23 ] ~ [ wine-1.3.22 ] ~ [ wine-1.3.21 ] ~ [ wine-1.3.20 ] ~ [ wine-1.3.19 ] ~ [ wine-1.3.18 ] ~ [ wine-1.2.3 ] ~ [ wine-1.3.17 ] ~ [ wine-1.3.16 ] ~ [ wine-1.3.15 ] ~ [ wine-1.3.14 ] ~ [ wine-1.3.13 ] ~ [ wine-1.3.12 ] ~ [ wine-1.3.11 ] ~ [ wine-1.3.10 ] ~ [ wine-1.3.9 ] ~ [ wine-1.2.2 ] ~ [ wine-1.3.8 ] ~ [ wine-1.3.7 ] ~ [ wine-1.3.6 ] ~ [ wine-1.3.5 ] ~ [ wine-1.2.1 ] ~ [ wine-1.3.4 ] ~ [ wine-1.3.3 ] ~ [ wine-1.3.2 ] ~ [ wine-1.3.1 ] ~ [ wine-1.3.0 ] ~ [ wine-1.2 ] ~ [ wine-1.2-rc7 ] ~ [ wine-1.2-rc6 ] ~ [ wine-1.2-rc5 ] ~ [ wine-1.2-rc4 ] ~ [ wine-1.2-rc3 ] ~ [ wine-1.2-rc2 ] ~ [ wine-1.2-rc1 ] ~ [ wine-1.1.44 ] ~ [ wine-1.1.43 ] ~ [ wine-1.1.42 ] ~ [ wine-1.1.41 ] ~ [ wine-1.1.40 ] ~ [ wine-1.1.39 ] ~ [ wine-1.1.38 ] ~ [ wine-1.1.37 ] ~ [ wine-1.1.36 ] ~ [ wine-1.1.35 ] ~ [ wine-1.1.34 ] ~ [ wine-1.1.33 ] ~ [ wine-1.1.32 ] ~ [ wine-1.1.31 ] ~ [ wine-1.1.30 ] ~ [ wine-1.1.29 ] ~ [ wine-1.1.28 ] ~ [ wine-1.1.27 ] ~ [ wine-1.1.26 ] ~ [ wine-1.1.25 ] ~ [ wine-1.1.24 ] ~ [ wine-1.1.23 ] ~ [ wine-1.1.22 ] ~ [ wine-1.1.21 ] ~ [ wine-1.1.20 ] ~ [ wine-1.1.19 ] ~ [ wine-1.1.18 ] ~ [ wine-1.1.17 ] ~ [ wine-1.1.16 ] ~ [ wine-1.1.15 ] ~ [ wine-1.1.14 ] ~ [ wine-1.1.13 ] ~ [ wine-1.1.12 ] ~ [ wine-1.1.11 ] ~ [ wine-1.1.10 ] ~ [ wine-1.1.9 ] ~ [ wine-1.1.8 ] ~ [ wine-1.1.7 ] ~ [ wine-1.0.1 ] ~ [ wine-1.1.6 ] ~ [ wine-1.1.5 ] ~ [ wine-1.1.4 ] ~ [ wine-1.1.3 ] ~ [ wine-1.1.2 ] ~ [ wine-1.1.1 ] ~ [ wine-1.1.0 ] ~ [ wine-1.0 ] ~
1 /*
2 * TYPELIB Marshaler
3 *
4 * Copyright 2002,2005 Marcus Meissner
5 *
6 * The olerelay debug channel allows you to see calls marshalled by
7 * the typelib marshaller. It is not a generic COM relaying system.
8 *
9 * This library is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
13 *
14 * This library is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
18 *
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with this library; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
22 */
23
24 #include "config.h"
25 #include "wine/port.h"
26
27 #include <assert.h>
28 #include <stdlib.h>
29 #include <string.h>
30 #include <stdarg.h>
31 #include <stdio.h>
32 #include <ctype.h>
33
34 #define COBJMACROS
35 #define NONAMELESSUNION
36 #define NONAMELESSSTRUCT
37
38 #include "winerror.h"
39 #include "windef.h"
40 #include "winbase.h"
41 #include "winnls.h"
42 #include "winreg.h"
43 #include "winuser.h"
44
45 #include "ole2.h"
46 #include "propidl.h" /* for LPSAFEARRAY_User* functions */
47 #include "typelib.h"
48 #include "variant.h"
49 #include "wine/debug.h"
50 #include "wine/exception.h"
51
52 static const WCHAR IDispatchW[] = { 'I','D','i','s','p','a','t','c','h',0};
53
54 WINE_DEFAULT_DEBUG_CHANNEL(ole);
55 WINE_DECLARE_DEBUG_CHANNEL(olerelay);
56
57 #define ICOM_THIS_MULTI(impl,field,iface) impl* const This=(impl*)((char*)(iface) - offsetof(impl,field))
58
59 static HRESULT TMarshalDispatchChannel_Create(
60 IRpcChannelBuffer *pDelegateChannel, REFIID tmarshal_riid,
61 IRpcChannelBuffer **ppChannel);
62
63 typedef struct _marshal_state {
64 LPBYTE base;
65 int size;
66 int curoff;
67 } marshal_state;
68
69 /* used in the olerelay code to avoid having the L"" stuff added by debugstr_w */
70 static char *relaystr(WCHAR *in) {
71 char *tmp = (char *)debugstr_w(in);
72 tmp += 2;
73 tmp[strlen(tmp)-1] = '\0';
74 return tmp;
75 }
76
77 static HRESULT
78 xbuf_resize(marshal_state *buf, DWORD newsize)
79 {
80 if(buf->size >= newsize)
81 return S_FALSE;
82
83 if(buf->base)
84 {
85 buf->base = HeapReAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, buf->base, newsize);
86 if(!buf->base)
87 return E_OUTOFMEMORY;
88 }
89 else
90 {
91 buf->base = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, newsize);
92 if(!buf->base)
93 return E_OUTOFMEMORY;
94 }
95 buf->size = newsize;
96 return S_OK;
97 }
98
99 static HRESULT
100 xbuf_add(marshal_state *buf, const BYTE *stuff, DWORD size)
101 {
102 HRESULT hr;
103
104 if(buf->size - buf->curoff < size)
105 {
106 hr = xbuf_resize(buf, buf->size + size + 100);
107 if(FAILED(hr)) return hr;
108 }
109 memcpy(buf->base+buf->curoff,stuff,size);
110 buf->curoff += size;
111 return S_OK;
112 }
113
114 static HRESULT
115 xbuf_get(marshal_state *buf, LPBYTE stuff, DWORD size) {
116 if (buf->size < buf->curoff+size) return E_FAIL;
117 memcpy(stuff,buf->base+buf->curoff,size);
118 buf->curoff += size;
119 return S_OK;
120 }
121
122 static HRESULT
123 xbuf_skip(marshal_state *buf, DWORD size) {
124 if (buf->size < buf->curoff+size) return E_FAIL;
125 buf->curoff += size;
126 return S_OK;
127 }
128
129 static HRESULT
130 _unmarshal_interface(marshal_state *buf, REFIID riid, LPUNKNOWN *pUnk) {
131 IStream *pStm;
132 ULARGE_INTEGER newpos;
133 LARGE_INTEGER seekto;
134 ULONG res;
135 HRESULT hres;
136 DWORD xsize;
137
138 TRACE("...%s...\n",debugstr_guid(riid));
139
140 *pUnk = NULL;
141 hres = xbuf_get(buf,(LPBYTE)&xsize,sizeof(xsize));
142 if (hres) {
143 ERR("xbuf_get failed\n");
144 return hres;
145 }
146
147 if (xsize == 0) return S_OK;
148
149 hres = CreateStreamOnHGlobal(0,TRUE,&pStm);
150 if (hres) {
151 ERR("Stream create failed %x\n",hres);
152 return hres;
153 }
154
155 hres = IStream_Write(pStm,buf->base+buf->curoff,xsize,&res);
156 if (hres) {
157 ERR("stream write %x\n",hres);
158 return hres;
159 }
160
161 memset(&seekto,0,sizeof(seekto));
162 hres = IStream_Seek(pStm,seekto,SEEK_SET,&newpos);
163 if (hres) {
164 ERR("Failed Seek %x\n",hres);
165 return hres;
166 }
167
168 hres = CoUnmarshalInterface(pStm,riid,(LPVOID*)pUnk);
169 if (hres) {
170 ERR("Unmarshalling interface %s failed with %x\n",debugstr_guid(riid),hres);
171 return hres;
172 }
173
174 IStream_Release(pStm);
175 return xbuf_skip(buf,xsize);
176 }
177
178 static HRESULT
179 _marshal_interface(marshal_state *buf, REFIID riid, LPUNKNOWN pUnk) {
180 LPBYTE tempbuf = NULL;
181 IStream *pStm = NULL;
182 STATSTG ststg;
183 ULARGE_INTEGER newpos;
184 LARGE_INTEGER seekto;
185 ULONG res;
186 DWORD xsize;
187 HRESULT hres;
188
189 if (!pUnk) {
190 /* this is valid, if for instance we serialize
191 * a VT_DISPATCH with NULL ptr which apparently
192 * can happen. S_OK to make sure we continue
193 * serializing.
194 */
195 WARN("pUnk is NULL\n");
196 xsize = 0;
197 return xbuf_add(buf,(LPBYTE)&xsize,sizeof(xsize));
198 }
199
200 hres = E_FAIL;
201
202 TRACE("...%s...\n",debugstr_guid(riid));
203
204 hres = CreateStreamOnHGlobal(0,TRUE,&pStm);
205 if (hres) {
206 ERR("Stream create failed %x\n",hres);
207 goto fail;
208 }
209
210 hres = CoMarshalInterface(pStm,riid,pUnk,0,NULL,0);
211 if (hres) {
212 ERR("Marshalling interface %s failed with %x\n", debugstr_guid(riid), hres);
213 goto fail;
214 }
215
216 hres = IStream_Stat(pStm,&ststg,STATFLAG_NONAME);
217 if (hres) {
218 ERR("Stream stat failed\n");
219 goto fail;
220 }
221
222 tempbuf = HeapAlloc(GetProcessHeap(), 0, ststg.cbSize.u.LowPart);
223 memset(&seekto,0,sizeof(seekto));
224 hres = IStream_Seek(pStm,seekto,SEEK_SET,&newpos);
225 if (hres) {
226 ERR("Failed Seek %x\n",hres);
227 goto fail;
228 }
229
230 hres = IStream_Read(pStm,tempbuf,ststg.cbSize.u.LowPart,&res);
231 if (hres) {
232 ERR("Failed Read %x\n",hres);
233 goto fail;
234 }
235
236 xsize = ststg.cbSize.u.LowPart;
237 xbuf_add(buf,(LPBYTE)&xsize,sizeof(xsize));
238 hres = xbuf_add(buf,tempbuf,ststg.cbSize.u.LowPart);
239
240 HeapFree(GetProcessHeap(),0,tempbuf);
241 IStream_Release(pStm);
242
243 return hres;
244
245 fail:
246 xsize = 0;
247 xbuf_add(buf,(LPBYTE)&xsize,sizeof(xsize));
248 if (pStm) IUnknown_Release(pStm);
249 HeapFree(GetProcessHeap(), 0, tempbuf);
250 return hres;
251 }
252
253 /********************* OLE Proxy/Stub Factory ********************************/
254 static HRESULT WINAPI
255 PSFacBuf_QueryInterface(LPPSFACTORYBUFFER iface, REFIID iid, LPVOID *ppv) {
256 if (IsEqualIID(iid,&IID_IPSFactoryBuffer)||IsEqualIID(iid,&IID_IUnknown)) {
257 *ppv = iface;
258 /* No ref counting, static class */
259 return S_OK;
260 }
261 FIXME("(%s) unknown IID?\n",debugstr_guid(iid));
262 return E_NOINTERFACE;
263 }
264
265 static ULONG WINAPI PSFacBuf_AddRef(LPPSFACTORYBUFFER iface) { return 2; }
266 static ULONG WINAPI PSFacBuf_Release(LPPSFACTORYBUFFER iface) { return 1; }
267
268 static HRESULT
269 _get_typeinfo_for_iid(REFIID riid, ITypeInfo**ti) {
270 HRESULT hres;
271 HKEY ikey;
272 char tlguid[200],typelibkey[300],interfacekey[300],ver[100];
273 char tlfn[260];
274 OLECHAR tlfnW[260];
275 DWORD tlguidlen, verlen, type;
276 LONG tlfnlen;
277 ITypeLib *tl;
278
279 sprintf( interfacekey, "Interface\\{%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x}\\Typelib",
280 riid->Data1, riid->Data2, riid->Data3,
281 riid->Data4[0], riid->Data4[1], riid->Data4[2], riid->Data4[3],
282 riid->Data4[4], riid->Data4[5], riid->Data4[6], riid->Data4[7]
283 );
284
285 if (RegOpenKeyA(HKEY_CLASSES_ROOT,interfacekey,&ikey)) {
286 ERR("No %s key found.\n",interfacekey);
287 return E_FAIL;
288 }
289 tlguidlen = sizeof(tlguid);
290 if (RegQueryValueExA(ikey,NULL,NULL,&type,(LPBYTE)tlguid,&tlguidlen)) {
291 ERR("Getting typelib guid failed.\n");
292 RegCloseKey(ikey);
293 return E_FAIL;
294 }
295 verlen = sizeof(ver);
296 if (RegQueryValueExA(ikey,"Version",NULL,&type,(LPBYTE)ver,&verlen)) {
297 ERR("Could not get version value?\n");
298 RegCloseKey(ikey);
299 return E_FAIL;
300 }
301 RegCloseKey(ikey);
302 sprintf(typelibkey,"Typelib\\%s\\%s\\\\win%u",tlguid,ver,(sizeof(void*) == 8) ? 64 : 32);
303 tlfnlen = sizeof(tlfn);
304 if (RegQueryValueA(HKEY_CLASSES_ROOT,typelibkey,tlfn,&tlfnlen)) {
305 ERR("Could not get typelib fn?\n");
306 return E_FAIL;
307 }
308 MultiByteToWideChar(CP_ACP, 0, tlfn, -1, tlfnW, sizeof(tlfnW) / sizeof(tlfnW[0]));
309 hres = LoadTypeLib(tlfnW,&tl);
310 if (hres) {
311 ERR("Failed to load typelib for %s, but it should be there.\n",debugstr_guid(riid));
312 return hres;
313 }
314 hres = ITypeLib_GetTypeInfoOfGuid(tl,riid,ti);
315 if (hres) {
316 ERR("typelib does not contain info for %s?\n",debugstr_guid(riid));
317 ITypeLib_Release(tl);
318 return hres;
319 }
320 ITypeLib_Release(tl);
321 return hres;
322 }
323
324 /*
325 * Determine the number of functions including all inherited functions.
326 * Note for non-dual dispinterfaces we simply return the size of IDispatch.
327 */
328 static HRESULT num_of_funcs(ITypeInfo *tinfo, unsigned int *num)
329 {
330 HRESULT hres;
331 TYPEATTR *attr;
332 ITypeInfo *tinfo2;
333
334 *num = 0;
335 hres = ITypeInfo_GetTypeAttr(tinfo, &attr);
336 if (hres) {
337 ERR("GetTypeAttr failed with %x\n",hres);
338 return hres;
339 }
340
341 if(attr->typekind == TKIND_DISPATCH && (attr->wTypeFlags & TYPEFLAG_FDUAL))
342 {
343 HREFTYPE href;
344 hres = ITypeInfo_GetRefTypeOfImplType(tinfo, -1, &href);
345 if(FAILED(hres))
346 {
347 ERR("Unable to get interface href from dual dispinterface\n");
348 goto end;
349 }
350 hres = ITypeInfo_GetRefTypeInfo(tinfo, href, &tinfo2);
351 if(FAILED(hres))
352 {
353 ERR("Unable to get interface from dual dispinterface\n");
354 goto end;
355 }
356 hres = num_of_funcs(tinfo2, num);
357 ITypeInfo_Release(tinfo2);
358 }
359 else
360 {
361 *num = attr->cbSizeVft / 4;
362 }
363
364 end:
365 ITypeInfo_ReleaseTypeAttr(tinfo, attr);
366 return hres;
367 }
368
369 #ifdef __i386__
370
371 #include "pshpack1.h"
372
373 typedef struct _TMAsmProxy {
374 BYTE popleax;
375 BYTE pushlval;
376 DWORD nr;
377 BYTE pushleax;
378 BYTE lcall;
379 DWORD xcall;
380 BYTE lret;
381 WORD bytestopop;
382 BYTE nop;
383 } TMAsmProxy;
384
385 #include "poppack.h"
386
387 #else /* __i386__ */
388 # warning You need to implement stubless proxies for your architecture
389 typedef struct _TMAsmProxy {
390 } TMAsmProxy;
391 #endif
392
393 typedef struct _TMProxyImpl {
394 LPVOID *lpvtbl;
395 const IRpcProxyBufferVtbl *lpvtbl2;
396 LONG ref;
397
398 TMAsmProxy *asmstubs;
399 ITypeInfo* tinfo;
400 IRpcChannelBuffer* chanbuf;
401 IID iid;
402 CRITICAL_SECTION crit;
403 IUnknown *outerunknown;
404 IDispatch *dispatch;
405 IRpcProxyBuffer *dispatch_proxy;
406 } TMProxyImpl;
407
408 static HRESULT WINAPI
409 TMProxyImpl_QueryInterface(LPRPCPROXYBUFFER iface, REFIID riid, LPVOID *ppv)
410 {
411 TRACE("()\n");
412 if (IsEqualIID(riid,&IID_IUnknown)||IsEqualIID(riid,&IID_IRpcProxyBuffer)) {
413 *ppv = iface;
414 IRpcProxyBuffer_AddRef(iface);
415 return S_OK;
416 }
417 FIXME("no interface for %s\n",debugstr_guid(riid));
418 return E_NOINTERFACE;
419 }
420
421 static ULONG WINAPI
422 TMProxyImpl_AddRef(LPRPCPROXYBUFFER iface)
423 {
424 ICOM_THIS_MULTI(TMProxyImpl,lpvtbl2,iface);
425 ULONG refCount = InterlockedIncrement(&This->ref);
426
427 TRACE("(%p)->(ref before=%u)\n",This, refCount - 1);
428
429 return refCount;
430 }
431
432 static ULONG WINAPI
433 TMProxyImpl_Release(LPRPCPROXYBUFFER iface)
434 {
435 ICOM_THIS_MULTI(TMProxyImpl,lpvtbl2,iface);
436 ULONG refCount = InterlockedDecrement(&This->ref);
437
438 TRACE("(%p)->(ref before=%u)\n",This, refCount + 1);
439
440 if (!refCount)
441 {
442 if (This->dispatch_proxy) IRpcProxyBuffer_Release(This->dispatch_proxy);
443 This->crit.DebugInfo->Spare[0] = 0;
444 DeleteCriticalSection(&This->crit);
445 if (This->chanbuf) IRpcChannelBuffer_Release(This->chanbuf);
446 VirtualFree(This->asmstubs, 0, MEM_RELEASE);
447 HeapFree(GetProcessHeap(), 0, This->lpvtbl);
448 ITypeInfo_Release(This->tinfo);
449 CoTaskMemFree(This);
450 }
451 return refCount;
452 }
453
454 static HRESULT WINAPI
455 TMProxyImpl_Connect(
456 LPRPCPROXYBUFFER iface,IRpcChannelBuffer* pRpcChannelBuffer)
457 {
458 ICOM_THIS_MULTI(TMProxyImpl, lpvtbl2, iface);
459
460 TRACE("(%p)\n", pRpcChannelBuffer);
461
462 EnterCriticalSection(&This->crit);
463
464 IRpcChannelBuffer_AddRef(pRpcChannelBuffer);
465 This->chanbuf = pRpcChannelBuffer;
466
467 LeaveCriticalSection(&This->crit);
468
469 if (This->dispatch_proxy)
470 {
471 IRpcChannelBuffer *pDelegateChannel;
472 HRESULT hr = TMarshalDispatchChannel_Create(pRpcChannelBuffer, &This->iid, &pDelegateChannel);
473 if (FAILED(hr))
474 return hr;
475 hr = IRpcProxyBuffer_Connect(This->dispatch_proxy, pDelegateChannel);
476 IRpcChannelBuffer_Release(pDelegateChannel);
477 return hr;
478 }
479
480 return S_OK;
481 }
482
483 static void WINAPI
484 TMProxyImpl_Disconnect(LPRPCPROXYBUFFER iface)
485 {
486 ICOM_THIS_MULTI(TMProxyImpl, lpvtbl2, iface);
487
488 TRACE("()\n");
489
490 EnterCriticalSection(&This->crit);
491
492 IRpcChannelBuffer_Release(This->chanbuf);
493 This->chanbuf = NULL;
494
495 LeaveCriticalSection(&This->crit);
496
497 if (This->dispatch_proxy)
498 IRpcProxyBuffer_Disconnect(This->dispatch_proxy);
499 }
500
501
502 static const IRpcProxyBufferVtbl tmproxyvtable = {
503 TMProxyImpl_QueryInterface,
504 TMProxyImpl_AddRef,
505 TMProxyImpl_Release,
506 TMProxyImpl_Connect,
507 TMProxyImpl_Disconnect
508 };
509
510 /* how much space do we use on stack in DWORD steps. */
511 static int
512 _argsize(TYPEDESC *tdesc, ITypeInfo *tinfo) {
513 switch (tdesc->vt) {
514 case VT_I8:
515 case VT_UI8:
516 return 8/sizeof(DWORD);
517 case VT_R8:
518 return sizeof(double)/sizeof(DWORD);
519 case VT_CY:
520 return sizeof(CY)/sizeof(DWORD);
521 case VT_DATE:
522 return sizeof(DATE)/sizeof(DWORD);
523 case VT_DECIMAL:
524 return (sizeof(DECIMAL)+3)/sizeof(DWORD);
525 case VT_VARIANT:
526 return (sizeof(VARIANT)+3)/sizeof(DWORD);
527 case VT_USERDEFINED:
528 {
529 ITypeInfo *tinfo2;
530 TYPEATTR *tattr;
531 HRESULT hres;
532 DWORD ret;
533
534 hres = ITypeInfo_GetRefTypeInfo(tinfo,tdesc->u.hreftype,&tinfo2);
535 if (FAILED(hres))
536 return 0; /* should fail critically in serialize_param */
537 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
538 ret = (tattr->cbSizeInstance+3)/sizeof(DWORD);
539 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
540 ITypeInfo_Release(tinfo2);
541 return ret;
542 }
543 default:
544 return 1;
545 }
546 }
547
548 /* how much space do we use on the heap (in bytes) */
549 static int
550 _xsize(const TYPEDESC *td, ITypeInfo *tinfo) {
551 switch (td->vt) {
552 case VT_DATE:
553 return sizeof(DATE);
554 case VT_CY:
555 return sizeof(CY);
556 /* FIXME: VT_BOOL should return 2? */
557 case VT_VARIANT:
558 return sizeof(VARIANT)+3; /* FIXME: why the +3? */
559 case VT_CARRAY: {
560 int i, arrsize = 1;
561 const ARRAYDESC *adesc = td->u.lpadesc;
562
563 for (i=0;i<adesc->cDims;i++)
564 arrsize *= adesc->rgbounds[i].cElements;
565 return arrsize*_xsize(&adesc->tdescElem, tinfo);
566 }
567 case VT_UI8:
568 case VT_I8:
569 case VT_R8:
570 return 8;
571 case VT_UI2:
572 case VT_I2:
573 return 2;
574 case VT_UI1:
575 case VT_I1:
576 return 1;
577 case VT_USERDEFINED:
578 {
579 ITypeInfo *tinfo2;
580 TYPEATTR *tattr;
581 HRESULT hres;
582 DWORD ret;
583
584 hres = ITypeInfo_GetRefTypeInfo(tinfo,td->u.hreftype,&tinfo2);
585 if (FAILED(hres))
586 return 0;
587 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
588 ret = tattr->cbSizeInstance;
589 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
590 ITypeInfo_Release(tinfo2);
591 return ret;
592 }
593 default:
594 return 4;
595 }
596 }
597
598 static HRESULT
599 serialize_param(
600 ITypeInfo *tinfo,
601 BOOL writeit,
602 BOOL debugout,
603 BOOL dealloc,
604 TYPEDESC *tdesc,
605 DWORD *arg,
606 marshal_state *buf)
607 {
608 HRESULT hres = S_OK;
609 VARTYPE vartype;
610
611 TRACE("(tdesc.vt %s)\n",debugstr_vt(tdesc->vt));
612
613 vartype = tdesc->vt;
614 if ((vartype & 0xf000) == VT_ARRAY)
615 vartype = VT_SAFEARRAY;
616
617 switch (vartype) {
618 case VT_EMPTY: /* nothing. empty variant for instance */
619 return S_OK;
620 case VT_I8:
621 case VT_UI8:
622 case VT_R8:
623 case VT_CY:
624 hres = S_OK;
625 if (debugout) TRACE_(olerelay)("%x%x\n",arg[0],arg[1]);
626 if (writeit)
627 hres = xbuf_add(buf,(LPBYTE)arg,8);
628 return hres;
629 case VT_BOOL:
630 case VT_ERROR:
631 case VT_INT:
632 case VT_UINT:
633 case VT_I4:
634 case VT_R4:
635 case VT_UI4:
636 hres = S_OK;
637 if (debugout) TRACE_(olerelay)("%x\n",*arg);
638 if (writeit)
639 hres = xbuf_add(buf,(LPBYTE)arg,sizeof(DWORD));
640 return hres;
641 case VT_I2:
642 case VT_UI2:
643 hres = S_OK;
644 if (debugout) TRACE_(olerelay)("%04x\n",*arg & 0xffff);
645 if (writeit)
646 hres = xbuf_add(buf,(LPBYTE)arg,sizeof(DWORD));
647 return hres;
648 case VT_I1:
649 case VT_UI1:
650 hres = S_OK;
651 if (debugout) TRACE_(olerelay)("%02x\n",*arg & 0xff);
652 if (writeit)
653 hres = xbuf_add(buf,(LPBYTE)arg,sizeof(DWORD));
654 return hres;
655 case VT_I4|VT_BYREF:
656 hres = S_OK;
657 if (debugout) TRACE_(olerelay)("&0x%x\n",*arg);
658 if (writeit)
659 hres = xbuf_add(buf,(LPBYTE)(DWORD*)*arg,sizeof(DWORD));
660 /* do not dealloc at this time */
661 return hres;
662 case VT_VARIANT: {
663 TYPEDESC tdesc2;
664 VARIANT *vt = (VARIANT*)arg;
665 DWORD vttype = V_VT(vt);
666
667 if (debugout) TRACE_(olerelay)("Vt(%s%s)(",debugstr_vt(vttype),debugstr_vf(vttype));
668 tdesc2.vt = vttype;
669 if (writeit) {
670 hres = xbuf_add(buf,(LPBYTE)&vttype,sizeof(vttype));
671 if (hres) return hres;
672 }
673 /* need to recurse since we need to free the stuff */
674 hres = serialize_param(tinfo,writeit,debugout,dealloc,&tdesc2,(DWORD*)&(V_I4(vt)),buf);
675 if (debugout) TRACE_(olerelay)(")");
676 return hres;
677 }
678 case VT_BSTR|VT_BYREF: {
679 if (debugout) TRACE_(olerelay)("[byref]'%s'", *(BSTR*)*arg ? relaystr(*((BSTR*)*arg)) : "<bstr NULL>");
680 if (writeit) {
681 /* ptr to ptr to magic widestring, basically */
682 BSTR *bstr = (BSTR *) *arg;
683 DWORD len;
684 if (!*bstr) {
685 /* -1 means "null string" which is equivalent to empty string */
686 len = -1;
687 hres = xbuf_add(buf, (LPBYTE)&len,sizeof(DWORD));
688 if (hres) return hres;
689 } else {
690 len = *((DWORD*)*bstr-1)/sizeof(WCHAR);
691 hres = xbuf_add(buf,(LPBYTE)&len,sizeof(DWORD));
692 if (hres) return hres;
693 hres = xbuf_add(buf,(LPBYTE)*bstr,len * sizeof(WCHAR));
694 if (hres) return hres;
695 }
696 }
697
698 if (dealloc && arg) {
699 BSTR *str = *((BSTR **)arg);
700 SysFreeString(*str);
701 }
702 return S_OK;
703 }
704
705 case VT_BSTR: {
706 if (debugout) {
707 if (*arg)
708 TRACE_(olerelay)("%s",relaystr((WCHAR*)*arg));
709 else
710 TRACE_(olerelay)("<bstr NULL>");
711 }
712 if (writeit) {
713 BSTR bstr = (BSTR)*arg;
714 DWORD len;
715 if (!bstr) {
716 len = -1;
717 hres = xbuf_add(buf,(LPBYTE)&len,sizeof(DWORD));
718 if (hres) return hres;
719 } else {
720 len = *((DWORD*)bstr-1)/sizeof(WCHAR);
721 hres = xbuf_add(buf,(LPBYTE)&len,sizeof(DWORD));
722 if (hres) return hres;
723 hres = xbuf_add(buf,(LPBYTE)bstr,len * sizeof(WCHAR));
724 if (hres) return hres;
725 }
726 }
727
728 if (dealloc && arg)
729 SysFreeString((BSTR)*arg);
730 return S_OK;
731 }
732 case VT_PTR: {
733 DWORD cookie;
734 BOOL derefhere = TRUE;
735
736 if (tdesc->u.lptdesc->vt == VT_USERDEFINED) {
737 ITypeInfo *tinfo2;
738 TYPEATTR *tattr;
739
740 hres = ITypeInfo_GetRefTypeInfo(tinfo,tdesc->u.lptdesc->u.hreftype,&tinfo2);
741 if (hres) {
742 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.lptdesc->u.hreftype);
743 return hres;
744 }
745 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
746 switch (tattr->typekind) {
747 case TKIND_ALIAS:
748 if (tattr->tdescAlias.vt == VT_USERDEFINED)
749 {
750 DWORD href = tattr->tdescAlias.u.hreftype;
751 ITypeInfo_ReleaseTypeAttr(tinfo, tattr);
752 ITypeInfo_Release(tinfo2);
753 hres = ITypeInfo_GetRefTypeInfo(tinfo,href,&tinfo2);
754 if (hres) {
755 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.lptdesc->u.hreftype);
756 return hres;
757 }
758 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
759 derefhere = (tattr->typekind != TKIND_DISPATCH && tattr->typekind != TKIND_INTERFACE);
760 }
761 break;
762 case TKIND_ENUM: /* confirmed */
763 case TKIND_RECORD: /* FIXME: mostly untested */
764 break;
765 case TKIND_DISPATCH: /* will be done in VT_USERDEFINED case */
766 case TKIND_INTERFACE: /* will be done in VT_USERDEFINED case */
767 derefhere=FALSE;
768 break;
769 default:
770 FIXME("unhandled switch cases tattr->typekind %d\n", tattr->typekind);
771 derefhere=FALSE;
772 break;
773 }
774 ITypeInfo_ReleaseTypeAttr(tinfo, tattr);
775 ITypeInfo_Release(tinfo2);
776 }
777
778 if (debugout) TRACE_(olerelay)("*");
779 /* Write always, so the other side knows when it gets a NULL pointer.
780 */
781 cookie = *arg ? 0x42424242 : 0;
782 hres = xbuf_add(buf,(LPBYTE)&cookie,sizeof(cookie));
783 if (hres)
784 return hres;
785 if (!*arg) {
786 if (debugout) TRACE_(olerelay)("NULL");
787 return S_OK;
788 }
789 hres = serialize_param(tinfo,writeit,debugout,dealloc,tdesc->u.lptdesc,(DWORD*)*arg,buf);
790 if (derefhere && dealloc) HeapFree(GetProcessHeap(),0,(LPVOID)*arg);
791 return hres;
792 }
793 case VT_UNKNOWN:
794 if (debugout) TRACE_(olerelay)("unk(0x%x)",*arg);
795 if (writeit)
796 hres = _marshal_interface(buf,&IID_IUnknown,(LPUNKNOWN)*arg);
797 if (dealloc && *(IUnknown **)arg)
798 IUnknown_Release((LPUNKNOWN)*arg);
799 return hres;
800 case VT_DISPATCH:
801 if (debugout) TRACE_(olerelay)("idisp(0x%x)",*arg);
802 if (writeit)
803 hres = _marshal_interface(buf,&IID_IDispatch,(LPUNKNOWN)*arg);
804 if (dealloc && *(IUnknown **)arg)
805 IUnknown_Release((LPUNKNOWN)*arg);
806 return hres;
807 case VT_VOID:
808 if (debugout) TRACE_(olerelay)("<void>");
809 return S_OK;
810 case VT_USERDEFINED: {
811 ITypeInfo *tinfo2;
812 TYPEATTR *tattr;
813
814 hres = ITypeInfo_GetRefTypeInfo(tinfo,tdesc->u.hreftype,&tinfo2);
815 if (hres) {
816 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.hreftype);
817 return hres;
818 }
819 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
820 switch (tattr->typekind) {
821 case TKIND_DISPATCH:
822 case TKIND_INTERFACE:
823 if (writeit)
824 hres=_marshal_interface(buf,&(tattr->guid),(LPUNKNOWN)arg);
825 if (dealloc)
826 IUnknown_Release((LPUNKNOWN)arg);
827 break;
828 case TKIND_RECORD: {
829 int i;
830 if (debugout) TRACE_(olerelay)("{");
831 for (i=0;i<tattr->cVars;i++) {
832 VARDESC *vdesc;
833 ELEMDESC *elem2;
834 TYPEDESC *tdesc2;
835
836 hres = ITypeInfo2_GetVarDesc(tinfo2, i, &vdesc);
837 if (hres) {
838 ERR("Could not get vardesc of %d\n",i);
839 return hres;
840 }
841 elem2 = &vdesc->elemdescVar;
842 tdesc2 = &elem2->tdesc;
843 hres = serialize_param(
844 tinfo2,
845 writeit,
846 debugout,
847 dealloc,
848 tdesc2,
849 (DWORD*)(((LPBYTE)arg)+vdesc->u.oInst),
850 buf
851 );
852 ITypeInfo_ReleaseVarDesc(tinfo2, vdesc);
853 if (hres!=S_OK)
854 return hres;
855 if (debugout && (i<(tattr->cVars-1)))
856 TRACE_(olerelay)(",");
857 }
858 if (debugout) TRACE_(olerelay)("}");
859 break;
860 }
861 case TKIND_ALIAS:
862 hres = serialize_param(tinfo2,writeit,debugout,dealloc,&tattr->tdescAlias,arg,buf);
863 break;
864 case TKIND_ENUM:
865 hres = S_OK;
866 if (debugout) TRACE_(olerelay)("%x",*arg);
867 if (writeit)
868 hres = xbuf_add(buf,(LPBYTE)arg,sizeof(DWORD));
869 break;
870 default:
871 FIXME("Unhandled typekind %d\n",tattr->typekind);
872 hres = E_FAIL;
873 break;
874 }
875 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
876 ITypeInfo_Release(tinfo2);
877 return hres;
878 }
879 case VT_CARRAY: {
880 ARRAYDESC *adesc = tdesc->u.lpadesc;
881 int i, arrsize = 1;
882
883 if (debugout) TRACE_(olerelay)("carr");
884 for (i=0;i<adesc->cDims;i++) {
885 if (debugout) TRACE_(olerelay)("[%d]",adesc->rgbounds[i].cElements);
886 arrsize *= adesc->rgbounds[i].cElements;
887 }
888 if (debugout) TRACE_(olerelay)("(vt %s)",debugstr_vt(adesc->tdescElem.vt));
889 if (debugout) TRACE_(olerelay)("[");
890 for (i=0;i<arrsize;i++) {
891 hres = serialize_param(tinfo, writeit, debugout, dealloc, &adesc->tdescElem, (DWORD*)((LPBYTE)arg+i*_xsize(&adesc->tdescElem, tinfo)), buf);
892 if (hres)
893 return hres;
894 if (debugout && (i<arrsize-1)) TRACE_(olerelay)(",");
895 }
896 if (debugout) TRACE_(olerelay)("]");
897 return S_OK;
898 }
899 case VT_SAFEARRAY: {
900 if (writeit)
901 {
902 ULONG flags = MAKELONG(MSHCTX_DIFFERENTMACHINE, NDR_LOCAL_DATA_REPRESENTATION);
903 ULONG size = LPSAFEARRAY_UserSize(&flags, buf->curoff, (LPSAFEARRAY *)arg);
904 xbuf_resize(buf, size);
905 LPSAFEARRAY_UserMarshal(&flags, buf->base + buf->curoff, (LPSAFEARRAY *)arg);
906 buf->curoff = size;
907 }
908 return S_OK;
909 }
910 default:
911 ERR("Unhandled marshal type %d.\n",tdesc->vt);
912 return S_OK;
913 }
914 }
915
916 static HRESULT
917 deserialize_param(
918 ITypeInfo *tinfo,
919 BOOL readit,
920 BOOL debugout,
921 BOOL alloc,
922 TYPEDESC *tdesc,
923 DWORD *arg,
924 marshal_state *buf)
925 {
926 HRESULT hres = S_OK;
927 VARTYPE vartype;
928
929 TRACE("vt %s at %p\n",debugstr_vt(tdesc->vt),arg);
930
931 vartype = tdesc->vt;
932 if ((vartype & 0xf000) == VT_ARRAY)
933 vartype = VT_SAFEARRAY;
934
935 while (1) {
936 switch (vartype) {
937 case VT_EMPTY:
938 if (debugout) TRACE_(olerelay)("<empty>\n");
939 return S_OK;
940 case VT_NULL:
941 if (debugout) TRACE_(olerelay)("<null>\n");
942 return S_OK;
943 case VT_VARIANT: {
944 VARIANT *vt = (VARIANT*)arg;
945
946 if (readit) {
947 DWORD vttype;
948 TYPEDESC tdesc2;
949 hres = xbuf_get(buf,(LPBYTE)&vttype,sizeof(vttype));
950 if (hres) {
951 FIXME("vt type not read?\n");
952 return hres;
953 }
954 memset(&tdesc2,0,sizeof(tdesc2));
955 tdesc2.vt = vttype;
956 V_VT(vt) = vttype;
957 if (debugout) TRACE_(olerelay)("Vt(%s%s)(",debugstr_vt(vttype),debugstr_vf(vttype));
958 hres = deserialize_param(tinfo, readit, debugout, alloc, &tdesc2, (DWORD*)&(V_I4(vt)), buf);
959 TRACE_(olerelay)(")");
960 return hres;
961 } else {
962 VariantInit(vt);
963 return S_OK;
964 }
965 }
966 case VT_I8:
967 case VT_UI8:
968 case VT_R8:
969 case VT_CY:
970 if (readit) {
971 hres = xbuf_get(buf,(LPBYTE)arg,8);
972 if (hres) ERR("Failed to read integer 8 byte\n");
973 }
974 if (debugout) TRACE_(olerelay)("%x%x",arg[0],arg[1]);
975 return hres;
976 case VT_ERROR:
977 case VT_BOOL:
978 case VT_I4:
979 case VT_INT:
980 case VT_UINT:
981 case VT_R4:
982 case VT_UI4:
983 if (readit) {
984 hres = xbuf_get(buf,(LPBYTE)arg,sizeof(DWORD));
985 if (hres) ERR("Failed to read integer 4 byte\n");
986 }
987 if (debugout) TRACE_(olerelay)("%x",*arg);
988 return hres;
989 case VT_I2:
990 case VT_UI2:
991 if (readit) {
992 DWORD x;
993 hres = xbuf_get(buf,(LPBYTE)&x,sizeof(DWORD));
994 if (hres) ERR("Failed to read integer 4 byte\n");
995 memcpy(arg,&x,2);
996 }
997 if (debugout) TRACE_(olerelay)("%04x",*arg & 0xffff);
998 return hres;
999 case VT_I1:
1000 case VT_UI1:
1001 if (readit) {
1002 DWORD x;
1003 hres = xbuf_get(buf,(LPBYTE)&x,sizeof(DWORD));
1004 if (hres) ERR("Failed to read integer 4 byte\n");
1005 memcpy(arg,&x,1);
1006 }
1007 if (debugout) TRACE_(olerelay)("%02x",*arg & 0xff);
1008 return hres;
1009 case VT_I4|VT_BYREF:
1010 hres = S_OK;
1011 if (alloc)
1012 *arg = (DWORD)HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,sizeof(DWORD));
1013 if (readit) {
1014 hres = xbuf_get(buf,(LPBYTE)*arg,sizeof(DWORD));
1015 if (hres) ERR("Failed to read integer 4 byte\n");
1016 }
1017 if (debugout) TRACE_(olerelay)("&0x%x",*(DWORD*)*arg);
1018 return hres;
1019 case VT_BSTR|VT_BYREF: {
1020 BSTR **bstr = (BSTR **)arg;
1021 WCHAR *str;
1022 DWORD len;
1023
1024 if (readit) {
1025 hres = xbuf_get(buf,(LPBYTE)&len,sizeof(DWORD));
1026 if (hres) {
1027 ERR("failed to read bstr klen\n");
1028 return hres;
1029 }
1030 if (len == -1) {
1031 *bstr = CoTaskMemAlloc(sizeof(BSTR *));
1032 **bstr = NULL;
1033 if (debugout) TRACE_(olerelay)("<bstr NULL>");
1034 } else {
1035 str = HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,(len+1)*sizeof(WCHAR));
1036 hres = xbuf_get(buf,(LPBYTE)str,len*sizeof(WCHAR));
1037 if (hres) {
1038 ERR("Failed to read BSTR.\n");
1039 HeapFree(GetProcessHeap(),0,str);
1040 return hres;
1041 }
1042 *bstr = CoTaskMemAlloc(sizeof(BSTR *));
1043 **bstr = SysAllocStringLen(str,len);
1044 if (debugout) TRACE_(olerelay)("%s",relaystr(str));
1045 HeapFree(GetProcessHeap(),0,str);
1046 }
1047 } else {
1048 *bstr = NULL;
1049 }
1050 return S_OK;
1051 }
1052 case VT_BSTR: {
1053 WCHAR *str;
1054 DWORD len;
1055
1056 if (readit) {
1057 hres = xbuf_get(buf,(LPBYTE)&len,sizeof(DWORD));
1058 if (hres) {
1059 ERR("failed to read bstr klen\n");
1060 return hres;
1061 }
1062 if (len == -1) {
1063 *arg = 0;
1064 if (debugout) TRACE_(olerelay)("<bstr NULL>");
1065 } else {
1066 str = HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,(len+1)*sizeof(WCHAR));
1067 hres = xbuf_get(buf,(LPBYTE)str,len*sizeof(WCHAR));
1068 if (hres) {
1069 ERR("Failed to read BSTR.\n");
1070 HeapFree(GetProcessHeap(),0,str);
1071 return hres;
1072 }
1073 *arg = (DWORD)SysAllocStringLen(str,len);
1074 if (debugout) TRACE_(olerelay)("%s",relaystr(str));
1075 HeapFree(GetProcessHeap(),0,str);
1076 }
1077 } else {
1078 *arg = 0;
1079 }
1080 return S_OK;
1081 }
1082 case VT_PTR: {
1083 DWORD cookie;
1084 BOOL derefhere = TRUE;
1085
1086 if (tdesc->u.lptdesc->vt == VT_USERDEFINED) {
1087 ITypeInfo *tinfo2;
1088 TYPEATTR *tattr;
1089
1090 hres = ITypeInfo_GetRefTypeInfo(tinfo,tdesc->u.lptdesc->u.hreftype,&tinfo2);
1091 if (hres) {
1092 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.lptdesc->u.hreftype);
1093 return hres;
1094 }
1095 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
1096 switch (tattr->typekind) {
1097 case TKIND_ALIAS:
1098 if (tattr->tdescAlias.vt == VT_USERDEFINED)
1099 {
1100 DWORD href = tattr->tdescAlias.u.hreftype;
1101 ITypeInfo_ReleaseTypeAttr(tinfo, tattr);
1102 ITypeInfo_Release(tinfo2);
1103 hres = ITypeInfo_GetRefTypeInfo(tinfo,href,&tinfo2);
1104 if (hres) {
1105 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.lptdesc->u.hreftype);
1106 return hres;
1107 }
1108 ITypeInfo_GetTypeAttr(tinfo2,&tattr);
1109 derefhere = (tattr->typekind != TKIND_DISPATCH && tattr->typekind != TKIND_INTERFACE);
1110 }
1111 break;
1112 case TKIND_ENUM: /* confirmed */
1113 case TKIND_RECORD: /* FIXME: mostly untested */
1114 break;
1115 case TKIND_DISPATCH: /* will be done in VT_USERDEFINED case */
1116 case TKIND_INTERFACE: /* will be done in VT_USERDEFINED case */
1117 derefhere=FALSE;
1118 break;
1119 default:
1120 FIXME("unhandled switch cases tattr->typekind %d\n", tattr->typekind);
1121 derefhere=FALSE;
1122 break;
1123 }
1124 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
1125 ITypeInfo_Release(tinfo2);
1126 }
1127 /* read it in all cases, we need to know if we have
1128 * NULL pointer or not.
1129 */
1130 hres = xbuf_get(buf,(LPBYTE)&cookie,sizeof(cookie));
1131 if (hres) {
1132 ERR("Failed to load pointer cookie.\n");
1133 return hres;
1134 }
1135 if (cookie != 0x42424242) {
1136 /* we read a NULL ptr from the remote side */
1137 if (debugout) TRACE_(olerelay)("NULL");
1138 *arg = 0;
1139 return S_OK;
1140 }
1141 if (debugout) TRACE_(olerelay)("*");
1142 if (alloc) {
1143 /* Allocate space for the referenced struct */
1144 if (derefhere)
1145 *arg=(DWORD)HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,_xsize(tdesc->u.lptdesc, tinfo));
1146 }
1147 if (derefhere)
1148 return deserialize_param(tinfo, readit, debugout, alloc, tdesc->u.lptdesc, (LPDWORD)*arg, buf);
1149 else
1150 return deserialize_param(tinfo, readit, debugout, alloc, tdesc->u.lptdesc, arg, buf);
1151 }
1152 case VT_UNKNOWN:
1153 /* FIXME: UNKNOWN is unknown ..., but allocate 4 byte for it */
1154 if (alloc)
1155 *arg=(DWORD)HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,sizeof(DWORD));
1156 hres = S_OK;
1157 if (readit)
1158 hres = _unmarshal_interface(buf,&IID_IUnknown,(LPUNKNOWN*)arg);
1159 if (debugout)
1160 TRACE_(olerelay)("unk(%p)",arg);
1161 return hres;
1162 case VT_DISPATCH:
1163 hres = S_OK;
1164 if (readit)
1165 hres = _unmarshal_interface(buf,&IID_IDispatch,(LPUNKNOWN*)arg);
1166 if (debugout)
1167 TRACE_(olerelay)("idisp(%p)",arg);
1168 return hres;
1169 case VT_VOID:
1170 if (debugout) TRACE_(olerelay)("<void>");
1171 return S_OK;
1172 case VT_USERDEFINED: {
1173 ITypeInfo *tinfo2;
1174 TYPEATTR *tattr;
1175
1176 hres = ITypeInfo_GetRefTypeInfo(tinfo,tdesc->u.hreftype,&tinfo2);
1177 if (hres) {
1178 ERR("Could not get typeinfo of hreftype %x for VT_USERDEFINED.\n",tdesc->u.hreftype);
1179 return hres;
1180 }
1181 hres = ITypeInfo_GetTypeAttr(tinfo2,&tattr);
1182 if (hres) {
1183 ERR("Could not get typeattr in VT_USERDEFINED.\n");
1184 } else {
1185 switch (tattr->typekind) {
1186 case TKIND_DISPATCH:
1187 case TKIND_INTERFACE:
1188 if (readit)
1189 hres = _unmarshal_interface(buf,&(tattr->guid),(LPUNKNOWN*)arg);
1190 break;
1191 case TKIND_RECORD: {
1192 int i;
1193
1194 if (debugout) TRACE_(olerelay)("{");
1195 for (i=0;i<tattr->cVars;i++) {
1196 VARDESC *vdesc;
1197
1198 hres = ITypeInfo2_GetVarDesc(tinfo2, i, &vdesc);
1199 if (hres) {
1200 ERR("Could not get vardesc of %d\n",i);
1201 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
1202 ITypeInfo_Release(tinfo2);
1203 return hres;
1204 }
1205 hres = deserialize_param(
1206 tinfo2,
1207 readit,
1208 debugout,
1209 alloc,
1210 &vdesc->elemdescVar.tdesc,
1211 (DWORD*)(((LPBYTE)arg)+vdesc->u.oInst),
1212 buf
1213 );
1214 ITypeInfo2_ReleaseVarDesc(tinfo2, vdesc);
1215 if (debugout && (i<tattr->cVars-1)) TRACE_(olerelay)(",");
1216 }
1217 if (debugout) TRACE_(olerelay)("}");
1218 break;
1219 }
1220 case TKIND_ALIAS:
1221 hres = deserialize_param(tinfo2,readit,debugout,alloc,&tattr->tdescAlias,arg,buf);
1222 break;
1223 case TKIND_ENUM:
1224 if (readit) {
1225 hres = xbuf_get(buf,(LPBYTE)arg,sizeof(DWORD));
1226 if (hres) ERR("Failed to read enum (4 byte)\n");
1227 }
1228 if (debugout) TRACE_(olerelay)("%x",*arg);
1229 break;
1230 default:
1231 ERR("Unhandled typekind %d\n",tattr->typekind);
1232 hres = E_FAIL;
1233 break;
1234 }
1235 ITypeInfo_ReleaseTypeAttr(tinfo2, tattr);
1236 }
1237 if (hres)
1238 ERR("failed to stuballoc in TKIND_RECORD.\n");
1239 ITypeInfo_Release(tinfo2);
1240 return hres;
1241 }
1242 case VT_CARRAY: {
1243 /* arg is pointing to the start of the array. */
1244 ARRAYDESC *adesc = tdesc->u.lpadesc;
1245 int arrsize,i;
1246 arrsize = 1;
1247 if (adesc->cDims > 1) FIXME("cDims > 1 in VT_CARRAY. Does it work?\n");
1248 for (i=0;i<adesc->cDims;i++)
1249 arrsize *= adesc->rgbounds[i].cElements;
1250 for (i=0;i<arrsize;i++)
1251 deserialize_param(
1252 tinfo,
1253 readit,
1254 debugout,
1255 alloc,
1256 &adesc->tdescElem,
1257 (DWORD*)((LPBYTE)(arg)+i*_xsize(&adesc->tdescElem, tinfo)),
1258 buf
1259 );
1260 return S_OK;
1261 }
1262 case VT_SAFEARRAY: {
1263 if (readit)
1264 {
1265 ULONG flags = MAKELONG(MSHCTX_DIFFERENTMACHINE, NDR_LOCAL_DATA_REPRESENTATION);
1266 unsigned char *buffer;
1267 buffer = LPSAFEARRAY_UserUnmarshal(&flags, buf->base + buf->curoff, (LPSAFEARRAY *)arg);
1268 buf->curoff = buffer - buf->base;
1269 }
1270 return S_OK;
1271 }
1272 default:
1273 ERR("No handler for VT type %d!\n",tdesc->vt);
1274 return S_OK;
1275 }
1276 }
1277 }
1278
1279 /* Retrieves a function's funcdesc, searching back into inherited interfaces. */
1280 static HRESULT get_funcdesc(ITypeInfo *tinfo, int iMethod, ITypeInfo **tactual, const FUNCDESC **fdesc,
1281 BSTR *iname, BSTR *fname, UINT *num)
1282 {
1283 HRESULT hr;
1284 UINT i, impl_types;
1285 UINT inherited_funcs = 0;
1286 TYPEATTR *attr;
1287
1288 if (fname) *fname = NULL;
1289 if (iname) *iname = NULL;
1290 if (num) *num = 0;
1291 *tactual = NULL;
1292
1293 hr = ITypeInfo_GetTypeAttr(tinfo, &attr);
1294 if (FAILED(hr))
1295 {
1296 ERR("GetTypeAttr failed with %x\n",hr);
1297 return hr;
1298 }
1299
1300 if(attr->typekind == TKIND_DISPATCH)
1301 {
1302 if(attr->wTypeFlags & TYPEFLAG_FDUAL)
1303 {
1304 HREFTYPE href;
1305 ITypeInfo *tinfo2;
1306
1307 hr = ITypeInfo_GetRefTypeOfImplType(tinfo, -1, &href);
1308 if(FAILED(hr))
1309 {
1310 ERR("Cannot get interface href from dual dispinterface\n");
1311 ITypeInfo_ReleaseTypeAttr(tinfo, attr);
1312 return hr;
1313 }
1314 hr = ITypeInfo_GetRefTypeInfo(tinfo, href, &tinfo2);
1315 if(FAILED(hr))
1316 {
1317 ERR("Cannot get interface from dual dispinterface\n");
1318 ITypeInfo_ReleaseTypeAttr(tinfo, attr);
1319 return hr;
1320 }
1321 hr = get_funcdesc(tinfo2, iMethod, tactual, fdesc, iname, fname, num);
1322 ITypeInfo_Release(tinfo2);
1323 ITypeInfo_ReleaseTypeAttr(tinfo, attr);
1324 return hr;
1325 }
1326 ERR("Shouldn't be called with a non-dual dispinterface\n");
1327 return E_FAIL;
1328 }
1329
1330 impl_types = attr->cImplTypes;
1331 ITypeInfo_ReleaseTypeAttr(tinfo, attr);
1332
1333 for (i = 0; i < impl_types; i++)
1334 {
1335 HREFTYPE href;
1336 ITypeInfo *pSubTypeInfo;
1337 UINT sub_funcs;
1338
1339 hr = ITypeInfo_GetRefTypeOfImplType(tinfo, i, &href);
1340 if (FAILED(hr)) return hr;
1341 hr = ITypeInfo_GetRefTypeInfo(tinfo, href, &pSubTypeInfo);
1342 if (FAILED(hr)) return hr;
1343
1344 hr = get_funcdesc(pSubTypeInfo, iMethod, tactual, fdesc, iname, fname, &sub_funcs);
1345 inherited_funcs += sub_funcs;
1346 ITypeInfo_Release(pSubTypeInfo);
1347 if(SUCCEEDED(hr)) return hr;
1348 }
1349 if(iMethod < inherited_funcs)
1350 {
1351 ERR("shouldn't be here\n");
1352 return E_INVALIDARG;
1353 }
1354
1355 for(i = inherited_funcs; i <= iMethod; i++)
1356 {
1357 hr = ITypeInfoImpl_GetInternalFuncDesc(tinfo, i - inherited_funcs, fdesc);
1358 if(FAILED(hr))
1359 {
1360 if(num) *num = i;
1361 return hr;
1362 }
1363 }
1364
1365 /* found it. We don't care about num so zero it */
1366 if(num) *num = 0;
1367 *tactual = tinfo;
1368 ITypeInfo_AddRef(*tactual);
1369 if (fname) ITypeInfo_GetDocumentation(tinfo,(*fdesc)->memid,fname,NULL,NULL,NULL);
1370 if (iname) ITypeInfo_GetDocumentation(tinfo,-1,iname,NULL,NULL,NULL);
1371 return S_OK;
1372 }
1373
1374 static inline BOOL is_in_elem(const ELEMDESC *elem)
1375 {
1376 return (elem->u.paramdesc.wParamFlags & PARAMFLAG_FIN || !elem->u.paramdesc.wParamFlags);
1377 }
1378
1379 static inline BOOL is_out_elem(const ELEMDESC *elem)
1380 {
1381 return (elem->u.paramdesc.wParamFlags & PARAMFLAG_FOUT || !elem->u.paramdesc.wParamFlags);
1382 }
1383
1384 static DWORD
1385 xCall(LPVOID retptr, int method, TMProxyImpl *tpinfo /*, args */)
1386 {
1387 DWORD *args = ((DWORD*)&tpinfo)+1, *xargs;
1388 const FUNCDESC *fdesc;
1389 HRESULT hres;
1390 int i, relaydeb = TRACE_ON(olerelay);
1391 marshal_state buf;
1392 RPCOLEMESSAGE msg;
1393 ULONG status;
1394 BSTR fname,iname;
1395 BSTR names[10];
1396 UINT nrofnames;
1397 DWORD remoteresult = 0;
1398 ITypeInfo *tinfo;
1399 IRpcChannelBuffer *chanbuf;
1400
1401 EnterCriticalSection(&tpinfo->crit);
1402
1403 hres = get_funcdesc(tpinfo->tinfo,method,&tinfo,&fdesc,&iname,&fname,NULL);
1404 if (hres) {
1405 ERR("Did not find typeinfo/funcdesc entry for method %d!\n",method);
1406 LeaveCriticalSection(&tpinfo->crit);
1407 return E_FAIL;
1408 }
1409
1410 if (!tpinfo->chanbuf)
1411 {
1412 WARN("Tried to use disconnected proxy\n");
1413 ITypeInfo_Release(tinfo);
1414 LeaveCriticalSection(&tpinfo->crit);
1415 return RPC_E_DISCONNECTED;
1416 }
1417 chanbuf = tpinfo->chanbuf;
1418 IRpcChannelBuffer_AddRef(chanbuf);
1419
1420 LeaveCriticalSection(&tpinfo->crit);
1421
1422 if (relaydeb) {
1423 TRACE_(olerelay)("->");
1424 if (iname)
1425 TRACE_(olerelay)("%s:",relaystr(iname));
1426 if (fname)
1427 TRACE_(olerelay)("%s(%d)",relaystr(fname),method);
1428 else
1429 TRACE_(olerelay)("%d",method);
1430 TRACE_(olerelay)("(");
1431 }
1432
1433 SysFreeString(iname);
1434 SysFreeString(fname);
1435
1436 memset(&buf,0,sizeof(buf));
1437
1438 /* normal typelib driven serializing */
1439
1440 /* Need them for hack below */
1441 memset(names,0,sizeof(names));
1442 if (ITypeInfo_GetNames(tinfo,fdesc->memid,names,sizeof(names)/sizeof(names[0]),&nrofnames))
1443 nrofnames = 0;
1444 if (nrofnames > sizeof(names)/sizeof(names[0]))
1445 ERR("Need more names!\n");
1446
1447 xargs = args;
1448 for (i=0;i<fdesc->cParams;i++) {
1449 ELEMDESC *elem = fdesc->lprgelemdescParam+i;
1450 if (relaydeb) {
1451 if (i) TRACE_(olerelay)(",");
1452 if (i+1<nrofnames && names[i+1])
1453 TRACE_(olerelay)("%s=",relaystr(names[i+1]));
1454 }
1455 /* No need to marshal other data than FIN and any VT_PTR. */
1456 if (!is_in_elem(elem) && (elem->tdesc.vt != VT_PTR)) {
1457 xargs+=_argsize(&elem->tdesc, tinfo);
1458 if (relaydeb) TRACE_(olerelay)("[out]");
1459 continue;
1460 }
1461 hres = serialize_param(
1462 tinfo,
1463 is_in_elem(elem),
1464 relaydeb,
1465 FALSE,
1466 &elem->tdesc,
1467 xargs,
1468 &buf
1469 );
1470
1471 if (hres) {
1472 ERR("Failed to serialize param, hres %x\n",hres);
1473 break;
1474 }
1475 xargs+=_argsize(&elem->tdesc, tinfo);
1476 }
1477 if (relaydeb) TRACE_(olerelay)(")");
1478
1479 memset(&msg,0,sizeof(msg));
1480 msg.cbBuffer = buf.curoff;
1481 msg.iMethod = method;
1482 hres = IRpcChannelBuffer_GetBuffer(chanbuf,&msg,&(tpinfo->iid));
1483 if (hres) {
1484 ERR("RpcChannelBuffer GetBuffer failed, %x\n",hres);
1485 goto exit;
1486 }
1487 memcpy(msg.Buffer,buf.base,buf.curoff);
1488 if (relaydeb) TRACE_(olerelay)("\n");
1489 hres = IRpcChannelBuffer_SendReceive(chanbuf,&msg,&status);
1490 if (hres) {
1491 ERR("RpcChannelBuffer SendReceive failed, %x\n",hres);
1492 goto exit;
1493 }
1494
1495 if (relaydeb) TRACE_(olerelay)(" status = %08x (",status);
1496 if (buf.base)
1497 buf.base = HeapReAlloc(GetProcessHeap(),0,buf.base,msg.cbBuffer);
1498 else
1499 buf.base = HeapAlloc(GetProcessHeap(),0,msg.cbBuffer);
1500 buf.size = msg.cbBuffer;
1501 memcpy(buf.base,msg.Buffer,buf.size);
1502 buf.curoff = 0;
1503
1504 /* generic deserializer using typelib description */
1505 xargs = args;
1506 status = S_OK;
1507 for (i=0;i<fdesc->cParams;i++) {
1508 ELEMDESC *elem = fdesc->lprgelemdescParam+i;
1509
1510 if (relaydeb) {
1511 if (i) TRACE_(olerelay)(",");
1512 if (i+1<nrofnames && names[i+1]) TRACE_(olerelay)("%s=",relaystr(names[i+1]));
1513 }
1514 /* No need to marshal other data than FOUT and any VT_PTR */
1515 if (!is_out_elem(elem) && (elem->tdesc.vt != VT_PTR)) {
1516 xargs += _argsize(&elem->tdesc, tinfo);
1517 if (relaydeb) TRACE_(olerelay)("[in]");
1518 continue;
1519 }
1520 hres = deserialize_param(
1521 tinfo,
1522 is_out_elem(elem),
1523 relaydeb,
1524 FALSE,
1525 &(elem->tdesc),
1526 xargs,
1527 &buf
1528 );
1529 if (hres) {
1530 ERR("Failed to unmarshall param, hres %x\n",hres);
1531 status = hres;
1532 break;
1533 }
1534 xargs += _argsize(&elem->tdesc, tinfo);
1535 }
1536
1537 hres = xbuf_get(&buf, (LPBYTE)&remoteresult, sizeof(DWORD));
1538 if (hres != S_OK)
1539 goto exit;
1540 if (relaydeb) TRACE_(olerelay)(") = %08x\n", remoteresult);
1541
1542 hres = remoteresult;
1543
1544 exit:
1545 IRpcChannelBuffer_FreeBuffer(chanbuf,&msg);
1546 for (i = 0; i < nrofnames; i++)
1547 SysFreeString(names[i]);
1548 HeapFree(GetProcessHeap(),0,buf.base);
1549 IRpcChannelBuffer_Release(chanbuf);
1550 ITypeInfo_Release(tinfo);
1551 TRACE("-- 0x%08x\n", hres);
1552 return hres;
1553 }
1554
1555 static HRESULT WINAPI ProxyIUnknown_QueryInterface(IUnknown *iface, REFIID riid, void **ppv)
1556 {
1557 TMProxyImpl *proxy = (TMProxyImpl *)iface;
1558
1559 TRACE("(%s, %p)\n", debugstr_guid(riid), ppv);
1560
1561 if (proxy->outerunknown)
1562 return IUnknown_QueryInterface(proxy->outerunknown, riid, ppv);
1563
1564 FIXME("No interface\n");
1565 return E_NOINTERFACE;
1566 }
1567
1568 static ULONG WINAPI ProxyIUnknown_AddRef(IUnknown *iface)
1569 {
1570 TMProxyImpl *proxy = (TMProxyImpl *)iface;
1571
1572 TRACE("\n");
1573
1574 if (proxy->outerunknown)
1575 return IUnknown_AddRef(proxy->outerunknown);
1576
1577 return 2; /* FIXME */
1578 }
1579
1580 static ULONG WINAPI ProxyIUnknown_Release(IUnknown *iface)
1581 {
1582 TMProxyImpl *proxy = (TMProxyImpl *)iface;
1583
1584 TRACE("\n");
1585
1586 if (proxy->outerunknown)
1587 return IUnknown_Release(proxy->outerunknown);
1588
1589 return 1; /* FIXME */
1590 }
1591
1592 static HRESULT WINAPI ProxyIDispatch_GetTypeInfoCount(LPDISPATCH iface, UINT * pctinfo)
1593 {
1594 TMProxyImpl *This = (TMProxyImpl *)iface;
1595
1596 TRACE("(%p)\n", pctinfo);
1597
1598 return IDispatch_GetTypeInfoCount(This->dispatch, pctinfo);
1599 }
1600
1601 static HRESULT WINAPI ProxyIDispatch_GetTypeInfo(LPDISPATCH iface, UINT iTInfo, LCID lcid, ITypeInfo** ppTInfo)
1602 {
1603 TMProxyImpl *This = (TMProxyImpl *)iface;
1604
1605 TRACE("(%d, %x, %p)\n", iTInfo, lcid, ppTInfo);
1606
1607 return IDispatch_GetTypeInfo(This->dispatch, iTInfo, lcid, ppTInfo);
1608 }
1609
1610 static HRESULT WINAPI ProxyIDispatch_GetIDsOfNames(LPDISPATCH iface, REFIID riid, LPOLESTR * rgszNames, UINT cNames, LCID lcid, DISPID * rgDispId)
1611 {
1612 TMProxyImpl *This = (TMProxyImpl *)iface;
1613
1614 TRACE("(%s, %p, %d, 0x%x, %p)\n", debugstr_guid(riid), rgszNames, cNames, lcid, rgDispId);
1615
1616 return IDispatch_GetIDsOfNames(This->dispatch, riid, rgszNames,
1617 cNames, lcid, rgDispId);
1618 }
1619
1620 static HRESULT WINAPI ProxyIDispatch_Invoke(LPDISPATCH iface, DISPID dispIdMember, REFIID riid, LCID lcid,
1621 WORD wFlags, DISPPARAMS * pDispParams, VARIANT * pVarResult,
1622 EXCEPINFO * pExcepInfo, UINT * puArgErr)
1623 {
1624 TMProxyImpl *This = (TMProxyImpl *)iface;
1625
1626 TRACE("(%d, %s, 0x%x, 0x%x, %p, %p, %p, %p)\n", dispIdMember,
1627 debugstr_guid(riid), lcid, wFlags, pDispParams, pVarResult,
1628 pExcepInfo, puArgErr);
1629
1630 return IDispatch_Invoke(This->dispatch, dispIdMember, riid, lcid,
1631 wFlags, pDispParams, pVarResult, pExcepInfo,
1632 puArgErr);
1633 }
1634
1635 typedef struct
1636 {
1637 const IRpcChannelBufferVtbl *lpVtbl;
1638 LONG refs;
1639 /* the IDispatch-derived interface we are handling */
1640 IID tmarshal_iid;
1641 IRpcChannelBuffer *pDelegateChannel;
1642 } TMarshalDispatchChannel;
1643
1644 static HRESULT WINAPI TMarshalDispatchChannel_QueryInterface(LPRPCCHANNELBUFFER iface, REFIID riid, LPVOID *ppv)
1645 {
1646 *ppv = NULL;
1647 if (IsEqualIID(riid,&IID_IRpcChannelBuffer) || IsEqualIID(riid,&IID_IUnknown))
1648 {
1649 *ppv = iface;
1650 IUnknown_AddRef(iface);
1651 return S_OK;
1652 }
1653 return E_NOINTERFACE;
1654 }
1655
1656 static ULONG WINAPI TMarshalDispatchChannel_AddRef(LPRPCCHANNELBUFFER iface)
1657 {
1658 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1659 return InterlockedIncrement(&This->refs);
1660 }
1661
1662 static ULONG WINAPI TMarshalDispatchChannel_Release(LPRPCCHANNELBUFFER iface)
1663 {
1664 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1665 ULONG ref;
1666
1667 ref = InterlockedDecrement(&This->refs);
1668 if (ref)
1669 return ref;
1670
1671 IRpcChannelBuffer_Release(This->pDelegateChannel);
1672 HeapFree(GetProcessHeap(), 0, This);
1673 return 0;
1674 }
1675
1676 static HRESULT WINAPI TMarshalDispatchChannel_GetBuffer(LPRPCCHANNELBUFFER iface, RPCOLEMESSAGE* olemsg, REFIID riid)
1677 {
1678 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1679 TRACE("(%p, %s)\n", olemsg, debugstr_guid(riid));
1680 /* Note: we are pretending to invoke a method on the interface identified
1681 * by tmarshal_iid so that we can re-use the IDispatch proxy/stub code
1682 * without the RPC runtime getting confused by not exporting an IDispatch interface */
1683 return IRpcChannelBuffer_GetBuffer(This->pDelegateChannel, olemsg, &This->tmarshal_iid);
1684 }
1685
1686 static HRESULT WINAPI TMarshalDispatchChannel_SendReceive(LPRPCCHANNELBUFFER iface, RPCOLEMESSAGE *olemsg, ULONG *pstatus)
1687 {
1688 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1689 TRACE("(%p, %p)\n", olemsg, pstatus);
1690 return IRpcChannelBuffer_SendReceive(This->pDelegateChannel, olemsg, pstatus);
1691 }
1692
1693 static HRESULT WINAPI TMarshalDispatchChannel_FreeBuffer(LPRPCCHANNELBUFFER iface, RPCOLEMESSAGE* olemsg)
1694 {
1695 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1696 TRACE("(%p)\n", olemsg);
1697 return IRpcChannelBuffer_FreeBuffer(This->pDelegateChannel, olemsg);
1698 }
1699
1700 static HRESULT WINAPI TMarshalDispatchChannel_GetDestCtx(LPRPCCHANNELBUFFER iface, DWORD* pdwDestContext, void** ppvDestContext)
1701 {
1702 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1703 TRACE("(%p,%p)\n", pdwDestContext, ppvDestContext);
1704 return IRpcChannelBuffer_GetDestCtx(This->pDelegateChannel, pdwDestContext, ppvDestContext);
1705 }
1706
1707 static HRESULT WINAPI TMarshalDispatchChannel_IsConnected(LPRPCCHANNELBUFFER iface)
1708 {
1709 TMarshalDispatchChannel *This = (TMarshalDispatchChannel *)iface;
1710 TRACE("()\n");
1711 return IRpcChannelBuffer_IsConnected(This->pDelegateChannel);
1712 }
1713
1714 static const IRpcChannelBufferVtbl TMarshalDispatchChannelVtbl =
1715 {
1716 TMarshalDispatchChannel_QueryInterface,
1717 TMarshalDispatchChannel_AddRef,
1718 TMarshalDispatchChannel_Release,
1719 TMarshalDispatchChannel_GetBuffer,
1720 TMarshalDispatchChannel_SendReceive,
1721 TMarshalDispatchChannel_FreeBuffer,
1722 TMarshalDispatchChannel_GetDestCtx,
1723 TMarshalDispatchChannel_IsConnected
1724 };
1725
1726 static HRESULT TMarshalDispatchChannel_Create(
1727 IRpcChannelBuffer *pDelegateChannel, REFIID tmarshal_riid,
1728 IRpcChannelBuffer **ppChannel)
1729 {
1730 TMarshalDispatchChannel *This = HeapAlloc(GetProcessHeap(), 0, sizeof(*This));
1731 if (!This)
1732 return E_OUTOFMEMORY;
1733
1734 This->lpVtbl = &TMarshalDispatchChannelVtbl;
1735 This->refs = 1;
1736 IRpcChannelBuffer_AddRef(pDelegateChannel);
1737 This->pDelegateChannel = pDelegateChannel;
1738 This->tmarshal_iid = *tmarshal_riid;
1739
1740 *ppChannel = (IRpcChannelBuffer *)&This->lpVtbl;
1741 return S_OK;
1742 }
1743
1744
1745 static inline HRESULT get_facbuf_for_iid(REFIID riid, IPSFactoryBuffer **facbuf)
1746 {
1747 HRESULT hr;
1748 CLSID clsid;
1749
1750 if ((hr = CoGetPSClsid(riid, &clsid)))
1751 return hr;
1752 return CoGetClassObject(&clsid, CLSCTX_INPROC_SERVER, NULL,
1753 &IID_IPSFactoryBuffer, (LPVOID*)facbuf);
1754 }
1755
1756 static HRESULT init_proxy_entry_point(TMProxyImpl *proxy, unsigned int num)
1757 {
1758 int j;
1759 /* nrofargs without This */
1760 int nrofargs;
1761 ITypeInfo *tinfo2;
1762 TMAsmProxy *xasm = proxy->asmstubs + num;
1763 HRESULT hres;
1764 const FUNCDESC *fdesc;
1765
1766 hres = get_funcdesc(proxy->tinfo, num, &tinfo2, &fdesc, NULL, NULL, NULL);
1767 if (hres) {
1768 ERR("GetFuncDesc %x should not fail here.\n",hres);
1769 return hres;
1770 }
1771 ITypeInfo_Release(tinfo2);
1772 /* some args take more than 4 byte on the stack */
1773 nrofargs = 0;
1774 for (j=0;j<fdesc->cParams;j++)
1775 nrofargs += _argsize(&fdesc->lprgelemdescParam[j].tdesc, proxy->tinfo);
1776
1777 #ifdef __i386__
1778 if (fdesc->callconv != CC_STDCALL) {
1779 ERR("calling convention is not stdcall????\n");
1780 return E_FAIL;
1781 }
1782 /* popl %eax - return ptr
1783 * pushl <nr>
1784 * pushl %eax
1785 * call xCall
1786 * lret <nr> (+4)
1787 *
1788 *
1789 * arg3 arg2 arg1 <method> <returnptr>
1790 */
1791 xasm->popleax = 0x58;
1792 xasm->pushlval = 0x68;
1793 xasm->nr = num;
1794 xasm->pushleax = 0x50;
1795 xasm->lcall = 0xe8; /* relative jump */
1796 xasm->xcall = (DWORD)xCall;
1797 xasm->xcall -= (DWORD)&(xasm->lret);
1798 xasm->lret = 0xc2;
1799 xasm->bytestopop = (nrofargs+2)*4; /* pop args, This, iMethod */
1800 xasm->nop = 0x90;
1801 proxy->lpvtbl[num] = xasm;
1802 #else
1803 FIXME("not implemented on non i386\n");
1804 return E_FAIL;
1805 #endif
1806 return S_OK;
1807 }
1808
1809 static HRESULT WINAPI
1810 PSFacBuf_CreateProxy(
1811 LPPSFACTORYBUFFER iface, IUnknown* pUnkOuter, REFIID riid,
1812 IRpcProxyBuffer **ppProxy, LPVOID *ppv)
1813 {
1814 HRESULT hres;
1815 ITypeInfo *tinfo;
1816 unsigned int i, nroffuncs;
1817 TMProxyImpl *proxy;
1818 TYPEATTR *typeattr;
1819 BOOL defer_to_dispatch = FALSE;
1820
1821 TRACE("(...%s...)\n",debugstr_guid(riid));
1822 hres = _get_typeinfo_for_iid(riid,&tinfo);
1823 if (hres) {
1824 ERR("No typeinfo for %s?\n",debugstr_guid(riid));
1825 return hres;
1826 }
1827
1828 hres = num_of_funcs(tinfo, &nroffuncs);
1829 if (FAILED(hres)) {
1830 ERR("Cannot get number of functions for typeinfo %s\n",debugstr_guid(riid));
1831 ITypeInfo_Release(tinfo);
1832 return hres;
1833 }
1834
1835 proxy = CoTaskMemAlloc(sizeof(TMProxyImpl));
1836 if (!proxy) return E_OUTOFMEMORY;
1837
1838 assert(sizeof(TMAsmProxy) == 16);
1839
1840 proxy->dispatch = NULL;
1841 proxy->dispatch_proxy = NULL;
1842 proxy->outerunknown = pUnkOuter;
1843 proxy->asmstubs = VirtualAlloc(NULL, sizeof(TMAsmProxy) * nroffuncs, MEM_COMMIT, PAGE_EXECUTE_READWRITE);
1844 if (!proxy->asmstubs) {
1845 ERR("Could not commit pages for proxy thunks\n");
1846 CoTaskMemFree(proxy);
1847 return E_OUTOFMEMORY;
1848 }
1849 proxy->lpvtbl2 = &tmproxyvtable;
1850 /* one reference for the proxy */
1851 proxy->ref = 1;
1852 proxy->tinfo = tinfo;
1853 proxy->iid = *riid;
1854 proxy->chanbuf = 0;
1855
1856 InitializeCriticalSection(&proxy->crit);
1857 proxy->crit.DebugInfo->Spare[0] = (DWORD_PTR)(__FILE__ ": TMProxyImpl.crit");
1858
1859 proxy->lpvtbl = HeapAlloc(GetProcessHeap(),0,sizeof(LPBYTE)*nroffuncs);
1860
1861 /* if we derive from IDispatch then defer to its proxy for its methods */
1862 hres = ITypeInfo_GetTypeAttr(tinfo, &typeattr);
1863 if (hres == S_OK)
1864 {
1865 if (typeattr->wTypeFlags & TYPEFLAG_FDISPATCHABLE)
1866 {
1867 IPSFactoryBuffer *factory_buffer;
1868 hres = get_facbuf_for_iid(&IID_IDispatch, &factory_buffer);
1869 if (hres == S_OK)
1870 {
1871 hres = IPSFactoryBuffer_CreateProxy(factory_buffer, NULL,
1872 &IID_IDispatch, &proxy->dispatch_proxy,
1873 (void **)&proxy->dispatch);
1874 IPSFactoryBuffer_Release(factory_buffer);
1875 }
1876 if ((hres == S_OK) && (nroffuncs < 7))
1877 {
1878 ERR("nroffuncs calculated incorrectly (%d)\n", nroffuncs);
1879 hres = E_UNEXPECTED;
1880 }
1881 if (hres == S_OK)
1882 {
1883 defer_to_dispatch = TRUE;
1884 }
1885 }
1886 ITypeInfo_ReleaseTypeAttr(tinfo, typeattr);
1887 }
1888
1889 for (i=0;i<nroffuncs;i++) {
1890 switch (i) {
1891 case 0:
1892 proxy->lpvtbl[i] = ProxyIUnknown_QueryInterface;
1893 break;
1894 case 1:
1895 proxy->lpvtbl[i] = ProxyIUnknown_AddRef;
1896 break;
1897 case 2:
1898 proxy->lpvtbl[i] = ProxyIUnknown_Release;
1899 break;
1900 case 3:
1901 if(!defer_to_dispatch)
1902 {
1903 hres = init_proxy_entry_point(proxy, i);
1904 if(FAILED(hres)) return hres;
1905 }
1906 else proxy->lpvtbl[3] = ProxyIDispatch_GetTypeInfoCount;
1907 break;
1908 case 4:
1909 if(!defer_to_dispatch)
1910 {
1911 hres = init_proxy_entry_point(proxy, i);
1912 if(FAILED(hres)) return hres;
1913 }
1914 else proxy->lpvtbl[4] = ProxyIDispatch_GetTypeInfo;
1915 break;
1916 case 5:
1917 if(!defer_to_dispatch)
1918 {
1919 hres = init_proxy_entry_point(proxy, i);
1920 if(FAILED(hres)) return hres;
1921 }
1922 else proxy->lpvtbl[5] = ProxyIDispatch_GetIDsOfNames;
1923 break;
1924 case 6:
1925 if(!defer_to_dispatch)
1926 {
1927 hres = init_proxy_entry_point(proxy, i);
1928 if(FAILED(hres)) return hres;
1929 }
1930 else proxy->lpvtbl[6] = ProxyIDispatch_Invoke;
1931 break;
1932 default:
1933 hres = init_proxy_entry_point(proxy, i);
1934 if(FAILED(hres)) return hres;
1935 }
1936 }
1937
1938 if (hres == S_OK)
1939 {
1940 *ppv = proxy;
1941 *ppProxy = (IRpcProxyBuffer *)&(proxy->lpvtbl2);
1942 IUnknown_AddRef((IUnknown *)*ppv);
1943 return S_OK;
1944 }
1945 else
1946 TMProxyImpl_Release((IRpcProxyBuffer *)&proxy->lpvtbl2);
1947 return hres;
1948 }
1949
1950 typedef struct _TMStubImpl {
1951 const IRpcStubBufferVtbl *lpvtbl;
1952 LONG ref;
1953
1954 LPUNKNOWN pUnk;
1955 ITypeInfo *tinfo;
1956 IID iid;
1957 IRpcStubBuffer *dispatch_stub;
1958 BOOL dispatch_derivative;
1959 } TMStubImpl;
1960
1961 static HRESULT WINAPI
1962 TMStubImpl_QueryInterface(LPRPCSTUBBUFFER iface, REFIID riid, LPVOID *ppv)
1963 {
1964 if (IsEqualIID(riid,&IID_IRpcStubBuffer)||IsEqualIID(riid,&IID_IUnknown)){
1965 *ppv = iface;
1966 IRpcStubBuffer_AddRef(iface);
1967 return S_OK;
1968 }
1969 FIXME("%s, not supported IID.\n",debugstr_guid(riid));
1970 return E_NOINTERFACE;
1971 }
1972
1973 static ULONG WINAPI
1974 TMStubImpl_AddRef(LPRPCSTUBBUFFER iface)
1975 {
1976 TMStubImpl *This = (TMStubImpl *)iface;
1977 ULONG refCount = InterlockedIncrement(&This->ref);
1978
1979 TRACE("(%p)->(ref before=%u)\n", This, refCount - 1);
1980
1981 return refCount;
1982 }
1983
1984 static ULONG WINAPI
1985 TMStubImpl_Release(LPRPCSTUBBUFFER iface)
1986 {
1987 TMStubImpl *This = (TMStubImpl *)iface;
1988 ULONG refCount = InterlockedDecrement(&This->ref);
1989
1990 TRACE("(%p)->(ref before=%u)\n", This, refCount + 1);
1991
1992 if (!refCount)
1993 {
1994 IRpcStubBuffer_Disconnect(iface);
1995 ITypeInfo_Release(This->tinfo);
1996 if (This->dispatch_stub)
1997 IRpcStubBuffer_Release(This->dispatch_stub);
1998 CoTaskMemFree(This);
1999 }
2000 return refCount;
2001 }
2002
2003 static HRESULT WINAPI
2004 TMStubImpl_Connect(LPRPCSTUBBUFFER iface, LPUNKNOWN pUnkServer)
2005 {
2006 TMStubImpl *This = (TMStubImpl *)iface;
2007
2008 TRACE("(%p)->(%p)\n", This, pUnkServer);
2009
2010 IUnknown_AddRef(pUnkServer);
2011 This->pUnk = pUnkServer;
2012
2013 if (This->dispatch_stub)
2014 IRpcStubBuffer_Connect(This->dispatch_stub, pUnkServer);
2015
2016 return S_OK;
2017 }
2018
2019 static void WINAPI
2020 TMStubImpl_Disconnect(LPRPCSTUBBUFFER iface)
2021 {
2022 TMStubImpl *This = (TMStubImpl *)iface;
2023
2024 TRACE("(%p)->()\n", This);
2025
2026 if (This->pUnk)
2027 {
2028 IUnknown_Release(This->pUnk);
2029 This->pUnk = NULL;
2030 }
2031
2032 if (This->dispatch_stub)
2033 IRpcStubBuffer_Disconnect(This->dispatch_stub);
2034 }
2035
2036 static HRESULT WINAPI
2037 TMStubImpl_Invoke(
2038 LPRPCSTUBBUFFER iface, RPCOLEMESSAGE* xmsg,IRpcChannelBuffer*rpcchanbuf)
2039 {
2040 int i;
2041 const FUNCDESC *fdesc;
2042 TMStubImpl *This = (TMStubImpl *)iface;
2043 HRESULT hres;
2044 DWORD *args = NULL, res, *xargs, nrofargs;
2045 marshal_state buf;
2046 UINT nrofnames = 0;
2047 BSTR names[10];
2048 BSTR iname = NULL;
2049 ITypeInfo *tinfo = NULL;
2050
2051 TRACE("...\n");
2052
2053 if (xmsg->iMethod < 3) {
2054 ERR("IUnknown methods cannot be marshaled by the typelib marshaler\n");
2055 return E_UNEXPECTED;
2056 }
2057
2058 if (This->dispatch_derivative && xmsg->iMethod < sizeof(IDispatchVtbl)/sizeof(void *))
2059 {
2060 IPSFactoryBuffer *factory_buffer;
2061 hres = get_facbuf_for_iid(&IID_IDispatch, &factory_buffer);
2062 if (hres == S_OK)
2063 {
2064 hres = IPSFactoryBuffer_CreateStub(factory_buffer, &IID_IDispatch,
2065 This->pUnk, &This->dispatch_stub);
2066 IPSFactoryBuffer_Release(factory_buffer);
2067 }
2068 if (hres != S_OK)
2069 return hres;
2070 return IRpcStubBuffer_Invoke(This->dispatch_stub, xmsg, rpcchanbuf);
2071 }
2072
2073 memset(&buf,0,sizeof(buf));
2074 buf.size = xmsg->cbBuffer;
2075 buf.base = HeapAlloc(GetProcessHeap(), 0, xmsg->cbBuffer);
2076 memcpy(buf.base, xmsg->Buffer, xmsg->cbBuffer);
2077 buf.curoff = 0;
2078
2079 hres = get_funcdesc(This->tinfo,xmsg->iMethod,&tinfo,&fdesc,&iname,NULL,NULL);
2080 if (hres) {
2081 ERR("GetFuncDesc on method %d failed with %x\n",xmsg->iMethod,hres);
2082 return hres;
2083 }
2084
2085 if (iname && !lstrcmpW(iname, IDispatchW))
2086 {
2087 ERR("IDispatch cannot be marshaled by the typelib marshaler\n");
2088 hres = E_UNEXPECTED;
2089 SysFreeString (iname);
2090 goto exit;
2091 }
2092
2093 SysFreeString (iname);
2094
2095 /* Need them for hack below */
2096 memset(names,0,sizeof(names));
2097 ITypeInfo_GetNames(tinfo,fdesc->memid,names,sizeof(names)/sizeof(names[0]),&nrofnames);
2098 if (nrofnames > sizeof(names)/sizeof(names[0])) {
2099 ERR("Need more names!\n");
2100 }
2101
2102 /*dump_FUNCDESC(fdesc);*/
2103 nrofargs = 0;
2104 for (i=0;i<fdesc->cParams;i++)
2105 nrofargs += _argsize(&fdesc->lprgelemdescParam[i].tdesc, tinfo);
2106 args = HeapAlloc(GetProcessHeap(),0,(nrofargs+1)*sizeof(DWORD));
2107 if (!args)
2108 {
2109 hres = E_OUTOFMEMORY;
2110 goto exit;
2111 }
2112
2113 /* Allocate all stuff used by call. */
2114 xargs = args+1;
2115 for (i=0;i<fdesc->cParams;i++) {
2116 ELEMDESC *elem = fdesc->lprgelemdescParam+i;
2117
2118 hres = deserialize_param(
2119 tinfo,
2120 is_in_elem(elem),
2121 FALSE,
2122 TRUE,
2123 &(elem->tdesc),
2124 xargs,
2125 &buf
2126 );
2127 xargs += _argsize(&elem->tdesc, tinfo);
2128 if (hres) {
2129 ERR("Failed to deserialize param %s, hres %x\n",relaystr(names[i+1]),hres);
2130 break;
2131 }
2132 }
2133
2134 args[0] = (DWORD)This->pUnk;
2135
2136 __TRY
2137 {
2138 res = _invoke(
2139 (*((FARPROC**)args[0]))[fdesc->oVft/4],
2140 fdesc->callconv,
2141 (xargs-args),
2142 args
2143 );
2144 }
2145 __EXCEPT_ALL
2146 {
2147 DWORD dwExceptionCode = GetExceptionCode();
2148 ERR("invoke call failed with exception 0x%08x (%d)\n", dwExceptionCode, dwExceptionCode);
2149 if (FAILED(dwExceptionCode))
2150 hres = dwExceptionCode;
2151 else
2152 hres = HRESULT_FROM_WIN32(dwExceptionCode);
2153 }
2154 __ENDTRY
2155
2156 if (hres != S_OK)
2157 goto exit;
2158
2159 buf.curoff = 0;
2160
2161 xargs = args+1;
2162 for (i=0;i<fdesc->cParams;i++) {
2163 ELEMDESC *elem = fdesc->lprgelemdescParam+i;
2164 hres = serialize_param(
2165 tinfo,
2166 is_out_elem(elem),
2167 FALSE,
2168 TRUE,
2169 &elem->tdesc,
2170 xargs,
2171 &buf
2172 );
2173 xargs += _argsize(&elem->tdesc, tinfo);
2174 if (hres) {
2175 ERR("Failed to stuballoc param, hres %x\n",hres);
2176 break;
2177 }
2178 }
2179
2180 hres = xbuf_add (&buf, (LPBYTE)&res, sizeof(DWORD));
2181
2182 if (hres != S_OK)
2183 goto exit;
2184
2185 xmsg->cbBuffer = buf.curoff;
2186 hres = IRpcChannelBuffer_GetBuffer(rpcchanbuf, xmsg, &This->iid);
2187 if (hres != S_OK)
2188 ERR("IRpcChannelBuffer_GetBuffer failed with error 0x%08x\n", hres);
2189
2190 if (hres == S_OK)
2191 memcpy(xmsg->Buffer, buf.base, buf.curoff);
2192
2193 exit:
2194 for (i = 0; i < nrofnames; i++)
2195 SysFreeString(names[i]);
2196
2197 ITypeInfo_Release(tinfo);
2198 HeapFree(GetProcessHeap(), 0, args);
2199
2200 HeapFree(GetProcessHeap(), 0, buf.base);
2201
2202 TRACE("returning\n");
2203 return hres;
2204 }
2205
2206 static LPRPCSTUBBUFFER WINAPI
2207 TMStubImpl_IsIIDSupported(LPRPCSTUBBUFFER iface, REFIID riid) {
2208 FIXME("Huh (%s)?\n",debugstr_guid(riid));
2209 return NULL;
2210 }
2211
2212 static ULONG WINAPI
2213 TMStubImpl_CountRefs(LPRPCSTUBBUFFER iface) {
2214 TMStubImpl *This = (TMStubImpl *)iface;
2215
2216 FIXME("()\n");
2217 return This->ref; /*FIXME? */
2218 }
2219
2220 static HRESULT WINAPI
2221 TMStubImpl_DebugServerQueryInterface(LPRPCSTUBBUFFER iface, LPVOID *ppv) {
2222 return E_NOTIMPL;
2223 }
2224
2225 static void WINAPI
2226 TMStubImpl_DebugServerRelease(LPRPCSTUBBUFFER iface, LPVOID ppv) {
2227 return;
2228 }
2229
2230 static const IRpcStubBufferVtbl tmstubvtbl = {
2231 TMStubImpl_QueryInterface,
2232 TMStubImpl_AddRef,
2233 TMStubImpl_Release,
2234 TMStubImpl_Connect,
2235 TMStubImpl_Disconnect,
2236 TMStubImpl_Invoke,
2237 TMStubImpl_IsIIDSupported,
2238 TMStubImpl_CountRefs,
2239 TMStubImpl_DebugServerQueryInterface,
2240 TMStubImpl_DebugServerRelease
2241 };
2242
2243 static HRESULT WINAPI
2244 PSFacBuf_CreateStub(
2245 LPPSFACTORYBUFFER iface, REFIID riid,IUnknown *pUnkServer,
2246 IRpcStubBuffer** ppStub
2247 ) {
2248 HRESULT hres;
2249 ITypeInfo *tinfo;
2250 TMStubImpl *stub;
2251 TYPEATTR *typeattr;
2252
2253 TRACE("(%s,%p,%p)\n",debugstr_guid(riid),pUnkServer,ppStub);
2254
2255 hres = _get_typeinfo_for_iid(riid,&tinfo);
2256 if (hres) {
2257 ERR("No typeinfo for %s?\n",debugstr_guid(riid));
2258 return hres;
2259 }
2260
2261 stub = CoTaskMemAlloc(sizeof(TMStubImpl));
2262 if (!stub)
2263 return E_OUTOFMEMORY;
2264 stub->lpvtbl = &tmstubvtbl;
2265 stub->ref = 1;
2266 stub->tinfo = tinfo;
2267 stub->dispatch_stub = NULL;
2268 stub->dispatch_derivative = FALSE;
2269 stub->iid = *riid;
2270 hres = IRpcStubBuffer_Connect((LPRPCSTUBBUFFER)stub,pUnkServer);
2271 *ppStub = (LPRPCSTUBBUFFER)stub;
2272 TRACE("IRpcStubBuffer: %p\n", stub);
2273 if (hres)
2274 ERR("Connect to pUnkServer failed?\n");
2275
2276 /* if we derive from IDispatch then defer to its stub for some of its methods */
2277 hres = ITypeInfo_GetTypeAttr(tinfo, &typeattr);
2278 if (hres == S_OK)
2279 {
2280 if (typeattr->wTypeFlags & TYPEFLAG_FDISPATCHABLE)
2281 stub->dispatch_derivative = TRUE;
2282 ITypeInfo_ReleaseTypeAttr(tinfo, typeattr);
2283 }
2284
2285 return hres;
2286 }
2287
2288 static const IPSFactoryBufferVtbl psfacbufvtbl = {
2289 PSFacBuf_QueryInterface,
2290 PSFacBuf_AddRef,
2291 PSFacBuf_Release,
2292 PSFacBuf_CreateProxy,
2293 PSFacBuf_CreateStub
2294 };
2295
2296 /* This is the whole PSFactoryBuffer object, just the vtableptr */
2297 static const IPSFactoryBufferVtbl *lppsfac = &psfacbufvtbl;
2298
2299 /***********************************************************************
2300 * TMARSHAL_DllGetClassObject
2301 */
2302 HRESULT TMARSHAL_DllGetClassObject(REFCLSID rclsid, REFIID iid,LPVOID *ppv)
2303 {
2304 if (IsEqualIID(iid,&IID_IPSFactoryBuffer)) {
2305 *ppv = &lppsfac;
2306 return S_OK;
2307 }
2308 return E_NOINTERFACE;
2309 }
2310
~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~
This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.
|
__label__pos
| 0.982799 |
关闭
asp.net用datalist进行分页
85人阅读 评论(0) 收藏 举报
前台代码：
这个是前台代码：必须要先设计号界面
<asp:Repeater ID="Repeater1" runat="server" >
<ItemTemplate>
<table width="100%" cellpadding="0px" cellspacing="0px" border="0px" style="font-size:small;">
<tr>
<td rowspan="2" width="400px">
<a href="productDetail.aspx?ProductId=<%# Eval("ProductId") %>"> <img height="180px" width="200px" src="<%# DataBinder.Eval(Container.DataItem,"PPictuer")%>" alt="产品图片" /></a><br />
人气指数： <%# DataBinder.Eval(Container.DataItem,"PClick")%></td>
<td colspan="2">
<%# DataBinder.Eval(Container.DataItem,"PName")%>
</td>
</tr>
<tr>
<td width="400px">
</td>
<td>
零售价：<del>¥<%# DataBinder.Eval(Container.DataItem,"PPrice")%></del><br />会员价:¥<%# DataBinder.Eval(Container.DataItem,"PMemberPrice")%><br /></td>
</tr>
<tr>
<td></td>
<td></td>
<td colspan="3">
<a href="pubCart.aspx?ProductId=<%# DataBinder.Eval(Container.DataItem,"PPrice")%>">
<img src="images/1223.jpg" alt="立即购买" /></a>
</td>
</tr>
<tr>
<td></td>
<td width="400px">详细介绍:</td>
</tr>
<tr>
<td></td>
</tr>
</table>
</ItemTemplate>
</asp:Repeater>
<br />
<asp:Label ID="lblCurrentPage" runat="server" Text="Label"></asp:Label> <asp:HyperLink ID="lnkPrev" runat="server">上一页</asp:HyperLink>
<asp:HyperLink ID="lnkNext" runat="server">下一页</asp:HyperLink>
后台代码：
protected void Page_Load(object sender, EventArgs e)
{
string sqlstr = "SELECT TOP (30) ProductId, PName,PPictuer, PPrice, PMemberPrice, PClick FROM product WHERE (PStock > 0) ORDER BY PClick DESC ";
DataSet ds = DatabaseHelp.datasetdata(sqlstr);//从数据库中读取数据
PagedDataSource objPds = new PagedDataSource();//将数据源链接到pagesource上
objPds.DataSource = ds.Tables[0].DefaultView;
objPds.AllowPaging = true;
objPds.PageSize = 2;
int curpage = 0;
if (Request.QueryString["Page"] != null)//如果session值为空说明是页数在第一页，否则读取到具体页数
{
curpage = Convert.ToInt32(Request.QueryString["Page"]);
}
else
{
curpage = 1;
}
objPds.CurrentPageIndex = curpage-1;
lblCurrentPage.Text = "第" + curpage.ToString()+"页";
if (!objPds.IsFirstPage)//最后一页的话不要链接
{
lnkPrev.NavigateUrl = Request.CurrentExecutionFilePath + "?Page=" + Convert.ToString(curpage - 1);//链接按钮
}
if (!objPds.IsLastPage)//第一页也不要链接
{
lnkNext.NavigateUrl = Request.CurrentExecutionFilePath + "?Page=" + Convert.ToString(curpage + 1);//这也是一个按钮
}
Repeater1.DataSource = objPds;
Repeater1.DataBind();
}
0
0
猜你在找
【直播】计算机视觉原理及实战—屈教授
【套餐】深度学习入门视频课程—唐宇迪
【套餐】Hadoop生态系统零基础入门--侯勇蛟
【套餐】嵌入式Linux C编程基础--朱有鹏
【套餐】2017软考系统集成项目——任铄
【套餐】Android 5.x顶级视频课程——李宁
【直播】广义线性模型及其应用——李科
【直播】从0到1 区块链的概念到实践
【直播】机器学习之凸优化——马博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
查看评论
* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：1932次
• 积分：51
• 等级：
• 排名：千里之外
• 原创：5篇
• 转载：1篇
• 译文：0篇
• 评论：0条
文章分类
|
__label__pos
| 0.701703 |
Mucahit Gurbuz I am kind of a multidisciplinary engineer. I have tried to dive into some separate professions but I always saw the connection between them. And now, I am connecting the dots and creating a line. This line is full of engineering, software, and visual products.
Persistent login in React using refresh token rotation
5 min read 1585
React Logo Over Tokens
A primary concern for frontend developers is to establish a secure and fast authorization and authentication structure. Also top of mind is the user experience, which is impacted greatly by the authentication process.
Do you remember the last time you entered login credentials to Google, Facebook, LinkedIn, or some other app or website? Probably not. That’s because many apps and web services nowadays use persistent login to provide a smooth user experience.
In this tutorial, we’ll show you how to use refresh tokens in React to facilitate infinitely long login sessions. We’ll cover the following:
What is a refresh token?
In simple terms, an access token enables users to obtain resources from your app.
For security reasons, access tokens often have a very short lifetime. When an access token expires, a refresh token can be used to get a new access token without entering login credentials again.
Access Token Diagram
Refresh tokens have a long lifetime. If they are valid and not expired, clients can obtain new access tokens. This long lifetime may lead to vulnerability for protected resources.
What is refresh token rotation?
Refresh token rotation is a technique to secure refresh tokens. When a new access token is requested with the refresh token, a new refresh token is also returned and the old one is invalidated. The purpose of refresh token rotation is to eliminate the vulnerability risk posed by long-lasting refresh tokens.
Until recently, using refresh tokens was not recommended in single-page web applications (unlike mobile applications) because SPAs have no secure mechanism to store tokens. Refresh token rotation and refresh token reuse detection (which we’ll get to later) increase the security of this high-value information.
The following diagram explains how the refresh token rotation mechanism works. You can accept Auth0 as an identity provider:
Refresh Token Rotation Mechanism
Refresh Token Rotation Mechanism (Source: https://auth0.com/docs/tokens/refresh-tokens/refresh-token-rotation)
What is refresh token reuse detection?
Refresh token reuse detection is a mechanism that supports refresh token rotation. When an access token expires, the client gets a new set of tokens (access and refresh token) using a refresh token. Then, the identity provider immediately invalidates the previous refresh token.
If the identity provider detects the use of that invalidated refresh token, it immediately invalidates all the refresh and access tokens making the client authenticate using login credentials again. This mechanism prevents your app from malicious attacks when there is a leakage of tokens.
The following two cases from the Auth0 docs are good examples of the possible scenarios for these attacks and how refresh token reuse detection works:
Refresh Token Scenario 1
Refresh token reuse detection mechanism scenario 1
Refresh Token Scenario 2
Refresh token reuse detection mechanism scenario 2
Where to store refresh tokens
There are several ways to store tokens within client sessions: in memory, via silent authentication, and in the browser’s local storage.
Storing tokens in memory
You can store refresh tokens in memory. However, this storage will not persist across page refreshes or new tabs. Therefore, users should enter login credentials every page refresh or on new tabs, which negatively impacts the user experience.
Silent authentication
Storing refresh tokens via silent authentication involves sending a request to the identity server to get an access token whenever there is an API request or during page refresh. If your session still remains, the identity provider will return a valid token. Otherwise, it redirects you to the login page.
This is a much safer structure, however: whenever the client sends a silent authentication request, it blocks the application. This might be on page render or during an API call.
In addition, I have experienced unwanted behaviors, such as login loops, in incognito mode.
Storing tokens locally
The suggested practice for persistent login is to store tokens in the browser’s local storage. Local storage provides persistent data between page refreshes and various tabs.
Although storing refresh tokens locally doesn’t eliminate the threat of cross-site scripting (XSS) attacks entirely, it does significantly reduce this vulnerability to an acceptable level. It also improves the user experience by making the app run more smoothly.
Configuring a React app with persistent login using refresh token rotation
To demonstrate how refresh tokens and refresh token rotation work, we’re going to configure a react app authentication mechanism with a refresh token. We’ll use Auth0 for refresh token rotation and refresh token reuse detection. Auth0 is one of the most popular authentication and authorization platforms.
To integrate Auth0 into our React app, we’ll use auth0-react to connect the app with Auth0 and a hook called useAuth0 to get authentication state and methods. However, it is challenging to reach authentication states and methods outside the components.
Therefore, I have transformed the library @auth0/auth0-spa-js, which is another official Auth0 client library, to have an authentication hook and methods that can be accessible outside the components.
I created an auth0.tsx file (you can go with JSX, of course) like this:
import React, { useState, useEffect, useContext, createContext } from 'react';
import createAuth0Client, {
getIdTokenClaimsOptions,
GetTokenSilentlyOptions,
GetTokenWithPopupOptions,
IdToken,
LogoutOptions,
PopupLoginOptions,
RedirectLoginOptions,
} from '@auth0/auth0-spa-js';
import Auth0Client from '@auth0/auth0-spa-js/dist/typings/Auth0Client';
import { config } from '../config';
import history from '../history';
import { urls } from '../routers/urls';
interface Auth0Context {
isAuthenticated: boolean;
user: any;
loading: boolean;
popupOpen: boolean;
loginWithPopup(options: PopupLoginOptions): Promise<void>;
handleRedirectCallback(): Promise<any>;
getIdTokenClaims(o?: getIdTokenClaimsOptions): Promise<IdToken>;
loginWithRedirect(o: RedirectLoginOptions): Promise<void>;
getAccessTokenSilently(o?: GetTokenSilentlyOptions): Promise<string | undefined>;
getTokenWithPopup(o?: GetTokenWithPopupOptions): Promise<string | undefined>;
logout(o?: LogoutOptions): void;
}
export const Auth0Context = createContext<Auth0Context | null>(null);
export const useAuth0 = () => useContext(Auth0Context)!;
const onRedirectCallback = appState => {
history.replace(appState && appState.returnTo ? appState.returnTo : urls.orderManagement);
};
let initOptions = config.auth; // Auth0 client credentials
const getAuth0Client: any = () => {
return new Promise(async (resolve, reject) => {
let client;
if (!client) {
try {
client = await createAuth0Client({ ...initOptions, scope: 'openid email profile offline_access', cacheLocation: 'localstorage', useRefreshTokens: true });
resolve(client);
} catch (e) {
reject(new Error(`getAuth0Client Error: ${e}`));
}
}
});
};
export const getTokenSilently = async (...p) => {
const client = await getAuth0Client();
return await client.getTokenSilently(...p);
};
export const Auth0Provider = ({ children }): any => {
const [isAuthenticated, setIsAuthenticated] = useState(false);
const [user, setUser] = useState<any>();
const [auth0Client, setAuth0] = useState<Auth0Client>();
const [loading, setLoading] = useState(true);
const [popupOpen, setPopupOpen] = useState(false);
useEffect(() => {
const initAuth0 = async () => {
const client = await getAuth0Client();
setAuth0(client);
if (window.location.search.includes('code=')) {
const { appState } = await client.handleRedirectCallback();
onRedirectCallback(appState);
}
const isAuthenticated = await client.isAuthenticated();
setIsAuthenticated(isAuthenticated);
if (isAuthenticated) {
const user = await client.getUser();
setUser(user);
}
setLoading(false);
};
initAuth0();
// eslint-disable-next-line
}, []);
const loginWithPopup = async (params = {}) => {
setPopupOpen(true);
try {
await auth0Client!.loginWithPopup(params);
} catch (error) {
console.error(error);
} finally {
setPopupOpen(false);
}
const user = await auth0Client!.getUser();
setUser(user);
setIsAuthenticated(true);
};
const handleRedirectCallback = async () => {
setLoading(true);
await auth0Client!.handleRedirectCallback();
const user = await auth0Client!.getUser();
setLoading(false);
setIsAuthenticated(true);
setUser(user);
};
return (
<Auth0Context.Provider
value={{
isAuthenticated,
user,
loading,
popupOpen,
loginWithPopup,
handleRedirectCallback,
getIdTokenClaims: (o: getIdTokenClaimsOptions | undefined) => auth0Client!.getIdTokenClaims(o),
loginWithRedirect: (o: RedirectLoginOptions) => auth0Client!.loginWithRedirect(o),
getAccessTokenSilently: (o: GetTokenSilentlyOptions | undefined) => auth0Client!.getTokenSilently(o),
getTokenWithPopup: (o: GetTokenWithPopupOptions | undefined) => auth0Client!.getTokenWithPopup(o),
logout: (o: LogoutOptions | undefined) => auth0Client!.logout(o),
}}
>
{children}
</Auth0Context.Provider>
);
};
As you can see on line 44, cacheLocation is set to localStorage, useRefreshToken is set to true, and offline_access is added to the scope.
In the main App.tsx file, you should import the Auth0Provider HOC to wrap all routes.
I also wanted to be sure about each API request sent with a valid token. Even though the API response says unauthorized, it redirects the client to the authentication page.
I used the interceptors of Axios, which enable you to insert logic before sending requests or getting a response.
// Request interceptor for API calls
axios.interceptors.request.use(
async config => {
const token = await getTokenSilently();
config.headers.authorization = `Bearer ${token}`;
return config;
},
error => {
Promise.reject(error);
}
);
// Response interceptor for API calls
axios.interceptors.response.use(
response => {
return response.data;
},
async function(error) {
if (error.response?.status === 401 || error?.error === 'login_required') {
history.push(urls.authentication);
}
return Promise.reject(error);
}
);
The authentication page component only includes the loginWithRedirect method, which redirects clients to the Auth0 login page and then redirects to the desired page.
import React, { useEffect } from 'react';
import { useAuth0 } from '../../../auth/auth0';
import { urls } from '../../../routers/urls';
const Login: React.FC = () => {
const { loginWithRedirect, loading } = useAuth0();
useEffect(() => {
if (!loading) {
loginWithRedirect({ appState: urls.orderManagement });
}
}, [loading]);
return null;
};
export default Login;
Go to your application in the Auth0 dashboard. In the settings, you will see the Refresh Token Rotation setting. Turn on the rotation and set the reuse interval, which is the interval during which the refresh token reuse detection algorithm will not work.
Rotation Enabled
That’s it! Now, our app has a persistent and secure authentication system. This will make your app more secure and improve the user experience to boot.
Special thanks to my colleague Turhan Gür who support me on this journey by providing crucial feedback.
Get setup with LogRocket's modern React error tracking in minutes:
1. Visit https://logrocket.com/signup/ to get an app ID.
2. Install LogRocket via NPM or script tag. LogRocket.init() must be called client-side, not server-side.
3. $ npm i --save logrocket
// Code:
import LogRocket from 'logrocket';
LogRocket.init('app/id');
Add to your HTML:
<script src="https://cdn.lr-ingest.com/LogRocket.min.js"></script>
<script>window.LogRocket && window.LogRocket.init('app/id');</script>
4. (Optional) Install plugins for deeper integrations with your stack:
• Redux middleware
• ngrx middleware
• Vuex plugin
Get started now
Mucahit Gurbuz I am kind of a multidisciplinary engineer. I have tried to dive into some separate professions but I always saw the connection between them. And now, I am connecting the dots and creating a line. This line is full of engineering, software, and visual products.
One Reply to “Persistent login in React using refresh token rotation”
Leave a Reply
|
__label__pos
| 0.954691 |
rowTemplate String|Function
The template which renders rows. Be default renders a table row (<tr>) for every data source item.
There are a few important things to keep in mind when using rowTemplate.
• The outermost HTML element in the template must be a table row (<tr>). That table row must have the uid data attribute set to #= uid #. The grid uses the uid data attribute to determine the data to which a table row is bound to.
• If rowTemplate is used alongside with detailTemplate, the row (<tr>) element needs to have class k-master-row. The first <td> element of the row needs to have class k-hierarchy-cell. Check the Row Templates documentation for more information.
Example - specify row template as a function
<div id="grid"></div>
<script>
$("#grid").kendoGrid({
dataSource: [ { name: "Jane Doe", age: 30 }, { name: "John Doe", age: 33 } ],
rowTemplate: function(dataItem){
return "<tr data-uid=" + dataItem.uid + "><td colspan='1'><strong>" + dataItem.name + "</strong></td><td colspan='1'><strong>" + dataItem.age + "</strong></td></tr>";
}
});
</script>
Example - specify row template as a function with Kendo template
<div id="grid"></div>
<script id="template" type="text/x-kendo-template">
<tr data-uid="#= uid #">
<td colspan="1">
<strong>#: name #</strong>
</td>
<td colspan="1">
<strong>#: age #</strong>
</td>
</tr>
</script>
<script>
$("#grid").kendoGrid({
dataSource: [
{ name: "Jane Doe", age: 30 },
{ name: "John Doe", age: 33 }
],
rowTemplate: kendo.template($("#template").html())
});
</script>
Example - specify row template as a string
<div id="grid"></div>
<script>
$("#grid").kendoGrid({
dataSource: [ { name: "Jane Doe", age: 30 }, { name: "John Doe", age: 33 } ],
rowTemplate: '<tr data-uid="#= uid #"><td colspan="1"><strong>#: name #</strong></td><td colspan="1"><strong>#: age #</strong></td></tr>'
});
</script>
Check Row template for a live demo.
In this article
|
__label__pos
| 0.994123 |
1 /*
2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/classFileParser.hpp"
27 #include "classfile/classLoader.hpp"
28 #include "classfile/javaClasses.hpp"
29 #include "classfile/symbolTable.hpp"
30 #include "classfile/systemDictionary.hpp"
31 #include "classfile/verificationType.hpp"
32 #include "classfile/verifier.hpp"
33 #include "classfile/vmSymbols.hpp"
34 #include "memory/allocation.hpp"
35 #include "memory/gcLocker.hpp"
36 #include "memory/oopFactory.hpp"
37 #include "memory/universe.inline.hpp"
38 #include "oops/constantPoolOop.hpp"
39 #include "oops/fieldStreams.hpp"
40 #include "oops/instanceKlass.hpp"
41 #include "oops/instanceMirrorKlass.hpp"
42 #include "oops/klass.inline.hpp"
43 #include "oops/klassOop.hpp"
44 #include "oops/klassVtable.hpp"
45 #include "oops/methodOop.hpp"
46 #include "oops/symbol.hpp"
47 #include "prims/jvmtiExport.hpp"
48 #include "prims/jvmtiThreadState.hpp"
49 #include "runtime/javaCalls.hpp"
50 #include "runtime/perfData.hpp"
51 #include "runtime/reflection.hpp"
52 #include "runtime/signature.hpp"
53 #include "runtime/timer.hpp"
54 #include "services/classLoadingService.hpp"
55 #include "services/threadService.hpp"
56
57 // We generally try to create the oops directly when parsing, rather than
58 // allocating temporary data structures and copying the bytes twice. A
59 // temporary area is only needed when parsing utf8 entries in the constant
60 // pool and when parsing line number tables.
61
62 // We add assert in debug mode when class format is not checked.
63
64 #define JAVA_CLASSFILE_MAGIC 0xCAFEBABE
65 #define JAVA_MIN_SUPPORTED_VERSION 45
66 #define JAVA_MAX_SUPPORTED_VERSION 51
67 #define JAVA_MAX_SUPPORTED_MINOR_VERSION 0
68
69 // Used for two backward compatibility reasons:
70 // - to check for new additions to the class file format in JDK1.5
71 // - to check for bug fixes in the format checker in JDK1.5
72 #define JAVA_1_5_VERSION 49
73
74 // Used for backward compatibility reasons:
75 // - to check for javac bug fixes that happened after 1.5
76 // - also used as the max version when running in jdk6
77 #define JAVA_6_VERSION 50
78
79 // Used for backward compatibility reasons:
80 // - to check NameAndType_info signatures more aggressively
81 #define JAVA_7_VERSION 51
82
83
84 void ClassFileParser::parse_constant_pool_entries(constantPoolHandle cp, int length, TRAPS) {
85 // Use a local copy of ClassFileStream. It helps the C++ compiler to optimize
86 // this function (_current can be allocated in a register, with scalar
87 // replacement of aggregates). The _current pointer is copied back to
88 // stream() when this function returns. DON'T call another method within
89 // this method that uses stream().
90 ClassFileStream* cfs0 = stream();
91 ClassFileStream cfs1 = *cfs0;
92 ClassFileStream* cfs = &cfs1;
93 #ifdef ASSERT
94 assert(cfs->allocated_on_stack(),"should be local");
95 u1* old_current = cfs0->current();
96 #endif
97
98 // Used for batching symbol allocations.
99 const char* names[SymbolTable::symbol_alloc_batch_size];
100 int lengths[SymbolTable::symbol_alloc_batch_size];
101 int indices[SymbolTable::symbol_alloc_batch_size];
102 unsigned int hashValues[SymbolTable::symbol_alloc_batch_size];
103 int names_count = 0;
104
105 // parsing Index 0 is unused
106 for (int index = 1; index < length; index++) {
107 // Each of the following case guarantees one more byte in the stream
108 // for the following tag or the access_flags following constant pool,
109 // so we don't need bounds-check for reading tag.
110 u1 tag = cfs->get_u1_fast();
111 switch (tag) {
112 case JVM_CONSTANT_Class :
113 {
114 cfs->guarantee_more(3, CHECK); // name_index, tag/access_flags
115 u2 name_index = cfs->get_u2_fast();
116 cp->klass_index_at_put(index, name_index);
117 }
118 break;
119 case JVM_CONSTANT_Fieldref :
120 {
121 cfs->guarantee_more(5, CHECK); // class_index, name_and_type_index, tag/access_flags
122 u2 class_index = cfs->get_u2_fast();
123 u2 name_and_type_index = cfs->get_u2_fast();
124 cp->field_at_put(index, class_index, name_and_type_index);
125 }
126 break;
127 case JVM_CONSTANT_Methodref :
128 {
129 cfs->guarantee_more(5, CHECK); // class_index, name_and_type_index, tag/access_flags
130 u2 class_index = cfs->get_u2_fast();
131 u2 name_and_type_index = cfs->get_u2_fast();
132 cp->method_at_put(index, class_index, name_and_type_index);
133 }
134 break;
135 case JVM_CONSTANT_InterfaceMethodref :
136 {
137 cfs->guarantee_more(5, CHECK); // class_index, name_and_type_index, tag/access_flags
138 u2 class_index = cfs->get_u2_fast();
139 u2 name_and_type_index = cfs->get_u2_fast();
140 cp->interface_method_at_put(index, class_index, name_and_type_index);
141 }
142 break;
143 case JVM_CONSTANT_String :
144 {
145 cfs->guarantee_more(3, CHECK); // string_index, tag/access_flags
146 u2 string_index = cfs->get_u2_fast();
147 cp->string_index_at_put(index, string_index);
148 }
149 break;
150 case JVM_CONSTANT_MethodHandle :
151 case JVM_CONSTANT_MethodType :
152 if (_major_version < Verifier::INVOKEDYNAMIC_MAJOR_VERSION) {
153 classfile_parse_error(
154 "Class file version does not support constant tag %u in class file %s",
155 tag, CHECK);
156 }
157 if (!EnableInvokeDynamic) {
158 classfile_parse_error(
159 "This JVM does not support constant tag %u in class file %s",
160 tag, CHECK);
161 }
162 if (tag == JVM_CONSTANT_MethodHandle) {
163 cfs->guarantee_more(4, CHECK); // ref_kind, method_index, tag/access_flags
164 u1 ref_kind = cfs->get_u1_fast();
165 u2 method_index = cfs->get_u2_fast();
166 cp->method_handle_index_at_put(index, ref_kind, method_index);
167 } else if (tag == JVM_CONSTANT_MethodType) {
168 cfs->guarantee_more(3, CHECK); // signature_index, tag/access_flags
169 u2 signature_index = cfs->get_u2_fast();
170 cp->method_type_index_at_put(index, signature_index);
171 } else {
172 ShouldNotReachHere();
173 }
174 break;
175 case JVM_CONSTANT_InvokeDynamic :
176 {
177 if (_major_version < Verifier::INVOKEDYNAMIC_MAJOR_VERSION) {
178 classfile_parse_error(
179 "Class file version does not support constant tag %u in class file %s",
180 tag, CHECK);
181 }
182 if (!EnableInvokeDynamic) {
183 classfile_parse_error(
184 "This JVM does not support constant tag %u in class file %s",
185 tag, CHECK);
186 }
187 cfs->guarantee_more(5, CHECK); // bsm_index, nt, tag/access_flags
188 u2 bootstrap_specifier_index = cfs->get_u2_fast();
189 u2 name_and_type_index = cfs->get_u2_fast();
190 if (_max_bootstrap_specifier_index < (int) bootstrap_specifier_index)
191 _max_bootstrap_specifier_index = (int) bootstrap_specifier_index; // collect for later
192 cp->invoke_dynamic_at_put(index, bootstrap_specifier_index, name_and_type_index);
193 }
194 break;
195 case JVM_CONSTANT_Integer :
196 {
197 cfs->guarantee_more(5, CHECK); // bytes, tag/access_flags
198 u4 bytes = cfs->get_u4_fast();
199 cp->int_at_put(index, (jint) bytes);
200 }
201 break;
202 case JVM_CONSTANT_Float :
203 {
204 cfs->guarantee_more(5, CHECK); // bytes, tag/access_flags
205 u4 bytes = cfs->get_u4_fast();
206 cp->float_at_put(index, *(jfloat*)&bytes);
207 }
208 break;
209 case JVM_CONSTANT_Long :
210 // A mangled type might cause you to overrun allocated memory
211 guarantee_property(index+1 < length,
212 "Invalid constant pool entry %u in class file %s",
213 index, CHECK);
214 {
215 cfs->guarantee_more(9, CHECK); // bytes, tag/access_flags
216 u8 bytes = cfs->get_u8_fast();
217 cp->long_at_put(index, bytes);
218 }
219 index++; // Skip entry following eigth-byte constant, see JVM book p. 98
220 break;
221 case JVM_CONSTANT_Double :
222 // A mangled type might cause you to overrun allocated memory
223 guarantee_property(index+1 < length,
224 "Invalid constant pool entry %u in class file %s",
225 index, CHECK);
226 {
227 cfs->guarantee_more(9, CHECK); // bytes, tag/access_flags
228 u8 bytes = cfs->get_u8_fast();
229 cp->double_at_put(index, *(jdouble*)&bytes);
230 }
231 index++; // Skip entry following eigth-byte constant, see JVM book p. 98
232 break;
233 case JVM_CONSTANT_NameAndType :
234 {
235 cfs->guarantee_more(5, CHECK); // name_index, signature_index, tag/access_flags
236 u2 name_index = cfs->get_u2_fast();
237 u2 signature_index = cfs->get_u2_fast();
238 cp->name_and_type_at_put(index, name_index, signature_index);
239 }
240 break;
241 case JVM_CONSTANT_Utf8 :
242 {
243 cfs->guarantee_more(2, CHECK); // utf8_length
244 u2 utf8_length = cfs->get_u2_fast();
245 u1* utf8_buffer = cfs->get_u1_buffer();
246 assert(utf8_buffer != NULL, "null utf8 buffer");
247 // Got utf8 string, guarantee utf8_length+1 bytes, set stream position forward.
248 cfs->guarantee_more(utf8_length+1, CHECK); // utf8 string, tag/access_flags
249 cfs->skip_u1_fast(utf8_length);
250
251 // Before storing the symbol, make sure it's legal
252 if (_need_verify) {
253 verify_legal_utf8((unsigned char*)utf8_buffer, utf8_length, CHECK);
254 }
255
256 if (EnableInvokeDynamic && has_cp_patch_at(index)) {
257 Handle patch = clear_cp_patch_at(index);
258 guarantee_property(java_lang_String::is_instance(patch()),
259 "Illegal utf8 patch at %d in class file %s",
260 index, CHECK);
261 char* str = java_lang_String::as_utf8_string(patch());
262 // (could use java_lang_String::as_symbol instead, but might as well batch them)
263 utf8_buffer = (u1*) str;
264 utf8_length = (int) strlen(str);
265 }
266
267 unsigned int hash;
268 Symbol* result = SymbolTable::lookup_only((char*)utf8_buffer, utf8_length, hash);
269 if (result == NULL) {
270 names[names_count] = (char*)utf8_buffer;
271 lengths[names_count] = utf8_length;
272 indices[names_count] = index;
273 hashValues[names_count++] = hash;
274 if (names_count == SymbolTable::symbol_alloc_batch_size) {
275 SymbolTable::new_symbols(cp, names_count, names, lengths, indices, hashValues, CHECK);
276 names_count = 0;
277 }
278 } else {
279 cp->symbol_at_put(index, result);
280 }
281 }
282 break;
283 default:
284 classfile_parse_error(
285 "Unknown constant tag %u in class file %s", tag, CHECK);
286 break;
287 }
288 }
289
290 // Allocate the remaining symbols
291 if (names_count > 0) {
292 SymbolTable::new_symbols(cp, names_count, names, lengths, indices, hashValues, CHECK);
293 }
294
295 // Copy _current pointer of local copy back to stream().
296 #ifdef ASSERT
297 assert(cfs0->current() == old_current, "non-exclusive use of stream()");
298 #endif
299 cfs0->set_current(cfs1.current());
300 }
301
302 // This class unreferences constant pool symbols if an error has occurred
303 // while parsing the class before it is assigned into the class.
304 // If it gets an error after that it is unloaded and the constant pool will
305 // be cleaned up then.
306 class ConstantPoolCleaner : public StackObj {
307 constantPoolHandle _cphandle;
308 bool _in_error;
309 public:
310 ConstantPoolCleaner(constantPoolHandle cp) : _cphandle(cp), _in_error(true) {}
311 ~ConstantPoolCleaner() {
312 if (_in_error && _cphandle.not_null()) {
313 _cphandle->unreference_symbols();
314 }
315 }
316 void set_in_error(bool clean) { _in_error = clean; }
317 };
318
319 bool inline valid_cp_range(int index, int length) { return (index > 0 && index < length); }
320
321 constantPoolHandle ClassFileParser::parse_constant_pool(TRAPS) {
322 ClassFileStream* cfs = stream();
323 constantPoolHandle nullHandle;
324
325 cfs->guarantee_more(3, CHECK_(nullHandle)); // length, first cp tag
326 u2 length = cfs->get_u2_fast();
327 guarantee_property(
328 length >= 1, "Illegal constant pool size %u in class file %s",
329 length, CHECK_(nullHandle));
330 constantPoolOop constant_pool =
331 oopFactory::new_constantPool(length,
332 oopDesc::IsSafeConc,
333 CHECK_(nullHandle));
334 constantPoolHandle cp (THREAD, constant_pool);
335
336 cp->set_partially_loaded(); // Enables heap verify to work on partial constantPoolOops
337 ConstantPoolCleaner cp_in_error(cp); // set constant pool to be cleaned up.
338
339 // parsing constant pool entries
340 parse_constant_pool_entries(cp, length, CHECK_(nullHandle));
341
342 int index = 1; // declared outside of loops for portability
343
344 // first verification pass - validate cross references and fixup class and string constants
345 for (index = 1; index < length; index++) { // Index 0 is unused
346 jbyte tag = cp->tag_at(index).value();
347 switch (tag) {
348 case JVM_CONSTANT_Class :
349 ShouldNotReachHere(); // Only JVM_CONSTANT_ClassIndex should be present
350 break;
351 case JVM_CONSTANT_Fieldref :
352 // fall through
353 case JVM_CONSTANT_Methodref :
354 // fall through
355 case JVM_CONSTANT_InterfaceMethodref : {
356 if (!_need_verify) break;
357 int klass_ref_index = cp->klass_ref_index_at(index);
358 int name_and_type_ref_index = cp->name_and_type_ref_index_at(index);
359 check_property(valid_cp_range(klass_ref_index, length) &&
360 is_klass_reference(cp, klass_ref_index),
361 "Invalid constant pool index %u in class file %s",
362 klass_ref_index,
363 CHECK_(nullHandle));
364 check_property(valid_cp_range(name_and_type_ref_index, length) &&
365 cp->tag_at(name_and_type_ref_index).is_name_and_type(),
366 "Invalid constant pool index %u in class file %s",
367 name_and_type_ref_index,
368 CHECK_(nullHandle));
369 break;
370 }
371 case JVM_CONSTANT_String :
372 ShouldNotReachHere(); // Only JVM_CONSTANT_StringIndex should be present
373 break;
374 case JVM_CONSTANT_Integer :
375 break;
376 case JVM_CONSTANT_Float :
377 break;
378 case JVM_CONSTANT_Long :
379 case JVM_CONSTANT_Double :
380 index++;
381 check_property(
382 (index < length && cp->tag_at(index).is_invalid()),
383 "Improper constant pool long/double index %u in class file %s",
384 index, CHECK_(nullHandle));
385 break;
386 case JVM_CONSTANT_NameAndType : {
387 if (!_need_verify) break;
388 int name_ref_index = cp->name_ref_index_at(index);
389 int signature_ref_index = cp->signature_ref_index_at(index);
390 check_property(
391 valid_cp_range(name_ref_index, length) &&
392 cp->tag_at(name_ref_index).is_utf8(),
393 "Invalid constant pool index %u in class file %s",
394 name_ref_index, CHECK_(nullHandle));
395 check_property(
396 valid_cp_range(signature_ref_index, length) &&
397 cp->tag_at(signature_ref_index).is_utf8(),
398 "Invalid constant pool index %u in class file %s",
399 signature_ref_index, CHECK_(nullHandle));
400 break;
401 }
402 case JVM_CONSTANT_Utf8 :
403 break;
404 case JVM_CONSTANT_UnresolvedClass : // fall-through
405 case JVM_CONSTANT_UnresolvedClassInError:
406 ShouldNotReachHere(); // Only JVM_CONSTANT_ClassIndex should be present
407 break;
408 case JVM_CONSTANT_ClassIndex :
409 {
410 int class_index = cp->klass_index_at(index);
411 check_property(
412 valid_cp_range(class_index, length) &&
413 cp->tag_at(class_index).is_utf8(),
414 "Invalid constant pool index %u in class file %s",
415 class_index, CHECK_(nullHandle));
416 cp->unresolved_klass_at_put(index, cp->symbol_at(class_index));
417 }
418 break;
419 case JVM_CONSTANT_UnresolvedString :
420 ShouldNotReachHere(); // Only JVM_CONSTANT_StringIndex should be present
421 break;
422 case JVM_CONSTANT_StringIndex :
423 {
424 int string_index = cp->string_index_at(index);
425 check_property(
426 valid_cp_range(string_index, length) &&
427 cp->tag_at(string_index).is_utf8(),
428 "Invalid constant pool index %u in class file %s",
429 string_index, CHECK_(nullHandle));
430 Symbol* sym = cp->symbol_at(string_index);
431 cp->unresolved_string_at_put(index, sym);
432 }
433 break;
434 case JVM_CONSTANT_MethodHandle :
435 {
436 int ref_index = cp->method_handle_index_at(index);
437 check_property(
438 valid_cp_range(ref_index, length) &&
439 EnableInvokeDynamic,
440 "Invalid constant pool index %u in class file %s",
441 ref_index, CHECK_(nullHandle));
442 constantTag tag = cp->tag_at(ref_index);
443 int ref_kind = cp->method_handle_ref_kind_at(index);
444 switch (ref_kind) {
445 case JVM_REF_getField:
446 case JVM_REF_getStatic:
447 case JVM_REF_putField:
448 case JVM_REF_putStatic:
449 check_property(
450 tag.is_field(),
451 "Invalid constant pool index %u in class file %s (not a field)",
452 ref_index, CHECK_(nullHandle));
453 break;
454 case JVM_REF_invokeVirtual:
455 case JVM_REF_invokeStatic:
456 case JVM_REF_invokeSpecial:
457 case JVM_REF_newInvokeSpecial:
458 check_property(
459 tag.is_method(),
460 "Invalid constant pool index %u in class file %s (not a method)",
461 ref_index, CHECK_(nullHandle));
462 break;
463 case JVM_REF_invokeInterface:
464 check_property(
465 tag.is_interface_method(),
466 "Invalid constant pool index %u in class file %s (not an interface method)",
467 ref_index, CHECK_(nullHandle));
468 break;
469 default:
470 classfile_parse_error(
471 "Bad method handle kind at constant pool index %u in class file %s",
472 index, CHECK_(nullHandle));
473 }
474 // Keep the ref_index unchanged. It will be indirected at link-time.
475 }
476 break;
477 case JVM_CONSTANT_MethodType :
478 {
479 int ref_index = cp->method_type_index_at(index);
480 check_property(
481 valid_cp_range(ref_index, length) &&
482 cp->tag_at(ref_index).is_utf8() &&
483 EnableInvokeDynamic,
484 "Invalid constant pool index %u in class file %s",
485 ref_index, CHECK_(nullHandle));
486 }
487 break;
488 case JVM_CONSTANT_InvokeDynamic :
489 {
490 int name_and_type_ref_index = cp->invoke_dynamic_name_and_type_ref_index_at(index);
491 check_property(valid_cp_range(name_and_type_ref_index, length) &&
492 cp->tag_at(name_and_type_ref_index).is_name_and_type(),
493 "Invalid constant pool index %u in class file %s",
494 name_and_type_ref_index,
495 CHECK_(nullHandle));
496 // bootstrap specifier index must be checked later, when BootstrapMethods attr is available
497 break;
498 }
499 default:
500 fatal(err_msg("bad constant pool tag value %u",
501 cp->tag_at(index).value()));
502 ShouldNotReachHere();
503 break;
504 } // end of switch
505 } // end of for
506
507 if (_cp_patches != NULL) {
508 // need to treat this_class specially...
509 assert(EnableInvokeDynamic, "");
510 int this_class_index;
511 {
512 cfs->guarantee_more(8, CHECK_(nullHandle)); // flags, this_class, super_class, infs_len
513 u1* mark = cfs->current();
514 u2 flags = cfs->get_u2_fast();
515 this_class_index = cfs->get_u2_fast();
516 cfs->set_current(mark); // revert to mark
517 }
518
519 for (index = 1; index < length; index++) { // Index 0 is unused
520 if (has_cp_patch_at(index)) {
521 guarantee_property(index != this_class_index,
522 "Illegal constant pool patch to self at %d in class file %s",
523 index, CHECK_(nullHandle));
524 patch_constant_pool(cp, index, cp_patch_at(index), CHECK_(nullHandle));
525 }
526 }
527 // Ensure that all the patches have been used.
528 for (index = 0; index < _cp_patches->length(); index++) {
529 guarantee_property(!has_cp_patch_at(index),
530 "Unused constant pool patch at %d in class file %s",
531 index, CHECK_(nullHandle));
532 }
533 }
534
535 if (!_need_verify) {
536 cp_in_error.set_in_error(false);
537 return cp;
538 }
539
540 // second verification pass - checks the strings are of the right format.
541 // but not yet to the other entries
542 for (index = 1; index < length; index++) {
543 jbyte tag = cp->tag_at(index).value();
544 switch (tag) {
545 case JVM_CONSTANT_UnresolvedClass: {
546 Symbol* class_name = cp->unresolved_klass_at(index);
547 // check the name, even if _cp_patches will overwrite it
548 verify_legal_class_name(class_name, CHECK_(nullHandle));
549 break;
550 }
551 case JVM_CONSTANT_NameAndType: {
552 if (_need_verify && _major_version >= JAVA_7_VERSION) {
553 int sig_index = cp->signature_ref_index_at(index);
554 int name_index = cp->name_ref_index_at(index);
555 Symbol* name = cp->symbol_at(name_index);
556 Symbol* sig = cp->symbol_at(sig_index);
557 if (sig->byte_at(0) == JVM_SIGNATURE_FUNC) {
558 verify_legal_method_signature(name, sig, CHECK_(nullHandle));
559 } else {
560 verify_legal_field_signature(name, sig, CHECK_(nullHandle));
561 }
562 }
563 break;
564 }
565 case JVM_CONSTANT_InvokeDynamic:
566 case JVM_CONSTANT_Fieldref:
567 case JVM_CONSTANT_Methodref:
568 case JVM_CONSTANT_InterfaceMethodref: {
569 int name_and_type_ref_index = cp->name_and_type_ref_index_at(index);
570 // already verified to be utf8
571 int name_ref_index = cp->name_ref_index_at(name_and_type_ref_index);
572 // already verified to be utf8
573 int signature_ref_index = cp->signature_ref_index_at(name_and_type_ref_index);
574 Symbol* name = cp->symbol_at(name_ref_index);
575 Symbol* signature = cp->symbol_at(signature_ref_index);
576 if (tag == JVM_CONSTANT_Fieldref) {
577 verify_legal_field_name(name, CHECK_(nullHandle));
578 if (_need_verify && _major_version >= JAVA_7_VERSION) {
579 // Signature is verified above, when iterating NameAndType_info.
580 // Need only to be sure it's the right type.
581 if (signature->byte_at(0) == JVM_SIGNATURE_FUNC) {
582 throwIllegalSignature(
583 "Field", name, signature, CHECK_(nullHandle));
584 }
585 } else {
586 verify_legal_field_signature(name, signature, CHECK_(nullHandle));
587 }
588 } else {
589 verify_legal_method_name(name, CHECK_(nullHandle));
590 if (_need_verify && _major_version >= JAVA_7_VERSION) {
591 // Signature is verified above, when iterating NameAndType_info.
592 // Need only to be sure it's the right type.
593 if (signature->byte_at(0) != JVM_SIGNATURE_FUNC) {
594 throwIllegalSignature(
595 "Method", name, signature, CHECK_(nullHandle));
596 }
597 } else {
598 verify_legal_method_signature(name, signature, CHECK_(nullHandle));
599 }
600 if (tag == JVM_CONSTANT_Methodref) {
601 // 4509014: If a class method name begins with '<', it must be "<init>".
602 assert(name != NULL, "method name in constant pool is null");
603 unsigned int name_len = name->utf8_length();
604 assert(name_len > 0, "bad method name"); // already verified as legal name
605 if (name->byte_at(0) == '<') {
606 if (name != vmSymbols::object_initializer_name()) {
607 classfile_parse_error(
608 "Bad method name at constant pool index %u in class file %s",
609 name_ref_index, CHECK_(nullHandle));
610 }
611 }
612 }
613 }
614 break;
615 }
616 case JVM_CONSTANT_MethodHandle: {
617 int ref_index = cp->method_handle_index_at(index);
618 int ref_kind = cp->method_handle_ref_kind_at(index);
619 switch (ref_kind) {
620 case JVM_REF_invokeVirtual:
621 case JVM_REF_invokeStatic:
622 case JVM_REF_invokeSpecial:
623 case JVM_REF_newInvokeSpecial:
624 {
625 int name_and_type_ref_index = cp->name_and_type_ref_index_at(ref_index);
626 int name_ref_index = cp->name_ref_index_at(name_and_type_ref_index);
627 Symbol* name = cp->symbol_at(name_ref_index);
628 if (ref_kind == JVM_REF_newInvokeSpecial) {
629 if (name != vmSymbols::object_initializer_name()) {
630 classfile_parse_error(
631 "Bad constructor name at constant pool index %u in class file %s",
632 name_ref_index, CHECK_(nullHandle));
633 }
634 } else {
635 if (name == vmSymbols::object_initializer_name()) {
636 classfile_parse_error(
637 "Bad method name at constant pool index %u in class file %s",
638 name_ref_index, CHECK_(nullHandle));
639 }
640 }
641 }
642 break;
643 // Other ref_kinds are already fully checked in previous pass.
644 }
645 break;
646 }
647 case JVM_CONSTANT_MethodType: {
648 Symbol* no_name = vmSymbols::type_name(); // place holder
649 Symbol* signature = cp->method_type_signature_at(index);
650 verify_legal_method_signature(no_name, signature, CHECK_(nullHandle));
651 break;
652 }
653 case JVM_CONSTANT_Utf8: {
654 assert(cp->symbol_at(index)->refcount() != 0, "count corrupted");
655 }
656 } // end of switch
657 } // end of for
658
659 cp_in_error.set_in_error(false);
660 return cp;
661 }
662
663
664 void ClassFileParser::patch_constant_pool(constantPoolHandle cp, int index, Handle patch, TRAPS) {
665 assert(EnableInvokeDynamic, "");
666 BasicType patch_type = T_VOID;
667 switch (cp->tag_at(index).value()) {
668
669 case JVM_CONSTANT_UnresolvedClass :
670 // Patching a class means pre-resolving it.
671 // The name in the constant pool is ignored.
672 if (java_lang_Class::is_instance(patch())) {
673 guarantee_property(!java_lang_Class::is_primitive(patch()),
674 "Illegal class patch at %d in class file %s",
675 index, CHECK);
676 cp->klass_at_put(index, java_lang_Class::as_klassOop(patch()));
677 } else {
678 guarantee_property(java_lang_String::is_instance(patch()),
679 "Illegal class patch at %d in class file %s",
680 index, CHECK);
681 Symbol* name = java_lang_String::as_symbol(patch(), CHECK);
682 cp->unresolved_klass_at_put(index, name);
683 }
684 break;
685
686 case JVM_CONSTANT_UnresolvedString :
687 // Patching a string means pre-resolving it.
688 // The spelling in the constant pool is ignored.
689 // The constant reference may be any object whatever.
690 // If it is not a real interned string, the constant is referred
691 // to as a "pseudo-string", and must be presented to the CP
692 // explicitly, because it may require scavenging.
693 cp->pseudo_string_at_put(index, patch());
694 break;
695
696 case JVM_CONSTANT_Integer : patch_type = T_INT; goto patch_prim;
697 case JVM_CONSTANT_Float : patch_type = T_FLOAT; goto patch_prim;
698 case JVM_CONSTANT_Long : patch_type = T_LONG; goto patch_prim;
699 case JVM_CONSTANT_Double : patch_type = T_DOUBLE; goto patch_prim;
700 patch_prim:
701 {
702 jvalue value;
703 BasicType value_type = java_lang_boxing_object::get_value(patch(), &value);
704 guarantee_property(value_type == patch_type,
705 "Illegal primitive patch at %d in class file %s",
706 index, CHECK);
707 switch (value_type) {
708 case T_INT: cp->int_at_put(index, value.i); break;
709 case T_FLOAT: cp->float_at_put(index, value.f); break;
710 case T_LONG: cp->long_at_put(index, value.j); break;
711 case T_DOUBLE: cp->double_at_put(index, value.d); break;
712 default: assert(false, "");
713 }
714 }
715 break;
716
717 default:
718 // %%% TODO: put method handles into CONSTANT_InterfaceMethodref, etc.
719 guarantee_property(!has_cp_patch_at(index),
720 "Illegal unexpected patch at %d in class file %s",
721 index, CHECK);
722 return;
723 }
724
725 // On fall-through, mark the patch as used.
726 clear_cp_patch_at(index);
727 }
728
729
730
731 class NameSigHash: public ResourceObj {
732 public:
733 Symbol* _name; // name
734 Symbol* _sig; // signature
735 NameSigHash* _next; // Next entry in hash table
736 };
737
738
739 #define HASH_ROW_SIZE 256
740
741 unsigned int hash(Symbol* name, Symbol* sig) {
742 unsigned int raw_hash = 0;
743 raw_hash += ((unsigned int)(uintptr_t)name) >> (LogHeapWordSize + 2);
744 raw_hash += ((unsigned int)(uintptr_t)sig) >> LogHeapWordSize;
745
746 return (raw_hash + (unsigned int)(uintptr_t)name) % HASH_ROW_SIZE;
747 }
748
749
750 void initialize_hashtable(NameSigHash** table) {
751 memset((void*)table, 0, sizeof(NameSigHash*) * HASH_ROW_SIZE);
752 }
753
754 // Return false if the name/sig combination is found in table.
755 // Return true if no duplicate is found. And name/sig is added as a new entry in table.
756 // The old format checker uses heap sort to find duplicates.
757 // NOTE: caller should guarantee that GC doesn't happen during the life cycle
758 // of table since we don't expect Symbol*'s to move.
759 bool put_after_lookup(Symbol* name, Symbol* sig, NameSigHash** table) {
760 assert(name != NULL, "name in constant pool is NULL");
761
762 // First lookup for duplicates
763 int index = hash(name, sig);
764 NameSigHash* entry = table[index];
765 while (entry != NULL) {
766 if (entry->_name == name && entry->_sig == sig) {
767 return false;
768 }
769 entry = entry->_next;
770 }
771
772 // No duplicate is found, allocate a new entry and fill it.
773 entry = new NameSigHash();
774 entry->_name = name;
775 entry->_sig = sig;
776
777 // Insert into hash table
778 entry->_next = table[index];
779 table[index] = entry;
780
781 return true;
782 }
783
784
785 objArrayHandle ClassFileParser::parse_interfaces(constantPoolHandle cp,
786 int length,
787 Handle class_loader,
788 Handle protection_domain,
789 Symbol* class_name,
790 TRAPS) {
791 ClassFileStream* cfs = stream();
792 assert(length > 0, "only called for length>0");
793 objArrayHandle nullHandle;
794 objArrayOop interface_oop = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
795 objArrayHandle interfaces (THREAD, interface_oop);
796
797 int index;
798 for (index = 0; index < length; index++) {
799 u2 interface_index = cfs->get_u2(CHECK_(nullHandle));
800 KlassHandle interf;
801 check_property(
802 valid_cp_range(interface_index, cp->length()) &&
803 is_klass_reference(cp, interface_index),
804 "Interface name has bad constant pool index %u in class file %s",
805 interface_index, CHECK_(nullHandle));
806 if (cp->tag_at(interface_index).is_klass()) {
807 interf = KlassHandle(THREAD, cp->resolved_klass_at(interface_index));
808 } else {
809 Symbol* unresolved_klass = cp->klass_name_at(interface_index);
810
811 // Don't need to check legal name because it's checked when parsing constant pool.
812 // But need to make sure it's not an array type.
813 guarantee_property(unresolved_klass->byte_at(0) != JVM_SIGNATURE_ARRAY,
814 "Bad interface name in class file %s", CHECK_(nullHandle));
815
816 // Call resolve_super so classcircularity is checked
817 klassOop k = SystemDictionary::resolve_super_or_fail(class_name,
818 unresolved_klass, class_loader, protection_domain,
819 false, CHECK_(nullHandle));
820 interf = KlassHandle(THREAD, k);
821
822 if (LinkWellKnownClasses) // my super type is well known to me
823 cp->klass_at_put(interface_index, interf()); // eagerly resolve
824 }
825
826 if (!Klass::cast(interf())->is_interface()) {
827 THROW_MSG_(vmSymbols::java_lang_IncompatibleClassChangeError(), "Implementing class", nullHandle);
828 }
829 interfaces->obj_at_put(index, interf());
830 }
831
832 if (!_need_verify || length <= 1) {
833 return interfaces;
834 }
835
836 // Check if there's any duplicates in interfaces
837 ResourceMark rm(THREAD);
838 NameSigHash** interface_names = NEW_RESOURCE_ARRAY_IN_THREAD(
839 THREAD, NameSigHash*, HASH_ROW_SIZE);
840 initialize_hashtable(interface_names);
841 bool dup = false;
842 {
843 debug_only(No_Safepoint_Verifier nsv;)
844 for (index = 0; index < length; index++) {
845 klassOop k = (klassOop)interfaces->obj_at(index);
846 Symbol* name = instanceKlass::cast(k)->name();
847 // If no duplicates, add (name, NULL) in hashtable interface_names.
848 if (!put_after_lookup(name, NULL, interface_names)) {
849 dup = true;
850 break;
851 }
852 }
853 }
854 if (dup) {
855 classfile_parse_error("Duplicate interface name in class file %s",
856 CHECK_(nullHandle));
857 }
858
859 return interfaces;
860 }
861
862
863 void ClassFileParser::verify_constantvalue(int constantvalue_index, int signature_index, constantPoolHandle cp, TRAPS) {
864 // Make sure the constant pool entry is of a type appropriate to this field
865 guarantee_property(
866 (constantvalue_index > 0 &&
867 constantvalue_index < cp->length()),
868 "Bad initial value index %u in ConstantValue attribute in class file %s",
869 constantvalue_index, CHECK);
870 constantTag value_type = cp->tag_at(constantvalue_index);
871 switch ( cp->basic_type_for_signature_at(signature_index) ) {
872 case T_LONG:
873 guarantee_property(value_type.is_long(), "Inconsistent constant value type in class file %s", CHECK);
874 break;
875 case T_FLOAT:
876 guarantee_property(value_type.is_float(), "Inconsistent constant value type in class file %s", CHECK);
877 break;
878 case T_DOUBLE:
879 guarantee_property(value_type.is_double(), "Inconsistent constant value type in class file %s", CHECK);
880 break;
881 case T_BYTE: case T_CHAR: case T_SHORT: case T_BOOLEAN: case T_INT:
882 guarantee_property(value_type.is_int(), "Inconsistent constant value type in class file %s", CHECK);
883 break;
884 case T_OBJECT:
885 guarantee_property((cp->symbol_at(signature_index)->equals("Ljava/lang/String;")
886 && (value_type.is_string() || value_type.is_unresolved_string())),
887 "Bad string initial value in class file %s", CHECK);
888 break;
889 default:
890 classfile_parse_error(
891 "Unable to set initial value %u in class file %s",
892 constantvalue_index, CHECK);
893 }
894 }
895
896
897 // Parse attributes for a field.
898 void ClassFileParser::parse_field_attributes(constantPoolHandle cp,
899 u2 attributes_count,
900 bool is_static, u2 signature_index,
901 u2* constantvalue_index_addr,
902 bool* is_synthetic_addr,
903 u2* generic_signature_index_addr,
904 typeArrayHandle* field_annotations,
905 TRAPS) {
906 ClassFileStream* cfs = stream();
907 assert(attributes_count > 0, "length should be greater than 0");
908 u2 constantvalue_index = 0;
909 u2 generic_signature_index = 0;
910 bool is_synthetic = false;
911 u1* runtime_visible_annotations = NULL;
912 int runtime_visible_annotations_length = 0;
913 u1* runtime_invisible_annotations = NULL;
914 int runtime_invisible_annotations_length = 0;
915 while (attributes_count--) {
916 cfs->guarantee_more(6, CHECK); // attribute_name_index, attribute_length
917 u2 attribute_name_index = cfs->get_u2_fast();
918 u4 attribute_length = cfs->get_u4_fast();
919 check_property(valid_cp_range(attribute_name_index, cp->length()) &&
920 cp->tag_at(attribute_name_index).is_utf8(),
921 "Invalid field attribute index %u in class file %s",
922 attribute_name_index,
923 CHECK);
924 Symbol* attribute_name = cp->symbol_at(attribute_name_index);
925 if (is_static && attribute_name == vmSymbols::tag_constant_value()) {
926 // ignore if non-static
927 if (constantvalue_index != 0) {
928 classfile_parse_error("Duplicate ConstantValue attribute in class file %s", CHECK);
929 }
930 check_property(
931 attribute_length == 2,
932 "Invalid ConstantValue field attribute length %u in class file %s",
933 attribute_length, CHECK);
934 constantvalue_index = cfs->get_u2(CHECK);
935 if (_need_verify) {
936 verify_constantvalue(constantvalue_index, signature_index, cp, CHECK);
937 }
938 } else if (attribute_name == vmSymbols::tag_synthetic()) {
939 if (attribute_length != 0) {
940 classfile_parse_error(
941 "Invalid Synthetic field attribute length %u in class file %s",
942 attribute_length, CHECK);
943 }
944 is_synthetic = true;
945 } else if (attribute_name == vmSymbols::tag_deprecated()) { // 4276120
946 if (attribute_length != 0) {
947 classfile_parse_error(
948 "Invalid Deprecated field attribute length %u in class file %s",
949 attribute_length, CHECK);
950 }
951 } else if (_major_version >= JAVA_1_5_VERSION) {
952 if (attribute_name == vmSymbols::tag_signature()) {
953 if (attribute_length != 2) {
954 classfile_parse_error(
955 "Wrong size %u for field's Signature attribute in class file %s",
956 attribute_length, CHECK);
957 }
958 generic_signature_index = cfs->get_u2(CHECK);
959 } else if (attribute_name == vmSymbols::tag_runtime_visible_annotations()) {
960 runtime_visible_annotations_length = attribute_length;
961 runtime_visible_annotations = cfs->get_u1_buffer();
962 assert(runtime_visible_annotations != NULL, "null visible annotations");
963 cfs->skip_u1(runtime_visible_annotations_length, CHECK);
964 } else if (PreserveAllAnnotations && attribute_name == vmSymbols::tag_runtime_invisible_annotations()) {
965 runtime_invisible_annotations_length = attribute_length;
966 runtime_invisible_annotations = cfs->get_u1_buffer();
967 assert(runtime_invisible_annotations != NULL, "null invisible annotations");
968 cfs->skip_u1(runtime_invisible_annotations_length, CHECK);
969 } else {
970 cfs->skip_u1(attribute_length, CHECK); // Skip unknown attributes
971 }
972 } else {
973 cfs->skip_u1(attribute_length, CHECK); // Skip unknown attributes
974 }
975 }
976
977 *constantvalue_index_addr = constantvalue_index;
978 *is_synthetic_addr = is_synthetic;
979 *generic_signature_index_addr = generic_signature_index;
980 *field_annotations = assemble_annotations(runtime_visible_annotations,
981 runtime_visible_annotations_length,
982 runtime_invisible_annotations,
983 runtime_invisible_annotations_length,
984 CHECK);
985 return;
986 }
987
988
989 // Field allocation types. Used for computing field offsets.
990
991 enum FieldAllocationType {
992 STATIC_OOP, // Oops
993 STATIC_BYTE, // Boolean, Byte, char
994 STATIC_SHORT, // shorts
995 STATIC_WORD, // ints
996 STATIC_DOUBLE, // aligned long or double
997 NONSTATIC_OOP,
998 NONSTATIC_BYTE,
999 NONSTATIC_SHORT,
1000 NONSTATIC_WORD,
1001 NONSTATIC_DOUBLE,
1002 MAX_FIELD_ALLOCATION_TYPE,
1003 BAD_ALLOCATION_TYPE = -1
1004 };
1005
1006 static FieldAllocationType _basic_type_to_atype[2 * (T_CONFLICT + 1)] = {
1007 BAD_ALLOCATION_TYPE, // 0
1008 BAD_ALLOCATION_TYPE, // 1
1009 BAD_ALLOCATION_TYPE, // 2
1010 BAD_ALLOCATION_TYPE, // 3
1011 NONSTATIC_BYTE , // T_BOOLEAN = 4,
1012 NONSTATIC_SHORT, // T_CHAR = 5,
1013 NONSTATIC_WORD, // T_FLOAT = 6,
1014 NONSTATIC_DOUBLE, // T_DOUBLE = 7,
1015 NONSTATIC_BYTE, // T_BYTE = 8,
1016 NONSTATIC_SHORT, // T_SHORT = 9,
1017 NONSTATIC_WORD, // T_INT = 10,
1018 NONSTATIC_DOUBLE, // T_LONG = 11,
1019 NONSTATIC_OOP, // T_OBJECT = 12,
1020 NONSTATIC_OOP, // T_ARRAY = 13,
1021 BAD_ALLOCATION_TYPE, // T_VOID = 14,
1022 BAD_ALLOCATION_TYPE, // T_ADDRESS = 15,
1023 BAD_ALLOCATION_TYPE, // T_NARROWOOP= 16,
1024 BAD_ALLOCATION_TYPE, // T_CONFLICT = 17,
1025 BAD_ALLOCATION_TYPE, // 0
1026 BAD_ALLOCATION_TYPE, // 1
1027 BAD_ALLOCATION_TYPE, // 2
1028 BAD_ALLOCATION_TYPE, // 3
1029 STATIC_BYTE , // T_BOOLEAN = 4,
1030 STATIC_SHORT, // T_CHAR = 5,
1031 STATIC_WORD, // T_FLOAT = 6,
1032 STATIC_DOUBLE, // T_DOUBLE = 7,
1033 STATIC_BYTE, // T_BYTE = 8,
1034 STATIC_SHORT, // T_SHORT = 9,
1035 STATIC_WORD, // T_INT = 10,
1036 STATIC_DOUBLE, // T_LONG = 11,
1037 STATIC_OOP, // T_OBJECT = 12,
1038 STATIC_OOP, // T_ARRAY = 13,
1039 BAD_ALLOCATION_TYPE, // T_VOID = 14,
1040 BAD_ALLOCATION_TYPE, // T_ADDRESS = 15,
1041 BAD_ALLOCATION_TYPE, // T_NARROWOOP= 16,
1042 BAD_ALLOCATION_TYPE, // T_CONFLICT = 17,
1043 };
1044
1045 static FieldAllocationType basic_type_to_atype(bool is_static, BasicType type) {
1046 assert(type >= T_BOOLEAN && type < T_VOID, "only allowable values");
1047 FieldAllocationType result = _basic_type_to_atype[type + (is_static ? (T_CONFLICT + 1) : 0)];
1048 assert(result != BAD_ALLOCATION_TYPE, "bad type");
1049 return result;
1050 }
1051
1052 class FieldAllocationCount: public ResourceObj {
1053 public:
1054 u2 count[MAX_FIELD_ALLOCATION_TYPE];
1055
1056 FieldAllocationCount() {
1057 for (int i = 0; i < MAX_FIELD_ALLOCATION_TYPE; i++) {
1058 count[i] = 0;
1059 }
1060 }
1061
1062 FieldAllocationType update(bool is_static, BasicType type) {
1063 FieldAllocationType atype = basic_type_to_atype(is_static, type);
1064 // Make sure there is no overflow with injected fields.
1065 assert(count[atype] < 0xFFFF, "More than 65535 fields");
1066 count[atype]++;
1067 return atype;
1068 }
1069 };
1070
1071
1072 typeArrayHandle ClassFileParser::parse_fields(Symbol* class_name,
1073 constantPoolHandle cp, bool is_interface,
1074 FieldAllocationCount *fac,
1075 objArrayHandle* fields_annotations,
1076 u2* java_fields_count_ptr, TRAPS) {
1077 ClassFileStream* cfs = stream();
1078 typeArrayHandle nullHandle;
1079 cfs->guarantee_more(2, CHECK_(nullHandle)); // length
1080 u2 length = cfs->get_u2_fast();
1081 *java_fields_count_ptr = length;
1082
1083 int num_injected = 0;
1084 InjectedField* injected = JavaClasses::get_injected(class_name, &num_injected);
1085
1086 // Tuples of shorts [access, name index, sig index, initial value index, byte offset, generic signature index]
1087 typeArrayOop new_fields = oopFactory::new_permanent_shortArray((length + num_injected) * FieldInfo::field_slots, CHECK_(nullHandle));
1088 typeArrayHandle fields(THREAD, new_fields);
1089
1090 typeArrayHandle field_annotations;
1091 for (int n = 0; n < length; n++) {
1092 cfs->guarantee_more(8, CHECK_(nullHandle)); // access_flags, name_index, descriptor_index, attributes_count
1093
1094 AccessFlags access_flags;
1095 jint flags = cfs->get_u2_fast() & JVM_RECOGNIZED_FIELD_MODIFIERS;
1096 verify_legal_field_modifiers(flags, is_interface, CHECK_(nullHandle));
1097 access_flags.set_flags(flags);
1098
1099 u2 name_index = cfs->get_u2_fast();
1100 int cp_size = cp->length();
1101 check_property(
1102 valid_cp_range(name_index, cp_size) && cp->tag_at(name_index).is_utf8(),
1103 "Invalid constant pool index %u for field name in class file %s",
1104 name_index, CHECK_(nullHandle));
1105 Symbol* name = cp->symbol_at(name_index);
1106 verify_legal_field_name(name, CHECK_(nullHandle));
1107
1108 u2 signature_index = cfs->get_u2_fast();
1109 check_property(
1110 valid_cp_range(signature_index, cp_size) &&
1111 cp->tag_at(signature_index).is_utf8(),
1112 "Invalid constant pool index %u for field signature in class file %s",
1113 signature_index, CHECK_(nullHandle));
1114 Symbol* sig = cp->symbol_at(signature_index);
1115 verify_legal_field_signature(name, sig, CHECK_(nullHandle));
1116
1117 u2 constantvalue_index = 0;
1118 bool is_synthetic = false;
1119 u2 generic_signature_index = 0;
1120 bool is_static = access_flags.is_static();
1121
1122 u2 attributes_count = cfs->get_u2_fast();
1123 if (attributes_count > 0) {
1124 parse_field_attributes(cp, attributes_count, is_static, signature_index,
1125 &constantvalue_index, &is_synthetic,
1126 &generic_signature_index, &field_annotations,
1127 CHECK_(nullHandle));
1128 if (field_annotations.not_null()) {
1129 if (fields_annotations->is_null()) {
1130 objArrayOop md = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
1131 *fields_annotations = objArrayHandle(THREAD, md);
1132 }
1133 (*fields_annotations)->obj_at_put(n, field_annotations());
1134 }
1135 if (is_synthetic) {
1136 access_flags.set_is_synthetic();
1137 }
1138 }
1139
1140 FieldInfo* field = FieldInfo::from_field_array(fields(), n);
1141 field->initialize(access_flags.as_short(),
1142 name_index,
1143 signature_index,
1144 constantvalue_index,
1145 generic_signature_index,
1146 0);
1147
1148 BasicType type = cp->basic_type_for_signature_at(signature_index);
1149
1150 // Remember how many oops we encountered and compute allocation type
1151 FieldAllocationType atype = fac->update(is_static, type);
1152
1153 // The correct offset is computed later (all oop fields will be located together)
1154 // We temporarily store the allocation type in the offset field
1155 field->set_offset(atype);
1156 }
1157
1158 if (num_injected != 0) {
1159 int index = length;
1160 for (int n = 0; n < num_injected; n++) {
1161 // Check for duplicates
1162 if (injected[n].may_be_java) {
1163 Symbol* name = injected[n].name();
1164 Symbol* signature = injected[n].signature();
1165 bool duplicate = false;
1166 for (int i = 0; i < length; i++) {
1167 FieldInfo* f = FieldInfo::from_field_array(fields(), i);
1168 if (name == cp->symbol_at(f->name_index()) &&
1169 signature == cp->symbol_at(f->signature_index())) {
1170 // Symbol is desclared in Java so skip this one
1171 duplicate = true;
1172 break;
1173 }
1174 }
1175 if (duplicate) {
1176 // These will be removed from the field array at the end
1177 continue;
1178 }
1179 }
1180
1181 // Injected field
1182 FieldInfo* field = FieldInfo::from_field_array(fields(), index);
1183 field->initialize(JVM_ACC_FIELD_INTERNAL,
1184 injected[n].name_index,
1185 injected[n].signature_index,
1186 0,
1187 0,
1188 0);
1189
1190 BasicType type = FieldType::basic_type(injected[n].signature());
1191
1192 // Remember how many oops we encountered and compute allocation type
1193 FieldAllocationType atype = fac->update(false, type);
1194
1195 // The correct offset is computed later (all oop fields will be located together)
1196 // We temporarily store the allocation type in the offset field
1197 field->set_offset(atype);
1198 index++;
1199 }
1200
1201 if (index < length + num_injected) {
1202 // sometimes injected fields already exist in the Java source so
1203 // the fields array could be too long. In that case trim the
1204 // fields array.
1205 new_fields = oopFactory::new_permanent_shortArray(index * FieldInfo::field_slots, CHECK_(nullHandle));
1206 for (int i = 0; i < index * FieldInfo::field_slots; i++) {
1207 new_fields->short_at_put(i, fields->short_at(i));
1208 }
1209 fields = new_fields;
1210 }
1211 }
1212
1213 if (_need_verify && length > 1) {
1214 // Check duplicated fields
1215 ResourceMark rm(THREAD);
1216 NameSigHash** names_and_sigs = NEW_RESOURCE_ARRAY_IN_THREAD(
1217 THREAD, NameSigHash*, HASH_ROW_SIZE);
1218 initialize_hashtable(names_and_sigs);
1219 bool dup = false;
1220 {
1221 debug_only(No_Safepoint_Verifier nsv;)
1222 for (AllFieldStream fs(fields, cp); !fs.done(); fs.next()) {
1223 Symbol* name = fs.name();
1224 Symbol* sig = fs.signature();
1225 // If no duplicates, add name/signature in hashtable names_and_sigs.
1226 if (!put_after_lookup(name, sig, names_and_sigs)) {
1227 dup = true;
1228 break;
1229 }
1230 }
1231 }
1232 if (dup) {
1233 classfile_parse_error("Duplicate field name&signature in class file %s",
1234 CHECK_(nullHandle));
1235 }
1236 }
1237
1238 return fields;
1239 }
1240
1241
1242 static void copy_u2_with_conversion(u2* dest, u2* src, int length) {
1243 while (length-- > 0) {
1244 *dest++ = Bytes::get_Java_u2((u1*) (src++));
1245 }
1246 }
1247
1248
1249 typeArrayHandle ClassFileParser::parse_exception_table(u4 code_length,
1250 u4 exception_table_length,
1251 constantPoolHandle cp,
1252 TRAPS) {
1253 ClassFileStream* cfs = stream();
1254 typeArrayHandle nullHandle;
1255
1256 // 4-tuples of ints [start_pc, end_pc, handler_pc, catch_type index]
1257 typeArrayOop eh = oopFactory::new_permanent_intArray(exception_table_length*4, CHECK_(nullHandle));
1258 typeArrayHandle exception_handlers = typeArrayHandle(THREAD, eh);
1259
1260 int index = 0;
1261 cfs->guarantee_more(8 * exception_table_length, CHECK_(nullHandle)); // start_pc, end_pc, handler_pc, catch_type_index
1262 for (unsigned int i = 0; i < exception_table_length; i++) {
1263 u2 start_pc = cfs->get_u2_fast();
1264 u2 end_pc = cfs->get_u2_fast();
1265 u2 handler_pc = cfs->get_u2_fast();
1266 u2 catch_type_index = cfs->get_u2_fast();
1267 // Will check legal target after parsing code array in verifier.
1268 if (_need_verify) {
1269 guarantee_property((start_pc < end_pc) && (end_pc <= code_length),
1270 "Illegal exception table range in class file %s", CHECK_(nullHandle));
1271 guarantee_property(handler_pc < code_length,
1272 "Illegal exception table handler in class file %s", CHECK_(nullHandle));
1273 if (catch_type_index != 0) {
1274 guarantee_property(valid_cp_range(catch_type_index, cp->length()) &&
1275 is_klass_reference(cp, catch_type_index),
1276 "Catch type in exception table has bad constant type in class file %s", CHECK_(nullHandle));
1277 }
1278 }
1279 exception_handlers->int_at_put(index++, start_pc);
1280 exception_handlers->int_at_put(index++, end_pc);
1281 exception_handlers->int_at_put(index++, handler_pc);
1282 exception_handlers->int_at_put(index++, catch_type_index);
1283 }
1284 return exception_handlers;
1285 }
1286
1287 void ClassFileParser::parse_linenumber_table(
1288 u4 code_attribute_length, u4 code_length,
1289 CompressedLineNumberWriteStream** write_stream, TRAPS) {
1290 ClassFileStream* cfs = stream();
1291 unsigned int num_entries = cfs->get_u2(CHECK);
1292
1293 // Each entry is a u2 start_pc, and a u2 line_number
1294 unsigned int length_in_bytes = num_entries * (sizeof(u2) + sizeof(u2));
1295
1296 // Verify line number attribute and table length
1297 check_property(
1298 code_attribute_length == sizeof(u2) + length_in_bytes,
1299 "LineNumberTable attribute has wrong length in class file %s", CHECK);
1300
1301 cfs->guarantee_more(length_in_bytes, CHECK);
1302
1303 if ((*write_stream) == NULL) {
1304 if (length_in_bytes > fixed_buffer_size) {
1305 (*write_stream) = new CompressedLineNumberWriteStream(length_in_bytes);
1306 } else {
1307 (*write_stream) = new CompressedLineNumberWriteStream(
1308 linenumbertable_buffer, fixed_buffer_size);
1309 }
1310 }
1311
1312 while (num_entries-- > 0) {
1313 u2 bci = cfs->get_u2_fast(); // start_pc
1314 u2 line = cfs->get_u2_fast(); // line_number
1315 guarantee_property(bci < code_length,
1316 "Invalid pc in LineNumberTable in class file %s", CHECK);
1317 (*write_stream)->write_pair(bci, line);
1318 }
1319 }
1320
1321
1322 // Class file LocalVariableTable elements.
1323 class Classfile_LVT_Element VALUE_OBJ_CLASS_SPEC {
1324 public:
1325 u2 start_bci;
1326 u2 length;
1327 u2 name_cp_index;
1328 u2 descriptor_cp_index;
1329 u2 slot;
1330 };
1331
1332
1333 class LVT_Hash: public CHeapObj {
1334 public:
1335 LocalVariableTableElement *_elem; // element
1336 LVT_Hash* _next; // Next entry in hash table
1337 };
1338
1339 unsigned int hash(LocalVariableTableElement *elem) {
1340 unsigned int raw_hash = elem->start_bci;
1341
1342 raw_hash = elem->length + raw_hash * 37;
1343 raw_hash = elem->name_cp_index + raw_hash * 37;
1344 raw_hash = elem->slot + raw_hash * 37;
1345
1346 return raw_hash % HASH_ROW_SIZE;
1347 }
1348
1349 void initialize_hashtable(LVT_Hash** table) {
1350 for (int i = 0; i < HASH_ROW_SIZE; i++) {
1351 table[i] = NULL;
1352 }
1353 }
1354
1355 void clear_hashtable(LVT_Hash** table) {
1356 for (int i = 0; i < HASH_ROW_SIZE; i++) {
1357 LVT_Hash* current = table[i];
1358 LVT_Hash* next;
1359 while (current != NULL) {
1360 next = current->_next;
1361 current->_next = NULL;
1362 delete(current);
1363 current = next;
1364 }
1365 table[i] = NULL;
1366 }
1367 }
1368
1369 LVT_Hash* LVT_lookup(LocalVariableTableElement *elem, int index, LVT_Hash** table) {
1370 LVT_Hash* entry = table[index];
1371
1372 /*
1373 * 3-tuple start_bci/length/slot has to be unique key,
1374 * so the following comparison seems to be redundant:
1375 * && elem->name_cp_index == entry->_elem->name_cp_index
1376 */
1377 while (entry != NULL) {
1378 if (elem->start_bci == entry->_elem->start_bci
1379 && elem->length == entry->_elem->length
1380 && elem->name_cp_index == entry->_elem->name_cp_index
1381 && elem->slot == entry->_elem->slot
1382 ) {
1383 return entry;
1384 }
1385 entry = entry->_next;
1386 }
1387 return NULL;
1388 }
1389
1390 // Return false if the local variable is found in table.
1391 // Return true if no duplicate is found.
1392 // And local variable is added as a new entry in table.
1393 bool LVT_put_after_lookup(LocalVariableTableElement *elem, LVT_Hash** table) {
1394 // First lookup for duplicates
1395 int index = hash(elem);
1396 LVT_Hash* entry = LVT_lookup(elem, index, table);
1397
1398 if (entry != NULL) {
1399 return false;
1400 }
1401 // No duplicate is found, allocate a new entry and fill it.
1402 if ((entry = new LVT_Hash()) == NULL) {
1403 return false;
1404 }
1405 entry->_elem = elem;
1406
1407 // Insert into hash table
1408 entry->_next = table[index];
1409 table[index] = entry;
1410
1411 return true;
1412 }
1413
1414 void copy_lvt_element(Classfile_LVT_Element *src, LocalVariableTableElement *lvt) {
1415 lvt->start_bci = Bytes::get_Java_u2((u1*) &src->start_bci);
1416 lvt->length = Bytes::get_Java_u2((u1*) &src->length);
1417 lvt->name_cp_index = Bytes::get_Java_u2((u1*) &src->name_cp_index);
1418 lvt->descriptor_cp_index = Bytes::get_Java_u2((u1*) &src->descriptor_cp_index);
1419 lvt->signature_cp_index = 0;
1420 lvt->slot = Bytes::get_Java_u2((u1*) &src->slot);
1421 }
1422
1423 // Function is used to parse both attributes:
1424 // LocalVariableTable (LVT) and LocalVariableTypeTable (LVTT)
1425 u2* ClassFileParser::parse_localvariable_table(u4 code_length,
1426 u2 max_locals,
1427 u4 code_attribute_length,
1428 constantPoolHandle cp,
1429 u2* localvariable_table_length,
1430 bool isLVTT,
1431 TRAPS) {
1432 ClassFileStream* cfs = stream();
1433 const char * tbl_name = (isLVTT) ? "LocalVariableTypeTable" : "LocalVariableTable";
1434 *localvariable_table_length = cfs->get_u2(CHECK_NULL);
1435 unsigned int size = (*localvariable_table_length) * sizeof(Classfile_LVT_Element) / sizeof(u2);
1436 // Verify local variable table attribute has right length
1437 if (_need_verify) {
1438 guarantee_property(code_attribute_length == (sizeof(*localvariable_table_length) + size * sizeof(u2)),
1439 "%s has wrong length in class file %s", tbl_name, CHECK_NULL);
1440 }
1441 u2* localvariable_table_start = cfs->get_u2_buffer();
1442 assert(localvariable_table_start != NULL, "null local variable table");
1443 if (!_need_verify) {
1444 cfs->skip_u2_fast(size);
1445 } else {
1446 cfs->guarantee_more(size * 2, CHECK_NULL);
1447 for(int i = 0; i < (*localvariable_table_length); i++) {
1448 u2 start_pc = cfs->get_u2_fast();
1449 u2 length = cfs->get_u2_fast();
1450 u2 name_index = cfs->get_u2_fast();
1451 u2 descriptor_index = cfs->get_u2_fast();
1452 u2 index = cfs->get_u2_fast();
1453 // Assign to a u4 to avoid overflow
1454 u4 end_pc = (u4)start_pc + (u4)length;
1455
1456 if (start_pc >= code_length) {
1457 classfile_parse_error(
1458 "Invalid start_pc %u in %s in class file %s",
1459 start_pc, tbl_name, CHECK_NULL);
1460 }
1461 if (end_pc > code_length) {
1462 classfile_parse_error(
1463 "Invalid length %u in %s in class file %s",
1464 length, tbl_name, CHECK_NULL);
1465 }
1466 int cp_size = cp->length();
1467 guarantee_property(
1468 valid_cp_range(name_index, cp_size) &&
1469 cp->tag_at(name_index).is_utf8(),
1470 "Name index %u in %s has bad constant type in class file %s",
1471 name_index, tbl_name, CHECK_NULL);
1472 guarantee_property(
1473 valid_cp_range(descriptor_index, cp_size) &&
1474 cp->tag_at(descriptor_index).is_utf8(),
1475 "Signature index %u in %s has bad constant type in class file %s",
1476 descriptor_index, tbl_name, CHECK_NULL);
1477
1478 Symbol* name = cp->symbol_at(name_index);
1479 Symbol* sig = cp->symbol_at(descriptor_index);
1480 verify_legal_field_name(name, CHECK_NULL);
1481 u2 extra_slot = 0;
1482 if (!isLVTT) {
1483 verify_legal_field_signature(name, sig, CHECK_NULL);
1484
1485 // 4894874: check special cases for double and long local variables
1486 if (sig == vmSymbols::type_signature(T_DOUBLE) ||
1487 sig == vmSymbols::type_signature(T_LONG)) {
1488 extra_slot = 1;
1489 }
1490 }
1491 guarantee_property((index + extra_slot) < max_locals,
1492 "Invalid index %u in %s in class file %s",
1493 index, tbl_name, CHECK_NULL);
1494 }
1495 }
1496 return localvariable_table_start;
1497 }
1498
1499
1500 void ClassFileParser::parse_type_array(u2 array_length, u4 code_length, u4* u1_index, u4* u2_index,
1501 u1* u1_array, u2* u2_array, constantPoolHandle cp, TRAPS) {
1502 ClassFileStream* cfs = stream();
1503 u2 index = 0; // index in the array with long/double occupying two slots
1504 u4 i1 = *u1_index;
1505 u4 i2 = *u2_index + 1;
1506 for(int i = 0; i < array_length; i++) {
1507 u1 tag = u1_array[i1++] = cfs->get_u1(CHECK);
1508 index++;
1509 if (tag == ITEM_Long || tag == ITEM_Double) {
1510 index++;
1511 } else if (tag == ITEM_Object) {
1512 u2 class_index = u2_array[i2++] = cfs->get_u2(CHECK);
1513 guarantee_property(valid_cp_range(class_index, cp->length()) &&
1514 is_klass_reference(cp, class_index),
1515 "Bad class index %u in StackMap in class file %s",
1516 class_index, CHECK);
1517 } else if (tag == ITEM_Uninitialized) {
1518 u2 offset = u2_array[i2++] = cfs->get_u2(CHECK);
1519 guarantee_property(
1520 offset < code_length,
1521 "Bad uninitialized type offset %u in StackMap in class file %s",
1522 offset, CHECK);
1523 } else {
1524 guarantee_property(
1525 tag <= (u1)ITEM_Uninitialized,
1526 "Unknown variable type %u in StackMap in class file %s",
1527 tag, CHECK);
1528 }
1529 }
1530 u2_array[*u2_index] = index;
1531 *u1_index = i1;
1532 *u2_index = i2;
1533 }
1534
1535 typeArrayOop ClassFileParser::parse_stackmap_table(
1536 u4 code_attribute_length, TRAPS) {
1537 if (code_attribute_length == 0)
1538 return NULL;
1539
1540 ClassFileStream* cfs = stream();
1541 u1* stackmap_table_start = cfs->get_u1_buffer();
1542 assert(stackmap_table_start != NULL, "null stackmap table");
1543
1544 // check code_attribute_length first
1545 stream()->skip_u1(code_attribute_length, CHECK_NULL);
1546
1547 if (!_need_verify && !DumpSharedSpaces) {
1548 return NULL;
1549 }
1550
1551 typeArrayOop stackmap_data =
1552 oopFactory::new_permanent_byteArray(code_attribute_length, CHECK_NULL);
1553
1554 stackmap_data->set_length(code_attribute_length);
1555 memcpy((void*)stackmap_data->byte_at_addr(0),
1556 (void*)stackmap_table_start, code_attribute_length);
1557 return stackmap_data;
1558 }
1559
1560 u2* ClassFileParser::parse_checked_exceptions(u2* checked_exceptions_length,
1561 u4 method_attribute_length,
1562 constantPoolHandle cp, TRAPS) {
1563 ClassFileStream* cfs = stream();
1564 cfs->guarantee_more(2, CHECK_NULL); // checked_exceptions_length
1565 *checked_exceptions_length = cfs->get_u2_fast();
1566 unsigned int size = (*checked_exceptions_length) * sizeof(CheckedExceptionElement) / sizeof(u2);
1567 u2* checked_exceptions_start = cfs->get_u2_buffer();
1568 assert(checked_exceptions_start != NULL, "null checked exceptions");
1569 if (!_need_verify) {
1570 cfs->skip_u2_fast(size);
1571 } else {
1572 // Verify each value in the checked exception table
1573 u2 checked_exception;
1574 u2 len = *checked_exceptions_length;
1575 cfs->guarantee_more(2 * len, CHECK_NULL);
1576 for (int i = 0; i < len; i++) {
1577 checked_exception = cfs->get_u2_fast();
1578 check_property(
1579 valid_cp_range(checked_exception, cp->length()) &&
1580 is_klass_reference(cp, checked_exception),
1581 "Exception name has bad type at constant pool %u in class file %s",
1582 checked_exception, CHECK_NULL);
1583 }
1584 }
1585 // check exceptions attribute length
1586 if (_need_verify) {
1587 guarantee_property(method_attribute_length == (sizeof(*checked_exceptions_length) +
1588 sizeof(u2) * size),
1589 "Exceptions attribute has wrong length in class file %s", CHECK_NULL);
1590 }
1591 return checked_exceptions_start;
1592 }
1593
1594 void ClassFileParser::throwIllegalSignature(
1595 const char* type, Symbol* name, Symbol* sig, TRAPS) {
1596 ResourceMark rm(THREAD);
1597 Exceptions::fthrow(THREAD_AND_LOCATION,
1598 vmSymbols::java_lang_ClassFormatError(),
1599 "%s \"%s\" in class %s has illegal signature \"%s\"", type,
1600 name->as_C_string(), _class_name->as_C_string(), sig->as_C_string());
1601 }
1602
1603 #define MAX_ARGS_SIZE 255
1604 #define MAX_CODE_SIZE 65535
1605 #define INITIAL_MAX_LVT_NUMBER 256
1606
1607 // Note: the parse_method below is big and clunky because all parsing of the code and exceptions
1608 // attribute is inlined. This is curbersome to avoid since we inline most of the parts in the
1609 // methodOop to save footprint, so we only know the size of the resulting methodOop when the
1610 // entire method attribute is parsed.
1611 //
1612 // The promoted_flags parameter is used to pass relevant access_flags
1613 // from the method back up to the containing klass. These flag values
1614 // are added to klass's access_flags.
1615
1616 methodHandle ClassFileParser::parse_method(constantPoolHandle cp, bool is_interface,
1617 AccessFlags *promoted_flags,
1618 typeArrayHandle* method_annotations,
1619 typeArrayHandle* method_parameter_annotations,
1620 typeArrayHandle* method_default_annotations,
1621 TRAPS) {
1622 ClassFileStream* cfs = stream();
1623 methodHandle nullHandle;
1624 ResourceMark rm(THREAD);
1625 // Parse fixed parts
1626 cfs->guarantee_more(8, CHECK_(nullHandle)); // access_flags, name_index, descriptor_index, attributes_count
1627
1628 int flags = cfs->get_u2_fast();
1629 u2 name_index = cfs->get_u2_fast();
1630 int cp_size = cp->length();
1631 check_property(
1632 valid_cp_range(name_index, cp_size) &&
1633 cp->tag_at(name_index).is_utf8(),
1634 "Illegal constant pool index %u for method name in class file %s",
1635 name_index, CHECK_(nullHandle));
1636 Symbol* name = cp->symbol_at(name_index);
1637 verify_legal_method_name(name, CHECK_(nullHandle));
1638
1639 u2 signature_index = cfs->get_u2_fast();
1640 guarantee_property(
1641 valid_cp_range(signature_index, cp_size) &&
1642 cp->tag_at(signature_index).is_utf8(),
1643 "Illegal constant pool index %u for method signature in class file %s",
1644 signature_index, CHECK_(nullHandle));
1645 Symbol* signature = cp->symbol_at(signature_index);
1646
1647 AccessFlags access_flags;
1648 if (name == vmSymbols::class_initializer_name()) {
1649 // We ignore the other access flags for a valid class initializer.
1650 // (JVM Spec 2nd ed., chapter 4.6)
1651 if (_major_version < 51) { // backward compatibility
1652 flags = JVM_ACC_STATIC;
1653 } else if ((flags & JVM_ACC_STATIC) == JVM_ACC_STATIC) {
1654 flags &= JVM_ACC_STATIC | JVM_ACC_STRICT;
1655 }
1656 } else {
1657 verify_legal_method_modifiers(flags, is_interface, name, CHECK_(nullHandle));
1658 }
1659
1660 int args_size = -1; // only used when _need_verify is true
1661 if (_need_verify) {
1662 args_size = ((flags & JVM_ACC_STATIC) ? 0 : 1) +
1663 verify_legal_method_signature(name, signature, CHECK_(nullHandle));
1664 if (args_size > MAX_ARGS_SIZE) {
1665 classfile_parse_error("Too many arguments in method signature in class file %s", CHECK_(nullHandle));
1666 }
1667 }
1668
1669 access_flags.set_flags(flags & JVM_RECOGNIZED_METHOD_MODIFIERS);
1670
1671 // Default values for code and exceptions attribute elements
1672 u2 max_stack = 0;
1673 u2 max_locals = 0;
1674 u4 code_length = 0;
1675 u1* code_start = 0;
1676 u2 exception_table_length = 0;
1677 typeArrayHandle exception_handlers(THREAD, Universe::the_empty_int_array());
1678 u2 checked_exceptions_length = 0;
1679 u2* checked_exceptions_start = NULL;
1680 CompressedLineNumberWriteStream* linenumber_table = NULL;
1681 int linenumber_table_length = 0;
1682 int total_lvt_length = 0;
1683 u2 lvt_cnt = 0;
1684 u2 lvtt_cnt = 0;
1685 bool lvt_allocated = false;
1686 u2 max_lvt_cnt = INITIAL_MAX_LVT_NUMBER;
1687 u2 max_lvtt_cnt = INITIAL_MAX_LVT_NUMBER;
1688 u2* localvariable_table_length;
1689 u2** localvariable_table_start;
1690 u2* localvariable_type_table_length;
1691 u2** localvariable_type_table_start;
1692 bool parsed_code_attribute = false;
1693 bool parsed_checked_exceptions_attribute = false;
1694 bool parsed_stackmap_attribute = false;
1695 // stackmap attribute - JDK1.5
1696 typeArrayHandle stackmap_data;
1697 u2 generic_signature_index = 0;
1698 u1* runtime_visible_annotations = NULL;
1699 int runtime_visible_annotations_length = 0;
1700 u1* runtime_invisible_annotations = NULL;
1701 int runtime_invisible_annotations_length = 0;
1702 u1* runtime_visible_parameter_annotations = NULL;
1703 int runtime_visible_parameter_annotations_length = 0;
1704 u1* runtime_invisible_parameter_annotations = NULL;
1705 int runtime_invisible_parameter_annotations_length = 0;
1706 u1* annotation_default = NULL;
1707 int annotation_default_length = 0;
1708
1709 // Parse code and exceptions attribute
1710 u2 method_attributes_count = cfs->get_u2_fast();
1711 while (method_attributes_count--) {
1712 cfs->guarantee_more(6, CHECK_(nullHandle)); // method_attribute_name_index, method_attribute_length
1713 u2 method_attribute_name_index = cfs->get_u2_fast();
1714 u4 method_attribute_length = cfs->get_u4_fast();
1715 check_property(
1716 valid_cp_range(method_attribute_name_index, cp_size) &&
1717 cp->tag_at(method_attribute_name_index).is_utf8(),
1718 "Invalid method attribute name index %u in class file %s",
1719 method_attribute_name_index, CHECK_(nullHandle));
1720
1721 Symbol* method_attribute_name = cp->symbol_at(method_attribute_name_index);
1722 if (method_attribute_name == vmSymbols::tag_code()) {
1723 // Parse Code attribute
1724 if (_need_verify) {
1725 guarantee_property(!access_flags.is_native() && !access_flags.is_abstract(),
1726 "Code attribute in native or abstract methods in class file %s",
1727 CHECK_(nullHandle));
1728 }
1729 if (parsed_code_attribute) {
1730 classfile_parse_error("Multiple Code attributes in class file %s", CHECK_(nullHandle));
1731 }
1732 parsed_code_attribute = true;
1733
1734 // Stack size, locals size, and code size
1735 if (_major_version == 45 && _minor_version <= 2) {
1736 cfs->guarantee_more(4, CHECK_(nullHandle));
1737 max_stack = cfs->get_u1_fast();
1738 max_locals = cfs->get_u1_fast();
1739 code_length = cfs->get_u2_fast();
1740 } else {
1741 cfs->guarantee_more(8, CHECK_(nullHandle));
1742 max_stack = cfs->get_u2_fast();
1743 max_locals = cfs->get_u2_fast();
1744 code_length = cfs->get_u4_fast();
1745 }
1746 if (_need_verify) {
1747 guarantee_property(args_size <= max_locals,
1748 "Arguments can't fit into locals in class file %s", CHECK_(nullHandle));
1749 guarantee_property(code_length > 0 && code_length <= MAX_CODE_SIZE,
1750 "Invalid method Code length %u in class file %s",
1751 code_length, CHECK_(nullHandle));
1752 }
1753 // Code pointer
1754 code_start = cfs->get_u1_buffer();
1755 assert(code_start != NULL, "null code start");
1756 cfs->guarantee_more(code_length, CHECK_(nullHandle));
1757 cfs->skip_u1_fast(code_length);
1758
1759 // Exception handler table
1760 cfs->guarantee_more(2, CHECK_(nullHandle)); // exception_table_length
1761 exception_table_length = cfs->get_u2_fast();
1762 if (exception_table_length > 0) {
1763 exception_handlers =
1764 parse_exception_table(code_length, exception_table_length, cp, CHECK_(nullHandle));
1765 }
1766
1767 // Parse additional attributes in code attribute
1768 cfs->guarantee_more(2, CHECK_(nullHandle)); // code_attributes_count
1769 u2 code_attributes_count = cfs->get_u2_fast();
1770
1771 unsigned int calculated_attribute_length = 0;
1772
1773 if (_major_version > 45 || (_major_version == 45 && _minor_version > 2)) {
1774 calculated_attribute_length =
1775 sizeof(max_stack) + sizeof(max_locals) + sizeof(code_length);
1776 } else {
1777 // max_stack, locals and length are smaller in pre-version 45.2 classes
1778 calculated_attribute_length = sizeof(u1) + sizeof(u1) + sizeof(u2);
1779 }
1780 calculated_attribute_length +=
1781 code_length +
1782 sizeof(exception_table_length) +
1783 sizeof(code_attributes_count) +
1784 exception_table_length *
1785 ( sizeof(u2) + // start_pc
1786 sizeof(u2) + // end_pc
1787 sizeof(u2) + // handler_pc
1788 sizeof(u2) ); // catch_type_index
1789
1790 while (code_attributes_count--) {
1791 cfs->guarantee_more(6, CHECK_(nullHandle)); // code_attribute_name_index, code_attribute_length
1792 u2 code_attribute_name_index = cfs->get_u2_fast();
1793 u4 code_attribute_length = cfs->get_u4_fast();
1794 calculated_attribute_length += code_attribute_length +
1795 sizeof(code_attribute_name_index) +
1796 sizeof(code_attribute_length);
1797 check_property(valid_cp_range(code_attribute_name_index, cp_size) &&
1798 cp->tag_at(code_attribute_name_index).is_utf8(),
1799 "Invalid code attribute name index %u in class file %s",
1800 code_attribute_name_index,
1801 CHECK_(nullHandle));
1802 if (LoadLineNumberTables &&
1803 cp->symbol_at(code_attribute_name_index) == vmSymbols::tag_line_number_table()) {
1804 // Parse and compress line number table
1805 parse_linenumber_table(code_attribute_length, code_length,
1806 &linenumber_table, CHECK_(nullHandle));
1807
1808 } else if (LoadLocalVariableTables &&
1809 cp->symbol_at(code_attribute_name_index) == vmSymbols::tag_local_variable_table()) {
1810 // Parse local variable table
1811 if (!lvt_allocated) {
1812 localvariable_table_length = NEW_RESOURCE_ARRAY_IN_THREAD(
1813 THREAD, u2, INITIAL_MAX_LVT_NUMBER);
1814 localvariable_table_start = NEW_RESOURCE_ARRAY_IN_THREAD(
1815 THREAD, u2*, INITIAL_MAX_LVT_NUMBER);
1816 localvariable_type_table_length = NEW_RESOURCE_ARRAY_IN_THREAD(
1817 THREAD, u2, INITIAL_MAX_LVT_NUMBER);
1818 localvariable_type_table_start = NEW_RESOURCE_ARRAY_IN_THREAD(
1819 THREAD, u2*, INITIAL_MAX_LVT_NUMBER);
1820 lvt_allocated = true;
1821 }
1822 if (lvt_cnt == max_lvt_cnt) {
1823 max_lvt_cnt <<= 1;
1824 REALLOC_RESOURCE_ARRAY(u2, localvariable_table_length, lvt_cnt, max_lvt_cnt);
1825 REALLOC_RESOURCE_ARRAY(u2*, localvariable_table_start, lvt_cnt, max_lvt_cnt);
1826 }
1827 localvariable_table_start[lvt_cnt] =
1828 parse_localvariable_table(code_length,
1829 max_locals,
1830 code_attribute_length,
1831 cp,
1832 &localvariable_table_length[lvt_cnt],
1833 false, // is not LVTT
1834 CHECK_(nullHandle));
1835 total_lvt_length += localvariable_table_length[lvt_cnt];
1836 lvt_cnt++;
1837 } else if (LoadLocalVariableTypeTables &&
1838 _major_version >= JAVA_1_5_VERSION &&
1839 cp->symbol_at(code_attribute_name_index) == vmSymbols::tag_local_variable_type_table()) {
1840 if (!lvt_allocated) {
1841 localvariable_table_length = NEW_RESOURCE_ARRAY_IN_THREAD(
1842 THREAD, u2, INITIAL_MAX_LVT_NUMBER);
1843 localvariable_table_start = NEW_RESOURCE_ARRAY_IN_THREAD(
1844 THREAD, u2*, INITIAL_MAX_LVT_NUMBER);
1845 localvariable_type_table_length = NEW_RESOURCE_ARRAY_IN_THREAD(
1846 THREAD, u2, INITIAL_MAX_LVT_NUMBER);
1847 localvariable_type_table_start = NEW_RESOURCE_ARRAY_IN_THREAD(
1848 THREAD, u2*, INITIAL_MAX_LVT_NUMBER);
1849 lvt_allocated = true;
1850 }
1851 // Parse local variable type table
1852 if (lvtt_cnt == max_lvtt_cnt) {
1853 max_lvtt_cnt <<= 1;
1854 REALLOC_RESOURCE_ARRAY(u2, localvariable_type_table_length, lvtt_cnt, max_lvtt_cnt);
1855 REALLOC_RESOURCE_ARRAY(u2*, localvariable_type_table_start, lvtt_cnt, max_lvtt_cnt);
1856 }
1857 localvariable_type_table_start[lvtt_cnt] =
1858 parse_localvariable_table(code_length,
1859 max_locals,
1860 code_attribute_length,
1861 cp,
1862 &localvariable_type_table_length[lvtt_cnt],
1863 true, // is LVTT
1864 CHECK_(nullHandle));
1865 lvtt_cnt++;
1866 } else if (UseSplitVerifier &&
1867 _major_version >= Verifier::STACKMAP_ATTRIBUTE_MAJOR_VERSION &&
1868 cp->symbol_at(code_attribute_name_index) == vmSymbols::tag_stack_map_table()) {
1869 // Stack map is only needed by the new verifier in JDK1.5.
1870 if (parsed_stackmap_attribute) {
1871 classfile_parse_error("Multiple StackMapTable attributes in class file %s", CHECK_(nullHandle));
1872 }
1873 typeArrayOop sm =
1874 parse_stackmap_table(code_attribute_length, CHECK_(nullHandle));
1875 stackmap_data = typeArrayHandle(THREAD, sm);
1876 parsed_stackmap_attribute = true;
1877 } else {
1878 // Skip unknown attributes
1879 cfs->skip_u1(code_attribute_length, CHECK_(nullHandle));
1880 }
1881 }
1882 // check method attribute length
1883 if (_need_verify) {
1884 guarantee_property(method_attribute_length == calculated_attribute_length,
1885 "Code segment has wrong length in class file %s", CHECK_(nullHandle));
1886 }
1887 } else if (method_attribute_name == vmSymbols::tag_exceptions()) {
1888 // Parse Exceptions attribute
1889 if (parsed_checked_exceptions_attribute) {
1890 classfile_parse_error("Multiple Exceptions attributes in class file %s", CHECK_(nullHandle));
1891 }
1892 parsed_checked_exceptions_attribute = true;
1893 checked_exceptions_start =
1894 parse_checked_exceptions(&checked_exceptions_length,
1895 method_attribute_length,
1896 cp, CHECK_(nullHandle));
1897 } else if (method_attribute_name == vmSymbols::tag_synthetic()) {
1898 if (method_attribute_length != 0) {
1899 classfile_parse_error(
1900 "Invalid Synthetic method attribute length %u in class file %s",
1901 method_attribute_length, CHECK_(nullHandle));
1902 }
1903 // Should we check that there hasn't already been a synthetic attribute?
1904 access_flags.set_is_synthetic();
1905 } else if (method_attribute_name == vmSymbols::tag_deprecated()) { // 4276120
1906 if (method_attribute_length != 0) {
1907 classfile_parse_error(
1908 "Invalid Deprecated method attribute length %u in class file %s",
1909 method_attribute_length, CHECK_(nullHandle));
1910 }
1911 } else if (_major_version >= JAVA_1_5_VERSION) {
1912 if (method_attribute_name == vmSymbols::tag_signature()) {
1913 if (method_attribute_length != 2) {
1914 classfile_parse_error(
1915 "Invalid Signature attribute length %u in class file %s",
1916 method_attribute_length, CHECK_(nullHandle));
1917 }
1918 cfs->guarantee_more(2, CHECK_(nullHandle)); // generic_signature_index
1919 generic_signature_index = cfs->get_u2_fast();
1920 } else if (method_attribute_name == vmSymbols::tag_runtime_visible_annotations()) {
1921 runtime_visible_annotations_length = method_attribute_length;
1922 runtime_visible_annotations = cfs->get_u1_buffer();
1923 assert(runtime_visible_annotations != NULL, "null visible annotations");
1924 cfs->skip_u1(runtime_visible_annotations_length, CHECK_(nullHandle));
1925 } else if (PreserveAllAnnotations && method_attribute_name == vmSymbols::tag_runtime_invisible_annotations()) {
1926 runtime_invisible_annotations_length = method_attribute_length;
1927 runtime_invisible_annotations = cfs->get_u1_buffer();
1928 assert(runtime_invisible_annotations != NULL, "null invisible annotations");
1929 cfs->skip_u1(runtime_invisible_annotations_length, CHECK_(nullHandle));
1930 } else if (method_attribute_name == vmSymbols::tag_runtime_visible_parameter_annotations()) {
1931 runtime_visible_parameter_annotations_length = method_attribute_length;
1932 runtime_visible_parameter_annotations = cfs->get_u1_buffer();
1933 assert(runtime_visible_parameter_annotations != NULL, "null visible parameter annotations");
1934 cfs->skip_u1(runtime_visible_parameter_annotations_length, CHECK_(nullHandle));
1935 } else if (PreserveAllAnnotations && method_attribute_name == vmSymbols::tag_runtime_invisible_parameter_annotations()) {
1936 runtime_invisible_parameter_annotations_length = method_attribute_length;
1937 runtime_invisible_parameter_annotations = cfs->get_u1_buffer();
1938 assert(runtime_invisible_parameter_annotations != NULL, "null invisible parameter annotations");
1939 cfs->skip_u1(runtime_invisible_parameter_annotations_length, CHECK_(nullHandle));
1940 } else if (method_attribute_name == vmSymbols::tag_annotation_default()) {
1941 annotation_default_length = method_attribute_length;
1942 annotation_default = cfs->get_u1_buffer();
1943 assert(annotation_default != NULL, "null annotation default");
1944 cfs->skip_u1(annotation_default_length, CHECK_(nullHandle));
1945 } else {
1946 // Skip unknown attributes
1947 cfs->skip_u1(method_attribute_length, CHECK_(nullHandle));
1948 }
1949 } else {
1950 // Skip unknown attributes
1951 cfs->skip_u1(method_attribute_length, CHECK_(nullHandle));
1952 }
1953 }
1954
1955 if (linenumber_table != NULL) {
1956 linenumber_table->write_terminator();
1957 linenumber_table_length = linenumber_table->position();
1958 }
1959
1960 // Make sure there's at least one Code attribute in non-native/non-abstract method
1961 if (_need_verify) {
1962 guarantee_property(access_flags.is_native() || access_flags.is_abstract() || parsed_code_attribute,
1963 "Absent Code attribute in method that is not native or abstract in class file %s", CHECK_(nullHandle));
1964 }
1965
1966 // All sizing information for a methodOop is finally available, now create it
1967 methodOop m_oop = oopFactory::new_method(code_length, access_flags, linenumber_table_length,
1968 total_lvt_length, checked_exceptions_length,
1969 oopDesc::IsSafeConc, CHECK_(nullHandle));
1970 methodHandle m (THREAD, m_oop);
1971
1972 ClassLoadingService::add_class_method_size(m_oop->size()*HeapWordSize);
1973
1974 // Fill in information from fixed part (access_flags already set)
1975 m->set_constants(cp());
1976 m->set_name_index(name_index);
1977 m->set_signature_index(signature_index);
1978 m->set_generic_signature_index(generic_signature_index);
1979 #ifdef CC_INTERP
1980 // hmm is there a gc issue here??
1981 ResultTypeFinder rtf(cp->symbol_at(signature_index));
1982 m->set_result_index(rtf.type());
1983 #endif
1984
1985 if (args_size >= 0) {
1986 m->set_size_of_parameters(args_size);
1987 } else {
1988 m->compute_size_of_parameters(THREAD);
1989 }
1990 #ifdef ASSERT
1991 if (args_size >= 0) {
1992 m->compute_size_of_parameters(THREAD);
1993 assert(args_size == m->size_of_parameters(), "");
1994 }
1995 #endif
1996
1997 // Fill in code attribute information
1998 m->set_max_stack(max_stack);
1999 m->set_max_locals(max_locals);
2000 m->constMethod()->set_stackmap_data(stackmap_data());
2001
2002 /**
2003 * The exception_table field is the flag used to indicate
2004 * that the methodOop and it's associated constMethodOop are partially
2005 * initialized and thus are exempt from pre/post GC verification. Once
2006 * the field is set, the oops are considered fully initialized so make
2007 * sure that the oops can pass verification when this field is set.
2008 */
2009 m->set_exception_table(exception_handlers());
2010
2011 // Copy byte codes
2012 m->set_code(code_start);
2013
2014 // Copy line number table
2015 if (linenumber_table != NULL) {
2016 memcpy(m->compressed_linenumber_table(),
2017 linenumber_table->buffer(), linenumber_table_length);
2018 }
2019
2020 // Copy checked exceptions
2021 if (checked_exceptions_length > 0) {
2022 int size = checked_exceptions_length * sizeof(CheckedExceptionElement) / sizeof(u2);
2023 copy_u2_with_conversion((u2*) m->checked_exceptions_start(), checked_exceptions_start, size);
2024 }
2025
2026 /* Copy class file LVT's/LVTT's into the HotSpot internal LVT.
2027 *
2028 * Rules for LVT's and LVTT's are:
2029 * - There can be any number of LVT's and LVTT's.
2030 * - If there are n LVT's, it is the same as if there was just
2031 * one LVT containing all the entries from the n LVT's.
2032 * - There may be no more than one LVT entry per local variable.
2033 * Two LVT entries are 'equal' if these fields are the same:
2034 * start_pc, length, name, slot
2035 * - There may be no more than one LVTT entry per each LVT entry.
2036 * Each LVTT entry has to match some LVT entry.
2037 * - HotSpot internal LVT keeps natural ordering of class file LVT entries.
2038 */
2039 if (total_lvt_length > 0) {
2040 int tbl_no, idx;
2041
2042 promoted_flags->set_has_localvariable_table();
2043
2044 LVT_Hash** lvt_Hash = NEW_RESOURCE_ARRAY(LVT_Hash*, HASH_ROW_SIZE);
2045 initialize_hashtable(lvt_Hash);
2046
2047 // To fill LocalVariableTable in
2048 Classfile_LVT_Element* cf_lvt;
2049 LocalVariableTableElement* lvt = m->localvariable_table_start();
2050
2051 for (tbl_no = 0; tbl_no < lvt_cnt; tbl_no++) {
2052 cf_lvt = (Classfile_LVT_Element *) localvariable_table_start[tbl_no];
2053 for (idx = 0; idx < localvariable_table_length[tbl_no]; idx++, lvt++) {
2054 copy_lvt_element(&cf_lvt[idx], lvt);
2055 // If no duplicates, add LVT elem in hashtable lvt_Hash.
2056 if (LVT_put_after_lookup(lvt, lvt_Hash) == false
2057 && _need_verify
2058 && _major_version >= JAVA_1_5_VERSION ) {
2059 clear_hashtable(lvt_Hash);
2060 classfile_parse_error("Duplicated LocalVariableTable attribute "
2061 "entry for '%s' in class file %s",
2062 cp->symbol_at(lvt->name_cp_index)->as_utf8(),
2063 CHECK_(nullHandle));
2064 }
2065 }
2066 }
2067
2068 // To merge LocalVariableTable and LocalVariableTypeTable
2069 Classfile_LVT_Element* cf_lvtt;
2070 LocalVariableTableElement lvtt_elem;
2071
2072 for (tbl_no = 0; tbl_no < lvtt_cnt; tbl_no++) {
2073 cf_lvtt = (Classfile_LVT_Element *) localvariable_type_table_start[tbl_no];
2074 for (idx = 0; idx < localvariable_type_table_length[tbl_no]; idx++) {
2075 copy_lvt_element(&cf_lvtt[idx], &lvtt_elem);
2076 int index = hash(&lvtt_elem);
2077 LVT_Hash* entry = LVT_lookup(&lvtt_elem, index, lvt_Hash);
2078 if (entry == NULL) {
2079 if (_need_verify) {
2080 clear_hashtable(lvt_Hash);
2081 classfile_parse_error("LVTT entry for '%s' in class file %s "
2082 "does not match any LVT entry",
2083 cp->symbol_at(lvtt_elem.name_cp_index)->as_utf8(),
2084 CHECK_(nullHandle));
2085 }
2086 } else if (entry->_elem->signature_cp_index != 0 && _need_verify) {
2087 clear_hashtable(lvt_Hash);
2088 classfile_parse_error("Duplicated LocalVariableTypeTable attribute "
2089 "entry for '%s' in class file %s",
2090 cp->symbol_at(lvtt_elem.name_cp_index)->as_utf8(),
2091 CHECK_(nullHandle));
2092 } else {
2093 // to add generic signatures into LocalVariableTable
2094 entry->_elem->signature_cp_index = lvtt_elem.descriptor_cp_index;
2095 }
2096 }
2097 }
2098 clear_hashtable(lvt_Hash);
2099 }
2100
2101 *method_annotations = assemble_annotations(runtime_visible_annotations,
2102 runtime_visible_annotations_length,
2103 runtime_invisible_annotations,
2104 runtime_invisible_annotations_length,
2105 CHECK_(nullHandle));
2106 *method_parameter_annotations = assemble_annotations(runtime_visible_parameter_annotations,
2107 runtime_visible_parameter_annotations_length,
2108 runtime_invisible_parameter_annotations,
2109 runtime_invisible_parameter_annotations_length,
2110 CHECK_(nullHandle));
2111 *method_default_annotations = assemble_annotations(annotation_default,
2112 annotation_default_length,
2113 NULL,
2114 0,
2115 CHECK_(nullHandle));
2116
2117 if (name == vmSymbols::finalize_method_name() &&
2118 signature == vmSymbols::void_method_signature()) {
2119 if (m->is_empty_method()) {
2120 _has_empty_finalizer = true;
2121 } else {
2122 _has_finalizer = true;
2123 }
2124 }
2125 if (name == vmSymbols::object_initializer_name() &&
2126 signature == vmSymbols::void_method_signature() &&
2127 m->is_vanilla_constructor()) {
2128 _has_vanilla_constructor = true;
2129 }
2130
2131 if (EnableInvokeDynamic && (m->is_method_handle_invoke() ||
2132 m->is_method_handle_adapter())) {
2133 THROW_MSG_(vmSymbols::java_lang_VirtualMachineError(),
2134 "Method handle invokers must be defined internally to the VM", nullHandle);
2135 }
2136
2137 return m;
2138 }
2139
2140
2141 // The promoted_flags parameter is used to pass relevant access_flags
2142 // from the methods back up to the containing klass. These flag values
2143 // are added to klass's access_flags.
2144
2145 objArrayHandle ClassFileParser::parse_methods(constantPoolHandle cp, bool is_interface,
2146 AccessFlags* promoted_flags,
2147 bool* has_final_method,
2148 objArrayOop* methods_annotations_oop,
2149 objArrayOop* methods_parameter_annotations_oop,
2150 objArrayOop* methods_default_annotations_oop,
2151 TRAPS) {
2152 ClassFileStream* cfs = stream();
2153 objArrayHandle nullHandle;
2154 typeArrayHandle method_annotations;
2155 typeArrayHandle method_parameter_annotations;
2156 typeArrayHandle method_default_annotations;
2157 cfs->guarantee_more(2, CHECK_(nullHandle)); // length
2158 u2 length = cfs->get_u2_fast();
2159 if (length == 0) {
2160 return objArrayHandle(THREAD, Universe::the_empty_system_obj_array());
2161 } else {
2162 objArrayOop m = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
2163 objArrayHandle methods(THREAD, m);
2164 HandleMark hm(THREAD);
2165 objArrayHandle methods_annotations;
2166 objArrayHandle methods_parameter_annotations;
2167 objArrayHandle methods_default_annotations;
2168 for (int index = 0; index < length; index++) {
2169 methodHandle method = parse_method(cp, is_interface,
2170 promoted_flags,
2171 &method_annotations,
2172 &method_parameter_annotations,
2173 &method_default_annotations,
2174 CHECK_(nullHandle));
2175 if (method->is_final()) {
2176 *has_final_method = true;
2177 }
2178 methods->obj_at_put(index, method());
2179 if (method_annotations.not_null()) {
2180 if (methods_annotations.is_null()) {
2181 objArrayOop md = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
2182 methods_annotations = objArrayHandle(THREAD, md);
2183 }
2184 methods_annotations->obj_at_put(index, method_annotations());
2185 }
2186 if (method_parameter_annotations.not_null()) {
2187 if (methods_parameter_annotations.is_null()) {
2188 objArrayOop md = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
2189 methods_parameter_annotations = objArrayHandle(THREAD, md);
2190 }
2191 methods_parameter_annotations->obj_at_put(index, method_parameter_annotations());
2192 }
2193 if (method_default_annotations.not_null()) {
2194 if (methods_default_annotations.is_null()) {
2195 objArrayOop md = oopFactory::new_system_objArray(length, CHECK_(nullHandle));
2196 methods_default_annotations = objArrayHandle(THREAD, md);
2197 }
2198 methods_default_annotations->obj_at_put(index, method_default_annotations());
2199 }
2200 }
2201 if (_need_verify && length > 1) {
2202 // Check duplicated methods
2203 ResourceMark rm(THREAD);
2204 NameSigHash** names_and_sigs = NEW_RESOURCE_ARRAY_IN_THREAD(
2205 THREAD, NameSigHash*, HASH_ROW_SIZE);
2206 initialize_hashtable(names_and_sigs);
2207 bool dup = false;
2208 {
2209 debug_only(No_Safepoint_Verifier nsv;)
2210 for (int i = 0; i < length; i++) {
2211 methodOop m = (methodOop)methods->obj_at(i);
2212 // If no duplicates, add name/signature in hashtable names_and_sigs.
2213 if (!put_after_lookup(m->name(), m->signature(), names_and_sigs)) {
2214 dup = true;
2215 break;
2216 }
2217 }
2218 }
2219 if (dup) {
2220 classfile_parse_error("Duplicate method name&signature in class file %s",
2221 CHECK_(nullHandle));
2222 }
2223 }
2224
2225 *methods_annotations_oop = methods_annotations();
2226 *methods_parameter_annotations_oop = methods_parameter_annotations();
2227 *methods_default_annotations_oop = methods_default_annotations();
2228
2229 return methods;
2230 }
2231 }
2232
2233
2234 typeArrayHandle ClassFileParser::sort_methods(objArrayHandle methods,
2235 objArrayHandle methods_annotations,
2236 objArrayHandle methods_parameter_annotations,
2237 objArrayHandle methods_default_annotations,
2238 TRAPS) {
2239 typeArrayHandle nullHandle;
2240 int length = methods()->length();
2241 // If JVMTI original method ordering or sharing is enabled we have to
2242 // remember the original class file ordering.
2243 // We temporarily use the vtable_index field in the methodOop to store the
2244 // class file index, so we can read in after calling qsort.
2245 // Put the method ordering in the shared archive.
2246 if (JvmtiExport::can_maintain_original_method_order() || DumpSharedSpaces) {
2247 for (int index = 0; index < length; index++) {
2248 methodOop m = methodOop(methods->obj_at(index));
2249 assert(!m->valid_vtable_index(), "vtable index should not be set");
2250 m->set_vtable_index(index);
2251 }
2252 }
2253 // Sort method array by ascending method name (for faster lookups & vtable construction)
2254 // Note that the ordering is not alphabetical, see Symbol::fast_compare
2255 methodOopDesc::sort_methods(methods(),
2256 methods_annotations(),
2257 methods_parameter_annotations(),
2258 methods_default_annotations());
2259
2260 // If JVMTI original method ordering or sharing is enabled construct int
2261 // array remembering the original ordering
2262 if (JvmtiExport::can_maintain_original_method_order() || DumpSharedSpaces) {
2263 typeArrayOop new_ordering = oopFactory::new_permanent_intArray(length, CHECK_(nullHandle));
2264 typeArrayHandle method_ordering(THREAD, new_ordering);
2265 for (int index = 0; index < length; index++) {
2266 methodOop m = methodOop(methods->obj_at(index));
2267 int old_index = m->vtable_index();
2268 assert(old_index >= 0 && old_index < length, "invalid method index");
2269 method_ordering->int_at_put(index, old_index);
2270 m->set_vtable_index(methodOopDesc::invalid_vtable_index);
2271 }
2272 return method_ordering;
2273 } else {
2274 return typeArrayHandle(THREAD, Universe::the_empty_int_array());
2275 }
2276 }
2277
2278
2279 void ClassFileParser::parse_classfile_sourcefile_attribute(constantPoolHandle cp, instanceKlassHandle k, TRAPS) {
2280 ClassFileStream* cfs = stream();
2281 cfs->guarantee_more(2, CHECK); // sourcefile_index
2282 u2 sourcefile_index = cfs->get_u2_fast();
2283 check_property(
2284 valid_cp_range(sourcefile_index, cp->length()) &&
2285 cp->tag_at(sourcefile_index).is_utf8(),
2286 "Invalid SourceFile attribute at constant pool index %u in class file %s",
2287 sourcefile_index, CHECK);
2288 k->set_source_file_name(cp->symbol_at(sourcefile_index));
2289 }
2290
2291
2292
2293 void ClassFileParser::parse_classfile_source_debug_extension_attribute(constantPoolHandle cp,
2294 instanceKlassHandle k,
2295 int length, TRAPS) {
2296 ClassFileStream* cfs = stream();
2297 u1* sde_buffer = cfs->get_u1_buffer();
2298 assert(sde_buffer != NULL, "null sde buffer");
2299
2300 // Don't bother storing it if there is no way to retrieve it
2301 if (JvmtiExport::can_get_source_debug_extension()) {
2302 // Optimistically assume that only 1 byte UTF format is used
2303 // (common case)
2304 TempNewSymbol sde_symbol = SymbolTable::new_symbol((const char*)sde_buffer, length, CHECK);
2305 k->set_source_debug_extension(sde_symbol);
2306 // Note that set_source_debug_extension() increments the reference count
2307 // for its copy of the Symbol*, so use a TempNewSymbol here.
2308 }
2309 // Got utf8 string, set stream position forward
2310 cfs->skip_u1(length, CHECK);
2311 }
2312
2313
2314 // Inner classes can be static, private or protected (classic VM does this)
2315 #define RECOGNIZED_INNER_CLASS_MODIFIERS (JVM_RECOGNIZED_CLASS_MODIFIERS | JVM_ACC_PRIVATE | JVM_ACC_PROTECTED | JVM_ACC_STATIC)
2316
2317 // Return number of classes in the inner classes attribute table
2318 u2 ClassFileParser::parse_classfile_inner_classes_attribute(constantPoolHandle cp, instanceKlassHandle k, TRAPS) {
2319 ClassFileStream* cfs = stream();
2320 cfs->guarantee_more(2, CHECK_0); // length
2321 u2 length = cfs->get_u2_fast();
2322
2323 // 4-tuples of shorts [inner_class_info_index, outer_class_info_index, inner_name_index, inner_class_access_flags]
2324 typeArrayOop ic = oopFactory::new_permanent_shortArray(length*4, CHECK_0);
2325 typeArrayHandle inner_classes(THREAD, ic);
2326 int index = 0;
2327 int cp_size = cp->length();
2328 cfs->guarantee_more(8 * length, CHECK_0); // 4-tuples of u2
2329 for (int n = 0; n < length; n++) {
2330 // Inner class index
2331 u2 inner_class_info_index = cfs->get_u2_fast();
2332 check_property(
2333 inner_class_info_index == 0 ||
2334 (valid_cp_range(inner_class_info_index, cp_size) &&
2335 is_klass_reference(cp, inner_class_info_index)),
2336 "inner_class_info_index %u has bad constant type in class file %s",
2337 inner_class_info_index, CHECK_0);
2338 // Outer class index
2339 u2 outer_class_info_index = cfs->get_u2_fast();
2340 check_property(
2341 outer_class_info_index == 0 ||
2342 (valid_cp_range(outer_class_info_index, cp_size) &&
2343 is_klass_reference(cp, outer_class_info_index)),
2344 "outer_class_info_index %u has bad constant type in class file %s",
2345 outer_class_info_index, CHECK_0);
2346 // Inner class name
2347 u2 inner_name_index = cfs->get_u2_fast();
2348 check_property(
2349 inner_name_index == 0 || (valid_cp_range(inner_name_index, cp_size) &&
2350 cp->tag_at(inner_name_index).is_utf8()),
2351 "inner_name_index %u has bad constant type in class file %s",
2352 inner_name_index, CHECK_0);
2353 if (_need_verify) {
2354 guarantee_property(inner_class_info_index != outer_class_info_index,
2355 "Class is both outer and inner class in class file %s", CHECK_0);
2356 }
2357 // Access flags
2358 AccessFlags inner_access_flags;
2359 jint flags = cfs->get_u2_fast() & RECOGNIZED_INNER_CLASS_MODIFIERS;
2360 if ((flags & JVM_ACC_INTERFACE) && _major_version < JAVA_6_VERSION) {
2361 // Set abstract bit for old class files for backward compatibility
2362 flags |= JVM_ACC_ABSTRACT;
2363 }
2364 verify_legal_class_modifiers(flags, CHECK_0);
2365 inner_access_flags.set_flags(flags);
2366
2367 inner_classes->short_at_put(index++, inner_class_info_index);
2368 inner_classes->short_at_put(index++, outer_class_info_index);
2369 inner_classes->short_at_put(index++, inner_name_index);
2370 inner_classes->short_at_put(index++, inner_access_flags.as_short());
2371 }
2372
2373 // 4347400: make sure there's no duplicate entry in the classes array
2374 if (_need_verify && _major_version >= JAVA_1_5_VERSION) {
2375 for(int i = 0; i < inner_classes->length(); i += 4) {
2376 for(int j = i + 4; j < inner_classes->length(); j += 4) {
2377 guarantee_property((inner_classes->ushort_at(i) != inner_classes->ushort_at(j) ||
2378 inner_classes->ushort_at(i+1) != inner_classes->ushort_at(j+1) ||
2379 inner_classes->ushort_at(i+2) != inner_classes->ushort_at(j+2) ||
2380 inner_classes->ushort_at(i+3) != inner_classes->ushort_at(j+3)),
2381 "Duplicate entry in InnerClasses in class file %s",
2382 CHECK_0);
2383 }
2384 }
2385 }
2386
2387 // Update instanceKlass with inner class info.
2388 k->set_inner_classes(inner_classes());
2389 return length;
2390 }
2391
2392 void ClassFileParser::parse_classfile_synthetic_attribute(constantPoolHandle cp, instanceKlassHandle k, TRAPS) {
2393 k->set_is_synthetic();
2394 }
2395
2396 void ClassFileParser::parse_classfile_signature_attribute(constantPoolHandle cp, instanceKlassHandle k, TRAPS) {
2397 ClassFileStream* cfs = stream();
2398 u2 signature_index = cfs->get_u2(CHECK);
2399 check_property(
2400 valid_cp_range(signature_index, cp->length()) &&
2401 cp->tag_at(signature_index).is_utf8(),
2402 "Invalid constant pool index %u in Signature attribute in class file %s",
2403 signature_index, CHECK);
2404 k->set_generic_signature(cp->symbol_at(signature_index));
2405 }
2406
2407 void ClassFileParser::parse_classfile_bootstrap_methods_attribute(constantPoolHandle cp, instanceKlassHandle k,
2408 u4 attribute_byte_length, TRAPS) {
2409 ClassFileStream* cfs = stream();
2410 u1* current_start = cfs->current();
2411
2412 cfs->guarantee_more(2, CHECK); // length
2413 int attribute_array_length = cfs->get_u2_fast();
2414
2415 guarantee_property(_max_bootstrap_specifier_index < attribute_array_length,
2416 "Short length on BootstrapMethods in class file %s",
2417 CHECK);
2418
2419 // The attribute contains a counted array of counted tuples of shorts,
2420 // represending bootstrap specifiers:
2421 // length*{bootstrap_method_index, argument_count*{argument_index}}
2422 int operand_count = (attribute_byte_length - sizeof(u2)) / sizeof(u2);
2423 // operand_count = number of shorts in attr, except for leading length
2424
2425 // The attribute is copied into a short[] array.
2426 // The array begins with a series of short[2] pairs, one for each tuple.
2427 int index_size = (attribute_array_length * 2);
2428
2429 typeArrayOop operands_oop = oopFactory::new_permanent_intArray(index_size + operand_count, CHECK);
2430 typeArrayHandle operands(THREAD, operands_oop);
2431 operands_oop = NULL; // tidy
2432
2433 int operand_fill_index = index_size;
2434 int cp_size = cp->length();
2435
2436 for (int n = 0; n < attribute_array_length; n++) {
2437 // Store a 32-bit offset into the header of the operand array.
2438 assert(constantPoolOopDesc::operand_offset_at(operands(), n) == 0, "");
2439 constantPoolOopDesc::operand_offset_at_put(operands(), n, operand_fill_index);
2440
2441 // Read a bootstrap specifier.
2442 cfs->guarantee_more(sizeof(u2) * 2, CHECK); // bsm, argc
2443 u2 bootstrap_method_index = cfs->get_u2_fast();
2444 u2 argument_count = cfs->get_u2_fast();
2445 check_property(
2446 valid_cp_range(bootstrap_method_index, cp_size) &&
2447 cp->tag_at(bootstrap_method_index).is_method_handle(),
2448 "bootstrap_method_index %u has bad constant type in class file %s",
2449 bootstrap_method_index,
2450 CHECK);
2451 operands->short_at_put(operand_fill_index++, bootstrap_method_index);
2452 operands->short_at_put(operand_fill_index++, argument_count);
2453
2454 cfs->guarantee_more(sizeof(u2) * argument_count, CHECK); // argv[argc]
2455 for (int j = 0; j < argument_count; j++) {
2456 u2 argument_index = cfs->get_u2_fast();
2457 check_property(
2458 valid_cp_range(argument_index, cp_size) &&
2459 cp->tag_at(argument_index).is_loadable_constant(),
2460 "argument_index %u has bad constant type in class file %s",
2461 argument_index,
2462 CHECK);
2463 operands->short_at_put(operand_fill_index++, argument_index);
2464 }
2465 }
2466
2467 assert(operand_fill_index == operands()->length(), "exact fill");
2468 assert(constantPoolOopDesc::operand_array_length(operands()) == attribute_array_length, "correct decode");
2469
2470 u1* current_end = cfs->current();
2471 guarantee_property(current_end == current_start + attribute_byte_length,
2472 "Bad length on BootstrapMethods in class file %s",
2473 CHECK);
2474
2475 cp->set_operands(operands());
2476 }
2477
2478
2479 void ClassFileParser::parse_classfile_attributes(constantPoolHandle cp, instanceKlassHandle k, TRAPS) {
2480 ClassFileStream* cfs = stream();
2481 // Set inner classes attribute to default sentinel
2482 k->set_inner_classes(Universe::the_empty_short_array());
2483 cfs->guarantee_more(2, CHECK); // attributes_count
2484 u2 attributes_count = cfs->get_u2_fast();
2485 bool parsed_sourcefile_attribute = false;
2486 bool parsed_innerclasses_attribute = false;
2487 bool parsed_enclosingmethod_attribute = false;
2488 bool parsed_bootstrap_methods_attribute = false;
2489 u1* runtime_visible_annotations = NULL;
2490 int runtime_visible_annotations_length = 0;
2491 u1* runtime_invisible_annotations = NULL;
2492 int runtime_invisible_annotations_length = 0;
2493 // Iterate over attributes
2494 while (attributes_count--) {
2495 cfs->guarantee_more(6, CHECK); // attribute_name_index, attribute_length
2496 u2 attribute_name_index = cfs->get_u2_fast();
2497 u4 attribute_length = cfs->get_u4_fast();
2498 check_property(
2499 valid_cp_range(attribute_name_index, cp->length()) &&
2500 cp->tag_at(attribute_name_index).is_utf8(),
2501 "Attribute name has bad constant pool index %u in class file %s",
2502 attribute_name_index, CHECK);
2503 Symbol* tag = cp->symbol_at(attribute_name_index);
2504 if (tag == vmSymbols::tag_source_file()) {
2505 // Check for SourceFile tag
2506 if (_need_verify) {
2507 guarantee_property(attribute_length == 2, "Wrong SourceFile attribute length in class file %s", CHECK);
2508 }
2509 if (parsed_sourcefile_attribute) {
2510 classfile_parse_error("Multiple SourceFile attributes in class file %s", CHECK);
2511 } else {
2512 parsed_sourcefile_attribute = true;
2513 }
2514 parse_classfile_sourcefile_attribute(cp, k, CHECK);
2515 } else if (tag == vmSymbols::tag_source_debug_extension()) {
2516 // Check for SourceDebugExtension tag
2517 parse_classfile_source_debug_extension_attribute(cp, k, (int)attribute_length, CHECK);
2518 } else if (tag == vmSymbols::tag_inner_classes()) {
2519 // Check for InnerClasses tag
2520 if (parsed_innerclasses_attribute) {
2521 classfile_parse_error("Multiple InnerClasses attributes in class file %s", CHECK);
2522 } else {
2523 parsed_innerclasses_attribute = true;
2524 }
2525 u2 num_of_classes = parse_classfile_inner_classes_attribute(cp, k, CHECK);
2526 if (_need_verify && _major_version >= JAVA_1_5_VERSION) {
2527 guarantee_property(attribute_length == sizeof(num_of_classes) + 4 * sizeof(u2) * num_of_classes,
2528 "Wrong InnerClasses attribute length in class file %s", CHECK);
2529 }
2530 } else if (tag == vmSymbols::tag_synthetic()) {
2531 // Check for Synthetic tag
2532 // Shouldn't we check that the synthetic flags wasn't already set? - not required in spec
2533 if (attribute_length != 0) {
2534 classfile_parse_error(
2535 "Invalid Synthetic classfile attribute length %u in class file %s",
2536 attribute_length, CHECK);
2537 }
2538 parse_classfile_synthetic_attribute(cp, k, CHECK);
2539 } else if (tag == vmSymbols::tag_deprecated()) {
2540 // Check for Deprecatd tag - 4276120
2541 if (attribute_length != 0) {
2542 classfile_parse_error(
2543 "Invalid Deprecated classfile attribute length %u in class file %s",
2544 attribute_length, CHECK);
2545 }
2546 } else if (_major_version >= JAVA_1_5_VERSION) {
2547 if (tag == vmSymbols::tag_signature()) {
2548 if (attribute_length != 2) {
2549 classfile_parse_error(
2550 "Wrong Signature attribute length %u in class file %s",
2551 attribute_length, CHECK);
2552 }
2553 parse_classfile_signature_attribute(cp, k, CHECK);
2554 } else if (tag == vmSymbols::tag_runtime_visible_annotations()) {
2555 runtime_visible_annotations_length = attribute_length;
2556 runtime_visible_annotations = cfs->get_u1_buffer();
2557 assert(runtime_visible_annotations != NULL, "null visible annotations");
2558 cfs->skip_u1(runtime_visible_annotations_length, CHECK);
2559 } else if (PreserveAllAnnotations && tag == vmSymbols::tag_runtime_invisible_annotations()) {
2560 runtime_invisible_annotations_length = attribute_length;
2561 runtime_invisible_annotations = cfs->get_u1_buffer();
2562 assert(runtime_invisible_annotations != NULL, "null invisible annotations");
2563 cfs->skip_u1(runtime_invisible_annotations_length, CHECK);
2564 } else if (tag == vmSymbols::tag_enclosing_method()) {
2565 if (parsed_enclosingmethod_attribute) {
2566 classfile_parse_error("Multiple EnclosingMethod attributes in class file %s", CHECK);
2567 } else {
2568 parsed_enclosingmethod_attribute = true;
2569 }
2570 cfs->guarantee_more(4, CHECK); // class_index, method_index
2571 u2 class_index = cfs->get_u2_fast();
2572 u2 method_index = cfs->get_u2_fast();
2573 if (class_index == 0) {
2574 classfile_parse_error("Invalid class index in EnclosingMethod attribute in class file %s", CHECK);
2575 }
2576 // Validate the constant pool indices and types
2577 if (!cp->is_within_bounds(class_index) ||
2578 !is_klass_reference(cp, class_index)) {
2579 classfile_parse_error("Invalid or out-of-bounds class index in EnclosingMethod attribute in class file %s", CHECK);
2580 }
2581 if (method_index != 0 &&
2582 (!cp->is_within_bounds(method_index) ||
2583 !cp->tag_at(method_index).is_name_and_type())) {
2584 classfile_parse_error("Invalid or out-of-bounds method index in EnclosingMethod attribute in class file %s", CHECK);
2585 }
2586 k->set_enclosing_method_indices(class_index, method_index);
2587 } else if (tag == vmSymbols::tag_bootstrap_methods() &&
2588 _major_version >= Verifier::INVOKEDYNAMIC_MAJOR_VERSION) {
2589 if (parsed_bootstrap_methods_attribute)
2590 classfile_parse_error("Multiple BootstrapMethods attributes in class file %s", CHECK);
2591 parsed_bootstrap_methods_attribute = true;
2592 parse_classfile_bootstrap_methods_attribute(cp, k, attribute_length, CHECK);
2593 } else {
2594 // Unknown attribute
2595 cfs->skip_u1(attribute_length, CHECK);
2596 }
2597 } else {
2598 // Unknown attribute
2599 cfs->skip_u1(attribute_length, CHECK);
2600 }
2601 }
2602 typeArrayHandle annotations = assemble_annotations(runtime_visible_annotations,
2603 runtime_visible_annotations_length,
2604 runtime_invisible_annotations,
2605 runtime_invisible_annotations_length,
2606 CHECK);
2607 k->set_class_annotations(annotations());
2608
2609 if (_max_bootstrap_specifier_index >= 0) {
2610 guarantee_property(parsed_bootstrap_methods_attribute,
2611 "Missing BootstrapMethods attribute in class file %s", CHECK);
2612 }
2613 }
2614
2615
2616 typeArrayHandle ClassFileParser::assemble_annotations(u1* runtime_visible_annotations,
2617 int runtime_visible_annotations_length,
2618 u1* runtime_invisible_annotations,
2619 int runtime_invisible_annotations_length, TRAPS) {
2620 typeArrayHandle annotations;
2621 if (runtime_visible_annotations != NULL ||
2622 runtime_invisible_annotations != NULL) {
2623 typeArrayOop anno = oopFactory::new_permanent_byteArray(runtime_visible_annotations_length +
2624 runtime_invisible_annotations_length, CHECK_(annotations));
2625 annotations = typeArrayHandle(THREAD, anno);
2626 if (runtime_visible_annotations != NULL) {
2627 memcpy(annotations->byte_at_addr(0), runtime_visible_annotations, runtime_visible_annotations_length);
2628 }
2629 if (runtime_invisible_annotations != NULL) {
2630 memcpy(annotations->byte_at_addr(runtime_visible_annotations_length), runtime_invisible_annotations, runtime_invisible_annotations_length);
2631 }
2632 }
2633 return annotations;
2634 }
2635
2636
2637 instanceKlassHandle ClassFileParser::parseClassFile(Symbol* name,
2638 Handle class_loader,
2639 Handle protection_domain,
2640 KlassHandle host_klass,
2641 GrowableArray<Handle>* cp_patches,
2642 TempNewSymbol& parsed_name,
2643 bool verify,
2644 TRAPS) {
2645 // When a retransformable agent is attached, JVMTI caches the
2646 // class bytes that existed before the first retransformation.
2647 // If RedefineClasses() was used before the retransformable
2648 // agent attached, then the cached class bytes may not be the
2649 // original class bytes.
2650 unsigned char *cached_class_file_bytes = NULL;
2651 jint cached_class_file_length;
2652
2653 ClassFileStream* cfs = stream();
2654 // Timing
2655 assert(THREAD->is_Java_thread(), "must be a JavaThread");
2656 JavaThread* jt = (JavaThread*) THREAD;
2657
2658 PerfClassTraceTime ctimer(ClassLoader::perf_class_parse_time(),
2659 ClassLoader::perf_class_parse_selftime(),
2660 NULL,
2661 jt->get_thread_stat()->perf_recursion_counts_addr(),
2662 jt->get_thread_stat()->perf_timers_addr(),
2663 PerfClassTraceTime::PARSE_CLASS);
2664
2665 _has_finalizer = _has_empty_finalizer = _has_vanilla_constructor = false;
2666 _max_bootstrap_specifier_index = -1;
2667
2668 if (JvmtiExport::should_post_class_file_load_hook()) {
2669 // Get the cached class file bytes (if any) from the class that
2670 // is being redefined or retransformed. We use jvmti_thread_state()
2671 // instead of JvmtiThreadState::state_for(jt) so we don't allocate
2672 // a JvmtiThreadState any earlier than necessary. This will help
2673 // avoid the bug described by 7126851.
2674 JvmtiThreadState *state = jt->jvmti_thread_state();
2675 if (state != NULL) {
2676 KlassHandle *h_class_being_redefined =
2677 state->get_class_being_redefined();
2678 if (h_class_being_redefined != NULL) {
2679 instanceKlassHandle ikh_class_being_redefined =
2680 instanceKlassHandle(THREAD, (*h_class_being_redefined)());
2681 cached_class_file_bytes =
2682 ikh_class_being_redefined->get_cached_class_file_bytes();
2683 cached_class_file_length =
2684 ikh_class_being_redefined->get_cached_class_file_len();
2685 }
2686 }
2687
2688 unsigned char* ptr = cfs->buffer();
2689 unsigned char* end_ptr = cfs->buffer() + cfs->length();
2690
2691 JvmtiExport::post_class_file_load_hook(name, class_loader, protection_domain,
2692 &ptr, &end_ptr,
2693 &cached_class_file_bytes,
2694 &cached_class_file_length);
2695
2696 if (ptr != cfs->buffer()) {
2697 // JVMTI agent has modified class file data.
2698 // Set new class file stream using JVMTI agent modified
2699 // class file data.
2700 cfs = new ClassFileStream(ptr, end_ptr - ptr, cfs->source());
2701 set_stream(cfs);
2702 }
2703 }
2704
2705 _host_klass = host_klass;
2706 _cp_patches = cp_patches;
2707
2708 instanceKlassHandle nullHandle;
2709
2710 // Figure out whether we can skip format checking (matching classic VM behavior)
2711 _need_verify = Verifier::should_verify_for(class_loader(), verify);
2712
2713 // Set the verify flag in stream
2714 cfs->set_verify(_need_verify);
2715
2716 // Save the class file name for easier error message printing.
2717 _class_name = (name != NULL) ? name : vmSymbols::unknown_class_name();
2718
2719 cfs->guarantee_more(8, CHECK_(nullHandle)); // magic, major, minor
2720 // Magic value
2721 u4 magic = cfs->get_u4_fast();
2722 guarantee_property(magic == JAVA_CLASSFILE_MAGIC,
2723 "Incompatible magic value %u in class file %s",
2724 magic, CHECK_(nullHandle));
2725
2726 // Version numbers
2727 u2 minor_version = cfs->get_u2_fast();
2728 u2 major_version = cfs->get_u2_fast();
2729
2730 // Check version numbers - we check this even with verifier off
2731 if (!is_supported_version(major_version, minor_version)) {
2732 if (name == NULL) {
2733 Exceptions::fthrow(
2734 THREAD_AND_LOCATION,
2735 vmSymbols::java_lang_UnsupportedClassVersionError(),
2736 "Unsupported major.minor version %u.%u",
2737 major_version,
2738 minor_version);
2739 } else {
2740 ResourceMark rm(THREAD);
2741 Exceptions::fthrow(
2742 THREAD_AND_LOCATION,
2743 vmSymbols::java_lang_UnsupportedClassVersionError(),
2744 "%s : Unsupported major.minor version %u.%u",
2745 name->as_C_string(),
2746 major_version,
2747 minor_version);
2748 }
2749 return nullHandle;
2750 }
2751
2752 _major_version = major_version;
2753 _minor_version = minor_version;
2754
2755
2756 // Check if verification needs to be relaxed for this class file
2757 // Do not restrict it to jdk1.0 or jdk1.1 to maintain backward compatibility (4982376)
2758 _relax_verify = Verifier::relax_verify_for(class_loader());
2759
2760 // Constant pool
2761 constantPoolHandle cp = parse_constant_pool(CHECK_(nullHandle));
2762 ConstantPoolCleaner error_handler(cp); // set constant pool to be cleaned up.
2763
2764 int cp_size = cp->length();
2765
2766 cfs->guarantee_more(8, CHECK_(nullHandle)); // flags, this_class, super_class, infs_len
2767
2768 // Access flags
2769 AccessFlags access_flags;
2770 jint flags = cfs->get_u2_fast() & JVM_RECOGNIZED_CLASS_MODIFIERS;
2771
2772 if ((flags & JVM_ACC_INTERFACE) && _major_version < JAVA_6_VERSION) {
2773 // Set abstract bit for old class files for backward compatibility
2774 flags |= JVM_ACC_ABSTRACT;
2775 }
2776 verify_legal_class_modifiers(flags, CHECK_(nullHandle));
2777 access_flags.set_flags(flags);
2778
2779 // This class and superclass
2780 instanceKlassHandle super_klass;
2781 u2 this_class_index = cfs->get_u2_fast();
2782 check_property(
2783 valid_cp_range(this_class_index, cp_size) &&
2784 cp->tag_at(this_class_index).is_unresolved_klass(),
2785 "Invalid this class index %u in constant pool in class file %s",
2786 this_class_index, CHECK_(nullHandle));
2787
2788 Symbol* class_name = cp->unresolved_klass_at(this_class_index);
2789 assert(class_name != NULL, "class_name can't be null");
2790
2791 // It's important to set parsed_name *before* resolving the super class.
2792 // (it's used for cleanup by the caller if parsing fails)
2793 parsed_name = class_name;
2794 // parsed_name is returned and can be used if there's an error, so add to
2795 // its reference count. Caller will decrement the refcount.
2796 parsed_name->increment_refcount();
2797
2798 // Update _class_name which could be null previously to be class_name
2799 _class_name = class_name;
2800
2801 // Don't need to check whether this class name is legal or not.
2802 // It has been checked when constant pool is parsed.
2803 // However, make sure it is not an array type.
2804 if (_need_verify) {
2805 guarantee_property(class_name->byte_at(0) != JVM_SIGNATURE_ARRAY,
2806 "Bad class name in class file %s",
2807 CHECK_(nullHandle));
2808 }
2809
2810 klassOop preserve_this_klass; // for storing result across HandleMark
2811
2812 // release all handles when parsing is done
2813 { HandleMark hm(THREAD);
2814
2815 // Checks if name in class file matches requested name
2816 if (name != NULL && class_name != name) {
2817 ResourceMark rm(THREAD);
2818 Exceptions::fthrow(
2819 THREAD_AND_LOCATION,
2820 vmSymbols::java_lang_NoClassDefFoundError(),
2821 "%s (wrong name: %s)",
2822 name->as_C_string(),
2823 class_name->as_C_string()
2824 );
2825 return nullHandle;
2826 }
2827
2828 if (TraceClassLoadingPreorder) {
2829 tty->print("[Loading %s", name->as_klass_external_name());
2830 if (cfs->source() != NULL) tty->print(" from %s", cfs->source());
2831 tty->print_cr("]");
2832 }
2833
2834 u2 super_class_index = cfs->get_u2_fast();
2835 if (super_class_index == 0) {
2836 check_property(class_name == vmSymbols::java_lang_Object(),
2837 "Invalid superclass index %u in class file %s",
2838 super_class_index,
2839 CHECK_(nullHandle));
2840 } else {
2841 check_property(valid_cp_range(super_class_index, cp_size) &&
2842 is_klass_reference(cp, super_class_index),
2843 "Invalid superclass index %u in class file %s",
2844 super_class_index,
2845 CHECK_(nullHandle));
2846 // The class name should be legal because it is checked when parsing constant pool.
2847 // However, make sure it is not an array type.
2848 bool is_array = false;
2849 if (cp->tag_at(super_class_index).is_klass()) {
2850 super_klass = instanceKlassHandle(THREAD, cp->resolved_klass_at(super_class_index));
2851 if (_need_verify)
2852 is_array = super_klass->oop_is_array();
2853 } else if (_need_verify) {
2854 is_array = (cp->unresolved_klass_at(super_class_index)->byte_at(0) == JVM_SIGNATURE_ARRAY);
2855 }
2856 if (_need_verify) {
2857 guarantee_property(!is_array,
2858 "Bad superclass name in class file %s", CHECK_(nullHandle));
2859 }
2860 }
2861
2862 // Interfaces
2863 u2 itfs_len = cfs->get_u2_fast();
2864 objArrayHandle local_interfaces;
2865 if (itfs_len == 0) {
2866 local_interfaces = objArrayHandle(THREAD, Universe::the_empty_system_obj_array());
2867 } else {
2868 local_interfaces = parse_interfaces(cp, itfs_len, class_loader, protection_domain, _class_name, CHECK_(nullHandle));
2869 }
2870
2871 u2 java_fields_count = 0;
2872 // Fields (offsets are filled in later)
2873 FieldAllocationCount fac;
2874 objArrayHandle fields_annotations;
2875 typeArrayHandle fields = parse_fields(class_name, cp, access_flags.is_interface(), &fac, &fields_annotations,
2876 &java_fields_count,
2877 CHECK_(nullHandle));
2878 // Methods
2879 bool has_final_method = false;
2880 AccessFlags promoted_flags;
2881 promoted_flags.set_flags(0);
2882 // These need to be oop pointers because they are allocated lazily
2883 // inside parse_methods inside a nested HandleMark
2884 objArrayOop methods_annotations_oop = NULL;
2885 objArrayOop methods_parameter_annotations_oop = NULL;
2886 objArrayOop methods_default_annotations_oop = NULL;
2887 objArrayHandle methods = parse_methods(cp, access_flags.is_interface(),
2888 &promoted_flags,
2889 &has_final_method,
2890 &methods_annotations_oop,
2891 &methods_parameter_annotations_oop,
2892 &methods_default_annotations_oop,
2893 CHECK_(nullHandle));
2894
2895 objArrayHandle methods_annotations(THREAD, methods_annotations_oop);
2896 objArrayHandle methods_parameter_annotations(THREAD, methods_parameter_annotations_oop);
2897 objArrayHandle methods_default_annotations(THREAD, methods_default_annotations_oop);
2898
2899 // We check super class after class file is parsed and format is checked
2900 if (super_class_index > 0 && super_klass.is_null()) {
2901 Symbol* sk = cp->klass_name_at(super_class_index);
2902 if (access_flags.is_interface()) {
2903 // Before attempting to resolve the superclass, check for class format
2904 // errors not checked yet.
2905 guarantee_property(sk == vmSymbols::java_lang_Object(),
2906 "Interfaces must have java.lang.Object as superclass in class file %s",
2907 CHECK_(nullHandle));
2908 }
2909 klassOop k = SystemDictionary::resolve_super_or_fail(class_name,
2910 sk,
2911 class_loader,
2912 protection_domain,
2913 true,
2914 CHECK_(nullHandle));
2915
2916 KlassHandle kh (THREAD, k);
2917 super_klass = instanceKlassHandle(THREAD, kh());
2918 if (LinkWellKnownClasses) // my super class is well known to me
2919 cp->klass_at_put(super_class_index, super_klass()); // eagerly resolve
2920 }
2921 if (super_klass.not_null()) {
2922 if (super_klass->is_interface()) {
2923 ResourceMark rm(THREAD);
2924 Exceptions::fthrow(
2925 THREAD_AND_LOCATION,
2926 vmSymbols::java_lang_IncompatibleClassChangeError(),
2927 "class %s has interface %s as super class",
2928 class_name->as_klass_external_name(),
2929 super_klass->external_name()
2930 );
2931 return nullHandle;
2932 }
2933 // Make sure super class is not final
2934 if (super_klass->is_final()) {
2935 THROW_MSG_(vmSymbols::java_lang_VerifyError(), "Cannot inherit from final class", nullHandle);
2936 }
2937 }
2938
2939 // Compute the transitive list of all unique interfaces implemented by this class
2940 objArrayHandle transitive_interfaces = compute_transitive_interfaces(super_klass, local_interfaces, CHECK_(nullHandle));
2941
2942 // sort methods
2943 typeArrayHandle method_ordering = sort_methods(methods,
2944 methods_annotations,
2945 methods_parameter_annotations,
2946 methods_default_annotations,
2947 CHECK_(nullHandle));
2948
2949 // promote flags from parse_methods() to the klass' flags
2950 access_flags.add_promoted_flags(promoted_flags.as_int());
2951
2952 // Size of Java vtable (in words)
2953 int vtable_size = 0;
2954 int itable_size = 0;
2955 int num_miranda_methods = 0;
2956
2957 klassVtable::compute_vtable_size_and_num_mirandas(vtable_size,
2958 num_miranda_methods,
2959 super_klass(),
2960 methods(),
2961 access_flags,
2962 class_loader,
2963 class_name,
2964 local_interfaces(),
2965 CHECK_(nullHandle));
2966
2967 // Size of Java itable (in words)
2968 itable_size = access_flags.is_interface() ? 0 : klassItable::compute_itable_size(transitive_interfaces);
2969
2970 // Field size and offset computation
2971 int nonstatic_field_size = super_klass() == NULL ? 0 : super_klass->nonstatic_field_size();
2972 #ifndef PRODUCT
2973 int orig_nonstatic_field_size = 0;
2974 #endif
2975 int static_field_size = 0;
2976 int next_static_oop_offset;
2977 int next_static_double_offset;
2978 int next_static_word_offset;
2979 int next_static_short_offset;
2980 int next_static_byte_offset;
2981 int next_static_type_offset;
2982 int next_nonstatic_oop_offset;
2983 int next_nonstatic_double_offset;
2984 int next_nonstatic_word_offset;
2985 int next_nonstatic_short_offset;
2986 int next_nonstatic_byte_offset;
2987 int next_nonstatic_type_offset;
2988 int first_nonstatic_oop_offset;
2989 int first_nonstatic_field_offset;
2990 int next_nonstatic_field_offset;
2991
2992 // Calculate the starting byte offsets
2993 next_static_oop_offset = instanceMirrorKlass::offset_of_static_fields();
2994 next_static_double_offset = next_static_oop_offset +
2995 (fac.count[STATIC_OOP] * heapOopSize);
2996 if ( fac.count[STATIC_DOUBLE] &&
2997 (Universe::field_type_should_be_aligned(T_DOUBLE) ||
2998 Universe::field_type_should_be_aligned(T_LONG)) ) {
2999 next_static_double_offset = align_size_up(next_static_double_offset, BytesPerLong);
3000 }
3001
3002 next_static_word_offset = next_static_double_offset +
3003 (fac.count[STATIC_DOUBLE] * BytesPerLong);
3004 next_static_short_offset = next_static_word_offset +
3005 (fac.count[STATIC_WORD] * BytesPerInt);
3006 next_static_byte_offset = next_static_short_offset +
3007 (fac.count[STATIC_SHORT] * BytesPerShort);
3008 next_static_type_offset = align_size_up((next_static_byte_offset +
3009 fac.count[STATIC_BYTE] ), wordSize );
3010 static_field_size = (next_static_type_offset -
3011 next_static_oop_offset) / wordSize;
3012
3013 first_nonstatic_field_offset = instanceOopDesc::base_offset_in_bytes() +
3014 nonstatic_field_size * heapOopSize;
3015 next_nonstatic_field_offset = first_nonstatic_field_offset;
3016
3017 unsigned int nonstatic_double_count = fac.count[NONSTATIC_DOUBLE];
3018 unsigned int nonstatic_word_count = fac.count[NONSTATIC_WORD];
3019 unsigned int nonstatic_short_count = fac.count[NONSTATIC_SHORT];
3020 unsigned int nonstatic_byte_count = fac.count[NONSTATIC_BYTE];
3021 unsigned int nonstatic_oop_count = fac.count[NONSTATIC_OOP];
3022
3023 bool super_has_nonstatic_fields =
3024 (super_klass() != NULL && super_klass->has_nonstatic_fields());
3025 bool has_nonstatic_fields = super_has_nonstatic_fields ||
3026 ((nonstatic_double_count + nonstatic_word_count +
3027 nonstatic_short_count + nonstatic_byte_count +
3028 nonstatic_oop_count) != 0);
3029
3030
3031 // Prepare list of oops for oop map generation.
3032 int* nonstatic_oop_offsets;
3033 unsigned int* nonstatic_oop_counts;
3034 unsigned int nonstatic_oop_map_count = 0;
3035
3036 nonstatic_oop_offsets = NEW_RESOURCE_ARRAY_IN_THREAD(
3037 THREAD, int, nonstatic_oop_count + 1);
3038 nonstatic_oop_counts = NEW_RESOURCE_ARRAY_IN_THREAD(
3039 THREAD, unsigned int, nonstatic_oop_count + 1);
3040
3041 first_nonstatic_oop_offset = 0; // will be set for first oop field
3042
3043 #ifndef PRODUCT
3044 if( PrintCompactFieldsSavings ) {
3045 next_nonstatic_double_offset = next_nonstatic_field_offset +
3046 (nonstatic_oop_count * heapOopSize);
3047 if ( nonstatic_double_count > 0 ) {
3048 next_nonstatic_double_offset = align_size_up(next_nonstatic_double_offset, BytesPerLong);
3049 }
3050 next_nonstatic_word_offset = next_nonstatic_double_offset +
3051 (nonstatic_double_count * BytesPerLong);
3052 next_nonstatic_short_offset = next_nonstatic_word_offset +
3053 (nonstatic_word_count * BytesPerInt);
3054 next_nonstatic_byte_offset = next_nonstatic_short_offset +
3055 (nonstatic_short_count * BytesPerShort);
3056 next_nonstatic_type_offset = align_size_up((next_nonstatic_byte_offset +
3057 nonstatic_byte_count ), heapOopSize );
3058 orig_nonstatic_field_size = nonstatic_field_size +
3059 ((next_nonstatic_type_offset - first_nonstatic_field_offset)/heapOopSize);
3060 }
3061 #endif
3062 bool compact_fields = CompactFields;
3063 int allocation_style = FieldsAllocationStyle;
3064 if( allocation_style < 0 || allocation_style > 2 ) { // Out of range?
3065 assert(false, "0 <= FieldsAllocationStyle <= 2");
3066 allocation_style = 1; // Optimistic
3067 }
3068
3069 // The next classes have predefined hard-coded fields offsets
3070 // (see in JavaClasses::compute_hard_coded_offsets()).
3071 // Use default fields allocation order for them.
3072 if( (allocation_style != 0 || compact_fields ) && class_loader.is_null() &&
3073 (class_name == vmSymbols::java_lang_AssertionStatusDirectives() ||
3074 class_name == vmSymbols::java_lang_Class() ||
3075 class_name == vmSymbols::java_lang_ClassLoader() ||
3076 class_name == vmSymbols::java_lang_ref_Reference() ||
3077 class_name == vmSymbols::java_lang_ref_SoftReference() ||
3078 class_name == vmSymbols::java_lang_StackTraceElement() ||
3079 class_name == vmSymbols::java_lang_String() ||
3080 class_name == vmSymbols::java_lang_Throwable() ||
3081 class_name == vmSymbols::java_lang_Boolean() ||
3082 class_name == vmSymbols::java_lang_Character() ||
3083 class_name == vmSymbols::java_lang_Float() ||
3084 class_name == vmSymbols::java_lang_Double() ||
3085 class_name == vmSymbols::java_lang_Byte() ||
3086 class_name == vmSymbols::java_lang_Short() ||
3087 class_name == vmSymbols::java_lang_Integer() ||
3088 class_name == vmSymbols::java_lang_Long())) {
3089 allocation_style = 0; // Allocate oops first
3090 compact_fields = false; // Don't compact fields
3091 }
3092
3093 if( allocation_style == 0 ) {
3094 // Fields order: oops, longs/doubles, ints, shorts/chars, bytes
3095 next_nonstatic_oop_offset = next_nonstatic_field_offset;
3096 next_nonstatic_double_offset = next_nonstatic_oop_offset +
3097 (nonstatic_oop_count * heapOopSize);
3098 } else if( allocation_style == 1 ) {
3099 // Fields order: longs/doubles, ints, shorts/chars, bytes, oops
3100 next_nonstatic_double_offset = next_nonstatic_field_offset;
3101 } else if( allocation_style == 2 ) {
3102 // Fields allocation: oops fields in super and sub classes are together.
3103 if( nonstatic_field_size > 0 && super_klass() != NULL &&
3104 super_klass->nonstatic_oop_map_size() > 0 ) {
3105 int map_count = super_klass->nonstatic_oop_map_count();
3106 OopMapBlock* first_map = super_klass->start_of_nonstatic_oop_maps();
3107 OopMapBlock* last_map = first_map + map_count - 1;
3108 int next_offset = last_map->offset() + (last_map->count() * heapOopSize);
3109 if (next_offset == next_nonstatic_field_offset) {
3110 allocation_style = 0; // allocate oops first
3111 next_nonstatic_oop_offset = next_nonstatic_field_offset;
3112 next_nonstatic_double_offset = next_nonstatic_oop_offset +
3113 (nonstatic_oop_count * heapOopSize);
3114 }
3115 }
3116 if( allocation_style == 2 ) {
3117 allocation_style = 1; // allocate oops last
3118 next_nonstatic_double_offset = next_nonstatic_field_offset;
3119 }
3120 } else {
3121 ShouldNotReachHere();
3122 }
3123
3124 int nonstatic_oop_space_count = 0;
3125 int nonstatic_word_space_count = 0;
3126 int nonstatic_short_space_count = 0;
3127 int nonstatic_byte_space_count = 0;
3128 int nonstatic_oop_space_offset;
3129 int nonstatic_word_space_offset;
3130 int nonstatic_short_space_offset;
3131 int nonstatic_byte_space_offset;
3132
3133 if( nonstatic_double_count > 0 ) {
3134 int offset = next_nonstatic_double_offset;
3135 next_nonstatic_double_offset = align_size_up(offset, BytesPerLong);
3136 if( compact_fields && offset != next_nonstatic_double_offset ) {
3137 // Allocate available fields into the gap before double field.
3138 int length = next_nonstatic_double_offset - offset;
3139 assert(length == BytesPerInt, "");
3140 nonstatic_word_space_offset = offset;
3141 if( nonstatic_word_count > 0 ) {
3142 nonstatic_word_count -= 1;
3143 nonstatic_word_space_count = 1; // Only one will fit
3144 length -= BytesPerInt;
3145 offset += BytesPerInt;
3146 }
3147 nonstatic_short_space_offset = offset;
3148 while( length >= BytesPerShort && nonstatic_short_count > 0 ) {
3149 nonstatic_short_count -= 1;
3150 nonstatic_short_space_count += 1;
3151 length -= BytesPerShort;
3152 offset += BytesPerShort;
3153 }
3154 nonstatic_byte_space_offset = offset;
3155 while( length > 0 && nonstatic_byte_count > 0 ) {
3156 nonstatic_byte_count -= 1;
3157 nonstatic_byte_space_count += 1;
3158 length -= 1;
3159 }
3160 // Allocate oop field in the gap if there are no other fields for that.
3161 nonstatic_oop_space_offset = offset;
3162 if( length >= heapOopSize && nonstatic_oop_count > 0 &&
3163 allocation_style != 0 ) { // when oop fields not first
3164 nonstatic_oop_count -= 1;
3165 nonstatic_oop_space_count = 1; // Only one will fit
3166 length -= heapOopSize;
3167 offset += heapOopSize;
3168 }
3169 }
3170 }
3171
3172 next_nonstatic_word_offset = next_nonstatic_double_offset +
3173 (nonstatic_double_count * BytesPerLong);
3174 next_nonstatic_short_offset = next_nonstatic_word_offset +
3175 (nonstatic_word_count * BytesPerInt);
3176 next_nonstatic_byte_offset = next_nonstatic_short_offset +
3177 (nonstatic_short_count * BytesPerShort);
3178
3179 int notaligned_offset;
3180 if( allocation_style == 0 ) {
3181 notaligned_offset = next_nonstatic_byte_offset + nonstatic_byte_count;
3182 } else { // allocation_style == 1
3183 next_nonstatic_oop_offset = next_nonstatic_byte_offset + nonstatic_byte_count;
3184 if( nonstatic_oop_count > 0 ) {
3185 next_nonstatic_oop_offset = align_size_up(next_nonstatic_oop_offset, heapOopSize);
3186 }
3187 notaligned_offset = next_nonstatic_oop_offset + (nonstatic_oop_count * heapOopSize);
3188 }
3189 next_nonstatic_type_offset = align_size_up(notaligned_offset, heapOopSize );
3190 nonstatic_field_size = nonstatic_field_size + ((next_nonstatic_type_offset
3191 - first_nonstatic_field_offset)/heapOopSize);
3192
3193 // Iterate over fields again and compute correct offsets.
3194 // The field allocation type was temporarily stored in the offset slot.
3195 // oop fields are located before non-oop fields (static and non-static).
3196 for (AllFieldStream fs(fields, cp); !fs.done(); fs.next()) {
3197 int real_offset;
3198 FieldAllocationType atype = (FieldAllocationType) fs.offset();
3199 switch (atype) {
3200 case STATIC_OOP:
3201 real_offset = next_static_oop_offset;
3202 next_static_oop_offset += heapOopSize;
3203 break;
3204 case STATIC_BYTE:
3205 real_offset = next_static_byte_offset;
3206 next_static_byte_offset += 1;
3207 break;
3208 case STATIC_SHORT:
3209 real_offset = next_static_short_offset;
3210 next_static_short_offset += BytesPerShort;
3211 break;
3212 case STATIC_WORD:
3213 real_offset = next_static_word_offset;
3214 next_static_word_offset += BytesPerInt;
3215 break;
3216 case STATIC_DOUBLE:
3217 real_offset = next_static_double_offset;
3218 next_static_double_offset += BytesPerLong;
3219 break;
3220 case NONSTATIC_OOP:
3221 if( nonstatic_oop_space_count > 0 ) {
3222 real_offset = nonstatic_oop_space_offset;
3223 nonstatic_oop_space_offset += heapOopSize;
3224 nonstatic_oop_space_count -= 1;
3225 } else {
3226 real_offset = next_nonstatic_oop_offset;
3227 next_nonstatic_oop_offset += heapOopSize;
3228 }
3229 // Update oop maps
3230 if( nonstatic_oop_map_count > 0 &&
3231 nonstatic_oop_offsets[nonstatic_oop_map_count - 1] ==
3232 real_offset -
3233 int(nonstatic_oop_counts[nonstatic_oop_map_count - 1]) *
3234 heapOopSize ) {
3235 // Extend current oop map
3236 nonstatic_oop_counts[nonstatic_oop_map_count - 1] += 1;
3237 } else {
3238 // Create new oop map
3239 nonstatic_oop_offsets[nonstatic_oop_map_count] = real_offset;
3240 nonstatic_oop_counts [nonstatic_oop_map_count] = 1;
3241 nonstatic_oop_map_count += 1;
3242 if( first_nonstatic_oop_offset == 0 ) { // Undefined
3243 first_nonstatic_oop_offset = real_offset;
3244 }
3245 }
3246 break;
3247 case NONSTATIC_BYTE:
3248 if( nonstatic_byte_space_count > 0 ) {
3249 real_offset = nonstatic_byte_space_offset;
3250 nonstatic_byte_space_offset += 1;
3251 nonstatic_byte_space_count -= 1;
3252 } else {
3253 real_offset = next_nonstatic_byte_offset;
3254 next_nonstatic_byte_offset += 1;
3255 }
3256 break;
3257 case NONSTATIC_SHORT:
3258 if( nonstatic_short_space_count > 0 ) {
3259 real_offset = nonstatic_short_space_offset;
3260 nonstatic_short_space_offset += BytesPerShort;
3261 nonstatic_short_space_count -= 1;
3262 } else {
3263 real_offset = next_nonstatic_short_offset;
3264 next_nonstatic_short_offset += BytesPerShort;
3265 }
3266 break;
3267 case NONSTATIC_WORD:
3268 if( nonstatic_word_space_count > 0 ) {
3269 real_offset = nonstatic_word_space_offset;
3270 nonstatic_word_space_offset += BytesPerInt;
3271 nonstatic_word_space_count -= 1;
3272 } else {
3273 real_offset = next_nonstatic_word_offset;
3274 next_nonstatic_word_offset += BytesPerInt;
3275 }
3276 break;
3277 case NONSTATIC_DOUBLE:
3278 real_offset = next_nonstatic_double_offset;
3279 next_nonstatic_double_offset += BytesPerLong;
3280 break;
3281 default:
3282 ShouldNotReachHere();
3283 }
3284 fs.set_offset(real_offset);
3285 }
3286
3287 // Size of instances
3288 int instance_size;
3289
3290 next_nonstatic_type_offset = align_size_up(notaligned_offset, wordSize );
3291 instance_size = align_object_size(next_nonstatic_type_offset / wordSize);
3292
3293 assert(instance_size == align_object_size(align_size_up((instanceOopDesc::base_offset_in_bytes() + nonstatic_field_size*heapOopSize), wordSize) / wordSize), "consistent layout helper value");
3294
3295 // Number of non-static oop map blocks allocated at end of klass.
3296 const unsigned int total_oop_map_count =
3297 compute_oop_map_count(super_klass, nonstatic_oop_map_count,
3298 first_nonstatic_oop_offset);
3299
3300 // Compute reference type
3301 ReferenceType rt;
3302 if (super_klass() == NULL) {
3303 rt = REF_NONE;
3304 } else {
3305 rt = super_klass->reference_type();
3306 }
3307
3308 // We can now create the basic klassOop for this klass
3309 klassOop ik = oopFactory::new_instanceKlass(name, vtable_size, itable_size,
3310 static_field_size,
3311 total_oop_map_count,
3312 rt, CHECK_(nullHandle));
3313 instanceKlassHandle this_klass (THREAD, ik);
3314
3315 assert(this_klass->static_field_size() == static_field_size, "sanity");
3316 assert(this_klass->nonstatic_oop_map_count() == total_oop_map_count,
3317 "sanity");
3318
3319 // Fill in information already parsed
3320 this_klass->set_access_flags(access_flags);
3321 this_klass->set_should_verify_class(verify);
3322 jint lh = Klass::instance_layout_helper(instance_size, false);
3323 this_klass->set_layout_helper(lh);
3324 assert(this_klass->oop_is_instance(), "layout is correct");
3325 assert(this_klass->size_helper() == instance_size, "correct size_helper");
3326 // Not yet: supers are done below to support the new subtype-checking fields
3327 //this_klass->set_super(super_klass());
3328 this_klass->set_class_loader(class_loader());
3329 this_klass->set_nonstatic_field_size(nonstatic_field_size);
3330 this_klass->set_has_nonstatic_fields(has_nonstatic_fields);
3331 this_klass->set_static_oop_field_count(fac.count[STATIC_OOP]);
3332 cp->set_pool_holder(this_klass());
3333 error_handler.set_in_error(false); // turn off error handler for cp
3334 this_klass->set_constants(cp());
3335 this_klass->set_local_interfaces(local_interfaces());
3336 this_klass->set_fields(fields(), java_fields_count);
3337 this_klass->set_methods(methods());
3338 if (has_final_method) {
3339 this_klass->set_has_final_method();
3340 }
3341 this_klass->set_method_ordering(method_ordering());
3342 // The instanceKlass::_methods_jmethod_ids cache and the
3343 // instanceKlass::_methods_cached_itable_indices cache are
3344 // both managed on the assumption that the initial cache
3345 // size is equal to the number of methods in the class. If
3346 // that changes, then instanceKlass::idnum_can_increment()
3347 // has to be changed accordingly.
3348 this_klass->set_initial_method_idnum(methods->length());
3349 this_klass->set_name(cp->klass_name_at(this_class_index));
3350 if (LinkWellKnownClasses || is_anonymous()) // I am well known to myself
3351 cp->klass_at_put(this_class_index, this_klass()); // eagerly resolve
3352 this_klass->set_protection_domain(protection_domain());
3353 this_klass->set_fields_annotations(fields_annotations());
3354 this_klass->set_methods_annotations(methods_annotations());
3355 this_klass->set_methods_parameter_annotations(methods_parameter_annotations());
3356 this_klass->set_methods_default_annotations(methods_default_annotations());
3357
3358 this_klass->set_minor_version(minor_version);
3359 this_klass->set_major_version(major_version);
3360
3361 // Set up methodOop::intrinsic_id as soon as we know the names of methods.
3362 // (We used to do this lazily, but now we query it in Rewriter,
3363 // which is eagerly done for every method, so we might as well do it now,
3364 // when everything is fresh in memory.)
3365 if (methodOopDesc::klass_id_for_intrinsics(this_klass->as_klassOop()) != vmSymbols::NO_SID) {
3366 for (int j = 0; j < methods->length(); j++) {
3367 ((methodOop)methods->obj_at(j))->init_intrinsic_id();
3368 }
3369 }
3370
3371 if (cached_class_file_bytes != NULL) {
3372 // JVMTI: we have an instanceKlass now, tell it about the cached bytes
3373 this_klass->set_cached_class_file(cached_class_file_bytes,
3374 cached_class_file_length);
3375 }
3376
3377 // Miranda methods
3378 if ((num_miranda_methods > 0) ||
3379 // if this class introduced new miranda methods or
3380 (super_klass.not_null() && (super_klass->has_miranda_methods()))
3381 // super class exists and this class inherited miranda methods
3382 ) {
3383 this_klass->set_has_miranda_methods(); // then set a flag
3384 }
3385
3386 // Additional attributes
3387 parse_classfile_attributes(cp, this_klass, CHECK_(nullHandle));
3388
3389 // Make sure this is the end of class file stream
3390 guarantee_property(cfs->at_eos(), "Extra bytes at the end of class file %s", CHECK_(nullHandle));
3391
3392 // VerifyOops believes that once this has been set, the object is completely loaded.
3393 // Compute transitive closure of interfaces this class implements
3394 this_klass->set_transitive_interfaces(transitive_interfaces());
3395
3396 // Fill in information needed to compute superclasses.
3397 this_klass->initialize_supers(super_klass(), CHECK_(nullHandle));
3398
3399 // Initialize itable offset tables
3400 klassItable::setup_itable_offset_table(this_klass);
3401
3402 // Do final class setup
3403 fill_oop_maps(this_klass, nonstatic_oop_map_count, nonstatic_oop_offsets, nonstatic_oop_counts);
3404
3405 set_precomputed_flags(this_klass);
3406
3407 // reinitialize modifiers, using the InnerClasses attribute
3408 int computed_modifiers = this_klass->compute_modifier_flags(CHECK_(nullHandle));
3409 this_klass->set_modifier_flags(computed_modifiers);
3410
3411 // check if this class can access its super class
3412 check_super_class_access(this_klass, CHECK_(nullHandle));
3413
3414 // check if this class can access its superinterfaces
3415 check_super_interface_access(this_klass, CHECK_(nullHandle));
3416
3417 // check if this class overrides any final method
3418 check_final_method_override(this_klass, CHECK_(nullHandle));
3419
3420 // check that if this class is an interface then it doesn't have static methods
3421 if (this_klass->is_interface()) {
3422 check_illegal_static_method(this_klass, CHECK_(nullHandle));
3423 }
3424
3425 // Allocate mirror and initialize static fields
3426 java_lang_Class::create_mirror(this_klass, CHECK_(nullHandle));
3427
3428 ClassLoadingService::notify_class_loaded(instanceKlass::cast(this_klass()),
3429 false /* not shared class */);
3430
3431 if (TraceClassLoading) {
3432 // print in a single call to reduce interleaving of output
3433 if (cfs->source() != NULL) {
3434 tty->print("[Loaded %s from %s]\n", this_klass->external_name(),
3435 cfs->source());
3436 } else if (class_loader.is_null()) {
3437 if (THREAD->is_Java_thread()) {
3438 klassOop caller = ((JavaThread*)THREAD)->security_get_caller_class(1);
3439 tty->print("[Loaded %s by instance of %s]\n",
3440 this_klass->external_name(),
3441 instanceKlass::cast(caller)->external_name());
3442 } else {
3443 tty->print("[Loaded %s]\n", this_klass->external_name());
3444 }
3445 } else {
3446 ResourceMark rm;
3447 tty->print("[Loaded %s from %s]\n", this_klass->external_name(),
3448 instanceKlass::cast(class_loader->klass())->external_name());
3449 }
3450 }
3451
3452 if (TraceClassResolution) {
3453 // print out the superclass.
3454 const char * from = Klass::cast(this_klass())->external_name();
3455 if (this_klass->java_super() != NULL) {
3456 tty->print("RESOLVE %s %s (super)\n", from, instanceKlass::cast(this_klass->java_super())->external_name());
3457 }
3458 // print out each of the interface classes referred to by this class.
3459 objArrayHandle local_interfaces(THREAD, this_klass->local_interfaces());
3460 if (!local_interfaces.is_null()) {
3461 int length = local_interfaces->length();
3462 for (int i = 0; i < length; i++) {
3463 klassOop k = klassOop(local_interfaces->obj_at(i));
3464 instanceKlass* to_class = instanceKlass::cast(k);
3465 const char * to = to_class->external_name();
3466 tty->print("RESOLVE %s %s (interface)\n", from, to);
3467 }
3468 }
3469 }
3470
3471 #ifndef PRODUCT
3472 if( PrintCompactFieldsSavings ) {
3473 if( nonstatic_field_size < orig_nonstatic_field_size ) {
3474 tty->print("[Saved %d of %d bytes in %s]\n",
3475 (orig_nonstatic_field_size - nonstatic_field_size)*heapOopSize,
3476 orig_nonstatic_field_size*heapOopSize,
3477 this_klass->external_name());
3478 } else if( nonstatic_field_size > orig_nonstatic_field_size ) {
3479 tty->print("[Wasted %d over %d bytes in %s]\n",
3480 (nonstatic_field_size - orig_nonstatic_field_size)*heapOopSize,
3481 orig_nonstatic_field_size*heapOopSize,
3482 this_klass->external_name());
3483 }
3484 }
3485 #endif
3486
3487 // preserve result across HandleMark
3488 preserve_this_klass = this_klass();
3489 }
3490
3491 // Create new handle outside HandleMark
3492 instanceKlassHandle this_klass (THREAD, preserve_this_klass);
3493 debug_only(this_klass->as_klassOop()->verify();)
3494
3495 return this_klass;
3496 }
3497
3498
3499 unsigned int
3500 ClassFileParser::compute_oop_map_count(instanceKlassHandle super,
3501 unsigned int nonstatic_oop_map_count,
3502 int first_nonstatic_oop_offset) {
3503 unsigned int map_count =
3504 super.is_null() ? 0 : super->nonstatic_oop_map_count();
3505 if (nonstatic_oop_map_count > 0) {
3506 // We have oops to add to map
3507 if (map_count == 0) {
3508 map_count = nonstatic_oop_map_count;
3509 } else {
3510 // Check whether we should add a new map block or whether the last one can
3511 // be extended
3512 OopMapBlock* const first_map = super->start_of_nonstatic_oop_maps();
3513 OopMapBlock* const last_map = first_map + map_count - 1;
3514
3515 int next_offset = last_map->offset() + last_map->count() * heapOopSize;
3516 if (next_offset == first_nonstatic_oop_offset) {
3517 // There is no gap bettwen superklass's last oop field and first
3518 // local oop field, merge maps.
3519 nonstatic_oop_map_count -= 1;
3520 } else {
3521 // Superklass didn't end with a oop field, add extra maps
3522 assert(next_offset < first_nonstatic_oop_offset, "just checking");
3523 }
3524 map_count += nonstatic_oop_map_count;
3525 }
3526 }
3527 return map_count;
3528 }
3529
3530
3531 void ClassFileParser::fill_oop_maps(instanceKlassHandle k,
3532 unsigned int nonstatic_oop_map_count,
3533 int* nonstatic_oop_offsets,
3534 unsigned int* nonstatic_oop_counts) {
3535 OopMapBlock* this_oop_map = k->start_of_nonstatic_oop_maps();
3536 const instanceKlass* const super = k->superklass();
3537 const unsigned int super_count = super ? super->nonstatic_oop_map_count() : 0;
3538 if (super_count > 0) {
3539 // Copy maps from superklass
3540 OopMapBlock* super_oop_map = super->start_of_nonstatic_oop_maps();
3541 for (unsigned int i = 0; i < super_count; ++i) {
3542 *this_oop_map++ = *super_oop_map++;
3543 }
3544 }
3545
3546 if (nonstatic_oop_map_count > 0) {
3547 if (super_count + nonstatic_oop_map_count > k->nonstatic_oop_map_count()) {
3548 // The counts differ because there is no gap between superklass's last oop
3549 // field and the first local oop field. Extend the last oop map copied
3550 // from the superklass instead of creating new one.
3551 nonstatic_oop_map_count--;
3552 nonstatic_oop_offsets++;
3553 this_oop_map--;
3554 this_oop_map->set_count(this_oop_map->count() + *nonstatic_oop_counts++);
3555 this_oop_map++;
3556 }
3557
3558 // Add new map blocks, fill them
3559 while (nonstatic_oop_map_count-- > 0) {
3560 this_oop_map->set_offset(*nonstatic_oop_offsets++);
3561 this_oop_map->set_count(*nonstatic_oop_counts++);
3562 this_oop_map++;
3563 }
3564 assert(k->start_of_nonstatic_oop_maps() + k->nonstatic_oop_map_count() ==
3565 this_oop_map, "sanity");
3566 }
3567 }
3568
3569
3570 void ClassFileParser::set_precomputed_flags(instanceKlassHandle k) {
3571 klassOop super = k->super();
3572
3573 // Check if this klass has an empty finalize method (i.e. one with return bytecode only),
3574 // in which case we don't have to register objects as finalizable
3575 if (!_has_empty_finalizer) {
3576 if (_has_finalizer ||
3577 (super != NULL && super->klass_part()->has_finalizer())) {
3578 k->set_has_finalizer();
3579 }
3580 }
3581
3582 #ifdef ASSERT
3583 bool f = false;
3584 methodOop m = k->lookup_method(vmSymbols::finalize_method_name(),
3585 vmSymbols::void_method_signature());
3586 if (m != NULL && !m->is_empty_method()) {
3587 f = true;
3588 }
3589 assert(f == k->has_finalizer(), "inconsistent has_finalizer");
3590 #endif
3591
3592 // Check if this klass supports the java.lang.Cloneable interface
3593 if (SystemDictionary::Cloneable_klass_loaded()) {
3594 if (k->is_subtype_of(SystemDictionary::Cloneable_klass())) {
3595 k->set_is_cloneable();
3596 }
3597 }
3598
3599 // Check if this klass has a vanilla default constructor
3600 if (super == NULL) {
3601 // java.lang.Object has empty default constructor
3602 k->set_has_vanilla_constructor();
3603 } else {
3604 if (Klass::cast(super)->has_vanilla_constructor() &&
3605 _has_vanilla_constructor) {
3606 k->set_has_vanilla_constructor();
3607 }
3608 #ifdef ASSERT
3609 bool v = false;
3610 if (Klass::cast(super)->has_vanilla_constructor()) {
3611 methodOop constructor = k->find_method(vmSymbols::object_initializer_name(
3612 ), vmSymbols::void_method_signature());
3613 if (constructor != NULL && constructor->is_vanilla_constructor()) {
3614 v = true;
3615 }
3616 }
3617 assert(v == k->has_vanilla_constructor(), "inconsistent has_vanilla_constructor");
3618 #endif
3619 }
3620
3621 // If it cannot be fast-path allocated, set a bit in the layout helper.
3622 // See documentation of instanceKlass::can_be_fastpath_allocated().
3623 assert(k->size_helper() > 0, "layout_helper is initialized");
3624 if ((!RegisterFinalizersAtInit && k->has_finalizer())
3625 || k->is_abstract() || k->is_interface()
3626 || (k->name() == vmSymbols::java_lang_Class()
3627 && k->class_loader() == NULL)
3628 || k->size_helper() >= FastAllocateSizeLimit) {
3629 // Forbid fast-path allocation.
3630 jint lh = Klass::instance_layout_helper(k->size_helper(), true);
3631 k->set_layout_helper(lh);
3632 }
3633 }
3634
3635
3636 // utility method for appending and array with check for duplicates
3637
3638 void append_interfaces(objArrayHandle result, int& index, objArrayOop ifs) {
3639 // iterate over new interfaces
3640 for (int i = 0; i < ifs->length(); i++) {
3641 oop e = ifs->obj_at(i);
3642 assert(e->is_klass() && instanceKlass::cast(klassOop(e))->is_interface(), "just checking");
3643 // check for duplicates
3644 bool duplicate = false;
3645 for (int j = 0; j < index; j++) {
3646 if (result->obj_at(j) == e) {
3647 duplicate = true;
3648 break;
3649 }
3650 }
3651 // add new interface
3652 if (!duplicate) {
3653 result->obj_at_put(index++, e);
3654 }
3655 }
3656 }
3657
3658 objArrayHandle ClassFileParser::compute_transitive_interfaces(instanceKlassHandle super, objArrayHandle local_ifs, TRAPS) {
3659 // Compute maximum size for transitive interfaces
3660 int max_transitive_size = 0;
3661 int super_size = 0;
3662 // Add superclass transitive interfaces size
3663 if (super.not_null()) {
3664 super_size = super->transitive_interfaces()->length();
3665 max_transitive_size += super_size;
3666 }
3667 // Add local interfaces' super interfaces
3668 int local_size = local_ifs->length();
3669 for (int i = 0; i < local_size; i++) {
3670 klassOop l = klassOop(local_ifs->obj_at(i));
3671 max_transitive_size += instanceKlass::cast(l)->transitive_interfaces()->length();
3672 }
3673 // Finally add local interfaces
3674 max_transitive_size += local_size;
3675 // Construct array
3676 objArrayHandle result;
3677 if (max_transitive_size == 0) {
3678 // no interfaces, use canonicalized array
3679 result = objArrayHandle(THREAD, Universe::the_empty_system_obj_array());
3680 } else if (max_transitive_size == super_size) {
3681 // no new local interfaces added, share superklass' transitive interface array
3682 result = objArrayHandle(THREAD, super->transitive_interfaces());
3683 } else if (max_transitive_size == local_size) {
3684 // only local interfaces added, share local interface array
3685 result = local_ifs;
3686 } else {
3687 objArrayHandle nullHandle;
3688 objArrayOop new_objarray = oopFactory::new_system_objArray(max_transitive_size, CHECK_(nullHandle));
3689 result = objArrayHandle(THREAD, new_objarray);
3690 int index = 0;
3691 // Copy down from superclass
3692 if (super.not_null()) {
3693 append_interfaces(result, index, super->transitive_interfaces());
3694 }
3695 // Copy down from local interfaces' superinterfaces
3696 for (int i = 0; i < local_ifs->length(); i++) {
3697 klassOop l = klassOop(local_ifs->obj_at(i));
3698 append_interfaces(result, index, instanceKlass::cast(l)->transitive_interfaces());
3699 }
3700 // Finally add local interfaces
3701 append_interfaces(result, index, local_ifs());
3702
3703 // Check if duplicates were removed
3704 if (index != max_transitive_size) {
3705 assert(index < max_transitive_size, "just checking");
3706 objArrayOop new_result = oopFactory::new_system_objArray(index, CHECK_(nullHandle));
3707 for (int i = 0; i < index; i++) {
3708 oop e = result->obj_at(i);
3709 assert(e != NULL, "just checking");
3710 new_result->obj_at_put(i, e);
3711 }
3712 result = objArrayHandle(THREAD, new_result);
3713 }
3714 }
3715 return result;
3716 }
3717
3718
3719 void ClassFileParser::check_super_class_access(instanceKlassHandle this_klass, TRAPS) {
3720 klassOop super = this_klass->super();
3721 if ((super != NULL) &&
3722 (!Reflection::verify_class_access(this_klass->as_klassOop(), super, false))) {
3723 ResourceMark rm(THREAD);
3724 Exceptions::fthrow(
3725 THREAD_AND_LOCATION,
3726 vmSymbols::java_lang_IllegalAccessError(),
3727 "class %s cannot access its superclass %s",
3728 this_klass->external_name(),
3729 instanceKlass::cast(super)->external_name()
3730 );
3731 return;
3732 }
3733 }
3734
3735
3736 void ClassFileParser::check_super_interface_access(instanceKlassHandle this_klass, TRAPS) {
3737 objArrayHandle local_interfaces (THREAD, this_klass->local_interfaces());
3738 int lng = local_interfaces->length();
3739 for (int i = lng - 1; i >= 0; i--) {
3740 klassOop k = klassOop(local_interfaces->obj_at(i));
3741 assert (k != NULL && Klass::cast(k)->is_interface(), "invalid interface");
3742 if (!Reflection::verify_class_access(this_klass->as_klassOop(), k, false)) {
3743 ResourceMark rm(THREAD);
3744 Exceptions::fthrow(
3745 THREAD_AND_LOCATION,
3746 vmSymbols::java_lang_IllegalAccessError(),
3747 "class %s cannot access its superinterface %s",
3748 this_klass->external_name(),
3749 instanceKlass::cast(k)->external_name()
3750 );
3751 return;
3752 }
3753 }
3754 }
3755
3756
3757 void ClassFileParser::check_final_method_override(instanceKlassHandle this_klass, TRAPS) {
3758 objArrayHandle methods (THREAD, this_klass->methods());
3759 int num_methods = methods->length();
3760
3761 // go thru each method and check if it overrides a final method
3762 for (int index = 0; index < num_methods; index++) {
3763 methodOop m = (methodOop)methods->obj_at(index);
3764
3765 // skip private, static and <init> methods
3766 if ((!m->is_private()) &&
3767 (!m->is_static()) &&
3768 (m->name() != vmSymbols::object_initializer_name())) {
3769
3770 Symbol* name = m->name();
3771 Symbol* signature = m->signature();
3772 klassOop k = this_klass->super();
3773 methodOop super_m = NULL;
3774 while (k != NULL) {
3775 // skip supers that don't have final methods.
3776 if (k->klass_part()->has_final_method()) {
3777 // lookup a matching method in the super class hierarchy
3778 super_m = instanceKlass::cast(k)->lookup_method(name, signature);
3779 if (super_m == NULL) {
3780 break; // didn't find any match; get out
3781 }
3782
3783 if (super_m->is_final() &&
3784 // matching method in super is final
3785 (Reflection::verify_field_access(this_klass->as_klassOop(),
3786 super_m->method_holder(),
3787 super_m->method_holder(),
3788 super_m->access_flags(), false))
3789 // this class can access super final method and therefore override
3790 ) {
3791 ResourceMark rm(THREAD);
3792 Exceptions::fthrow(
3793 THREAD_AND_LOCATION,
3794 vmSymbols::java_lang_VerifyError(),
3795 "class %s overrides final method %s.%s",
3796 this_klass->external_name(),
3797 name->as_C_string(),
3798 signature->as_C_string()
3799 );
3800 return;
3801 }
3802
3803 // continue to look from super_m's holder's super.
3804 k = instanceKlass::cast(super_m->method_holder())->super();
3805 continue;
3806 }
3807
3808 k = k->klass_part()->super();
3809 }
3810 }
3811 }
3812 }
3813
3814
3815 // assumes that this_klass is an interface
3816 void ClassFileParser::check_illegal_static_method(instanceKlassHandle this_klass, TRAPS) {
3817 assert(this_klass->is_interface(), "not an interface");
3818 objArrayHandle methods (THREAD, this_klass->methods());
3819 int num_methods = methods->length();
3820
3821 for (int index = 0; index < num_methods; index++) {
3822 methodOop m = (methodOop)methods->obj_at(index);
3823 // if m is static and not the init method, throw a verify error
3824 if ((m->is_static()) && (m->name() != vmSymbols::class_initializer_name())) {
3825 ResourceMark rm(THREAD);
3826 Exceptions::fthrow(
3827 THREAD_AND_LOCATION,
3828 vmSymbols::java_lang_VerifyError(),
3829 "Illegal static method %s in interface %s",
3830 m->name()->as_C_string(),
3831 this_klass->external_name()
3832 );
3833 return;
3834 }
3835 }
3836 }
3837
3838 // utility methods for format checking
3839
3840 void ClassFileParser::verify_legal_class_modifiers(jint flags, TRAPS) {
3841 if (!_need_verify) { return; }
3842
3843 const bool is_interface = (flags & JVM_ACC_INTERFACE) != 0;
3844 const bool is_abstract = (flags & JVM_ACC_ABSTRACT) != 0;
3845 const bool is_final = (flags & JVM_ACC_FINAL) != 0;
3846 const bool is_super = (flags & JVM_ACC_SUPER) != 0;
3847 const bool is_enum = (flags & JVM_ACC_ENUM) != 0;
3848 const bool is_annotation = (flags & JVM_ACC_ANNOTATION) != 0;
3849 const bool major_gte_15 = _major_version >= JAVA_1_5_VERSION;
3850
3851 if ((is_abstract && is_final) ||
3852 (is_interface && !is_abstract) ||
3853 (is_interface && major_gte_15 && (is_super || is_enum)) ||
3854 (!is_interface && major_gte_15 && is_annotation)) {
3855 ResourceMark rm(THREAD);
3856 Exceptions::fthrow(
3857 THREAD_AND_LOCATION,
3858 vmSymbols::java_lang_ClassFormatError(),
3859 "Illegal class modifiers in class %s: 0x%X",
3860 _class_name->as_C_string(), flags
3861 );
3862 return;
3863 }
3864 }
3865
3866 bool ClassFileParser::has_illegal_visibility(jint flags) {
3867 const bool is_public = (flags & JVM_ACC_PUBLIC) != 0;
3868 const bool is_protected = (flags & JVM_ACC_PROTECTED) != 0;
3869 const bool is_private = (flags & JVM_ACC_PRIVATE) != 0;
3870
3871 return ((is_public && is_protected) ||
3872 (is_public && is_private) ||
3873 (is_protected && is_private));
3874 }
3875
3876 bool ClassFileParser::is_supported_version(u2 major, u2 minor) {
3877 u2 max_version =
3878 JDK_Version::is_gte_jdk17x_version() ? JAVA_MAX_SUPPORTED_VERSION :
3879 (JDK_Version::is_gte_jdk16x_version() ? JAVA_6_VERSION : JAVA_1_5_VERSION);
3880 return (major >= JAVA_MIN_SUPPORTED_VERSION) &&
3881 (major <= max_version) &&
3882 ((major != max_version) ||
3883 (minor <= JAVA_MAX_SUPPORTED_MINOR_VERSION));
3884 }
3885
3886 void ClassFileParser::verify_legal_field_modifiers(
3887 jint flags, bool is_interface, TRAPS) {
3888 if (!_need_verify) { return; }
3889
3890 const bool is_public = (flags & JVM_ACC_PUBLIC) != 0;
3891 const bool is_protected = (flags & JVM_ACC_PROTECTED) != 0;
3892 const bool is_private = (flags & JVM_ACC_PRIVATE) != 0;
3893 const bool is_static = (flags & JVM_ACC_STATIC) != 0;
3894 const bool is_final = (flags & JVM_ACC_FINAL) != 0;
3895 const bool is_volatile = (flags & JVM_ACC_VOLATILE) != 0;
3896 const bool is_transient = (flags & JVM_ACC_TRANSIENT) != 0;
3897 const bool is_enum = (flags & JVM_ACC_ENUM) != 0;
3898 const bool major_gte_15 = _major_version >= JAVA_1_5_VERSION;
3899
3900 bool is_illegal = false;
3901
3902 if (is_interface) {
3903 if (!is_public || !is_static || !is_final || is_private ||
3904 is_protected || is_volatile || is_transient ||
3905 (major_gte_15 && is_enum)) {
3906 is_illegal = true;
3907 }
3908 } else { // not interface
3909 if (has_illegal_visibility(flags) || (is_final && is_volatile)) {
3910 is_illegal = true;
3911 }
3912 }
3913
3914 if (is_illegal) {
3915 ResourceMark rm(THREAD);
3916 Exceptions::fthrow(
3917 THREAD_AND_LOCATION,
3918 vmSymbols::java_lang_ClassFormatError(),
3919 "Illegal field modifiers in class %s: 0x%X",
3920 _class_name->as_C_string(), flags);
3921 return;
3922 }
3923 }
3924
3925 void ClassFileParser::verify_legal_method_modifiers(
3926 jint flags, bool is_interface, Symbol* name, TRAPS) {
3927 if (!_need_verify) { return; }
3928
3929 const bool is_public = (flags & JVM_ACC_PUBLIC) != 0;
3930 const bool is_private = (flags & JVM_ACC_PRIVATE) != 0;
3931 const bool is_static = (flags & JVM_ACC_STATIC) != 0;
3932 const bool is_final = (flags & JVM_ACC_FINAL) != 0;
3933 const bool is_native = (flags & JVM_ACC_NATIVE) != 0;
3934 const bool is_abstract = (flags & JVM_ACC_ABSTRACT) != 0;
3935 const bool is_bridge = (flags & JVM_ACC_BRIDGE) != 0;
3936 const bool is_strict = (flags & JVM_ACC_STRICT) != 0;
3937 const bool is_synchronized = (flags & JVM_ACC_SYNCHRONIZED) != 0;
3938 const bool major_gte_15 = _major_version >= JAVA_1_5_VERSION;
3939 const bool is_initializer = (name == vmSymbols::object_initializer_name());
3940
3941 bool is_illegal = false;
3942
3943 if (is_interface) {
3944 if (!is_abstract || !is_public || is_static || is_final ||
3945 is_native || (major_gte_15 && (is_synchronized || is_strict))) {
3946 is_illegal = true;
3947 }
3948 } else { // not interface
3949 if (is_initializer) {
3950 if (is_static || is_final || is_synchronized || is_native ||
3951 is_abstract || (major_gte_15 && is_bridge)) {
3952 is_illegal = true;
3953 }
3954 } else { // not initializer
3955 if (is_abstract) {
3956 if ((is_final || is_native || is_private || is_static ||
3957 (major_gte_15 && (is_synchronized || is_strict)))) {
3958 is_illegal = true;
3959 }
3960 }
3961 if (has_illegal_visibility(flags)) {
3962 is_illegal = true;
3963 }
3964 }
3965 }
3966
3967 if (is_illegal) {
3968 ResourceMark rm(THREAD);
3969 Exceptions::fthrow(
3970 THREAD_AND_LOCATION,
3971 vmSymbols::java_lang_ClassFormatError(),
3972 "Method %s in class %s has illegal modifiers: 0x%X",
3973 name->as_C_string(), _class_name->as_C_string(), flags);
3974 return;
3975 }
3976 }
3977
3978 void ClassFileParser::verify_legal_utf8(const unsigned char* buffer, int length, TRAPS) {
3979 assert(_need_verify, "only called when _need_verify is true");
3980 int i = 0;
3981 int count = length >> 2;
3982 for (int k=0; k<count; k++) {
3983 unsigned char b0 = buffer[i];
3984 unsigned char b1 = buffer[i+1];
3985 unsigned char b2 = buffer[i+2];
3986 unsigned char b3 = buffer[i+3];
3987 // For an unsigned char v,
3988 // (v | v - 1) is < 128 (highest bit 0) for 0 < v < 128;
3989 // (v | v - 1) is >= 128 (highest bit 1) for v == 0 or v >= 128.
3990 unsigned char res = b0 | b0 - 1 |
3991 b1 | b1 - 1 |
3992 b2 | b2 - 1 |
3993 b3 | b3 - 1;
3994 if (res >= 128) break;
3995 i += 4;
3996 }
3997 for(; i < length; i++) {
3998 unsigned short c;
3999 // no embedded zeros
4000 guarantee_property((buffer[i] != 0), "Illegal UTF8 string in constant pool in class file %s", CHECK);
4001 if(buffer[i] < 128) {
4002 continue;
4003 }
4004 if ((i + 5) < length) { // see if it's legal supplementary character
4005 if (UTF8::is_supplementary_character(&buffer[i])) {
4006 c = UTF8::get_supplementary_character(&buffer[i]);
4007 i += 5;
4008 continue;
4009 }
4010 }
4011 switch (buffer[i] >> 4) {
4012 default: break;
4013 case 0x8: case 0x9: case 0xA: case 0xB: case 0xF:
4014 classfile_parse_error("Illegal UTF8 string in constant pool in class file %s", CHECK);
4015 case 0xC: case 0xD: // 110xxxxx 10xxxxxx
4016 c = (buffer[i] & 0x1F) << 6;
4017 i++;
4018 if ((i < length) && ((buffer[i] & 0xC0) == 0x80)) {
4019 c += buffer[i] & 0x3F;
4020 if (_major_version <= 47 || c == 0 || c >= 0x80) {
4021 // for classes with major > 47, c must a null or a character in its shortest form
4022 break;
4023 }
4024 }
4025 classfile_parse_error("Illegal UTF8 string in constant pool in class file %s", CHECK);
4026 case 0xE: // 1110xxxx 10xxxxxx 10xxxxxx
4027 c = (buffer[i] & 0xF) << 12;
4028 i += 2;
4029 if ((i < length) && ((buffer[i-1] & 0xC0) == 0x80) && ((buffer[i] & 0xC0) == 0x80)) {
4030 c += ((buffer[i-1] & 0x3F) << 6) + (buffer[i] & 0x3F);
4031 if (_major_version <= 47 || c >= 0x800) {
4032 // for classes with major > 47, c must be in its shortest form
4033 break;
4034 }
4035 }
4036 classfile_parse_error("Illegal UTF8 string in constant pool in class file %s", CHECK);
4037 } // end of switch
4038 } // end of for
4039 }
4040
4041 // Checks if name is a legal class name.
4042 void ClassFileParser::verify_legal_class_name(Symbol* name, TRAPS) {
4043 if (!_need_verify || _relax_verify) { return; }
4044
4045 char buf[fixed_buffer_size];
4046 char* bytes = name->as_utf8_flexible_buffer(THREAD, buf, fixed_buffer_size);
4047 unsigned int length = name->utf8_length();
4048 bool legal = false;
4049
4050 if (length > 0) {
4051 char* p;
4052 if (bytes[0] == JVM_SIGNATURE_ARRAY) {
4053 p = skip_over_field_signature(bytes, false, length, CHECK);
4054 legal = (p != NULL) && ((p - bytes) == (int)length);
4055 } else if (_major_version < JAVA_1_5_VERSION) {
4056 if (bytes[0] != '<') {
4057 p = skip_over_field_name(bytes, true, length);
4058 legal = (p != NULL) && ((p - bytes) == (int)length);
4059 }
4060 } else {
4061 // 4900761: relax the constraints based on JSR202 spec
4062 // Class names may be drawn from the entire Unicode character set.
4063 // Identifiers between '/' must be unqualified names.
4064 // The utf8 string has been verified when parsing cpool entries.
4065 legal = verify_unqualified_name(bytes, length, LegalClass);
4066 }
4067 }
4068 if (!legal) {
4069 ResourceMark rm(THREAD);
4070 Exceptions::fthrow(
4071 THREAD_AND_LOCATION,
4072 vmSymbols::java_lang_ClassFormatError(),
4073 "Illegal class name \"%s\" in class file %s", bytes,
4074 _class_name->as_C_string()
4075 );
4076 return;
4077 }
4078 }
4079
4080 // Checks if name is a legal field name.
4081 void ClassFileParser::verify_legal_field_name(Symbol* name, TRAPS) {
4082 if (!_need_verify || _relax_verify) { return; }
4083
4084 char buf[fixed_buffer_size];
4085 char* bytes = name->as_utf8_flexible_buffer(THREAD, buf, fixed_buffer_size);
4086 unsigned int length = name->utf8_length();
4087 bool legal = false;
4088
4089 if (length > 0) {
4090 if (_major_version < JAVA_1_5_VERSION) {
4091 if (bytes[0] != '<') {
4092 char* p = skip_over_field_name(bytes, false, length);
4093 legal = (p != NULL) && ((p - bytes) == (int)length);
4094 }
4095 } else {
4096 // 4881221: relax the constraints based on JSR202 spec
4097 legal = verify_unqualified_name(bytes, length, LegalField);
4098 }
4099 }
4100
4101 if (!legal) {
4102 ResourceMark rm(THREAD);
4103 Exceptions::fthrow(
4104 THREAD_AND_LOCATION,
4105 vmSymbols::java_lang_ClassFormatError(),
4106 "Illegal field name \"%s\" in class %s", bytes,
4107 _class_name->as_C_string()
4108 );
4109 return;
4110 }
4111 }
4112
4113 // Checks if name is a legal method name.
4114 void ClassFileParser::verify_legal_method_name(Symbol* name, TRAPS) {
4115 if (!_need_verify || _relax_verify) { return; }
4116
4117 assert(name != NULL, "method name is null");
4118 char buf[fixed_buffer_size];
4119 char* bytes = name->as_utf8_flexible_buffer(THREAD, buf, fixed_buffer_size);
4120 unsigned int length = name->utf8_length();
4121 bool legal = false;
4122
4123 if (length > 0) {
4124 if (bytes[0] == '<') {
4125 if (name == vmSymbols::object_initializer_name() || name == vmSymbols::class_initializer_name()) {
4126 legal = true;
4127 }
4128 } else if (_major_version < JAVA_1_5_VERSION) {
4129 char* p;
4130 p = skip_over_field_name(bytes, false, length);
4131 legal = (p != NULL) && ((p - bytes) == (int)length);
4132 } else {
4133 // 4881221: relax the constraints based on JSR202 spec
4134 legal = verify_unqualified_name(bytes, length, LegalMethod);
4135 }
4136 }
4137
4138 if (!legal) {
4139 ResourceMark rm(THREAD);
4140 Exceptions::fthrow(
4141 THREAD_AND_LOCATION,
4142 vmSymbols::java_lang_ClassFormatError(),
4143 "Illegal method name \"%s\" in class %s", bytes,
4144 _class_name->as_C_string()
4145 );
4146 return;
4147 }
4148 }
4149
4150
4151 // Checks if signature is a legal field signature.
4152 void ClassFileParser::verify_legal_field_signature(Symbol* name, Symbol* signature, TRAPS) {
4153 if (!_need_verify) { return; }
4154
4155 char buf[fixed_buffer_size];
4156 char* bytes = signature->as_utf8_flexible_buffer(THREAD, buf, fixed_buffer_size);
4157 unsigned int length = signature->utf8_length();
4158 char* p = skip_over_field_signature(bytes, false, length, CHECK);
4159
4160 if (p == NULL || (p - bytes) != (int)length) {
4161 throwIllegalSignature("Field", name, signature, CHECK);
4162 }
4163 }
4164
4165 // Checks if signature is a legal method signature.
4166 // Returns number of parameters
4167 int ClassFileParser::verify_legal_method_signature(Symbol* name, Symbol* signature, TRAPS) {
4168 if (!_need_verify) {
4169 // make sure caller's args_size will be less than 0 even for non-static
4170 // method so it will be recomputed in compute_size_of_parameters().
4171 return -2;
4172 }
4173
4174 unsigned int args_size = 0;
4175 char buf[fixed_buffer_size];
4176 char* p = signature->as_utf8_flexible_buffer(THREAD, buf, fixed_buffer_size);
4177 unsigned int length = signature->utf8_length();
4178 char* nextp;
4179
4180 // The first character must be a '('
4181 if ((length > 0) && (*p++ == JVM_SIGNATURE_FUNC)) {
4182 length--;
4183 // Skip over legal field signatures
4184 nextp = skip_over_field_signature(p, false, length, CHECK_0);
4185 while ((length > 0) && (nextp != NULL)) {
4186 args_size++;
4187 if (p[0] == 'J' || p[0] == 'D') {
4188 args_size++;
4189 }
4190 length -= nextp - p;
4191 p = nextp;
4192 nextp = skip_over_field_signature(p, false, length, CHECK_0);
4193 }
4194 // The first non-signature thing better be a ')'
4195 if ((length > 0) && (*p++ == JVM_SIGNATURE_ENDFUNC)) {
4196 length--;
4197 if (name->utf8_length() > 0 && name->byte_at(0) == '<') {
4198 // All internal methods must return void
4199 if ((length == 1) && (p[0] == JVM_SIGNATURE_VOID)) {
4200 return args_size;
4201 }
4202 } else {
4203 // Now we better just have a return value
4204 nextp = skip_over_field_signature(p, true, length, CHECK_0);
4205 if (nextp && ((int)length == (nextp - p))) {
4206 return args_size;
4207 }
4208 }
4209 }
4210 }
4211 // Report error
4212 throwIllegalSignature("Method", name, signature, CHECK_0);
4213 return 0;
4214 }
4215
4216
4217 // Unqualified names may not contain the characters '.', ';', '[', or '/'.
4218 // Method names also may not contain the characters '<' or '>', unless <init>
4219 // or <clinit>. Note that method names may not be <init> or <clinit> in this
4220 // method. Because these names have been checked as special cases before
4221 // calling this method in verify_legal_method_name.
4222 bool ClassFileParser::verify_unqualified_name(
4223 char* name, unsigned int length, int type) {
4224 jchar ch;
4225
4226 for (char* p = name; p != name + length; ) {
4227 ch = *p;
4228 if (ch < 128) {
4229 p++;
4230 if (ch == '.' || ch == ';' || ch == '[' ) {
4231 return false; // do not permit '.', ';', or '['
4232 }
4233 if (type != LegalClass && ch == '/') {
4234 return false; // do not permit '/' unless it's class name
4235 }
4236 if (type == LegalMethod && (ch == '<' || ch == '>')) {
4237 return false; // do not permit '<' or '>' in method names
4238 }
4239 } else {
4240 char* tmp_p = UTF8::next(p, &ch);
4241 p = tmp_p;
4242 }
4243 }
4244 return true;
4245 }
4246
4247
4248 // Take pointer to a string. Skip over the longest part of the string that could
4249 // be taken as a fieldname. Allow '/' if slash_ok is true.
4250 // Return a pointer to just past the fieldname.
4251 // Return NULL if no fieldname at all was found, or in the case of slash_ok
4252 // being true, we saw consecutive slashes (meaning we were looking for a
4253 // qualified path but found something that was badly-formed).
4254 char* ClassFileParser::skip_over_field_name(char* name, bool slash_ok, unsigned int length) {
4255 char* p;
4256 jchar ch;
4257 jboolean last_is_slash = false;
4258 jboolean not_first_ch = false;
4259
4260 for (p = name; p != name + length; not_first_ch = true) {
4261 char* old_p = p;
4262 ch = *p;
4263 if (ch < 128) {
4264 p++;
4265 // quick check for ascii
4266 if ((ch >= 'a' && ch <= 'z') ||
4267 (ch >= 'A' && ch <= 'Z') ||
4268 (ch == '_' || ch == '$') ||
4269 (not_first_ch && ch >= '0' && ch <= '9')) {
4270 last_is_slash = false;
4271 continue;
4272 }
4273 if (slash_ok && ch == '/') {
4274 if (last_is_slash) {
4275 return NULL; // Don't permit consecutive slashes
4276 }
4277 last_is_slash = true;
4278 continue;
4279 }
4280 } else {
4281 jint unicode_ch;
4282 char* tmp_p = UTF8::next_character(p, &unicode_ch);
4283 p = tmp_p;
4284 last_is_slash = false;
4285 // Check if ch is Java identifier start or is Java identifier part
4286 // 4672820: call java.lang.Character methods directly without generating separate tables.
4287 EXCEPTION_MARK;
4288 instanceKlassHandle klass (THREAD, SystemDictionary::Character_klass());
4289
4290 // return value
4291 JavaValue result(T_BOOLEAN);
4292 // Set up the arguments to isJavaIdentifierStart and isJavaIdentifierPart
4293 JavaCallArguments args;
4294 args.push_int(unicode_ch);
4295
4296 // public static boolean isJavaIdentifierStart(char ch);
4297 JavaCalls::call_static(&result,
4298 klass,
4299 vmSymbols::isJavaIdentifierStart_name(),
4300 vmSymbols::int_bool_signature(),
4301 &args,
4302 THREAD);
4303
4304 if (HAS_PENDING_EXCEPTION) {
4305 CLEAR_PENDING_EXCEPTION;
4306 return 0;
4307 }
4308 if (result.get_jboolean()) {
4309 continue;
4310 }
4311
4312 if (not_first_ch) {
4313 // public static boolean isJavaIdentifierPart(char ch);
4314 JavaCalls::call_static(&result,
4315 klass,
4316 vmSymbols::isJavaIdentifierPart_name(),
4317 vmSymbols::int_bool_signature(),
4318 &args,
4319 THREAD);
4320
4321 if (HAS_PENDING_EXCEPTION) {
4322 CLEAR_PENDING_EXCEPTION;
4323 return 0;
4324 }
4325
4326 if (result.get_jboolean()) {
4327 continue;
4328 }
4329 }
4330 }
4331 return (not_first_ch) ? old_p : NULL;
4332 }
4333 return (not_first_ch) ? p : NULL;
4334 }
4335
4336
4337 // Take pointer to a string. Skip over the longest part of the string that could
4338 // be taken as a field signature. Allow "void" if void_ok.
4339 // Return a pointer to just past the signature.
4340 // Return NULL if no legal signature is found.
4341 char* ClassFileParser::skip_over_field_signature(char* signature,
4342 bool void_ok,
4343 unsigned int length,
4344 TRAPS) {
4345 unsigned int array_dim = 0;
4346 while (length > 0) {
4347 switch (signature[0]) {
4348 case JVM_SIGNATURE_VOID: if (!void_ok) { return NULL; }
4349 case JVM_SIGNATURE_BOOLEAN:
4350 case JVM_SIGNATURE_BYTE:
4351 case JVM_SIGNATURE_CHAR:
4352 case JVM_SIGNATURE_SHORT:
4353 case JVM_SIGNATURE_INT:
4354 case JVM_SIGNATURE_FLOAT:
4355 case JVM_SIGNATURE_LONG:
4356 case JVM_SIGNATURE_DOUBLE:
4357 return signature + 1;
4358 case JVM_SIGNATURE_CLASS: {
4359 if (_major_version < JAVA_1_5_VERSION) {
4360 // Skip over the class name if one is there
4361 char* p = skip_over_field_name(signature + 1, true, --length);
4362
4363 // The next character better be a semicolon
4364 if (p && (p - signature) > 1 && p[0] == ';') {
4365 return p + 1;
4366 }
4367 } else {
4368 // 4900761: For class version > 48, any unicode is allowed in class name.
4369 length--;
4370 signature++;
4371 while (length > 0 && signature[0] != ';') {
4372 if (signature[0] == '.') {
4373 classfile_parse_error("Class name contains illegal character '.' in descriptor in class file %s", CHECK_0);
4374 }
4375 length--;
4376 signature++;
4377 }
4378 if (signature[0] == ';') { return signature + 1; }
4379 }
4380
4381 return NULL;
4382 }
4383 case JVM_SIGNATURE_ARRAY:
4384 array_dim++;
4385 if (array_dim > 255) {
4386 // 4277370: array descriptor is valid only if it represents 255 or fewer dimensions.
4387 classfile_parse_error("Array type descriptor has more than 255 dimensions in class file %s", CHECK_0);
4388 }
4389 // The rest of what's there better be a legal signature
4390 signature++;
4391 length--;
4392 void_ok = false;
4393 break;
4394
4395 default:
4396 return NULL;
4397 }
4398 }
4399 return NULL;
4400 }
--- EOF ---
|
__label__pos
| 0.994893 |
++ed by:
PAWAPAWA PINGAN NGLENN
1 non-PAUSE user
Author image Peter John Acklam
NAME
bigint - transparent big integer support for Perl
SYNOPSIS
use bigint;
$x = 2 + 4.5; # Math::BigInt 6
print 2 ** 512; # Math::BigInt 134...096
print inf + 42; # Math::BigInt inf
print NaN * 7; # Math::BigInt NaN
print hex("0x1234567890123490"); # Perl v5.10.0 or later
{
no bigint;
print 2 ** 256; # a normal Perl scalar now
}
# for older Perls, import into current package:
use bigint qw/hex oct/;
print hex("0x1234567890123490");
print oct("01234567890123490");
DESCRIPTION
All numeric literal in the given scope are converted to Math::BigInt objects. Numeric literal that represent non-integers are truncated to an integer. All results of expressions are also truncated to integer.
All operators (including basic math operations) except the range operator .. are overloaded.
Unlike the integer pragma, the bigint pragma creates integers that are only limited in their size by the available memory.
So, the following:
use bigint;
$x = 1234;
creates a Math::BigInt and stores a reference to in $x. This happens transparently and behind your back, so to speak.
You can see this with the following:
perl -Mbigint -le 'print ref(1234)'
Since numbers are actually objects, you can call all the usual methods from Math::BigFloat on them. This even works to some extent on expressions:
perl -Mbigint -le '$x = 1234; print $x->bdec()'
perl -Mbigint -le 'print 1234->copy()->binc();'
perl -Mbigint -le 'print 1234->copy()->binc->badd(6);'
perl -Mbigint -le 'print +(1234)->copy()->binc()'
(Note that print doesn't do what you expect if the expression starts with '(' hence the +)
You can even chain the operations together as usual:
perl -Mbigint -le 'print 1234->copy()->binc->badd(6);'
1241
Please note the following does not work as expected (prints nothing), since overloading of '..' is not yet possible in Perl (as of v5.8.0):
perl -Mbigint -le 'for (1..2) { print ref($_); }'
use integer vs. use bigint
There are some difference between use integer and use bigint.
Whereas use integer is limited to what can be handled as a Perl scalar, use bigint can handle arbitrarily large integers.
Also, use integer does affect assignments to variables and the return value of some functions. use bigint truncates these results to integer:
# perl -Minteger -wle 'print 3.2'
3.2
# perl -Minteger -wle 'print 3.2 + 0'
3
# perl -Mbigint -wle 'print 3.2'
3
# perl -Mbigint -wle 'print 3.2 + 0'
3
# perl -Mbigint -wle 'print exp(1) + 0'
2
# perl -Mbigint -wle 'print exp(1)'
2
# perl -Minteger -wle 'print exp(1)'
2.71828182845905
# perl -Minteger -wle 'print exp(1) + 0'
2
In practice this seldom makes a difference for small integers as parts and results of expressions are truncated anyway, but this can, for instance, affect the return value of subroutines:
sub three_integer { use integer; return 3.2; }
sub three_bigint { use bigint; return 3.2; }
print three_integer(), " ", three_bigint(),"\n"; # prints "3.2 3"
Options
bigint recognizes some options that can be passed while loading it via use. The following options exist:
a or accuracy
This sets the accuracy for all math operations. The argument must be greater than or equal to zero. See Math::BigInt's bround() method for details.
perl -Mbigint=a,2 -le 'print 12345+1'
Note that setting precision and accuracy at the same time is not possible.
p or precision
This sets the precision for all math operations. The argument can be any integer. Negative values mean a fixed number of digits after the dot, and are ignored since all operations happen in integer space. A positive value rounds to this digit left from the dot. 0 means round to integer. See Math::BigInt's bfround() method for details.
perl -mbigint=p,5 -le 'print 123456789+123'
Note that setting precision and accuracy at the same time is not possible.
t or trace
This enables a trace mode and is primarily for debugging.
l, lib, try, or only
Load a different math lib, see "Math Library".
perl -Mbigint=l,GMP -e 'print 2 ** 512'
perl -Mbigint=lib,GMP -e 'print 2 ** 512'
perl -Mbigint=try,GMP -e 'print 2 ** 512'
perl -Mbigint=only,GMP -e 'print 2 ** 512'
hex
Override the built-in hex() method with a version that can handle big numbers. This overrides it by exporting it to the current package. Under Perl v5.10.0 and higher, this is not necessary, as hex() is lexically overridden in the current scope whenever the bigint pragma is active.
oct
Override the built-in oct() method with a version that can handle big numbers. This overrides it by exporting it to the current package. Under Perl v5.10.0 and higher, this is not so necessary, as oct() is lexically overridden in the current scope whenever the bigint pragma is active.
v or version
this prints out the name and version of the modules and then exits.
perl -Mbigint=v
Math Library
Math with the numbers is done (by default) by a backend library module called Math::BigInt::Calc. The default is equivalent to saying:
use bigint lib => 'Calc';
you can change this by using:
use bigint lib => 'GMP';
The following would first try to find Math::BigInt::Foo, then Math::BigInt::Bar, and if this also fails, revert to Math::BigInt::Calc:
use bigint lib => 'Foo,Math::BigInt::Bar';
Using c<lib> warns if none of the specified libraries can be found and Math::BigInt fell back to one of the default libraries. To suppress this warning, use c<try> instead:
use bigint try => 'GMP';
If you want the code to die instead of falling back, use only instead:
use bigint only => 'GMP';
Please see the respective module documentation for further details.
Method calls
Since all numbers are now objects, you can use all methods that are part of the Math::BigInt API.
But a warning is in order. When using the following to make a copy of a number, only a shallow copy will be made.
$x = 9; $y = $x;
$x = $y = 7;
Using the copy or the original with overloaded math is okay, e.g., the following work:
$x = 9; $y = $x;
print $x + 1, " ", $y,"\n"; # prints 10 9
but calling any method that modifies the number directly will result in both the original and the copy being destroyed:
$x = 9; $y = $x;
print $x->badd(1), " ", $y,"\n"; # prints 10 10
$x = 9; $y = $x;
print $x->binc(1), " ", $y,"\n"; # prints 10 10
$x = 9; $y = $x;
print $x->bmul(2), " ", $y,"\n"; # prints 18 18
Using methods that do not modify, but test that the contents works:
$x = 9; $y = $x;
$z = 9 if $x->is_zero(); # works fine
See the documentation about the copy constructor and = in overload, as well as the documentation in Math::BigInt for further details.
Methods
inf()
A shortcut to return Math::BigInt->binf(). Useful because Perl does not always handle bareword inf properly.
NaN()
A shortcut to return Math::BigInt->bnan(). Useful because Perl does not always handle bareword NaN properly.
e
# perl -Mbigint=e -wle 'print e'
Returns Euler's number e, aka exp(1). Note that under bigint, this is truncated to an integer, i.e., 2.
PI
# perl -Mbigint=PI -wle 'print PI'
Returns PI. Note that under bigint, this is truncated to an integer, i.e., 3.
bexp()
bexp($power, $accuracy);
Returns Euler's number e raised to the appropriate power, to the wanted accuracy.
Note that under bigint, the result is truncated to an integer.
Example:
# perl -Mbigint=bexp -wle 'print bexp(1,80)'
bpi()
bpi($accuracy);
Returns PI to the wanted accuracy. Note that under bigint, this is truncated to an integer, i.e., 3.
Example:
# perl -Mbigint=bpi -wle 'print bpi(80)'
accuracy()
Set or get the accuracy.
precision()
Set or get the precision.
round_mode()
Set or get the rounding mode.
div_scale()
Set or get the division scale.
in_effect()
use bigint;
print "in effect\n" if bigint::in_effect; # true
{
no bigint;
print "in effect\n" if bigint::in_effect; # false
}
Returns true or false if bigint is in effect in the current scope.
This method only works on Perl v5.9.4 or later.
CAVEATS
Hexadecimal, octal, and binary floating point literals
Perl (and this module) accepts hexadecimal, octal, and binary floating point literals, but use them with care with Perl versions before v5.32.0, because some versions of Perl silently give the wrong result.
Operator vs literal overloading
bigint works by overloading handling of integer and floating point literals, converting them to Math::BigInt objects.
This means that arithmetic involving only string values or string literals are performed using Perl's built-in operators.
For example:
use bigint;
my $x = "900000000000000009";
my $y = "900000000000000007";
print $x - $y;
outputs 0 on default 32-bit builds, since bigint never sees the string literals. To ensure the expression is all treated as Math::BigInt objects, use a literal number in the expression:
print +(0+$x) - $y;
Ranges
Perl does not allow overloading of ranges, so you can neither safely use ranges with bigint endpoints, nor is the iterator variable a Math::BigInt.
use 5.010;
for my $i (12..13) {
for my $j (20..21) {
say $i ** $j; # produces a floating-point number,
# not an object
}
}
in_effect()
This method only works on Perl v5.9.4 or later.
hex()/oct()
bigint overrides these routines with versions that can also handle big integer values. Under Perl prior to version v5.9.4, however, this will not happen unless you specifically ask for it with the two import tags "hex" and "oct" - and then it will be global and cannot be disabled inside a scope with no bigint:
use bigint qw/hex oct/;
print hex("0x1234567890123456");
{
no bigint;
print hex("0x1234567890123456");
}
The second call to hex() will warn about a non-portable constant.
Compare this to:
use bigint;
# will warn only under Perl older than v5.9.4
print hex("0x1234567890123456");
EXAMPLES
Some cool command line examples to impress the Python crowd ;) You might want to compare them to the results under -Mbigfloat or -Mbigrat:
perl -Mbigint -le 'print sqrt(33)'
perl -Mbigint -le 'print 2**255'
perl -Mbigint -le 'print 4.5+2**255'
perl -Mbigint -le 'print 123->is_odd()'
perl -Mbigint=l,GMP -le 'print 7 ** 7777'
BUGS
Please report any bugs or feature requests to bug-bignum at rt.cpan.org, or through the web interface at https://rt.cpan.org/Ticket/Create.html?Queue=bignum (requires login). We will be notified, and then you'll automatically be notified of progress on your bug as I make changes.
SUPPORT
You can find documentation for this module with the perldoc command.
perldoc bigint
You can also look for information at:
LICENSE
This program is free software; you may redistribute it and/or modify it under the same terms as Perl itself.
SEE ALSO
bignum and bigrat.
Math::BigInt, Math::BigFloat, Math::BigRat and Math::Big as well as Math::BigInt::FastCalc, Math::BigInt::Pari and Math::BigInt::GMP.
AUTHORS
• (C) by Tels http://bloodgate.com/ in early 2002 - 2007.
• Maintained by Peter John Acklam <[email protected]>, 2014-.
|
__label__pos
| 0.652066 |
Analytics and data analysis
23 February 2024
CO2 estimation and calculation
24 February 2024
Open Data, Pandas, DataFrame and ChatGPT
The transition from unmanaged data flow to its effective integration into business processes starts with converting data from closed formats to open formats.
In scientific research, the principle of sharing open data accelerates discovery and facilitates international collaboration among scientists. In medicine, sharing information between institutions leads to more effective diagnosis and treatment. In information technology, open-source applications allow developers around the world to collaboratively improve software.
A major benefit of open data is its ability to remove the dependence of application developers on specific platforms to access data.
The choice between open and closed data is an obvious one, as is the preference for structured data in automation, data processing and data warehousing processes. Structured data is often used by default in most systems because of its ease of processing and unambiguous interpretation, making it the most preferred type for communication and collaboration at the requirements and business process level.
In the context of the construction industry, open structured data enables smooth and coordinated business processes where teams can focus on optimizing projects rather than struggling with incompatible data formats, platforms and systems.
To transform data into a structured format, a wide range of tools are available, where one of the most popular tools is the Python language library - Pandas.
Due to its flexibility and wide functionality, Pandas has become an indispensable tool for data scientists, automation and analytics professionals, facilitating the process of turning raw data into valuable information. We will use the Pandas library in conjunction with the ChatGPT tool in practical examples in the following chapters of this book, so let's take a closer look at these tools.
Pandas Python
Pandas library, occupies a special place in the arsenal of tools for working with data, becoming one of the most popular and demanded in this area.
In the world of analytics and structured data management, Pandas stands out for its simplicity, speed and power, providing users with a wide range of tools to effectively analyze and process information.
The Python programming language's Pandas library not only allows to perform basic operations such as reading and writing tables, but also to perform more complex tasks, including merging data, grouping data, and performing complex analytical calculations. Pandas can be compared to a Swiss knife for data analysts and data engineers.
As of January 2024, the number of downloads of the Pandas library is about 4.3 million per day.
The query language in the Pandas library is similar in its functionality to the SQL query language we discussed in the chapter "Relational Databases and SQL Query Language".
Both tools offer powerful data manipulation capabilities including sampling, filtering, sorting and grouping data. Pandas is often preferred in scientific research, process automation, Pipeline creation, and Python data manipulation, while SQL is the standard in database management and is often used in enterprise environments to work with large amounts of data.
Using Pandas, it is possible to work efficiently with large amounts of data - much larger than what Excel can handle. Even when millions of rows are involved, Pandas can handle such tables with ease, providing powerful tools for analyzing, visualizing, and gaining valuable insights from the data. In addition, Pandas has strong community support: hundreds of millions of developers and analysts (Kaggle.com, Google Collab, Microsoft Azure Notebooks, Amazon SageMaker) around the world use it daily online or offline, providing a large number of out-of-the-box solutions for any business desire.
DataFrame
DataFrame in the Pandas library is the name of a two-dimensional data table with a flexible data structure. A DataFrame is organized as a table where each column contains data of the same type (e.g., numbers, strings, dates) and each row represents a separate data set, or record.
A DataFrame is a way of organizing data into a table very similar to the one you might see in Excel. In this table, the rows are individual records or entities, and the columns are the various characteristics or attributes of these item-entities.
For example, if we have a table with information about a construction project, the rows can represent the individual entities-elements of the project and the attributes-columns can represent their categories, parameters, position or coordinates of the BoundingBox elements.
Let's list some of the key features and functionality of DataFrame in Pandas:
• Columns: in a DataFrame, data is organized in columns, each with a unique name. Columns-attributes can contain data of different types, similar to columns in databases or columns in tables.
• Rows: in a DataFrame can be indexed with unique values known as a DataFrame index. This index allows to quickly modify and manipulate data on specific rows.
• Index: by default, when a DataFrame is created, Pandas assigns an index from 0 to N-1 to each row (where N is the number of all rows in the DataFrame). However, the index can be modified so that it contains specific labels such as dates or unique identifiers.
• Indexing rows in a DataFrame means assigning each row a unique identifier or label, known as the DataFrame index.
• Data Types: DataFrame supports a variety of data types, including: `int`, `float`, `bool`, `datetime64` and `obect` for text data. Each DataFrame column has its own data type that defines what operations can be performed on its contents.
• Data operations: DataFrame supports a wide range of operations for data processing, including aggregation (`groupby`), merge (`merge` and `join`), concatenation (`concat`), split-apply-combine, and many other methods for manipulating and transforming data.
• Size Manipulation: DataFrame allows to add and remove columns and rows, making it a dynamic structure that can be modified according to data analysis needs.
• Data Visualization: using built-in visualization techniques or interfacing with popular data visualization libraries such as Matplotlib or Seaborn, DataFrame can be easily converted to graphs and charts to present data graphically.
• Data input and output: Pandas provides functions to read import and export data to various file formats such as CSV, Excel, JSON, HTML and SQL, making DataFrame a central hub for data collection and distribution.
These are just the main features and capabilities of DataFrame, but they already make it an indispensable tool for importing, organizing, analyzing, validating, and processing and exporting multi-format and multi-structured data. We will talk more about types of other formats Parquet, Apache orc, JSON, Father, HDF5 and data warehouses in the chapter "Modern data technologies in the construction industry".
The Pandas library and the DataFrame format, due to their popularity and ease of use, have become the primary tools for data processing and automation in the ChatGPT model (in 2023-2024). ChatGPT considers using Pandas and Python often the default when handling queries related to data validation, analysis, and processing.
ChatGPT and LLM
ChatGPT and other tools based on the use of large language models (LLMs) greatly simplify data collection, analysis, and automation. These tools allow users to formulate data queries, avoiding the cost of programmers or learning programming languages and various frameworks on their own.
ChatGPT, developed by OpenAI, is an artificial intelligence that processes natural language and uses extensive data from the Internet to answer queries.
In the past, data analysis required knowledge of the Python programming language and specialized libraries such as Pandas, Polars and DuckDB. By 2023, however, the process has become much simpler thanks to ChatGPT's ability to process text queries and provide accurate results without the need for manual coding. This textual communication capability has made code creation easier and data processing more accessible to a wider audience, becoming a significant breakthrough in usability.
Just like at a certain point, users no longer need to understand how the internet works in order to use it or even create online applications or pages (CMS WordPress, Joomla, Drupal), specialists and engineers in construction companies without deep programming knowledge are now using tools like ChatGPT and LLaMA to automate the logic of processes and replace the functions of individual specialists or entire departments.
LLM chats such as ChatGPT and LLaMA allow professionals without deep programming knowledge to contribute to automating and improving a company's business processes.
Once we have familiarized ourselves with the main data types and tools for processing them, we are ready to move on to the first stage of working with data: opening closed formats and converting information from different formats into structured forms.
Latest posts
Stay updated: news and insights
Facing Issues?
Reach Out!
Offer support for any troubleshooting or advanced use-cases
Fresh solutions are released through our social channels
Related posts
Don't miss the new solutions
Open Data, Pandas, DataFrame and ChatGPT
This website uses cookies to improve your experience. By using this website you agree to our Data Protection Policy.
Read more
Subscribe now to get free discount coupon code. Don't miss out!
SUBSCRIBE
I agree with the term and condition
|
__label__pos
| 0.880972 |
relative triple precision
relative triple precision
[′rel·əd·iv ′trip·əl prə′sizh·ən]
(computer science)
The retention of three times as many digits of a quantity as the computer normally handles; for example, a computer whose basic word consists of 10 decimal digits is called upon to handle 30 decimal digit quantities.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
|
__label__pos
| 0.548272 |
Example PolarGraphGenerator.cs
Shows a simple graph type generating a polar graph.
Version
Tested with version 4.0.10
using System.Collections.Generic;
using UnityEngine;
// Include the Pathfinding namespace to gain access to a lot of useful classes
using Pathfinding;
// Required to save the settings
using Pathfinding.Serialization;
using Pathfinding.Util;
// Inherit our new graph from a base graph type
[JsonOptIn]
public class PolarGraph : NavGraph {
[JsonMember]
public int circles = 10;
[JsonMember]
public int steps = 20;
[JsonMember]
public Vector3 center = Vector3.zero;
[JsonMember]
public float scale = 2;
// Here we will store all nodes in the graph
public PointNode[] nodes;
GraphTransform transform;
PointNode CreateNode (Vector3 position) {
var node = new PointNode(active);
// Node positions are stored as Int3. We can convert a Vector3 to an Int3 like this
node.position = (Int3)position;
return node;
}
static Vector3 CalculateNodePosition (int circle, float angle, GraphTransform transform) {
// Get the direction towards the node from the center
var pos = new Vector3(Mathf.Sin(angle), 0, Mathf.Cos(angle));
// Multiply it with the circle number to get the node position in graph space
pos *= circle;
// Multiply it with the matrix to get the node position in world space
pos = transform.Transform(pos);
return pos;
}
protected override IEnumerable<Progress> ScanInternal () {
// Create a 2D array which will contain all nodes
// This is just a tempoary array to make it easier to reference different nodes
PointNode[][] circleNodes = new PointNode[circles][];
// Create a matrix which just moves the nodes to #center
// and scales their positions by #scale
// The GraphTransform class has various utility methods for working with it
transform = new GraphTransform(Matrix4x4.TRS(center, Quaternion.identity, Vector3.one*scale));
// Place the center node in the center
circleNodes[0] = new PointNode[] {
CreateNode(CalculateNodePosition(0, 0, transform))
};
// The size of the angle (in radians) each step will use
float anglesPerStep = (2*Mathf.PI)/steps;
for (int circle = 1; circle < circles; circle++) {
circleNodes[circle] = new PointNode[steps];
for (int step = 0; step < steps; step++) {
// Get the angle to the node relative to the center
float angle = step * anglesPerStep;
Vector3 pos = CalculateNodePosition(circle, angle, transform);
circleNodes[circle][step] = CreateNode(pos);
}
}
// Now all nodes are created, let's create some connections between them!
// Iterate through all circles
// circle 0 is just the center node so we skip that for now
for (int circle = 1; circle < circles; circle++) {
for (int step = 0; step < steps; step++) {
// Get the current node
PointNode node = circleNodes[circle][step];
// The nodes here will always have exactly four connections, like a grid, but polar.
// Except for those in the last circle which will only have three connections
int numConnections = circle < circles-1 ? 4 : 3;
var connections = new Connection[numConnections];
// Get the next clockwise node in the current circle.
// The last node in each circle should be linked to the first node
// in the circle which is why we use the modulo operator.
connections[0].node = circleNodes[circle][(step+1) % steps];
// Counter clockwise node. Here we check for underflow instead
connections[1].node = circleNodes[circle][(step-1+steps) % steps];
// The node in the previous circle (in towards the center)
if (circle > 1) {
connections[2].node = circleNodes[circle-1][step];
} else {
// Create a connection to the middle node, special case
connections[2].node = circleNodes[circle-1][0];
}
// Are there any more circles outside this one?
if (numConnections == 4) {
// The node in the next circle (out from the center)
connections[3].node = circleNodes[circle+1][step];
}
for (int q = 0; q < connections.Length; q++) {
// Node.position is an Int3, here we get the cost of moving between the two positions
connections[q].cost = (uint)(node.position-connections[q].node.position).costMagnitude;
}
node.connections = connections;
}
}
// The center node is a special case, so we have to deal with it separately
PointNode centerNode = circleNodes[0][0];
centerNode.connections = new Connection[steps];
// Assign all nodes in the first circle as connections to the center node
for (int step = 0; step < steps; step++) {
centerNode.connections[step] = new Connection(
circleNodes[1][step],
// centerNode.position is an Int3, here we get the cost of moving between the two positions
(uint)(centerNode.position-circleNodes[1][step].position).costMagnitude
);
}
// Store all nodes in the nodes array
List<PointNode> allNodes = new List<PointNode>();
for (int i = 0; i < circleNodes.Length; i++) {
allNodes.AddRange(circleNodes[i]);
}
nodes = allNodes.ToArray();
// Set all the nodes to be walkable
for (int i = 0; i < nodes.Length; i++) {
nodes[i].Walkable = true;
}
yield break;
}
public override void GetNodes (System.Action<GraphNode> action) {
if (nodes == null) return;
for (int i = 0; i < nodes.Length; i++) {
// Call the delegate
action(nodes[i]);
}
}
}
|
__label__pos
| 0.999081 |
[Samba] Setting up a Share Using Windows ACLs
Rowland Penny rpenny at samba.org
Tue Jul 24 10:52:26 UTC 2018
On Tue, 24 Jul 2018 05:34:51 -0500 (CDT)
fret via samba <samba at lists.samba.org> wrote:
> Regardless of all the tips and procedures I read in the archives, I
> can not set permisisions under security tab, I get it every time:
>
> "Remotely setting permissions on the folder at the root of a share
> removes all inherited permissions from the root folder and all
> subfolders. To set permissions without removing the inherited
> permissions, click No and either change the permissions on a child
> folder or make the change while logged in locally"
>
> despite this warning when click on Yes button acces is denied and cant
> escape from loop(only task manager helps)
>
> Samba version on AD is 4.8.0 (compiled from source)
> Samba version on Domain member is Samba version
> 4.8.2-git.30.690aa93c1892.1-SUSE-SLE_12-x86_64
>
> I would like to point out that virtually all tests and parameters are
> working properly according to SambaWiki. smb_conf.txt
> <http://samba.2283325.n4.nabble.com/file/t372619/smb_conf.txt>
Please don't do that, just post it in the post i.e.
[global]
workgroup = TCIT
security = ADS
realm = TCIT.NOVOSTI.LAB
log file = /var/log/samba/%m.log
log level = 1
idmap config * : backend = tdb
idmap config * : range = 2000-9999
idmap config TCIT:backend = ad
idmap config TCIT:schema_mode = rfc2307
idmap config TCIT:range = 10000-999999
idmap config domain_name:unix_nss_info = yes
winbind enum users = yes
winbind enum groups = yes
vfs objects = acl_xattr
map acl inherit = yes
store dos attributes = yes
username map = /etc/samba/user.map
dedicated keytab file = /etc/krb5.keytab
kerberos method = secrets and keytab
winbind refresh tickets = Yes
[Demo}
path = /srv/samba/TestShare3/
read only = no
Just a few questions:
In the 'idmap config' lines you have 'domain_name', is this what is
actually there, or is it 'TCIT' ?
If it isn't 'TCIT' change it to 'TCIT'
What is in the user.map ?
Is the user you are trying to connect with 'Administrator' or a member
of Domain Admins ?
If it is 'Administrator', have you given 'Administrator' a uidNumber
attribute, if you have, remove it.
If your user is a member of Domain Admins, does Domain Admins have a
gidNumber attribute and the required privileges ?
Rowland
More information about the samba mailing list
|
__label__pos
| 0.586303 |
Help:Extension:ParserFunctions
From GeoGebra Manual
(Redirected from Help:Parser function)
Jump to: navigation, search
The ParserFunctions extension provides eleven additional parser functions to supplement the "magic words", which are already present in MediaWiki. All the parser functions provided by this extension take the form:
{{#functionname: argument 1 | argument 2 | argument 3 ... }}
#expr
Type Operators
Grouping (parentheses) ( )
Numbers 1234.5 e (2.718) pi (3.142)
binary operator e, unary +,-
Unary not ceil trunc floor abs exp ln sin cos tan acos asin atan
Binary ^
* / div mod
+ -
Round round
Logic = != <> > < >= <=
and
or
This function evaluates a mathematical expression and returns the calculated value.
{{#expr: expression }}
The available operators are listed to the right, in order of precedence. See Help:Calculation for more details of the function of each operator. The accuracy and format of the result returned will vary depending on the operating system of the server running the wiki, and the number format of the site language.
When evaluating using boolean algebra, zero evaluates to false and any nonzero value, positive or negative, evaluates to true:
{{#expr: 1 and -1 }}1
{{#expr: 1 and 0 }}0
An empty input expression returns an empty string. Invalid expressions return one of several error messages, which can be caught using the #iferror function:
{{#expr: }}
{{#expr: 1+ }}Expression error: Missing operand for +.
{{#expr: 1 foo 2 }}Expression error: Unrecognized word "foo".
Warning Warning: The operator mod gives wrong results for some values of the second argument:
{{#expr: 123 mod (2^32-1)}}123 (should be 123)
Depending on the specification and configuration of the server running the wiki there may also be other errors:
{{#expr: 20060618093259 mod 10000}}3259 in most cases, but may occasionally give -6357. See bug 6356.
#if
{{#if: test string | value if true | value if false }}
This function tests whether the first parameter is 'non-empty'. It evaluates to false if the test string is empty or contains only whitespace characters (spaces, newlines, etc).
{{#if: | yes | no}}no
{{#if: string | yes | no}}yes
{{#if: | yes | no}}no
{{#if:
| yes | no}}
no
The test string is always interpreted as pure text, so mathematical expressions are not evaluated:
{{#if: 1==2 | yes | no }}yes
{{#if: 0 | yes | no }}yes
Either or both the return values may be omitted:
{{#if: foo | yes }} yes
{{#if: | yes }}
{{#if: foo | | no}}
See Help:Parser functions in templates for more examples of this parser function.
#ifeq
This parser function compares two strings and determines whether they are identical.
{{#ifeq: string 1 | string 2 | value if identical | value if different }}
If both strings are valid numerical values, the strings are compared numerically:
{{#ifeq: 01 | 1 | yes | no}}yes
{{#ifeq: 0 | -0 | yes | no}}yes
{{#ifeq: 1e3 | 1000 | yes | no}}yes
{{#ifeq: {{#expr:10^3}} | 1000 | yes | no}}yes
Otherwise the comparison is made as text; this comparison is case sensitive:
{{#ifeq: foo | bar | yes | no}}no
{{#ifeq: foo | Foo | yes | no}}no
{{#ifeq: "01" | "1" | yes | no}}no
{{#ifeq: 10^3 | 1000 | yes | no}}no
Warning Warning: Numerical comparisons with #ifeq and #switch are not equivalent with comparisons in expressions:
{{{{{1}}}{{#if:|{{{{{1n}}}}}}}}} gives 0
because PHP compares here two numbers of type integer, while
{{{{{1}}}{{#if:|{{{{{1n}}}}}}}}} gives 1
because MediaWiki converts literal numbers in expressions to type float, which, for large integers like these, involves rounding.
Warning Warning: Content inside parser tags (such as <nowiki>) is temporarily replaced by a unique code. This affects comparisons:
{{#ifeq: <nowiki>foo</nowiki> | <nowiki>foo</nowiki> | yes | no}}no
{{#ifeq: <math>foo</math> | <math>foo</math> | yes | no}}no
{{#ifeq: {{#tag:math|foo}} | {{#tag:math|foo}} | yes | no}}no
{{#ifeq: [[foo]] | [[foo]] | yes | no}}yes
It the strings to be compared are given as equal calls to the same template containing such tags then the condition is true, but in the case of two templates with identical content containing such tags it is false.
#iferror
This function takes an input string and returns one of two results; the function evaluates to true if the input string contains an HTML object with class="error", as generated by other parser functions such as #expr, #time and #rel2abs, template errors such as loops and recursions, and other "failsoft" parser errors.
{{#iferror: test string | value if error | value if correct }}
One or both of the return strings can be omitted. If the correct string is omitted, the test string is returned if it is not erroneous. If the error string is also omitted, an empty string is returned on an error:
{{#iferror: {{#expr: 1 + 2 }} | error | correct }}correct
{{#iferror: {{#expr: 1 + X }} | error | correct }}error
{{#iferror: {{#expr: 1 + 2 }} | error }}3
{{#iferror: {{#expr: 1 + X }} | error }}error
{{#iferror: {{#expr: 1 + 2 }} }}3
{{#iferror: {{#expr: 1 + X }} }} → '
{{#iferror: <strong class="error">a</strong> | error | correct }}error
#ifexpr
This function evaluates a mathematical expression and returns one of two strings depending on the boolean value of the result:
{{#ifexpr: expression | value if true | value if false }}
The expression input is evaluated exactly as for #expr above, with the same operators being available. The output is then evaluated as a boolean expression.
An empty input expression evaluates to false:
{{#ifexpr: | yes | no}}no
As mentioned above, zero evaluates to false and any nonzero value evaluates to true, so this function is equivalent to one using #ifeq and #expr only:
{{#ifeq: {{#expr: expression }} | 0 | value if false | value if true }}
except for an empty or wrong input expression (an error message is treated as an ordinary string; it is not equal to zero, so we get value if true).
Either or both the return values may be omitted; no output is given when the appropriate branch is left empty:
{{#ifexpr: 1 > 0 | yes }}yes
{{#ifexpr: 1 < 0 | yes }}
{{#ifexpr: 1 > 0 | | no}}
{{#ifexpr: 1 < 0 | | no}} no
{{#ifexpr: 1 > 0 }}
#ifexist
This function takes an input string, interprets it as a page title, and returns one of two values depending on whether or not the page exists on the local wiki.
{{#ifexist: page title | value if exists | value if doesn't exist }}
The function evaluates to true if the page exists, whether it contains content, is visibly blank (contains meta-data such as category links or magic words, but no visible content), is blank, or is a redirect. Only pages that are redlinked evaluate to false, including if the page used to exist but has been deleted.
{{#ifexist: Help:Extension:ParserFunctions | exists | doesn't exist }}exists
{{#ifexist: XXXHelp:Extension:ParserFunctionsXXX | exists | doesn't exist }}doesn't exist
The function evaluates to true for system messages that have been customised, and for special pages that are defined by the software.
{{#ifexist: Special:Watchlist | exists | doesn't exist }}exists
{{#ifexist: Special:CheckUser | exists | doesn't exist }}doesn't exist (because the CheckUser extension is not installed on this wiki)
{{#ifexist: MediaWiki:Copyright | exists | doesn't exist }}exists (because MediaWiki:Copyright has been customised)
#ifexist: is considered an "expensive parser function"; only a limited number of which can be included on any one page (including functions inside transcluded templates). When this limit is exceeded, the page is categorised into Category:Pages with too many expensive parser function calls, and any further #ifexist: functions automatically return false, whether the target page exists or not.
If a page checks a target using #ifexist:, then that page will appear in the Special:WhatLinksHere list for the target page. So if the code {{#ifexist:Foo}} were included live on this page (Help:Extension:ParserFunctions), Special:WhatLinksHere/Foo will list Help:Extension:ParserFunctions.
On wikis using a shared media repository, #ifexist: can be used to check if a file has been uploaded to the repository, but not to the wiki itself:
{{#ifexist: File:GeoGebra 48.png | exists | doesn't exist }}exists
{{#ifexist: Image:GeoGebra 48.png | exists | doesn't exist }}exists
{{#ifexist: Media:GeoGebra 48.png | exists | doesn't exist }}doesn't exist
If a local description page has been created for the file, the result is exists for all of the above.
#rel2abs
This function converts a relative file path into an absolute filepath.
{{#rel2abs: path }}
{{#rel2abs: path | base path }}
Within the path input, the following syntax is valid:
• . → the current level
• .. → "go up one level"
• /foo → "go down one level into the subdirectory /foo"
If the base path is not specified, the full page name of the page will be used instead:
{{#rel2abs: /quok | Help:Foo/bar/baz }}Help:Foo/bar/baz/quok
{{#rel2abs: ./quok | Help:Foo/bar/baz }}Help:Foo/bar/baz/quok
{{#rel2abs: ../quok | Help:Foo/bar/baz }}Help:Foo/bar/quok
{{#rel2abs: ../. | Help:Foo/bar/baz }}Help:Foo/bar
Invalid syntax, such as /. or /./, is ignored. Since no more than two consecutive full stops are permitted, sequences such as these can be used to separate successive statements:
{{#rel2abs: ../quok/. | Help:Foo/bar/baz }}Help:Foo/bar/quok
{{#rel2abs: ../../quok | Help:Foo/bar/baz }}Help:Foo/quok
{{#rel2abs: ../../../quok | Help:Foo/bar/baz }}quok
{{#rel2abs: ../../../../quok | Help:Foo/bar/baz }}Error: Invalid depth in path: "Help:Foo/bar/baz/../../../../quok" (tried to access a node above the root node).
#switch
This function compares one input value against several test cases, returning an associated string if a match is found.
{{#switch: comparison string
| case = result
| case = result
| ...
| case = result
| default result
}}
Example:
{{#switch: baz | foo = Foo | baz = Baz | Bar }} Baz
#switch allows an editor to add information in one template and this information will be visible in several other templates which all have different formatting.
Default
The default result is returned if no case string matches the comparison string:
{{#switch: test | foo = Foo | baz = Baz | Bar }} Bar
In this syntax, the default result must be the last parameter and must not contain a raw equals sign.
{{#switch: test | Bar | foo = Foo | baz = Baz }} →
{{#switch: test | foo = Foo | baz = Baz | B=ar }} →
Alternatively, the default result may be explicitly declared with a case string of "#default".
{{#switch: comparison string
| case = result
| case = result
| ...
| case = result
| #default = default result
}}
Default results declared in this way may be placed anywhere within the function:
{{#switch: test | foo = Foo | #default = Bar | baz = Baz }} Bar
If the default parameter is omitted and no match is made, no result is returned:
{{#switch: test | foo = Foo | baz = Baz }}
Grouping results
It is possible to have 'fall through' values, where several case strings return the same result string. This minimizes duplication.
{{#switch: comparison string
| case1 = result1
| case2
| case3
| case4 = result2
| case5 = result3
| case6
| case7 = result4
| #default = default result
}}
Here cases 2, 3 and 4 all return result2; cases 6 and 7 both return result4
Comparison behaviour
As with #ifeq, the comparison is made numerically if both the comparison string and the case string being tested are numeric; or as a case-sensitive string otherwise:
{{#switch: 0 + 1 | 1 = one | 2 = two | three}} → three
{{#switch: {{#expr: 0 + 1}} | 1 = one | 2 = two | three}} → one
{{#switch: a | a = A | b = B | C}} → A
{{#switch: A | a = A | b = B | C}} → C
A case string may be empty:
{{#switch: | = Nothing | foo = Foo | Something }}Nothing
Once a match is found, subsequent cases are ignored:
{{#switch: b | f = Foo | b = Bar | b = Baz | }}Bar
Warning Warning: Numerical comparisons with #switch and #ifeq are not equivalent with comparisons in expressions (see also above):
{{#switch: 12345678901234567 | 12345678901234568 = A | B}} → B
{{#ifexpr: 12345678901234567 = 12345678901234568 | A | B}} → A
Raw equal signs
"Case" strings cannot contain raw equals signs. To work around this, create a template {{=}} containing a single equals sign: =.
Example:
{{#switch: 1=2
| 1=2 = raw
| 1<nowiki>=</nowiki>2 = nowiki
| 1=2 = html
| 1{{=}}2 = template
| default }}html
Note:
For a simple real life example of the use of this function, check Template:NBA color. A complex example can be found at Template:Extension.
#time
Code Description Current output
Year
Y 4-digit year. 2022
y 2-digit year. 22
L 1 or 0 whether it's a leap year or not 0
o ¹ ISO-8601 year number. ² 2022 ³
¹ Requires PHP 5.1.0 and newer and rev:45208
² This has the same value as Y, except that if the ISO week number (W) belongs to the previous or next year, that year is used instead.
³ Will output literal o if ¹ not fulfilled
Month
n Month index, not zero-padded. 1
m Month index, zero-padded. 01
M An abbreviation of the month name, in the site language. Jan
F The full month name in the site language. January
xg Output the full month name in the genitive form for site languages that distinguish between genitive and nominative forms. For Polish:
(nominative)
{{#time:d F Y|20 June 2010}} → 20 czerwiec 2010
(genitive)
{{#time:d xg Y|20 June 2010}} → 20 czerwca 2010
Week
W ISO 8601 week number, zero-padded. 04
Day
j Day of the month, not zero-padded. 29
d Day of the month, zero-padded. 29
z Day of the year (January 1 = 0)
Note: To get the ISO day of the year add 1.
28
D An abbreviation for the day of the week. Rarely internationalised. Sat
l The full weekday name. Rarely internationalised. Saturday
N ISO 8601 day of the week (Monday = 1, Sunday = 7). 6
w number of the day of the week (Sunday = 0, Saturday = 6). 6
Hour
a "am" during the morning (00:00:00 → 11:59:59), "pm" otherwise (12:00:00 → 23:59:59) am
A Uppercase version of a above. AM
g Hour in 12-hour format, not zero-padded. 11
h Hour in 12-hour format, zero-padded. 11
G Hour in 24-hour format, not zero-padded. 11
H Hour in 24-hour format, zero-padded. 11
Minutes and seconds
i Minutes past the hour, zero-padded. 29
s Seconds past the minute, zero-padded. 37
U Seconds since January 1 1970 00:00:00 GMT. 1643455777
Miscellaneous
t Number of days in the current month. 31
c ISO 8601 formatted date, equivalent to Y-m-dTH:i:s+00:00. 2022-01-29T11:29:37+00:00
r RFC 2822 formatted date, equivalent to D, j M Y H:i:s +0000, with weekday name and month name not internationalised. Sat, 29 Jan 2022 11:29:37 +0000
Non-Gregorian calendars
Iranian
xij Day of the month 9
xiF Full month name Bahman
xin Month index 11
xiY Full year 1400
Hebrew
xjj Day of the month 27
xjF Full month name Shevat
xjx Genitive form of the month name Shevat
xjn Month number 5
xjY Full year 5782
Thai solar
xkY Full year 2565
Flags
xn Format the next numeric code as a raw ASCII number. In the Hindi language, {{#time:H, xnH}} produces ०६, 06
xN Like xn, but as a toggled flag, which endures until the end of the string or until the next appearance of xN in the string.
xr Format the next number as a roman numeral. Only works for numbers up to 3000. {{#time:xrY}} → MMXXII
This parser function takes a date and/or time (in the Gregorian calendar) and formats it according to the syntax given. A date/time object can be specified; the default is the value of the magic word {{CURRENTTIMESTAMP}} – that is, the time the page was last rendered into HTML.
{{#time: format string }}
{{#time: format string | date/time object }}
The list of accepted formatting codes is given in the table to the right. Any character in the formatting string that is not recognised is passed through unaltered; this applies also to blank spaces (the system does not need them for interpreting the codes). There are also two ways to escape characters within the formatting string:
1. A backslash followed by a formatting character is interpreted as a single literal character
2. characters enclosed in double quotes are considered literal characters, and the quotes are removed
In addition, the digraph xx is interpreted as a single literal "x".
{{#time: Y-m-d }}2022-01-29
{{#time: [[#Y]] m d }}#2022 01 29
{{#time: [[Past Events#Y]] }}+00:00am3731 EvUTC13137#2022
{{#time: [["Past Events"#Y]] }}Past Events#2022
{{#time: i's" }}29'37"
The date/time object can be in any format accepted by PHP's strtotime() function. Both absolute (eg 20 December 2000) and relative (eg +20 hours) times are accepted.
{{#time: r|now}}Sat, 29 Jan 2022 11:29:38 +0000
{{#time: r|+2 hours}}Sat, 29 Jan 2022 13:29:38 +0000
{{#time: r|now + 2 hours}}Sat, 29 Jan 2022 13:29:38 +0000
If you've calculated a Unix timestamp, you may use it in date calculations by pre-pending an @ symbol.
{{#time: U | now }}1643455778
{{#time: r|@1643455777}}Sat, 29 Jan 2022 11:29:37 +0000
Warning Warning: The range of acceptable input is 1 January 0111 → 31 December 9999. For the years 100 through 110 the output in inconsistent, Y and leap years are like the years 100-110, r, D, l and U are like interpreting these years as 2000-2010.
{{#time: d F Y | 29 Feb 0100 }}01 March 0100
(correct, no leap year), but
{{#time: r | 29 Feb 0100 }}Mon, 01 Mar 0100 00:00:00 +0000 (wrong, even if 100 is interpreted as 2000, because that is a leap year)
{{#time: d F Y | 15 April 10000 }}Error: Invalid time.
{{#time: r | 10000-4-15 }}Sat, 15 Apr 2000 10:00:00 +0000
Year numbers 0-99 are interpreted as 2000-2069 and 1970-1999, even when written with leading zeros:
{{#time: d F Y | 1 Jan 0069 }}01 January 0069
{{#time: d F Y | 1 Jan 0070 }}01 January 0070
The weekday is supplied for the years 100-110 and from 1753, for the years 111-1752 the r-output shows "Unknown" and the l-output "<>". As a consequence, the r-output is not accepted as input for these years.
Full or partial absolute dates can be specified; the function will 'fill in' parts of the date that are not specified using the current values:
{{#time: Y | January 1 }}2022
A four-digit number is interpreted as hours and minutes if possible, and otherwise as year:
{{#time: Y m d H:i:s | 1959 }}1959 01 29 00:00:00 Input is treated as a time rather than a year.
{{#time: Y m d H:i:s | 1960 }}1960 01 29 00:00:00 Since 19:60 is not a valid time, 1960 is treated as a year.
A six-digit number is interpreted as hours, minutes and seconds if possible, but otherwise as an error (not, for instance, a year and month):
{{#time: Y m d H:i:s | 195909 }}2022 01 29 19:59:09 Input is treated as a time rather than a year+month code.
{{#time: Y m d H:i:s | 196009 }}Error: Invalid time. Although 19:60:09 is not a valid time, 196009 is not interpreted as September 1960.
Warning Warning: The fill-in feature is not consistent; some parts are filled in using the current values, others are not:
{{#time: Y m d H:i:s | January 1 }}2022 01 01 00:00:00
{{#time: Y m d H:i:s | February 2007 }}2007 02 01 00:00:00 Goes to the start of the month, not the current day.
The function performs a certain amount of date mathematics:
{{#time: d F Y | January 0 2008 }}31 December 2007
{{#time: d F | January 32 }}Error: Invalid time.
{{#time: d F | February 29 2008 }}29 February
{{#time: d F | February 29 2007 }}01 March
The total length of the format strings of the calls of #time is limited to 6000 characters [1].
#timel
This function is identical to {{#time: ... }}, except that it uses the local time of the wiki (as set in $wgLocaltimezone) when no date is given.
{{#time: Y-m-d }}2022-01-29
{{#timel: Y-m-d }}2022-01-29
{{#time: Y F d h:i:s}}2022 January 29 11:29:37
{{#timel: Y F d h:i:s}}2022 January 29 12:29:37
#titleparts
This function separates a pagetitle into segments based on slashes, then returns some of those segments as output.
{{#titleparts: pagename | number of segments to return | first segment to return }}
If the number of segments parameter is not specified, it defaults to "0", which returns all the segments. If the first segment parameter is not specified or is "0", it defaults to "1":
{{#titleparts: Talk:Foo/bar/baz/quok }}Talk:Foo/bar/baz/quok
{{#titleparts: Talk:Foo/bar/baz/quok | 1 }}Talk:Foo
{{#titleparts: Talk:Foo/bar/baz/quok | 2 }}Talk:Foo/bar
{{#titleparts: Talk:Foo/bar/baz/quok | 2 | 2 }}bar/baz
Negative values are accepted for both values. Negative values for number of segments effectively 'strips' segments from the end of the string. Negative values for first segment translates to "add this value to the total number of segments", loosely equivalent to "count from the right":
{{#titleparts: Talk:Foo/bar/baz/quok | -1 }}Talk:Foo/bar/baz
{{#titleparts: Talk:Foo/bar/baz/quok | | -1 }} quok
{{#titleparts: Talk:Foo/bar/baz/quok | -1 | 2 }} bar/baz Strips one segment from the end of the string, then returns the second segment and beyond
The string is split a maximum of 25 times; further slashes are ignored. The string is also limited to 255 characters, as it is treated as a page title:
{{#titleparts: a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/aa/bb/cc/dd/ee | 1 | 25 }}y/z/aa/bb/cc/dd/ee
Warning Warning: You can use #titleparts as a small "string parser & converter", but consider that it returns the first substring capitalized. If lower case is needed, use lc: function to control output.
{{#titleparts: one/two/three/four|1|1 }}One
{{#titleparts: one/two/three/four|1|2 }}two
{{lc: {{#titleparts: one/two/three/four|1|1 }} }}one
General points
Substitution
Parser functions can be substituted by prefixing the hash character with subst::
{{subst:#ifexist: Help:Extension:ParserFunctions | [[Help:Extension:ParserFunctions]] | Help:Extension:ParserFunctions }} → the code [[Help:Extension:ParserFunctions]] will be inserted in the wikitext since the page Help:Extension:ParserFunctions exists.
Warning Warning: The results of substituted parser functions are undefined if the expressions contain unsubstituted volatile code such as variables or other parser functions. For consistent results, all the volatile code in the expression to be evaluated must be substituted. See Help:Substitution.
Tables
Parser functions will mangle wikitable syntax, treating all the raw pipe characters as parameter divisors. To avoid this, most wikis create the template Template:! with its contents only a raw pipe character (|). This 'hides' the pipe from the MediaWiki parser, ensuring that it is not considered until after all the templates and variables on a page have been expanded. Alternatively, raw HTML table syntax can be used, although this is less intuitive and more error-prone.
Stripping whitespace
Whitespace, including newlines, tabs, and spaces, is stripped from the beginning and end of all the parameters of these parser functions. If this is not desirable, adding any non-whitespace characters (including the HTML encoding for a whitespace character, invisible Unicode characters such as the zero-width space or direction marks, or sequences recognised and stripped by the MediaWiki parser such as <nowiki />) will prevent further stripping:
{{#ifeq: foo | foo | equal | not equal }}
equal
{{#ifeq:  foo   |   foo  | equal | not equal }}
equal
{{#ifeq: <nowiki />foo <nowiki /> | <nowiki /> foo<nowiki /> | equal | not equal }}
not equal
{{#ifeq: <nowiki />foo<nowiki /> | <nowiki />foo<nowiki /> | equal | not equal }}
not equal
{{#ifeq: foo | foo | equal | not equal }}
equal
See also
© 2022 International GeoGebra Institute
|
__label__pos
| 0.635231 |
Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
Let $X=\{0,1\}^\mathbb{Z}$ with measure $\mu=(p,1-p)^{\mathbb{Z}}$.
Let $(\phi(x))_i=(x_i+x_{i+1})$mod$2$.
If $p=1/2$, then $\phi(X)=X$. If $p \not = 1/2$, then $\phi(X)$ is not a Bernoulli scheme (i.i.d.).
For $x \in X$, define $x^*$ so that $x^*_i=(x_i+1)$mod$2$. Then $\phi(x)=\phi(x^*)$.
A factor map $\psi$ is finitary if for almost every $x \in X$ there exists integers $m \leq n$ such that the zero coordinates of $\psi(x)$ and $\psi(x')$ agree for almost all $x' \in X$ with $x[m,n]=x'[m,n]$.
In the case that $p \not = 1/2$, is it possible to construct a finitary map $\psi:(X, \mu) \to (X, \mu)$, such that for almost all $x \in X$, $\psi(x)=\psi(x^*)$?
Thank you.
share|improve this question
1
You didn't say this, but I presume you also want that $\psi$ should preserve the measure $\mu$? (Otherwise your previous map $\phi$ will do the job). – Anthony Quas Jan 25 '11 at 22:32
Yes, I'd like $\psi$ to preserve $\mu$. Thank you Anthony. – Stephen Shea Jan 25 '11 at 23:35
Question has been edited to clarify that $\psi$ should preserve $\mu$. – Stephen Shea Jan 30 '11 at 12:05
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question.
|
__label__pos
| 0.672944 |
What is 30 percent of 35 (30% of 35)
What is 30 percent of 35? Here is an easy method to solve percentage calculations such as what is 30% of 35.
You can solve this type of calculation with your own values by entering them into the calculator's fields, and click 'Calculate' to get the result and explanation.
What is% of
?
This is a simple method for solving percentage equations. Use this calculator for business, classroom assignments, when shopping, and in general daily life where percentage calculations are needed.
Want to learn the fastest method for calculating 30 percent of 35 (30% of 35)?
Assume the unknown value is 'Y'
100% / 35 = 30% / Y
100 / 35 = 30 / Y
Y ( 100 / 35 ) = 30
Y = 30 ( 35 / 100 )
Y = 10.5
Answer: 30 percent of 35 is 10.5
Have time and want to learn the details?
What are percentages
Percentages are similar to fractions with an important difference. In fractions the whole is represented by the denominator (e.g. the number 5 in the fraction of 1/5). In percentages, the whole is represented by the number 100. In fact, 'per cent' means 'per 100' or 'for each 100'.
How to solve
To solve the problem above, let's convert it into equation form: __ = 30% x 35
In this example, the number 35 represents the whole and so, as a percentage, it would be equal to 100%. Written as a ratio, we would get: 100% : 35
If a student took a 35 question test and they got every answer correct, as a percentage they would get a 100% score on the test.
In our problem we have to evaluate the 30 percent of 35. For now, let's call this unknown value 'Y'. Written as a ratio, we would get: 30% : Y
To see a relationship between these two ratios, let's combine them into an equation: 100% : 35 = 30% : Y
It is critical that both of the % values should be on the same side of a ratio. For instance, if you decide to put the % value on the right side of a ratio, then the other % value should also be on the right side of its ratio.
'35 : 100% and Y : 30%' is correct.
'35 : 100% and 30% : Y' is wrong.
Let's solve the equation for Y by first rewriting it as: 100% / 35 = 30% / Y
Drop the percentage marks to simplify your calculations: 100 / 35 = 30 / Y
Multiply both sides by Y to transfer it on the left side of the equation: Y ( 100 / 35 ) = 30
To isolate Y, multiply both sides by 35 / 100, we will have: Y = 30 ( 35 / 100 )
Computing the right side, we get: Y = 10.5
This leaves us with our final answer: 30% of 35 is 10.5
Similar calculation
|
__label__pos
| 0.991459 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I'm stuck on how to update row sums in a foreach template using knockoutJS
<div id="timeEntryList" data-bind="foreach: timeEntries">
<table >
<tr>
...
<td> //there are more of this, not included here
<input type="number"
data-bind="value: Days[6].Hours,
event: { change: $root.setDirty }" />
</td>
<td> //this part needs to be updated when the above input is changed
<span data-bind="text: $root.sumRow($data)">
</span>
</td>
The last TD there contains a span element which displays the sum of hours reported for the current item in the foreach. it displays correctly when the data is loaded, but then stays stale when I edit the elements. How can I make this element update as I change the values of the input boxes?
Here is my view model in a very slimmed down version:
var TimeReportModel = function (init) {
this.timeEntries = ko.observableArray(init.TimeEntries);
//... helper functions
};
TimeEntries are objects representing a reported hours per week. So it contains an array of days and each day has an hour property.
share|improve this question
add comment
1 Answer
Based on what you're binding to, it appears you're binding to the result of a regular function. If you want to see the values updated when there are changes, you need to bind to an observable. Make the sum a computed observable in your view model and bind to it.
I have no idea what your view model looks like or what you are adding up but it would look something like this:
// calculate the sum of the hours for each of the days
self.totalDays = ko.computed(function () {
var sum = 0;
ko.utils.arrayForEach(self.days(), function (day) {
sum += Number(day.hours());
});
return sum;
});
Here's a fiddle to demonstrate.
share|improve this answer
How would this work when all of it is inside an foreach template? there will be a sum for each row, that is, I can't have a single observable for this , there needs to be one for every rendered row – Roger Alsing Sep 3 '12 at 6:50
We'll you'll have to show me what your view model looks like and your data, I can't give you a straight answer until I know what I am dealing with. – Jeff Mercado Sep 3 '12 at 6:52
I've edited the original question to contain the view model – Roger Alsing Sep 3 '12 at 7:37
I'm sorry but what you've added is still not enough for me to understand what the big picture is. Did you look at the fiddle I created? You'll need another view model for each TimeEntry object you have and place this computed observable in that. – Jeff Mercado Sep 3 '12 at 16:14
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.534638 |
Home
Arctan hyperbolic
The hyperbolic tangent function can be represented using more general mathematical functions. As the ratio of the hyperbolic sine and cosine functions that are particular cases of the generalized hypergeometric, Bessel, Struve, and Mathieu functions, the hyperbolic tangent function can also be represented as ratios of those special functions trigonometric and hyperbolic functions. 1. The inverse trigonometric functions: arctan and arccot We begin by examining the solution to the equation z = tanw = sinw cosw = 1 i eiw − e−iw eiw +e−iw = 1 i e2iw − 1 e2iw +1 . We now solve for e2iw, iz = e2iw − 1 e2iw +1 =⇒ e2iw = 1+iz 1− iz Notation. The most common abbreviations are those specified by the ISO 80000-2 standard. They consist of ar-followed by the abbreviation of the corresponding hyperbolic function (e.g., arsinh, arcosh).. However, arc-followed by the corresponding hyperbolic function (e.g., arcsinh, arccosh) is also commonly seen, by analogy with the nomenclature for inverse trigonometric functions Hyperbolic Trig Identities is like trigonometric identities yet may contrast to it in specific terms. The fundamental hyperbolic functions are hyperbola sin and hyperbola cosine from which the other trigonometric functions are inferred. You can easily explore many other Trig Identities on this website
NumPy Hyperbolic Functions. There are functions for calculation of hyperbolic functions which are the analogs of the trigonometric functions. There are functions for the calculation of hyperbolic and inverse hyperbolic sine, cosine, and tangent. 1. np.sinh()-This function returns the hyperbolic sine of the array elements The hyperbolic functions take a real argument called a hyperbolic angle.The size of a hyperbolic angle is twice the area of its hyperbolic sector.The hyperbolic functions may be defined in terms of the legs of a right triangle covering this sector.. In complex analysis, the hyperbolic functions arise as the imaginary parts of sine and cosine Expands trigonometric and hyperbolic functions of sums of angles and of multiple angles occurring in expr. For best results, expr should be expanded. To enhance user control of simplification, this function expands only one level at a time, expanding sums of angles or multiple angles
Hyperbolic tangent: Introduction to the Hyperbolic Tangent
1. ArcTanh is the inverse hyperbolic tangent function. For a real number x, ArcTanh [x] represents the hyperbolic angle measure such that . ArcTanh automatically threads over lists. For certain special arguments, ArcTanh automatically evaluates to exact values
2. Before ReLUs come around the most common activation function for hidden units was the logistic sigmoid activation function f (z) = σ (z) = 1 1 + e − z or hyperbolic tangent function f(z) = tanh(z) = 2σ(2z) − 1.As we talked earlier, sigmoid function can be used as an output unit as a binary classifier to compute the probability of p(y = 1|x).A drawback on the sigmoidal units is that they.
3. Den inversa hyperboliska tangenten (area tangens hyperbolicus, oftast betecknad artanh, arctanh, atanh eller tanh-1) är en matematisk funktion, definierad som inversen till den hyperboliska tangenten.Dess värde ges av − = + −. För reella tal är funktionen definierad i intervallet (-1, 1), där den är monotont växand
Inverse hyperbolic functions - Wikipedi
i arctan z = arctanh iz. The branch cut for the inverse hyperbolic tangent function is in two pieces: one along the negative real axis to the left of -1 (inclusive), continuous with quadrant III, and one along the positive real axis to the right of 1 (inclusive), continuous with quadrant I This MATLAB function returns the Inverse Tangent (tan-1) of the elements of X in radians inverse hyperbolic functions ♦ 1—10 of 61 matching pages ♦ Search Advanced Help (0.009 seconds) 1—10 of 61 matching pages 1: 4.37 Inverse Hyperbolic Functions 4.23.40 gd (x) = 2 arctan. 17.3 Trigonometry. Octave provides the following trigonometric functions where angles are specified in radians. To convert from degrees to radians multiply by pi/180 (e.g., sin (30 * pi/180) returns the sine of 30 degrees). As an alternative, Octave provides a number of trigonometric functions which work directly on an argument specified in degrees hyperbolic trigonometric functions ♦ 1—10 of 120 matching pages ♦ 1—10 of 120 matching pages ♦ Search Advanced Hel
By applying the derivation formulas and using the usual derivation table, it is possible to calculate any function derivative. These are the calculation methods used by the calc to find the derivatives.. The derivative calculator allows steps by steps calculation of the derivative of a function with respect to a variable Summary : The function th allows to calculate online the hyperbolic tangent of a number. th online. Description : Hyperbolic tangent function. The calculator allows you to use most hyperbolic functions, it is possible to calculate the hyperbolic cosine (noted ch or cosh), the hyperbolic sine (noted sh or sinh), the hyperbolic tangent (noted th or tanh), and the hyperbolic cotangent (noted coth.
arctan (a1/a2) 2 . ATAN2: ATAN2 DATAN2 QATAN2 @ REAL DOUBLE REAL*16: REAL DOUBLE REAL*16 : Arctangent (degrees) See Note (7). arctan(a) 1 . ATAND @ ATAND @ DATAND @ QATAND @ REAL DOUBLE REAL*16: REAL DOUBLE REAL*16: arctan (a1/a2) 2 . ATAN2D@ ATAN2D @ DATAN2D @ QATAN2D @ REAL DOUBLE REAL*16: REAL DOUBLE REAL*16 : Hyperbolic Sine . See Note (7. Hyperbolic tangent has a property called approximates identity near the origin which (0)=0.5$ and $\sigma'(0)=0.25$). This feature (which also exists in many other activation functions such as identity, arctan, and sinusoid) lets the network learn efficiently even when its weights are initialized with small values. In other cases.
Hyperbolic Trig Identities - List of Hyperbolic
The inverse hyperbolic tangent of a value x is the value y for which the hyperbolic tangent of y is x. In other words if y = atanh(x) then x = tanh(y). atanh(0.5) 0.549306144334 The hyperbolic arc-tangent function is only defined in the open range (-1, +1). This corresponds to the output range of the hyperbolic tangent function Hyperbolic Tangent; Arctan; When building your Deep Learning model, activation functions are an important choice to make. In this article, we'll review the main activation functions, their implementations in Python, and advantages/disadvantages of each. Linear Activation. Linear activation is the simplest form of activation
ArcTanh[ z ] (3911 formulas) Visualizations (225 graphics, 1 animation) Plotting : Evaluatio Inverse Hyperbolic Tangent Functions Theorem 2.1. For integer n 1: Dn x arctan(x) = ( 1)n+1(n 1)! (1 + x2)n bn 1 X 2 c k=0 n 2k+ 1 ( 1)kxn 2k 1 (2.1) Proof. The following is a de nition of the arctan(x) function [1]: arctan(x) = i 2 ln(1 + ix 1 ix) = i 2 ln(i x i+ x) = i 2 [ln(i+ x) ln(i x)] (2.2) The derivatives of the ln(x) function are: Dn x.
We are asked to verify that: # arctan(sinh(x)) = arcsin(tanh(x)) # There are shorter ways to prove this result, but referring back to the hyperbolic definitions is a. Hyperbolic Tangent: Note: Fill in one box to get results in the other box by clicking Calculate button. Data should be separated by coma (,), space ( ), tab, or in separated lines
Hyperbolic function - WOW
NumPy Mathematical Functions - Trigonometric, Exponential
Hyperbolic Functions: Inverses. The hyperbolic sine function, \sinh x, is one-to-one, and therefore has a well-defined inverse, \sinh^{-1} x, shown in blue in the figure.In order to invert the hyperbolic cosine function, however, we need (as with square root) to restrict its domain As the trigonometric and hyperbolic functions are not invertible over the entire complex plane, or for many of them even over the real line, it is necessary to define a principal branch for each such inverse function. This is done by restricting the forward function to a principal domain on which it is invertible, and taking that domain as the range of the inverse function
Hyperbolic functions - Wikipedi
atan and tan^-1 are the same - atan stands for arctangent, which is the same as tan^-1. tanh is different, and is related to hyperbolic functions instead Details. The arc-tangent of two arguments atan2(y, x) returns the angle between the x-axis and the vector from the origin to (x, y), i.e., for positive arguments atan2(y, x) == atan(y/x).. Angles are in radians, not degrees, for the standard versions (i.e., a right angle is π/2), and in 'half-rotations' for cospi etc. . cospi(x), sinpi(x), and tanpi(x) are accurate for x values which are. Are you stuck on doing inverse trig functions? Do arcsin, arccos and arctan confuse you? In this video we show you quickly and easily how to do these types o..
Maxima Manual - Trigonometri
The 6 basic hyperbolic functions are defined by: Example 1: Evaluate the integral ∫ sech 2 (x)dx. Solution: We know that the derivative of tanh(x) is sech 2 (x), so the integral of sech 2 (x) is just: tanh(x)+c. Example 2: Calculate the integral . Solution : We make the substitution: u = 2 + 3sinh x, du = 3cosh x dx. Then cosh x dx = du/3. ARCSINH = Compute hyperbolic arcsine. ARCTAN = Compute arctangent. APPLICATIONS Trigonometry IMPLEMENTATION ----- for -1< <x 1. Trigonometric Library Functions ARCTANH DATAPLOT Reference Manual September 3, 1996 7-25 PROGRAM X1LABEL HYPERBOLIC TANGENT VALUE Y1LABEL INVERSE VALUES TITLE AUTOMATIC PLOT ARCTANH(X) FOR X = -.99 0.01 0.99-1 -0.5. List of Derivatives of Hyperbolic & Inverse Hyperbolic Functions; List of Integrals Containing cos; List of Integrals Containing sin; List of Integrals Containing cot; List of Integrals Containing tan; List of Integrals Containing sec; List of Integrals Containing csc; List of Integrals of Inverse Trig Functions; List of Integrals of Hyperbolic. In this video I go over the inverse hyperbolic tangent or tanh^-1(x) function and show how it can written as a logarithm which equals 1/2·tan((1+x)/(1-x)). D..
The calculator will find the inverse tangent of the given value in radians and degrees. The inverse tangent y=tan^(-1)(x) or y=atan(x) or y=arctan(x) is such As indicated in other answers, $\tan$ and $\tanh$ are related to the function $\exp$ whereas $\arctan$ and ${\rm artanh}$ are related to the function $\log$, whereby the transition from trigonometric functions to hyperbolic ones lives in the complex domain Hyperbolic functions were introduced in the 1760s by Vincenzo Riccati and Johann Heinrich Lambert. They represent an expansion of trigonometry beyond the circular functions. But they both depend on an argument. The common types are Sine, Cosine, Tangent , Secant, Cosecant
7
Inverse Hyperbolic Tangent: Note: Fill in one box to get results in the other box by clicking Calculate button. Data should be separated by coma (,), space ( ), tab, or in separated lines Hyperbolic Function. Get help with your Hyperbolic function homework. Access the answers to hundreds of Hyperbolic function questions that are explained in a way that's easy for you to understand
where the arctan function is the tan inverse mathematical function. In Python, we can get the phase of a Complex Number using the cmath module for complex numbers. We can also use the math.arctan function and get the phase from it's mathematical definition Free derivative calculator - differentiate functions with all the steps. Type in any function derivative to get the solution, steps and grap Inverse Tangent (arctan) calculator online. Calculate the value of Inverse Tangent (arctan) trigonometric function instantly using this tool arctan on calculator: how to find arctan: how to find tan inverse: how to calculate arctan: tan inverse table: formula of 2 tan inverse x: arctan equation: tan inverse calculator online: how to find inverse tangent: inverse tan calc: how to do arctan on calculator: how to find arctan without calculator: shift tan calculator: find tan inverse. INVERSE HYPERBOLIC FUNCTIONS. If x = sinh y, then y = sinh-1 a is called the inverse hyperbolic sine of x. Similarly we define the other inverse hyperbolic functions. The inverse hyperbolic functions are multiple-valued and as in the case of inverse trigonometric functions we restrict ourselves to principal values for which they can be considered as single-valued
List of LaTeX mathematical symbols - OeisWik
Free limit calculator - solve limits step-by-step. This website uses cookies to ensure you get the best experience The following indicator is a normalized oscillator making use of the arc tangent sigmoid function (ArcTan), this allows to squarify the output result, thus visually filtering out certain variations originally in the oscillator. The magnitude of this effect can be controlled by the user. The indicator contains a gradient that shows the possibility of a reversal, with red colors indicating.
Geneseo Math 222 01 Inverse Trig Functions
Arctan(x) Calculator Inverse tangent calculato
Description. arctan2 calculates arctan(y/x), and returns an angle in the correct quadrant.The returned angle will be in the range $-\pi$ to $\pi$ radians. The values of x and y must be between -2\^{}64 and 2\^{}64, moreover x should be different from zero. On Intel systems this function is implemented with the native intel fpatan instruction.. See als Note: ArcTan2(0, 0) returns 0. Functions CosH, SinH, TanH. Hyperbolic trig functions. The parameter is in degrees. An xy-graph of Sin(x) vs. Cos(x) plots a circle. Analoguously, an xy-graph of SinH(x) vs. CosH(x) plots a hyperbola (on the right side of the y-axis): . Although the parameter is specified in degrees, it does not denote an angle to the point on the hyperbola. «x» is referred to. Arctan Hyperbolic Sin. #Next Step Price comparisons for Arctan Hyperbolic Sin You can order Arctan Hyperbolic Sin after check, compare the values and check day for shipping. Some people are are interested Arctan Hyperbolic Sin with the cheap price. While the item could possibly be priced similarly at different shops inverse hyperbolic function[¦in‚vərs ‚hī·pər‚bäl·ik ′fəŋk·shən] (mathematics) An inverse function of a hyperbolic function; that is, an arc-hyperbolic sine, arc-hyperbolic cosine, arc-hyperbolic tangent, arc-hyperbolic cotangent, arc-hyperbolic secant, or arc-hyperbolic cosecant. Also known as antihyperbolic function; arc-hyperbolic. Hyperbolic Tangent(tanh)는 Sigmoid와 매우 유사합니다. 실제로, Hyperbolic Tangent 함수는 확장 된 시그모이드 함수입니다. tanh와 Sigmoid의 차이점은 Sigmoid의 출력 범위가 0에서 1 사이인 반면 tanh와 출력 범위는 -1에서 1사이라는 점입니다
An example illustrates the method of calculating inverse13Derivative of hyperbolic functions examples pdfDatei:Inverse Hyperbolic TangentVirtual Museum of CalculatorsThe x,y Minkowski diagram | HubPagesWaveform ArithmeticAstronomy Answers: Kepler's Equation
math.isclose (a, b, *, rel_tol=1e-09, abs_tol=0.0) ¶ Return True if the values a and b are close to each other and False otherwise.. Whether or not two values are considered close is determined according to given absolute and relative tolerances. rel_tol is the relative tolerance - it is the maximum allowed difference between a and b, relative to the larger absolute value of a or b arctan. Inverse tangent function. MuPAD® notebooks will be removed in a future release. Use MATLAB® live scripts instead. MATLAB live scripts support most MuPAD functionality, though there are some differences. For more information, see Convert MuPAD Notebooks to MATLAB Live Scripts Här kan du rita grafer som sedan enkelt kan infogas i forumet See Also-- arccos(-- calculates the inverse cosine of a numeric value.arccosh(-- calculates the inverse hyperbolic cosine of a numeric value.arcsin(-- calculates the inverse sine of a numeric value.arcsinh(-- calculates the inverse hyperbolic sine of a numeric value.arctanh(-- calculates the inverse hyperbolic tangent of a numeric value.cosh(-- calculates the hyperbolic cosine of a numeric value
• Lön butiksbiträde systembolaget.
• Bilder von nemo zum ausdrucken.
• B763 seat map.
• Pioneer avh z7000dab.
• Tobias sana instagram.
• Vector with transparent background.
• Hoop dreams full movie.
• Indoor aktivitäten berlin kinder.
• R4 rally turn.
• Ryska solrosfrön.
• Raw movie online.
• Karlaplan tunnelbana karta.
• Förkoka rödbetor hur länge.
• Ungdomskultur hiphop.
• Tirpitz cafe.
• Krita en femma instagram flashback.
• Rynkkräm bäst i test råd och rön.
• Anime haven attack on titan.
• Icabanken se min ekonomi.
• Sågverket hemsön.
• Guld ballonger siffror.
• Arlanda terminal 2 british airways.
• Medley tingsryd schema.
• Släppa ihop katter.
• Internet waybackmachine.
• Oligopol svenska.
• Matvärlden rinkeby.
• Iphone 8 force restart.
• Simpa bohuskusten.
• Jre website.
• Vaddtäcke nya.
• Lungröntgen infiltrat.
• Kalikå mönster.
• Sveti nikola 2017.
• Lenas it cafe san agustin.
• Bit ly konto.
• E 350 cdi cabrio 265 ps.
• Sågverket hemsön.
• Jägersbo camping.
• Wwe live stream free online.
• Glutenfri morotskaka i långpanna.
|
__label__pos
| 0.771495 |
0
\$\begingroup\$
I have a 3rd person camera which can rotate around the player.
When I look at the back of the player and press forward, player goes forward. Then I rotate 360 around the player and "forward direction" is tilted for 90 degrees. So every 360 turn there is 90 degrees of direction change.
For example when camera is facing the right side of the player, when I press button to move forward, I want player to turn to the left and make that the "new forward".
I have Player object with Camera as child object. Camera object has Camera script. Inside Camera script there are Player and Camera classes. Player object itself, has Input Controller.
Also I'm making this script for joystick/ controller primarily.
My camera script so far:
using UnityEngine;
using System.Collections;
public class CameraScript : MonoBehaviour
{
public GameObject Target;
public float RotateSpeed = 10,
FollowDistance = 20,
FollowHeight = 10;
float RotateSpeedPerTime,
DesiredRotationAngle,
DesiredHeight,
CurrentRotationAngle,
CurrentHeight,
Yaw,
Pitch;
Quaternion CurrentRotation;
void LateUpdate()
{
RotateSpeedPerTime = RotateSpeed * Time.deltaTime;
DesiredRotationAngle = Target.transform.eulerAngles.y;
DesiredHeight = Target.transform.position.y + FollowHeight;
CurrentRotationAngle = transform.eulerAngles.y;
CurrentHeight = transform.position.y;
CurrentRotationAngle = Mathf.LerpAngle(CurrentRotationAngle, DesiredRotationAngle, 0);
CurrentHeight = Mathf.Lerp(CurrentHeight, DesiredHeight, 0);
CurrentRotation = Quaternion.Euler(0, CurrentRotationAngle, 0);
transform.position = Target.transform.position;
transform.position -= CurrentRotation * Vector3.forward * FollowDistance;
transform.position = new Vector3(transform.position.x, CurrentHeight, transform.position.z);
Yaw = Input.GetAxis("Right Horizontal") * RotateSpeedPerTime;
Pitch = Input.GetAxis("Right Vertical") * RotateSpeedPerTime;
transform.Translate(new Vector3(Yaw, -Pitch, 0));
transform.position = new Vector3(transform.position.x, transform.position.y, transform.position.z);
transform.LookAt(Target.transform);
}
}
My player script:
using UnityEngine;
using System.Collections;
public class PlayerScript : MonoBehaviour
{
public float RotateSpeed = 10,
MoveSpeed = 10;
float DeltaTime;
public Transform cameraTransform;
void Update()
{
DeltaTime = Time.deltaTime;
transform.Rotate(0, Input.GetAxis("Right Horizontal") * RotateSpeed * DeltaTime, 0);
}
}
\$\endgroup\$
2
• \$\begingroup\$ No. I got a new problem. If I asked to resolve multiple problems in one question people would then tell me to make separate questions. You people are never satisfied. Also this is more specific. \$\endgroup\$ – Samurai Fox Aug 26 '14 at 18:25
• 1
\$\begingroup\$ sure looks like a dupe to me, especially considering there's no actual question being asked here, just a description of the same situation \$\endgroup\$ – jhocking Feb 23 '15 at 0:09
0
\$\begingroup\$
If the player is looking directly at the camera we can use the following idea to find the direction the player should walk, based on the position of the camera.
We have two vectors C: (camera.Transform.Forward) the direction the camera is looking at and P (player.Transform.Forward) the direction the player is looking at.
By computing the acos of the dot product of these two vectors we can compute the angle between these to vectors.
angle = acos(dot(C, P);
This angle can be used to rate the player so that it faces the camera (just rotate the player by -angle) and it can be used to transform controller inputs so that no matter where the camera and player is 'left' will always be left as seen from the camera.
This can be done by constructing the left, forward, right, and backward vectors like this.
// Assumes the forward vector normally is (0, 0, 1) or
// (cos(pi/2 + 0), 0, sin(pi/2 + 0))
vector3 forward = (cos(pi/2) + angle), 0, sin(pi /2 + angle);
If you wish the player to face the forward vector, or another vector you can again compute the acos of the dot product between that vector and the vector that points to where the player is currently facing. Just rotate the player by minus the result of that computation.
There might be small math errors in this answer (offsets wrong by half a pi, a minus that should or shouldn't be there) but I hope the general idea is now quite clear and that you can deduce the other direction vectors yourself.
\$\endgroup\$
6
• \$\begingroup\$ sorry...but I've got more than few errors. Will you be kind and tell me where to place this code of yours. \$\endgroup\$ – Samurai Fox Aug 26 '14 at 21:05
• \$\begingroup\$ You should implement this pseudo code wherever you want to turn the player towards the direction you're pressing on the controller, as seen from the camera. Note that this is pseudo code. Acos should be replaced by the Unity/C# equivalent which I believe is Math.Acos() etc... Try to understand the math behind this, if anything is unclear, please do ask. \$\endgroup\$ – Roy T. Aug 27 '14 at 7:32
• \$\begingroup\$ Hey. I found out that if I rotate camera, player rotates, which gave me idea. It wouldn't be the same thing as I asked help for, but it'll do. The script already did this but I just now realized that. Now how do I rotate them both simultaneously on purpose? Because those two are not rotated at the same speed neither the same side. \$\endgroup\$ – Samurai Fox Aug 27 '14 at 20:17
• \$\begingroup\$ No matter how big the distance to the player if the camera rotates x-degrees around the player and you rotate the player x-degrees as well they should be rotating at the same rotational speed (e.g. the player should always keep looking in the same relative direction as seen from the camera). \$\endgroup\$ – Roy T. Aug 28 '14 at 8:36
• \$\begingroup\$ 1. Something funny is happening. You see that RotateSpeed? It's both in Player and Camera class. Regardless where I change that speed, it changes in both classes. And it's not the same speed nor side. Even when I changed the name to like PlayerRotateSpeed and CameraRotateSpeed it still changed both speeds. Because of this I set Camera speed to 2.5 (not 10) and Player speed to 65. Now is yaw extremely slow affected by Camera speed and pitch is affected by both Camera and Player speed. As for the side of Player rotation I wrote in Player script -RotateSpeed which did the job -->character limit \$\endgroup\$ – Samurai Fox Aug 28 '14 at 8:50
-1
\$\begingroup\$
I shall rephrase, the direction the player is facing is the forward direction, Therefor the camera should face forward (i.e the direction the player is facing), so the camera should be aimed at the player location always (unless you choose it to follow a different object like a vehicle) so there fore the camera facing point is player.location (This isn't code just variables for vectors)
Camera.facing =player.facing; /*this makes the camera face the way the player is facing...therefor camera will always face forward,( i.e the direction the player is facing...)rotating the player 360 degrees should place the camera back where it started (behind the player facing the way the player is facing) rotating it 180 degrees should place the camera still behind the player but but moved on the yaw to face the same way the player is now facing,the idea is not to make a whole new purpose of a "new forward" variable but use a variable that's already there....*/
Camera.facing=player.location; //*his makes the camera face the location of your player which means the camera might not be facing where the player is facing but more at where he is, this method will allow you too see the front of the player if he is facing the camera, and the back if he is not,or his sides if he is moving that way (this method sounds like the one you need ;) ) */
Camera.location=player.location.z-4&&player.location.y+2; /*this simply places the camera behind the player at all times (you can change this if you want...)
It also sounds like you don't understand this "player.location.x" (this is a vector player.location.x refers to the x piece of the vector where as player.location.y refers to the y piece of the vector and player.location.z refers to the z piece of the vector.... Understanding that should allow you to properly place the camera and view angle correctly, but I do want you to know that rotating 360 degrees should place the camera in the exact place it was... Feel free to ask more questions to me if you don't understand :) Hope this Helps :) Good Luck :)
\$\endgroup\$
7
• \$\begingroup\$ I'm not good in c# so I don't know how would I implement that "+90 degrees". Could you be kind and add a sample or code for it? Thanks \$\endgroup\$ – Samurai Fox Aug 26 '14 at 14:23
• \$\begingroup\$ Well the idea is to make the camera move 90 degrees in that direction, but I don't see your camera location values... Do you have a camera class that you can show? \$\endgroup\$ – Frank Lastname Aug 26 '14 at 17:07
• \$\begingroup\$ That is camera class. But I also have Player class. I'll edit my question with that code. \$\endgroup\$ – Samurai Fox Aug 26 '14 at 18:28
• \$\begingroup\$ I don't think this answer makes much sense. In your example code you do not make any computation to find the relative direction between the camera and the player. \$\endgroup\$ – Roy T. Aug 26 '14 at 20:38
• \$\begingroup\$ Relative Direction? The camera facing point is the location of the player \$\endgroup\$ – Frank Lastname Aug 26 '14 at 20:51
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.663447 |
5
$\begingroup$
I have a question about semigroups of one-dimensional diffusions.
Let $X$ be the Ornstein Uhlenbeck process on $\mathbb{R}$. The generator is expresses as $$\frac{d^2}{dx^2}-x\frac{d}{dx}.$$ It is known that the $L^2$ semigroup $\{T_t\}$ of $X$ is a compact operator on $L^{2}(\mathbb{R},m)$, where $m$ is the speed measure of $X$. $\{T_t\}$ is extended to strongly continuous contraction semigroup on $L^{p}(\mathbb{R},m)$, $1\le p<\infty$. Moreover, $\{T_t\}$ becomes a compact operator on $L^{p}(\mathbb{R},m)$ for any $1<p<\infty$. $\{T_t\}$ is not a compact operator on $L^{1}(\mathbb{R},m)$.
My question
• Is there are nontrivial diffusion on $\mathbb{R}$ whose semigroup is compact on $L^{p}(\mathbb{R})$ for any $1 \le p \le \infty$? Consider the following differential operator: \begin{equation*} \frac{d^2}{dx^2}-x^{3}\frac{d}{dx}. \end{equation*} and the diffusion $Y$ associated with the above operator. The semigroups associated with $Y$ is compact on $L^{p}(\mathbb{R},m)$ for any $1 \le p \le \infty$? Here, $m$ is the speed measure of $Y$.
Dirichlet form of $Y$
The Dirichlet form of $Y$ is expresses as follows: \begin{align*} \mathcal{E}(f,g)&=\int_{\mathbb{R}}f'g'd\mu,\quad f,\ g \in \mathcal{F}\\ \mathcal{F}&=\{f \in L^{2}(\mathbb{R},\mu): f' \in L^{2}(\mathbb{R}.\mu)\}, \end{align*} where $d\mu=\exp(-x^4/2)\,dx$ and $dx$ is the Lebesgue measure on $\mathbb{R}$, and $f'$ is the distributional derivative of $f$.
$\endgroup$
• $\begingroup$ What is $m$ for this $Y$ ? And are you sure you mean $\frac{d^2}{dx^2}-x^2\frac{d}{dx}$ rather than $\frac{d^2}{dx^2}-|x|x\frac{d}{dx}$ ? $\endgroup$ – Jean Duchon Apr 30 '18 at 14:17
• $\begingroup$ Thank you for your comment. $m$ is the speed measure for $Y$. Also, I changed the definition of generator. $\endgroup$ – sharpe Apr 30 '18 at 18:14
• 1
$\begingroup$ Concerning your original question "Is there are nontrivial diffusion on ℝ whose semigroup is compact on $L^p(\mathbb R)$ for any $p$?": if you switch to quadratic forms and allow for weighed spaces, then the semigroup on $L^2$ is compact if and only if the form domain is compactly embedded in $L^2$. This will be most likely be related to the weights. $\endgroup$ – Delio Mugnolo Apr 30 '18 at 23:26
• $\begingroup$ Please tell me related papers. $\endgroup$ – sharpe May 1 '18 at 2:27
• $\begingroup$ Do you want $\frac{d^2}{dx^2}+x^3\frac{d}{dx}$? $\endgroup$ – Michael Renardy May 3 '18 at 14:41
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Browse other questions tagged or ask your own question.
|
__label__pos
| 0.997929 |
Does ‘Zswap’ Really Improve Responsiveness ? (Ubuntu 13.10)
Because it is directly associated with the overall responsiveness, any operating system prefers to keep the users’ most frequently used data (programs, files etc) in RAM because data on RAM can be accessed extremely fast when compared to other storage mediums (disk drives, flash drives …).
That said however, since RAM is not cheap, its capacity is limited on most occasions and thus, when dealing with memory hungry programs (and while trying to find ‘room’ for opening new applications), the OS is going to have to move some of the currently unused data into another storage medium (temporarily), which is usually the disk drive.
This (special) location on a disk where data from RAM is moved into (it could be a file or a separate partition), is called ‘Swap Space’, in GNU/Linux. The process of moving data from RAM to a ‘Swap Space’ or moving data into RAM from a ‘Swap Space’, is called ‘page swapping’. Again, the OS only does this if it has no other choice because when compared to RAM, ‘Swap Space’ is very slow and thus loading programs or opening files can take a long time, which if not intelligent managed, can affect the OS’s responsiveness in a very negative manner.
'Zswap' summary (Gedit document)
As a result, OS developers have come up with few ways (mainly 2, that I am aware of) of decreasing the ‘page swapping’. One suggestion is to intelligently manage the data on RAM. The other method is to compress data that is about to be sent off to a ‘Swap Space’, within the RAM itself, with high compression ratios, so that RAM at the end can hold more data, hence reducing the need to move data into a horribly slow ‘Swap Space’.
‘Zswap’ in that sense, is a tool that was introduced with the 3.11 Kernel that compresses data which is about to be sent off to a ‘Swap Space’. ‘Zswap’ however is disabled by default, and if you are running under limited RAM capacity, then you can safely enable it in Ubuntu 13.10 (or any distribution that has 3.11 or newer Kernel installed) to see if it improves the overall system responsiveness. For enabling it, please follow the below procedure.
Step 1:
Open your Terminal window and enter the below command.
sudo gedit /etc/default/grub
Step 2:
This will open up the GRUB configuration file. Then as shown in the below screenshot, locate the ‘GRUB_CMDLINE_LINUX_DEFAULT‘ line and put the below code between the quotation marks (make sure to add a ‘space’ after the existing quiet splash argument).
Enabling 'Zswa' using GRUB configuration file - Ubuntu 13.10
zswap.enabled=1
Step 3:
Then save your changes and enter the below command to update ‘GRUB’ entries.
sudo update-grub
Once that command finishes running, reboot the computer and when the next time the desktop loads ‘Zswap’ should be running.
Does it really work ?
Well, since it is unwise to take someone’s opinion just for the sake of it ;-), I decided to come up with a very simple test for measuring the performance of ‘Zswap’. Below is a brief info about my hardware.
Intel Core i3-2330M CPU, Intel HD 3000 GPU, 4GB RAM (DDR3), Toshiba 7200 RPM (320GB) SATA HDD, Intel N-1030 Wireless adapter, Realtek network adapter ('RTL8168'), LED display with 1366x768 resolution (60Hz/60FPS). It's a Dell Vostro V-131 notebook.
*. I first performed a clean installation of Ubuntu 13.10 and then I made sure that only 1GB of my 4GB RAM is available to Ubuntu 13.10 (you can easily do that by passing an argument using GRUB configuration file). Then I created a 1GB of ‘Swap Space’ (a ‘swap file’, not a partition) as well.
*. Later I added ‘GIMP’ image editor, VLC (they were both manually installed) to the ‘application launcher’. Then I rebooted the computer and once the desktop was loaded fully, I let it idle for about 30 seconds, then opened: ‘Gnome-Terminal’, Firefox, LibreOffice Writer/Calc/Impress, VLC, GIMP and Ubuntu Software Center.
*. When they were fully loaded I measured the ‘Swap Space’ usage through Gnome-System-Monitor utility. Then I closed all of them, and re-opened some of the applications (listed in the below graphs), each by its previous order of execution (gnome-terminal, Firefox …) and took a note of their individual loading times. Then I rebooted the computer and carried out the same test again and again for 3 times for getting average results.
After that was done, I enabled ‘Zswap’ and ran the same tests (3 times) all over again.
Why did you re-opened the apps and measured their loading times ?
Because if ‘Zswap’ actually works, then application loading times with it enabled should be shorter (compared to the application loading times with it disabled) as more application data can (and should) now be kept in RAM (which again improves their loading times since it minimizes the data exchange with the ‘Swap Space’ which is terribly slow). And the only way to know that for sure it to measure them :).
In any case, by using the gathered data, I came up with the below graphs for comparing.
'Swap Space' usage readings with and without 'Zswap'
As you can see, after enabling ‘Zswap’ the ‘Swap Space’ usage has actually increased by about 75.2 MiB (72%) which is the opposite of what it promises of being able to achieve.
Below are two graph of the (re) loading times of some of the individual applications.
Application re-loading times (graph), before and after using 'Zswap'
Below is the second graph.
Re-loading times of applications (with & without 'Zswap') - Graph 2
As you can see, except for LibreOffice Writer and despite the increased ‘Swap Space’ usage, ‘Zswap’ has been able to reduce the application loading times, though it is nowhere near being exceptional or useful, for that matter. I also noticed that the overall system responsiveness actually got worsened after enabling ‘Zswap’! (while opening all the applications for the first time).
As an example, ‘Compiz’ (window manager of ‘Unity’ desktop shell) dims-out application windows that are not responding, and when you open a lot of memory hungry apps, ‘Compiz’ sometimes dims them out for few seconds, even though in reality they are not actually stuck. This happened on both occasions, but it got worsened after enabling ‘Zswap’. Also, the whole PC got stuck (not being able to move the mouse …) for few seconds in all 3 tests after enabling ‘Zswap’ and it did not occur in such magnitudes while running tests without it being enabled.
So from the perspective of this simple test, ‘Zswap’ has failed because the responsiveness was not improved, though the re-loading of applications were improved slightly. However, a simple test as this one is not enough for making claims such as that says ‘Zswap’ is going to fail on your computer too, as one has to take many things into account before making such claims, but I tried hard for not being careless, thus I stand firmly behind the results.
In any case, I humbly advice anyone to actually enable ‘Zswap’ if you are running a computer with limited RAM availability to see whether it improves things or not. And if it makes things worse, you can always disable it with ease. You can read more detailed articles (with benchmark results) from here and here.
If you think the test is not that accurate in terms of trying to measure ‘Zswap’, then you are more than welcome to send suggestions, and correct me where I am wrong.
4 thoughts on “Does ‘Zswap’ Really Improve Responsiveness ? (Ubuntu 13.10)
1. salvadhor
Great work – how did you find zswap compared to zram? It would be nice to measure these two methods of compressed swap. As you already have shown – theory is theory, practic on the desktop is the other truth.
2. Angel G
IMHO the application re-loading is not a real-world scenario for the low-memory systems. I think it should be tested on a 1GB RAM system, where someone tries to work with several applications together. For example firefox with “Don’t load tabs until selected” turned OFF – to load all tabs plus editing a big file with open office and drawing something in gimp. The memory usage should be over the RAM installed so the swap to get used. For example ~ 2GB memory usage with 1GB RAM installed. Then the responsiveness of the system should be evaluated. When you switch from app to app, you’ll notice that it’s slow with heavy I/O. …
1. Gayan Post author
Interesting idea, & I do agree with you that the test I ran might not exactly represent a common scenario, on a low memory system. But, what about a system that has, say 512MiB of RAM capacity, would it not be reasonable to assume that a user might still try to run 3 or 4 somewhat memory hungry programs, on it ?
In any case, I strongly believe that the test I ran should still be able give some idea about Zswap’s performance because it was able to increase the RAM usage up to a point thus forcing the OS to use the ‘Swap space’ (even if it was not by that much). Sure one will notice that it is slow when switching from app to app (under heavy I/O), but again, remember, I am considering the ‘felt responsiveness’, when compared (before & after using ‘Zswap’).
Leave a Reply
Your email address will not be published. Required fields are marked *
You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>
|
__label__pos
| 0.596048 |
1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Help interpreting HW question on Lipschitz Hölder
1. Sep 9, 2012 #1
1. The problem statement, all variables and given/known data
I only need help interpreting the following:
Show that every Lipschitz continuous function is α-Hölder continuous for
every α ∈ (0, 1
The definition of both is given in the homework so this seems trivial but it's a graduate level class. Am I mising something? Thanks for any help!
2. Relevant equations
3. The attempt at a solution
1. The problem statement, all variables and given/known data
2. Relevant equations
3. The attempt at a solution
2. jcsd
3. Sep 9, 2012 #2
HallsofIvy
User Avatar
Staff Emeritus
Science Advisor
Well, what are those definitions? Why do you say this is "trivial"?
4. Sep 9, 2012 #3
Well by the definitions, Lipschitz is a special case of α-Hölder when α=1. Since α is contained in the interval (0,1] (which is the interval given for α-Hölder) then by def. every Lipschitz continuous function is α-Hölder continuous.
5. Sep 9, 2012 #4
Your question asked to show that it is α-Hölder continuous for every α ∈ (0, 1], not just for α=1. Unless this was a typo? Yes, Lipschitz implies Hölder of order 1. But does it imply this for all orders less than 1?
6. Sep 9, 2012 #5
Ahhh, great! yes your right I see it now. Funny how sometimes one can not see what is right in front of them. Thanks for the help, that's exactly what I needed.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Similar Discussions: Help interpreting HW question on Lipschitz Hölder
Loading...
|
__label__pos
| 0.993764 |
/* * Copyright (c) 2006 Michael Niedermayer * * FFmpeg is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * FFmpeg is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License along * with FFmpeg; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ /** * @file * Motion Compensation Deinterlacer * Ported from MPlayer libmpcodecs/vf_mcdeint.c. * * Known Issues: * * The motion estimation is somewhat at the mercy of the input, if the * input frames are created purely based on spatial interpolation then * for example a thin black line or another random and not * interpolateable pattern will cause problems. * Note: completely ignoring the "unavailable" lines during motion * estimation did not look any better, so the most obvious solution * would be to improve tfields or penalize problematic motion vectors. * * If non iterative ME is used then snow currently ignores the OBMC * window and as a result sometimes creates artifacts. * * Only past frames are used, we should ideally use future frames too, * something like filtering the whole movie in forward and then * backward direction seems like a interesting idea but the current * filter framework is FAR from supporting such things. * * Combining the motion compensated image with the input image also is * not as trivial as it seems, simple blindly taking even lines from * one and odd ones from the other does not work at all as ME/MC * sometimes has nothing in the previous frames which matches the * current. The current algorithm has been found by trial and error * and almost certainly can be improved... */ #include "libavutil/opt.h" #include "libavutil/pixdesc.h" #include "libavcodec/avcodec.h" #include "avfilter.h" #include "formats.h" #include "internal.h" enum MCDeintMode { MODE_FAST = 0, MODE_MEDIUM, MODE_SLOW, MODE_EXTRA_SLOW, MODE_NB, }; enum MCDeintParity { PARITY_TFF = 0, ///< top field first PARITY_BFF = 1, ///< bottom field first }; typedef struct { const AVClass *class; enum MCDeintMode mode; enum MCDeintParity parity; int qp; AVCodecContext *enc_ctx; } MCDeintContext; #define OFFSET(x) offsetof(MCDeintContext, x) #define FLAGS AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_FILTERING_PARAM #define CONST(name, help, val, unit) { name, help, 0, AV_OPT_TYPE_CONST, {.i64=val}, INT_MIN, INT_MAX, FLAGS, unit } static const AVOption mcdeint_options[] = { { "mode", "set mode", OFFSET(mode), AV_OPT_TYPE_INT, {.i64=MODE_FAST}, 0, MODE_NB-1, FLAGS, .unit="mode" }, CONST("fast", NULL, MODE_FAST, "mode"), CONST("medium", NULL, MODE_MEDIUM, "mode"), CONST("slow", NULL, MODE_SLOW, "mode"), CONST("extra_slow", NULL, MODE_EXTRA_SLOW, "mode"), { "parity", "set the assumed picture field parity", OFFSET(parity), AV_OPT_TYPE_INT, {.i64=PARITY_BFF}, -1, 1, FLAGS, "parity" }, CONST("tff", "assume top field first", PARITY_TFF, "parity"), CONST("bff", "assume bottom field first", PARITY_BFF, "parity"), { "qp", "set qp", OFFSET(qp), AV_OPT_TYPE_INT, {.i64=1}, INT_MIN, INT_MAX, FLAGS }, { NULL } }; AVFILTER_DEFINE_CLASS(mcdeint); static int config_props(AVFilterLink *inlink) { AVFilterContext *ctx = inlink->dst; MCDeintContext *mcdeint = ctx->priv; AVCodec *enc; AVCodecContext *enc_ctx; AVDictionary *opts = NULL; int ret; if (!(enc = avcodec_find_encoder(AV_CODEC_ID_SNOW))) { av_log(ctx, AV_LOG_ERROR, "Snow encoder is not enabled in libavcodec\n"); return AVERROR(EINVAL); } mcdeint->enc_ctx = avcodec_alloc_context3(enc); if (!mcdeint->enc_ctx) return AVERROR(ENOMEM); enc_ctx = mcdeint->enc_ctx; enc_ctx->width = inlink->w; enc_ctx->height = inlink->h; enc_ctx->time_base = (AVRational){1,25}; // meaningless enc_ctx->gop_size = 300; enc_ctx->max_b_frames = 0; enc_ctx->pix_fmt = AV_PIX_FMT_YUV420P; enc_ctx->flags = CODEC_FLAG_QSCALE | CODEC_FLAG_LOW_DELAY; enc_ctx->strict_std_compliance = FF_COMPLIANCE_EXPERIMENTAL; enc_ctx->global_quality = 1; enc_ctx->me_cmp = enc_ctx->me_sub_cmp = FF_CMP_SAD; enc_ctx->mb_cmp = FF_CMP_SSE; av_dict_set(&opts, "memc_only", "1", 0); switch (mcdeint->mode) { case MODE_EXTRA_SLOW: enc_ctx->refs = 3; case MODE_SLOW: enc_ctx->me_method = ME_ITER; case MODE_MEDIUM: enc_ctx->flags |= CODEC_FLAG_4MV; enc_ctx->dia_size = 2; case MODE_FAST: enc_ctx->flags |= CODEC_FLAG_QPEL; } ret = avcodec_open2(enc_ctx, enc, &opts); av_dict_free(&opts); if (ret < 0) return ret; return 0; } static av_cold void uninit(AVFilterContext *ctx) { MCDeintContext *mcdeint = ctx->priv; if (mcdeint->enc_ctx) { avcodec_close(mcdeint->enc_ctx); av_freep(&mcdeint->enc_ctx); } } static int query_formats(AVFilterContext *ctx) { static const enum PixelFormat pix_fmts[] = { AV_PIX_FMT_YUV420P, AV_PIX_FMT_NONE }; ff_set_common_formats(ctx, ff_make_format_list(pix_fmts)); return 0; } static int filter_frame(AVFilterLink *inlink, AVFrame *inpic) { MCDeintContext *mcdeint = inlink->dst->priv; AVFilterLink *outlink = inlink->dst->outputs[0]; AVFrame *outpic, *frame_dec; AVPacket pkt; int x, y, i, ret, got_frame = 0; outpic = ff_get_video_buffer(outlink, outlink->w, outlink->h); if (!outpic) { av_frame_free(&inpic); return AVERROR(ENOMEM); } av_frame_copy_props(outpic, inpic); inpic->quality = mcdeint->qp * FF_QP2LAMBDA; av_init_packet(&pkt); pkt.data = NULL; // packet data will be allocated by the encoder pkt.size = 0; ret = avcodec_encode_video2(mcdeint->enc_ctx, &pkt, inpic, &got_frame); if (ret < 0) goto end; frame_dec = mcdeint->enc_ctx->coded_frame; for (i = 0; i < 3; i++) { int is_chroma = !!i; int w = FF_CEIL_RSHIFT(inlink->w, is_chroma); int h = FF_CEIL_RSHIFT(inlink->h, is_chroma); int fils = frame_dec->linesize[i]; int srcs = inpic ->linesize[i]; int dsts = outpic ->linesize[i]; for (y = 0; y < h; y++) { if ((y ^ mcdeint->parity) & 1) { for (x = 0; x < w; x++) { uint8_t *filp = &frame_dec->data[i][x + y*fils]; uint8_t *srcp = &inpic ->data[i][x + y*srcs]; uint8_t *dstp = &outpic ->data[i][x + y*dsts]; if (y > 0 && y < h-1){ int is_edge = x < 3 || x > w-4; int diff0 = filp[-fils] - srcp[-srcs]; int diff1 = filp[+fils] - srcp[+srcs]; int temp = filp[0]; #define DELTA(j) av_clip(j, -x, w-1-x) #define GET_SCORE_EDGE(j)\ FFABS(srcp[-srcs+DELTA(-1+(j))] - srcp[+srcs+DELTA(-1-(j))])+\ FFABS(srcp[-srcs+DELTA(j) ] - srcp[+srcs+DELTA( -(j))])+\ FFABS(srcp[-srcs+DELTA(1+(j)) ] - srcp[+srcs+DELTA( 1-(j))]) #define GET_SCORE(j)\ FFABS(srcp[-srcs-1+(j)] - srcp[+srcs-1-(j)])+\ FFABS(srcp[-srcs +(j)] - srcp[+srcs -(j)])+\ FFABS(srcp[-srcs+1+(j)] - srcp[+srcs+1-(j)]) #define CHECK_EDGE(j)\ { int score = GET_SCORE_EDGE(j);\ if (score < spatial_score){\ spatial_score = score;\ diff0 = filp[-fils+DELTA(j)] - srcp[-srcs+DELTA(j)];\ diff1 = filp[+fils+DELTA(-(j))] - srcp[+srcs+DELTA(-(j))];\ #define CHECK(j)\ { int score = GET_SCORE(j);\ if (score < spatial_score){\ spatial_score= score;\ diff0 = filp[-fils+(j)] - srcp[-srcs+(j)];\ diff1 = filp[+fils-(j)] - srcp[+srcs-(j)];\ if (is_edge) { int spatial_score = GET_SCORE_EDGE(0) - 1; CHECK_EDGE(-1) CHECK_EDGE(-2) }} }} CHECK_EDGE( 1) CHECK_EDGE( 2) }} }} } else { int spatial_score = GET_SCORE(0) - 1; CHECK(-1) CHECK(-2) }} }} CHECK( 1) CHECK( 2) }} }} } if (diff0 + diff1 > 0) temp -= (diff0 + diff1 - FFABS(FFABS(diff0) - FFABS(diff1)) / 2) / 2; else temp -= (diff0 + diff1 + FFABS(FFABS(diff0) - FFABS(diff1)) / 2) / 2; *filp = *dstp = temp > 255U ? ~(temp>>31) : temp; } else { *dstp = *filp; } } } } for (y = 0; y < h; y++) { if (!((y ^ mcdeint->parity) & 1)) { for (x = 0; x < w; x++) { frame_dec->data[i][x + y*fils] = outpic ->data[i][x + y*dsts] = inpic->data[i][x + y*srcs]; } } } } mcdeint->parity ^= 1; end: av_free_packet(&pkt); av_frame_free(&inpic); if (ret < 0) { av_frame_free(&outpic); return ret; } return ff_filter_frame(outlink, outpic); } static const AVFilterPad mcdeint_inputs[] = { { .name = "default", .type = AVMEDIA_TYPE_VIDEO, .filter_frame = filter_frame, .config_props = config_props, }, { NULL } }; static const AVFilterPad mcdeint_outputs[] = { { .name = "default", .type = AVMEDIA_TYPE_VIDEO, }, { NULL } }; AVFilter avfilter_vf_mcdeint = { .name = "mcdeint", .description = NULL_IF_CONFIG_SMALL("Apply motion compensating deinterlacing."), .priv_size = sizeof(MCDeintContext), .uninit = uninit, .query_formats = query_formats, .inputs = mcdeint_inputs, .outputs = mcdeint_outputs, .priv_class = &mcdeint_class, };
|
__label__pos
| 0.998559 |
Corona Renderer for Cinema 4D > [C4D] Feature Requests
C4D Layer Shader in Bump channel
<< < (2/3) > >>
aler:
So how's it going? What is the Internal ID of this problem? Or is it not registered yet?
Beanzvision:
--- Quote from: aler on 2021-03-05, 12:33:44 ---So how's it going? What is the Internal ID of this problem? Or is it not registered yet?
--- End quote ---
It's already been registered ;) (Internal ID=416062410)
Dean81:
Is there any news on this being rectified? It causes problems in nearly every project I work on...
Beanzvision:
You can also mix bump's using our Mixture shader ;)
Dean81:
Thanks Beanzvision.
This is a workaround but it doesn't give you anywhere near the amount of control that the Layer Shader does.
Are there plans to make use of the Layer Shader possible?
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version
|
__label__pos
| 0.992831 |
GCC Code Coverage Report
Directory: . Exec Total Coverage
File: src/expr/term_conversion_proof_generator.cpp Lines: 249 296 84.1 %
Date: 2021-03-22 Branches: 520 1457 35.7 %
Line Exec Source
1
/********************* */
2
/*! \file term_conversion_proof_generator.cpp
3
** \verbatim
4
** Top contributors (to current version):
5
** Andrew Reynolds
6
** This file is part of the CVC4 project.
7
** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8
** in the top-level source directory and their institutional affiliations.
9
** All rights reserved. See the file COPYING in the top-level source
10
** directory for licensing information.\endverbatim
11
**
12
** \brief Implementation of term conversion proof generator utility
13
**/
14
15
#include "expr/term_conversion_proof_generator.h"
16
17
#include "expr/proof_checker.h"
18
#include "expr/proof_node.h"
19
#include "expr/term_context.h"
20
#include "expr/term_context_stack.h"
21
22
using namespace CVC4::kind;
23
24
namespace CVC4 {
25
26
79395
std::ostream& operator<<(std::ostream& out, TConvPolicy tcpol)
27
{
28
79395
switch (tcpol)
29
{
30
67262
case TConvPolicy::FIXPOINT: out << "FIXPOINT"; break;
31
12133
case TConvPolicy::ONCE: out << "ONCE"; break;
32
default: out << "TConvPolicy:unknown"; break;
33
}
34
79395
return out;
35
}
36
37
79395
std::ostream& operator<<(std::ostream& out, TConvCachePolicy tcpol)
38
{
39
79395
switch (tcpol)
40
{
41
52262
case TConvCachePolicy::STATIC: out << "STATIC"; break;
42
case TConvCachePolicy::DYNAMIC: out << "DYNAMIC"; break;
43
27133
case TConvCachePolicy::NEVER: out << "NEVER"; break;
44
default: out << "TConvCachePolicy:unknown"; break;
45
}
46
79395
return out;
47
}
48
49
16935
TConvProofGenerator::TConvProofGenerator(ProofNodeManager* pnm,
50
context::Context* c,
51
TConvPolicy pol,
52
TConvCachePolicy cpol,
53
std::string name,
54
TermContext* tccb,
55
16935
bool rewriteOps)
56
33870
: d_proof(pnm, nullptr, c, name + "::LazyCDProof"),
57
d_preRewriteMap(c ? c : &d_context),
58
d_postRewriteMap(c ? c : &d_context),
59
d_policy(pol),
60
d_cpolicy(cpol),
61
d_name(name),
62
d_tcontext(tccb),
63
50805
d_rewriteOps(rewriteOps)
64
{
65
16935
}
66
67
22723
TConvProofGenerator::~TConvProofGenerator() {}
68
69
673668
void TConvProofGenerator::addRewriteStep(Node t,
70
Node s,
71
ProofGenerator* pg,
72
bool isPre,
73
PfRule trustId,
74
bool isClosed,
75
uint32_t tctx)
76
{
77
1347336
Node eq = registerRewriteStep(t, s, tctx, isPre);
78
673668
if (!eq.isNull())
79
{
80
673637
d_proof.addLazyStep(eq, pg, trustId, isClosed);
81
}
82
673668
}
83
84
void TConvProofGenerator::addRewriteStep(
85
Node t, Node s, ProofStep ps, bool isPre, uint32_t tctx)
86
{
87
Node eq = registerRewriteStep(t, s, tctx, isPre);
88
if (!eq.isNull())
89
{
90
d_proof.addStep(eq, ps);
91
}
92
}
93
94
204619
void TConvProofGenerator::addRewriteStep(Node t,
95
Node s,
96
PfRule id,
97
const std::vector<Node>& children,
98
const std::vector<Node>& args,
99
bool isPre,
100
uint32_t tctx)
101
{
102
409238
Node eq = registerRewriteStep(t, s, tctx, isPre);
103
204619
if (!eq.isNull())
104
{
105
132671
d_proof.addStep(eq, id, children, args);
106
}
107
204619
}
108
109
bool TConvProofGenerator::hasRewriteStep(Node t,
110
uint32_t tctx,
111
bool isPre) const
112
{
113
return !getRewriteStep(t, tctx, isPre).isNull();
114
}
115
116
Node TConvProofGenerator::getRewriteStep(Node t,
117
uint32_t tctx,
118
bool isPre) const
119
{
120
Node thash = t;
121
if (d_tcontext != nullptr)
122
{
123
thash = TCtxNode::computeNodeHash(t, tctx);
124
}
125
return getRewriteStepInternal(thash, isPre);
126
}
127
128
878287
Node TConvProofGenerator::registerRewriteStep(Node t,
129
Node s,
130
uint32_t tctx,
131
bool isPre)
132
{
133
878287
if (t == s)
134
{
135
return Node::null();
136
}
137
1756574
Node thash = t;
138
878287
if (d_tcontext != nullptr)
139
{
140
20324
thash = TCtxNode::computeNodeHash(t, tctx);
141
}
142
else
143
{
144
// don't use term context ids if not using term context
145
857963
Assert(tctx == 0);
146
}
147
// should not rewrite term to two different things
148
878287
if (!getRewriteStepInternal(thash, isPre).isNull())
149
{
150
143958
Assert(getRewriteStepInternal(thash, isPre) == s)
151
71979
<< identify() << " rewriting " << t << " to both " << s << " and "
152
71979
<< getRewriteStepInternal(thash, isPre);
153
71979
return Node::null();
154
}
155
806308
NodeNodeMap& rm = isPre ? d_preRewriteMap : d_postRewriteMap;
156
806308
rm[thash] = s;
157
806308
if (d_cpolicy == TConvCachePolicy::DYNAMIC)
158
{
159
// clear the cache
160
d_cache.clear();
161
}
162
806308
return t.eqNode(s);
163
}
164
165
79395
std::shared_ptr<ProofNode> TConvProofGenerator::getProofFor(Node f)
166
{
167
158790
Trace("tconv-pf-gen") << "TConvProofGenerator::getProofFor: " << identify()
168
79395
<< ": " << f << std::endl;
169
79395
if (f.getKind() != EQUAL)
170
{
171
std::stringstream serr;
172
serr << "TConvProofGenerator::getProofFor: " << identify()
173
<< ": fail, non-equality " << f;
174
Unhandled() << serr.str();
175
Trace("tconv-pf-gen") << serr.str() << std::endl;
176
return nullptr;
177
}
178
// we use the existing proofs
179
LazyCDProof lpf(
180
158790
d_proof.getManager(), &d_proof, nullptr, d_name + "::LazyCDProof");
181
79395
if (f[0] == f[1])
182
{
183
// assertion failure in debug
184
Assert(false) << "TConvProofGenerator::getProofFor: " << identify()
185
<< ": don't ask for trivial proofs";
186
lpf.addStep(f, PfRule::REFL, {}, {f[0]});
187
}
188
else
189
{
190
158790
Node conc = getProofForRewriting(f[0], lpf, d_tcontext);
191
79395
if (conc != f)
192
{
193
bool debugTraceEnabled = Trace.isOn("tconv-pf-gen-debug");
194
Assert(conc.getKind() == EQUAL && conc[0] == f[0]);
195
std::stringstream serr;
196
serr << "TConvProofGenerator::getProofFor: " << toStringDebug()
197
<< ": failed, mismatch";
198
if (!debugTraceEnabled)
199
{
200
serr << " (see -t tconv-pf-gen-debug for details)";
201
}
202
serr << std::endl;
203
serr << " source: " << f[0] << std::endl;
204
serr << " requested conclusion: " << f[1] << std::endl;
205
serr << "conclusion from generator: " << conc[1] << std::endl;
206
207
if (debugTraceEnabled)
208
{
209
Trace("tconv-pf-gen-debug") << "Printing rewrite steps..." << std::endl;
210
for (size_t r = 0; r < 2; r++)
211
{
212
const NodeNodeMap& rm = r == 0 ? d_preRewriteMap : d_postRewriteMap;
213
serr << "Rewrite steps (" << (r == 0 ? "pre" : "post")
214
<< "):" << std::endl;
215
for (NodeNodeMap::const_iterator it = rm.begin(); it != rm.end();
216
++it)
217
{
218
serr << (*it).first << " -> " << (*it).second << std::endl;
219
}
220
}
221
}
222
Unhandled() << serr.str();
223
return nullptr;
224
}
225
}
226
158790
std::shared_ptr<ProofNode> pfn = lpf.getProofFor(f);
227
79395
Trace("tconv-pf-gen") << "... success" << std::endl;
228
79395
Assert (pfn!=nullptr);
229
79395
Trace("tconv-pf-gen-debug") << "... proof is " << *pfn << std::endl;
230
79395
return pfn;
231
}
232
233
79395
Node TConvProofGenerator::getProofForRewriting(Node t,
234
LazyCDProof& pf,
235
TermContext* tctx)
236
{
237
79395
NodeManager* nm = NodeManager::currentNM();
238
// Invariant: if visited[hash(t)] = s or rewritten[hash(t)] = s and t,s are
239
// distinct, then pf is able to generate a proof of t=s. We must
240
// Node in the domains of the maps below due to hashing creating new (SEXPR)
241
// nodes.
242
243
// the final rewritten form of terms
244
158790
std::unordered_map<Node, Node, TNodeHashFunction> visited;
245
// the rewritten form of terms we have processed so far
246
158790
std::unordered_map<Node, Node, TNodeHashFunction> rewritten;
247
79395
std::unordered_map<Node, Node, TNodeHashFunction>::iterator it;
248
79395
std::unordered_map<Node, Node, TNodeHashFunction>::iterator itr;
249
79395
std::map<Node, std::shared_ptr<ProofNode> >::iterator itc;
250
158790
Trace("tconv-pf-gen-rewrite")
251
158790
<< "TConvProofGenerator::getProofForRewriting: " << toStringDebug()
252
79395
<< std::endl;
253
79395
Trace("tconv-pf-gen-rewrite") << "Input: " << t << std::endl;
254
// if provided, we use term context for cache
255
158790
std::shared_ptr<TCtxStack> visitctx;
256
// otherwise, visit is used if we don't have a term context
257
158790
std::vector<TNode> visit;
258
158790
Node tinitialHash;
259
79395
if (tctx != nullptr)
260
{
261
8208
visitctx = std::make_shared<TCtxStack>(tctx);
262
8208
visitctx->pushInitial(t);
263
8208
tinitialHash = TCtxNode::computeNodeHash(t, tctx->initialValue());
264
}
265
else
266
{
267
71187
visit.push_back(t);
268
71187
tinitialHash = t;
269
}
270
158790
Node cur;
271
79395
uint32_t curCVal = 0;
272
158790
Node curHash;
273
3875370
do
274
{
275
// pop the top element
276
3954765
if (tctx != nullptr)
277
{
278
668066
std::pair<Node, uint32_t> curPair = visitctx->getCurrent();
279
334033
cur = curPair.first;
280
334033
curCVal = curPair.second;
281
334033
curHash = TCtxNode::computeNodeHash(cur, curCVal);
282
334033
visitctx->pop();
283
}
284
else
285
{
286
3620732
cur = visit.back();
287
3620732
curHash = cur;
288
3620732
visit.pop_back();
289
}
290
3954765
Trace("tconv-pf-gen-rewrite") << "* visit : " << curHash << std::endl;
291
// has the proof for cur been cached?
292
3954765
itc = d_cache.find(curHash);
293
3954765
if (itc != d_cache.end())
294
{
295
1289770
Node res = itc->second->getResult();
296
644885
Assert(res.getKind() == EQUAL);
297
644885
Assert(!res[1].isNull());
298
644885
visited[curHash] = res[1];
299
644885
pf.addProof(itc->second);
300
644885
continue;
301
}
302
3309880
it = visited.find(curHash);
303
3309880
if (it == visited.end())
304
{
305
1293989
Trace("tconv-pf-gen-rewrite") << "- previsit" << std::endl;
306
1293989
visited[curHash] = Node::null();
307
// did we rewrite the current node (at pre-rewrite)?
308
2587978
Node rcur = getRewriteStepInternal(curHash, true);
309
1293989
if (!rcur.isNull())
310
{
311
211718
Trace("tconv-pf-gen-rewrite")
312
105859
<< "*** " << curHash << " prerewrites to " << rcur << std::endl;
313
// d_proof has a proof of cur = rcur. Hence there is nothing
314
// to do here, as pf will reference d_proof to get its proof.
315
105859
if (d_policy == TConvPolicy::FIXPOINT)
316
{
317
// It may be the case that rcur also rewrites, thus we cannot assign
318
// the final rewritten form for cur yet. Instead we revisit cur after
319
// finishing visiting rcur.
320
91523
rewritten[curHash] = rcur;
321
91523
if (tctx != nullptr)
322
{
323
20544
visitctx->push(cur, curCVal);
324
20544
visitctx->push(rcur, curCVal);
325
}
326
else
327
{
328
70979
visit.push_back(cur);
329
70979
visit.push_back(rcur);
330
}
331
}
332
else
333
{
334
14336
Assert(d_policy == TConvPolicy::ONCE);
335
28672
Trace("tconv-pf-gen-rewrite") << "-> (once, prewrite) " << curHash
336
14336
<< " = " << rcur << std::endl;
337
// not rewriting again, rcur is final
338
14336
Assert(!rcur.isNull());
339
14336
visited[curHash] = rcur;
340
14336
doCache(curHash, cur, rcur, pf);
341
}
342
}
343
1188130
else if (tctx != nullptr)
344
{
345
118299
visitctx->push(cur, curCVal);
346
// visit operator if apply uf
347
118299
if (d_rewriteOps && cur.getKind() == APPLY_UF)
348
{
349
visitctx->pushOp(cur, curCVal);
350
}
351
118299
visitctx->pushChildren(cur, curCVal);
352
}
353
else
354
{
355
1069831
visit.push_back(cur);
356
// visit operator if apply uf
357
1069831
if (d_rewriteOps && cur.getKind() == APPLY_UF)
358
{
359
71732
visit.push_back(cur.getOperator());
360
}
361
1069831
visit.insert(visit.end(), cur.begin(), cur.end());
362
}
363
}
364
2015891
else if (it->second.isNull())
365
{
366
1350764
itr = rewritten.find(curHash);
367
1350764
if (itr != rewritten.end())
368
{
369
// only can generate partially rewritten nodes when rewrite again is
370
// true.
371
192288
Assert(d_policy != TConvPolicy::ONCE);
372
// if it was rewritten, check the status of the rewritten node,
373
// which should be finished now
374
384576
Node rcur = itr->second;
375
384576
Trace("tconv-pf-gen-rewrite")
376
192288
<< "- postvisit, previously rewritten to " << rcur << std::endl;
377
384576
Node rcurHash = rcur;
378
192288
if (tctx != nullptr)
379
{
380
24262
rcurHash = TCtxNode::computeNodeHash(rcur, curCVal);
381
}
382
192288
Assert(cur != rcur);
383
// the final rewritten form of cur is the final form of rcur
384
384576
Node rcurFinal = visited[rcurHash];
385
192288
Assert(!rcurFinal.isNull());
386
192288
if (rcurFinal != rcur)
387
{
388
// must connect via TRANS
389
134302
std::vector<Node> pfChildren;
390
67151
pfChildren.push_back(cur.eqNode(rcur));
391
67151
pfChildren.push_back(rcur.eqNode(rcurFinal));
392
134302
Node result = cur.eqNode(rcurFinal);
393
67151
pf.addStep(result, PfRule::TRANS, pfChildren, {});
394
}
395
384576
Trace("tconv-pf-gen-rewrite")
396
192288
<< "-> (rewritten postrewrite) " << curHash << " = " << rcurFinal
397
192288
<< std::endl;
398
192288
visited[curHash] = rcurFinal;
399
192288
doCache(curHash, cur, rcurFinal, pf);
400
}
401
else
402
{
403
1158476
Trace("tconv-pf-gen-rewrite") << "- postvisit" << std::endl;
404
2316952
Node ret = cur;
405
2316952
Node retHash = curHash;
406
1158476
bool childChanged = false;
407
2316952
std::vector<Node> children;
408
1158476
Kind ck = cur.getKind();
409
1158476
if (d_rewriteOps && ck == APPLY_UF)
410
{
411
// the operator of APPLY_UF is visited
412
143464
Node cop = cur.getOperator();
413
71732
if (tctx != nullptr)
414
{
415
uint32_t coval = tctx->computeValueOp(cur, curCVal);
416
Node coHash = TCtxNode::computeNodeHash(cop, coval);
417
it = visited.find(coHash);
418
}
419
else
420
{
421
71732
it = visited.find(cop);
422
}
423
71732
Assert(it != visited.end());
424
71732
Assert(!it->second.isNull());
425
71732
childChanged = childChanged || cop != it->second;
426
143464
children.push_back(it->second);
427
}
428
1086744
else if (cur.getMetaKind() == metakind::PARAMETERIZED)
429
{
430
// all other parametrized operators are unchanged
431
73197
children.push_back(cur.getOperator());
432
}
433
// get the results of the children
434
1158476
if (tctx != nullptr)
435
{
436
276255
for (size_t i = 0, nchild = cur.getNumChildren(); i < nchild; i++)
437
{
438
317154
Node cn = cur[i];
439
158577
uint32_t cnval = tctx->computeValue(cur, curCVal, i);
440
317154
Node cnHash = TCtxNode::computeNodeHash(cn, cnval);
441
158577
it = visited.find(cnHash);
442
158577
Assert(it != visited.end());
443
158577
Assert(!it->second.isNull());
444
158577
childChanged = childChanged || cn != it->second;
445
158577
children.push_back(it->second);
446
}
447
}
448
else
449
{
450
// can use simple loop if not term-context-sensitive
451
3034528
for (const Node& cn : cur)
452
{
453
1993730
it = visited.find(cn);
454
1993730
Assert(it != visited.end());
455
1993730
Assert(!it->second.isNull());
456
1993730
childChanged = childChanged || cn != it->second;
457
1993730
children.push_back(it->second);
458
}
459
}
460
1158476
if (childChanged)
461
{
462
215552
ret = nm->mkNode(ck, children);
463
215552
rewritten[curHash] = ret;
464
// congruence to show (cur = ret)
465
215552
PfRule congRule = PfRule::CONG;
466
431104
std::vector<Node> pfChildren;
467
431104
std::vector<Node> pfArgs;
468
215552
pfArgs.push_back(ProofRuleChecker::mkKindNode(ck));
469
215552
if (ck == APPLY_UF && children[0] != cur.getOperator())
470
{
471
// use HO_CONG if the operator changed
472
221
congRule = PfRule::HO_CONG;
473
221
pfChildren.push_back(cur.getOperator().eqNode(children[0]));
474
}
475
215331
else if (kind::metaKindOf(ck) == kind::metakind::PARAMETERIZED)
476
{
477
11742
pfArgs.push_back(cur.getOperator());
478
}
479
755603
for (size_t i = 0, size = cur.getNumChildren(); i < size; i++)
480
{
481
540051
if (cur[i] == ret[i])
482
{
483
// ensure REFL proof for unchanged children
484
161171
pf.addStep(cur[i].eqNode(cur[i]), PfRule::REFL, {}, {cur[i]});
485
}
486
540051
pfChildren.push_back(cur[i].eqNode(ret[i]));
487
}
488
431104
Node result = cur.eqNode(ret);
489
215552
pf.addStep(result, congRule, pfChildren, pfArgs);
490
// must update the hash
491
215552
retHash = ret;
492
215552
if (tctx != nullptr)
493
{
494
38454
retHash = TCtxNode::computeNodeHash(ret, curCVal);
495
}
496
}
497
942924
else if (tctx != nullptr)
498
{
499
// now we need the hash
500
79224
retHash = TCtxNode::computeNodeHash(cur, curCVal);
501
}
502
// did we rewrite ret (at post-rewrite)?
503
2316952
Node rret = getRewriteStepInternal(retHash, false);
504
1158476
if (!rret.isNull() && d_policy == TConvPolicy::FIXPOINT)
505
{
506
142222
Trace("tconv-pf-gen-rewrite")
507
71111
<< "*** " << retHash << " postrewrites to " << rret << std::endl;
508
// d_proof should have a proof of ret = rret, hence nothing to do
509
// here, for the same reasons as above. It also may be the case that
510
// rret rewrites, hence we must revisit ret.
511
71111
rewritten[retHash] = rret;
512
71111
if (tctx != nullptr)
513
{
514
3097
if (cur != ret)
515
{
516
625
visitctx->push(cur, curCVal);
517
}
518
3097
visitctx->push(ret, curCVal);
519
3097
visitctx->push(rret, curCVal);
520
}
521
else
522
{
523
68014
if (cur != ret)
524
{
525
38041
visit.push_back(cur);
526
}
527
68014
visit.push_back(ret);
528
68014
visit.push_back(rret);
529
}
530
}
531
else
532
{
533
// take its rewrite if it rewrote and we have ONCE rewriting policy
534
1087365
ret = rret.isNull() ? ret : rret;
535
2174730
Trace("tconv-pf-gen-rewrite")
536
1087365
<< "-> (postrewrite) " << curHash << " = " << ret << std::endl;
537
// it is final
538
1087365
Assert(!ret.isNull());
539
1087365
visited[curHash] = ret;
540
1087365
doCache(curHash, cur, ret, pf);
541
}
542
}
543
}
544
else
545
{
546
665127
Trace("tconv-pf-gen-rewrite") << "- already visited" << std::endl;
547
}
548
3954765
} while (!(tctx != nullptr ? visitctx->empty() : visit.empty()));
549
79395
Assert(visited.find(tinitialHash) != visited.end());
550
79395
Assert(!visited.find(tinitialHash)->second.isNull());
551
158790
Trace("tconv-pf-gen-rewrite")
552
79395
<< "...finished, return " << visited[tinitialHash] << std::endl;
553
// return the conclusion of the overall proof
554
158790
return t.eqNode(visited[tinitialHash]);
555
}
556
557
1293989
void TConvProofGenerator::doCache(Node curHash,
558
Node cur,
559
Node r,
560
LazyCDProof& pf)
561
{
562
1293989
if (d_cpolicy != TConvCachePolicy::NEVER)
563
{
564
830280
Node eq = cur.eqNode(r);
565
415140
d_cache[curHash] = pf.getProofFor(eq);
566
}
567
1293989
}
568
569
3402731
Node TConvProofGenerator::getRewriteStepInternal(Node t, bool isPre) const
570
{
571
3402731
const NodeNodeMap& rm = isPre ? d_preRewriteMap : d_postRewriteMap;
572
3402731
NodeNodeMap::const_iterator it = rm.find(t);
573
3402731
if (it == rm.end())
574
{
575
3081803
return Node::null();
576
}
577
320928
return (*it).second;
578
}
579
199921
std::string TConvProofGenerator::identify() const { return d_name; }
580
581
79395
std::string TConvProofGenerator::toStringDebug() const
582
{
583
158790
std::stringstream ss;
584
158790
ss << identify() << " (policy=" << d_policy << ", cache policy=" << d_cpolicy
585
79395
<< (d_tcontext != nullptr ? ", term-context-sensitive" : "") << ")";
586
158790
return ss.str();
587
}
588
589
26676
} // namespace CVC4
|
__label__pos
| 0.927118 |
Questions tagged [polynomial-time]
Use for algorithms, algorithm-analysis and complexity-theory questions that aim for polynomial running time resp. time complexity. Such questions often are are reference-requests or about runtime-analysis or time-complexity.
Filter by
Sorted by
Tagged with
1
vote
2answers
385 views
$DTIME(f(n)) \subset of DSPACE(f(n))$
I think this is again an easy one: $DTIME(f(n)) \subset DSPACE(f(n))$ They say its trivial but I dont see it, why? And would $DTIME(f(n^2)) \subset DSPACE(f(n^2))$ also be true? if yes why ...
1
vote
2answers
66 views
Time complexity for this simple loop
This is the code: j=2 while j<(n*n) j=j*j At first my approach was to treat this like this loop ...
1
vote
2answers
264 views
NP Class Definition of a Certificate
Given the definition for all x ∈ Σ∗ x ∈ L ⇔ ∃ u ∈ Σ∗ with |u| ≤ p(|x|) and M(x, u) = 1 Lets say the input x = ababab Then the certificate u shouldn't be longer than p(|x|). But what would be p(|...
0
votes
1answer
614 views
Polynomial-Time Reduction
I have read many resources, but I cannot understand what the polynomial-time reduction is. In everywhere, this is explained with standard-pattern sentences. Please can anyone explain it in detailed ...
2
votes
1answer
256 views
Time complexity of sum of $2^n$ values of polynomials
First a simpler question: let $q_{1}(k),\dots,q_{n}(k)$ be $n$ polynomials of degree smaller or equal to $n$. Let $f(n): \mathbb{N} \rightarrow \mathbb{N}$ defined by $f(n) = \sum_{i=1}^{n}q_{i}(n)$. ...
3
votes
0answers
116 views
How to find a minimum spanning forest with a constrained number of nodes in each spanning tree?
Consider a weighted undirected acyclic graph consists of m source (root) vertices and n target vertices. The m-spanning tree problem of the graph is defined as that: (1) each of the m spanning trees ...
1
vote
2answers
34 views
If a decision problem $A \in \text{NP}$ and there exists reduction so that $A \leq_p B$, for decision problem B, what can be deduced about B?
I think that it implies that B can be solved by a non-deterministic polynomial time or worse Turing machine, but I realise that there is possibly some greater result that I'm missing. Thanks in ...
0
votes
1answer
1k views
Class P is closed under concatenation
Proving that Class P is closed under concatenation. The answer is given below: But I do not know why stage 2 is repeated at most O(n), could anyone explain this for me please?
7
votes
1answer
250 views
sequence of problems that take $\Theta(n^k)$ for increasing $k$?
Do we know an infinite sequence of decision problems where the most efficient algorithm for each problem takes $\Theta(n^k)$ time, where $k$ increases unboundedly? Suppose for example that we would ...
3
votes
1answer
45 views
Constructing an optimal solution to bin packing using a “magical function” $\phi$
I am taking an introductory course in complexity theory, and as an exercise, we were given the following problem. Consider the bin packing problem, with objects of positive (rational) weights $W = \{...
2
votes
1answer
67 views
Defining polynomial hierarchy with oracle machines and quantifiers
While trying to understand the concept of polynomial hierarchy, I noticed that there are several ways to define it. And the most confusing thing about the situation is to see the equivalence between ...
2
votes
1answer
49 views
Adding the requirement of linear time on infinitely many inputs into the class $P$
Is the following problem computable in polynomial time? Input: $<M_1>$, encoding of a determinstic TM that runs in polynomial time ($L(M_1)\in P$) Output: $<M_2>$, encoding of a ...
1
vote
1answer
29 views
How to prove that $n^d$ is $O(b^n)$ from $n$ is $O(2^n)$, given that $d>0, b>1$? [duplicate]
I'm reading Rosen's Discrete Mathematics and Its Application, at Page 212, it's about the "Big-O" notation using in computer science. This is the description in the book: And here is my reasoning: ...
3
votes
2answers
116 views
For some $n$, how can we check whether there exists $a,b \in \mathbb{N}$ such that $a^b = n$ in polynomial time?
For some given $n$, how can we check whether there exists $a,b \in \mathbb{N}$ ($b > 0$) such that $a^b = n$ in polynomial time with respect to the number of digits in $n$?
3
votes
0answers
71 views
How to find m directed paths connecting the maximal number of vertices in an unweighted directed acyclic graph?
Consider an un-weighted directed acyclic graph (DAG) consists of m source (root) vertices and n target vertices. When there is only one source vertex (m=1), the problem to find a directed path ...
1
vote
1answer
391 views
Poly-time reduction is not antisymmetric
Lemma. (Transitivity) "$\leq_p$" is a transitive relation on languages, i.e., if $L_1 \leq_p L_2$ and $L_2 \leq_p L_3$, then $L_1 \leq_p L_3$. Proof. By definition, there are poly-time ...
1
vote
1answer
59 views
For which level of PH is $\operatorname{VALID}$ complete
I have the decision problem $\operatorname{VALID}$ which is the set of all valid propositional formulas (tautologies), I know that $$\overline{\operatorname{SAT}}\equiv_m^p \operatorname{VALID}.$$ ...
2
votes
1answer
243 views
Solving diophantine equations — does having a bound on the size of the solution help?
Let's define the following languages over the alphabet $\Sigma=\{0,1\}$: H10 is the language of all strings that are encoding of diophantine polynomial equation with integer coefficients and $n$ ...
3
votes
1answer
334 views
How do we show that the polynomial time reduction of one problem to another has been done in polynomial time?
I have just been reading through a SO post which proves that the Halting Problem is NP-Hard. Whilst this is an easily followed proof, one slight slight aspect of it has left me scratching my head: it ...
4
votes
2answers
373 views
What are the examples of problems which first had large polynomial time complexity algorithms but later the complexity was reduced significantly?
Arora-Barak says It has also happened a few times that the first polynomial-time algorithm for a problem had high complexity, say $n^{20}$, but soon somebody simplified it to say an $n^5$ time ...
0
votes
0answers
37 views
How about boolean formula that is satisfied on every reject path and falsified on every accept path of non deterministic Turing machine? [duplicate]
Cook-Levin reduction is both deterministic polynomial time and parsimonious and that's mean that from every non deterministic Turing machine $M$ and string $w$ it is possible in polynomial time ...
1
vote
1answer
498 views
What is the precise definition of pseudo-polynomial time (feat. Counting Sort)
From wikipedia In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is a polynomial in the length of the input (the number of bits required ...
1
vote
1answer
91 views
Polynomial time problems with provably high degree time complexity?
For any integer $k$, does there exist a decision problem in $\textbf P$ that can be proven to require $\Omega(n^k)$ steps?
0
votes
0answers
139 views
Linear time reduction equivalence
I have to show if the following statement is true or false. Suppose we have two problems $A$ and $B$. We want to know whether the following is true: If $A \le_p B$ and there is an algorithm which ...
4
votes
3answers
779 views
What is difference between nondeterministic polynomial time and exponential time?
I am not very into computer science theory but i feel like people are defining nondeterministic polynomial time as if it is another name of exponential time. I would be happy if you clarify it. thank ...
0
votes
1answer
52 views
Solve Time Complexity problem using Time Hierarchy
I am trying to understand Time Hierarchy. I have an example that is solvable using the rules of Time Hierarchy. I would like an explanation on how to solve so that I may understand better how to use ...
0
votes
1answer
131 views
Whether the algorithm is polynomial or not with input size which is not polynomial [closed]
A problem may require memory space which is not polynomial with respect to the input size but may still have polynomial run time. Is this true or false? and why? any idea?
1
vote
1answer
51 views
If the difference between two oracles is negligible, is the difference between a PPT algorithm with these two oracles also negligible?
We say a negligible function is a function $\epsilon(n):\mathbb{N}\rightarrow \mathbb{R}$ such that for every positive integer $c$ there exists an integer $N_c$ such that for all $n > N_c$, $$\...
2
votes
1answer
65 views
On lowness of $\oplus P$
$\oplus P$ is low for itself ($\oplus P^{\oplus P}=\oplus P$). Are there other complexity classes $\mathcal D$ that satisfy $\mathcal D^{\oplus P}=\oplus P$? Are there complexity classes $\mathcal C$ ...
0
votes
0answers
151 views
Prove that Vertex Cover belongs to NP
How to prove that the problem VERTEX-COVER belongs to $NP$? The problem VC is defined as follow: INSTANCE: Graph $G = (V,E)$ and an integer $k$ PREDICATE: Is there a subset $V_1 \in V $ s.t $\mid V_1 ...
1
vote
0answers
78 views
Must every NP-Complete Problem have a class of instances which is solvable in Poly time? [closed]
Is there any theorem that states that any NP-Complete Problem has a class of instances solvable in Poly time? For example, some problems like vertex cover are NP-Complete on general graphs but can be ...
3
votes
1answer
95 views
$m/p$-equivalence holds after union with an arbitrary finite language
Problem 1: Let $A,B$ be languages over some alphabet $\Sigma$, if $A \equiv_m B$, then for every finite language $C$, $A \cup C \equiv_m B \cup C$. Problem 2: Problem 1 but using polynomial time ...
4
votes
1answer
521 views
Linear programming restricted to rational coefficients
I'm reading the appendix A of Williamson's "the design of approximation algorithms" about linear programming. In the definition of a linear programming it restricted the coefficients of cost function ...
1
vote
1answer
761 views
reducing $CLIQUE$ from decision to search problem
consider the language:$$CLIQUE = \left\{\langle G,k\rangle \ |\ \text{ $G$ is a graph containing a clique of size at least $k$ } \right\}$$ Suppose there's a polynomial time algorithm for $CLIQUE$. ...
38
votes
3answers
54k views
What exactly is polynomial time? [duplicate]
I'm trying to understand algorithm complexity, and a lot of algorithms are classified as polynomial. I couldn't find an exact definition anywhere. I assume it is the complexity that is not exponential....
2
votes
1answer
1k views
Question about NP problem certificates and P=NP
From my understanding a problem is considered to be in NP time if it can be solved in polynomial time with a non-deterministic Turing machine and verified in polynomial time with a certificate. My ...
2
votes
1answer
43 views
$UP^{\ O}\neq P^{\ O}$ for some oracle $O$
The definition of the class $UP$ is here. It is of course easy to see that $P\subseteq UP$. I have a problem of proving that there is an oracle $O$ and a language $L$ such that $L\in UP^{\ O}$ but $...
4
votes
2answers
193 views
Where/how did a $\log(n)$ factor disappear from well-known algorithms?
Consider the binary search problem on a sorted array containing $n$ integers on 16 bits. Everybody agrees that the binary search needs $O(\log(n))$ time, because it makes at worst $O(\log(n))$ steps. ...
2
votes
0answers
89 views
polynomial time reducibility, if $A \in \mathbf P$ and $B \in \mathbf N$ $\mathbf P \setminus \{\emptyset,\Sigma^*\} $ and vice versa
$f: \Sigma^* \to \Sigma^*$ is a polynomial time computable function if some poly-time Turing Machine M, on every input w, halts with just $f(w)$ on its tape. Language $A$ is polynomial time reducible ...
2
votes
0answers
241 views
Building a poly-time verifier given a poly-time decider
Can I build a polynomial time verifier for problem, given a non-deterministic polynomial time decider for that problem? I assume I should modify the decider such that it will verify the certificate. ...
1
vote
1answer
359 views
Is the complement of MAX-CLIQUE in NP?
Let $$MAX-CLIQUE = \{\ <G,k>\ |\ G\ is\ an\ undirected\ graph,\ and\ the\ largest\ clique\ of\ G\ has\ k\ vertices\}$$ Does $MAX-CLIQUE\in coNP$? If it does, can you think of a verifier? If $NP=...
0
votes
1answer
76 views
If M is recognizing L in polynomial time, is it also deciding it in polynomial time?
Assume that a given turing machine $M$ accepts words in the language in $n^k$ or less steps, but words that aren't in the language are rejected in unknown number of steps (the machine might even ...
1
vote
1answer
76 views
For any non-trivial $A,B$, finding a language which both are polynomially reducible to
Given two non-trivial (not $\emptyset$ or $\Sigma^*$) languages $A$, $B$ over an alphabet $\Sigma$, which of the following is correct: a. There is a language $C$ such that $A\leq_pC$ and $B\leq_pC$. [....
1
vote
1answer
71 views
P decision problem that potentially requires at least $\Omega(n \log n)$ in the Turing model?
Currently, it is not proven that $NP \geq O(n \log n)$ in the Turing Machine Model. The weakness of this statement can be illustrated by NP-complete problems, which we think require way more time. ...
2
votes
1answer
86 views
Is rejecting in polynomial time required for language to be in P?
Language $L$ is in $\mathrm{P}$ if and only if there exists some Turing Machine $M$ such that for every word in $L$, $M$ either accepts or rejects it in polynomial time. Right? But what if all we ...
0
votes
1answer
299 views
GCD binary representation time complexity
1. Consider the following algorithm for deciding GCD: “On input : ...
3
votes
2answers
204 views
GOTO vs. including line in loop - will it affect efficiency?
Let's say I have an algorithm something like as follows: ...
0
votes
2answers
272 views
approximation algorithm with polynomial complexity
It might be a silly question, I do take a carefully read about approximation algorithm through coursenotes, but when I saw the words "approximation algorithm with polynomial complexity", I can't ...
0
votes
0answers
27 views
Revisiting complexity of art gallery-like problem
In a question I had asked earlier, I was interested in knowing whether we could decide in polynomial time whether, for a directed graph $G$ with every one of its vertices belonging to an edge, a size-$...
6
votes
2answers
130 views
Time complexity of art gallery-like problem
Suppose that $G = (V,E)$ is a directed graph such that each vertex in $V$ is in at least one edge in $E$. We'd like to decide whether or not $w$ watchmen can be placed on $w$ distinct vertices in $G$ ...
|
__label__pos
| 0.966909 |
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
Given a function $f(x):\mathbb R\to\mathbb R$, which is continuous, bijective, and nondecreasing on $\mathbb R$. Also, there exists a constant $L>0$ such that $0<|f'(x)|\leq L$ for all $x\in\mathbb R$.
I want to show that
$$ f((x, x+a))\subset (f(x), f(x)+La)$$ for all $x\in\mathbb R$, and $a>0$, where $(x,x+a)$ is an open interval in $\mathbb R$.
Any help! Thanks.
Edit: I know from the above conditions that $f$ will be Lipschitz function with Lipschitz constant $L$, i.e., $$|f(x)-f(y)|\leq L|x-y|$$ and if we consider $y=x+a$, then we get $|f(x)-f(x+a)|\leq La$. But How to use this!
share|cite|improve this question
Hi, what have you tried already? Also, is this homework? If yes, please add a homework tag. – Johannes Kloos Apr 3 '12 at 16:10
@Johannes Kloos: Thank you for your comment. This is not a homework. – Nicole Apr 3 '12 at 16:17
You should also write explicitly that $f$ is differentiable. In that case you know that $$ f(x)<f(y)<f(x+a) $$ for all $y\in(x,x+a)$ so you only should show that $f(x+a)\leq f(x)+La$ - indeed: $$ f(x+a) = f(x)+\int\limits_x^{x+a}f'(y)dy\leq f(x)+\int\limits_x^{x+a}Ldy = f(x)+La $$ as needed.
If you can only use the Lipschitz condition, then from the monotonicity again you obtain: $$ f(x+a) - f(x)\leq L((x+a)-a) = La $$ so $f(x+a)\leq f(x)+La$ and the argumet above applies.
share|cite|improve this answer
Thank you, that make sense. I was working on a awrong direction - using lipschitz definition. – Nicole Apr 3 '12 at 16:16
@Nicole: updated the answer – Ilya Apr 3 '12 at 16:24
Thanks again!... – Nicole Apr 3 '12 at 16:45
@Nicole Hi Nicole. Welcome here! It is common that you accept the best answer (select the green V) and upvote the answer. Of course, you could wait with accepting the answer to see if there will come other ones too. – Jonas Teuwen Apr 3 '12 at 17:44
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.541452 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.