Author Archives: ahe

Windows 10程序最小化后在任务栏找不到图标

朋友电脑中了恶意软件,除弹窗外还表现为任务栏空荡荡,不管运行多少个程序,一旦最小化就找不到了,任务栏没有图标,只能通过ALT+TAB快捷键切换。尝试多种方法无果,从微软社区回帖中找到解决办法,尝试有效。

将以下内容粘贴到记事本,然后另存为 anyFileName.bat, 在刚刚保存的.bat文件上单击鼠标右键,以管理员身份运行。运行完成任务栏即可恢复,无效的话尝试重启电脑。

@echo off

taskkill /f /im explorer.exe

taskkill /f /im shellexperiencehost.exe

timeout /t 3 /NOBREAK > nul

del %localappdata%

\Packages\Microsoft.Windows.ShellExperienceHost_cw5n1h2txyewy\TempState\* /q

timeout /t 2 /NOBREAK > nul

start explorer

@echo on

stm32可以使用的红黑树

我借鉴的是u-boot版本号为2012.04.01 这个可以在UBOOT的主Makefile中查到,kernel版本号为3.4.20 。两个都可以。以u-boot为例,打开u-boot目录下的lib目录,我们可以看到有crc7,16,32,md5等等,我们的目标是rbtree.c。我们把这个文件打开看看

/*
Red Black Trees
(C) 1999 Andrea Arcangeli <andrea@suse.de>
(C) 2002 David Woodhouse <dwmw2@infradead.org>

This program 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.

This program 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 this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

linux/lib/rbtree.c
*/

#include <ubi_uboot.h>
#include <linux/rbtree.h>

static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
{
struct rb_node *right = node->rb_right;
struct rb_node *parent = rb_parent(node);

if ((node->rb_right = right->rb_left))
rb_set_parent(right->rb_left, node);
right->rb_left = node;

rb_set_parent(right, parent);

if (parent)
{
if (node == parent->rb_left)
parent->rb_left = right;
else
parent->rb_right = right;
}
else
root->rb_node = right;
rb_set_parent(node, right);
}

static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
{
struct rb_node *left = node->rb_left;
struct rb_node *parent = rb_parent(node);

if ((node->rb_left = left->rb_right))
rb_set_parent(left->rb_right, node);
left->rb_right = node;

rb_set_parent(left, parent);

if (parent)
{
if (node == parent->rb_right)
parent->rb_right = left;
else
parent->rb_left = left;
}
else
root->rb_node = left;
rb_set_parent(node, left);
}

void rb_insert_color(struct rb_node *node, struct rb_root *root)
{
struct rb_node *parent, *gparent;

while ((parent = rb_parent(node)) && rb_is_red(parent))
{
gparent = rb_parent(parent);

if (parent == gparent->rb_left)
{
{
register struct rb_node *uncle = gparent->rb_right;
if (uncle && rb_is_red(uncle))
{
rb_set_black(uncle);
rb_set_black(parent);
rb_set_red(gparent);
node = gparent;
continue;
}
}

if (parent->rb_right == node)
{
register struct rb_node *tmp;
__rb_rotate_left(parent, root);
tmp = parent;
parent = node;
node = tmp;
}

rb_set_black(parent);
rb_set_red(gparent);
__rb_rotate_right(gparent, root);
} else {
{
register struct rb_node *uncle = gparent->rb_left;
if (uncle && rb_is_red(uncle))
{
rb_set_black(uncle);
rb_set_black(parent);
rb_set_red(gparent);
node = gparent;
continue;
}
}

if (parent->rb_left == node)
{
register struct rb_node *tmp;
__rb_rotate_right(parent, root);
tmp = parent;
parent = node;
node = tmp;
}

rb_set_black(parent);
rb_set_red(gparent);
__rb_rotate_left(gparent, root);
}
}

rb_set_black(root->rb_node);
}

static void __rb_erase_color(struct rb_node *node, struct rb_node *parent,
struct rb_root *root)
{
struct rb_node *other;

while ((!node || rb_is_black(node)) && node != root->rb_node)
{
if (parent->rb_left == node)
{
other = parent->rb_right;
if (rb_is_red(other))
{
rb_set_black(other);
rb_set_red(parent);
__rb_rotate_left(parent, root);
other = parent->rb_right;
}
if ((!other->rb_left || rb_is_black(other->rb_left)) &&
(!other->rb_right || rb_is_black(other->rb_right)))
{
rb_set_red(other);
node = parent;
parent = rb_parent(node);
}
else
{
if (!other->rb_right || rb_is_black(other->rb_right))
{
struct rb_node *o_left;
if ((o_left = other->rb_left))
rb_set_black(o_left);
rb_set_red(other);
__rb_rotate_right(other, root);
other = parent->rb_right;
}
rb_set_color(other, rb_color(parent));
rb_set_black(parent);
if (other->rb_right)
rb_set_black(other->rb_right);
__rb_rotate_left(parent, root);
node = root->rb_node;
break;
}
}
else
{
other = parent->rb_left;
if (rb_is_red(other))
{
rb_set_black(other);
rb_set_red(parent);
__rb_rotate_right(parent, root);
other = parent->rb_left;
}
if ((!other->rb_left || rb_is_black(other->rb_left)) &&
(!other->rb_right || rb_is_black(other->rb_right)))
{
rb_set_red(other);
node = parent;
parent = rb_parent(node);
}
else
{
if (!other->rb_left || rb_is_black(other->rb_left))
{
register struct rb_node *o_right;
if ((o_right = other->rb_right))
rb_set_black(o_right);
rb_set_red(other);
__rb_rotate_left(other, root);
other = parent->rb_left;
}
rb_set_color(other, rb_color(parent));
rb_set_black(parent);
if (other->rb_left)
rb_set_black(other->rb_left);
__rb_rotate_right(parent, root);
node = root->rb_node;
break;
}
}
}
if (node)
rb_set_black(node);
}

void rb_erase(struct rb_node *node, struct rb_root *root)
{
struct rb_node *child, *parent;
int color;

if (!node->rb_left)
child = node->rb_right;
else if (!node->rb_right)
child = node->rb_left;
else
{
struct rb_node *old = node, *left;

node = node->rb_right;
while ((left = node->rb_left) != NULL)
node = left;
child = node->rb_right;
parent = rb_parent(node);
color = rb_color(node);

if (child)
rb_set_parent(child, parent);
if (parent == old) {
parent->rb_right = child;
parent = node;
} else
parent->rb_left = child;

node->rb_parent_color = old->rb_parent_color;
node->rb_right = old->rb_right;
node->rb_left = old->rb_left;

if (rb_parent(old))
{
if (rb_parent(old)->rb_left == old)
rb_parent(old)->rb_left = node;
else
rb_parent(old)->rb_right = node;
} else
root->rb_node = node;

rb_set_parent(old->rb_left, node);
if (old->rb_right)
rb_set_parent(old->rb_right, node);
goto color;
}

parent = rb_parent(node);
color = rb_color(node);

if (child)
rb_set_parent(child, parent);
if (parent)
{
if (parent->rb_left == node)
parent->rb_left = child;
else
parent->rb_right = child;
}
else
root->rb_node = child;

color:
if (color == RB_BLACK)
__rb_erase_color(child, parent, root);
}

/*
* This function returns the first node (in sort order) of the tree.
*/
struct rb_node *rb_first(struct rb_root *root)
{
struct rb_node *n;

n = root->rb_node;
if (!n)
return NULL;
while (n->rb_left)
n = n->rb_left;
return n;
}

struct rb_node *rb_last(struct rb_root *root)
{
struct rb_node *n;

n = root->rb_node;
if (!n)
return NULL;
while (n->rb_right)
n = n->rb_right;
return n;
}

struct rb_node *rb_next(struct rb_node *node)
{
struct rb_node *parent;

if (rb_parent(node) == node)
return NULL;

/* If we have a right-hand child, go down and then left as far
as we can. */
if (node->rb_right) {
node = node->rb_right;
while (node->rb_left)
node=node->rb_left;
return node;
}

/* No right-hand children. Everything down and left is
smaller than us, so any ‘next’ node must be in the general
direction of our parent. Go up the tree; any time the
ancestor is a right-hand child of its parent, keep going
up. First time it’s a left-hand child of its parent, said
parent is our ‘next’ node. */
while ((parent = rb_parent(node)) && node == parent->rb_right)
node = parent;

return parent;
}

struct rb_node *rb_prev(struct rb_node *node)
{
struct rb_node *parent;

if (rb_parent(node) == node)
return NULL;

/* If we have a left-hand child, go down and then right as far
as we can. */
if (node->rb_left) {
node = node->rb_left;
while (node->rb_right)
node=node->rb_right;
return node;
}

/* No left-hand children. Go up till we find an ancestor which
is a right-hand child of its parent */
while ((parent = rb_parent(node)) && node == parent->rb_left)
node = parent;

return parent;
}

void rb_replace_node(struct rb_node *victim, struct rb_node *new,
struct rb_root *root)
{
struct rb_node *parent = rb_parent(victim);

/* Set the surrounding nodes to point to the replacement */
if (parent) {
if (victim == parent->rb_left)
parent->rb_left = new;
else
parent->rb_right = new;
} else {
root->rb_node = new;
}
if (victim->rb_left)
rb_set_parent(victim->rb_left, new);
if (victim->rb_right)
rb_set_parent(victim->rb_right, new);

/* Copy the pointers/colour from the victim to the replacement */
*new = *victim;
}

代码量不多,接近400行,从函数名就不难看出,这里只是一些红黑树的左右旋,替换节点以及一些节点定位。那么具体怎么使用呢?我们再看看头文件 —— 找到u-boot/include/linux/rbtree.h

/*
Red Black Trees
(C) 1999 Andrea Arcangeli <andrea@suse.de>

This program 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.

This program 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 this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

linux/include/linux/rbtree.h

To use rbtrees you’ll have to implement your own insert and search cores.
This will avoid us to use callbacks and to drop drammatically performances.
I know it’s not the cleaner way, but in C (not in C++) to get
performances and genericity…

Some example of insert and search follows here. The search is a plain
normal search over an ordered tree. The insert instead must be implemented
int two steps: as first thing the code must insert the element in
order as a red leaf in the tree, then the support library function
rb_insert_color() must be called. Such function will do the
not trivial work to rebalance the rbtree if necessary.

———————————————————————–
static inline struct page * rb_search_page_cache(struct inode * inode,
unsigned long offset)
{
struct rb_node * n = inode->i_rb_page_cache.rb_node;
struct page * page;

while (n)
{
page = rb_entry(n, struct page, rb_page_cache);

if (offset < page->offset)
n = n->rb_left;
else if (offset > page->offset)
n = n->rb_right;
else
return page;
}
return NULL;
}

static inline struct page * __rb_insert_page_cache(struct inode * inode,
unsigned long offset,
struct rb_node * node)
{
struct rb_node ** p = &inode->i_rb_page_cache.rb_node;
struct rb_node * parent = NULL;
struct page * page;

while (*p)
{
parent = *p;
page = rb_entry(parent, struct page, rb_page_cache);

if (offset < page->offset)
p = &(*p)->rb_left;
else if (offset > page->offset)
p = &(*p)->rb_right;
else
return page;
}

rb_link_node(node, parent, p);

return NULL;
}

static inline struct page * rb_insert_page_cache(struct inode * inode,
unsigned long offset,
struct rb_node * node)
{
struct page * ret;
if ((ret = __rb_insert_page_cache(inode, offset, node)))
goto out;
rb_insert_color(node, &inode->i_rb_page_cache);
out:
return ret;
}
———————————————————————–
*/

#ifndef _LINUX_RBTREE_H
#define _LINUX_RBTREE_H

#include <linux/stddef.h>

struct rb_node
{
unsigned long rb_parent_color;
#define RB_RED 0
#define RB_BLACK 1
struct rb_node *rb_right;
struct rb_node *rb_left;
} __attribute__((aligned(sizeof(long))));
/* The alignment might seem pointless, but allegedly CRIS needs it */

struct rb_root
{
struct rb_node *rb_node;
};

#define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
#define rb_color(r) ((r)->rb_parent_color & 1)
#define rb_is_red(r) (!rb_color(r))
#define rb_is_black(r) rb_color(r)
#define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0)
#define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0)

static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
{
rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p;
}
static inline void rb_set_color(struct rb_node *rb, int color)
{
rb->rb_parent_color = (rb->rb_parent_color & ~1) | color;
}

#define RB_ROOT (struct rb_root) { NULL, }
#define rb_entry(ptr, type, member) container_of(ptr, type, member)

#define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
#define RB_EMPTY_NODE(node) (rb_parent(node) == node)
#define RB_CLEAR_NODE(node) (rb_set_parent(node, node))

extern void rb_insert_color(struct rb_node *, struct rb_root *);
extern void rb_erase(struct rb_node *, struct rb_root *);

/* Find logical next and previous nodes in a tree */
extern struct rb_node *rb_next(struct rb_node *);
extern struct rb_node *rb_prev(struct rb_node *);
extern struct rb_node *rb_first(struct rb_root *);
extern struct rb_node *rb_last(struct rb_root *);

/* Fast replacement of a single node without remove/rebalance/add/rebalance */
extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
struct rb_root *root);

static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,
struct rb_node ** rb_link)
{
node->rb_parent_color = (unsigned long )parent;
node->rb_left = node->rb_right = NULL;

*rb_link = node;
}

#endif /* _LINUX_RBTREE_H */

通过头文件的注释,老外已经非常友好地给出了一些示例代码。。那么接下来就是移植到我们stm32中了。
首先打开我们用的工程,创建一个Mylib目录,然后简单粗暴地,直接把我们的rbtree.c和rbtree.h直接丢进去。如果这时候我们直接点击编译的话,毫无疑问会产生一大堆的报错信息,我们先简单处理一下。首先是头文件的包含问题,将rbtree.h中 #include <linux/stddef.h> 修改为 #include <stddef.h>。然后点击编译,那么就会发现有些宏,我们是没有实现的。 rb_entry(ptr , type , member) 他封装了container_of,我们再将container_of 从u-boot的 common.h 中拷贝过来

/**
* container_of – cast a member of a structure out to the containing structure
* @ptr: the pointer to the member.
* @type: the type of the container struct this is embedded in.
* @member: the name of the member within the struct.
*
*/
#define container_of(ptr, type, member) ({ \
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
(type *)( (char *)__mptr – offsetof(type,member) );})

但是我们发现keil5中使用的是标准c关键字,typeof属于拓展关键字,是没有办法使用的。这里我们只能读懂这个宏是做什么用的,然后想个其他办法去代替他。
这里初步分析,他定义了一个*__mptr指针,他的类型是和member成员一样的,并指向了ptr。 紧接着使用了offsetof宏对member成员在type中的位置求得偏移量,再使用__mptr减去这个偏移量。那么这里的重点实际上并不在前面的typeof,而是在第三行的偏移。这样我们也可以通过一样的手段对他进行偏移,我们修改如下

#define container_of(ptr, type, member) ((type*)( ((int)ptr) – (int)(& (((type*)0)->member) )))
1
后段使用stm32 stddef.h中offsetof也是没有问题的

/* EDG uses __INTADDR__ to avoid errors when strict */
#define offsetof(t, memb) ((__CLIBNS size_t)__INTADDR__(&(((t *)0)->memb)))
1
2
大部分工作实际上基本做完了,这里还是把代码贴出来

#ifndef _RBTREES_H_
#define _RBTREES_H_
//#include “project.h”
#include <stddef.h>

/**
* list_entry – get the struct for this entry
* @ptr: the &struct list_head pointer.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*/
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

/**
* container_of – cast a member of a structure out to the containing structure
* @ptr: the pointer to the member.
* @type: the type of the container struct this is embedded in.
* @member: the name of the member within the struct.
*
*/
#undef offsetof
#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)

//#define container_of(ptr, type, member) ({\
// const typeof( ((type *)0)->member ) *__mptr = (ptr);\
// (type *)( (char *)__mptr – offsetof(type,member) );})

// Keil5 not used GUN C . The typeof keyword not support. so make the following modifications ¡ý
#define container_of(ptr, type, member) ((type*)( ((int)ptr) – (int)(& (((type*)0)->member) )))

#define rb_entry(ptr, type, member) container_of(ptr, type, member)

struct rb_node
{
unsigned long rb_parent_color;
#define RB_RED 0
#define RB_BLACK 1
struct rb_node *rb_right;
struct rb_node *rb_left;
} __attribute__((aligned(sizeof(long))));
/* The alignment might seem pointless, but allegedly CRIS needs it */

struct rb_root
{
struct rb_node *rb_node;
};

#define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
#define rb_color(r) ((r)->rb_parent_color & 1)
#define rb_is_red(r) (!rb_color(r))
#define rb_is_black(r) rb_color(r)
#define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0)
#define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0)

static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
{
rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p;
}
static inline void rb_set_color(struct rb_node *rb, int color)
{
rb->rb_parent_color = (rb->rb_parent_color & ~1) | color;
}

#define RB_ROOT (struct rb_root) { NULL, }
#define rb_entry(ptr, type, member) container_of(ptr, type, member)

#define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
#define RB_EMPTY_NODE(node) (rb_parent(node) == node)
#define RB_CLEAR_NODE(node) (rb_set_parent(node, node))

extern void rb_insert_color(struct rb_node *, struct rb_root *);
extern void rb_erase(struct rb_node *, struct rb_root *);

/* Find logical next and previous nodes in a tree */
extern struct rb_node *rb_next(struct rb_node *);
extern struct rb_node *rb_prev(struct rb_node *);
extern struct rb_node *rb_first(struct rb_root *);
extern struct rb_node *rb_last(struct rb_root *);

/* Fast replacement of a single node without remove/rebalance/add/rebalance */
extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
struct rb_root *root);

static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,
struct rb_node ** rb_link)
{
node->rb_parent_color = (unsigned long )parent;
node->rb_left = node->rb_right = NULL;

*rb_link = node;
}
#endif
/******************* (C) COPYRIGHT 2019 Doon****************END OF FILE****/

好了…那么库就基本算移植完了,接下来就是怎么生成这个棵树↓

struct dev_info{
int addr;
};

typedef struct user_rb_s
{
struct rb_node user_node;
struct dev_info dev_info;
}user_rb_t;

/**
*@des: create a user node of rbtrees
*/
user_rb_t *create_user_node(struct dev_info *dev_info ){
user_rb_t *node;
node = (user_rb_t *)malloc(sizeof(user_rb_t));
if(node == NULL)
return node;

memset(node, 0, sizeof(user_rb_t));
memcpy((char *)&node->dev_info,dev_info,sizeof(struct dev_info));
return node;
}

/**
*@des: insert a user node.
*/
int user_rb_insert( struct rb_root *root , struct dev_info *dev_info ){
struct rb_node **new = &(root->rb_node);
struct rb_node *parent = NULL;
user_rb_t *goal_node = NULL;
int res=0;

find_addr = dev_info->mac
while(*new){
parent = *new;
goal_node = rb_entry( *new , user_rb_t , user_node );
res = dev_info->addr – goal_node->addr

if( res < 0 ){
new = &(( *new )->rb_left);
}else if( res > 0 ){
new = &(( *new )->rb_right);
}else{
return 0;
}
}

goal_node = create_user_node( dev_info );
if( goal_node == NULL ){
return -1;
}

//add new node
rb_link_node( &goal_node->user_node , parent , new );
//rebalance rbtree
rb_insert_color( &goal_node->user_node , root );

return 0;
}

/**
*@des: find the user node.
*/
struct dev_info *user_rb_find( struct rb_root *root ,int addr ){
struct rb_node *node = root->rb_node;
user_rb_t *goal_node = NULL;
int res=0;

while(node){
goal_node = rb_entry( node , user_rb_t , user_node );
res = ( addr – goal_node->addr );
if( res < 0 )
node = node->rb_left;
else if( res > 0 )
node = node->rb_right;
else
return &goal_node->dev_info;
}
return NULL;
}

int user_rb_delete( struct rb_root *root , int addr ){
user_rb_t *goal_node;
// Here changed the return of rb find . so we should offset the struct
goal_node = rb_entry( user_rb_find( root , addr ) , user_rb_t , user_node );
if( goal_node != NULL ){
rb_erase( &goal_node->user_node , root );
myfree( SRAMIN , goal_node );
return 0;
}else{
return -1;
}
}

基本就可以使用了,因为没有带上硬件,这里没有办法给大家看仿真和程序是怎么走的,很久没有写博客,有点不知道怎么写了,前面感觉写得很啰嗦,后面就直接贴上代码了。这类树状结构在查询的时候效率还是相当高的,比起每次遍历,最大查询次数大大缩减了。
————————————————
版权声明:本文为CSDN博主「_Doon。」的原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接及本声明。
原文链接:https://blog.csdn.net/weixin_40952498/article/details/103213089

Mac OS 部署Avalonia+.Net Core项目

1. 简介

本文档介绍Windows下开发Avalonia项目、Mac OS下部署Avalonia项目。文档会涉及:Winows下基于VS2019开发Avalonia项目以及项目的发布打包、Mac电脑中的DMG文件制作、Mac下的程序文件的签名和公证。

2. Windows下开发Avalonia

2.1 环境部署

假设本机开发环境是Windows下使用VS2019.已具备基本的.NetCore开发环境,现在要做的就是部署AvaloniaUI框架。

对于使用Visual Studio 2017/2019的人来说,可以直接通过VS的Nuget程序包管理来安装Avalonia扩展,或者直接通过下面的下载地址下载后安装(此扩展不支持Visual Studio for Mac)

Avalonia下载地址是:https://marketplace.visualstudio.com/items?itemName=AvaloniaTeam.AvaloniaforVisualStudio

2.2 新建项目

在3.1中安装好Avalonia框架后,打开VS2019.在新建项目中会看到下面多出来的2个选择项:Avalonia MVVM Application和Avalonia Application.

在这里,我们选择”Avalonia Application“,命名为”TestApp“.创

项目创建后,是可以直接运行的。程序在Windows下的运行效果是:

第一次将项目发布到虚拟机中的Mac环境中运行,是会报错的。所以为了避免开发过程中踩坑。此处先提前处理该问题,等到发布后再讨论最终处理方案。打开文件”Program.cs“,找到方法BuildAvaloniaApp,加入下图红色方框中的代码即可。问题原因见下图的注释。

2.3 项目发布

打开项目文件”TestApp.csproj“,按照下图中的位置分别加入下面的 内容:

ItemGroup节点加:

<PackageReference Include=”Dotnet.Bundle” Version=”*” />
1
PropertyGroup节点加:

<CFBundleName>TestApp</CFBundleName> <!– Also defines .app file name –>
<CFBundleDisplayName>TestApp</CFBundleDisplayName>
<CFBundleIdentifier>com.laiger.ios</CFBundleIdentifier>
<CFBundleVersion>1.0.0</CFBundleVersion>
<CFBundlePackageType>AAPL</CFBundlePackageType>
<CFBundleSignature>????</CFBundleSignature>
<CFBundleExecutable>TestApp</CFBundleExecutable>
<CFBundleIconFile>TestApp.icns</CFBundleIconFile> <!– Will be copied from output directory –>
<CFBundleShortVersionString>1.0</CFBundleShortVersionString>
<NSPrincipalClass>NSApplication</NSPrincipalClass>
<NSHighResolutionCapable>true</NSHighResolutionCapable>
1
2
3
4
5
6
7
8
9
10
11
之后,可以通过在命令行上执行以下命令来发布项目:

dotnet restore -r osx-x64

dotnet msbuild -t:BundleApp -p:RuntimeIdentifier=osx-x64 -property:Configuration=Release
1
2
3
打开“命令提示符”窗口,先定位到 项目的目录。

下图的TestApp.app就是发布成功后的Mac下的程序执行文件,类似Windows下的exe文件.

主文件结构如下:

2.4 软件加密

软件程序的加密操作,我们使用加密软件.Net Reacter V6.3.0。工作方式是文件单独加密,也就是一个一个文件去加密。

打开加密软件.Net Reacter V6.3.0。按照如下图所示,选择TestApp.app文件中Contents目录下的MacOS里面需要的加密的dll文件,一般是加密公司研发的程序。

选择完需要加密的文件后,执行主菜单的Actions-Protect.即可加密

打开按钮“Browse Folder”,打开加密后的文件目录,将加密后的文件全部替换到 加密文件所在目录下。如TestApp.app/Contents/MacOS。

最后,删除此次加密文件的输出目录,例如“aa_Secure”文件夹,避免后续干扰。

上述介绍的是加密一个dll文件的情况,如果是需要加密多个dll文件。只需要按照上述步骤重复操作即可。

3. 项目打包

将3.3中的TestApp.app拷贝到虚拟机Mac系统中。先做一个执行权限的授权,让Mac系统识别这是一个可执行程序。

TestApp.app是在Windows上创建的,Mac系统并不能识别文件权限,先打开“终端”,终端打开方式是选择“启动台”,再选择里面的“其他”,具体见下图:

打开终端后,cd到TestApp.app的通同级目录。

执行下列语句授权即可。具体效果见下:

chmod +x TestApp.app/Contents/MacOS/TestApp
1
3.1 DMG制作

3.1.1 DMG简介

DMG,全称为disk image,即磁盘镜像文件。它是 Mac 应用软件通用的打包格式(相当于 ipa),相当于在Windows上常见的 iso文件。

3.1.2 DMG制作

1.打开 LaunchPad(启动台),选择“其他”,最后 选择 磁盘工具 ;

2.点击 磁盘工具的目录栏,选择 文件 — 新建映像 — 来自文件夹的映像

3.选择存放 .app 的文件夹。如我的:/Users/xxx/Desktop/TestApp,建议提前建立一个文件夹用来存放.app文件。

4.选择完后,点击”存储“ 就能马上生成TestApp.dmg文件。

3.1.3 DMG安装

直接将 DMG文件中的应用程序.app 拖曳至应用程序文件夹即可完成安装。

操作步骤是:先找到TestApp.dmg文件,双击打开TestApp.dmg。鼠标按住TestApp.app往左边的应用程序中拖动即可。

安装成功后,就能在启动台中看到

3.1.4 DMG卸载

方法一:直接在“应用程序中”中删除,鼠标右键”移到废纸篓“。如下图所示:

方法二:打开“终端工具”,cd 到 /Applications 目录下,删除应用(文件夹)即可。

4. 文件签名和公证

在个人Mac系统开发的应用软件,如果拷贝到其他Mac电脑中使用是会异常报错的。那为了解决这个问题,就需要用苹果的证书给程序做签名和公证。

从macOS 10.15(Catalina)开始,在应用程序商店外部分发的应用程序必须经过公证,并且您必须启用强化的运行时,并使用codesign在您的计算机给.app上运行签名才能成功进行公证。

4.1 环境条件

在进行签名之前,需要做一些工作,比如安装Xcode开发工具,用来实施签名。安装苹果开发者证书,用来调用苹果信息来签名。

Xcode可以直接去Mac App Store下载安装即可。关于苹果证书,需要先去苹果官网的开发者账户中创建“Developer ID Application”证书,证书申请后下载到本地发,双击打开安装后,见下图:

4.2 签名

1.首先,通过创建一个文件来启用带有例外的强化运行时MyAppEntitlements.entitlements

<?xml version=”1.0″ encoding=”UTF-8″?> <!DOCTYPE plist PUBLIC “-//Apple//DTD PLIST 1.0//EN” “http://www.apple.com/DTDs/PropertyList-1.0.dtd”> <plist version=”1.0″> <dict> <key>com.apple.security.cs.allow-jit</key> <true/> <key>com.apple.security.automation.apple-events</key> <true/> </dict> </plist>
1
2.新建 签名脚本 sign.sh

sign.sh中的APP_NAME、ENTITLEMENTS、SIGNING_IDENTITY的值都要按照实际情况去修改。

APP_NAME:是存放TestApp.app的路径。

ENTITLEMENTS:是MyAppEntitlements.entitlements文件的路径

SIGNING_IDENTITY:是苹果developer ID Application证书的相关信息。

#!/bin/basih
APP_NAME=”/Users/laiger/Downloads/laiger/TestApp.app”
ENTITLEMENTS=”/Users/laiger/Downloads/laiger/MyAppEntitlements.entitlements”
SIGNING_IDENTITY=”Developer ID Application: MeSince Technology Limited (99M3VBRE6Z)” # matches Keychain Access certificate name
find “$APP_NAME/Contents/MacOS/”|while read fname; do
if [[ -f $fname ]]; then
echo “[INFO] Signing $fname”
codesign –force –timestamp –options=runtime –entitlements “$ENTITLEMENTS” –sign “$SIGNING_IDENTITY” “$fname”
fi
done
echo “[INFO] Signing app file”
codesign –force –timestamp –options=runtime –entitlements “$ENTITLEMENTS” –sign “$SIGNING_IDENTITY” “$APP_NAME”
1
2
3
4
5
6
7
8
9
10
11
12
3.运行签名脚本 sign.sh

bash sign.sh
1
4.程序经过代码签名后,可以通过执行以下命令来验证它是否正确签名:

codesign –verify –verbose /Users/laiger/Downloads/laiger/TestApp.app
1
4.3 公证

1.确保TestApp.app的代码已正确签名
2.将TestApp.app压缩为.zip文件,如TestApp.zip,具体操作是:选中文件,鼠标右键选择” 压缩TestApp.app“。
3.运行

xcrun altool –notarize-app -f TestApp.zip –primary-bundle-id com.laiger.ios -u dev@laiger.com -p qazx-edvb-olkj-erty
1
如果上传成功,您将获得一个UUID作为请求令牌,如下所示:d12dbc36-75dd-4a9c-8f86-c60936a0d8b7
4.使用下列的命令来查询公证的状态信息,这个过程需要可能需要一些时间,所以我们要时不时的查询:

xcrun altool –notarization-info d12dbc36-75dd-4a9c-8f86-c60936a0d8b7 -u dev@laiger.com -p qazx-edvb-olkj-erty
1
如果查询到Status为“in progress”表示还处于公证的进展中,如果是“success”就是成功,其他就表示失败的情况。操作截图如下:

5.将应用程序TestApp.app删除,然后将TestApp.zip解压成TestApp.app. 具体操作:选中TestApp.app鼠标右键“移到废纸篓”,然后,选中TestApp.zip,鼠标双击即可解压。

6.如果第4步公证成功,则必须将公证书钉入应用程序.app.

xcrun stapler staple TestApp.app
1
可以通过运行下列命令,进行验证

xcrun stapler validate TestApp.app
1
注意:上述只是.app文件签名和公证。且帐号密码为真实信息。

公证完成后,可以将应用程序TestApp.app发给其他苹果电脑使用,这个文件其实就是执行文件,相当于Windows的exe文件。

将经过公证和装订(xcrun stapler)的应用程序TestApp.app按照第4节的方法打包成dmg文件,命名为TestApp.dmg。发给其他苹果电脑使用即可。

注意:此处删除了DMG文件公证的过程,Avalonia官网是介绍了DMG文件的公证方法,但是查询资料和实际测试证实DMG文件不需要公证,不进行公证的DMG文件也可以正常分发使用。具体解释如下:dmg的开发包不需要公证,Apple的Gatekeeper可以检测到DMG中的经过公证的.app文件,并且可以让用户正常打开App。
但如果里面是pkg文件也是一样的,只要通过公证即可。

5.总结

本文档介绍了Avalonia项目的发布、打包等。中间介绍了制作DMG文件的方法等。
————————————————
版权声明:本文为CSDN博主「wzl644」的原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接及本声明。
原文链接:https://blog.csdn.net/wzl644/article/details/108428806

Compile error:Didn’t find class “org.apache.http.client.methods.HttpPost”

在Android9.0系统上进行软件测试,出现错误异常Didn’t find class “org.apache.http.client.methods.HttpPost” on path: DexPathList[[zip file “/data/app/com.seaclouds.××××××-sry7fhYL6L_ZIuYAuBCiTw==/base.apk”],nativeLibraryDirectories=[/data/app/com.seaclouds.××××××-sry7fhYL6L_ZIuYAuBCiTw==/lib……..一大堆错误,主要还是9.0系统不兼容导致的,9.0默认不支持http.client的类了
在项目的AndroidManifest.xml的application添加以下代码

android:usesCleartextTraffic="true"
<uses-library android:name="org.apache.http.legacy" android:required="false" />

从android.support迁移到androidx及常见问题解决

前言 Google 2018 IO 大会推出了 Android新的扩展库 AndroidX,用于替换原来的 Android扩展库,将原来的android.替换成androidx.;只有包名和Maven工件名受到影响,原来的类名,方法名和字段名不会更改。官方早就推荐将support库迁移到androidx,因为后续support库不会再做更新。 迁移时只需要3.2版本及以上的android studio,在菜单refactor中点击migrate to androidx即可,该向导会提示需要做的更新。其中包括gradle版本至少3.2以上,compileSdkVersion 版本28以上。 1、常用依赖库对比 Continue reading

SenML传感器标记语言概要

转自 brookmil
https://blog.csdn.net/brookmill/article/details/52141147

“ML”和HTML、XML一样,都是”Markup Language”。前面的”Sen”来自Sensor,所以全名就是”Sensor Markup Language”。其实我觉得还不如就叫SensorML。为什么不叫SML呢?原来已经被占用了。

在IoT的潮流下,人民群众想要把传感器也都连入互联网。如果有一种标准的语言可以描述各行各业五花八门的所有传感器的数据,那当然是很方便的。SenML的编码结果可以作为HTTP或者CoAP的负载来传输。

SenML现在还在起草阶段,目前最新的版本是https://tools.ietf.org/html/draft-ietf-core-senml-02
最早是cisco一个叫jennings的帅锅一个人写的,后来陆续有其它公司的几个人加入。其中的Shelby和Bormann也参与了RFC7252(CoAP)的编写,可见两者有着紧密的联系。从历史记录来看,最早这个文档叫draft-jennings-senml,后来改名叫draft-jennings-core-senml,直到现在的draft-ietf-core-senml,中间一共有二十来个版本,不知道什么时候能成为正式的RFC。

Continue reading